WorldWideScience

Sample records for definition bit score

  1. Measurement of definite integral product of two more signals using two-bit ADCs

    Directory of Open Access Journals (Sweden)

    Ličina Boris

    2012-01-01

    Full Text Available This paper presents the two-bit stochastic converter theory of operation. This converter could be used for the precise measurement of the effective (root-mean-square value of voltage, current, electric power or energy and thus, could be applicable to grid measurements. The key contribution of this paper is the theoretical derivation of error limits when measuring signals using the stochastic method. Standard deviation of measured value over a specified measuring period is defined as an error. When finding expressions for the measured quantity and its error, time is treated as an independent uniform random variable; therefore, probability theory and statistical theory of samples can be applied. This condition is necessary because the presented problem is highly nonlinear and stochastic and thus, cannot be solved by the linear theory of discrete signals and systems, or by the theory of random processes. The presented solution is generalized in order to include the measurements of the definite integral of the product of a finite number of signals.

  2. Scoring ultrasound synovitis in rheumatoid arthritis: a EULAR-OMERACT ultrasound taskforce-Part 1: definition and development of a standardised, consensus-based scoring system.

    Science.gov (United States)

    D'Agostino, Maria-Antonietta; Terslev, Lene; Aegerter, Philippe; Backhaus, Marina; Balint, Peter; Bruyn, George A; Filippucci, Emilio; Grassi, Walter; Iagnocco, Annamaria; Jousse-Joulin, Sandrine; Kane, David; Naredo, Esperanza; Schmidt, Wolfgang; Szkudlarek, Marcin; Conaghan, Philip G; Wakefield, Richard J

    2017-01-01

    To develop a consensus-based ultrasound (US) definition and quantification system for synovitis in rheumatoid arthritis (RA). A multistep, iterative approach was used to: (1) evaluate the baseline agreement on defining and scoring synovitis according to the usual practice of different sonographers, using both grey-scale (GS) (synovial hypertrophy (SH) and effusion) and power Doppler (PD), by reading static images and scanning patients with RA and (2) evaluate the influence of both the definition and acquisition technique on reliability followed by a Delphi exercise to obtain consensus definitions for synovitis, elementary components and scoring system. Baseline reliability was highly variable but better for static than dynamic images that were directly acquired and immediately scored. Using static images, intrareader and inter-reader reliability for scoring PD were excellent for both binary and semiquantitative (SQ) grading but GS showed greater variability for both scoring systems (κ ranges: -0.05 to 1 and 0.59 to 0.92, respectively). In patient-based exercise, both intraobserver and interobserver reliability were variable and the mean κ coefficients did not reach 0.50 for any of the components. The second step resulted in refinement of the preliminary Outcome Measures in Rheumatology synovitis definition by including the presence of both hypoechoic SH and PD signal and the development of a SQ severity score, depending on both the amount of PD and the volume and appearance of SH. A multistep consensus-based process has produced a standardised US definition and quantification system for RA synovitis including combined and individual SH and PD components. Further evaluation is required to understand its performance before application in clinical trials.

  3. The OMERACT psoriatic arthritis magnetic resonance imaging scoring system (PsAMRIS): definitions of key pathologies, suggested MRI sequences, and preliminary scoring system for PsA Hands

    DEFF Research Database (Denmark)

    Østergaard, Mikkel; McQueen, Fiona; Wiell, Charlotte

    2009-01-01

    This article describes a preliminary OMERACT psoriatic arthritis magnetic resonance image scoring system (PsAMRIS) for evaluation of inflammatory and destructive changes in PsA hands, which was developed by the international OMERACT MRI in inflammatory arthritis group. MRI definitions of important...

  4. Comprehensive coronary risk determination in primary prevention: an imaging and clinical based definition combining computed tomographic coronary artery calcium score and national cholesterol education program risk score.

    Science.gov (United States)

    Nasir, Khurram; Vasamreddy, Chandra; Blumenthal, Roger S; Rumberger, John A

    2006-06-16

    Cardiovascular disease (CVD) is the leading cause of mortality and a major cause of morbidity. Coronary heart disease (CHD) accounts for nearly half of all CVD deaths. Currently estimation of risk in primary prevention is based on the Framingham risk equations, which inputs traditional risk factors and is helpful in predicting the development of CHD in asymptomatic individuals. However many individuals suffer events in the absence of established risk factors for atherosclerosis and broad based population risk estimations may have little precision when applied to a given individual. To meet the challenge of CHD risk assessment, several tools have been developed to identify atherosclerotic disease in its preclinical stages. This paper aims to incorporate information from coronary artery calcification (CAC) scoring from a computed tomographic "heartscan" (using Electron Beam Tomography (EBT) as the validated prototype) along with current Framingham risk profiling in order to refine risk on an absolute scale by combining imaging and clinical data to affect a more comprehensive calculation of absolute risk in a given individual. For CAC scores above the 75th percentile but or =55 years, women> or =65 years) a CAC = 0 will result in an age point score corresponding to the age-group whose median CAC score is zero i.e., 40-44 years for men and 55-59 years for women. The utilization of CAC scores allows the inclusion of sub-clinical disease definition into the context of modifiable risk factors as well as identifies high-risk individuals requiring aggressive treatment.

  5. Investigating the importance of Delaunay-based definition of atomic interactions in scoring of protein-protein docking results.

    Science.gov (United States)

    Jafari, Rahim; Sadeghi, Mehdi; Mirzaie, Mehdi

    2016-05-01

    The approaches taken to represent and describe structural features of the macromolecules are of major importance when developing computational methods for studying and predicting their structures and interactions. This study attempts to explore the significance of Delaunay tessellation for the definition of atomic interactions by evaluating its impact on the performance of scoring protein-protein docking prediction. Two sets of knowledge-based scoring potentials are extracted from a training dataset of native protein-protein complexes. The potential of the first set is derived using atomic interactions extracted from Delaunay tessellated structures. The potential of the second set is calculated conventionally, that is, using atom pairs whose interactions were determined by their separation distances. The scoring potentials were tested against two different docking decoy sets and their performances were compared. The results show that, if properly optimized, the Delaunay-based scoring potentials can achieve higher success rate than the usual scoring potentials. These results and the results of a previous study on the use of Delaunay-based potentials in protein fold recognition, all point to the fact that Delaunay tessellation of protein structure can provide a more realistic definition of atomic interaction, and therefore, if appropriately utilized, may be able to improve the accuracy of pair potentials.

  6. The implementation of bit-parallelism for DNA sequence alignment

    Science.gov (United States)

    Setyorini; Kuspriyanto; Widyantoro, D. H.; Pancoro, A.

    2017-05-01

    Dynamic Programming (DP) remain the central algorithm of biological sequence alignment. Matching score computation is the most time-consuming process. Bit-parallelism is one of approximate string matching techniques that transform DP matrix cell unit processing into word unit (groups of cell). Bit-parallelism computate the scores column-wise. Adopting from word processing in computer system work, this technique promise reducing time in score computing process in DP matrix. In this paper, we implement bit-parallelism technique for DNA sequence alignment. Our bit-parallelism implementation have less time for score computational process but still need improvement for there construction process.

  7. [A simple point score for definition of the risk of postoperative complications].

    Science.gov (United States)

    Grundmann, R; Papoulis, C

    1989-01-01

    During a 5-year-period we recorded prospectively 5,823 patients who had undergone general surgery and documented the postoperative complications as wound infection, pneumonia, reoperations and death. A score including all these complications was developed to evaluate the risk of an operation more exactly than using the wound infection rate alone. This method seems to provide a continuous monitoring and the comparison of the complication risks of certain operations within a quality assurance program. For gastric and colon surgery we found a correlation between postoperative antibiotic use and score, but not between score and postoperative hospitalization time.

  8. Multiple Sclerosis Questionnaire for Job Difficulties (MSQ-Job): definition of the cut-off score.

    Science.gov (United States)

    Schiavolin, Silvia; Giovannetti, Ambra Mara; Leonardi, Matilde; Brenna, Greta; Brambilla, Laura; Confalonieri, Paolo; Frangiamore, Rita; Mantegazza, Renato; Moscatelli, Marco; Clerici, Valentina Torri; Cortese, Francesca; Covelli, Venusia; Ponzio, Michela; Zaratin, Paola; Raggi, Alberto

    2016-05-01

    Multiple Sclerosis (MS) mainly affects people of working age. The Multiple Sclerosis Questionnaire for Job Difficulties (MSQ-Job) was designed to measure difficulties in work-related tasks. Our aim is to define cut-off score of MSQ-Job to identify potential critical situations that might require specific attention. A sample of patients with MS completed the MSQ-Job, WHODAS 2.0 and MSQOL-54 respectively for work difficulties, disability and health-related quality of life (HRQoL) evaluation. K-means Cluster Analysis was used to divide the sample in three groups on the basis of HRQoL and disability. ANOVA test was performed to compare the response pattern between these groups. The cut-off score was defined using the receiver operating characteristic (ROC) curve analyses for MSQ-Job total and count of MSQ-Job items scores ≥3: a score value corresponding to the maximum of the sensitivity-to-specificity ratio was chosen as the cut-off. Out of 180 patients enrolled, twenty were clustered in the higher severity group. The area under the ROC curve was 0.845 for the MSQ-Job total and 0.859 for the count of MSQ-Job items scores ≥3 while the cut-off score was 15.8 for MSQ-Job total and 8 for count of items scored ≥3. We recommend the use of MSQ-Job with this calculation as cut-off for identifying critical situations, e.g. in vocational rehabilitation services, where work-related difficulties have a significant impact in terms of lower quality of life and higher disability.

  9. Definition of the overall udder score for the Czech Fleckvieh Cattle

    Directory of Open Access Journals (Sweden)

    Josef Kučera

    2010-01-01

    Full Text Available Based on the linear type classification of 49 246 young cows of the Czech Fleckvieh breed the overall udder score was proposed. Calculation of the overall udder score is derived from the particular type traits, especially from those traits, where the optimal development is not scored by maximum. Cubic regression coefficients were used for recalculation and obtained a new scale for traits such as udder depth, teat length, teat thickness, teat position and teat placement. These re-calculated traits together with other particular traits described on the udder were combined to the model for overall udder score – model 1. In the model 2 the same proportion of the particular traits was used with restriction by extreme development of the udder dept, where two different levels of penalization (−3 and −6 points were used. Both models were compared with the current used system, where the x = 77.1, s = 5.22; for model 1 x = 84.94 (s = 2.65; for model 2 x = 84.40, s = 2.74. In both proposed models the distribution of the overall score for udder showed significantly smooth distribution, than in current system.The coefficient of correlation between current system and new proposals reached r = 0.799. Estimated breeding values for new models decreased from x = 0.199, s = 0.946 by the current used system, to x = 0.087 for model 1, x = 0.089 for model 2 respectively. Also the variability of the breeding values decreased. Estimated coefficients of heritability also decreased from 0.22 by the current system to 0.15 by the model 1 and 0.15 by the model 2, respectively.

  10. Polytrauma Defined by the New Berlin Definition: A Validation Test Based on Propensity-Score Matching Approach.

    Science.gov (United States)

    Rau, Cheng-Shyuan; Wu, Shao-Chun; Kuo, Pao-Jen; Chen, Yi-Chun; Chien, Peng-Chen; Hsieh, Hsiao-Yun; Hsieh, Ching-Hua

    2017-09-11

    Background: Polytrauma patients are expected to have a higher risk of mortality than that obtained by the summation of expected mortality owing to their individual injuries. This study was designed to investigate the outcome of patients with polytrauma, which was defined using the new Berlin definition, as cases with an Abbreviated Injury Scale (AIS) ≥ 3 for two or more different body regions and one or more additional variables from five physiologic parameters (hypotension [systolic blood pressure ≤ 90 mmHg], unconsciousness [Glasgow Coma Scale score ≤ 8], acidosis [base excess ≤ -6.0], coagulopathy [partial thromboplastin time ≥ 40 s or international normalized ratio ≥ 1.4], and age [≥70 years]). Methods: We retrieved detailed data on 369 polytrauma patients and 1260 non-polytrauma patients with an overall Injury Severity Score (ISS) ≥ 18 who were hospitalized between 1 January 2009 and 31 December 2015 for the treatment of all traumatic injuries, from the Trauma Registry System at a level I trauma center. Patients with burn injury or incomplete registered data were excluded. Categorical data were compared with two-sided Fisher exact or Pearson chi-square tests. The unpaired Student t-test and the Mann-Whitney U-test was used to analyze normally distributed continuous data and non-normally distributed data, respectively. Propensity-score matched cohort in a 1:1 ratio was allocated using the NCSS software with logistic regression to evaluate the effect of polytrauma on patient outcomes. Results: The polytrauma patients had a significantly higher ISS than non-polytrauma patients (median (interquartile range Q1-Q3), 29 (22-36) vs. 24 (20-25), respectively; p propensity score-matched pairs of polytrauma and non-polytrauma patients who showed no significant difference in sex, age, co-morbidity, AIS ≥ 3, and Injury Severity Score (ISS), the polytrauma patients had a significantly higher mortality rate (OR 17.5, 95% CI 4.21-72.76; p propensity-score

  11. Value of the SYNTAX score for periprocedural myocardial infarction according to WHO and the third universal definition of myocardial infarction: insights from the TWENTE trial

    NARCIS (Netherlands)

    Tandjung, K.; Tandjung, K.; Lam, M.K.; Sen, H.; de Man, F.H.; Louwerenburg, H.; Stoel, M.; van Houwelingen, G.; Linssen, G.; van der Palen, Jacobus Adrianus Maria; Doggen, Catharina Jacoba Maria; von Birgelen, Clemens

    2016-01-01

    Aims: The SYNTAX score is a tool to quantify the complexity of coronary artery disease. We investigated the relation between the SYNTAX score and the occurrence of a periprocedural myocardial infarction (PMI) according to the historical definition of the World Health Organization (WHO) and the

  12. Double acting bit holder

    Science.gov (United States)

    Morrell, Roger J.; Larson, David A.; Ruzzi, Peter L.

    1994-01-01

    A double acting bit holder that permits bits held in it to be resharpened during cutting action to increase energy efficiency by reducing the amount of small chips produced. The holder consist of: a stationary base portion capable of being fixed to a cutter head of an excavation machine and having an integral extension therefrom with a bore hole therethrough to accommodate a pin shaft; a movable portion coextensive with the base having a pin shaft integrally extending therefrom that is insertable in the bore hole of the base member to permit the moveable portion to rotate about the axis of the pin shaft; a recess in the movable portion of the holder to accommodate a shank of a bit; and a biased spring disposed in adjoining openings in the base and moveable portions of the holder to permit the moveable portion to pivot around the pin shaft during cutting action of a bit fixed in a turret to allow front, mid and back positions of the bit during cutting to lessen creation of small chip amounts and resharpen the bit during excavation use.

  13. Temperature-compensated 8-bit column driver for AMLCD

    Science.gov (United States)

    Dingwall, Andrew G. F.; Lin, Mark L.

    1995-06-01

    An all-digital, 5 V input, 50 Mhz bandwidth, 10-bit resolution, 128- column, AMLCD column driver IC has been designed and tested. The 10-bit design can enhance display definition over 6-bit nd 8-bit column drivers. Precision is realized with on-chip, switched-capacitor DACs plus transparently auto-offset-calibrated, opamp outputs. Increased resolution permits multiple 10-bit digital gamma remappings in EPROMs over temperature. Driver IC features include externally programmable number of output column, bi-directional digital data shifting, user- defined row/column/pixel/frame inversion, power management, timing control for daisy-chained column drivers, and digital bit inversion. The architecture uses fewer reference power supplies.

  14. OMERACT Rheumatoid Arthritis Magnetic Resonance Imaging Studies. Core set of MRI acquisitions, joint pathology definitions, and the OMERACT RA-MRI scoring system

    DEFF Research Database (Denmark)

    Østergaard, Mikkel; Peterfy, C; Conaghan, P

    2003-01-01

    This article describes the 2002 OMERACT rheumatoid arthritis magnetic resonance image scoring system (RAMRIS) for evaluation of inflammatory and destructive changes in RA hands and wrists, which was developed by an international MRI-OMERACT group. MRI definitions of important RA joint pathologies...

  15. Shengli Diamond Bits

    Institute of Scientific and Technical Information of China (English)

    Yang Yukun; Han Tao

    1995-01-01

    @@ The geologic condition of Shengli Oilfield (SLOF)is complicated and the range of the rock drillability is wide. For more than 20 years,Shengli Drilling Technology Research Institute, in view of the formation conditions of SLOF,has done a lot of effort and obtained many achivements in design,manufacturing technology and field service. Up to now ,the institute has developed several ten kinds of diamond bits applicable for drilling and coring in formations from extremely soft to hard.

  16. Two-Bit Bit Flipping Decoding of LDPC Codes

    CERN Document Server

    Nguyen, Dung Viet; Marcellin, Michael W

    2011-01-01

    In this paper, we propose a new class of bit flipping algorithms for low-density parity-check (LDPC) codes over the binary symmetric channel (BSC). Compared to the regular (parallel or serial) bit flipping algorithms, the proposed algorithms employ one additional bit at a variable node to represent its "strength." The introduction of this additional bit increases the guaranteed error correction capability by a factor of at least 2. An additional bit can also be employed at a check node to capture information which is beneficial to decoding. A framework for failure analysis of the proposed algorithms is described. These algorithms outperform the Gallager A/B algorithm and the min-sum algorithm at much lower complexity. Concatenation of two-bit bit flipping algorithms show a potential to approach the performance of belief propagation (BP) decoding in the error floor region, also at lower complexity.

  17. Evaluation of Bit Preservation Strategies

    DEFF Research Database (Denmark)

    Zierau, Eld; Kejser, Ulla Bøgvad; Kulovits, Hannes

    2010-01-01

    This article describes a methodology which supports evaluation of bit preservation strategies for different digital materials. This includes evaluation of alternative bit preservation solution. The methodology presented uses the preservation planning tool Plato for evaluations, and a BR......-ReMS prototype to calculate measures for how well bit preservation requirements are met. Planning storage of data as part of preservation planning involves classification of data with regard to requirements on confidentiality, bit safety, available and costs. Choice of storage with such parameters is quite...... complex since e.g. more copies of data means better bit safety, but higher cost and bigger risk of breaking confidentiality. Based on a case of a bit repository offering varied bit preservation solutions, the article will present results of using the methodology to make plans and choices of alternatives...

  18. Positional information, in bits.

    Science.gov (United States)

    Dubuis, Julien O; Tkacik, Gasper; Wieschaus, Eric F; Gregor, Thomas; Bialek, William

    2013-10-08

    Cells in a developing embryo have no direct way of "measuring" their physical position. Through a variety of processes, however, the expression levels of multiple genes come to be correlated with position, and these expression levels thus form a code for "positional information." We show how to measure this information, in bits, using the gap genes in the Drosophila embryo as an example. Individual genes carry nearly two bits of information, twice as much as would be expected if the expression patterns consisted only of on/off domains separated by sharp boundaries. Taken together, four gap genes carry enough information to define a cell's location with an error bar of ~1 along the anterior/posterior axis of the embryo. This precision is nearly enough for each cell to have a unique identity, which is the maximum information the system can use, and is nearly constant along the length of the embryo. We argue that this constancy is a signature of optimality in the transmission of information from primary morphogen inputs to the output of the gap gene network.

  19. Robust relativistic bit commitment

    Science.gov (United States)

    Chakraborty, Kaushik; Chailloux, André; Leverrier, Anthony

    2016-12-01

    Relativistic cryptography exploits the fact that no information can travel faster than the speed of light in order to obtain security guarantees that cannot be achieved from the laws of quantum mechanics alone. Recently, Lunghi et al. [Phys. Rev. Lett. 115, 030502 (2015), 10.1103/PhysRevLett.115.030502] presented a bit-commitment scheme where each party uses two agents that exchange classical information in a synchronized fashion, and that is both hiding and binding. A caveat is that the commitment time is intrinsically limited by the spatial configuration of the players, and increasing this time requires the agents to exchange messages during the whole duration of the protocol. While such a solution remains computationally attractive, its practicality is severely limited in realistic settings since all communication must remain perfectly synchronized at all times. In this work, we introduce a robust protocol for relativistic bit commitment that tolerates failures of the classical communication network. This is done by adding a third agent to both parties. Our scheme provides a quadratic improvement in terms of expected sustain time compared with the original protocol, while retaining the same level of security.

  20. Evaluation of Bit Preservation Strategies

    DEFF Research Database (Denmark)

    Zierau, Eld; Kejser, Ulla Bøgvad; Kulovits, Hannes

    2010-01-01

    This article describes a methodology which supports evaluation of bit preservation strategies for different digital materials. This includes evaluation of alternative bit preservation solution. The methodology presented uses the preservation planning tool Plato for evaluations, and a BR...... for different digital material with different requirements for bit integrity and confidentiality. This case shows that the methodology, including the tools used, is useful for this purpose....

  1. Hey! A Tarantula Bit Me!

    Science.gov (United States)

    ... it or try to play with it. These spiders will not bite you unless they feel threatened — if you leave them alone, they will leave you alone. For Teens For ... Stung Me! Hey! A Scorpion Stung Me! Hey! A Black Widow Spider Bit Me! Hey! A Brown Recluse Spider Bit ...

  2. Experimental unconditionally secure bit commitment

    Science.gov (United States)

    Liu, Yang; Cao, Yuan; Curty, Marcos; Liao, Sheng-Kai; Wang, Jian; Cui, Ke; Li, Yu-Huai; Lin, Ze-Hong; Sun, Qi-Chao; Li, Dong-Dong; Zhang, Hong-Fei; Zhao, Yong; Chen, Teng-Yun; Peng, Cheng-Zhi; Zhang, Qiang; Cabello, Adan; Pan, Jian-Wei

    2014-03-01

    Quantum physics allows unconditionally secure communication between parties that trust each other. However, when they do not trust each other such as in the bit commitment, quantum physics is not enough to guarantee security. Only when relativistic causality constraints combined, the unconditional secure bit commitment becomes feasible. Here we experimentally implement a quantum bit commitment with relativistic constraints that offers unconditional security. The commitment is made through quantum measurements in two quantum key distribution systems in which the results are transmitted via free-space optical communication to two agents separated with more than 20 km. Bits are successfully committed with less than 5 . 68 ×10-2 cheating probability. This provides an experimental proof of unconditional secure bit commitment and demonstrates the feasibility of relativistic quantum communication.

  3. Bit Preservation: A Solved Problem?

    Directory of Open Access Journals (Sweden)

    David S. H. Rosenthal

    2010-07-01

    Full Text Available For years, discussions of digital preservation have routinely featured comments such as “bit preservation is a solved problem; the real issues are ...”. Indeed, current digital storage technologies are not just astoundingly cheap and capacious, they are astonishingly reliable. Unfortunately, these attributes drive a kind of “Parkinson’s Law” of storage, in which demands continually push beyond the capabilities of systems implementable at an affordable price. This paper is in four parts:Claims, reviewing a typical claim of storage system reliability, showing that it provides no useful information for bit preservation purposes.Theory, proposing “bit half-life” as an initial, if inadequate, measure of bit preservation performance, expressing bit preservation requirements in terms of it, and showing that the requirements being placed on bit preservation systems are so onerous that the experiments required to prove that a solution exists are not feasible.Practice, reviewing recent research into how well actual storage systems preserve bits, showing that they fail to meet the requirements by many orders of magnitude.Policy, suggesting ways of dealing with this unfortunate situation.

  4. low bit rate video coding low bit rate video coding

    African Journals Online (AJOL)

    eobe

    ariable length bit rate (VLBR) broadly encompasses video coding which broadly encompasses ... for motion estimation and compensation to reduce the prediction sation to reduce the ... a special interest among the video coding community ...

  5. 美国2012年BIT范本中的投资定义条款及中国的对策研究∗%An Analysis of the Investment Definition Clause in 2012 US Model BIT and China’s Countermeasures

    Institute of Scientific and Technical Information of China (English)

    单文华; 王璐

    2013-01-01

    “投资”定义是适用投资条约保护和解决争端管辖争议的基础和前提。美国2012年BIT范本中对投资定义条款的规定延续了2004年范本的内容,主要特点在于其对“投资特征”的明确规定、以“企业”为基础的详细清单、没有“根据东道国法律”的要求,以及对“投资”和“涵盖投资”的平行定义。在比较中美两国BIT范本的基础上,作者认为,中美BIT可以原则接受“投资特征”的规定,以“法律实体”的概念代替“企业”的概念,同时保留“符合东道国法律法规”要求的规定。%The definition of“investment” is the key to define the scope of protection under international investment treaties and the legal basis of jurisdiction for investment arbitration. The “investment” definition clause in 2012 US model BIT is consistent with the former 2004 model BIT. The main features of the 2012 clause include an express stipulation of the“characteristics of investment”;an en-terprise-based list;an absence of“in accordance with host State’s law and regula-tions” requirement;and a paral el definition of both “investment” and “covered investment”. After comparing the model BITs of US and China, it is concluded that the US-China BIT could accept the“characteristic of investment” in principle with some technical revisions: adopting “legal entity” in place of the “enter-prise”, and retaining the “in accordance with host State’s laws and regulations”requirement.

  6. DRILL BITS FOR HORIZONTAL WELLS

    Directory of Open Access Journals (Sweden)

    Paolo Macini

    1996-12-01

    Full Text Available This paper underlines the importance of the correct drill bit application in horizontal wells. Afler the analysis of the peculiarities of horizontal wells and drainholes drilling techniques, advantages and disadvantages of the application of both roller cone and fixed cutters drill bits have been discussed. Also, a review of the potential specific featuries useful for a correct drill bit selection in horizontal small diameter holes has been highlighted. Drill bits for these special applications, whose importance is quickly increasing nowadays, should be characterised by a design capable to deliver a good penetration rate low WOB, and, at the same time, be able to withstand high RPM without premature cutting structure failure and undergauge. Formation properties will also determine the cutting structure type and the eventual specific features for additional gauge and shoulder protection.

  7. Hey! A Gnat Bit Me!

    Science.gov (United States)

    ... Hey! A Bee Stung Me! Rashes: The Itchy Truth Hey! A Mosquito Bit Me! Contact Us Print ... The Nemours Foundation, iStock, Getty Images, Corbis, Veer, Science Photo Library, Science Source Images, Shutterstock, and Clipart. ...

  8. Hey! A Louse Bit Me!

    Science.gov (United States)

    ... Hey! A Chigger Bit Me! Rashes: The Itchy Truth Contact Us Print Resources Send to a Friend ... The Nemours Foundation, iStock, Getty Images, Corbis, Veer, Science Photo Library, Science Source Images, Shutterstock, and Clipart. ...

  9. Hey! A Bedbug Bit Me!

    Science.gov (United States)

    ... Black Widow Spider Bit Me! Rashes: The Itchy Truth Contact Us Print Resources Send to a Friend ... The Nemours Foundation, iStock, Getty Images, Corbis, Veer, Science Photo Library, Science Source Images, Shutterstock, and Clipart. ...

  10. String bit models for superstring

    Energy Technology Data Exchange (ETDEWEB)

    Bergman, O.; Thorn, C.B.

    1995-12-31

    The authors extend the model of string as a polymer of string bits to the case of superstring. They mainly concentrate on type II-B superstring, with some discussion of the obstacles presented by not II-B superstring, together with possible strategies for surmounting them. As with previous work on bosonic string work within the light-cone gauge. The bit model possesses a good deal less symmetry than the continuous string theory. For one thing, the bit model is formulated as a Galilei invariant theory in (D {minus} 2) + 1 dimensional space-time. This means that Poincare invariance is reduced to the Galilei subgroup in D {minus} 2 space dimensions. Naturally the supersymmetry present in the bit model is likewise dramatically reduced. Continuous string can arise in the bit models with the formation of infinitely long polymers of string bits. Under the right circumstances (at the critical dimension) these polymers can behave as string moving in D dimensional space-time enjoying the full N = 2 Poincare supersymmetric dynamics of type II-B superstring.

  11. Rules for scoring respiratory events in sleep: update of the 2007 AASM Manual for the Scoring of Sleep and Associated Events. Deliberations of the Sleep Apnea Definitions Task Force of the American Academy of Sleep Medicine.

    Science.gov (United States)

    Berry, Richard B; Budhiraja, Rohit; Gottlieb, Daniel J; Gozal, David; Iber, Conrad; Kapur, Vishesh K; Marcus, Carole L; Mehra, Reena; Parthasarathy, Sairam; Quan, Stuart F; Redline, Susan; Strohl, Kingman P; Davidson Ward, Sally L; Tangredi, Michelle M

    2012-10-15

    The American Academy of Sleep Medicine (AASM) Sleep Apnea Definitions Task Force reviewed the current rules for scoring respiratory events in the 2007 AASM Manual for the Scoring and Sleep and Associated Events to determine if revision was indicated. The goals of the task force were (1) to clarify and simplify the current scoring rules, (2) to review evidence for new monitoring technologies relevant to the scoring rules, and (3) to strive for greater concordance between adult and pediatric rules. The task force reviewed the evidence cited by the AASM systematic review of the reliability and validity of scoring respiratory events published in 2007 and relevant studies that have appeared in the literature since that publication. Given the limitations of the published evidence, a consensus process was used to formulate the majority of the task force recommendations concerning revisions.The task force made recommendations concerning recommended and alternative sensors for the detection of apnea and hypopnea to be used during diagnostic and positive airway pressure (PAP) titration polysomnography. An alternative sensor is used if the recommended sensor fails or the signal is inaccurate. The PAP device flow signal is the recommended sensor for the detection of apnea, hypopnea, and respiratory effort related arousals (RERAs) during PAP titration studies. Appropriate filter settings for recording (display) of the nasal pressure signal to facilitate visualization of inspiratory flattening are also specified. The respiratory inductance plethysmography (RIP) signals to be used as alternative sensors for apnea and hypopnea detection are specified. The task force reached consensus on use of the same sensors for adult and pediatric patients except for the following: (1) the end-tidal PCO(2) signal can be used as an alternative sensor for apnea detection in children only, and (2) polyvinylidene fluoride (PVDF) belts can be used to monitor respiratory effort (thoracoabdominal

  12. Bits and q-bits as versatility measures

    Directory of Open Access Journals (Sweden)

    José R.C. Piqueira

    2004-06-01

    Full Text Available Using Shannon information theory is a common strategy to measure any kind of variability in a signal or phenomenon. Some methods were developed to adapt information entropy measures to bird song data trying to emphasize its versatility aspect. This classical approach, using the concept of bit, produces interesting results. Now, the original idea developed in this paper is to use the quantum information theory and the quantum bit (q-bit concept in order to provide a more complete vision of the experimental results.Usar a teoria da informação de Shannon é uma estratégia comum para medir todo tipo de variabilidade em um sinal ou fenômeno. Alguns métodos foram desenvolvidos para adaptar a medida de entropia informacional a dados de cantos de pássaro, tentando enfatizar seus aspectos de versatilidade. Essa abordagem clássica, usando o conceito de bit, produz resultados interessantes. Agora, a idéia original desenvolvida neste artigo é usar a teoria quântica da informação e o conceito de q-bit, com a finalidade de proporcionar uma visão mais completa dos resultados experimentais.

  13. A Holistic Approach to Bit Preservation

    DEFF Research Database (Denmark)

    Zierau, Eld Maj-Britt Olmütz

    2011-01-01

    This thesis presents three main results for a holistic approach to bit preservation, where the ultimate goal is to find the optimal bit preservation strategy for specific digital material that must be digitally preserved. Digital material consists of sequences of bits, where a bit is a binary dig...

  14. Chuanshi Brand Tri-cone Roller Bit

    Institute of Scientific and Technical Information of China (English)

    Chen Xilong; Shen Zhenzhong; Yuan Xiaoyi

    1997-01-01

    @@ Compared with other types of bits, the tri-cone roller bit has the advantages of excellent comprehensive performance, low price, wide usage range. It is free of formation limits. The tri-cone roller bit accounts for 90% of the total bits in use. The Chengdu Mechanical Works, as a major manufacturer of petroleum mechanical products and one of the four major tri-cone roller bit factories in China,has produced 120 types of bits in seven series and 19 sizes since 1967. The bits manufactured by the factory are not only sold to the domestic oilfields, but also exported to Japan, Thailand, Indonesia, the Philippines and the Middle East.

  15. The Wave Function It or Bit?

    CERN Document Server

    Zeh, H D

    2002-01-01

    Schroedinger's wave function shows many aspects of a state of incomplete knowledge or information ("bit"): (1) it is defined on a space of classical configurations, (2) its generic entanglement is, therefore, analogous to statistical correlations, and (3) it determines probabilites of measurement outcomes. Nonetheless, quantum superpositions (such as represented by a wave function) also define individual physical states ("it"). This conceptual dilemma may have its origin in the conventional operational foundation of physical concepts, successful in classical physics, but inappropriate in quantum theory because of the existence of mutually exclusive operations (used for the definition of concepts). In contrast, a hypothetical realism, based on concepts that are justified only by their universal and consistent applicability, favors the wave function as a description of (thus nonlocal) physical reality. The (conceptually local) classical world then appears as an illusion, facilitated by the phenomenon of decoher...

  16. Techniques of Very Low Bit-Rate Speech Coding1

    Institute of Scientific and Technical Information of China (English)

    CUIHuijuan; TANGKun; ZHAOMing; ZHANGXin

    2004-01-01

    Techniques of very low bit-rate speech coding,such as lower than 800 bps are presented in this paper. The techniques of multi-frame, multi-sub-band, multimodel, and vector quantization etc. are effective to decrease the bit-rate of vocoders based on a linear prediction model. These techniques bring the vocoder not only high quality of the reconstructed speech, but also robustness.Vocoders which apply those techniques can synthesize clear and intelligent speech with some naturalness. The mean DRT (Diagnostic rhyme test) score of an 800 bps vocoder is 89.2% and 86.3% for a 600 bps vocoder.

  17. Classification system adopted for fixed cutter bits

    Energy Technology Data Exchange (ETDEWEB)

    Winters, W.J.; Doiron, H.H.

    1988-01-01

    The drilling industry has begun adopting the 1987 International Association of Drilling Contractors' (IADC) method for classifying fixed cutter drill bits. By studying the classification codes on bit records and properly applying the new IADC fixed cutter dull grading system to recently run bits, the end-user should be able to improve the selection and usage of fixed cutter bits. Several users are developing databases for fixed cutter bits in an effort to relate field performance to some of the more prominent bit design characteristics.

  18. Flexible Bit Preservation on a National Basis

    DEFF Research Database (Denmark)

    Jurik, Bolette; Nielsen, Anders Bo; Zierau, Eld

    2012-01-01

    In this paper we present the results from The Danish National Bit Repository project. The project aim was establishment of a system that can offer flexible and sustainable bit preservation solutions to Danish cultural heritage institutions. Here the bit preservation solutions must include support...... of bit safety as well as other requirements like e.g. confidentiality and availability. The Danish National Bit Repository is motivated by the need to investigate and handle bit preservation for digital cultural heritage. Digital preservation relies on the integrity of the bits which digital material...... consists of, and it is with this focus that the project was initiated. This paper summarizes the requirements for a general system to offer bit preservation to cultural heritage institutions. On this basis the paper describes the resulting flexible system which can support such requirements. The paper...

  19. 24-Hour Relativistic Bit Commitment

    Science.gov (United States)

    Verbanis, Ephanielle; Martin, Anthony; Houlmann, Raphaël; Boso, Gianluca; Bussières, Félix; Zbinden, Hugo

    2016-09-01

    Bit commitment is a fundamental cryptographic primitive in which a party wishes to commit a secret bit to another party. Perfect security between mistrustful parties is unfortunately impossible to achieve through the asynchronous exchange of classical and quantum messages. Perfect security can nonetheless be achieved if each party splits into two agents exchanging classical information at times and locations satisfying strict relativistic constraints. A relativistic multiround protocol to achieve this was previously proposed and used to implement a 2-millisecond commitment time. Much longer durations were initially thought to be insecure, but recent theoretical progress showed that this is not so. In this Letter, we report on the implementation of a 24-hour bit commitment solely based on timed high-speed optical communication and fast data processing, with all agents located within the city of Geneva. This duration is more than 6 orders of magnitude longer than before, and we argue that it could be extended to one year and allow much more flexibility on the locations of the agents. Our implementation offers a practical and viable solution for use in applications such as digital signatures, secure voting and honesty-preserving auctions.

  20. A brief review on quantum bit commitment

    Science.gov (United States)

    Almeida, Álvaro J.; Loura, Ricardo; Paunković, Nikola; Silva, Nuno A.; Muga, Nelson J.; Mateus, Paulo; André, Paulo S.; Pinto, Armando N.

    2014-08-01

    In classical cryptography, the bit commitment scheme is one of the most important primitives. We review the state of the art of bit commitment protocols, emphasizing its main achievements and applications. Next, we present a practical quantum bit commitment scheme, whose security relies on current technological limitations, such as the lack of long-term stable quantum memories. We demonstrate the feasibility of our practical quantum bit commitment protocol and that it can be securely implemented with nowadays technology.

  1. A holistic approach to bit preservation

    DEFF Research Database (Denmark)

    Zierau, Eld

    2012-01-01

    Purpose: The purpose of this paper is to point out the importance of taking a holistic approach to bit preservation when setting out to find an optimal bit preservation solution for specific digital materials. In the last decade there has been an increasing awareness that bit preservation, which ...

  2. BIT BY BIT: A Game Simulating Natural Language Processing in Computers

    Science.gov (United States)

    Kato, Taichi; Arakawa, Chuichi

    2008-01-01

    BIT BY BIT is an encryption game that is designed to improve students' understanding of natural language processing in computers. Participants encode clear words into binary code using an encryption key and exchange them in the game. BIT BY BIT enables participants who do not understand the concept of binary numbers to perform the process of…

  3. b-Bit Minwise Hashing for Large-Scale Linear SVM

    CERN Document Server

    Li, Ping; Konig, Christian

    2011-01-01

    In this paper, we propose to (seamlessly) integrate b-bit minwise hashing with linear SVM to substantially improve the training (and testing) efficiency using much smaller memory, with essentially no loss of accuracy. Theoretically, we prove that the resemblance matrix, the minwise hashing matrix, and the b-bit minwise hashing matrix are all positive definite matrices (kernels). Interestingly, our proof for the positive definiteness of the b-bit minwise hashing kernel naturally suggests a simple strategy to integrate b-bit hashing with linear SVM. Our technique is particularly useful when the data can not fit in memory, which is an increasingly critical issue in large-scale machine learning. Our preliminary experimental results on a publicly available webspam dataset (350K samples and 16 million dimensions) verified the effectiveness of our algorithm. For example, the training time was reduced to merely a few seconds. In addition, our technique can be easily extended to many other linear and nonlinear machine...

  4. A Holistic Approach to Bit Preservation

    DEFF Research Database (Denmark)

    Zierau, Eld Maj-Britt Olmütz

    2011-01-01

    for confidentiality, availability, costs, additional to the requirements of ensuring bit safety. A few examples are: • The way that digital material is represented in files and structures has an influence on whether it is possible to interpret and use the bits at a later stage. Consequentially, the way bits represent....... • There will be requirements for the availability of the bit preserved digital material in order to meet requirements on use of the digital material, e.g. libraries often need to give fast access to preserved digital material to the public, i.e. the availability of the bit preserved material must support the use...

  5. Parity Bit Replenishment for JPEG 2000-Based Video Streaming

    Directory of Open Access Journals (Sweden)

    François-Olivier Devaux

    2009-01-01

    Full Text Available This paper envisions coding with side information to design a highly scalable video codec. To achieve fine-grained scalability in terms of resolution, quality, and spatial access as well as temporal access to individual frames, the JPEG 2000 coding algorithm has been considered as the reference algorithm to encode INTRA information, and coding with side information has been envisioned to refresh the blocks that change between two consecutive images of a video sequence. One advantage of coding with side information compared to conventional closed-loop hybrid video coding schemes lies in the fact that parity bits are designed to correct stochastic errors and not to encode deterministic prediction errors. This enables the codec to support some desynchronization between the encoder and the decoder, which is particularly helpful to adapt on the fly pre-encoded content to fluctuating network resources and/or user preferences in terms of regions of interest. Regarding the coding scheme itself, to preserve both quality scalability and compliance to the JPEG 2000 wavelet representation, a particular attention has been devoted to the definition of a practical coding framework able to exploit not only the temporal but also spatial correlation among wavelet subbands coefficients, while computing the parity bits on subsets of wavelet bit-planes. Simulations have shown that compared to pure INTRA-based conditional replenishment solutions, the addition of the parity bits option decreases the transmission cost in terms of bandwidth, while preserving access flexibility.

  6. Stability of single skyrmionic bits

    Science.gov (United States)

    Vedmedenko, Olena; Hagemeister, Julian; Romming, Niklas; von Bergmann, Kirsten; Wiesendanger, Roland

    The switching between topologically distinct skyrmionic and ferromagnetic states has been proposed as a bit operation for information storage. While long lifetimes of the bits are required for data storage devices, the lifetimes of skyrmions have not been addressed so far. Here we show by means of atomistic Monte Carlo simulations that the field-dependent mean lifetimes of the skyrmionic and ferromagnetic states have a high asymmetry with respect to the critical magnetic field, at which these lifetimes are identical. According to our calculations, the main reason for the enhanced stability of skyrmions is a different field dependence of skyrmionic and ferromagnetic activation energies and a lower attempt frequency of skyrmions rather than the height of energy barriers. We use this knowledge to propose a procedure for the determination of effective material parameters and the quantification of the Monte Carlo timescale from the comparison of theoretical and experimental data. Financial support from the DFG in the framework of the SFB668 is acknowledged.

  7. Bit threads and holographic entanglement

    CERN Document Server

    Freedman, Michael

    2016-01-01

    The Ryu-Takayanagi (RT) formula relates the entanglement entropy of a region in a holographic theory to the area of a corresponding bulk minimal surface. Using the max flow-min cut principle, a theorem from network theory, we rewrite the RT formula in a way that does not make reference to the minimal surface. Instead, we invoke the notion of a "flow", defined as a divergenceless norm-bounded vector field, or equivalently a set of Planck-thickness "bit threads". The entanglement entropy of a boundary region is given by the maximum flux out of it of any flow, or equivalently the maximum number of bit threads that can emanate from it. The threads thus represent entanglement between points on the boundary, and naturally implement the holographic principle. As we explain, this new picture clarifies several conceptual puzzles surrounding the RT formula. We give flow-based proofs of strong subadditivity and related properties; unlike the ones based on minimal surfaces, these proofs correspond in a transparent manner...

  8. Mourning in Bits and Stone

    DEFF Research Database (Denmark)

    Sabra, Jakob Borrits

    We mourn our dead, publicly and privately, online and offline. Cemeteries, web memorials and social network sites make up parts of todays intricately weaved and interrelated network of death, grief and memorialization practices [1]–[5]. Whether cut in stone or made of bits, graves, cemeteries, me...... and memorialization by discussing the publicly and privately digital and social death from a spatial, temporal, physical and digital angle. Further the paper will reflect on how to encompass shifting trends and technologies in ‘traditional’ spaces of mourning and remembrance.......We mourn our dead, publicly and privately, online and offline. Cemeteries, web memorials and social network sites make up parts of todays intricately weaved and interrelated network of death, grief and memorialization practices [1]–[5]. Whether cut in stone or made of bits, graves, cemeteries......, memorials, monuments, websites and social networking services (SNS) all are alterable, controllable and adaptive. They represent a certain rationale contrary to the emotive state of mourning (e.g. gravesites function as both spaces of internment and places of spiritual and emotional recollection). Following...

  9. Bit Threads and Holographic Entanglement

    Science.gov (United States)

    Freedman, Michael; Headrick, Matthew

    2016-11-01

    The Ryu-Takayanagi (RT) formula relates the entanglement entropy of a region in a holographic theory to the area of a corresponding bulk minimal surface. Using the max flow-min cut principle, a theorem from network theory, we rewrite the RT formula in a way that does not make reference to the minimal surface. Instead, we invoke the notion of a "flow", defined as a divergenceless norm-bounded vector field, or equivalently a set of Planck-thickness "bit threads". The entanglement entropy of a boundary region is given by the maximum flux out of it of any flow, or equivalently the maximum number of bit threads that can emanate from it. The threads thus represent entanglement between points on the boundary, and naturally implement the holographic principle. As we explain, this new picture clarifies several conceptual puzzles surrounding the RT formula. We give flow-based proofs of strong subadditivity and related properties; unlike the ones based on minimal surfaces, these proofs correspond in a transparent manner to the properties' information-theoretic meanings. We also briefly discuss certain technical advantages that the flows offer over minimal surfaces. In a mathematical appendix, we review the max flow-min cut theorem on networks and on Riemannian manifolds, and prove in the network case that the set of max flows varies Lipshitz continuously in the network parameters.

  10. In bits, bytes and stone

    DEFF Research Database (Denmark)

    Sabra, Jakob Borrits; Andersen, Hans Jørgen

    The digital spheres of Information and Communication Technologies (ICT) and Social Network Services (SNS) are influencing 21st. century death. Today the dying and the bereaved attend mourning and remembrance both online and offline. Combined, the cemeteries, web memorials and social network sites...... designs'. Urns, coffins, graves, cemeteries, memorials, monuments, websites, applications and software services, whether cut in stone or made of bits, are all influenced by discourses of publics, economics, power, technology and culture. Designers, programmers, stakeholders and potential end-users often...... do not recognize the need or potential of working with or using, specific 'death-services/products', since they find little or no comfort in contemplating, working or playing around with the concept of death and its life changing consequences. Especially not while being alive and well...

  11. FastBit Reference Manual

    Energy Technology Data Exchange (ETDEWEB)

    Wu, Kesheng

    2007-08-02

    An index in a database system is a data structure that utilizes redundant information about the base data to speed up common searching and retrieval operations. Most commonly used indexes are variants of B-trees, such as B+-tree and B*-tree. FastBit implements a set of alternative indexes call compressed bitmap indexes. Compared with B-tree variants, these indexes provide very efficient searching and retrieval operations by sacrificing the efficiency of updating the indexes after the modification of an individual record. In addition to the well-known strengths of bitmap indexes, FastBit has a special strength stemming from the bitmap compression scheme used. The compression method is called the Word-Aligned Hybrid (WAH) code. It reduces the bitmap indexes to reasonable sizes and at the same time allows very efficient bitwise logical operations directly on the compressed bitmaps. Compared with the well-known compression methods such as LZ77 and Byte-aligned Bitmap code (BBC), WAH sacrifices some space efficiency for a significant improvement in operational efficiency. Since the bitwise logical operations are the most important operations needed to answer queries, using WAH compression has been shown to answer queries significantly faster than using other compression schemes. Theoretical analyses showed that WAH compressed bitmap indexes are optimal for one-dimensional range queries. Only the most efficient indexing schemes such as B+-tree and B*-tree have this optimality property. However, bitmap indexes are superior because they can efficiently answer multi-dimensional range queries by combining the answers to one-dimensional queries.

  12. Stinger Enhanced Drill Bits For EGS

    Energy Technology Data Exchange (ETDEWEB)

    Durrand, Christopher J. [Novatek International, Inc., Provo, UT (United States); Skeem, Marcus R. [Novatek International, Inc., Provo, UT (United States); Crockett, Ron B. [Novatek International, Inc., Provo, UT (United States); Hall, David R. [Novatek International, Inc., Provo, UT (United States)

    2013-04-29

    The project objectives were to design, engineer, test, and commercialize a drill bit suitable for drilling in hard rock and high temperature environments (10,000 meters) likely to be encountered in drilling enhanced geothermal wells. The goal is provide a drill bit that can aid in the increased penetration rate of three times over conventional drilling. Novatek has sought to leverage its polycrystalline diamond technology and a new conical cutter shape, known as the Stinger®, for this purpose. Novatek has developed a fixed bladed bit, known as the JackBit®, populated with both shear cutter and Stingers that is currently being tested by major drilling companies for geothermal and oil and gas applications. The JackBit concept comprises a fixed bladed bit with a center indenter, referred to as the Jack. The JackBit has been extensively tested in the lab and in the field. The JackBit has been transferred to a major bit manufacturer and oil service company. Except for the attached published reports all other information is confidential.

  13. Bit-coded regular expression parsing

    DEFF Research Database (Denmark)

    Nielsen, Lasse; Henglein, Fritz

    2011-01-01

    Regular expression parsing is the problem of producing a parse tree of a string for a given regular expression. We show that a compact bit representation of a parse tree can be produced efficiently, in time linear in the product of input string size and regular expression size, by simplifying...... the DFA-based parsing algorithm due to Dub ´e and Feeley to emit the bits of the bit representation without explicitly materializing the parse tree itself. We furthermore show that Frisch and Cardelli’s greedy regular expression parsing algorithm can be straightforwardly modified to produce bit codings...

  14. A systematic literature review of US definitions, scoring systems and validity according to the OMERACT filter for tendon lesion in RA and other inflammatory joint diseases

    National Research Council Canada - National Science Library

    Alcalde, María; D'Agostino, Maria Antonietta; Bruyn, George A W; Möller, Ingrid; Iagnocco, Annamaria; Wakefield, Richard J; Naredo, Esperanza

    2012-01-01

    .... Data extraction focused on the definition and quantification of US-detected tenosynovitis and other tendon abnormalities and the metric properties of US according to the OMERACT filter for evaluating...

  15. A family of compatible single- and multimicroprocessor systems with 8-bit and 16-bit Microprocessors

    Energy Technology Data Exchange (ETDEWEB)

    Brzezinski, J.; Cellary, W.; Kreglewski, J.

    1984-10-01

    In the paper, a multimicroprocessor system for 8-bit and 16-bit microprocessors is presented. The main assumptions of the project of the presented system are discussed. Different single- and multimicroprocessor structures with 8-bit microprocessors are outlined. A detailed description of two single-board microcomputers and system aspects of different solutions are presented. Finally, an intelligent floppy disk controller is described.

  16. PERBANDINGAN APLIKASI MENGGUNAKAN METODE CAMELLIA 128 BIT KEY DAN 256 BIT KEY

    Directory of Open Access Journals (Sweden)

    Lanny Sutanto

    2014-01-01

    Full Text Available The rapid development of the Internet today to easily exchange data. This leads to high levels of risk in the data piracy. One of the ways to secure data is using cryptography camellia. Camellia is known as a method that has the encryption and decryption time is fast. Camellia method has three kinds of scale key is 128 bit, 192 bit, and 256 bit.This application is created using the C++ programming language and using visual studio 2010 GUI. This research compare the smallest and largest key size used on the file extension .Txt, .Doc, .Docx, .Jpg, .Mp4, .Mkv and .Flv. This application is made to comparing time and level of security in the use of 128-bit key and 256 bits. The comparison is done by comparing the results of the security value of avalanche effect 128 bit key and 256 bit key.

  17. Bit-string scattering theory

    Energy Technology Data Exchange (ETDEWEB)

    Noyes, H.P.

    1990-01-29

    We construct discrete space-time coordinates separated by the Lorentz-invariant intervals h/mc in space and h/mc{sup 2} in time using discrimination (XOR) between pairs of independently generated bit-strings; we prove that if this space is homogeneous and isotropic, it can have only 1, 2 or 3 spacial dimensions once we have related time to a global ordering operator. On this space we construct exact combinatorial expressions for free particle wave functions taking proper account of the interference between indistinguishable alternative paths created by the construction. Because the end-points of the paths are fixed, they specify completed processes; our wave functions are born collapsed''. A convenient way to represent this model is in terms of complex amplitudes whose squares give the probability for a particular set of observable processes to be completed. For distances much greater than h/mc and times much greater than h/mc{sup 2} our wave functions can be approximated by solutions of the free particle Dirac and Klein-Gordon equations. Using a eight-counter paradigm we relate this construction to scattering experiments involving four distinguishable particles, and indicate how this can be used to calculate electromagnetic and weak scattering processes. We derive a non-perturbative formula relating relativistic bound and resonant state energies to mass ratios and coupling constants, equivalent to our earlier derivation of the Bohr relativistic formula for hydrogen. Using the Fermi-Yang model of the pion as a relativistic bound state containing a nucleon-antinucleon pair, we find that (G{sub {pi}N}{sup 2}){sup 2} = (2m{sub N}/m{sub {pi}}){sup 2} {minus} 1. 21 refs., 1 fig.

  18. A holistic approach to bit preservation

    DEFF Research Database (Denmark)

    Zierau, Eld

    2012-01-01

    Purpose: The purpose of this paper is to point out the importance of taking a holistic approach to bit preservation when setting out to find an optimal bit preservation solution for specific digital materials. In the last decade there has been an increasing awareness that bit preservation, which...... preservation strategies as well as pointing to how such strategies can be evaluated. Research limitations/implications The operational results described here are still missing work to be fully operational. However, the holistic approach is in itself an important result. Furthermore, in spite...

  19. Conversion of an 8-bit to a 16-bit Soft-core RISC Processor

    Directory of Open Access Journals (Sweden)

    Ahmad Jamal Salim

    2013-03-01

    Full Text Available The demand for 8-bit processors nowadays is still going strong despite efforts by manufacturers in producing higher end microcontroller solutions to the mass market. Low-end processor offers a simple, low-cost and fast solution especially on I/O applications development in embedded system. However, due to architectural constraint, complex calculation could not be performed efficiently on 8-bit processor. This paper presents the conversion method from an 8-bit to a 16-bit Reduced Instruction Set Computer (RISC processor in a soft-core reconfigurable platform in order to extend its capability in handling larger data sets thus enabling intensive calculations process. While the conversion expands the data bus width to 16-bit, it also maintained the simple architecture design of an 8-bit processor.The expansion also provides more room for improvement to the processor’s performance. The modified architecture is successfully simulated in CPUSim together with its new instruction set architecture (ISA. Xilinx Virtex-6 platform is utilized to execute and verified the architecture. Results show that the modified 16-bit RISC architecture only required 17% more register slice on Field Programmable Gate Array (FPGA implementation which is a slight increase compared to the original 8-bit RISC architecture. A test program containing instruction sets that handle 16-bit data are also simulated and verified. As the 16-bit architecture is described as a soft-core, further modifications could be performed in order to customize the architecture to suit any specific applications.

  20. FastBit: Interactively Searching Massive Data

    Energy Technology Data Exchange (ETDEWEB)

    Wu, Kesheng; Ahern, Sean; Bethel, E. Wes; Chen, Jacqueline; Childs, Hank; Cormier-Michel, Estelle; Geddes, Cameron; Gu, Junmin; Hagen, Hans; Hamann, Bernd; Koegler, Wendy; Lauret, Jerome; Meredith, Jeremy; Messmer, Peter; Otoo, Ekow; Perevoztchikov, Victor; Poskanzer, Arthur; Prabhat,; Rubel, Oliver; Shoshani, Arie; Sim, Alexander; Stockinger, Kurt; Weber, Gunther; Zhang, Wei-Ming

    2009-06-23

    As scientific instruments and computer simulations produce more and more data, the task of locating the essential information to gain insight becomes increasingly difficult. FastBit is an efficient software tool to address this challenge. In this article, we present a summary of the key underlying technologies, namely bitmap compression, encoding, and binning. Together these techniques enable FastBit to answer structured (SQL) queries orders of magnitude faster than popular database systems. To illustrate how FastBit is used in applications, we present three examples involving a high-energy physics experiment, a combustion simulation, and an accelerator simulation. In each case, FastBit significantly reduces the response time and enables interactive exploration on terabytes of data.

  1. An optical ultrafast random bit generator

    Science.gov (United States)

    Kanter, Ido; Aviad, Yaara; Reidler, Igor; Cohen, Elad; Rosenbluh, Michael

    2010-01-01

    The generation of random bit sequences based on non-deterministic physical mechanisms is of paramount importance for cryptography and secure communications. High data rates also require extremely fast generation rates and robustness to external perturbations. Physical generators based on stochastic noise sources have been limited in bandwidth to ~100 Mbit s-1 generation rates. We present a physical random bit generator, based on a chaotic semiconductor laser, having time-delayed self-feedback, which operates reliably at rates up to 300 Gbit s-1. The method uses a high derivative of the digitized chaotic laser intensity and generates the random sequence by retaining a number of the least significant bits of the high derivative value. The method is insensitive to laser operational parameters and eliminates the necessity for all external constraints such as incommensurate sampling rates and laser external cavity round trip time. The randomness of long bit strings is verified by standard statistical tests.

  2. Bit Loading Algorithms for Cooperative OFDM Systems

    Directory of Open Access Journals (Sweden)

    Bo Gui

    2007-12-01

    Full Text Available We investigate the resource allocation problem for an OFDM cooperative network with a single source-destination pair and multiple relays. Assuming knowledge of the instantaneous channel gains for all links in the entire network, we propose several bit and power allocation schemes aiming at minimizing the total transmission power under a target rate constraint. First, an optimal and efficient bit loading algorithm is proposed when the relay node uses the same subchannel to relay the information transmitted by the source node. To further improve the performance gain, subchannel permutation, in which the subchannels are reallocated at relay nodes, is considered. An optimal subchannel permutation algorithm is first proposed and then an efficient suboptimal algorithm is considered to achieve a better complexity-performance tradeoff. A distributed bit loading algorithm is also proposed for ad hoc networks. Simulation results show that significant performance gains can be achieved by the proposed bit loading algorithms, especially when subchannel permutation is employed.

  3. Bit Loading Algorithms for Cooperative OFDM Systems

    Directory of Open Access Journals (Sweden)

    Gui Bo

    2008-01-01

    Full Text Available Abstract We investigate the resource allocation problem for an OFDM cooperative network with a single source-destination pair and multiple relays. Assuming knowledge of the instantaneous channel gains for all links in the entire network, we propose several bit and power allocation schemes aiming at minimizing the total transmission power under a target rate constraint. First, an optimal and efficient bit loading algorithm is proposed when the relay node uses the same subchannel to relay the information transmitted by the source node. To further improve the performance gain, subchannel permutation, in which the subchannels are reallocated at relay nodes, is considered. An optimal subchannel permutation algorithm is first proposed and then an efficient suboptimal algorithm is considered to achieve a better complexity-performance tradeoff. A distributed bit loading algorithm is also proposed for ad hoc networks. Simulation results show that significant performance gains can be achieved by the proposed bit loading algorithms, especially when subchannel permutation is employed.

  4. The Braid-Based Bit Commitment Protocol

    Institute of Scientific and Technical Information of China (English)

    WANG Li-cheng; CAO Zhen-fu; CAO Feng; QIAN Hai-feng

    2006-01-01

    With recent advances of quantum computation, new threats have closed in upon to the classical public key cryptosystems. In order to build more secure bit commitment schemes, this paper gave a survey of the new coming braid-based cryptography and then brought forward the first braid-based bit commitment protocol. The security proof manifests that the proposed protocol is computationally binding and information-theoretically hiding.Furthermore, the proposed protocol is also invulnerable to currently known quantum attacks.

  5. Neural network implementation using bit streams.

    Science.gov (United States)

    Patel, Nitish D; Nguang, Sing Kiong; Coghill, George G

    2007-09-01

    A new method for the parallel hardware implementation of artificial neural networks (ANNs) using digital techniques is presented. Signals are represented using uniformly weighted single-bit streams. Techniques for generating bit streams from analog or multibit inputs are also presented. This single-bit representation offers significant advantages over multibit representations since they mitigate the fan-in and fan-out issues which are typical to distributed systems. To process these bit streams using ANNs concepts, functional elements which perform summing, scaling, and squashing have been implemented. These elements are modular and have been designed such that they can be easily interconnected. Two new architectures which act as monotonically increasing differentiable nonlinear squashing functions have also been presented. Using these functional elements, a multilayer perceptron (MLP) can be easily constructed. Two examples successfully demonstrate the use of bit streams in the implementation of ANNs. Since every functional element is individually instantiated, the implementation is genuinely parallel. The results clearly show that this bit-stream technique is viable for the hardware implementation of a variety of distributed systems and for ANNs in particular.

  6. Apgar score

    Science.gov (United States)

    ... this page: //medlineplus.gov/ency/article/003402.htm Apgar score To use the sharing features on this page, ... birth. Virginia Apgar, MD (1909-1974) introduced the Apgar score in 1952. How the Test is Performed The ...

  7. Development and definition of a simplified scanning procedure and scoring method for Haemophilia Early Arthropathy Detection with Ultrasound (HEAD-US).

    Science.gov (United States)

    Martinoli, Carlo; Della Casa Alberighi, Ornella; Di Minno, Giovanni; Graziano, Ermelinda; Molinari, Angelo Claudio; Pasta, Gianluigi; Russo, Giuseppe; Santagostino, Elena; Tagliaferri, Annarita; Tagliafico, Alberto; Morfini, Massimo

    2013-06-01

    The aim of this study was to develop a simplified ultrasound scanning procedure and scoring method, named Haemophilia Early Arthropathy Detection with UltraSound [HEAD-US], to evaluate joints of patients with haemophilic arthropathy. After an initial consensus-based process involving a multidisciplinary panel of experts, three comprehensive and evidence-based US scanning procedures to image the elbow, knee and ankle were established with the aim to increase sensitivity in detection of early signs of joint involvement while keeping the technique easy and quick to perform. Each procedure included systematic evaluation of synovial recesses and selection of a single osteochondral surface for damage analysis. Based on expert consensus, a simplified scoring system based on an additive scale was created to define the joint status and, in perspective, to offer a tool to evaluate disease progression and monitor the result of treatment in follow-up studies.

  8. Time to Definitive Health-Related Quality of Life Score Deterioration in Patients with Resectable Metastatic Colorectal Cancer Treated with FOLFOX4 versus Sequential Dose-Dense FOLFOX7 followed by FOLFIRI: The MIROX Randomized Phase III Trial.

    Directory of Open Access Journals (Sweden)

    Zeinab Hamidou

    Full Text Available We previously showed that a sequential chemotherapy with dose-dense oxaliplatin (FOLFOX7 and irinotecan (FOLFIRI; irinotecan plus 5-fluorouracil/leucovorin is not superior to FOLFOX4 in patients at advanced stage of colorectal cancer with liver metastases. Here we aimed to determine whether time to health-related quality of life (HRQoL score definitive deterioration (TUDD differs by study arm.HRQoL was evaluated using the European Organization for Research and Treatment of Cancer (EORTC QLQ-C30 at baseline and every 4 cycles until the end of the study or death. Functional scale, symptom scale, global health status, and financial difficulties were analyzed. The TUDD was defined as the time interval between randomization and the first decrease in HRQoL score ≥ 5-point with no further improvement in HRQoL score ≥ 5 points or any further HRQoL data. TUDD was estimated using the Kaplan-Meier method and the long-rank test. Cox regression analyses were used to identify HRQoL items influencing TUDD. Sensitivity analyses were done using a multiple imputation method and different definitions of TUDD.Of the 284 patients, 171 (60.2% completed HRQoL questionnaires. Cox multivariate analysis showed no statistically significant difference in TUDD for most of the QLQ-C30 scales between treatments. Patients with dyspnea and those without symptoms at baseline had a significantly longer TUDD when there was a delay >12 months between diagnosis of the primary tumor and metastases (HR 0.48 [0.26-0.89] and when there was diarrhea (HR 0.59 [0.36-0.96], respectively.This study shows that TUDD does not differ significantly according to type of treatment. The TUDD method produces meaningful longitudinal HRQoL results that may facilitate effective clinical decision making in patients with mCRC.ClinicalTrials.gov NCT00268398.

  9. Low complexity bit loading algorithm for OFDM system

    Institute of Scientific and Technical Information of China (English)

    Yang Yu; Sha Xuejun; Zhang Zhonghua

    2006-01-01

    A new approach to loading for orthogonal frequency division multiplexing (OFDM) system is proposed, this bit-loading algorithm assigns bits to different subchannels in order to minimize the transmit energy. In the algorithm,first most bit are allocated to each subchannels according to channel condition, Shannon formula and QoS require of the user, then the residual bit are allocated to the subchannels bit by bit. In this way the algorithm is efficient while calculation is less complex. This is the first time to load bits with the scale following Shannon formula and the algorithm is of O (4N) complexity.

  10. Ultra low bit-rate speech coding

    CERN Document Server

    Ramasubramanian, V

    2015-01-01

    "Ultra Low Bit-Rate Speech Coding" focuses on the specialized topic of speech coding at very low bit-rates of 1 Kbits/sec and less, particularly at the lower ends of this range, down to 100 bps. The authors set forth the fundamental results and trends that form the basis for such ultra low bit-rates to be viable and provide a comprehensive overview of various techniques and systems in literature to date, with particular attention to their work in the paradigm of unit-selection based segment quantization. The book is for research students, academic faculty and researchers, and industry practitioners in the areas of speech processing and speech coding.

  11. Bit-padding information guided channel hopping

    KAUST Repository

    Yang, Yuli

    2011-02-01

    In the context of multiple-input multiple-output (MIMO) communications, we propose a bit-padding information guided channel hopping (BP-IGCH) scheme which breaks the limitation that the number of transmit antennas has to be a power of two based on the IGCH concept. The proposed scheme prescribes different bit-lengths to be mapped onto the indices of the transmit antennas and then uses padding technique to avoid error propagation. Numerical results and comparisons, on both the capacity and the bit error rate performances, are provided and show the advantage of the proposed scheme. The BP-IGCH scheme not only offers lower complexity to realize the design flexibility, but also achieves better performance. © 2011 IEEE.

  12. Protected Polycrystalline Diamond Compact Bits For Hard Rock Drilling

    Energy Technology Data Exchange (ETDEWEB)

    Robert Lee Cardenas

    2000-10-31

    Two bits were designed. One bit was fabricated and tested at Terra-Tek's Drilling Research Laboratory. Fabrication of the second bit was not completed due to complications in fabrication and meeting scheduled test dates at the test facility. A conical bit was tested in a Carthage Marble (compressive strength 14,500 psi) and Sierra White Granite (compressive strength 28,200 psi). During the testing, Hydraulic Horsepower, Bit Weight, Rotation Rate, were varied for the Conical Bit, a Varel Tricone Bit and Varel PDC bit. The Conical Bi did cut rock at a reasonable rate in both rocks. Beneficial effects from the near and through cutter water nozzles were not evident in the marble due to test conditions and were not conclusive in the granite due to test conditions. At atmospheric drilling, the Conical Bit's penetration rate was as good as the standard PDC bit and better than the Tricone Bit. Torque requirements for the Conical Bit were higher than that required for the Standard Bits. Spudding the conical bit into the rock required some care to avoid overloading the nose cutters. The nose design should be evaluated to improve the bit's spudding characteristics.

  13. Apgar Scores

    Science.gov (United States)

    ... Stages Listen Español Text Size Email Print Share Apgar Scores Page Content Article Body As soon as your ... the syringe, but is blue; her one minute Apgar score would be 8—two points off because she ...

  14. Linear, Constant-rounds Bit-decomposition

    DEFF Research Database (Denmark)

    Reistad, Tord; Toft, Tomas

    2010-01-01

    When performing secure multiparty computation, tasks may often be simple or difficult depending on the representation chosen. Hence, being able to switch representation efficiently may allow more efficient protocols. We present a new protocol for bit-decomposition: converting a ring element x ∈ ℤ M...

  15. 1 /N perturbations in superstring bit models

    Science.gov (United States)

    Thorn, Charles B.

    2016-03-01

    We develop the 1 /N expansion for stable string bit models, focusing on a model with bit creation operators carrying only transverse spinor indices a =1 ,…,s . At leading order (N =∞ ), this model produces a (discretized) light cone string with a "transverse space" of s Grassmann worldsheet fields. Higher orders in the 1 /N expansion are shown to be determined by the overlap of a single large closed chain (discretized string) with two smaller closed chains. In the models studied here, the overlap is not accompanied with operator insertions at the break/join point. Then, the requirement that the discretized overlap has a smooth continuum limit leads to the critical Grassmann "dimension" of s =24 . This "protostring," a Grassmann analog of the bosonic string, is unusual, because it has no large transverse dimensions. It is a string moving in one space dimension, and there are neither tachyons nor massless particles. The protostring, derived from our pure spinor string bit model, has 24 Grassmann dimensions, 16 of which could be bosonized to form 8 compactified bosonic dimensions, leaving 8 Grassmann dimensions—the worldsheet content of the superstring. If the transverse space of the protostring could be "decompactified," string bit models might provide an appealing and solid foundation for superstring theory.

  16. Reinforcement Learning in BitTorrent Systems

    CERN Document Server

    Izhak-Ratzin, Rafit; van der Schaar, Mihaela

    2010-01-01

    Recent research efforts have shown that the popular BitTorrent protocol does not provide fair resource reciprocation and may allow free-riding. In this paper, we propose a BitTorrent-like protocol that replaces the peer selection mechanisms in the regular BitTorrent protocol with a novel reinforcement learning (RL) based mechanism. Due to the inherent opration of P2P systems, which involves repeated interactions among peers over a long period of time, the peers can efficiently identify free-riders as well as desirable collaborators by learning the behavior of their associated peers. Thus, it can help peers improve their download rates and discourage free-riding, while improving fairness in the system. We model the peers' interactions in the BitTorrent-like network as a repeated interaction game, where we explicitly consider the strategic behavior of the peers. A peer, which applies the RL-based mechanism, uses a partial history of the observations on associated peers' statistical reciprocal behaviors to deter...

  17. Hey! A Mosquito Bit Me! (For Kids)

    Science.gov (United States)

    ... or Too Short All About Puberty Hey! A Mosquito Bit Me! KidsHealth > For Kids > Hey! A Mosquito ... español ¡Ay! ¡Me picó un mosquito! What's a Mosquito? A mosquito (say: mus-KEE-toe) is an ...

  18. Bit corruption correlation and autocorrelation in a stochastic binary nano-bit system

    Science.gov (United States)

    Sa-nguansin, Suchittra

    2014-10-01

    The corruption process of a binary nano-bit model resulting from an interaction with N stochastically-independent Brownian agents (BAs) is studied with the help of Monte-Carlo simulations and analytic continuum theory to investigate the data corruption process through the measurement of the spatial two-point correlation and the autocorrelation of bit corruption at the origin. By taking into account a more realistic correlation between bits, this work will contribute to the understanding of the soft error or the corruption of data stored in nano-scale devices.

  19. Perbandingan Kecepatan Pencacahan Antara Timer 0 (8 Bit Dengan Timer 1 (16 Bit Pada Sistem Mikrokontroler

    Directory of Open Access Journals (Sweden)

    Arief Hendra Saptadi

    2011-11-01

    Full Text Available The application of timer/counter in microcontroller system had provided advantages in a way that it didn’t put the burden on CPU resources and enabled CPU to perform other tasks. With the availability of 8-bit and 16-bit timer/counter, the problem laid on the selection of the type of timer/counter being used. From the experiments performed, the minimum system of AVR ATmega8535 microcontroller had precisely counted a number using two different timers/counters, namely, Timer/Counter 0 (8 bit and Timer/Counter 1 (16 bit. The overflow condition achieved on 8-bit and 16-bit counting cycle activated OCR0 and OCR1AL registers, respectively. Output signals from port B.3 (OC0 and port D.5 (OC1A  are then fed to oscilloscope and put into comparison. From the observation of output signals, it could be proven that the two different timers/counters had equal counting speed. Hence, it can be concluded that the selection of timers/counters is more likely based on the flexibility of count range, program size and execution time

  20. Time to Definitive Health-Related Quality of Life Score Deterioration in Patients with Resectable Metastatic Colorectal Cancer Treated with FOLFOX4 versus Sequential Dose-Dense FOLFOX7 followed by FOLFIRI: The MIROX Randomized Phase III Trial

    Science.gov (United States)

    Hamidou, Zeinab; Chibaudel, Benoist; Hebbar, Mohamed; Hug de Larauze, Marine; André, Thierry; Louvet, Christophe; Brusquant, David; Garcia-Larnicol, Marie-Line; de Gramont, Aimery; Bonnetain, Franck

    2016-01-01

    Purpose We previously showed that a sequential chemotherapy with dose-dense oxaliplatin (FOLFOX7) and irinotecan (FOLFIRI; irinotecan plus 5-fluorouracil/leucovorin) is not superior to FOLFOX4 in patients at advanced stage of colorectal cancer with liver metastases. Here we aimed to determine whether time to health-related quality of life (HRQoL) score definitive deterioration (TUDD) differs by study arm. Methods HRQoL was evaluated using the European Organization for Research and Treatment of Cancer (EORTC) QLQ-C30 at baseline and every 4 cycles until the end of the study or death. Functional scale, symptom scale, global health status, and financial difficulties were analyzed. The TUDD was defined as the time interval between randomization and the first decrease in HRQoL score ≥ 5-point with no further improvement in HRQoL score ≥ 5 points or any further HRQoL data. TUDD was estimated using the Kaplan-Meier method and the long-rank test. Cox regression analyses were used to identify HRQoL items influencing TUDD. Sensitivity analyses were done using a multiple imputation method and different definitions of TUDD. Results Of the 284 patients, 171 (60.2%) completed HRQoL questionnaires. Cox multivariate analysis showed no statistically significant difference in TUDD for most of the QLQ-C30 scales between treatments. Patients with dyspnea and those without symptoms at baseline had a significantly longer TUDD when there was a delay >12 months between diagnosis of the primary tumor and metastases (HR 0.48 [0.26–0.89]) and when there was diarrhea (HR 0.59 [0.36–0.96]), respectively. Conclusion This study shows that TUDD does not differ significantly according to type of treatment. The TUDD method produces meaningful longitudinal HRQoL results that may facilitate effective clinical decision making in patients with mCRC. Trial Registration ClinicalTrials.gov NCT00268398 PMID:27310205

  1. Global Networks of Trade and Bits

    CERN Document Server

    Riccaboni, Massimo; Schiavo, Stefano

    2012-01-01

    Considerable efforts have been made in recent years to produce detailed topologies of the Internet. Although Internet topology data have been brought to the attention of a wide and somewhat diverse audience of scholars, so far they have been overlooked by economists. In this paper, we suggest that such data could be effectively treated as a proxy to characterize the size of the "digital economy" at country level and outsourcing: thus, we analyse the topological structure of the network of trade in digital services (trade in bits) and compare it with that of the more traditional flow of manufactured goods across countries. To perform meaningful comparisons across networks with different characteristics, we define a stochastic benchmark for the number of connections among each country-pair, based on hypergeometric distribution. Original data are thus filtered by means of different thresholds, so that we only focus on the strongest links, i.e., statistically significant links. We find that trade in bits displays...

  2. Acquisition and Retaining Granular Samples via a Rotating Coring Bit

    Science.gov (United States)

    Bar-Cohen, Yoseph; Badescu, Mircea; Sherrit, Stewart

    2013-01-01

    This device takes advantage of the centrifugal forces that are generated when a coring bit is rotated, and a granular sample is entered into the bit while it is spinning, making it adhere to the internal wall of the bit, where it compacts itself into the wall of the bit. The bit can be specially designed to increase the effectiveness of regolith capturing while turning and penetrating the subsurface. The bit teeth can be oriented such that they direct the regolith toward the bit axis during the rotation of the bit. The bit can be designed with an internal flute that directs the regolith upward inside the bit. The use of both the teeth and flute can be implemented in the same bit. The bit can also be designed with an internal spiral into which the various particles wedge. In another implementation, the bit can be designed to collect regolith primarily from a specific depth. For that implementation, the bit can be designed such that when turning one way, the teeth guide the regolith outward of the bit and when turning in the opposite direction, the teeth will guide the regolith inward into the bit internal section. This mechanism can be implemented with or without an internal flute. The device is based on the use of a spinning coring bit (hollow interior) as a means of retaining granular sample, and the acquisition is done by inserting the bit into the subsurface of a regolith, soil, or powder. To demonstrate the concept, a commercial drill and a coring bit were used. The bit was turned and inserted into the soil that was contained in a bucket. While spinning the bit (at speeds of 600 to 700 RPM), the drill was lifted and the soil was retained inside the bit. To prove this point, the drill was turned horizontally, and the acquired soil was still inside the bit. The basic theory behind the process of retaining unconsolidated mass that can be acquired by the centrifugal forces of the bit is determined by noting that in order to stay inside the interior of the bit, the

  3. Jianghan PDC Bits Open Good Market in Singapore

    Institute of Scientific and Technical Information of China (English)

    Wang Tongliang

    1995-01-01

    @@ The PDC bits produced by PDC Division,Jianghan Drill Bit Plant won good reputation,because of its good quality and appearance in 94 South-east Asia Offshore Petroleum Engineering Product Exhibition held by Singapore International Exhibition Center.

  4. 2-bit Flip Mutation Elementary Fitness Landscapes

    OpenAIRE

    Langdon, William

    2010-01-01

    Genetic Programming parity is not elementary. GP parity cannot be represented as the sum of a small number of elementary landscapes. Statistics, including fitness distance correlation, of Parity's fitness landscape are calculated. Using Walsh analysis the eigen values and eigenvectors of the Laplacian of the two bit flip fitness landscape are given and a ruggedness measure for elementary landscapes is proposed. An elementary needle in a haystack (NIH) landscape is g...

  5. Blind One-Bit Compressive Sampling

    Science.gov (United States)

    2013-01-17

    notation and recalling some background from convex analysis . For the d-dimensional Euclidean space Rd, the class of all lower semicontinuous convex...compressed sensing, Applied and Computational Harmonic Analysis , 27 (2009), pp. 265 – 274. [3] P. T. Boufounos and R. G. Baraniuk, 1-bit compressive sensing...Convergence analysis of the algorithm is presented. Our approach is to obtain a sequence of optimization problems by successively approximating the ℓ0

  6. Rate Control for MPEG-4 Bit Stream

    Institute of Scientific and Technical Information of China (English)

    王振洲; 李桂苓

    2003-01-01

    For a very long time video processing dealt exclusively with fixed-rate sequences of rectangular shaped images. However, interest has been recently moving toward a more flexible concept in which the subject of the processing and encoding operations is a set of visual elements organized in both time and space in a flexible and arbitrarily complex way. The moving picture experts group (MPEG-4) standard supports this concept and its verification model (VM) encoder has adopted scalable rate control (SRC) as the rate control scheme, which is based on the spatial domain and compatible with constant bit rate (CBR) and variable bit rate (VBR). In this paper,a new rate control algorithm based on the DCT domain instead of the pixel domain is presented. More-over, macroblock level rate control scheme to compute the quantization step for each macroblock has been adopted. The experimental results show that the new algorithm can achieve a much better result than the original one in both peak signal-to-noise ratio (PSNR) and the coding bits, and that the new algorithm is more flexible than test model 5 (TM5) rate control algorithm.

  7. NSC 800, 8-bit CMOS microprocessor

    Science.gov (United States)

    Suszko, S. F.

    1984-01-01

    The NSC 800 is an 8-bit CMOS microprocessor manufactured by National Semiconductor Corp., Santa Clara, California. The 8-bit microprocessor chip with 40-pad pin-terminals has eight address buffers (A8-A15), eight data address -- I/O buffers (AD(sub 0)-AD(sub 7)), six interrupt controls and sixteen timing controls with a chip clock generator and an 8-bit dynamic RAM refresh circuit. The 22 internal registers have the capability of addressing 64K bytes of memory and 256 I/O devices. The chip is fabricated on N-type (100) silicon using self-aligned polysilicon gates and local oxidation process technology. The chip interconnect consists of four levels: Aluminum, Polysi 2, Polysi 1, and P(+) and N(+) diffusions. The four levels, except for contact interface, are isolated by interlevel oxide. The chip is packaged in a 40-pin dual-in-line (DIP), side brazed, hermetically sealed, ceramic package with a metal lid. The operating voltage for the device is 5 V. It is available in three operating temperature ranges: 0 to +70 C, -40 to +85 C, and -55 to +125 C. Two devices were submitted for product evaluation by F. Stott, MTS, JPL Microprocessor Specialist. The devices were pencil-marked and photographed for identification.

  8. 1/N Perturbations in Superstring Bit Models

    CERN Document Server

    Thorn, Charles B

    2015-01-01

    We develop the 1/N expansion for stable string bit models, focusing on a model with bit creation operators carrying only transverse spinor indices a=1,...,s. At leading order (1/N=0), this model produces a (discretized) lightcone string with a "transverse space' of $s$ Grassmann worldsheet fields. Higher orders in the 1/N expansion are shown to be determined by the overlap of a single large closed chain (discretized string) with two smaller closed chains. In the models studied here, the overlap is not accompanied with operator insertions at the break/join point. Then the requirement that the discretized overlap have a smooth continuum limit leads to the critical Grassmann "dimension" of s=24. This "protostring", a Grassmann analog of the bosonic string, is unusual, because it has no large transverse dimensions. It is a string moving in one space dimension and there are neither tachyons nor massless particles. The protostring, derived from our pure spinor string bit model, has 24 Grassmann dimensions, 16 of wh...

  9. Verilog Implementation of 32-Bit CISC Processor

    Directory of Open Access Journals (Sweden)

    P.Kanaka Sirisha

    2016-04-01

    Full Text Available The Project deals with the design of the 32-Bit CISC Processor and modeling of its components using Verilog language. The Entire Processor uses 32-Bit bus to deal with all the registers and the memories. This Processor implements various arithmetic, logical, Data Transfer operations etc., using variable length instructions, which is the core property of the CISC Architecture. The Processor also supports various addressing modes to perform a 32-Bit instruction. Our Processor uses Harvard Architecture (i.e., to have a separate program and data memory and hence has different buses to negotiate with the Program Memory and Data Memory individually. This feature enhances the speed of our processor. Hence it has two different Program Counters to point to the memory locations of the Program Memory and Data Memory.Our processor has ‘Instruction Queuing’ which enables it to save the time needed to fetch the instruction and hence increases the speed of operation. ‘Interrupt Service Routine’ is provided in our Processor to make it address the Interrupts.

  10. Score Correlation

    OpenAIRE

    Fabián, Z. (Zdeněk)

    2010-01-01

    In this paper, we study a distribution-dependent correlation coefficient based on the concept of scalar score. This new measure of association of continuous random variables is compared by means of simulation experiments with the Pearson, Kendall and Spearman correlation coefficients.

  11. Reversible n-Bit to n-Bit Integer Haar-Like Transforms

    Energy Technology Data Exchange (ETDEWEB)

    Senecal, J; Duchaineau, M; Joy, K I

    2003-11-03

    We introduce a wavelet-like transform similar to the Haar transform, but with the properties that it packs the results into the same number of bits as the original data, and is reversible. Our method, called TLHaar, uses table lookups to replace the averaging, differencing, and bit shifting performed in a Haar IntegerWavelet Transform (IWT). TLHaar maintains the same coefficient magnitude relationships for the low- and high-pass coefficients as true Haar, but reorders them to fit into the same number of bits as the input signal, thus eliminating the sign bit that is added to the Haar IWT output coefficients. Eliminating the sign bit avoids using extra memory and speeds the transform process. We tested TLHaar on a variety of image types, and when compared to the Haar IWT TLHaar is significantly faster. For image data with lines or hard edges TLHaar coefficients compress better than those of the Haar IWT. Due to its speed TLHaar is suitable for streaming hardware implementations with fixed data sizes, such as DVI channels.

  12. A novel bit-quad-based Euler number computing algorithm.

    Science.gov (United States)

    Yao, Bin; He, Lifeng; Kang, Shiying; Chao, Yuyan; Zhao, Xiao

    2015-01-01

    The Euler number of a binary image is an important topological property in computer vision and pattern recognition. This paper proposes a novel bit-quad-based Euler number computing algorithm. Based on graph theory and analysis on bit-quad patterns, our algorithm only needs to count two bit-quad patterns. Moreover, by use of the information obtained during processing the previous bit-quad, the average number of pixels to be checked for processing a bit-quad is only 1.75. Experimental results demonstrated that our method outperforms significantly conventional Euler number computing algorithms.

  13. A novel bit-quad-based Euler number computing algorithm

    OpenAIRE

    Yao, Bin; He, Lifeng; Kang, Shiying; Chao, Yuyan; Xiao ZHAO

    2015-01-01

    The Euler number of a binary image is an important topological property in computer vision and pattern recognition. This paper proposes a novel bit-quad-based Euler number computing algorithm. Based on graph theory and analysis on bit-quad patterns, our algorithm only needs to count two bit-quad patterns. Moreover, by use of the information obtained during processing the previous bit-quad, the average number of pixels to be checked for processing a bit-quad is only 1.75. Experimental results ...

  14. Adaptive Power and Bit Allocation in Multicarrier Systems

    Institute of Scientific and Technical Information of China (English)

    HUO Yong-qing; PENG Qi-cong; SHAO Huai-zong

    2007-01-01

    We present two adaptive power and bit allocation algorithms for multicarrier systems in a frequency selective fading environment. One algorithm allocates bit based on maximizing the channel capacity, another allocates bit based on minimizing the bit-error-rate(BER). Two algorithms allocate power based on minimizing the BER. Results show that the proposed algorithms are more effective than Fischer's algorithm at low average signal-to-noise ration (SNR). This indicates that our algorithms can achieve high spectral efficiency and high communication reliability during bad channel state. Results also denote the bit and power allocation of each algorithm and effects of the number of subcarriers on the BER performance.

  15. 比特产品的相关问题研究%Research on Bit-product Related Questions

    Institute of Scientific and Technical Information of China (English)

    朱珠; 舒华英

    2012-01-01

    综合分析已有文献的内容,认为目前的研究主要涉及比特产品的相关概念与分类、比特产品的特性、比特产品的供求规律和交换规律、比特产品的定价策略、比特产品的市场结构特征、比特产品的知识产权保护等问题,探讨了当前比特产品研究存在的问题和未来研究的重点。主要采用文献综述法,总结已有文献的研究结论并发现其中的不足,如,比特产品与服务概念的混淆以及比特产品在生产、交换、消费过程中呈现出的新规律等,为进一步的研究做铺垫。%With the rapid development of internet and the advent of bit-economy era,a large number of bit-products have been produced,which has enriched the content of the product and has changed the product definition and characteristics in traditional economy.The research on bit-product has aroused great interest in recent years.This paper by comprehensively analyzing the contents of the existing literature and elaborates that current study involves the concept of bit-product and its classification,bit-product features,bit-product supply and demand and exchange rules,bit-product pricing strategy,bit-product market structure features,bit-product intellectual property protection and other issues,and also discusses the limitations of current bit-product research and the implications of future research.This paper summarizes the deficiencies of existing researches,such as the confusion between the concept of bit-produce and service,and bit-product new laws in the process of production,exchange,consumption.The results will lay the foundation for further research.

  16. Video Synchronization With Bit-Rate Signals and Correntropy Function

    Directory of Open Access Journals (Sweden)

    Igor Pereira

    2017-09-01

    Full Text Available We propose an approach for the synchronization of video streams using correntropy. Essentially, the time offset is calculated on the basis of the instantaneous transfer rates of the video streams that are extracted in the form of a univariate signal known as variable bit-rate (VBR. The state-of-the-art approach uses a window segmentation strategy that is based on consensual zero-mean normalized cross-correlation (ZNCC. This strategy has an elevated computational complexity, making its application to synchronizing online data streaming difficult. Hence, our proposal uses a different window strategy that, together with the correntropy function, allows the synchronization to be performed for online applications. This provides equivalent synchronization scores with a rapid offset determination as the streams come into the system. The efficiency of our approach has been verified through experiments that demonstrate its viability with values that are as precise as those obtained by ZNCC. The proposed approach scored 81 % in time reference classification against the equivalent 81 % of the state-of-the-art approach, requiring much less computational power.

  17. 8 Bit RISC Processor Using Verilog HDL

    Directory of Open Access Journals (Sweden)

    Ramandeep Kaur

    2014-03-01

    Full Text Available RISC is a design philosophy to reduce the complexity of instruction set that in turn reduces the amount of space, cycle time, cost and other parameters taken into account during the implementation of the design. The advent of FPGA has enabled the complex logical systems to be implemented on FPGA. The intent of this paper is to design and implement 8 bit RISC processor using FPGA Spartan 3E tool. This processor design depends upon design specification, analysis and simulation. It takes into consideration very simple instruction set. The momentous components include Control unit, ALU, shift registers and accumulator register.

  18. Where the "it from bit" come from?

    CERN Document Server

    Foschini, Luigi

    2013-01-01

    In his 1989 essay, John Archibald Wheeler has tried to answer the eternal question of existence. He did it by searching for links between information, physics, and quanta. The main concept emerging from his essay is that "every physical quantity, every it, derives its ultimate significance from bits, binary yes-or-no indications". This concept has been summarized in the catchphrase "it from bit". In the Wheeler's essay, it is possible to read several times the echoes of the philosophy of Niels Bohr. The Danish physicist has pointed out how the quantum and relativistic physics - forcing us to abandon the anchor of the visual reference of common sense - have imposed a greater attention to the language. Bohr did not deny the physical reality, but recognizes that there is always need of a language no matter what a person wants to do. To put it as Carlo Sini, language is the first toolbox that man has at hands to analyze the experience. It is not a thought translated into words, because to think is to operate with...

  19. Digital word width reducing system for PCM video signal processing - feeds less significant bits to one-bit coder and then combined with more significant bits

    NARCIS (Netherlands)

    unknown

    1991-01-01

    Abstract of NL 8902368 (A) The system converts a PCM input signal. It has a series of digital words, each K bits long at a predetermined repetition frequency converted into a PCM output signal (16) comprising a series of digital words each L bits long, where L is less than K. The system includes a

  20. Wavelets as q-bits and q-bit states as wavelets

    OpenAIRE

    Steblinski, Pawel; Blachowicz, Tomasz

    2009-01-01

    In this short report it is argued that by the use of wavelets formalism it is possible to describe the q-bit state. The wavelet formalism address the real-valued physical signals, for example, obtained during typical physical measurements.

  1. Fetal Biophysical Profile Scoring

    Directory of Open Access Journals (Sweden)

    H.R. HaghighatKhah

    2009-01-01

    Full Text Available   "nFetal biophysical profile scoring is a sonographic-based method of fetal assessment first described by Manning and Platt in 1980. "nThe biophysical profile score was developed as a method to integrate real-time observations of the fetus and his/her intrauterine environment in order to more comprehensively assess the fetal condition. These findings must be evaluated in the context of maternal/fetal history (i.e., chronic hypertension, post-dates, intrauterine growth restriction, etc, fetal structural integrity (presence or absence of congenital anomalies, and the functionality of fetal support structures (placental and umbilical cord. For example, acute asphyxia due to placental abruption may result in an absence of the acute variables of the biophysical profile score (fetal breathing movements, fetal movement, fetal tone, and fetal heart rate reactivity with a normal amniotic fluid volume. With post maturity the asphyxial event may be intermittent and chronic resulting in a decrease in amniotic fluid volume, but with the acute variables remaining normal. "nWhile the 5 components of the biophysical profile score have remained unchanged since 1980 (Manning, 1980, the definitions of a normal and abnormal parameter have evolved with increasing experience. "nIn 1984 the definition of oligohydramnios was increased from < 1cm pocket of fluid to < 2.0 x 1.0 cm pocket. Oligohydramnios is now defined as a pocket of amniotic fluid < 2.0 x 2.0 cm (Manning, 1995a "nIf the four ultrasound variables are normal, the accuracy of the biophysical profile score was not found to be significantly improved by adding the non-stress test. As a result, in 1987 the profile score was modified to incorporate the non-stress test only when one of the ultrasound variables was abnormal (Manning 1987. Table 1 outlines the current definitions for quantifying a variable as present or absent. "nEach of the 5 components of the biophysical profile score does not have equal

  2. Efficient Algorithms for Optimal 4-Bit Reversible Logic System Synthesis

    Directory of Open Access Journals (Sweden)

    Zhiqiang Li

    2013-01-01

    Full Text Available Owing to the exponential nature of the memory and run-time complexity, many methods can only synthesize 3-bit reversible circuits and cannot synthesize 4-bit reversible circuits well. We mainly absorb the ideas of our 3-bit synthesis algorithms based on hash table and present the efficient algorithms which can construct almost all optimal 4-bit reversible logic circuits with many types of gates and at mini-length cost based on constructing the shortest coding and the specific topological compression; thus, the lossless compression ratio of the space of n-bit circuits reaches near 2×n!. This paper presents the first work to create all 3120218828 optimal 4-bit reversible circuits with up to 8 gates for the CNT (Controlled-NOT gate, NOT gate, and Toffoli gate library, and it can quickly achieve 16 steps through specific cascading created circuits.

  3. Optimization of Bit Plane Combination for Efficient Digital Image Watermarking

    CERN Document Server

    Kejgir, Sushma

    2009-01-01

    In view of the frequent multimedia data transfer authentication and protection of images has gained importance in todays world. In this paper we propose a new watermarking technique, based on bit plane, which enhances robustness and capacity of the watermark, as well as maintains transparency of the watermark and fidelity of the image. In the proposed technique, higher strength bit plane of digital signature watermark is embedded in to a significant bit plane of the original image. The combination of bit planes (image and watermark) selection is an important issue. Therefore, a mechanism is developed for appropriate bit plane selection. Ten different attacks are selected to test different alternatives. These attacks are given different weightings as appropriate to user requirement. A weighted correlation coefficient for retrieved watermark is estimated for each of the alternatives. Based on these estimated values optimal bit plane combination is identified for a given user requirement. The proposed method is ...

  4. Cross Institutional Cooperation on a Shared Bit Repository

    DEFF Research Database (Denmark)

    Zierau, Eld; Kejser, Ulla Bøgvad

    2013-01-01

    This paper explores how independent institutions, such as archives and libraries, can cooperate on managing a shared bit repository with bit preservation, in order to use their resources for preservation in a more cost-effective way. It uses the OAIS Reference Model to provide a framework...... for systematically analysing institutions technical and organisational requirements for a remote bit repository. Instead of viewing a bit repository simply as Archival Storage for the institutions repositories, we argue for viewing it as consisting of a subset of functions from all entities defined by the OAIS...... Reference Model. The work is motivated by and used in a current Danish feasibility study for establishing a national bit repository. The study revealed that depending on their missions and the collections they hold, the institutions have varying requirements e.g. for bit safety, accessibility...

  5. Cross Institutional Cooperation on a Shared Bit Repository

    DEFF Research Database (Denmark)

    Zierau, Eld; Kejser, Ulla Bøgvad

    2010-01-01

    for systematically analysing the technical and organizational requirements of institutions for a remote bit repository. Instead of viewing a bit repository simply as Archival Storage for the institutions’ repositories, we argue for viewing it as consisting of a subset of functions from all entities defined...... architecture and its strengths in being flexible in order to offer differentiated services with respect to, among other things, bit safety and cost. Furthermore, the challenges in formulating various aspects, such as risk requirements, are described....

  6. Development and testing of a Mudjet-augmented PDC bit.

    Energy Technology Data Exchange (ETDEWEB)

    Black, Alan (TerraTek, Inc.); Chahine, Georges (DynaFlow, Inc.); Raymond, David Wayne; Matthews, Oliver (Security DBS); Grossman, James W.; Bertagnolli, Ken (US Synthetic); Vail, Michael (US Synthetic)

    2006-01-01

    This report describes a project to develop technology to integrate passively pulsating, cavitating nozzles within Polycrystalline Diamond Compact (PDC) bits for use with conventional rig pressures to improve the rock-cutting process in geothermal formations. The hydraulic horsepower on a conventional drill rig is significantly greater than that delivered to the rock through bit rotation. This project seeks to leverage this hydraulic resource to extend PDC bits to geothermal drilling.

  7. Gravitational Entropy and String Bits on the Stretched Horizon

    CERN Document Server

    Halyo, E

    2003-01-01

    We show that the entropy of Schwarzschild black holes in any dimension can be described by a gas of free string bits at the stretched horizon. The number of string bits is equal to the black hole entropy and energy dependent. For an asymptotic observer the bit gas is at the Hawking temperature. We show that the same description is also valid for de Sitter space--times in any dimension.

  8. Bit Patterned Magnetic Recording: Theory, Media Fabrication, and Recording Performance

    OpenAIRE

    Albrecht, Thomas R.; Arora, Hitesh; Ayanoor-Vitikkate, Vipin; Beaujour, Jean-Marc; Bedau, Daniel; Berman, David; Bogdanov, Alexei L.; Chapuis, Yves-Andre; Cushen, Julia; Dobisz, Elizabeth E.; Doerk, Gregory; Gao, He; Grobis, Michael; Gurney, Bruce; Hanson, Weldon

    2015-01-01

    Bit Patterned Media (BPM) for magnetic recording provide a route to densities $>1 Tb/in^2$ and circumvents many of the challenges associated with conventional granular media technology. Instead of recording a bit on an ensemble of random grains, BPM uses an array of lithographically defined isolated magnetic islands, each of which stores one bit. Fabrication of BPM is viewed as the greatest challenge for its commercialization. In this article we describe a BPM fabrication method which combine...

  9. Bit-Optimal Lempel-Ziv compression

    CERN Document Server

    Ferragina, Paolo; Venturini, Rossano

    2008-01-01

    One of the most famous and investigated lossless data-compression scheme is the one introduced by Lempel and Ziv about 40 years ago. This compression scheme is known as "dictionary-based compression" and consists of squeezing an input string by replacing some of its substrings with (shorter) codewords which are actually pointers to a dictionary of phrases built as the string is processed. Surprisingly enough, although many fundamental results are nowadays known about upper bounds on the speed and effectiveness of this compression process and references therein), ``we are not aware of any parsing scheme that achieves optimality when the LZ77-dictionary is in use under any constraint on the codewords other than being of equal length'' [N. Rajpoot and C. Sahinalp. Handbook of Lossless Data Compression, chapter Dictionary-based data compression. Academic Press, 2002. pag. 159]. Here optimality means to achieve the minimum number of bits in compressing each individual input string, without any assumption on its ge...

  10. PDC (polycrystalline diamond compact) bit research at Sandia National Laboratories

    Energy Technology Data Exchange (ETDEWEB)

    Finger, J.T.; Glowka, D.A.

    1989-06-01

    From the beginning of the geothermal development program, Sandia has performed and supported research into polycrystalline diamond compact (PDC) bits. These bits are attractive because they are intrinsically efficient in their cutting action (shearing, rather than crushing) and they have no moving parts (eliminating the problems of high-temperature lubricants, bearings, and seals.) This report is a summary description of the analytical and experimental work done by Sandia and our contractors. It describes analysis and laboratory tests of individual cutters and complete bits, as well as full-scale field tests of prototype and commercial bits. The report includes a bibliography of documents giving more detailed information on these topics. 26 refs.

  11. BitPredator: A Discovery Algorithm for BitTorrent Initial Seeders and Peers

    Energy Technology Data Exchange (ETDEWEB)

    Borges, Raymond [West Virginia University; Patton, Robert M [ORNL; Kettani, Houssain [Polytechnic University of Puerto Rico (PUPR); Masalmah, Yahya [Universidad del Turabo

    2011-01-01

    There is a large amount of illegal content being replicated through peer-to-peer (P2P) networks where BitTorrent is dominant; therefore, a framework to profile and police it is needed. The goal of this work is to explore the behavior of initial seeds and highly active peers to develop techniques to correctly identify them. We intend to establish a new methodology and software framework for profiling BitTorrent peers. This involves three steps: crawling torrent indexers for keywords in recently added torrents using Really Simple Syndication protocol (RSS), querying torrent trackers for peer list data and verifying Internet Protocol (IP) addresses from peer lists. We verify IPs using active monitoring methods. Peer behavior is evaluated and modeled using bitfield message responses. We also design a tool to profile worldwide file distribution by mapping IP-to-geolocation and linking to WHOIS server information in Google Earth.

  12. Multiple Memory Structure Bit Reversal Algorithm Based on Recursive Patterns of Bit Reversal Permutation

    Directory of Open Access Journals (Sweden)

    K. K. L. B. Adikaram

    2014-01-01

    Full Text Available With the increasing demand for online/inline data processing efficient Fourier analysis becomes more and more relevant. Due to the fact that the bit reversal process requires considerable processing time of the Fast Fourier Transform (FFT algorithm, it is vital to optimize the bit reversal algorithm (BRA. This paper is to introduce an efficient BRA with multiple memory structures. In 2009, Elster showed the relation between the first and the second halves of the bit reversal permutation (BRP and stated that it may cause serious impact on cache performance of the computer, if implemented. We found exceptions, especially when the said index mapping was implemented with multiple one-dimensional memory structures instead of multidimensional or one-dimensional memory structure. Also we found a new index mapping, even after the recursive splitting of BRP into equal sized slots. The four-array and the four-vector versions of BRA with new index mapping reported 34% and 16% improvement in performance in relation to similar versions of Linear BRA of Elster which uses single one-dimensional memory structure.

  13. Circuit and interconnect design for high bit-rate applications

    NARCIS (Netherlands)

    Veenstra, H.

    2006-01-01

    This thesis presents circuit and interconnect design techniques and design flows that address the most difficult and ill-defined aspects of the design of ICs for high bit-rate applications. Bottlenecks in interconnect design, circuit design and on-chip signal distribution for high bit-rate applicati

  14. Cryptographic Properties of the Hidden Weighted Bit Function

    Science.gov (United States)

    2013-12-23

    Pohlig–Hellman method, the 20-variable Carlet–Feng function allows computing one output bit per cycle with more than 1000 half- adders and full- adders . In...comparison, the 64-variable HWBF allows computing one output bit with only 26 − 1 = 63 half- adders and 26 − 6− 1 = 57 full- adders [16]. Therefore, by

  15. Parallel SAT Solving using Bit-level Operations

    NARCIS (Netherlands)

    Heule, M.J.H.; Van Maaren, H.

    2008-01-01

    We show how to exploit the 32/64 bit architecture of modern computers to accelerate some of the algorithms used in satisfiability solving by modifying assignments to variables in parallel on a single processor. Techniques such as random sampling demonstrate that while using bit vectors instead of Bo

  16. Gradient Descent Bit Flipping Algorithms for Decoding LDPC Codes

    OpenAIRE

    Wadayama, Tadashi; Nakamura, Keisuke; Yagita, Masayuki; Funahashi, Yuuki; Usami, Shogo; Takumi, Ichi

    2007-01-01

    A novel class of bit-flipping (BF) algorithms for decoding low-density parity-check (LDPC) codes is presented. The proposed algorithms, which are called gradient descent bit flipping (GDBF) algorithms, can be regarded as simplified gradient descent algorithms. Based on gradient descent formulation, the proposed algorithms are naturally derived from a simple non-linear objective function.

  17. 16 Bits DAC s Design, Simulation and Layout

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    The high speed and precision 16 bits DAC will be applied in DSP (Digital Signal Processing) based on CSR pulsed power supply control system. In this application the DAC is needed to work in 1 μs’ converting data rate, 16 bit resolution and its output voltage is 10 volts.

  18. IMAGE STEGANOGRAPHY DENGAN METODE LEAST SIGNIFICANT BIT (LSB

    Directory of Open Access Journals (Sweden)

    M. Miftakul Amin

    2014-02-01

    Full Text Available Security in delivering a secret message is an important factor in the spread of information in cyberspace. Protecting that message to be delivered to the party entitled to, should be made a message concealment mechanism. The purpose of this study was to hide a secret text message into digital images in true color 24 bit RGB format. The method used to insert a secret message using the LSB (Least Significant Bit by replacing the last bit or 8th bit in each RGB color component. RGB image file types option considering that messages can be inserted capacity greater than if use a grayscale image, this is because in one pixel can be inserted 3 bits message. Tests provide results that are hidden messages into a digital image does not reduce significantly the quality of the digital image, and the message has been hidden can be extracted again, so that messages can be delivered to the recipient safely.

  19. Cross Institutional Cooperation on a Shared Bit Repository

    DEFF Research Database (Denmark)

    Zierau, Eld; Kejser, Ulla Bøgvad

    2010-01-01

    This paper explores how independent institutions, such as archives and libraries, can cooperate on managing a shared bit repository with bit preservation in order to use their resources for preservation n in a more cost-effective way. It uses the OAIS Reference Model to provide a framework......, and confidentiality. This study further revealed that requirements for the level of bit safety must be supplemented by risk analysis, which needs to involve elements of the architecture; for example, the number of copies and how independence between the copies is ensured. The paper describes bit repository...... architecture and its strengths in being flexible in order to offer differentiated services with respect to, among other things, bit safety and cost. Furthermore, the challenges in formulating various aspects, such as risk requirements, are described....

  20. Cross Institutional Cooperation on a Shared Bit Repository

    DEFF Research Database (Denmark)

    Zierau, Eld; Kejser, Ulla Bøgvad

    2013-01-01

    This paper explores how independent institutions, such as archives and libraries, can cooperate on managing a shared bit repository with bit preservation, in order to use their resources for preservation in a more cost-effective way. It uses the OAIS Reference Model to provide a framework......, and confidentiality. This study furthermore revealed that requirements for the level of bit safety must be supplemented by risk analysis, which needs to involve elements of the architecture, e.g. the number of copies and how independence between the copies is ensured. The paper describes the bit repository...... architecture, its strengths in being flexible in order to offer differentiated services with respect to, among other things, bit safety and cost. Furthermore, the challenges in formulating e.g. risk requirements are described....

  1. Uniqueness: skews bit occurrence frequencies in randomly generated fingerprint libraries.

    Science.gov (United States)

    Chen, Nelson G

    2016-08-01

    Requiring that randomly generated chemical fingerprint libraries have unique fingerprints such that no two fingerprints are identical causes a systematic skew in bit occurrence frequencies, the proportion at which specified bits are set. Observed frequencies (O) at which each bit is set within the resulting libraries systematically differ from frequencies at which bits are set at fingerprint generation (E). Observed frequencies systematically skew toward 0.5, with the effect being more pronounced as library size approaches the compound space, which is the total number of unique possible fingerprints given the number of bit positions each fingerprint contains. The effect is quantified for varying library sizes as a fraction of the overall compound space, and for changes in the specified frequency E. The cause and implications for this systematic skew are subsequently discussed. When generating random libraries of chemical fingerprints, the imposition of a uniqueness requirement should either be avoided or taken into account.

  2. A Novel Least Significant Bit First Processing Parallel CRC Circuit

    Directory of Open Access Journals (Sweden)

    Xiujie Qu

    2013-01-01

    Full Text Available In HDLC serial communication protocol, CRC calculation can first process the most or least significant bit of data. Nowadays most CRC calculation is based on the most significant bit (MSB first processing. An algorithm of the least significant bit (LSB first processing parallel CRC is proposed in this paper. Based on the general expression of the least significant bit first processing serial CRC, using state equation method of linear system, we derive a recursive formula by the mathematical deduction. The recursive formula is applicable to any number of bits processed in parallel and any series of generator polynomial. According to the formula, we present the parallel circuit of CRC calculation and implement it with VHDL on FPGA. The results verify the accuracy and effectiveness of this method.

  3. Gravitons, inflatons, twisted bits: A noncommutative bestiary

    Science.gov (United States)

    Pearson, John

    In this work, we examine ideas connected with the noncommutativity of spacetime and its realizations in string theory. Motivated by Matrix Theory and the AdS-CFT correspondence, we propose a survey of selected noncommutative objects, assessing their implications for inflation, gauge theory duals, and solvable backgrounds. Our initial pair of examples, related to the Myers effect, incorporate elements of so-called "giant graviton" behavior. In the first, the formation of an extended, supersymmetry-restoring domain wall from point-brane sources in a flux background is related to a nonperturbative process of brane-flux annihilation. In the second, we reexamine these phenomena from a cosmological vantage, investigating the prospect of slow-roll inflation in the noncommutative configuration space of multiple d-branes. For our third and final example, we turn to the solvable pp-wave background, outlining a combinatorial, permutation-based approach to string physics which interpolates between gauge theory and worldsheet methods. This "string bit" language will allow us to find exact agreement between Yang-Mills theory in the large R-charge sector and string field theory on the light cone, resolving some previous discrepancies in the literature.

  4. Notes on Bit-reversal Broadcast Scheduling

    CERN Document Server

    Kik, Marcin

    2012-01-01

    This report contains revision and extension of some results about RBO [arXiv:1108.5095]. RBO is a simple and efficient broadcast scheduling of $n = 2^k$ uniform frames for battery powered radio receivers. Each frame contains a key from some arbitrary linearly ordered universe. The broadcast cycle -- a sequence of frames sorted by the keys and permuted by $k$-bit reversal -- is transmitted in a round robin fashion by the broadcaster. At arbitrary time during the transmission, the receiver may start a simple protocol that reports to him all the frames with the keys that are contained in a specified interval of the key values $[K', K"]$. RBO receives at most $2 k + 1$ other frames' keys before receiving the first key from $[K', K"]$ or noticing that there are no such keys in the broadcast cycle. As a simple corollary, $4 k + 2$ is upper bound the number of keys outside $[K', K"]$ that will ever be received. In unreliable network the expected number of efforts to receive such frames is bounded by $(8 k + 4) / p +...

  5. A little bit of legal history

    CERN Multimedia

    2010-01-01

    On Monday 18 October, a little bit of legal history will be made when the first international tripartite agreement between CERN and its two Host States is signed. This agreement, which has been under negotiation since 2004, clarifies the working conditions of people employed by companies contracted to CERN. It will facilitate the management of service contracts both for CERN and its contractors.   Ever since 1965, when CERN first crossed the border into France, the rule of territoriality has applied. This means that anyone working for a company contracted to CERN whose job involves crossing the border is subject to the employment legislation of both states. The new agreement simplifies matters by making only one legislation apply per contract, that of the country in which most of the work is carried out. This is good for CERN, it’s good for the companies, and it’s good for their employees. It is something that all three parties to the agreement have wanted for some time, and I...

  6. Modeling and analysis of stick-slip and bit bounce in oil well drillstrings equipped with drag bits

    Science.gov (United States)

    Kamel, Jasem M.; Yigit, Ahmet S.

    2014-12-01

    Rotary drilling systems equipped with drag bits or fixed cutter bits (also called PDC), used for drilling deep boreholes for the production and the exploration of oil and natural gas, often suffer from severe vibrations. These vibrations are detrimental to the bit and the drillstring causing different failures of equipment (e.g., twist-off, abrasive wear of tubulars, bit damage), and inefficiencies in the drilling operation (reduction of the rate of penetration (ROP)). Despite extensive research conducted in the last several decades, there is still a need to develop a consistent model that adequately captures all phenomena related to drillstring vibrations such as nonlinear cutting and friction forces at the bit/rock formation interface, drive system characteristics and coupling between various motions. In this work, a physically consistent nonlinear model for the axial and torsional motions of a rotating drillstring equipped with a drag bit is proposed. A more realistic cutting and contact model is used to represent bit/rock formation interaction at the bit. The dynamics of both drive systems for rotary and translational motions of the drillstring, including the hoisting system are also considered. In this model, the rotational and translational motions of the bit are obtained as a result of the overall dynamic behavior rather than prescribed functions or constants. The dynamic behavior predicted by the proposed model qualitatively agree well with field observations and published theoretical results. The effects of various operational parameters on the dynamic behavior are investigated with the objective of achieving a smooth and efficient drilling. The results show that with proper choice of operational parameters, it may be possible to minimize the effects of stick-slip and bit-bounce and increase the ROP. Therefore, it is expected that the results will help reduce the time spent in drilling process and costs incurred due to severe vibrations and consequent

  7. Modern X86 assembly language programming 32-bit, 64-bit, SSE, and AVX

    CERN Document Server

    Kusswurm, Daniel

    2014-01-01

    Modern X86 Assembly Language Programming shows the fundamentals of x86 assembly language programming. It focuses on the aspects of the x86 instruction set that are most relevant to application software development. The book's structure and sample code are designed to help the reader quickly understand x86 assembly language programming and the computational capabilities of the x86 platform. Major topics of the book include the following: 32-bit core architecture, data types, internal registers, memory addressing modes, and the basic instruction setX87 core architecture, register stack, special

  8. Test results judgment method based on BIT faults

    Institute of Scientific and Technical Information of China (English)

    Wang Gang; Qiu Jing; Liu Guanjun; Lyu Kehong

    2015-01-01

    Built-in-test (BIT) is responsible for equipment fault detection, so the test data correct-ness directly influences diagnosis results. Equipment suffers all kinds of environment stresses, such as temperature, vibration, and electromagnetic stress. As embedded testing facility, BIT also suffers from these stresses and the interferences/faults are caused, so that the test course is influenced, resulting in incredible results. Therefore it is necessary to monitor test data and judge test failures. Stress monitor and BIT self-diagnosis would redound to BIT reliability, but the existing anti-jamming researches are mainly safeguard design and signal process. This paper focuses on test results monitor and BIT equipment (BITE) failure judge, and a series of improved approaches is proposed. Firstly the stress influences on components are illustrated and the effects on the diagnosis results are summarized. Secondly a composite BIT program is proposed with information integra-tion, and a stress monitor program is given. Thirdly, based on the detailed analysis of system faults and forms of BIT results, the test sequence control method is proposed. It assists BITE failure judge and reduces error probability. Finally the validation cases prove that these approaches enhance credibility.

  9. Evaluation of bit errors in different types demodulation discrete signals

    Directory of Open Access Journals (Sweden)

    V. M. Kychak

    2015-12-01

    Full Text Available Introduction. The introduction describes the main characteristics of bit errors. These sources of bit errors in discrete channels. Also listed scientists who worked on the study opportunities monitoring bit error in discrete channels. The main purpose of the article is to conduct research and theoretical modeling of processes in discrete channels to control error measurement and forecasting parameter BER bit error depending on the signal/noise ratio. Theoretical analysis. A comparison of some types of digital modulation for effective use in systems transmitting information. Comparisons were made using the correlation function, power spectral density and distance between signals. It was proved that through this you can control the real value of bit error (BER for each type of modulation. Important here is the dependence of the BER signal/noise ratio in the test communication channel. Determined that efficiency could be described bit error probability value of the output of the receiver, which is determined by the expression (4. Control parameters BER modulation in digital signals. At this paragraph the examples of control parameter BER at different modulation signals. The simulation results show that with an increase in the signal/noise bit error probability for different types of demodulation will decrease.

  10. ANALISA REKAYASA PERANGKAT LUNAK SISTEM E-LEARNING DETEKSI DAN KOREKSI KESALAHAN BIT PADA KOMUNIKASI DATA DENGAN MODEL PROBLEM BASED LEARNING

    OpenAIRE

    MY Teguh Sulistyono; Sudaryanto Sudaryanto

    2014-01-01

    Analisa sistem e-learning deteksi dan koreksi kesalahan bit pada komunikasi data dengan model problem based learning diperlukan sebuah teknologi pembelajaran untuk computer-base training, electric performance support systems, computer assisted instruction, intelligent tutoring, education dan training technology dengan area subyek meliputi  reference model, leaner model, task model, student identifiers, competency definitions, user interface, learning content interchange, learning content pack...

  11. The Economics of BitCoin Price Formation

    OpenAIRE

    Ciaian, Pavel; Rajcaniova, Miroslava; Kancs, d'Artis

    2014-01-01

    This is the first article that studies BitCoin price formation by considering both the traditional determinants of currency price, e.g., market forces of supply and demand, and digital currencies specific factors, e.g., BitCoin attractiveness for investors and users. The conceptual framework is based on the Barro (1979) model, from which we derive testable hypotheses. Using daily data for five years (2009–2015) and applying time-series analytical mechanisms, we find that market forces and Bit...

  12. AN EFFICIENT BIT COMMITMENT SCHEME BASED ON FACTORING ASSUMPTION

    Institute of Scientific and Technical Information of China (English)

    Zhong Ming; Yang Yixian

    2001-01-01

    Recently, many bit commitment schemes have been presented. This paper presents a new practical bit commitment scheme based on Schnorr's one-time knowledge proof scheme,where the use of cut-and-choose method and many random exam candidates in the protocols are replaced by a single challenge number. Therefore the proposed bit commitment scheme is more efficient and practical than the previous schemes In addition, the security of the proposed scheme under factoring assumption is proved, thus the cryptographic basis of the proposed scheme is clarified.

  13. Unconditionally secure bit commitment by transmitting measurement outcomes.

    Science.gov (United States)

    Kent, Adrian

    2012-09-28

    We propose a new unconditionally secure bit commitment scheme based on Minkowski causality and the properties of quantum information. The receiving party sends a number of randomly chosen Bennett-Brassard 1984 (BB84) qubits to the committer at a given point in space-time. The committer carries out measurements in one of the two BB84 bases, depending on the committed bit value, and transmits the outcomes securely at (or near) light speed in opposite directions to remote agents. These agents unveil the bit by returning the outcomes to adjacent agents of the receiver. The protocol's security relies only on simple properties of quantum information and the impossibility of superluminal signalling.

  14. Unconditionally Secure Bit Commitment by Transmitting Measurement Outcomes

    CERN Document Server

    ,

    2011-01-01

    We propose a new unconditionally secure bit commitment scheme based on Minkowski causality and the properties of quantum information. The receiving party sends a number of randomly chosen BB84 qubits to the committer at a given point in space-time. The committer carries out measurements in one of the two BB84 bases, depending on the committed bit value, and transmits the outcomes securely at light speed in opposite directions to remote agents. These agents unveil the bit by returning the outcomes to adjacent agents of the receiver. The security proofs rely only on simple properties of quantum information and the impossibility of superluminal signalling.

  15. 1-Bit Compressive Data Gathering for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Jiping Xiong

    2014-01-01

    Full Text Available Compressive sensing (CS has been widely used in wireless sensor networks for the purpose of reducing the data gathering communication overhead in recent years. In this paper, we firstly apply 1-bit compressive sensing to wireless sensor networks to further reduce the communication overhead that each sensor needs to send. Furthermore, we propose a novel blind 1-bit CS reconstruction algorithm which outperforms other state-of-the-art blind 1-bit CS reconstruction algorithms under the settings of WSN. Experimental results on real sensor datasets demonstrate the efficiency of our method.

  16. Comparison between GEOCOR IV SIGN-BIT an DFS-V 16-bit floating point recording systems

    Energy Technology Data Exchange (ETDEWEB)

    Hollis, D.D.; Givens, R.

    1986-04-01

    A Vibroseis line was repeatedly shot in Andrews County, Texas. The first shot used a DFS-V 16-bit floating point recording system with parameters optimized for that particular recording system and subsurface geology. Then the line was shot with a GEOCOR IV SIGN-BIT recording system, once using the same parameters as on the floating point recording system, then with parameters optimized for a SIGN-BIT recording system - mainly higher fold, closer channel spacing, and using the VARISWEEP technique. The three lines were processed to stacked sections using identical processing parameters. When the 16-bit floating point recording system is compared to the SIGN-BIT system with identical parameters, the results indicate the systems are equivalent for Vibroseis recording. Basic primary reflections are similar in signal to noise and frequency. Multiple reflection energy is greater on the floating point section. However, the results differ when the two systems are compared using optimal parameters for each system. The SIGN-BIT section had shallower data because the receiver line has no gapping. The SIGN-BIT system also had better temporal and spatial resolution because channel spacing was reduced and a different sweep technique was used.

  17. Adaptive bit truncation and compensation method for EZW image coding

    Science.gov (United States)

    Dai, Sheng-Kui; Zhu, Guangxi; Wang, Yao

    2003-09-01

    The embedded zero-tree wavelet algorithm (EZW) is widely adopted to compress wavelet coefficients of images with the property that the bits stream can be truncated and produced anywhere. The lower bit plane of the wavelet coefficents is verified to be less important than the higher bit plane. Therefore it can be truncated and not encoded. Based on experiments, a generalized function, which can provide a glancing guide for EZW encoder to intelligently decide the number of low bit plane to be truncated, is deduced in this paper. In the EZW decoder, a simple method is presented to compensate for the truncated wavelet coefficients, and finally it can surprisingly enhance the quality of reconstructed image and spend scarcely any additional cost at the same time.

  18. Experimental bit commitment based on quantum communication and special relativity.

    Science.gov (United States)

    Lunghi, T; Kaniewski, J; Bussières, F; Houlmann, R; Tomamichel, M; Kent, A; Gisin, N; Wehner, S; Zbinden, H

    2013-11-01

    Bit commitment is a fundamental cryptographic primitive in which Bob wishes to commit a secret bit to Alice. Perfectly secure bit commitment between two mistrustful parties is impossible through asynchronous exchange of quantum information. Perfect security is however possible when Alice and Bob split into several agents exchanging classical and quantum information at times and locations suitably chosen to satisfy specific relativistic constraints. Here we report on an implementation of a bit commitment protocol using quantum communication and special relativity. Our protocol is based on [A. Kent, Phys. Rev. Lett. 109, 130501 (2012)] and has the advantage that it is practically feasible with arbitrary large separations between the agents in order to maximize the commitment time. By positioning agents in Geneva and Singapore, we obtain a commitment time of 15 ms. A security analysis considering experimental imperfections and finite statistics is presented.

  19. Apparatus and method for situ sharpening of bore hole bits

    Energy Technology Data Exchange (ETDEWEB)

    Bridwell, H.C.

    1974-06-25

    An impregnated diamond core bit is sharpened at the bottom of a borehole, the bit being secured to the outer barrel of coring apparatus attached to a tubular drill string. A sharpener is releasably mounted in the lower end of an inner core barrel lowered through the drill string into the outer barrel and latched thereto, with the sharpener projecting below the lower end of the core bit. The sharpener has nozzles for discharging abrasive material pumped through the sharpener against the drilling face of the bit to sharpen the same, whereupon the coring operation can be effected in the usual manner, the core releasing the sharpener from the inner barrel and pushing it upward along and within the inner barrel as the core is formed. The sharpener is rtrieved with the inner barrel upon release of the latter from the outer barrel and its upward removal through the drill string to the top of the borehole. (29 claims)

  20. Bit-interleaved coded modulation in the wideband regime

    CERN Document Server

    Martinez, Alfonso; Caire, Giuseppe; Willems, Frans

    2007-01-01

    The wideband regime of bit-interleaved coded modulation (BICM) in Gaussian channels is studied. The Taylor expansion of the coded modulation capacity for generic signal constellations at low signal-to-noise ratio (SNR) is derived and used to determine the corresponding expansion for the BICM capacity. Simple formulas for the minimum energy per bit and the wideband slope are given. BICM is found to be suboptimal in the sense that its minimum energy per bit can be larger than the corresponding value for coded modulation schemes. The minimum energy per bit using standard Gray mapping on M-PAM or M^2-QAM is given by a simple formula and shown to approach -0.34 dB as M increases. Using the low SNR expansion, a general trade-off between power and bandwidth in the wideband regime is used to show how a power loss can be traded off against a bandwidth gain.

  1. Efficient Generation of Random Bits from Finite State Markov Chains

    CERN Document Server

    Zhou, Hongchao

    2010-01-01

    The problem of random number generation from an uncorrelated random source (of unknown probability distribution) dates back to von Neumann's 1951 work. Elias (1972) generalized von Neumann's scheme and showed how to achieve optimal efficiency in unbiased random bits generation. Hence, a natural question is what if the sources are correlated? Both Elias and Samuelson proposed methods for generating unbiased random bits in the case of correlated sources (of unknown probability distribution), specifically, they considered finite Markov chains. However, their proposed methods are not efficient or have implementation difficulties. Blum (1986) devised an algorithm for efficiently generating random bits from degree-2 finite Markov chains in expected linear time, however, his beautiful method is still far from optimality on information-efficiency. In this paper, we generalize Blum's algorithm to arbitrary degree finite Markov chains and combine it with Elias's method for efficient generation of unbiased bits. As a re...

  2. Design of High Speed 128 bit Parallel Prefix Adders

    OpenAIRE

    T.KIRAN KUMAR; Srikanth, P

    2014-01-01

    In this paper, we propose 128-bit Kogge-Stone, Ladner-Fischer, Spanning tree parallel prefix adders and compared with Ripple carry adder. In general N-bit adders like Ripple Carry Adders (slow adders compare to other adders), and Carry Look Ahead adders (area consuming adders) are used in earlier days. But now the most Industries are using parallel prefix adders because of their advantages compare to other adders. Parallel prefix adders are faster and area efficient. Parallel pref...

  3. Unconditionally secure quantum bit commitment really is impossible

    CERN Document Server

    Bub, J

    2001-01-01

    Unconditionally secure quantum bit commitment has been shown to be impossible by Mayers (PRL 78, 3414 (1997)) and Lo and Chau (PRL 78, 3410 (1997)) but the claim is repeatedly challenged. The bit commitment theorem is reviewed here and the central conceptual point, that an 'Einstein-Podolsky-Rosen' attack or cheating strategy can always be applied, is clarified. The question of whether following such a cheating strategy can ever be disadvantageous to the cheater is considered and answered in the negative.

  4. Content Progressive Coding of Limited Bits/pixel Images

    DEFF Research Database (Denmark)

    Jensen, Ole Riis; Forchhammer, Søren

    1999-01-01

    A new lossless context based method for content progressive coding of limited bits/pixel images is proposed. Progressive coding is achieved by separating the image into contelnt layers. Digital maps are compressed up to 3 times better than GIF.......A new lossless context based method for content progressive coding of limited bits/pixel images is proposed. Progressive coding is achieved by separating the image into contelnt layers. Digital maps are compressed up to 3 times better than GIF....

  5. Hash Based Least Significant Bit Technique For Video Steganography

    Directory of Open Access Journals (Sweden)

    Prof. Dr. P. R. Deshmukh ,

    2014-01-01

    Full Text Available The Hash Based Least Significant Bit Technique For Video Steganography deals with hiding secret message or information within a video.Steganography is nothing but the covered writing it includes process that conceals information within other data and also conceals the fact that a secret message is being sent.Steganography is the art of secret communication or the science of invisible communication. In this paper a Hash based least significant bit technique for video steganography has been proposed whose main goal is to embed a secret information in a particular video file and then extract it using a stego key or password. In this Least Significant Bit insertion method is used for steganography so as to embed data in cover video with change in the lower bit.This LSB insertion is not visible.Data hidding is the process of embedding information in a video without changing its perceptual quality. The proposed method involve with two terms that are Peak Signal to Noise Ratio (PSNR and the Mean Square Error (MSE .This two terms measured between the original video files and steganographic video files from all video frames where a distortion is measured using PSNR. A hash function is used to select the particular position for insertion of bits of secret message in LSB bits.

  6. Integer Representations towards Efficient Counting in the Bit Probe Model

    DEFF Research Database (Denmark)

    Brodal, Gerth Stølting; Greve, Mark; Pandey, Vineet

    2011-01-01

    Abstract We consider the problem of representing numbers in close to optimal space and supporting increment, decrement, addition and subtraction operations efficiently. We study the problem in the bit probe model and analyse the number of bits read and written to perform the operations, both...... in the worst-case and in the average-case. A counter is space-optimal if it represents any number in the range [0,...,2 n  − 1] using exactly n bits. We provide a space-optimal counter which supports increment and decrement operations by reading at most n − 1 bits and writing at most 3 bits in the worst...... of the counter as the ratio between L + 1 and 2 n . We present various representations that achieve different trade-offs between the read and write complexities and the efficiency. We also give another representation of integers that uses n + O(logn ) bits to represent integers in the range [0,...,2 n  − 1...

  7. Characterization and modeling of fast programming bits in flash EEPROM

    Science.gov (United States)

    Nkansah, F.; Hatalis, M.; Olasupo, K.

    2000-11-01

    The effects of flash EEPROM floating gate (FG) morphology on the generation and density of fast programming bits in a 2Mbit flash EEPROM array has been characterized. These fast programming bits exhibit identical subthreshold characteristics similar to that of a normal bit after UV erase, thus establishing that the initial charge stored on the FG of both fast and normal bit is the same. Experimental results clearly indicates that the fast programming phenomena result from an interaction of the programming process with the FG polysilicon microstructure. An in-depth experimentation previously reported, reveals that the FG poly deposition and doping processes are crucial for controlling the desired Fowler-Nordheim tunneling. A correlation is established between the fast bit density observed in the memory arrays, the FG polysilicon grain size and tunneling field enhancement factor μ( Rc). A compact model of the fast programming bit memory threshold voltage as a function of the effective FG polysilicon grain area factor Geff, and tunneling field enhancement factor μ( Rc) has been developed for the first time.

  8. A New Digital Watermarking Algorithm Using Combination of Least Significant Bit (LSB) and Inverse Bit

    CERN Document Server

    Bamatraf, Abdullah; Salleh, Mohd Najib Mohd

    2011-01-01

    In this paper, we introduce a new digital watermarking algorithm using least significant bit (LSB). LSB is used because of its little effect on the image. This new algorithm is using LSB by inversing the binary values of the watermark text and shifting the watermark according to the odd or even number of pixel coordinates of image before embedding the watermark. The proposed algorithm is flexible depending on the length of the watermark text. If the length of the watermark text is more than ((MxN)/8)-2 the proposed algorithm will also embed the extra of the watermark text in the second LSB. We compare our proposed algorithm with the 1-LSB algorithm and Lee's algorithm using Peak signal-to-noise ratio (PSNR). This new algorithm improved its quality of the watermarked image. We also attack the watermarked image by using cropping and adding noise and we got good results as well.

  9. A Heuristic Optimal Discrete Bit Allocation Algorithm for Margin Maximization in DMT Systems

    Directory of Open Access Journals (Sweden)

    Dong Shi-Wei

    2007-01-01

    Full Text Available A heuristic optimal discrete bit allocation algorithm is proposed for solving the margin maximization problem in discrete multitone (DMT systems. Starting from an initial equal power assignment bit distribution, the proposed algorithm employs a multistaged bit rate allocation scheme to meet the target rate. If the total bit rate is far from the target rate, a multiple-bits loading procedure is used to obtain a bit allocation close to the target rate. When close to the target rate, a parallel bit-loading procedure is used to achieve the target rate and this is computationally more efficient than conventional greedy bit-loading algorithm. Finally, the target bit rate distribution is checked, if it is efficient, then it is also the optimal solution; else, optimal bit distribution can be obtained only by few bit swaps. Simulation results using the standard asymmetric digital subscriber line (ADSL test loops show that the proposed algorithm is efficient for practical DMT transmissions.

  10. Sleep stage classification with low complexity and low bit rate.

    Science.gov (United States)

    Virkkala, Jussi; Värri, Alpo; Hasan, Joel; Himanen, Sari-Leena; Müller, Kiti

    2009-01-01

    Standard sleep stage classification is based on visual analysis of central (usually also frontal and occipital) EEG, two-channel EOG, and submental EMG signals. The process is complex, using multiple electrodes, and is usually based on relatively high (200-500 Hz) sampling rates. Also at least 12 bit analog to digital conversion is recommended (with 16 bit storage) resulting in total bit rate of at least 12.8 kbit/s. This is not a problem for in-house laboratory sleep studies, but in the case of online wireless self-applicable ambulatory sleep studies, lower complexity and lower bit rates are preferred. In this study we further developed earlier single channel facial EMG/EOG/EEG-based automatic sleep stage classification. An algorithm with a simple decision tree separated 30 s epochs into wakefulness, SREM, S1/S2 and SWS using 18-45 Hz beta power and 0.5-6 Hz amplitude. Improvements included low complexity recursive digital filtering. We also evaluated the effects of a reduced sampling rate, reduced number of quantization steps and reduced dynamic range on the sleep data of 132 training and 131 testing subjects. With the studied algorithm, it was possible to reduce the sampling rate to 50 Hz (having a low pass filter at 90 Hz), and the dynamic range to 244 microV, with an 8 bit resolution resulting in a bit rate of 0.4 kbit/s. Facial electrodes and a low bit rate enables the use of smaller devices for sleep stage classification in home environments.

  11. Foldable Instrumented Bits for Ultrasonic/Sonic Penetrators

    Science.gov (United States)

    Bar-Cohen, Yoseph; Badescu, Mircea; Iskenderian, Theodore; Sherrit, Stewart; Bao, Xiaoqi; Linderman, Randel

    2010-01-01

    Long tool bits are undergoing development that can be stowed compactly until used as rock- or ground-penetrating probes actuated by ultrasonic/sonic mechanisms. These bits are designed to be folded or rolled into compact form for transport to exploration sites, where they are to be connected to their ultrasonic/ sonic actuation mechanisms and unfolded or unrolled to their full lengths for penetrating ground or rock to relatively large depths. These bits can be designed to acquire rock or soil samples and/or to be equipped with sensors for measuring properties of rock or soil in situ. These bits can also be designed to be withdrawn from the ground, restowed, and transported for reuse at different exploration sites. Apparatuses based on the concept of a probe actuated by an ultrasonic/sonic mechanism have been described in numerous prior NASA Tech Briefs articles, the most recent and relevant being "Ultrasonic/ Sonic Impacting Penetrators" (NPO-41666) NASA Tech Briefs, Vol. 32, No. 4 (April 2008), page 58. All of those apparatuses are variations on the basic theme of the earliest ones, denoted ultrasonic/sonic drill corers (USDCs). To recapitulate: An apparatus of this type includes a lightweight, low-power, piezoelectrically driven actuator in which ultrasonic and sonic vibrations are generated and coupled to a tool bit. The combination of ultrasonic and sonic vibrations gives rise to a hammering action (and a resulting chiseling action at the tip of the tool bit) that is more effective for drilling than is the microhammering action of ultrasonic vibrations alone. The hammering and chiseling actions are so effective that the size of the axial force needed to make the tool bit advance into soil, rock, or another material of interest is much smaller than in ordinary twist drilling, ordinary hammering, or ordinary steady pushing. Examples of properties that could be measured by use of an instrumented tool bit include electrical conductivity, permittivity, magnetic

  12. Numerical Study of the Simplest String Bit Model

    CERN Document Server

    Chen, Gaoli

    2016-01-01

    String bit models provide a possible method to formulate string as a discrete chain of point-like string bits. When the bit number $M$ is large, a chain behaves as a continuous string. We study the simplest case that has only one bosonic bit and one fermionic bit. The creation and annihilation operators are adjoint representations of $U\\left(N\\right)$ color group. We show that the supersymmetry reduces the parameter number of a Hamiltonian from seven to three and, at $N=\\infty$, ensures continuous energy spectrum, which implies the emergence of one spatial dimension. The Hamiltonian $H_{0}$ is constructed so that in large $N$ limit it produces a worldsheet spectrum with one grassmann worldsheet field. We concentrate on numerical study of the model in finite $N$. For the Hamiltonian $H_{0}$, we find that the would-be ground energy states disappear at $N=\\left(M-1\\right)/2$ for odd $M\\leq11$. Such a simple pattern is spoiled if $H$ has an additional term $\\xi\\Delta H$ which does not affect the result of $N=\\inf...

  13. DSC and universal bit-level combining for HARQ systems

    Directory of Open Access Journals (Sweden)

    Lv Tiejun

    2011-01-01

    Full Text Available Abstract This paper proposes a Dempster -Shafer theory based combining scheme for single-input single-output (SISO systems with hybrid automatic retransmission request (HARQ, referred to as DSC, in which two methods for soft information calculations are developed for equiprobable (EP and non-equiprobable (NEP sources, respectively. One is based on the distance from the received signal to the decision candidate set consisting of adjacent constellation points when the source bits are equiprobable, and the corresponding DSC is regarded as DSC-D. The other is based on the posterior probability of the transmitted signals when the priori probability for the NEP source bits is available, and the corresponding DSC is regarded as DSC-APP. For the diverse EP and NEP source cases, both DSCD and DSC-APP are superior to maximal ratio combining, the so-called optimal combining scheme for SISO systems. Moreover, the robustness of the proposed DSC is illustrated by the simulations performed in Rayleigh channel and AWGN channel, respectively. The results show that the proposed DSC is insensitive to and especially applicable to the fading channels. In addition, a DS detection-aided bit-level DS combining scheme is proposed for multiple-input multiple-output--HARQ systems. The bit-level DS combining is deduced to be a universal scheme, and the traditional log-likelihood-ratio combining is a special case when the likelihood probability is used as bit-level soft information.

  14. Low-bit-rate subband image coding with matching pursuits

    Science.gov (United States)

    Rabiee, Hamid; Safavian, S. R.; Gardos, Thomas R.; Mirani, A. J.

    1998-01-01

    In this paper, a novel multiresolution algorithm for low bit-rate image compression is presented. High quality low bit-rate image compression is achieved by first decomposing the image into approximation and detail subimages with a shift-orthogonal multiresolution analysis. Then, at the coarsest resolution level, the coefficients of the transformation are encoded by an orthogonal matching pursuit algorithm with a wavelet packet dictionary. Our dictionary consists of convolutional splines of up to order two for the detail and approximation subbands. The intercorrelation between the various resolutions is then exploited by using the same bases from the dictionary to encode the coefficients of the finer resolution bands at the corresponding spatial locations. To further exploit the spatial correlation of the coefficients, the zero trees of wavelets (EZW) algorithm was used to identify the potential zero trees. The coefficients of the presentation are then quantized and arithmetic encoded at each resolution, and packed into a scalable bit stream structure. Our new algorithm is highly bit-rate scalable, and performs better than the segmentation based matching pursuit and EZW encoders at lower bit rates, based on subjective image quality and peak signal-to-noise ratio.

  15. Bit Serial Architecture for Variable Block Size Motion Estimation

    Directory of Open Access Journals (Sweden)

    Krishna Kaveri Devarinti

    2013-06-01

    Full Text Available H.264/AVC is the latest video coding standard adopting variable block size, quarter-pixel accuracy and motion vector prediction and multi-reference frames for motion estimations. These new features result in higher computation requirements than that for previous coding standards.The computational complexity of motion estimation is about 60% in the H.264/AVC encoder. In this paper most significant bit (MSB first arithmetic based bit serial Variable Block Size Motion Estimation (VBSME hardware architecture is proposed. MSB first bit serial architecture main feature is, its early termination SAD computation compared to normal bit serial architectures. With this early termination technique, number computations are reduced drastically. Hence power consumption is also less compared to parallel architectures. An efficient bit serial processing element is proposed and developed 2D architecture for processing of 4x4 block in parallel .Inter connect structure is developed in such way that data reusability is achieved between PEs. Two types of adder trees are employed for variable block size SAD calculation with less number of adders. The proposed architecture can generate up to 41 motion vectors (MVs for each macroblock. The inter connection complexity between PEs reduced drastically compared to parallel architectures. The architecture supports processing of SDTV (640x480 with 30fps at 172.8 MHz for search range [+8, -7]. We could reduce 14% of computations by using early termination technique.

  16. Permanently Secure Quantum Bit Commitment from a Temporary Computation Bound

    CERN Document Server

    Kent, A

    1997-01-01

    Alice is a private citizen whose computational resources are modest. Bob represents a large organisation at the forefront of computational and cryptological research. Bob's computational and cryptanalytic power is unknown to Alice, but Bob can confidently estimate a bound on Alice's ability to carry out a computation that would break a classical bit commitment. Alice wishes to commit a bit to Bob. She requires that he will never be able to decode it unless she chooses to reveal it, but also that if she does he will be confident that her commitment was genuine. We describe here a simple quantum bit commitment scheme which satisfies these criteria. By iterating the scheme, we obtain quantum bit commitment schemes which allow either Alice or Bob to commit bits to the other. These schemes do not contradict Mayers' and Lo and Chau's no-go results: they rely on a temporary computability bound. However, they are permanently secure against cheating by either party, provided only that Alice was not able to break Bob's...

  17. Retrieving Drill Bit Seismic Signals Using Surface Seismometers

    Institute of Scientific and Technical Information of China (English)

    Linfei Wang; Huaishan Liu; Siyou Tong; Yanxin Yin; Lei Xing; Zhihui Zou; Xiugang Xu

    2015-01-01

    Seismic while drilling (SWD) is an emerging borehole seismic imaging technique that uses the downhole drill-bit vibrations as seismic source. Without interrupting drilling, SWD technique can make near-real-time images of the rock formations ahead of the bit and optimize drilling operation, with reduction of costs and the risk of drilling. However, the signal to noise ratio (SNR) of surface SWD-data is severely low for the surface acquisition of SWD data. Here, we propose a new method to retrieve the drill-bit signal from the surface data recorded by an array of broadband seismometers. Taking advantages of wavefield analysis, different types of noises are identified and removed from the surface SWD-data, resulting in the significant improvement of SNR. We also optimally synthesize seis-mic response of the bit source, using a statistical cross-coherence analysis to further improve the SNR and retrieve both the drill-bit direct arrivals and reflections which are then used to establish a reverse vertical seismic profile (RVSP) data set for the continuous drilling depth. The subsurface images de-rived from these data compare well with the corresponding images of the three-dimension surface seis-mic survey cross the well.

  18. Why quantum bit committment and quantum coin tossing are impossible?

    CERN Document Server

    Lo, H K

    1996-01-01

    There had been well known claims of ``provably unbreakable'' quantum protocols for bit commitment and coin tossing. However, we, and independently Mayers, showed that all proposed quantum bit commitment (and coin tossing) schemes are, in principle, insecure because the sender, Alice, can always cheat successfully by using an EPR-type of attack and delaying her measurements. One might wonder if secure quantum bit commitment and coin tossing protocols exist at all. Here we prove that an EPR-type of attack by Alice will, in principle, break {\\em any} realistic quantum bit commitment and {\\em ideal} coin tossing scheme. Therefore, provided that Alice has a quantum computer and is capable of storing quantum signals for an arbitrary length of time, all those schemes are insecure. Since bit commitment and coin tossing are useful primitives for building up more sophisticated protocols such as zero-knowledge proofs, our results cast very serious doubt on the security of quantum cryptography in the so-called ``post-col...

  19. Causes of wear of PDC bits and ways of improving their wear resistance

    Science.gov (United States)

    Timonin, VV; Smolentsev, AS; Shakhtorin, I. O.; Polushin, NI; Laptev, AI; Kushkhabiev, AS

    2017-02-01

    The scope of the paper encompasses basic factors that influence PDC bit efficiency. Feasible ways of eliminating the negatives are illustrated. The wash fluid flow in a standard bit is modeled, the resultant pattern of the bit washing is analyzed, and the recommendations are made on modification of the PDC bit design.

  20. Design of the 12-bit Delta-Sigma Modulator using SC Technique for Vibration Sensor Output Processing

    Directory of Open Access Journals (Sweden)

    M. Pavlik

    2012-04-01

    Full Text Available The work deals with the design of the 12-bit Delta-Sigma modulator using switched capacitors (SC technique. The modulator serves to vibration sensor output processing. The first part describes the Delta-Sigma modulator parameters definition. Results of the proposed topology ideal model were presented as well. Next, the Delta-Sigma modulator circuitry on the transistor level was done. The ONSemiconductor I2T100 0.7 um CMOS technology was used for design. Then, the Delta-Sigma modulator nonidealities were simulated and implemented into the MATLAB ideal model of the modulator. The model of real Delta-Sigma modulator was derived. Consequently, modulator coefficients were optimized. Finally, the corner analysis of the Delta-Sigma modulator with the optimized coefficients was simulated. The value of SNDR = 82.2 dB (ENOB = 13.4 bits was achieved.

  1. Comparative Design of 16-Bit Sparse-Tree Rsfq Adder

    Directory of Open Access Journals (Sweden)

    S. Saddam Hussain

    2014-06-01

    Full Text Available In this paper, we propse 16-bit sparse tree RSFQ adder (Rapid single flux quantam, kogge-stone adder, carry lookahead adder. In general N-bit adders like Ripple carry adder s(slow adders compare to other adders, and carry lookahead adders(area consuming adders are used in earlier days. But now the most of industries are using parallel prefix adders because of their advantages compare to kogge-stone adder, carry lookahead adder, Our prefix sparse tree adders are faster and area efficient. Parallel prefix adder is a technique for increasing the speed in DSP processor while performing addition. We simulate and synthesis different types of 16-bit sparse tree RSFQ adders using Xilinx ISE10.1i tool, By using these synthesis results, We noted the performance parameters like number of LUT’s and delay. We compare these three adders interms of LUT’s represents area and delay values.

  2. An improved EZBC algorithm based on block bit length

    Science.gov (United States)

    Wang, Renlong; Ruan, Shuangchen; Liu, Chengxiang; Wang, Wenda; Zhang, Li

    2011-12-01

    Embedded ZeroBlock Coding and context modeling (EZBC) algorithm has high compression performance. However, it consumes large amounts of memory space because an Amplitude Quadtree of wavelet coefficients and other two link lists would be built during the encoding process. This is one of the big challenges for EZBC to be used in real time or hardware applications. An improved EZBC algorithm based on bit length of coefficients was brought forward in this article. It uses Bit Length Quadtree to complete the coding process and output the context for Arithmetic Coder. It can achieve the same compression performance as EZBC and save more than 75% memory space required in the encoding process. As Bit Length Quadtree can quickly locate the wavelet coefficients and judge their significance, the improved algorithm can dramatically accelerate the encoding speed. These improvements are also beneficial for hardware. PACS: 42.30.Va, 42.30.Wb

  3. Decision-fusion-based automated drill bit toolmark correlator

    Science.gov (United States)

    Jones, Brett C.; Press, Michael J.; Guerci, Joseph R.

    1999-02-01

    This paper describes a recent study conducted to investigate the reproducibility of toolmarks left by drill bits. This paper focuses on the automated analysis aspect of the study, and particularly the advantages of using decision fusion methods in the comparisons. To enable the study to encompass a large number of samples, existing technology was adapted to the task of automatically comparing the test impressions. Advanced forensic pattern recognition algorithms that had been developed for the comparison of ballistic evidence in the DRUGFIRETM system were modified for use in this test. The results of the decision fusion architecture closely matched those obtained by expert visual examination. The study, aided by the improved pattern recognition algorithm, showed that drill bit impressions do contain reproducible marks. In a blind test, the DRUGFIRE pattern recognition algorithm, enhanced with the decision fusion architecture, consistently identified the correct bit as the source of the test impressions.

  4. Comodulation masking release in bit-rate reduction systems

    DEFF Research Database (Denmark)

    Vestergaard, Martin David; Rasmussen, Karsten Bo; Poulsen, Torben

    1999-01-01

    It has been suggested that the level dependence of the upper masking slope be utilized in perceptual models in bit-rate reduction systems. However, comodulation masking release (CMR) phenomena lead to a reduction of the masking effect when a masker and a probe signal are amplitude modulated...... with the same frequency. In bit-rate reduction systems the masker would be the audio signal and the probe signal would represent the quantization noise. Masking curves have been determined for sinusoids and 1-Bark-wide noise maskers in order to investigate the risk of CMR, when quantizing depths are fixed.......75. A CMR of up to 10 dB was obtained at a distance of 6 Bark above the masker. The amount of CMR was found to depend on the presentation level of the masker; a higher masker level leads to a higher CMR effect. Hence, the risk of CMR affecting the subjective performance of bit-rate reduction systems cannot...

  5. BitCube: A Bottom-Up Cubing Engineering

    Science.gov (United States)

    Ferro, Alfredo; Giugno, Rosalba; Puglisi, Piera Laura; Pulvirenti, Alfredo

    Enhancing on line analytical processing through efficient cube computation plays a key role in Data Warehouse management. Hashing, grouping and mining techniques are commonly used to improve cube pre-computation. BitCube, a fast cubing method which uses bitmaps as inverted indexes for grouping, is presented. It horizontally partitions data according to the values of one dimension and for each resulting fragment it performs grouping following bottom-up criteria. BitCube allows also partial materialization based on iceberg conditions to treat large datasets for which a full cube pre-computation is too expensive. Space requirement of bitmaps is optimized by applying an adaption of the WAH compression technique. Experimental analysis, on both synthetic and real datasets, shows that BitCube outperforms previous algorithms for full cube computation and results comparable on iceberg cubing.

  6. Framed bit error rate testing for 100G ethernet equipment

    DEFF Research Database (Denmark)

    Rasmussen, Anders; Ruepp, Sarah Renée; Berger, Michael Stübert

    2010-01-01

    The Internet users behavioural patterns are migrating towards bandwidth-intensive applications, which require a corresponding capacity extension. The emerging 100 Gigabit Ethernet (GE) technology is a promising candidate for providing a ten-fold increase of todays available Internet transmission...... rate. As the need for 100 Gigabit Ethernet equipment rises, so does the need for equipment, which can properly test these systems during development, deployment and use. This paper presents early results from a work-in-progress academia-industry collaboration project and elaborates on the challenges...... of performing bit error rate testing at 100Gbps. In particular, we show how Bit Error Rate Testing (BERT) can be performed over an aggregated 100G Attachment Unit Interface (CAUI) by encapsulating the test data in Ethernet frames at line speed. Our results show that framed bit error rate testing can...

  7. Reading boundless error-free bits using a single photon

    Science.gov (United States)

    Guha, Saikat; Shapiro, Jeffrey H.

    2013-06-01

    We address the problem of how efficiently information can be encoded into and read out reliably from a passive reflective surface that encodes classical data by modulating the amplitude and phase of incident light. We show that nature imposes no fundamental upper limit to the number of bits that can be read per expended probe photon and demonstrate the quantum-information-theoretic trade-offs between the photon efficiency (bits per photon) and the encoding efficiency (bits per pixel) of optical reading. We show that with a coherent-state (ideal laser) source, an on-off (amplitude-modulation) pixel encoding, and shot-noise-limited direct detection (an overly optimistic model for commercial CD and DVD drives), the highest photon efficiency achievable in principle is about 0.5 bits read per transmitted photon. We then show that a coherent-state probe can read unlimited bits per photon when the receiver is allowed to make joint (inseparable) measurements on the reflected light from a large block of phase-modulated memory pixels. Finally, we show an example of a spatially entangled nonclassical light probe and a receiver design—constructible using a single-photon source, beam splitters, and single-photon detectors—that can in principle read any number of error-free bits of information. The probe is a single photon prepared in a uniform coherent superposition of multiple orthogonal spatial modes, i.e., a W state. The code and joint-detection receiver complexity required by a coherent-state transmitter to achieve comparable photon efficiency performance is shown to be much higher in comparison to that required by the W-state transceiver, although this advantage rapidly disappears with increasing loss in the system.

  8. Efficient Codes for Writing Equal-bit Information in a WOM Twice

    Directory of Open Access Journals (Sweden)

    Zhongtao Li

    2014-04-01

    Full Text Available In this paper, we concentrate on WOM coding for writing equal-bit information twice (WOM2E. We studied the definition and coding solution of WOM2E. We encoded information via a codeword table and found that WOM2E achieved a better WOM-rate. However, the codeword table for large WOM2E cells is difficult to determine. We also introduced the coding sum rate to define the WOM2E efficiency. The sum rate of WOM2E is the sum of the ratios of information bits to the number of cells each time data is written to memory. In order to obtain the maximum coding sum rate, we can utilize more cells. Furthermore, we discover that, as the number of cells in memory increases, the sum rate is perfectly asymptotic to the logarithm. We use Matlab to calculate the upper bound of the sum rate of WOM2E, and find that it has a value of 1.546

  9. Hanford coring bit temperature monitor development testing results report

    Energy Technology Data Exchange (ETDEWEB)

    Rey, D.

    1995-05-01

    Instrumentation which directly monitors the temperature of a coring bit used to retrieve core samples of high level nuclear waste stored in tanks at Hanford was developed at Sandia National Laboratories. Monitoring the temperature of the coring bit is desired to enhance the safety of the coring operations. A unique application of mature technologies was used to accomplish the measurement. This report documents the results of development testing performed at Sandia to assure the instrumentation will withstand the severe environments present in the waste tanks.

  10. How to deal with malleability of BitCoin transactions

    OpenAIRE

    Andrychowicz, Marcin; Dziembowski, Stefan; Malinowski, Daniel; Mazurek, Łukasz

    2013-01-01

    BitCoin transactions are malleable in a sense that given a transaction an adversary can easily construct an equivalent transaction which has a different hash. This can pose a serious problem in some BitCoin distributed contracts in which changing a transaction's hash may result in the protocol disruption and a financial loss. The problem mostly concerns protocols, which use a "refund" transaction to withdraw a deposit in a case of the protocol interruption. In this short note, we show a gener...

  11. Comparative Design of 16-Bit Sparse-Tree Rsfq Adder

    OpenAIRE

    S. Saddam Hussain; S. Mahaboob Basha

    2014-01-01

    In this paper, we propse 16-bit sparse tree RSFQ adder (Rapid single flux quantam), kogge-stone adder, carry lookahead adder. In general N-bit adders like Ripple carry adder s(slow adders compare to other adders), and carry lookahead adders(area consuming adders) are used in earlier days. But now the most of industries are using parallel prefix adders because of their advantages compare to kogge-stone adder, carry lookahead adder, Our prefix sparse tree adders are faster and ar...

  12. An Efficient Power Optimized 1-bit CMOS Full Adder

    Directory of Open Access Journals (Sweden)

    R.M.Poojithaa

    2013-06-01

    Full Text Available Adders are the most important arithmetic units in a general microprocessor and the major source of power dissipation. Apart from addition, adders are also used in performing useful operations such as subtraction, multiplication, division and address calculation etc. In this paper, we have presented the study of different logic style using 1-bit full adder circuit and we have compared this 1-bit full adder on certain parameters such as power, number of transistor and frequency using microwind and T-spice.

  13. BIT LENGTH REPLACEMENT STEGANOGRAPHY BASED ON DCT COEFFICIENTS

    Directory of Open Access Journals (Sweden)

    K B Shiva Kumar

    2010-08-01

    Full Text Available Steganography is a means of establishing secret communication through public channel in an artistic manner. In this paper, we propose Bit Length Replacement Steganography Based on DCT Coefficients (BLSDCT . The cover image is segmented into 8*8 blocks and DCT is applied on each block. The numbers of payload MSB bits are embedded into DCT coefficients of the cover image based on the values of DCT oefficients. It is observed that the proposed algorithm has better PSNR, Security and capacity compared to the existing algorithm.

  14. Micro-electromechanical memory bit based on magnetic repulsion

    Science.gov (United States)

    López-Suárez, Miquel; Neri, Igor

    2016-09-01

    A bistable micro-mechanical system based on magnetic repulsion is presented exploring its applicability as memory unit where the state of the bit is encoded in the rest position of a deflected cantilever. The non-linearity induced on the cantilever can be tuned through the magnetic interaction intensity between the cantilever magnet and the counter magnet in terms of geometrical parameters. A simple model provides a sound prediction of the behavior of the system. Finally, we measured the energy required to store a bit of information on the system that, for the considered protocols, is bounded by the energy barrier separating the two stable states.

  15. Comodulation masking release in bit-rate reduction systems

    DEFF Research Database (Denmark)

    Vestergaard, Martin D.; Rasmussen, Karsten Bo; Poulsen, Torben

    1999-01-01

    It has been suggested that the level dependence of the upper masking slopebe utilised in perceptual models in bit-rate reduction systems. However,comodulation masking release (CMR) phenomena lead to a reduction of themasking effect when a masker and a probe signal are amplitude modulated withthe...... same frequency. In bit-rate reduction systems the masker would be theaudio signal and the probe signal would represent the quantization noise.Masking curves have been determined for sinusoids and 1-Bark-wide noisemaskers in order to investigate the risk of CMR, when quantizing depths arefixed...

  16. Perceptual importance analysis for H.264/AVC bit allocation

    Institute of Scientific and Technical Information of China (English)

    2008-01-01

    The existing H.264/AVC rate control schemes rarely include the perceptual considerations. As a result, the improvements in visual quality are hardly comparable to those in peak signal-to-noise ratio (PSNR). In this paper, we propose a perceptual importance analysis scheme to accurately abstract the spatial and temporal perceptual characteristics of video contents. Then we perform bit allocation at macroblock (MB) level by adopting a perceptual mode decision scheme, which adaptively updates the Lagrangian multiplier for mode decision according to the perceptual importance of each MB. Simulation results show that the proposed scheme can efficiently reduce bit rates without visual quality degradation.

  17. How to Convert a Flavor of Quantum Bit Commitment

    DEFF Research Database (Denmark)

    Crepeau, Claude; Legare, Frédéric; Salvail, Louis

    2001-01-01

    In this paper we show how to convert a statistically binding but computationally concealing quantum bit commitment scheme into a computationally binding but statistically concealing QBC scheme. For a security parameter n, the construction of the statistically concealing scheme requires O(n2......) executions of the statistically binding scheme. As a consequence, statistically concealing but computationally binding quantum bit commitments can be based upon any family of quantum one-way functions. Such a construction is not known to exist in the classical world....

  18. An improved bit shuffling pixels-based image scrambling method

    Institute of Scientific and Technical Information of China (English)

    ZHAO Hong; WANG Hong-xia; WANG Jin

    2011-01-01

    @@ Compared with the Arnold transform, the image scrambling method based on bit shuffling pixels is much more secure, and has higher efficiency and speed.However, the key space of this bit shuffling pixels based method is too small to resist exhaustive search attack.Therefore, an improved method based on chaos is proposed in this paper.The security of the improved scheme is enhanced by increasing the number of the keys.Theoretical analysis and experimental results show that the proposed method is effective and has higher security.

  19. Video coding bit allocation algorithm over wireless transmission channel

    Institute of Scientific and Technical Information of China (English)

    ZHANG Wei; ZHOU Yuan-hua

    2006-01-01

    For two-way video communications over wireless channels using the automatic repeat request (ARQ) retransmission scheme, TMN8 rate control scheme is not effective in minimizing the number of frames skipped and cannot guarantee video quality during the retransmissions of error packets. This paper presents a joint source channel bit allocation scheme that allocates target bits according to encoder buffer fullness and estimation of channel condition by retransmission information. The results obtained from implementing our scheme in H. 263 + coder over wireless channel model show that our proposed scheme encodes the video sequences with lower and steadier buffer delay, fewer frames skipped and higher average PSNR compared to TMN8.

  20. Modeling of Bit Error Rate in Cascaded 2R Regenerators

    DEFF Research Database (Denmark)

    Öhman, Filip; Mørk, Jesper

    2006-01-01

    This paper presents a simple and efficient model for estimating the bit error rate in a cascade of optical 2R-regenerators. The model includes the influences of of amplifier noise, finite extinction ratio and nonlinear reshaping. The interplay between the different signal impairments and the rege......This paper presents a simple and efficient model for estimating the bit error rate in a cascade of optical 2R-regenerators. The model includes the influences of of amplifier noise, finite extinction ratio and nonlinear reshaping. The interplay between the different signal impairments...

  1. Development of a jet-assisted polycrystalline diamond drill bit

    Energy Technology Data Exchange (ETDEWEB)

    Pixton, D.S.; Hall, D.R.; Summers, D.A.; Gertsch, R.E.

    1997-12-31

    A preliminary investigation has been conducted to evaluate the technical feasibility and potential economic benefits of a new type of drill bit. This bit transmits both rotary and percussive drilling forces to the rock face, and augments this cutting action with high-pressure mud jets. Both the percussive drilling forces and the mud jets are generated down-hole by a mud-actuated hammer. Initial laboratory studies show that rate of penetration increases on the order of a factor of two over unaugmented rotary and/or percussive drilling rates are possible with jet-assistance.

  2. Test Scoring [book review].

    Science.gov (United States)

    Meijer, Rob R.

    2003-01-01

    This book discusses how to obtain test scores and, in particular, how to obtain test scores from tests that consist of a combination of multiple choice and open-ended questions. The strength of the book is that scoring solutions are presented for a diversity of real world scoring problems. (SLD)

  3. A 1.5 bit/s Pipelined Analog-to-Digital Converter Design with Independency of Capacitor Mismatch

    Institute of Scientific and Technical Information of China (English)

    LI Dan; RONG Men-tian; MAO Jun-fa

    2007-01-01

    A new technique which is named charge temporary storage technique (CTST) was presented to improve the linearity of a 1.5 bit/s pipelined analog-to-digital converter (ADC).The residual voltage was obtained from the sampling capacitor, and the other capacitor was just a temporary storage of charge.Then, the linearity produced by the mismatch of these capacitors was eliminated without adding extra capacitor error-averaging amplifiers.The simulation results confirmed the high linearity and low dissipation of pipelined ADCs implemented in CTST, so CTST was a new method to implement high resolution, small size ADCs.

  4. How to Convert a Flavor of Quantum Bit Commitment

    DEFF Research Database (Denmark)

    Crepeau, Claude; Legare, Frédéric; Salvail, Louis

    2001-01-01

    In this paper we show how to convert a statistically binding but computationally concealing quantum bit commitment scheme into a computationally binding but statistically concealing QBC scheme. For a security parameter n, the construction of the statistically concealing scheme requires O(n2) exec...

  5. KEAMANAN CITRA DENGAN WATERMARKING MENGGUNAKAN PENGEMBANGAN ALGORITMA LEAST SIGNIFICANT BIT

    Directory of Open Access Journals (Sweden)

    Kurniawan Kurniawan

    2015-01-01

    Full Text Available Image security is a process to save digital. One method of securing image digital is watermarking using Least Significant Bit algorithm. Main concept of image security using LSB algorithm is to replace bit value of image at specific location so that created pattern. The pattern result of replacing the bit value of image is called by watermark. Giving watermark at image digital using LSB algorithm has simple concept so that the information which is embedded will lost easily when attacked such as noise attack or compression. So need modification like development of LSB algorithm. This is done to decrease distortion of watermark information against those attacks. In this research is divided by 6 process which are color extraction of cover image, busy area search, watermark embed, count the accuracy of watermark embed, watermark extraction, and count the accuracy of watermark extraction. Color extraction of cover image is process to get blue color component from cover image. Watermark information will embed at busy area by search the area which has the greatest number of unsure from cover image. Then watermark image is embedded into cover image so that produce watermarked image using some development of LSB algorithm and search the accuracy by count the Peak Signal to Noise Ratio value. Before the watermarked image is extracted, need to test by giving noise and doing compression into jpg format. The accuracy of extraction result is searched by count the Bit Error Rate value.

  6. Optimization Approaches for Designing a Novel 4-Bit Reversible Comparator

    Science.gov (United States)

    Zhou, Ri-gui; Zhang, Man-qun; Wu, Qian; Li, Yan-cheng

    2013-02-01

    Reversible logic is a new rapidly developed research field in recent years, which has been receiving much attention for calculating with minimizing the energy consumption. This paper constructs a 4×4 new reversible gate called ZRQ gate to build quantum adder and subtraction. Meanwhile, a novel 1-bit reversible comparator by using the proposed ZRQC module on the basis of ZRQ gate is proposed as the minimum number of reversible gates and quantum costs. In addition, this paper presents a novel 4-bit reversible comparator based on the 1-bit reversible comparator. One of the vital important for optimizing reversible logic is to design reversible logic circuits with the minimum number of parameters. The proposed reversible comparators in this paper can obtain superiority in terms of the number of reversible gates, input constants, garbage outputs, unit delays and quantum costs compared with the existed circuits. Finally, MATLAB simulation software is used to test and verify the correctness of the proposed 4-bit reversible comparator.

  7. Steganography forensics method for detecting least significant bit replacement attack

    Science.gov (United States)

    Wang, Xiaofeng; Wei, Chengcheng; Han, Xiao

    2015-01-01

    We present an image forensics method to detect least significant bit replacement steganography attack. The proposed method provides fine-grained forensics features by using the hierarchical structure that combines pixels correlation and bit-planes correlation. This is achieved via bit-plane decomposition and difference matrices between the least significant bit-plane and each one of the others. Generated forensics features provide the susceptibility (changeability) that will be drastically altered when the cover image is embedded with data to form a stego image. We developed a statistical model based on the forensics features and used least square support vector machine as a classifier to distinguish stego images from cover images. Experimental results show that the proposed method provides the following advantages. (1) The detection rate is noticeably higher than that of some existing methods. (2) It has the expected stability. (3) It is robust for content-preserving manipulations, such as JPEG compression, adding noise, filtering, etc. (4) The proposed method provides satisfactory generalization capability.

  8. Forecasting the life of rock-bit journal bearings

    Energy Technology Data Exchange (ETDEWEB)

    Kelly, J.L. (Hughes Tool Co. (US))

    1990-06-01

    This paper describes an analytical procedure for forecasting the life expectancy of rock-bit journal bearings. Actual performance data and reliability analyses are used to establish empirical relationships and a graphic procedure that relates the risk of bearing failure to operating parameters and drilling cost.

  9. Advanced "Dagang" Screw Drill and Man-made Diamond Bit

    Institute of Scientific and Technical Information of China (English)

    Wu Zhenya

    1995-01-01

    @@ Central Machinery Plant, a state enterprise, is a comprehensive petroleum machinery enterprise mainly manufacturing petroleum machinery equipment and drilling & production fillings, also maintaining oilfield construction equipment and submersible electrical pumps. In 1992,the plant was appointed to manufacture positive displacement drill, reciprocating pump, man-made diamond bit, downhole tool and roller precision chain, and to maintain submersible electrical pumps by CNPC.

  10. An Educator’s Guide to Bits, Bytes, and Teaching

    OpenAIRE

    Amitabh Vikram Dwivedi

    2016-01-01

    Book review of: “Technology for Classroom and Online Learning: An Educator’s Guide to Bits, Bytes, and Teaching.” By Samuel M. Kwon, Daniel R. Tomal, and Aram S. Agajanian. Lanham, MD: Rowman and Littlefield, 2016. ISBN 978-1-4758-1544-3

  11. An Educator’s Guide to Bits, Bytes, and Teaching

    Directory of Open Access Journals (Sweden)

    Amitabh Vikram Dwivedi

    2016-11-01

    Full Text Available Book review of: “Technology for Classroom and Online Learning: An Educator’s Guide to Bits, Bytes, and Teaching.” By Samuel M. Kwon, Daniel R. Tomal, and Aram S. Agajanian. Lanham, MD: Rowman and Littlefield, 2016. ISBN 978-1-4758-1544-3

  12. "Material interactions": from atoms & bits to entangled practices

    DEFF Research Database (Denmark)

    Vallgårda, Anna

    and intellectually stimulating panel moderated by Prof. Mikael Wiberg consisting of a number of scholars with a well-developed view on digital materialities to fuel a discussion on material interactions - from atoms & bits to entangled practices. These scholars include: Prof. Hiroshi Ishii, Prof. Paul Dourish...

  13. Different Mass Processing Services in a Bit Repository

    DEFF Research Database (Denmark)

    Jurik, Bolette; Zierau, Eld

    2011-01-01

    This paper investigates how a general bit repository mass processing service using different programming models and platforms can be specified. Such a service is needed in large data archives, especially libraries, where different ways of doing mass processing is needed for different digital libr...

  14. Quantum measurement and entanglement of spin quantum bits in diamond

    NARCIS (Netherlands)

    Pfaff, W.

    2013-01-01

    This thesis presents a set of experiments that explore the possible realisation of a macroscopic quantum network based on solid-state quantum bits. Such a quantum network would allow for studying quantum mechanics on large scales (meters, or even kilometers), and can open new possibilities for

  15. Pinning of written bits in perpendicular recording media

    Energy Technology Data Exchange (ETDEWEB)

    Greaves, S.J.; Muraoka, H. E-mail: muraoka@riec.tohoku.ac.jp; Sonobe, Y.; Schabes, M.; Nakamura, Y

    2001-10-01

    A perpendicular medium comprising two distinct magnetic layers is described. One layer has a granular structure with isolated, exchange-decoupled grains and the other is a continuous, exchange-coupled layer. In the combined structure domain wall movement is restricted and reversed grains within written bits are eliminated. The S/N ratio is improved compared with single layers of either type alone.

  16. Low bit rate near-transparent image coding

    Science.gov (United States)

    Zhu, Bin; Tewfik, Ahmed H.; Gerek, Oemer N.

    1995-04-01

    In this paper, we describe an improved version of our previous approach for low bit rate near- perceptually transparent image compression. The method exploits both frequency and spatial domain visual masking effects and uses a combination of Fourier and wavelet representations to encode different bands. The frequency domain masking model is based on the psychophysical masking experimental data of sinusoidal patterns while the spatial domain masking is computed with a modified version of Girod's model. A discrete cosine transform is used in conjunction with frequency domain masking to encode the low frequency subimages. The medium and high frequency subimages are encoded in the wavelet domain with spatial domain masking. The main improvement over our previous technique is that a better model is used to calculate the tolerable error level for the subimages in the wavelet domain, and a boundary control is used to prevent or reduce the ringing noise in the decoded image. This greatly improves the decoded image quality for the same coding bit rates. Experiments show the approach can achieve very high quality to nearly transparent compression at bit rates of 0.2 to 0.4 bits/pixel for the image Lena.

  17. Quantum measurement and entanglement of spin quantum bits in diamond

    NARCIS (Netherlands)

    Pfaff, W.

    2013-01-01

    This thesis presents a set of experiments that explore the possible realisation of a macroscopic quantum network based on solid-state quantum bits. Such a quantum network would allow for studying quantum mechanics on large scales (meters, or even kilometers), and can open new possibilities for appli

  18. Analysis of bit-rock interaction during stick-slip vibrations using PDC cutting force model

    Energy Technology Data Exchange (ETDEWEB)

    Patil, P.A.; Teodoriu, C. [Technische Univ. Clausthal, Clausthal-Zellerfeld (Germany). ITE

    2013-08-01

    Drillstring vibration is one of the limiting factors maximizing the drilling performance and also causes premature failure of drillstring components. Polycrystalline diamond compact (PDC) bit enhances the overall drilling performance giving the best rate of penetrations with less cost per foot but the PDC bits are more susceptible to the stick slip phenomena which results in high fluctuations of bit rotational speed. Based on the torsional drillstring model developed using Matlab/Simulink for analyzing the parametric influence on stick-slip vibrations due to drilling parameters and drillstring properties, the study of relations between weight on bit, torque on bit, bit speed, rate of penetration and friction coefficient have been analyzed. While drilling with the PDC bits, the bit-rock interaction has been characterized by cutting forces and the frictional forces. The torque on bit and the weight on bit have both the cutting component and the frictional component when resolved in horizontal and vertical direction. The paper considers that the bit is undergoing stick-slip vibrations while analyzing the bit-rock interaction of the PDC bit. The Matlab/Simulink bit-rock interaction model has been developed which gives the average cutting torque, T{sub c}, and friction torque, T{sub f}, values on cutters as well as corresponding average weight transferred by the cutting face, W{sub c}, and the wear flat face, W{sub f}, of the cutters value due to friction.

  19. Experimental study of rock-breaking with an offset single cone bit

    Institute of Scientific and Technical Information of China (English)

    Chen Yinghua

    2008-01-01

    An experimental study of rock-breaking with an offset single cone bit was completed on the bit bench test equipment.Data such as transmission ratio,weight on bit (WOB),rate of penetration (ROP)and torque on bit were acquired in the experiments.Based on analyzing the experimental results,several conclusions were drawn as follows.The transmission ratio of the offset single-cone bit changed slightly with rotary speed of bit,weight on bit and offset distance.The rate of penetration of the offset singlecone bit increased with increase of WOB and offset distance.The torque on bit increased with increase of offset distance under the same WOB and bit rotary speed,decreased with increase of bit rotary speed under the same WOB.The rock-breaking mechanism of the offset single-cone bit was a scraping action.This indicates that the offset single-cone bit is a chipping type bit.

  20. Estimating Hardness from the USDC Tool-Bit Temperature Rise

    Science.gov (United States)

    Bar-Cohen, Yoseph; Sherrit, Stewart

    2008-01-01

    A method of real-time quantification of the hardness of a rock or similar material involves measurement of the temperature, as a function of time, of the tool bit of an ultrasonic/sonic drill corer (USDC) that is being used to drill into the material. The method is based on the idea that, other things being about equal, the rate of rise of temperature and the maximum temperature reached during drilling increase with the hardness of the drilled material. In this method, the temperature is measured by means of a thermocouple embedded in the USDC tool bit near the drilling tip. The hardness of the drilled material can then be determined through correlation of the temperature-rise-versus-time data with time-dependent temperature rises determined in finite-element simulations of, and/or experiments on, drilling at various known rates of advance or known power levels through materials of known hardness. The figure presents an example of empirical temperature-versus-time data for a particular 3.6-mm USDC bit, driven at an average power somewhat below 40 W, drilling through materials of various hardness levels. The temperature readings from within a USDC tool bit can also be used for purposes other than estimating the hardness of the drilled material. For example, they can be especially useful as feedback to control the driving power to prevent thermal damage to the drilled material, the drill bit, or both. In the case of drilling through ice, the temperature readings could be used as a guide to maintaining sufficient drive power to prevent jamming of the drill by preventing refreezing of melted ice in contact with the drill.

  1. Bit Rate Reduction of FS-1015 Speech Coder Using Fuzzy ARTMAP and KSOFM Neural Networks

    Directory of Open Access Journals (Sweden)

    Ali Eslamzadeh

    2009-03-01

    Full Text Available The speech spectrum is very sensitive to linear predictive coding (LPC parameters, so small quantization errors may cause unstable synthesis filter. Line spectral pairs (LSPs are more efficient representations than LPC parameters. On the other hand, artificial neural networks (ANNs have been used successfully to improving the quality and also reduction the computational complexity of speech coders. This work proposes an efficient technique to reduce the bit rate of FS-1015 speech coder, while improving the performance. In this way, LSP parameters are used instead of the LPC parameters. In addition, neural vector quantizers based on Kohonen self-organizing feature map (KSOFM, with a modified-supervised training algorithm, and fuzzy ARTMAP are also employed to reduce the bit rate. By using the mentioned neural vector quantizer models, the quality of synthesized speech, in terms of mean opinion score (MOS, is improved 0.13 and 0.26, respectively. The execution time of proposed models, as compared to FS-1015 standard, is also reduced 27% and 43%, respectively.

  2. Design of the 12-bit Delta-Sigma Modulator using SC Technique for Vibration Sensor Output Processing

    OpenAIRE

    Pavlik, M; Kledrowetz, V.; J. Haze

    2012-01-01

    The work deals with the design of the 12-bit Delta-Sigma modulator using switched capacitors (SC) technique. The modulator serves to vibration sensor output processing. The first part describes the Delta-Sigma modulator parameters definition. Results of the proposed topology ideal model were presented as well. Next, the Delta-Sigma modulator circuitry on the transistor level was done. The ONSemiconductor I2T100 0.7 um CMOS technology was used for design. Then, the Delta-Sigma modulator nonide...

  3. Subgroup Balancing Propensity Score

    OpenAIRE

    DONG, JING; Zhang, Junni L; Li, Fan

    2017-01-01

    We investigate the estimation of subgroup treatment effects with observational data. Existing propensity score matching and weighting methods are mostly developed for estimating overall treatment effect. Although the true propensity score should balance covariates for the subgroup populations, the estimated propensity score may not balance covariates for the subgroup samples. We propose the subgroup balancing propensity score (SBPS) method, which selects, for each subgroup, to use either the ...

  4. The Apgar Score.

    Science.gov (United States)

    2015-10-01

    The Apgar score provides an accepted and convenient method for reporting the status of the newborn infant immediately after birth and the response to resuscitation if needed. The Apgar score alone cannot be considered as evidence of, or a consequence of, asphyxia; does not predict individual neonatal mortality or neurologic outcome; and should not be used for that purpose. An Apgar score assigned during resuscitation is not equivalent to a score assigned to a spontaneously breathing infant. The American Academy of Pediatrics and the American College of Obstetricians and Gynecologists encourage use of an expanded Apgar score reporting form that accounts for concurrent resuscitative interventions.

  5. Modular trigger processing The GCT muon and quiet bit system

    CERN Document Server

    Stettler, Matthew; Hansen, Magnus; Iles, Gregory; Jones, John; PH-EP

    2007-01-01

    The CMS Global Calorimeter Trigger system's HCAL Muon and Quiet bit reformatting function is being implemented with a novel processing architecture. This architecture utilizes micro TCA, a modern modular communications standard based on high speed serial links, to implement a processing matrix. This matrix is configurable in both logical functionality and data flow, allowing far greater flexibility than current trigger processing systems. In addition, the modular nature of this architecture allows flexibility in scale unmatched by traditional approaches. The Muon and Quiet bit system consists of two major components, a custom micro TCA backplane and processing module. These components are based on Xilinx Virtex5 and Mindspeed crosspoint switch devices, bringing together state of the art FPGA based processing and Telcom switching technologies.

  6. Implementation of Variable Least Significant Bits Stegnographyusing DDDB Algorithm

    Directory of Open Access Journals (Sweden)

    Sahib Khan

    2011-11-01

    Full Text Available Nobody can deny the importance of secure communication.Different techniques are being utilized to achieve this task. Image Stegnography is one such method in which we hide data in an otherwise ordinary image. In this paper, a novel Stegnographic technique named as Variable Least Significant Bits Stegnography (VLSB is proposed. To implement VLSB, we designed an algorithm named as Decreasing Distance Decreasing Bits Algorithm (DDDBA. In each test we performed, the data hiding capacity was always greater than 50 % ( a barrier considered in image Stegnography, ranging up to 69 % with signal to noise ratio varying from 10 db to 5 db respectively. The DDDBA provides self encryption mechanism in VLSB Stegnography, making the Steganalysis more difficult.

  7. Efficient biased random bit generation for parallel processing

    Energy Technology Data Exchange (ETDEWEB)

    Slone, D.M.

    1994-09-28

    A lattice gas automaton was implemented on a massively parallel machine (the BBN TC2000) and a vector supercomputer (the CRAY C90). The automaton models Burgers equation {rho}t + {rho}{rho}{sub x} = {nu}{rho}{sub xx} in 1 dimension. The lattice gas evolves by advecting and colliding pseudo-particles on a 1-dimensional, periodic grid. The specific rules for colliding particles are stochastic in nature and require the generation of many billions of random numbers to create the random bits necessary for the lattice gas. The goal of the thesis was to speed up the process of generating the random bits and thereby lessen the computational bottleneck of the automaton.

  8. MIMO ARQ with Multi-bit Feedback: Outage Analysis

    CERN Document Server

    Nguyen, Khoa D; Fabregas, Albert Guillen i; Letzepis, Nick

    2010-01-01

    We study the asymptotic outage performance of incremental redundancy automatic repeat request (INR-ARQ) transmission over the multiple-input multiple-output (MIMO) block-fading channels with discrete input constellations. We first show that transmission with random codes using a discrete signal constellation across all transmit antennas achieves the optimal outage diversity given by the Singleton bound. We then analyze the optimal SNR-exponent and outage diversity of INR-ARQ transmission over the MIMO block-fading channel. We show that a significant gain in outage diversity is obtained by providing more than one bit feedback at each ARQ round. Thus, the outage performance of INR-ARQ transmission can be remarkably improved with minimal additional overhead. A suboptimal feedback and power adaptation rule, which achieves the optimal outage diversity, is proposed for MIMO INR-ARQ, demonstrating the benefits provided by multi-bit feedback.

  9. A novel chaotic encryption scheme based on pseudorandom bit padding

    CERN Document Server

    Sadra, Yaser; Fard, Zahra Arasteh

    2012-01-01

    Cryptography is always very important in data origin authentications, entity authentication, data integrity and confidentiality. In recent years, a variety of chaotic cryptographic schemes have been proposed. These schemes has typical structure which performed the permutation and the diffusion stages, alternatively. The random number generators are intransitive in cryptographic schemes and be used in the diffusion functions of the image encryption for diffused pixels of plain image. In this paper, we propose a chaotic encryption scheme based on pseudorandom bit padding that the bits be generated by a novel logistic pseudorandom image algorithm. To evaluate the security of the cipher image of this scheme, the key space analysis, the correlation of two adjacent pixels and differential attack were performed. This scheme tries to improve the problem of failure of encryption such as small key space and level of security.

  10. Statistical mechanics analysis of thresholding 1-bit compressed sensing

    CERN Document Server

    Xu, Yingying

    2016-01-01

    The one-bit compressed sensing framework aims to reconstruct a sparse signal by only using the sign information of its linear measurements. To compensate for the loss of scale information, past studies in the area have proposed recovering the signal by imposing an additional constraint on the L2-norm of the signal. Recently, an alternative strategy that captures scale information by introducing a threshold parameter to the quantization process was advanced. In this paper, we analyze the typical behavior of the thresholding 1-bit compressed sensing utilizing the replica method of statistical mechanics, so as to gain an insight for properly setting the threshold value. Our result shows that, fixing the threshold at a constant value yields better performance than varying it randomly when the constant is optimally tuned, statistically. Unfortunately, the optimal threshold value depends on the statistical properties of the target signal, which may not be known in advance. In order to handle this inconvenience, we ...

  11. b.i.t. Bremerhaven: Thin Clients entlasten Schulen

    Science.gov (United States)

    Das Schulamt Bremerhaven zentralisiert die Verwaltungs-IT und schafft dadurch Freiräume für pädagogische und organisatorische Herausforderungen. Pflege und Support der neuen Infrastruktur übernimmt der Dienstleister b.i.t. Bremerhaven, die Thin Clients kommen vom Bremer Hersteller IGEL Technology. Ganztagsschulen, das 12-jährige Abitur, PISA, der Wegfall der Orientierungsstufe - deutsche Schulen müssen derzeit zahlreiche organisatorische und pädagogische Herausforderungen bewältigen. Um die neuen Strukturen umsetzen zu können, werden zusätzliche Ressourcen benötigt. Das Schulamt Bremerhaven hat gemeinsam mit dem Dienstleister b.i.t. Bremerhaven (Betrieb für Informationstechnologie) eine intelligente Lösung gefunden, wie sich die benötigten finanziellen Freiräume schaffen lassen.

  12. Opportunistic Collaborative Beamforming with One-Bit Feedback

    CERN Document Server

    Pun, Man-On; Poor, H Vincent

    2008-01-01

    An energy-efficient opportunistic collaborative beamformer with one-bit feedback is proposed for ad hoc sensor networks over Rayleigh fading channels. In contrast to conventional collaborative beamforming schemes in which each source node uses channel state information to correct its local carrier offset and channel phase, the proposed beamforming scheme opportunistically selects a subset of source nodes whose received signals combine in a quasi-coherent manner at the intended receiver. No local phase-precompensation is performed by the nodes in the opportunistic collaborative beamformer. As a result, each node requires only one-bit of feedback from the destination in order to determine if it should or shouldn't participate in the collaborative beamformer. Theoretical analysis shows that the received signal power obtained with the proposed beamforming scheme scales linearly with the number of available source nodes. Since the the optimal node selection rule requires an exhaustive search over all possible subs...

  13. Quantum communication based on orthogonal states enables quantum bit commitment

    CERN Document Server

    He, Guang Ping

    2011-01-01

    For more than a decade, it was believed that unconditionally secure quantum bit commitment (QBC) is impossible. But basing on a formerly proposed quantum communication scheme using orthogonal states, here we build a QBC protocol in which the density matrices of the quantum states encoding the commitment do not satisfy a crucial condition on which the impossibility proofs of QBC are based. Thus unconditional security can be achieved. Our protocol is very feasible with currently available technology. It re-opens the venue for other "post-cold-war" multi-party cryptographic protocols, e.g., unconditionally secure quantum bit string commitment and quantum strong coin tossing with an arbitrarily small bias. This result also has a strong influence on the Clifton-Bub-Halvorson theorem which suggests that quantum theory could be characterized in terms of information-theoretic constraints.

  14. ZTE IPTV Low Bit Rate High Definition Transcoding Solution Nominated for Global IPTV Industry Award

    Institute of Scientific and Technical Information of China (English)

    2012-01-01

    ZTE Corporation announced on 1 March that its innovative IPTVlowbitrate highdefinition transcoding solution has been nominated for the World's Best Component or Enabler Award by the IPTV World Forum. The ZTE solution is on display at the Mobile World Congress 2012 (MWC 2012) in Barcelona.

  15. Bringing Definitions into High Definition

    Science.gov (United States)

    Mason, John

    2010-01-01

    Why do definitions play such a central role in mathematics? It may seem obvious that precision about the terms one uses is necessary in order to use those terms reasonably (while reasoning). Definitions are chosen so as to be definite about the terms one uses, but also to make both the statement of, and the reasoning to justify, theorems as…

  16. Design of 1.5 bit quantization correlator in satellite navigation software receiver

    Institute of Scientific and Technical Information of China (English)

    Hongwei Zhou; Tian Jin; Fangyao L

    2016-01-01

    Currently, 1 bit or 2 bit signal quantization is widely used in satelite navigation software receivers. The bit-wise paralel algorithm has been proposed for 1 bit and 2 bit signal quantization, which performs correlation with high efficiency. In order to improve the performance of the correlator, this paper proposes a new 1.5 bit quantization method. Theoreti-cal analyses are made from the aspects of complexity and quantization loss, and performance comparison between 1.5 bit quantization correlator and traditional correlators is dis-cussed. The results show that the 1.5 bit quantization algo-rithm can save about 30 percent complexity under similar quantization loss, reduce more than 0.5 dB signal noise ratio (SNR) loss under similar complexity. It shows great perform-ance improvement for correlators of satelite navigation soft-ware receivers.

  17. Small digital recording head has parallel bit channels, minimizes cross talk

    Science.gov (United States)

    Eller, E. E.; Laue, E. G.

    1964-01-01

    A small digital recording head consists of closely spaced parallel wires, imbedded in a ferrite block to concentrate the magnetic flux. Parallel-recorded information bits are converted into serial bits on moving magnetic tape and cross talk is suppressed.

  18. Secure and Efficient Pseudorandom Bit Generator for Chaotic Stream Ciphers

    Institute of Scientific and Technical Information of China (English)

    WANG Xiao-Min; ZHANG Jia-Shu

    2007-01-01

    Based on the entropy criterion and n-dimensional uniform distribution of nonlinear digital filter (NDF), we present an efficient NDF-based pseudorandom bit generator (NDF-PRBG) for chaotic stream ciphers. The cryptographic properties of the proposed NDF-PRBG are analysed, and some experiments are made. The results show that it has desirable cryptographic properties, and can be used to construct secure stream ciphers with high speed.

  19. Ballistic bit addressing in a magnetic memory cell array

    OpenAIRE

    Schumacher, H. W.

    2005-01-01

    A ringing free bit addressing scheme for magnetic memories like MRAM (magnetic random access memory) is proposed. As in standard MRAM addressing schemes the switching of a selected cell is obtained by the combination of two half-select field pulses. Numerical solutions of a single spin model of an MRAM cell show that the pulse parameters can be chosen such that the application of the half select pulse induces a full precessional turn of the magnetization (no switch) whereas the superposition ...

  20. 超便携PC亮相CeBit

    Institute of Scientific and Technical Information of China (English)

    胡纲

    2006-01-01

    微软终于在德国汉诺威举行的CeBIT 2006科技展示上揭开了所谓Origami项目的神秘面纱:原来这是一种使用Windows XP Tablet操作系统,具有触摸屏和无线连接的超便携PC (UltraMobile PC,简称UMPC)。

  1. Amorphous Silicon 16—bit Array Photodetector①

    Institute of Scientific and Technical Information of China (English)

    ZHANGShaoqiang; XUZhongyang; 等

    1997-01-01

    An amorphous silicon 16-bit array photodetector with the a-SiC/a-Si heterojunction diode is presented.The fabrication processes of the device were studied systematically.By the optimum of the diode structure and the preparation procedures,the diode with Id<10-12A/mm2 and photocurrentIp≥0.35A/W has been obtained at the wavelength of 632nm.

  2. Secure Classical Bit Commitment using Fixed Capacity Communication Channels

    OpenAIRE

    Kent, Adrian

    1999-01-01

    If mutually mistrustful parties A and B control two or more appropriately located sites, special relativity can be used to guarantee that a pair of messages exchanged by A and B are independent. In earlier work, we used this fact to define a relativistic bit commitment protocol, RBC1, in which security is maintained by exchanging a sequence of messages whose transmission rate increases exponentially in time. We define here a new relativistic protocol, RBC2, which requires only a constant tran...

  3. Generating bit reversed numbers for calculating fast fourier transform

    Digital Repository Service at National Institute of Oceanography (India)

    Suresh, T.

    (6) x (7)). Calculation of FFT becomes a difficult task for computation with input data in natural order and without reordering. Thus an efficient method of reordering is required for FFT calculation. We review a few methods of generating bit... with each successive stage. Other algorithms that depend on the efficient use of swapping data from an array are given in Buneman (1986) Evans (1987) and Walker (1990). Swapping of data is the most widely used method for reordering in FFT calculation. A...

  4. Delay Efficient 32-Bit Carry-Skip Adder

    OpenAIRE

    Yu Shen Lin; Damu Radhakrishnan

    2008-01-01

    The design of a 32-bit carry-skip adder to achieve minimum delay is presented in this paper. A fast carry look-ahead logic using group generate and group propagate functions is used to speed up the performance of multiple stages of ripple carry adders. The group generate and group propagate functions are generated in parallel with the carry generation for each block. The optimum block sizes are decided by considering the critical path into account. The new architecture ...

  5. A 64 Bits Rotor Enhanced Block Cipher (Rebc3

    Directory of Open Access Journals (Sweden)

    Ahmed ElShafee

    2013-04-01

    Full Text Available This paper gives a new proposed cryptosystem (REBC3 that is designed to take advantages of the new generation of 64bits microprocessors which commercially known as x64 systems. The old version REBC2,which was published in Africon 2007. REBC2 was basically developed for the 32bits microprocessors which is commercially known as x86 systems. REBC3 like REBC2 use the concept of rotor enhanced blockcipher which was initially proposed by the author in [NRSC 2002] on the first version of REBC. REBC2 used the same concept from a another point of view, which is using rotors to achieve two basiccryptographic operations; permutation, and substitution. Round key is generated using rotor too, which is used to achieve ciphertext key dependency. To enhance non-linearity and to resist linear cryptanalysis,REBC3 has a variable block, and key lengths. Each round has its own block length which depends on round the key and round key length. Dependency is based upon the previous round generated key. Rotors implemented using successive affine transformation . The 32 bits version was proposed in KAMFEE cipher, then the 64bits version was proposed in KAMFEE-X64 cipher. This achieved memory-less, normalized ciphertext statistics, and small processing speed trend. The strength of this system is compared with the REBC2 and RIJNDAEL (AES ciphers.REBC3 cipher gives excellent results from security characteristics and statistical point of view of. So authors suggests to use REBC3 in the area of banking and electronic fund transfer.

  6. CMOS Bit-Stream Band-Pass Beamforming

    Science.gov (United States)

    2016-03-31

    the Antenna Inputs,” IEEE Journal of Solid-State Circuits, Jun., 2014. 4. H. Aliakbarian, et al., “Analogue versus Digital for Baseband Beam...Arbor, Michigan, USA, 48109 Abstract: We introduce a unique bandpass ΣΔ based common module with reconfigurable, bit-stream based digital beam...forming (DBF). An array of bandpass ΣΔ modulators accurately and efficiently digitizes the IF signals. Beam-forming is implemented directly through

  7. Efficient Face Recognition in Video by Bit Planes Slicing

    Directory of Open Access Journals (Sweden)

    Srinivasa R. Inbathini

    2012-01-01

    Full Text Available Problem statement: Video-based face recognition must be able to overcome the imaging interference such as pose and illumination. Approach: A model is designed to study for face recognition based on video sequence and also test image. In training stage, single frontal image is taken as a input to the recognition system. A new virtual image is generated using bit plane feature fusion to effectively reduce the sensitivity to illumination variances. A Self-PCA is performed to get each set of Eigen faces and to get projected image. In recognition stage, automatic face detection scheme is first applied to the video sequences. Frames are extracted from the video and virtual frame is created. Each bit plane of test face is extracted and then the feature fusion face is constructed, followed by the projection and reconstruction using each set of the corresponding Eigen faces. Results: This algorithm is compared with conventional PCA algorithm. The minimum error of reconstruction is calculated. If error is less than a threshold value, then it recognizes the face from the database. Conclusion: Bit plane slicing mechanism is applied in video based face recognition. Experimental results shows that its far more superior than conventional method under various pose and illumination condition.

  8. Development of Deduced Protein Database Using Variable Bit Binary Encoding

    Directory of Open Access Journals (Sweden)

    B. Parvathavarthini

    2008-01-01

    Full Text Available A large amount of biological data is semi-structured and stored in any one the following file formats such as flat, XML and relational files. These databases must be integrated with the structured data available in relational or object-oriented databases. The sequence matching process is difficult in such file format, because string comparison takes more computation cost and time. To reduce the memory storage size of amino acid sequence in protein database, a novel probability-based variable bit length encoding technique has been introduced. The number of mapping of triplet CODON for every amino acid evaluates the probability value. Then, a binary tree has been constructed to assign unique bits of binary codes to each amino acid. This derived unique bit pattern of amino acid replaces the existing fixed byte representation. The proof of reduced protein database space has been discussed and it is found to be reduced between 42.86 to 87.17%. To validate our method, we have collected few amino acid sequences of major organisms like Sheep, Lambda phage and etc from NCBI and represented them using proposed method. The comparison shows that of minimum and maximum reduction in storage space are 43.30% and 72.86% respectively. In future the biological data can further be reduced by applying lossless compression on this deduced data.

  9. Low Power 256-bit Modified Carry Select Adder

    Directory of Open Access Journals (Sweden)

    P. Ramani

    2014-09-01

    Full Text Available Carry Select Adder (CSLA is one of the high speed adders used in many computational systems to perform fast arithmetic operations. When compared to earlier Ripple Carry Adder and Carry Look Ahead Adder, Regular CSLA (R-CSLA is observed to provide optimized results in terms of area. This study proposes an efficient method which replaces the RCA using BEC. The modified CSLA architecture has been developed using gate-level modification to significantly reduce the delay and power of the CSLA. Based on this modification 8-, 16-, 32-, 64- and 128-bit Square-Root CSLA (SQRT CSLA architecture have been developed and compared with the regular SQRT CSLA architecture. The proposed design for 256-bit has reduced power and delay as compared with the regular SQRT CSLA. Designs were developed using structural Verilog module and synthesized using Xilinx ISE simulator and the implementation is done in cadence RTL compiler using 0.18 µm technology. For 256-bit addition in this study, it is proposed to simple gate level modification which significantly reduces the power by 19.4% when compared with R-CSLA. The result analysis shows that the proposed architecture achieves two folded advantages in terms of delay and power.

  10. On the Lorentz invariance of bit-string geometry

    Energy Technology Data Exchange (ETDEWEB)

    Noyes, H.P.

    1995-09-01

    We construct the class of integer-sided triangles and tetrahedra that respectively correspond to two or three discriminately independent bit-strings. In order to specify integer coordinates in this space, we take one vertex of a regular tetrahedron whose common edge length is an even integer as the origin of a line of integer length to the {open_quotes}point{close_quotes} and three integer distances to this {open_quotes}point{close_quotes} from the three remaining vertices of the reference tetrahedron. This - usually chiral - integer coordinate description of bit-string geometry is possible because three discriminately independent bit-strings generate four more; the Hamming measures of these seven strings always allow this geometrical interpretation. On another occasion we intend to prove the rotational invariance of this coordinate description. By identifying the corners of these figures with the positions of recording counters whose clocks are synchronized using the Einstein convention, we define velocities in this space. This suggests that it may be possible to define boosts and discrete Lorentz transformations in a space of integer coordinates. We relate this description to our previous work on measurement accuracy and the discrete ordered calculus of Etter and Kauffman (DOC).

  11. Biometric Quantization through Detection Rate Optimized Bit Allocation

    Science.gov (United States)

    Chen, C.; Veldhuis, R. N. J.; Kevenaar, T. A. M.; Akkermans, A. H. M.

    2009-12-01

    Extracting binary strings from real-valued biometric templates is a fundamental step in many biometric template protection systems, such as fuzzy commitment, fuzzy extractor, secure sketch, and helper data systems. Previous work has been focusing on the design of optimal quantization and coding for each single feature component, yet the binary string—concatenation of all coded feature components—is not optimal. In this paper, we present a detection rate optimized bit allocation (DROBA) principle, which assigns more bits to discriminative features and fewer bits to nondiscriminative features. We further propose a dynamic programming (DP) approach and a greedy search (GS) approach to achieve DROBA. Experiments of DROBA on the FVC2000 fingerprint database and the FRGC face database show good performances. As a universal method, DROBA is applicable to arbitrary biometric modalities, such as fingerprint texture, iris, signature, and face. DROBA will bring significant benefits not only to the template protection systems but also to the systems with fast matching requirements or constrained storage capability.

  12. Tit-Bits, New Journalism, and early Sherlock Holmes fandom

    Directory of Open Access Journals (Sweden)

    Ann K. McClellan

    2017-03-01

    Full Text Available The Strand's more popular sister magazine, Tit-Bits, played a significant role in establishing Sherlock Holmes as a literary and cultural icon, particularly through its use of participatory practices, cross-promotion, and transmedia storytelling. I argue that Tit-Bits' late 19th-century New Journalism techniques like contests and prizes, inquiry columns, correspondence, and internal advertising fostered a corporately devised participatory fandom that directly contributed to Sherlock Holmes's popularity. Tit-Bits audiences were invited and encouraged to imagine new scenarios for their favorite character that were validated through publication. Such practices not only created a unique identity for Sherlock Holmes fandom but also directly contributed to the creation and maintenance of Holmes's fictional world. With fandom studies reaching more and more audiences—both academic and popular—historicizing early fan practices like the early publication and reception of the Sherlock Holmes stories provides important insight into how audiences have historically responded to, and interacted with, fictional characters, and how they helped sustain and expand those characters' fictional worlds.

  13. Biometric Quantization through Detection Rate Optimized Bit Allocation

    Directory of Open Access Journals (Sweden)

    C. Chen

    2009-01-01

    Full Text Available Extracting binary strings from real-valued biometric templates is a fundamental step in many biometric template protection systems, such as fuzzy commitment, fuzzy extractor, secure sketch, and helper data systems. Previous work has been focusing on the design of optimal quantization and coding for each single feature component, yet the binary string—concatenation of all coded feature components—is not optimal. In this paper, we present a detection rate optimized bit allocation (DROBA principle, which assigns more bits to discriminative features and fewer bits to nondiscriminative features. We further propose a dynamic programming (DP approach and a greedy search (GS approach to achieve DROBA. Experiments of DROBA on the FVC2000 fingerprint database and the FRGC face database show good performances. As a universal method, DROBA is applicable to arbitrary biometric modalities, such as fingerprint texture, iris, signature, and face. DROBA will bring significant benefits not only to the template protection systems but also to the systems with fast matching requirements or constrained storage capability.

  14. Optical Switching and Bit Rates of 40 Gbit/s and above

    DEFF Research Database (Denmark)

    Ackaert, A.; Demester, P.; O'Mahony, M.;

    2003-01-01

    Optical switching in WDM networks introduces additional aspects to the choice of single channel bit rates compared to WDM transmission systems. The mutual impact of optical switching and bit rates of 40 Gbps and above is discussed.......Optical switching in WDM networks introduces additional aspects to the choice of single channel bit rates compared to WDM transmission systems. The mutual impact of optical switching and bit rates of 40 Gbps and above is discussed....

  15. AcEST: BP917329 [AcEST

    Lifescience Database Archive (English)

    Full Text Available : Swiss-Prot (No blast op. Sequence too short.) sp_hit_id - Definition - Align length - Score (bit) - E-value...equence too short.) tr_hit_id - Definition - Align length - Score (bit) - E-value - Report - ...

  16. AcEST: BP916348 [AcEST

    Lifescience Database Archive (English)

    Full Text Available No blast op. Sequence too short.) sp_hit_id - Definition - Align length - Score (bit) - E-value - Report - T...ort.) tr_hit_id - Definition - Align length - Score (bit) - E-value - Report - ...

  17. AcEST: DK944578 [AcEST

    Lifescience Database Archive (English)

    Full Text Available iss-Prot (No blast op. Sequence too short.) sp_hit_id - Definition - Align length - Score (bit) - E-value...nce too short.) tr_hit_id - Definition - Align length - Score (bit) - E-value - Report - ...

  18. AcEST: DK956073 [AcEST

    Lifescience Database Archive (English)

    Full Text Available Swiss-Prot (No blast op. Sequence too short.) sp_hit_id - Definition - Align length - Score (bit) - E-valu...uence too short.) tr_hit_id - Definition - Align length - Score (bit) - E-value - Report - ...

  19. AcEST: BP921482 [AcEST

    Lifescience Database Archive (English)

    Full Text Available ot (No blast op. Sequence too short.) sp_hit_id - Definition - Align length - Score (bit) - E-value - Report...o short.) tr_hit_id - Definition - Align length - Score (bit) - E-value - Report - ...

  20. AcEST: DK945353 [AcEST

    Lifescience Database Archive (English)

    Full Text Available t (No blast op. Sequence too short.) sp_hit_id - Definition - Align length - Score (bit) - E-value... short.) tr_hit_id - Definition - Align length - Score (bit) - E-value - Report - ...

  1. AcEST: BP917667 [AcEST

    Lifescience Database Archive (English)

    Full Text Available blast op. Sequence too short.) sp_hit_id - Definition - Align length - Score (bit) - E-value - Report - TrE...t.) tr_hit_id - Definition - Align length - Score (bit) - E-value - Report - ...

  2. AcEST: DK944134 [AcEST

    Lifescience Database Archive (English)

    Full Text Available t (No blast op. Sequence too short.) sp_hit_id - Definition - Align length - Score (bit) - E-value... short.) tr_hit_id - Definition - Align length - Score (bit) - E-value - Report - ...

  3. AcEST: BP917876 [AcEST

    Lifescience Database Archive (English)

    Full Text Available Prot (No blast op. Sequence too short.) sp_hit_id - Definition - Align length - Score (bit) - E-value - Repo...too short.) tr_hit_id - Definition - Align length - Score (bit) - E-value - Report - ...

  4. AcEST: BP921297 [AcEST

    Lifescience Database Archive (English)

    Full Text Available blast op. Sequence too short.) sp_hit_id - Definition - Align length - Score (bit) - E-value - Report - TrE...t.) tr_hit_id - Definition - Align length - Score (bit) - E-value - Report - ...

  5. AcEST: DK945128 [AcEST

    Lifescience Database Archive (English)

    Full Text Available rot (No blast op. Sequence too short.) sp_hit_id - Definition - Align length - Score (bit) - E-value...oo short.) tr_hit_id - Definition - Align length - Score (bit) - E-value - Report - ...

  6. AcEST: BP912385 [AcEST

    Lifescience Database Archive (English)

    Full Text Available wiss-Prot (No blast op. Sequence too short.) sp_hit_id - Definition - Align length - Score (bit) - E-value -...ence too short.) tr_hit_id - Definition - Align length - Score (bit) - E-value - Report - ...

  7. AcEST: BP915503 [AcEST

    Lifescience Database Archive (English)

    Full Text Available blast op. Sequence too short.) sp_hit_id - Definition - Align length - Score (bit) - E-value - Report - TrEM....) tr_hit_id - Definition - Align length - Score (bit) - E-value - Report - ...

  8. AcEST: BP920903 [AcEST

    Lifescience Database Archive (English)

    Full Text Available Prot (No blast op. Sequence too short.) sp_hit_id - Definition - Align length - Score (bit) - E-value - Report...too short.) tr_hit_id - Definition - Align length - Score (bit) - E-value - Report - ...

  9. AcEST: DK945519 [AcEST

    Lifescience Database Archive (English)

    Full Text Available ss-Prot (No blast op. Sequence too short.) sp_hit_id - Definition - Align length - Score (bit) - E-value...ce too short.) tr_hit_id - Definition - Align length - Score (bit) - E-value - Report - ...

  10. AcEST: DK959161 [AcEST

    Lifescience Database Archive (English)

    Full Text Available No blast op. Sequence too short.) sp_hit_id - Definition - Align length - Score (bit) - E-value...ort.) tr_hit_id - Definition - Align length - Score (bit) - E-value - Report - ...

  11. AcEST: BP914910 [AcEST

    Lifescience Database Archive (English)

    Full Text Available Prot (No blast op. Sequence too short.) sp_hit_id - Definition - Align length - Score (bit) - E-value - Repo...too short.) tr_hit_id - Definition - Align length - Score (bit) - E-value - Report - ...

  12. AcEST: DK944833 [AcEST

    Lifescience Database Archive (English)

    Full Text Available (No blast op. Sequence too short.) sp_hit_id - Definition - Align length - Score (bit) - E-value...short.) tr_hit_id - Definition - Align length - Score (bit) - E-value - Report - ...

  13. AcEST: DK943690 [AcEST

    Lifescience Database Archive (English)

    Full Text Available s-Prot (No blast op. Sequence too short.) sp_hit_id - Definition - Align length - Score (bit) - E-value...e too short.) tr_hit_id - Definition - Align length - Score (bit) - E-value - Report - ...

  14. AcEST: BP918763 [AcEST

    Lifescience Database Archive (English)

    Full Text Available (No blast op. Sequence too short.) sp_hit_id - Definition - Align length - Score (bit) - E-value - Report -...short.) tr_hit_id - Definition - Align length - Score (bit) - E-value - Report - ...

  15. AcEST: BP915201 [AcEST

    Lifescience Database Archive (English)

    Full Text Available blast op. Sequence too short.) sp_hit_id - Definition - Align length - Score (bit) - E-value - Report - TrE...t.) tr_hit_id - Definition - Align length - Score (bit) - E-value - Report - ...

  16. AcEST: BP912619 [AcEST

    Lifescience Database Archive (English)

    Full Text Available (No blast op. Sequence too short.) sp_hit_id - Definition - Align length - Score (bit) - E-value - Report -...short.) tr_hit_id - Definition - Align length - Score (bit) - E-value - Report - ...

  17. AcEST: BP916763 [AcEST

    Lifescience Database Archive (English)

    Full Text Available (No blast op. Sequence too short.) sp_hit_id - Definition - Align length - Score (bit) - E-value - Report - ...hort.) tr_hit_id - Definition - Align length - Score (bit) - E-value - Report - ...

  18. AcEST: BP919034 [AcEST

    Lifescience Database Archive (English)

    Full Text Available blast op. Sequence too short.) sp_hit_id - Definition - Align length - Score (bit) - E-value - Report - TrEM....) tr_hit_id - Definition - Align length - Score (bit) - E-value - Report - ...

  19. AcEST: BP913108 [AcEST

    Lifescience Database Archive (English)

    Full Text Available : Swiss-Prot (No blast op. Sequence too short.) sp_hit_id - Definition - Align length - Score (bit) - E-value...equence too short.) tr_hit_id - Definition - Align length - Score (bit) - E-value - Report - ...

  20. AcEST: DK944583 [AcEST

    Lifescience Database Archive (English)

    Full Text Available (No blast op. Sequence too short.) sp_hit_id - Definition - Align length - Score (bit) - E-value...short.) tr_hit_id - Definition - Align length - Score (bit) - E-value - Report - ...

  1. AcEST: BP911939 [AcEST

    Lifescience Database Archive (English)

    Full Text Available -Prot (No blast op. Sequence too short.) sp_hit_id - Definition - Align length - Score (bit) - E-value - Rep... too short.) tr_hit_id - Definition - Align length - Score (bit) - E-value - Report - ...

  2. AcEST: BP917838 [AcEST

    Lifescience Database Archive (English)

    Full Text Available wiss-Prot (No blast op. Sequence too short.) sp_hit_id - Definition - Align length - Score (bit) - E-value -...ence too short.) tr_hit_id - Definition - Align length - Score (bit) - E-value - Report - ...

  3. BitTorrent系统中free riders的研究%A study on free riders in BitTorrent system

    Institute of Scientific and Technical Information of China (English)

    于魁飞; 程久军; 李玉宏; 马建

    2007-01-01

    针对BitTorent文件共享过程的特点,根据乐观疏通的思想,利用仿真实验分析了free riders对系统中其他类型的peers的下载进程的影响,给出了识别free riders的方法,提出了解决free riders问题的机制,并进行了仿真实验.结果表明:这种解决free riders问题的机制更好地激励了系统中的peers为系统做出贡献,从而获得利益;有效地控制了BitTorrent系统中的free riders,提高了系统的整体性能.

  4. Design of 1-bit and 2-bit magnitude comparators using electro-optic effect in Mach-Zehnder interferometers

    Science.gov (United States)

    Kumar, Santosh; Bisht, Ashish; Singh, Gurdeep; Choudhary, Kuldeep; Raina, K. K.; Amphawan, Angela

    2015-12-01

    The Mach-Zehnder interferometer (MZI) structures collectively show powerful capability in switching an input optical signal to a desired output port from a collection of output ports. Hence, it is possible to construct complex optical combinational digital circuits using the electro-optic effect constituting MZI structure as a basic building block. Optical switches have been designed for 1-bit and 2-bit magnitude comparators based on electro-optic effect using Mach-Zehnder interferometers. The paper constitutes a mathematical description of the proposed device and thereafter simulation using MATLAB. Analysis of some factors influencing the performances of proposed device has been discussed properly. The study is verified using beam propagation method.

  5. Definitely Life but not Definitively

    Science.gov (United States)

    Oliver, Joan D.; Perry, Randall S.

    2006-12-01

    Although there have been attempts at a definition of life from many disciplines, none is accepted by all as definitive. Some people believe that it is impossible to define ‘life’ adequately at the moment. We agree with this point of view on linguistic grounds, examining the different types of definition, the contexts in which they are used and their relative usefulness as aids to arriving at a scientific definition of life. We look at some of the more recent definitions and analyse them in the light of our criteria for a good definition. We argue that since there are so many linguistic and philosophical difficulties with such a definition of life, what is needed is a series of working descriptions, which are suited to the audience and context in which they are used and useful for the intended purpose. We provide some ideas and examples of the forms these may take.

  6. Annual Report: Support Research for Development of Improved Geothermal Drill Bits

    Energy Technology Data Exchange (ETDEWEB)

    Hendrickson, R.R.; Winzenried, R.W.; Jones, A.H.; Green, S.J.

    1978-07-01

    The work reported herein is a continuation of the program initiated under DOE contract E(10-1)-1546* entitled "Program to Design and Experimentally Test an Improved Geothermal Bit"; the program is now DOE Contract EG-76-C-1546*. The objective of the program has been to accelerate the commercial availability of a tolling cutter drill bit for geothermal applications. Data and experimental tests needed to develop a bit suited to the harsh thermal, abrasive, and chemical environment of the more problematic geothermal wells, including those drilled with air, have been obtained. Efforts were directed at the improvement of both the sealed (lubricated) and unsealed types of bits. The unsealed bit effort included determination of the rationale for materials selection, the selection of steels for the bit body, cutters, and bearings, the selection of tungsten carbide alloys for the friction bearing, and preliminary investigation of optimized tungsten carbide drilling inserts. Bits build** with the new materials were tested under stimulated wellbore conditions. The sealed bit effort provided for the evaluation of candidate high temperature seals and lubricants, utilizing two specially developed test apparatus which simulate the conditions found in a sealed bit operating in a geothermal wellbore. Phase I of the program was devoted largely to (1) the study of the geothermal environment and the failure mechanisms of existing geothermal drill bits, (2) the design and construction of separate facilities for testing both drill-bit seals and full-scale drill bits under simulated geothermal drilling conditions, and (3) fabrication of the MK-I research drill bits from high-temperature steels, and testing in the geothermal drill-bit test facility. The work accomplished in Phase I is reported in References 1 through 9. In Phase II, the first generation experimental bits were tested in the geothermal drill-bit test facility. Test results indicated that hardness retention at temperature

  7. The digital agenda of virtual currencies: Can BitCoin become a global currency?

    OpenAIRE

    CIAIAN PAVEL; RAJCANIOVA MIROSLAVA; KANCS D'ARTIS

    2015-01-01

    This paper identifies and analyzes BitCoin features which may facilitate BitCoin to become a global currency, as well as characteristics which may impede the use of BitCoin as a medium of exchange, a unit of account and a store of value, and compares BitCoin with standard currencies with respect to the main functions of money. Among all analyzed BitCoin features, the extreme price volatility stands out most clearly compared to standard currencies. In order to understand the reasons for such e...

  8. SCORE - A DESCRIPTION.

    Science.gov (United States)

    SLACK, CHARLES W.

    REINFORCEMENT AND ROLE-REVERSAL TECHNIQUES ARE USED IN THE SCORE PROJECT, A LOW-COST PROGRAM OF DELINQUENCY PREVENTION FOR HARD-CORE TEENAGE STREET CORNER BOYS. COMMITTED TO THE BELIEF THAT THE BOYS HAVE THE POTENTIAL FOR ETHICAL BEHAVIOR, THE SCORE WORKER FOLLOWS B.F. SKINNER'S THEORY OF OPERANT CONDITIONING AND REINFORCES THE DELINQUENT'S GOOD…

  9. Heat Generation During Bone Drilling: A Comparison Between Industrial and Orthopaedic Drill Bits.

    Science.gov (United States)

    Hein, Christopher; Inceoglu, Serkan; Juma, David; Zuckerman, Lee

    2017-02-01

    Cortical bone drilling for preparation of screw placement is common in multiple surgical fields. The heat generated while drilling may reach thresholds high enough to cause osteonecrosis. This can compromise implant stability. Orthopaedic drill bits are several orders more expensive than their similarly sized, publicly available industrial counterparts. We hypothesize that an industrial bit will generate less heat during drilling, and the bits will not generate more heat after multiple cortical passes. We compared 4 4.0 mm orthopaedic and 1 3.97 mm industrial drill bits. Three types of each bit were drilled into porcine femoral cortices 20 times. The temperature of the bone was measured with thermocouple transducers. The heat generated during the first 5 drill cycles for each bit was compared to the last 5 cycles. These data were analyzed with analysis of covariance. The industrial drill bit generated the smallest mean increase in temperature (2.8 ± 0.29°C) P industrial bit generated less heat during drilling than its orthopaedic counterparts. The bits maintained their performance after 20 drill cycles. Consideration should be given by manufacturers to design differences that may contribute to a more efficient cutting bit. Further investigation into the reuse of these drill bits may be warranted, as our data suggest their efficiency is maintained after multiple uses.

  10. Layout parameter analysis in Shannon expansion theorem based on 32 bit adder circuit

    Directory of Open Access Journals (Sweden)

    C. Senthilpari

    2017-02-01

    Full Text Available The 1-bit adder circuits are schematized using pass transistor logic (PTL technique, that’s optimized by the Shannon expansion theorem. The proposed 32 bit carry increment adder (CIA circuit is designed by bit slice method. The CIA adder layout gives tremendous change compared to existing author results. The proposed circuit achieved better performance on power consumption, speed, throughput, and area. The 32-bit adder circuits are implemented in various types of 1-bit adder cells, such as Shannon, Mixed-Shannon and MCIT-7T. Furthermore, the 32-bit CIA adder layout is furtherly investigated for RLC interconnect parameter such as capacitive impedance, inductive impedance, power factor sin ϕ, tan ϕ for applying frequency. The 32 bit adder circuit acts in a better way than existing circuits in terms of power dissipation, delay, throughput, latency, power factor, sin ϕ and tan ϕ.

  11. Chaotic laser based physical random bit streaming system with a computer application interface

    Science.gov (United States)

    Shinohara, Susumu; Arai, Kenichi; Davis, Peter; Sunada, Satoshi; Harayama, Takahisa

    2017-03-01

    We demonstrate a random bit streaming system that uses a chaotic laser as its physical entropy source. By performing real-time bit manipulation for bias reduction, we were able to provide the memory of a personal computer with a constant supply of ready-to-use physical random bits at a throughput of up to 4 Gbps. We pay special attention to the end-to-end entropy source model describing how the entropy from physical sources is converted into bit entropy. We confirmed the statistical quality of the generated random bits by revealing the pass rate of the NIST SP800-22 test suite to be 65 % to 75 %, which is commonly considered acceptable for a reliable random bit generator. We also confirmed the stable operation of our random bit steaming system with long-term bias monitoring.

  12. FPGA Implementation of an Area Optimized Architecture for 128 bit AES Algorithm

    Directory of Open Access Journals (Sweden)

    S Ramanathan

    2016-05-01

    Full Text Available This paper aims at FPGA Implementation of an Area Optimized Architecture for 128 bit AES Algorithm. The conventional designs use a separate module for 32 bit byte substitution and 128 bit byte substitution. The 32 bit byte substitution is used in round key generation and the 128 bit byte substitution is used in the rounds. This report presents a modified architecture of 128 bit byte substitution module using a single 32 bit byte substitution module to reduce area.The AES encryption and decryption algorithm were designed using Verilog HDL. The functionality of the modules were checked using ModelSim. The simulations were carried out in ModelSim and Quartus II. The algorithm was implemented in FPGA and achieved a 2% reduction in the total logic element utilization

  13. Multi-bit quantum random number generation by measuring positions of arrival photons

    Science.gov (United States)

    Yan, Qiurong; Zhao, Baosheng; Liao, Qinghong; Zhou, Nanrun

    2014-10-01

    We report upon the realization of a novel multi-bit optical quantum random number generator by continuously measuring the arrival positions of photon emitted from a LED using MCP-based WSA photon counting imaging detector. A spatial encoding method is proposed to extract multi-bits random number from the position coordinates of each detected photon. The randomness of bits sequence relies on the intrinsic randomness of the quantum physical processes of photonic emission and subsequent photoelectric conversion. A prototype has been built and the random bit generation rate could reach 8 Mbit/s, with random bit generation efficiency of 16 bits per detected photon. FPGA implementation of Huffman coding is proposed to reduce the bias of raw extracted random bits. The random numbers passed all tests for physical random number generator.

  14. A FAST BIT-LOADING ALGORITHM FOR HIGH SPEED POWER LINE COMMUNICATIONS

    Institute of Scientific and Technical Information of China (English)

    Zhang Shengqing; Zhao Li; Zou Cairong

    2012-01-01

    Adaptive bit-loading is a key technology in high speed power line communications with the Orthogonal Frequency Division Multiplexing (OFDM) modulation technology.According to the real situation of the transmitting power spectrum limited in high speed power line communications,this paper explored the adaptive bit loading algorithm to maximize transmission bit number when transmitting power spectral density and bit error rate are not exceed upper limit.With the characteristics of the power line channel,first of all,it obtains the optimal bit loading algorithm,and then provides the improved algorithm to reduce the computational complexity.Based on the analysis and simulation,it offers a non-iterative bit allocation algorithm,and finally the simulation shows that this new algorithm can greatly reduce the computational complexity,and the actual bit allocation results close to optimal.

  15. Multi-Bit Data Hiding Scheme for Compressing Secret Messages

    Directory of Open Access Journals (Sweden)

    Wen-Chung Kuo

    2015-11-01

    Full Text Available The goal of data hiding techniques usually considers two issues, embedding capacity and image quality. Consequently, in order to achieve high embedding capacity and good image quality, a data hiding scheme combining run-length encoding (RLE with multi-bit embedding is proposed in this paper. This work has three major contributions. First, the embedding capacity is increased 62% because the secret message is compressed before embedding into the cover image. Secondly, the proposed scheme keeps the multi-bit generalized exploiting modification direction (MGEMD characteristics, which are effective to reduce modified pixels in the cover image and to maintain good stego image quality. Finally, the proposed scheme can prevent modern steganalysis methods, such as RS steganalysis and SPAM (subtractive pixel adjacency matrix, and is compared to MiPOD (minimizing the power of the optimal detector scheme. From our simulation results and security discussions, we have the following results: First, there are no perceivable differences between the cover images and stego images from human inspection. For example, the average PSNR of stego images is about 44.61 dB when the secret message (80,000 bits is embedded for test cover images (such as airplane, baboon, Lena of size 512×512. Secondly, Appl. Sci. 2015, 5 1034 on average, 222,087 pixels were not modified after embedding for the cover image. That is to say, 12% less pixels are modified as compared to the MGEMD method. From the performance discussions, the proposed scheme achieves high embedding capacity and good image quality, but also maintains stego image security.

  16. BSSSN: Bit String Swapping Sorting Network for Reversible Logic Synthesis

    CERN Document Server

    Islam, Md Saiful

    2010-01-01

    In this paper, we have introduced the notion of UselessGate and ReverseOperation. We have also given an algorithm to implement a sorting network for reversible logic synthesis based on swapping bit strings. The network is constructed in terms of n*n Toffoli Gates read from left to right and it has shown that there will be no more gates than the number of swappings the algorithm requires. The gate complexity of the network is O(n2). The number of gates in the network can be further reduced by template reduction technique and removing UselessGate from the network.

  17. All-optical pseudorandom bit sequences generator based on TOADs

    Science.gov (United States)

    Sun, Zhenchao; Wang, Zhi; Wu, Chongqing; Wang, Fu; Li, Qiang

    2016-03-01

    A scheme for all-optical pseudorandom bit sequences (PRBS) generator is demonstrated with optical logic gate 'XNOR' and all-optical wavelength converter based on cascaded Tera-Hertz Optical Asymmetric Demultiplexer (TOADs). Its feasibility is verified by generation of return-to-zero on-off keying (RZ-OOK) 263-1 PRBS at the speed of 1 Gb/s with 10% duty radio. The high randomness of ultra-long cycle PRBS is validated by successfully passing the standard benchmark test.

  18. Bit-Interleaved Coded Multiple Beamforming with Constellation Precoding

    CERN Document Server

    Park, Hong Ju

    2009-01-01

    In this paper, we present the diversity order analysis of bit-interleaved coded multiple beamforming (BICMB) combined with the constellation precoding scheme. Multiple beamforming is realized by singular value decomposition of the channel matrix which is assumed to be perfectly known to the transmitter as well as the receiver. Previously, BICMB is known to have a diversity order bound related with the product of the code rate and the number of parallel subchannels, losing the full diversity order in some cases. In this paper, we show that BICMB combined with the constellation precoder and maximum likelihood detection achieves the full diversity order. We also provide simulation results that match the analysis.

  19. Design of high-bit-rate coherent communication links

    Science.gov (United States)

    Konyshev, V. A.; Leonov, A. V.; Nanii, O. E.; Novikov, A. G.; Treshchikov, V. N.; Ubaydullaev, R. R.

    2016-12-01

    We report an analysis of the problems encountered in the design of modern high-bit-rate coherent communication links. A phenomenological communication link model is described, which is suitable for solving applied tasks of the network design with nonlinear effects taken into account. We propose an engineering approach to the design that is based on the use of fundamental nonlinearity coefficients calculated in advance for the experimental configurations of communication links. An experimental method is presented for calculating the nonlinearity coefficient of communication links. It is shown that the proposed approach allows one to successfully meet the challenges in designing communication networks.

  20. Distribution of digital games via BitTorrent

    DEFF Research Database (Denmark)

    Drachen, Anders; Bauer, Kevin; Veitch, Robert W. D.

    2011-01-01

    distribution across game titles and game genres. This paper presents the first large-scale, open-method analysis of the distribution of digital game titles, which was conducted by monitoring the BitTorrent peer-to-peer (P2P) file-sharing protocol. The sample includes 173 games and a collection period of three...... months from late 2010 to early 2011. With a total of 12.6 million unique peers identified, it is the largest examination of game piracy via P2P networks to date. The study provides findings that reveal the magnitude of game piracy, the time-frequency of game torrents, which genres that get pirated...

  1. INFORMATION SECURITY THROUGH IMAGE WATERMARKING USING LEAST SIGNIFICANT BIT ALGORITHM

    Directory of Open Access Journals (Sweden)

    Puneet Kr Sharma

    2012-05-01

    Full Text Available The rapid advancement of internet has made it easier to send the data/image accurate and faster to the destination. Besides this, it is easier to modify and misuse the valuable information through hacking at the same time. In order to transfer the data/image securely to the destination without any modifications, there are many approaches like Cryptography, Watermarking and Steganography. This paper presents the general overview of image watermarking and different security issues. In this paper, Image Watermarking using Least Significant Bit (LSB algorithm has been used for embedding the message/logo into the image. This work has been implemented through MATLAB.

  2. Based on reception in general with bit-by-bit decision-making algorithm for signal processing in fiber optic telecommunication systems

    Science.gov (United States)

    Burdin, Vladimir A.; Kartashevsky, Vyacheslav G.; Grigorov, Igor V.

    2016-03-01

    This paper presents «reception in general with bit-by-bit decision-making» algorithm, which is the alternative to Viterbi algorithm. It is proposed to use it for fiber-optic transmission systems. It's features is compared with the Viterbi algorithm for digital signal processing in optical communication channels.

  3. Need for liquid-crystal display monitors having the capability of rendering higher than 8 bits in display-bit depth.

    Science.gov (United States)

    Hiwasa, Takeshi; Morishita, Junji; Hatanaka, Shiro; Ohki, Masafumi; Toyofuku, Fukai; Higashida, Yoshiharu

    2009-01-01

    Our purpose in this study was to examine the potential usefulness of liquid-crystal display (LCD) monitors having the capability of rendering higher than 8 bits in display-bit depth. An LCD monitor having the capability of rendering 8, 10, and 12 bits was used. It was calibrated to the grayscale standard display function with a maximum luminance of 450 cd/m(2) and a minimum of 0.75 cd/m(2). For examining the grayscale resolution reported by ten observers, various simple test patterns having two different combinations of luminance in 8, 10, and 12 bits were randomly displayed on the LCD monitor. These patterns were placed on different uniform background luminance levels, such as 0, 50, and 100%, for maximum luminance. All observers participating in this study distinguished a smaller difference in luminance than one gray level in 8 bits irrespective of background luminance levels. As a result of the adaptation processes of the human visual system, observers distinguished a smaller difference in luminance as the luminance level of the test pattern was closer to the background. The smallest difference in luminance that observers distinguished was four gray levels in 12 bits, i.e., one gray level in 10 bits. Considering the results obtained by use of simple test patterns, medical images should ideally be displayed on LCD monitors having 10 bits or greater so that low-contrast objects with small differences in luminance can be detected and for providing a smooth gradation of grayscale.

  4. Credit Scoring Problem Based on Regression Analysis

    OpenAIRE

    Khassawneh, Bashar Suhil Jad Allah

    2014-01-01

    ABSTRACT: This thesis provides an explanatory introduction to the regression models of data mining and contains basic definitions of key terms in the linear, multiple and logistic regression models. Meanwhile, the aim of this study is to illustrate fitting models for the credit scoring problem using simple linear, multiple linear and logistic regression models and also to analyze the found model functions by statistical tools. Keywords: Data mining, linear regression, logistic regression....

  5. The Bandim tuberculosis score

    DEFF Research Database (Denmark)

    Rudolf, Frauke; Joaquim, Luis Carlos; Vieira, Cesaltina

    2013-01-01

    Background: This study was carried out in Guinea-Bissau ’ s capital Bissau among inpatients and outpatients attending for tuberculosis (TB) treatment within the study area of the Bandim Health Project, a Health and Demographic Surveillance Site. Our aim was to assess the variability between 2...... physicians in performing the Bandim tuberculosis score (TBscore), a clinical severity score for pulmonary TB (PTB), and to compare it to the Karnofsky performance score (KPS). Method : From December 2008 to July 2009 we assessed the TBscore and the KPS of 100 PTB patients at inclusion in the TB cohort and...

  6. Bias Adjusted Precipitation Threat Scores

    Directory of Open Access Journals (Sweden)

    F. Mesinger

    2008-04-01

    Full Text Available Among the wide variety of performance measures available for the assessment of skill of deterministic precipitation forecasts, the equitable threat score (ETS might well be the one used most frequently. It is typically used in conjunction with the bias score. However, apart from its mathematical definition the meaning of the ETS is not clear. It has been pointed out (Mason, 1989; Hamill, 1999 that forecasts with a larger bias tend to have a higher ETS. Even so, the present author has not seen this having been accounted for in any of numerous papers that in recent years have used the ETS along with bias "as a measure of forecast accuracy".

    A method to adjust the threat score (TS or the ETS so as to arrive at their values that correspond to unit bias in order to show the model's or forecaster's accuracy in extit{placing} precipitation has been proposed earlier by the present author (Mesinger and Brill, the so-called dH/dF method. A serious deficiency however has since been noted with the dH/dF method in that the hypothetical function that it arrives at to interpolate or extrapolate the observed value of hits to unit bias can have values of hits greater than forecast when the forecast area tends to zero. Another method is proposed here based on the assumption that the increase in hits per unit increase in false alarms is proportional to the yet unhit area. This new method removes the deficiency of the dH/dF method. Examples of its performance for 12 months of forecasts by three NCEP operational models are given.

  7. Reporting Valid and Reliable Overall Scores and Domain Scores

    Science.gov (United States)

    Yao, Lihua

    2010-01-01

    In educational assessment, overall scores obtained by simply averaging a number of domain scores are sometimes reported. However, simply averaging the domain scores ignores the fact that different domains have different score points, that scores from those domains are related, and that at different score points the relationship between overall…

  8. Learning may need only a few bits of synaptic precision

    Science.gov (United States)

    Baldassi, Carlo; Gerace, Federica; Lucibello, Carlo; Saglietti, Luca; Zecchina, Riccardo

    2016-05-01

    Learning in neural networks poses peculiar challenges when using discretized rather then continuous synaptic states. The choice of discrete synapses is motivated by biological reasoning and experiments, and possibly by hardware implementation considerations as well. In this paper we extend a previous large deviations analysis which unveiled the existence of peculiar dense regions in the space of synaptic states which accounts for the possibility of learning efficiently in networks with binary synapses. We extend the analysis to synapses with multiple states and generally more plausible biological features. The results clearly indicate that the overall qualitative picture is unchanged with respect to the binary case, and very robust to variation of the details of the model. We also provide quantitative results which suggest that the advantages of increasing the synaptic precision (i.e., the number of internal synaptic states) rapidly vanish after the first few bits, and therefore that, for practical applications, only few bits may be needed for near-optimal performance, consistent with recent biological findings. Finally, we demonstrate how the theoretical analysis can be exploited to design efficient algorithmic search strategies.

  9. STEGANOGRAFI DENGAN CHAOTIC LEAST SIGNIFICANT BIT ENCODING PADA TELEPON GENGGAM

    Directory of Open Access Journals (Sweden)

    Susany Soplanit

    2007-01-01

    Full Text Available The issues of security in mobile phone in recent days become crucial. Many privacy or secretly data is stored using unsecured protocol or sometimes without the security procedures at all. This will lead to great awareness about security in mobile phone. The effective ways to secure data are steganography and cryptography. The first one concentrate to data hiding in a certain media. In this paper, we present Chaotic Least Significant Bit Encoding (CLSBE as a steganography method in our system design. The experiment results show that hidden messages in PNG form can be retrieved correctly. The implementation of system in emulator works well but depends on mobile phone features and environment. Abstract in Bahasa Indonesia : Telepon genggam saat ini dapat digunakan untuk menyimpan data-data yang bersifat pribadi atau rahasia, oleh karena itu pengamanan data pada telepon genggam akan menjadi hal yang penting di masa ini ataupun di masa yang akan datang. Sistem pengamanan data yang efektif pada telepon genggam selain kriptografi adalah Steganografi yaitu penyembunyian data dalam sebuah media. Dalam perancangan ini metode yang digunakan adalah Chaotic Least Significant Bit Encoding (CLSBE. Hasil pengujian membuktikan bahwa pesan yang tersembunyi dalam citra digital dengan format PNG masih dapat diambil kembali dengan benar. Implementasi pada emulator telah berjalan dengan baik, namun untuk telepon genggam perlu penyesuaian dengan fasilitas pada telepon tersebut. Kata kunci: CLSBE, steganografi, stego-image, cover-image.

  10. Single-Cycle Bit Permutations with MOMR Execution

    Institute of Scientific and Technical Information of China (English)

    Ruby B. Lee; Xiao Yang; Zhi-Jie Jerry Shi

    2005-01-01

    Secure computing paradigms impose new architectural challenges for general-purpose processors. Cryptographic processing is needed for secure communications, storage, and computations. We identify two categories of operations in symmetric-key and public-key cryptographic algorithms that are not common in previous general-purpose workloads:advanced bit operations within a word and multi-word operations. We define MOMR (Multiple Operands Multiple Results)execution or datarich execution as a unified solution to both challenges. It allows arbitrary n-bit permutations to be achieved in one or two cycles, rather than O(n) cycles as in existing RISC processors. It also enables significant acceleration of multiword multiplications needed by public-key ciphers. We propose two implementations of MOMR: one employs only hardware changes while the other uses Instruction Set Architecture (ISA) support. We show that MOMR execution leverages available resources in typical multi-issue processors with minimal additional cost. Multi-issue processors enhanced with MOMR units provide additional speedup over standard multi-issue processors with the same datapath. MOMR is a general architectural solution for word-oriented processor architectures to incorporate datarich operations.

  11. A 16-Bit Fully Functional Single Cycle Processor

    Directory of Open Access Journals (Sweden)

    Nidhi Maheshwari

    2011-08-01

    Full Text Available The existing commercial microprocessors are provided as black box units, with which users are unable to monitor internal signals and operation process, neither can they modify the original structure. Inorder to solve this problem 16-bit fully functional single cycle processor is designed in terms of its architecture and its functional capabilities. The procedure of design and verification for a 16-bit processor is introduced in this paper. The key architecture elements are being described, as well as the hardware block diagram and internal structure. The summary of instruction set is presented. This processor is modify as a Very High Speed Integrated Circuit Hardware Description Language (VHDL and gives access to every internal signal. In order to consume fewer resources, the design of arithmetic logical unit (ALU is optimized. The RTL views and verified simulation results of processor are shown in this paper. The synthesis report of the design is also described. The design architecture is written in Very High Speed Integrated Circuit Hardware Description Language (VHDL code using Xilinx ISE 9.2i tool for synthesis and simulation.

  12. Giga-bit optical data transmission module for Beam Instrumentation

    CERN Document Server

    Roedne, L T; Cenkeramaddi, L R; Jiao, L

    Particle accelerators require electronic instrumentation for diagnostic, assessment and monitoring during operation of the transferring and circulating beams. A sensor located near the beam provides an electrical signal related to the observable quantity of interest. The front-end electronics provides analog-to-digital conversion of the quantity being observed and the generated data are to be transferred to the external digital back-end for data processing, and to display to the operators and logging. This research project investigates the feasibility of radiation-tolerant giga-bit data transmission over optic fibre for beam instrumentation applications, starting from the assessment of the state of the art technology, identification of challenges and proposal of a system level solution, which should be validated with a PCB design in an experimental setup. Radiation tolerance of 10 kGy (Si) Total Ionizing Dose (TID) over 10 years of operation, Bit Error Rate (BER) 10-6 or better. The findings and results of th...

  13. Improved Hardfacing for Drill Bits and Drilling Tools

    Science.gov (United States)

    Sue, Albert; Sreshta, Harry; Qiu, Bao He

    2011-01-01

    New flame spray hardfacing, DSH (DuraShell® Steel Hardfacing, US patent pending), was developed to improve thermal conductivity, abrasion wear, and erosion resistance for subterranean drilling application. The materials consisted of spherical cast WC/W2C and Ni-Si-B alloy powders. The hardfacing compositions were tailored for various processes such as flame spray and laser cladding. Typically, the hardfacing comprised hard tungsten carbide particles being uniformly distributed in a tough Ni-alloy matrix. The hardness of WC/W2C exceeded 2300 Hv.3 and that of Ni-alloy matrix varied from about 400 to 700 Hv.3. High- and low-stress abrasion resistances of these hardfacing materials were characterized and compared to the conventional hard coatings of cast WC/W2C and Ni-Cr-Si-B-Fe. The increase in thermal, wear, and erosion resistances of the hardfacing improved the durability of PDC (polycrystalline diamond compact) steel body bit and drilling tools and their cost-effective performance. Several case studies of DSH hardfacings on drill bits were described.

  14. A Short Introduction to Bit-String Physics

    CERN Document Server

    Noyes, H P

    1997-01-01

    This paper starts with a personal memoir of how some significant ideas arose and events took place during the period from 1972, when I first encountered Ted Bastin, to 1979, when I proposed the foundation of ANPA. I then discuss program universe, the fine structure paper and its rejection, the quantitative results up to ANPA 17 and take a new look at the handy-dandy formula. Following this historical material is a first pass at establishing new foundations for bit-string physics. An abstract model for a laboratory notebook and an historical record are developed, culminating in the bit-string representation. I set up a tic-toc laboratory with two synchronized clocks and show how this can be used to analyze arbitrary incoming data. This allows me to discuss (briefly) finite and discrete Lorentz transformations, commutation relations, and scattering theory. Earlier work on conservation laws in 3- and 4-events and the free space Dirac and Maxwell equations is cited. The paper concludes with a discussion of the qu...

  15. Statistical mechanics analysis of thresholding 1-bit compressed sensing

    Science.gov (United States)

    Xu, Yingying; Kabashima, Yoshiyuki

    2016-08-01

    The one-bit compressed sensing framework aims to reconstruct a sparse signal by only using the sign information of its linear measurements. To compensate for the loss of scale information, past studies in the area have proposed recovering the signal by imposing an additional constraint on the l 2-norm of the signal. Recently, an alternative strategy that captures scale information by introducing a threshold parameter to the quantization process was advanced. In this paper, we analyze the typical behavior of thresholding 1-bit compressed sensing utilizing the replica method of statistical mechanics, so as to gain an insight for properly setting the threshold value. Our result shows that fixing the threshold at a constant value yields better performance than varying it randomly when the constant is optimally tuned, statistically. Unfortunately, the optimal threshold value depends on the statistical properties of the target signal, which may not be known in advance. In order to handle this inconvenience, we develop a heuristic that adaptively tunes the threshold parameter based on the frequency of positive (or negative) values in the binary outputs. Numerical experiments show that the heuristic exhibits satisfactory performance while incurring low computational cost.

  16. Statistical mechanics approach to 1-bit compressed sensing

    Science.gov (United States)

    Xu, Yingying; Kabashima, Yoshiyuki

    2013-02-01

    Compressed sensing is a framework that makes it possible to recover an N-dimensional sparse vector x∈RN from its linear transformation y∈RM of lower dimensionality M entry of y to recover x was recently proposed. This is often termed 1-bit compressed sensing. Here, we analyze the typical performance of an l1-norm-based signal recovery scheme for 1-bit compressed sensing using statistical mechanics methods. We show that the signal recovery performance predicted by the replica method under the replica symmetric ansatz, which turns out to be locally unstable for modes breaking the replica symmetry, is in good consistency with experimental results of an approximate recovery algorithm developed earlier. This suggests that the l1-based recovery problem typically has many local optima of a similar recovery accuracy, which can be achieved by the approximate algorithm. We also develop another approximate recovery algorithm inspired by the cavity method. Numerical experiments show that when the density of nonzero entries in the original signal is relatively large the new algorithm offers better performance than the abovementioned scheme and does so with a lower computational cost.

  17. Design of Low Noise 16-bit CMOS Digitally Controlled Oscillator

    Directory of Open Access Journals (Sweden)

    Nitin Kumar

    2012-02-01

    Full Text Available In this paper, a new differential delay cell is proposed and 16-bit Digital Controlled Oscillator (DCO based on proposed delay cell is designed. The 16-bit DCO consist of 4-stages differential delay cell in ring structure and a digital control scheme has been used to improved noise characteristics. The structure of the DCO utilizes dual delay path techniques to achieve high oscillation frequency and awide tuning range. The DCO circuit has been simulated in SPICE with 0.5μm technology operating with supply voltage of 5V. DCO achieved a controllable frequency range of [1.7324-4.8649] GHz with a tuningrange of 3.1325GHz (≈64%. The measured output noise is -161.2dB/Hz and the total harmonic distortion have been found 75.4865dB with 6666H control word. The phase noise in proposed DCO design is -179.4dB/Hz at a frequency of 1.7324GHz.

  18. Nozzle assembly for an earth boring drill bit

    Energy Technology Data Exchange (ETDEWEB)

    Madigan, J. A.

    1985-09-24

    A nozzle assembly for an earth boring drill bit of the type adapted to receive drilling fluid under pressure and having a nozzle bore in the bottom thereof positioned closely adjacent the well bore bottom when the bit is in engagement therewith with the bore having inner and outer portions. The nozzle assembly comprises a generally cylindrical nozzle member of abrasion and erosion resistant material, selected from a plurality of such members, each being of the same outer diameter but having passaging therein of different cross-sectional area. The nozzle member is adapted to be fitted in the inner portion of the nozzle bore in sealing relationship therewith for forming a first seal for the nozzle assembly. The nozzle assembly further comprises a locknut, separate from the nozzle member, for detachbably securing the nozzle member in the nozzle bore, formed at least in part of an abrasion and erosion resistant material. The locknut has a threaded side wall engageable with the outer portion of the nozzle bore, and an aperture therethrough for enabling a stream of drilling fluid from the nozzle member to flow therethrough and being so configured in section as to receive a tool for turning the lockout to install it in and remove it from the nozzle bore.

  19. Volleyball Scoring Systems.

    Science.gov (United States)

    Calhoun, William; Dargahi-Noubary, G. R.; Shi, Yixun

    2002-01-01

    The widespread interest in sports in our culture provides an excellent opportunity to catch students' attention in mathematics and statistics classes. One mathematically interesting aspect of volleyball, which can be used to motivate students, is the scoring system. (MM)

  20. Volleyball Scoring Systems.

    Science.gov (United States)

    Calhoun, William; Dargahi-Noubary, G. R.; Shi, Yixun

    2002-01-01

    The widespread interest in sports in our culture provides an excellent opportunity to catch students' attention in mathematics and statistics classes. One mathematically interesting aspect of volleyball, which can be used to motivate students, is the scoring system. (MM)

  1. Rate Distortion Analysis and Bit Allocation Scheme for Wavelet Lifting-Based Multiview Image Coding

    Science.gov (United States)

    Lasang, Pongsak; Kumwilaisak, Wuttipong

    2009-12-01

    This paper studies the distortion and the model-based bit allocation scheme of wavelet lifting-based multiview image coding. Redundancies among image views are removed by disparity-compensated wavelet lifting (DCWL). The distortion prediction of the low-pass and high-pass subbands of each image view from the DCWL process is analyzed. The derived distortion is used with different rate distortion models in the bit allocation of multiview images. Rate distortion models including power model, exponential model, and the proposed combining the power and exponential models are studied. The proposed rate distortion model exploits the accuracy of both power and exponential models in a wide range of target bit rates. Then, low-pass and high-pass subbands are compressed by SPIHT (Set Partitioning in Hierarchical Trees) with a bit allocation solution. We verify the derived distortion and the bit allocation with several sets of multiview images. The results show that the bit allocation solution based on the derived distortion and our bit allocation scheme provide closer results to those of the exhaustive search method in both allocated bits and peak-signal-to-noise ratio (PSNR). It also outperforms the uniform bit allocation and uniform bit allocation with normalized energy in the order of 1.7-2 and 0.3-1.4 dB, respectively.

  2. Resolution of digital servo control system using single-bit digital signal processing; 1 bit digital shingo shori wo mochiita seigyo no bunkaino to johoryo ni tsuite no simulation

    Energy Technology Data Exchange (ETDEWEB)

    Tojo, K.; Kurosawa, M.; Oka, K.; Higuchi, T. [The University of Tokyo, Tokyo (Japan)

    1998-05-01

    The application of single-bit digital signal processing to mechanical control system has already been proposed by the authors. Multi-bit A/D converter has been improved to the high level. But it is difficult to make more high resolution A/D by latest semiconductor technologies. There is single-bit digital signal which is generated by a delta-sigma modulator. Single-bit digital signal has small quantized error around low frequency. Then with this single-bit digital signal processing, high resolution on controlling such a narrow band width mechanical system will be realized. In this paper, resolution of analog, multi-bit and single-bit control systems are estimated with simulation. According to simulations` results, single-bit control system has higher resolution than multi-bit system in the condition of equal bit rate. 5 refs., 17 figs., 1 tab.

  3. Neuroretinitis -- definition

    Science.gov (United States)

    ... page: //medlineplus.gov/ency/article/007624.htm Neuroretinitis - definition To use the sharing features on this page, ... this important distinction for online health information and services. Learn more about A.D.A.M.'s editorial ...

  4. Implementation of RSA 2048-bit and AES 256-bit with Digital Signature for Secure Electronic Health Record Application

    Directory of Open Access Journals (Sweden)

    Mohamad Ali Sadikin

    2016-10-01

    Full Text Available This research addresses the implementation of encryption and digital signature technique for electronic health record to prevent cybercrime such as robbery, modification and unauthorised access. In this research, RSA 2048-bit algorithm, AES 256-bit and SHA 256 will be implemented in Java programming language. Secure Electronic Health Record Information (SEHR application design is intended to combine given services, such as confidentiality, integrity, authentication, and nonrepudiation. Cryptography is used to ensure the file records and electronic documents for detailed information on the medical past, present and future forecasts that have been given only to the intended patients. The document will be encrypted using an encryption algorithm based on NIST Standard. In the application, there are two schemes, namely the protection and verification scheme. This research uses black-box testing and whitebox testing to test the software input, output, and code without testing the process and design that occurs in the system.We demonstrated the implementation of cryptography in SEHR. The implementation of encryption and digital signature in this research can prevent archive thievery.

  5. A single channel, 6-bit 410-MS/s 3bits/stage asynchronous SAR ADC based on resistive DAC

    Science.gov (United States)

    Xue, Han; Qi, Wei; Huazhong, Yang; Hui, Wang

    2015-05-01

    This paper presents a single channel, low power 6-bit 410-MS/s asynchronous successive approximation register analog-to-digital converter (SAR ADC) for ultrawide bandwidth (UWB) communication, prototyped in a SMIC 65-nm process. Based on the 3 bits/stage structure, resistive DAC, and the modified asynchronous successive approximation register control logic, the proposed ADC attains a peak spurious-free dynamic range (SFDR) of 41.95 dB, and a signal-to-noise and distortion ratio (SNDR) of 28.52 dB for 370 MS/s. At the sampling rate of 410 MS/s, this design still performs well with a 40.71-dB SFDR and 30.02-dB SNDR. A four-input dynamic comparator is designed so as to decrease the power consumption. The measurement results indicate that this SAR ADC consumes 2.03 mW, corresponding to a figure of merit of 189.17 fJ/step at 410 MS/s. Project supported by the National Science Foundation for Young Scientists of China (No. 61306029) and the National High Technology Research and Development Program of China (No. 2013AA014103).

  6. Market Definition

    OpenAIRE

    Kaplow, Louis

    2014-01-01

    Market definition has long held a central place in competition law. This entry surveys recent analytical work that has called the market definition paradigm into question on a number of fronts: whether the process is feasible, whether market share threshold tests are coherent, whether the hypothetical monopolist test in merger guidelines is counterproductive, and whether and when the frequent focus on cross-elasticities is useful.

  7. Key Influencing Factors of Dynamic Pricing for Bit Products%比特产品动态定价关键影响因素分析

    Institute of Scientific and Technical Information of China (English)

    龙红明; 舒华英

    2014-01-01

    旨在构建动态定价关键影响因素构成体系,为比特产品动态定价奠定基础。从比特产品和动态定价的定义入手,深入剖析了比特产品动态定价的九大影响因素,并着重分析了影响比特产品动态定价的三大关键影响因素———市场供给函数的刻画、市场需求函数的刻画和时序的刻画。市场供给函数、需求函数和时序问题共同作用于比特产品动态定价,为比特产品动态定价建模提供了基础。%The construction of the constitution system of the key influencing factors of dynamic pricing will lay the foundation for the dynamic pricing of bit products.Starting from the definition of bit products and dynamic pricing , the nine factors affecting the pricing of bit products , and three key influencing factors about dynamic pricing of bit products are analyzed.The three key factors—the market supply function characterization , the market demand function characterization and timing depiction jointly influence the dynamic pricing of bit prod -ucts, which will be the base of its dynamic pricing modeling.

  8. Experimental research on characteristics of hole reaming and side cutting of one-cone bits

    Institute of Scientific and Technical Information of China (English)

    Yu Kai'an

    2008-01-01

    The hole reaming and side cutting characteristics of offset one-cone bit and conventional one-cone bit were investigated on simulated drilling experimental equipment.The borehole diameter was a little larger than the bit diameter due to side force.However,the reaming effect was not very apparent,whether drilling with an offset or conventional one-cone bit.The side cutting displacement increased gradually with increasing depth of drilling and side force.The side cutting displacement of offset one-cone bits was larger than that of conventional ones under the same conditions of weight-on-bit(WOB),rotary speed,side force and borehole depth.

  9. Enhancement of LED indoor communications using OPPM-PWM modulation and grouped bit-flipping decoding.

    Science.gov (United States)

    Yang, Aiying; Li, Xiangming; Jiang, Tao

    2012-04-23

    Combination of overlapping pulse position modulation and pulse width modulation at the transmitter and grouped bit-flipping algorithm for low-density parity-check decoding at the receiver are proposed for visible Light Emitting Diode (LED) indoor communication system in this paper. The results demonstrate that, with the same Photodetector, the bit rate can be increased and the performance of the communication system can be improved by the scheme we proposed. Compared with the standard bit-flipping algorithm, the grouped bit-flipping algorithm can achieve more than 2.0 dB coding gain at bit error rate of 10-5. By optimizing the encoding of overlapping pulse position modulation and pulse width modulation symbol, the performance can be further improved. It is reasonably expected that the bit rate can be upgraded to 400 Mbit/s with a single available LED, thus transmission rate beyond 1 Gbit/s is foreseen by RGB LEDs.

  10. Why Quantum Bit Commitment And Ideal Quantum Coin Tossing Are Impossible

    CERN Document Server

    Lo, H K

    1998-01-01

    There had been well known claims of unconditionally secure quantum protocols for bit commitment. However, we, and independently Mayers, showed that all proposed quantum bit commitment schemes are, in principle, insecure because the sender, Alice, can almost always cheat successfully by using an Einstein-Podolsky-Rosen (EPR) type of attack and delaying her measurements. One might wonder if secure quantum bit commitment protocols exist at all. We answer this question by showing that the same type of attack by Alice will, in principle, break any bit commitment scheme. The cheating strategy generally requires a quantum computer. We emphasize the generality of this ``no-go theorem'': Unconditionally secure bit commitment schemes based on quantum mechanics---fully quantum, classical or quantum but with measurements---are all ruled out by this result. Since bit commitment is a useful primitive for building up more sophisticated protocols such as zero-knowledge proofs, our results cast very serious doubt on the secur...

  11. Design and Demonstration of a 30 GHz 16-bit Superconductor RSFQ Microprocessor

    Science.gov (United States)

    2015-03-10

    for Public Release; Distribution Unlimited Final Report: Design and Demonstration of a 30 GHz 16-bit Superconductor RSFQ Microprocessor The views...Demonstration of a 30 GHz 16-bit Superconductor RSFQ Microprocessor Report Title The major objective of the project was to design and demonstrate operation...25, no.3, pp.1-8, June 2015. Technology Transfer Final Report: Design and Demonstration of a 30 GHz 16‐bit Superconductor RSFQ Microprocessor

  12. Computer-Aided Design for Built-In-Test (CADBIT) - BIT Library. Volume 2

    Science.gov (United States)

    1989-10-01

    TECHNIQUE: ON-BOARD RONI CATEGORY: LONG TUTORIA \\L PAG E 5 of 14I SUBCATEGORY: BIT TECHNIQUE ATTRIBUTES DATA TYPE: TEXT El LIST E] TABLE [ GRAPHIC E...SHIFT REGISTER (MISR) CATEGORY: LONG TUTORIA -L PAGE i Of 13 SUBCATEGORY: BIT TECH-{MQUE ATTRIBUTES DATA TYPE: TEXT LIST El TABLE GRAPHIC E EQUATIONS...ELEMENT DATA SHEET BIT TECHNIQUE: UTILIZING REDUNDANCY CATEGORY: LONG TUTORIA L PAGE 9 of 10 SUBCATEGORY: PARTS DATA TABLE DATA TYPE: TEXT F1 UST C3

  13. The Anoikis Effector Bit1 Displays Tumor Suppressive Function in Lung Cancer Cells

    OpenAIRE

    Xin Yao; Scott Jennings; Shubha Kale Ireland; Tri Pham; Brandi Temple; Mya Davis; Renwei Chen; Ian Davenport; Hector Biliran

    2014-01-01

    The mitochondrial Bit1 (Bcl-2 inhibitor of transcription 1) protein is a part of an apoptotic pathway that is uniquely regulated by integrin-mediated attachment. As an anoikis effector, Bit1 is released into the cytoplasm following loss of cell attachment and induces a caspase-independent form of apoptosis. Considering that anoikis resistance is a critical determinant of transformation, we hypothesized that cancer cells may circumvent the Bit1 apoptotic pathway to attain anchorage-independenc...

  14. Contador asincrónico de cuatro bits

    Directory of Open Access Journals (Sweden)

    Iván Jaramillo J.

    2011-01-01

    Full Text Available Este artículo describe el diseño e implementación del conttulor asincrónico de cuatro bits, realizado a partir de experiencias académicas en la Universidad Nacional de Colombia. Primero se menciona la estructura del contador, al igual que la caracterización de las celdas básicas (con base en las cuales se hizo este proyecto, y se muestran los resultados de la simulación eléctrica. Después, se describen las pruebas efectuadas al chip, y se hace una comparación entre estos datos experimentales y los obtenidos en la simulación.

  15. Numerical optimization of writer geometries for bit patterned magnetic recording

    CERN Document Server

    Kovacs, A; Bance, S; Fischbacher, J; Gusenbauer, M; Reichel, F; Exl, L; Schrefl, T; Schabes, M E

    2015-01-01

    A fully-automated pole-tip shape optimization tool, involving write head geometry construction, meshing, micromagnetic simulation and evaluation, is presented. Optimizations have been performed for three different writing schemes (centered, staggered and shingled) for an underlying bit patterned media with an areal density of 2.12 Tdots/in$^2$ . Optimizations were performed for a single-phase media with 10 nm thickness and a mag spacing of 8 nm. From the computed write field and its gradient and the minimum energy barrier during writing for islands on the adjacent track, the overall write error rate is computed. The overall write errors are 0.7, 0.08, and 2.8 x 10$^{-5}$ for centered writing, staggered writing, and shingled writing.

  16. An algorithm for redundant binary bit-pipelined rational arithmetic

    Energy Technology Data Exchange (ETDEWEB)

    Kornerup, P. (Dept. of Mathematics and Computer Science, Odense Universitet, Odense (DK)); Matula, D.W. (Dept. of Computer Science and Engineering, Southern Methodist Univ., Dallas, TX (US))

    1990-08-01

    The authors introduce a redundant binary representation of the rationals and an associated algorithm for computing the sum, difference, product, quotient, and other useful functions of two rational operands, employing our representation. The authors' algorithm extends Gosper's partial quotient arithmetic algorithm and allows the design of an on-line arithmetic unit with computations granularized at the signed bit level. Each input or output port can independently be set to receive/produce operands/result in either binary radix or our binary rational representation. The authors investigate by simulation the interconnection of several such units for the parallel computation of more complicated expressions in a tree-pipelined manner, with particular regards to measuring individual and compound on-line delays.

  17. The Application of Bit Slice Design to Digital Image Processing.

    Science.gov (United States)

    1986-09-01

    AM2910 INSTR H#E ;continue RESULTINO MICROWORD: 0043 3FOF FOIE (X-1) CO IMENTS: Bits L15-47 declare the source registers to be in the pipeline...3FFF CO24 ;PUSH ADO. ON STACK, LO CTR w/02 0101 Oe4F 3F03 F14E ;MEMORY -) R4 0102 0043 3FOF FOIE ;RI-4 -, RI 0103 084F 3FO3 F13E ;MEMORY - R3 0101t 0043...3FOF F34E ;R3*R9 -> R4 .O S 0043 3FCF F21E ;R1-2 - RI S0105 084F 3F03 F13E ;MEMORY -, R3 0107 0043 3FCF F34E ;R3 R4 -) R4 0108 0043 3F0F FOIE ;RI4

  18. Novel Parity-Preserving Designs of Reversible 4-Bit Comparator

    Science.gov (United States)

    Qi, Xue-mei; Chen, Fu-long; Wang, Hong-tao; Sun, Yun-xiang; Guo, Liang-min

    2014-04-01

    Reversible logic has attracted much attention in recent years especially when the calculation with minimum energy consumption is considered. This paper presents two novel approaches for designing reversible 4-bit comparator based on parity-preserving gates, which can detect any fault that affects no more than a single logic signal. In order to construct the comparator, three variable EX-OR gate (TVG), comparator gate (CPG), four variable EX-OR gate block (FVGB) and comparator gate block (CPGB) are designed, and they are parity-preserving and reversible. Their quantum equivalent implementations are also proposed. The design of two comparator circuits is completed by using existing reversible gates and the above new reversible circuits. All these comparators have been modeled and verified in Verilog hardware description language (Verilog HDL). The Quartus II simulation results indicate that their circuits' logic structures are correct. The comparative results are presented in terms of quantum cost, delay and garbage outputs.

  19. A Fast Dynamic 64-bit Comparator with Small Transistor Count

    Directory of Open Access Journals (Sweden)

    Chua-Chin Wang

    2002-01-01

    Full Text Available In this paper, we propose a 64-bit fast dynamic CMOS comparator with small transistor count. Major features of the proposed comparator are the rearrangement and re-ordering of transistors in the evaluation block of a dynamic cell, and the insertion of a weak n feedback inverter, which helps the pull-down operation to ground. The simulation results given by pre-layout tools, e.g. HSPICE, and post-layout tools, e.g. TimeMill, reveal that the delay is around 2.5 ns while the operating clock rate reaches 100 MHz. A physical chip is fabricated to verify the correctness of our design by using UMC (United Microelectronics Company 0.5 μm (2P2M technology.

  20. Delay Efficient 32-Bit Carry-Skip Adder

    Directory of Open Access Journals (Sweden)

    Yu Shen Lin

    2008-01-01

    Full Text Available The design of a 32-bit carry-skip adder to achieve minimum delay is presented in this paper. A fast carry look-ahead logic using group generate and group propagate functions is used to speed up the performance of multiple stages of ripple carry adders. The group generate and group propagate functions are generated in parallel with the carry generation for each block. The optimum block sizes are decided by considering the critical path into account. The new architecture delivers the sum and carry outputs in lesser unit delays than existing carry-skip adders. The adder is implemented in 0.25 m CMOS technology at 3.3 V. The critical delay for the proposed adder is 3.4 nanoseconds. The simulation results show that the proposed adder is 18% faster than the current fastest carry-skip adder.

  1. Design and Implementation of an Efficient 64 bit MAC

    Directory of Open Access Journals (Sweden)

    Mohammad Shabber Hasan Khan

    2015-08-01

    Full Text Available The design of optimized 64 bit multiplier and accumulator (MAC unit is implemented in this paper. MAC unit plays major role in many of the digital signal processing (DSP applications. The MAC unit is designed with the combinations of multipliers and adders. In the proposed method MAC unit is implemented using Vedic multiplier and the adder is done with ripple carry adder .The components are reduced by implementing Vedic multiplier using the techniques of Vedic mathematics that have been modified to improve performance. a high speed processor depends significantly on the multiplier as it is one of the key hardware blocks in most digital signal processing systems as well as in general processors. The area is optimized effectively using Vedic multiplier .The total design implemented using Xilinx.

  2. Bit-Serial Adder Based on Quantum Dots

    Science.gov (United States)

    Fijany, Amir; Toomarian, Nikzad; Modarress, Katayoon; Spotnitz, Mathew

    2003-01-01

    A proposed integrated circuit based on quantum-dot cellular automata (QCA) would function as a bit-serial adder. This circuit would serve as a prototype building block for demonstrating the feasibility of quantum-dots computing and for the further development of increasingly complex and increasingly capable quantum-dots computing circuits. QCA-based bit-serial adders would be especially useful in that they would enable the development of highly parallel and systolic processors for implementing fast Fourier, cosine, Hartley, and wavelet transforms. The proposed circuit would complement the QCA-based circuits described in "Implementing Permutation Matrices by Use of Quantum Dots" (NPO-20801), NASA Tech Briefs, Vol. 25, No. 10 (October 2001), page 42 and "Compact Interconnection Networks Based on Quantum Dots" (NPO-20855), which appears elsewhere in this issue. Those articles described the limitations of very-large-scale-integrated (VLSI) circuitry and the major potential advantage afforded by QCA. To recapitulate: In a VLSI circuit, signal paths that are required not to interact with each other must not cross in the same plane. In contrast, for reasons too complex to describe in the limited space available for this article, suitably designed and operated QCA-based signal paths that are required not to interact with each other can nevertheless be allowed to cross each other in the same plane without adverse effect. In principle, this characteristic could be exploited to design compact, coplanar, simple (relative to VLSI) QCA-based networks to implement complex, advanced interconnection schemes. To enable a meaningful description of the proposed bit-serial adder, it is necessary to further recapitulate the description of a quantum-dot cellular automation from the first-mentioned prior article: A quantum-dot cellular automaton contains four quantum dots positioned at the corners of a square cell. The cell contains two extra mobile electrons that can tunnel (in the

  3. A one-bit approach for image registration

    Science.gov (United States)

    Nguyen, An Hung; Pickering, Mark; Lambert, Andrew

    2015-02-01

    Motion estimation or optic flow computation for automatic navigation and obstacle avoidance programs running on Unmanned Aerial Vehicles (UAVs) is a challenging task. These challenges come from the requirements of real-time processing speed and small light-weight image processing hardware with very limited resources (especially memory space) embedded on the UAVs. Solutions towards both simplifying computation and saving hardware resources have recently received much interest. This paper presents an approach for image registration using binary images which addresses these two requirements. This approach uses translational information between two corresponding patches of binary images to estimate global motion. These low bit-resolution images require a very small amount of memory space to store them and allow simple logic operations such as XOR and AND to be used instead of more complex computations such as subtractions and multiplications.

  4. ALL OPTICAL 3-BIT SERIAL INPUT SHIFT REGISTER DESIGN

    Directory of Open Access Journals (Sweden)

    VIKRANT K SRIVASTAVA,

    2010-08-01

    Full Text Available In this Paper, we present all-optical shift Register logic with complete Boolean functionality as a representative circuit for modeling and optimization of monolithically integrated components. Proposed optical logic unit is based on nonlinear effects in semiconductor optical amplifiers (SOA. We show a strategy of optical pulse propagation in SOA based on coupled nonlinear equations describing XGM and FWM effects. These equations are first solved togenerate the pump, probe and conjugate pulses in a SOA. The pulse behavior are analyzed and applied to realize behavior of all-optical NAND gate. Next, the logic is used to implement All-Optical Flip-Flop logic, and its function is verified with the help of truth table. Finally with the help of three Flip Flop a 3-bit shift register is proposed. The full design is simple, compact, economical, thermally stable and integration capable.

  5. Experimental approximation of the Jones polynomial with one quantum bit.

    Science.gov (United States)

    Passante, G; Moussa, O; Ryan, C A; Laflamme, R

    2009-12-18

    We present experimental results approximating the Jones polynomial using 4 qubits in a liquid state nuclear magnetic resonance quantum information processor. This is the first experimental implementation of a complete problem for the deterministic quantum computation with one quantum bit model of quantum computation, which uses a single qubit accompanied by a register of completely random states. The Jones polynomial is a knot invariant that is important not only to knot theory, but also to statistical mechanics and quantum field theory. The implemented algorithm is a modification of the algorithm developed by Shor and Jordan suitable for implementation in NMR. These experimental results show that for the restricted case of knots whose braid representations have four strands and exactly three crossings, identifying distinct knots is possible 91% of the time.

  6. Building a spin quantum bit register using semiconductor nanowires.

    Science.gov (United States)

    Baugh, J; Fung, J S; Mracek, J; LaPierre, R R

    2010-04-02

    This paper reviews recent advances in engineering spin quantum bits (qubits) in semiconductor quantum dots and describes an approach based on top-gated semiconductor nanowire devices. Fast electrical single-spin manipulation is achievable, in principle, using the spin-orbit interaction intrinsic to III-V materials, such as InAs, in concert with AC electric fields. Combined with sub-nanosecond gate control of the nearest-neighbor exchange interaction and spin readout by spin-to-charge conversion, a fully electrical solid-state quantum processor is within reach. We outline strategies for spin manipulation, robust readout and mitigation of decoherence due to nuclear fields that, when combined in a single device, should give a viable multi-qubit testbed and a building block for larger scale quantum devices.

  7. The quantum bit from relativity of simultaneity on an interferometer

    CERN Document Server

    Garner, Andrew J P; Dahlsten, Oscar C O

    2014-01-01

    The patterns of fringes produced by an interferometer have always been important testbeds for our best contemporary theories of physics. Historically, interference has been used to contrast quantum mechanics to classical physics, but recently experiments have been performed that test quantum theory against even more exotic alternatives. A physically motivated family of theories are those where the state space of a two-level system is given by a sphere of arbitrary dimension. This includes classical bits, and real, complex and quaternionic quantum theory. In this paper, we consider relativity of simultaneity (that observers may disagree about the order of events at different locations) as applied to a two-armed interferometer. We show that this forbids most interference phenomena more complicated than those of standard complex quantum theory. In this sense, special relativity itself can be used to explain why physics should be described by the rules of quantum theory in this setup. Moreover, our result has con...

  8. Geneva University - Superconducting flux quantum bits: fabricated quantum objects

    CERN Multimedia

    2007-01-01

    Ecole de physique Département de physique nucléaire et corspusculaire 24, Quai Ernest-Ansermet 1211 GENEVE 4 Tél: (022) 379 62 73 Fax: (022) 379 69 92 Lundi 29 janvier 2007 COLLOQUE DE LA SECTION DE PHYSIQUE 17 heures - Auditoire Stueckelberg Superconducting flux quantum bits: fabricated quantum objects Prof. Hans Mooij / Kavli Institute of Nanoscience, Delft University of Technology The quantum conjugate variables of a superconductor are the charge or number of Cooper pairs, and the phase of the order parameter. In circuits that contain small Josephson junctions, these quantum properties can be brought forward. In Delft we study so-called flux qubits, superconducting rings that contain three small Josephson junctions. When a magnetic flux of half a flux quantum is applied to the loop, there are two states with opposite circulating current. For suitable junction parameters, a quantum superposition of those macroscopic states is possible. Transitions can be driven with resonant microwaves. These quantum ...

  9. Atomistic simulation of static magnetic properties of bit patterned media

    Science.gov (United States)

    Arbeláez-Echeverri, O. D.; Agudelo-Giraldo, J. D.; Restrepo-Parra, E.

    2016-09-01

    In this work we present a new design of Co based bit pattern media with out-of-plane uni-axial anisotropy induced by interface effects. Our model features the inclusion of magnetic impurities in the non-magnetic matrix. After the material model was refined during three iterations using Monte Carlo simulations, further simulations were performed using an atomistic integrator of Landau-Lifshitz-Gilbert equation with Langevin dynamics to study the behavior of the system paying special attention to the super-paramagnetic limit. Our model system exhibits three magnetic phase transitions, one due to the magnetically doped matrix material and the weak magnetic interaction between the nano-structures in the system. The different magnetic phases of the system as well as the features of its phase diagram are explained.

  10. Distribution of digital games via BitTorrent

    DEFF Research Database (Denmark)

    Drachen, Anders; Bauer, Kevin; Veitch, Robert W. D.

    2011-01-01

    The practice of illegally copying and distributing digital games is at the heart of one of the most heated and divisive debates in the international games environment. Despite the substantial interest in game piracy, there is very little objective information available about its magnitude or its...... distribution across game titles and game genres. This paper presents the first large-scale, open-method analysis of the distribution of digital game titles, which was conducted by monitoring the BitTorrent peer-to-peer (P2P) file-sharing protocol. The sample includes 173 games and a collection period of three...... months from late 2010 to early 2011. With a total of 12.6 million unique peers identified, it is the largest examination of game piracy via P2P networks to date. The study provides findings that reveal the magnitude of game piracy, the time-frequency of game torrents, which genres that get pirated...

  11. RELAY ASSISTED TRANSMISSSION WITH BIT-INTERLEAVED CODED MODULATION

    Institute of Scientific and Technical Information of China (English)

    Meng Qingmin; You Xiaohu; John Boyer

    2006-01-01

    We investigate an adaptive cooperative protocol in a Two-Hop-Relay (THR) wireless system that combines the following: (1) adaptive relaying based on repetition coding; (2) single or two transmit antennas and one receive antenna configurations for all nodes, each using high order constellation; (3) Bit-Interleaved Coded Modulation (BICM). We focus on a simple decoded relaying (i.e. no error correcting at a relay node)and simple signal quality thresholds for relaying. Then the impact of the two simple thresholds on the system performance is studied. Our results suggest that compared with the traditional scheme for direct transmission,the proposed scheme can increase average throughput in high spectral efficiency region with low implementation-cost at the relay.

  12. El cuaderno de bitácora como proceso educativo

    OpenAIRE

    Comas, Karina; Morawicki, Marcos Kevin

    2015-01-01

    La ponencia “El cuaderno de Bitácora como proceso educativo” forma parte de un avance de investigación del Proyecto Acreditado “Anclajes institucionales de las políticas de formación de formadores en comunicación: Procesos y desarrollos”, dirigido por María Belén Fernández. Esta investigación aborda la temática de la formación permanente en comunicación estudiando para eso diversos anclajes institucionales sobre cómo se presenta la articulación entre el campo de comunicación/educación y las n...

  13. Measurements of Aperture Averaging on Bit-Error-Rate

    Science.gov (United States)

    Bastin, Gary L.; Andrews, Larry C.; Phillips, Ronald L.; Nelson, Richard A.; Ferrell, Bobby A.; Borbath, Michael R.; Galus, Darren J.; Chin, Peter G.; Harris, William G.; Marin, Jose A.; Burdge, Geoffrey L.; Wayne, David; Pescatore, Robert

    2005-01-01

    We report on measurements made at the Shuttle Landing Facility (SLF) runway at Kennedy Space Center of receiver aperture averaging effects on a propagating optical Gaussian beam wave over a propagation path of 1,000 in. A commercially available instrument with both transmit and receive apertures was used to transmit a modulated laser beam operating at 1550 nm through a transmit aperture of 2.54 cm. An identical model of the same instrument was used as a receiver with a single aperture that was varied in size up to 20 cm to measure the effect of receiver aperture averaging on Bit Error Rate. Simultaneous measurements were also made with a scintillometer instrument and local weather station instruments to characterize atmospheric conditions along the propagation path during the experiments.

  14. Diversity Analysis of Bit-Interleaved Coded Multiple Beamforming

    CERN Document Server

    Park, Hong Ju

    2008-01-01

    In this paper, diversity analysis of bit-interleaved coded multiple beamforming (BICMB) is extended to the case of general spatial interleavers, removing a condition on their previously known design criteria and quantifying the resulting diversity order. The diversity order is determined by a parameter Qmax which is inherited from the convolutional code and the spatial de-multiplexer used in BICMB. We introduce a method to find this parameter by employing a transfer function approach as in finding the weight spectrum of a convolutional code. By using this method, several Qmax's are shown and verified to be identical with the results from a computer searching program tracing paths on the trellis. The diversity analysis and the method to find the parameter are supported by simulation results.

  15. Bit-Interleaved Coded Multiple Beamforming with Imperfect CSIT

    CERN Document Server

    Ayanoglu, Ersin Sengul Ender

    2007-01-01

    This paper addresses the performance of bit-interleaved coded multiple beamforming (BICMB) with imperfect knowledge of beamforming vectors. Various wireless standards become equivalent to BICMB when they are operated in beamforming mode. In BICMB, the invariance of the precoding matrix under an arbitrary unitary transform widely studied in the literature is not applicable. On the other hand, the optimum precoder and detector are not unique because of invariance under a diagonal unitary transform. We propose an optimal Euclidean distortion measure and a new linear detector. In addition, a new codebook design is proposed via the generalized Lloyd algorithm based on the new distortion measure. We provide simulation results demonstrating the performance improvement achieved with the proposed distortion measure and the linear detector.

  16. Introducing the Intel i860 64-bit microprocessor

    Energy Technology Data Exchange (ETDEWEB)

    Kohn, L.; Margulis, N. (Intel Corp., Santa Clara, CA (USA))

    1989-08-01

    The development of a single-chip i860 CPU 64-bit, RISC-based microprocessor is reported in this article. It executes parallel instructions using mainframe and supercomputer architectural concepts. The authors designed the 1,000,000-transistor, 10 mm x 15 mm processor for balanced integer, floating-point, and graphics performance. To accommodate their performance goals, they divided the chip area evenly between blocks for integer operations, floating-point operations, and instruction and data cache memories. Inclusion of the RISC (reduced instruction set computing) core, floating-point units, and caches on one chip allowed design of wider internal buses, eliminated interchip communication over-head, and enabled higher performance. As a result, the i860 avoids off-chip delays and allows users to scale the clock beyond the current 33- and 40- MHz speeds. Applications described include workstations, minicomputers, application accelerators for existing processors, and parallel supercomputers.

  17. Calculation of flow distribution in air reverse circulation bit interior fluid field by simplifying air flow model

    Institute of Scientific and Technical Information of China (English)

    Shuqing HAO; Hongwei HUANG; Kun YIN

    2007-01-01

    By simplifying the characters in the air reverse circulation bit interior fluid field, the authors used air dynamics and fluid mechanics to calculate the air distribution in the bit and obtained an equation of flow distribution with a unique resolution. This study will provide help for making certain the bit parameters of the bit structure effectively and study the air reverse circulation bit interior fluid field character deeply.

  18. Proposed first-generation WSQ bit allocation procedure

    Energy Technology Data Exchange (ETDEWEB)

    Bradley, J.N.; Brislawn, C.M.

    1993-09-08

    The Wavelet/Scalar Quantization (WSQ) gray-scale fingerprint image compression algorithm involves a symmetric wavelet transform (SWT) image decomposition followed by uniform scalar quantization of each subband. The algorithm is adaptive insofar as the bin widths for the scalar quantizers are image-specific and are included in the compressed image format. Since the decoder requires only the actual bin width values -- but not the method by which they were computed -- the standard allows for future refinements of the WSQ algorithm by improving the method used to select the scalar quantizer bin widths. This report proposes a bit allocation procedure for use with the first-generation WSQ encoder. In previous work a specific formula is provided for the relative sizes of the scalar quantizer bin widths in terms of the variances of the SWT subbands. An explicit specification for the constant of proportionality, q, that determines the absolute bin widths was not given. The actual compression ratio produced by the WSQ algorithm will generally vary from image to image depending on the amount of coding gain obtained by the run-length and Huffman coding, stages of the algorithm, but testing performed by the FBI established that WSQ compression produces archival quality images at compression ratios of around 20 to 1. The bit allocation procedure described in this report possesses a control parameter, r, that can be set by the user to achieve a predetermined amount of lossy compression, effectively giving the user control over the amount of distortion introduced by quantization noise. The variability observed in final compression ratios is thus due only to differences in lossless coding gain from image to image, chiefly a result of the varying amounts of blank background surrounding the print area in the images. Experimental results are presented that demonstrate the proposed method`s effectiveness.

  19. Instant MuseScore

    CERN Document Server

    Shinn, Maxwell

    2013-01-01

    Get to grips with a new technology, understand what it is and what it can do for you, and then get to work with the most important features and tasks. Instant MuseScore is written in an easy-to follow format, packed with illustrations that will help you get started with this music composition software.This book is for musicians who would like to learn how to notate music digitally with MuseScore. Readers should already have some knowledge about musical terminology; however, no prior experience with music notation software is necessary.

  20. A pipelined 50-MHz CMOS 64-bit floating-point arithmetic processor

    Energy Technology Data Exchange (ETDEWEB)

    Benschneider, B.J.; Bowhill, W.J.; Cooper, E.M.; Gronowski, P.E.; Peng, V.; Pickholtz, J.D.; Samudrala, S. (Digital Equipment Corp., Hudson, MA (US)); Gavrielov, M.N. (LSI Logic Corp., Milpitas, CA (US)); Maheshwari, V.K. (AT and T Bell Labs., Allentown, PA (US))

    1989-10-01

    A 135 K transistor, uniformly pipelined 50-MHz CMOS 64-bit floating-point arithmetic processor chip is described. The execution unit is capable of sustaining pipelined performance of one 32-bit or 64-bit result every 20 ns for all operations except double-precision multiply (40 ns) and divide. The chip employs an exponent difference prediction scheme and a unified leading-one and sticky-bit computation logic for the addition (ADD) and subtraction (SUB) operations. A hardware multiplier using a radix-8 modified Booth algorithm and a divider using a radix-2 SRT algorithm ar used.

  1. The Digital Agenda of Virtual Currencies. Can BitCoin Become a Global Currency?

    OpenAIRE

    KANCS D'ARTIS; CIAIAN PAVEL; MIROSLAVA Rajcaniova

    2015-01-01

    This paper identifies and analyzes BitCoin features which may facilitate Bitcoin to become a global currency, as well as characteristics which may impede the use of BitCoin as a medium of exchange, a unit of account and a store of value, and compares BitCoin with standard currencies with respect to the main functions of money. Among all analyzed BitCoin features, the extreme price volatility stands out most clearly compared to standard currencies. In order to understand the reasons for such e...

  2. 14-bit pipeline-SAR ADC for image sensor readout circuits

    Science.gov (United States)

    Wang, Gengyun; Peng, Can; Liu, Tianzhao; Ma, Cheng; Ding, Ning; Chang, Yuchun

    2015-03-01

    A two stage 14bit pipeline-SAR analog-to-digital converter includes a 5.5bit zero-crossing MDAC and a 9bit asynchronous SAR ADC for image sensor readout circuits built in 0.18um CMOS process is described with low power dissipation as well as small chip area. In this design, we employ comparators instead of high gain and high bandwidth amplifier, which consumes as low as 20mW of power to achieve the sampling rate of 40MSps and 14bit resolution.

  3. The Digital Agenda of Virtual Currencies. Can BitCoin Become a Global Currency?

    OpenAIRE

    KANCS D'ARTIS; CIAIAN PAVEL; MIROSLAVA RAJCANIOVA

    2015-01-01

    This paper identifies and analyzes BitCoin features which may facilitate Bitcoin to become a global currency, as well as characteristics which may impede the use of BitCoin as a medium of exchange, a unit of account and a store of value, and compares BitCoin with standard currencies with respect to the main functions of money. Among all analyzed BitCoin features, the extreme price volatility stands out most clearly compared to standard currencies. In order to understand the reasons for such e...

  4. Designing embedded systems with 32-bit PIC microcontrollers and MikroC

    CERN Document Server

    Ibrahim, Dogan

    2013-01-01

    The new generation of 32-bit PIC microcontrollers can be used to solve the increasingly complex embedded system design challenges faced by engineers today. This book teaches the basics of 32-bit C programming, including an introduction to the PIC 32-bit C compiler. It includes a full description of the architecture of 32-bit PICs and their applications, along with coverage of the relevant development and debugging tools. Through a series of fully realized example projects, Dogan Ibrahim demonstrates how engineers can harness the power of this new technology to optimize their embedded design

  5. Fpga Implementation of 8-Bit Vedic Multiplier by Using Complex Numbers

    Directory of Open Access Journals (Sweden)

    Gundlapalle Nandakishore,

    2014-06-01

    Full Text Available The paper describes the implementation of 8-bit vedic multiplier using complex numbers previous technique describes that 8-bit vedic multiplier using barrel shifter by FPGA implementation comparing the both technique in this paper propagation delay is reduced so that processing of speed will be high 8-bit vedic multiplier using barrel shifter propagation delay nearly 22nsec but present technique 8-bit vedic multiplier using complex numbers where propagation delay is 19nsec. The design is implemented and verified by FPGA and ISE simulator. The core was implemented on the Spartan 3E starts board the preferred language is used in verilog.

  6. Optimization of Mapping Rule of Bit-Interleaved Turbo Coded Modulation with 16QAM

    Institute of Scientific and Technical Information of China (English)

    FEI Ze-song; YANG Yu; LIU Lin-nan; KUANG Jing-ming

    2005-01-01

    Optimization of mapping rule of bit-interleaved Turbo coded modulation with 16 quadrature amplitude modulation (QAM) is investigated based on different impacts of various encoded bits sequence on Turbo decoding performance. Furthermore, bit-interleaved in-phase and quadrature phase (I-Q) Turbo coded modulation scheme are designed similarly with I-Q trellis coded modulation (TCM). Through performance evaluation and analysis, it can be seen that the novel mapping rule outperforms traditional one and the I-Q Turbo coded modulation can not achieve good performance as expected. Therefore, there is not obvious advantage in using I-Q method in bit-interleaved Turbo coded modulation.

  7. A Novel Nondestructive Bit-Line Discharging Scheme for Deep Submicrometer STT-RAM

    DEFF Research Database (Denmark)

    Zeinali, Behzad; Madsen, Jens Kargaard; Raghavan, Praveen

    . In this paper, we propose a novel non-destructive self-reference sensing scheme for STT-RAM. The proposed technique overcomes the large bit-to-bit variation of MTJ resistance. In the proposed scheme, the stored value in the STTRAM cell preserves, hence, the long write-back operation is eliminated. Besides......, the sensing scheme is accomplished in one step. In this scheme, the Bit-Line is pre-charged and then discharged during read operation. The MTJ resistance state can be found by comparing the time constant of discharging. The simulation results show the overall sensing time is 4 ns when the Bit-Line capacitance...

  8. Two-bit quantum random number generator based on photon-number-resolving detection

    Science.gov (United States)

    Jian, Yi; Ren, Min; Wu, E.; Wu, Guang; Zeng, Heping

    2011-07-01

    Here we present a new fast two-bit quantum random number generator based on the intrinsic randomness of the quantum physical phenomenon of photon statistics of coherent light source. Two-bit random numbers were generated according to the number of detected photons in each light pulse by a photon-number-resolving detector. Poissonian photon statistics of the coherent light source guaranteed the complete randomness of the bit sequences. Multi-bit true random numbers were generated for the first time based on the multi-photon events from a coherent light source.

  9. Which score should be used for posttraumatic multiple organ failure? - Comparison of the MODS, Denver- and SOFA- Scores.

    Science.gov (United States)

    Fröhlich, Matthias; Wafaisade, Arasch; Mansuri, Anastasios; Koenen, Paola; Probst, Christian; Maegele, Marc; Bouillon, Bertil; Sakka, Samir G

    2016-11-03

    Multiple organ dysfunction and multiple organ failure (MOF) is still a major complication and challenge in the treatment of severely injured patients. The incidence varies decisively in current studies, which complicates the comparability regarding risk factors, treatment recommendations and patients' outcome. Therefore, we analysed how the currently used scoring systems, the MODS, Denver- and SOFA Score, influence the definition and compared the scores' predictive ability. Out of datasets of severely injured patients (ISS ≥ 16, Age ≥ 16) staying more tha 48 h on the ICU, the scores were calculated, respectively. The scores' predictive ability on day three after trauma for resource requiring measurements and patient specific outcomes were compared using receiver-operating characteristics. One hundred seventy-six patients with a mean ISS 28 ± 13 could be included. MODS and SOFA score defined the incidence of MOF consistently (46.5 % vs. 52.3 %), while the Denver score defined MOF in 22.2 %. The MODS outperformed Denver- and SOFA score in predicting mortality (area under the curve/AUC: 0.83 vs. 0.67 vs. 0.72), but was inferior predicting the length of stay (AUC 0.71 vs.0.80 vs.0.82) and a prolonged time on mechanical ventilation (AUC 0.75 vs. 0.81 vs. 0.84). MODS and SOFA score were comparably sensitive and the Denver score more specific in all analyses. All three scores have a comparable ability to predict the outcome in trauma patients including patients with severe traumatic brain injury (TBI). Either score could be favored depending weather a higher sensitivity or specificity is targeted. The SOFA score showed the most balanced relation of sensitivity and specificity. The incidence of posttraumatic MOF relies decisively on the score applied. Therefore harmonizing the competing scores and definitions is desirable.

  10. Tensorial Orientation Scores

    NARCIS (Netherlands)

    van de Gronde, Jasper J.; Azzopardi, George; Petkov, Nicolai

    2015-01-01

    Orientation scores are representations of images built using filters that only select on orientation (and not on the magnitude of the frequency). Importantly, they allow (easy) reconstruction, making them ideal for use in a filtering pipeline. Traditionally a specific set of orientations has to be c

  11. Developing Scoring Algorithms

    Science.gov (United States)

    We developed scoring procedures to convert screener responses to estimates of individual dietary intake for fruits and vegetables, dairy, added sugars, whole grains, fiber, and calcium using the What We Eat in America 24-hour dietary recall data from the 2003-2006 NHANES.

  12. The lod score method.

    Science.gov (United States)

    Rice, J P; Saccone, N L; Corbett, J

    2001-01-01

    The lod score method originated in a seminal article by Newton Morton in 1955. The method is broadly concerned with issues of power and the posterior probability of linkage, ensuring that a reported linkage has a high probability of being a true linkage. In addition, the method is sequential, so that pedigrees or lod curves may be combined from published reports to pool data for analysis. This approach has been remarkably successful for 50 years in identifying disease genes for Mendelian disorders. After discussing these issues, we consider the situation for complex disorders, where the maximum lod score (MLS) statistic shares some of the advantages of the traditional lod score approach but is limited by unknown power and the lack of sharing of the primary data needed to optimally combine analytic results. We may still learn from the lod score method as we explore new methods in molecular biology and genetic analysis to utilize the complete human DNA sequence and the cataloging of all human genes.

  13. Nursing activities score

    NARCIS (Netherlands)

    Miranda, DR; Nap, R; de Rijk, A; Schaufeli, W; Lapichino, G

    Objectives. The instruments used for measuring nursing workload in the intensive care unit (e.g., Therapeutic Intervention Scoring System-28) are based on therapeutic interventions related to severity of illness. Many nursing activities are not necessarily related to severity of illness, and

  14. EnhancedBit: Unleashing the potential of the unchoking policy in the BitTorrent  protocol

    CERN Document Server

    Atlidakis, V; Delis, A

    2014-01-01

    In this paper, we propose a modification to the BitTorrent protocol related to its peer unchoking policy. In particular, we apply a novel optimistic unchoking approach that improves the quality of inter-connections amongst peers, i.e., increases the number of directly-connected and interested-in-cooperation peers without penalizing underutilized and/or idle peers. Our optimistic unchoking policy takes into consideration the number of clients currently interested in downloading from a peer that is to be unchoked. Our conjecture is that peers having few clients interested in downloading data from them, should be favored with optimistic unchoke intervals. This enables the peers in question to receive data since they become unchoked faster and in turn, they will trigger the interest of additional clients. In contrast, peers with plenty of "interested" clients should enjoy a lower priority to be selected as planned optimistic unchoked, since these peers likely have enough data to forward; nevertheless, they receiv...

  15. Automated Essay Scoring

    Directory of Open Access Journals (Sweden)

    Semire DIKLI

    2006-01-01

    Full Text Available Automated Essay Scoring Semire DIKLI Florida State University Tallahassee, FL, USA ABSTRACT The impacts of computers on writing have been widely studied for three decades. Even basic computers functions, i.e. word processing, have been of great assistance to writers in modifying their essays. The research on Automated Essay Scoring (AES has revealed that computers have the capacity to function as a more effective cognitive tool (Attali, 2004. AES is defined as the computer technology that evaluates and scores the written prose (Shermis & Barrera, 2002; Shermis & Burstein, 2003; Shermis, Raymat, & Barrera, 2003. Revision and feedback are essential aspects of the writing process. Students need to receive feedback in order to increase their writing quality. However, responding to student papers can be a burden for teachers. Particularly if they have large number of students and if they assign frequent writing assignments, providing individual feedback to student essays might be quite time consuming. AES systems can be very useful because they can provide the student with a score as well as feedback within seconds (Page, 2003. Four types of AES systems, which are widely used by testing companies, universities, and public schools: Project Essay Grader (PEG, Intelligent Essay Assessor (IEA, E-rater, and IntelliMetric. AES is a developing technology. Many AES systems are used to overcome time, cost, and generalizability issues in writing assessment. The accuracy and reliability of these systems have been proven to be high. The search for excellence in machine scoring of essays is continuing and numerous studies are being conducted to improve the effectiveness of the AES systems.

  16. Field Study of Drilling Bits Performance Optimization Using a Computer Model.

    Directory of Open Access Journals (Sweden)

    Oriji, A. Boniface

    2015-03-01

    Full Text Available One of the major problems facing drilling operations is the performance of the drilling Bits. The ability of the Bit to crush the rock and the removal of the crushed rock from the wellbore effectively. It is necessary to understand the fundamental difference in Bit design for different rock textures because many variables tend to affect Bit optimization, particularly the type of formations, economics and Bit selection. However, the cost of drilling a well has a considerable effect on the selection and the design of a particular Bit, therefore this paper focuses on the development of a model that will predict future Bit performance and optimization for actual well design and construction. The variables to optimize Bit performance provide means of handling cost estimation hence the model becomes more realistic and dynamic in its application. The input variables and control factors for this model are stretched to minimize cost and maximize performance. The cost per foot and the break even calculations were done using data from the reference well X14 and also the evaluation well X35 from a field-X in the Niger Delta region. A Visual Basic dot Net program model was developed, tested and validated with the real field data to know its accuracy. The model interface shows the detailed application of the Bits in validating the data to provide the equivalent results for the five different Bits. Each set of the Bit record was ran separately on the software and the results for each application developed for comparison. In the software, data application were grouped into two distinct methods namely; rentals method and historical method. Under the rentals method, data were uploaded into the software and ran to generate results while the historical method was basically used for model prediction. The breakeven analysis provided a technique for calculating the performance required for an alternative Bit type to match the cost per foot of the current Bit. Based on

  17. Efficient Circuit Configuration for Enhancing Resolution of 8-bit flash Analog to Digital Convertor

    Directory of Open Access Journals (Sweden)

    Gururaj Balikatti

    2012-11-01

    Full Text Available The need constantly exists for converters with higher resolution, faster conversion speeds and lower power dissipation. High speed analog to digital converters (ADCs have been based on flash architecture, because all comparators sample the analog input voltage simultaneously, this ADC is thus inherently fast. Unfortunately flash ADC requires 2N - 1 comparators to convert N bit digital code from an analog sample. This makes flash ADCs unsuitable for high resolution applications. The focus of this paper is on efficient circuit configuration to enhance resolution of available 8-bit flash ADC, while maintaining number of comparators only 256 for 12 bit conversion. This technique optimizes the number of comparator requirements. In this approach, an 8-bit flash ADC partitions the analog input range into 256 quantization cells, separated by 255 boundary points. An 8-bit binary code 00000000 to 11111111 is assigned to each cell. The Microcontroller decides within which cell the input sample lies and assigns a 12-bit binary center code 000000000000 to 111111111111 according to the cell value. The exact 12-bit digital code is obtained by successive approximation technique. In this paper the focus will be on all-around efficient circuit for enhancing resolution of 8-bit Flash ADC. It is shown that by adopting this configuration, we can obtain 12-bit digital data just using 256 comparators. Therefore this technique is best suitable when high speed combined with high resolution is required. An experimental prototype of proposed 12-bit ADC was implemented using Philips P89V51RD2BN Microcontroller. Use of Microcontroller has greatly reduced the hardware requirement and cost. An ADC result of 12-bit prototype is presented. The results show that the ADC exhibits a maximum DNL of 0.52LSB and a maximum INL of 0.55LSB.

  18. Effect of bit wear on hammer drill handle vibration and productivity.

    Science.gov (United States)

    Antonucci, Andrea; Barr, Alan; Martin, Bernard; Rempel, David

    2017-08-01

    The use of large electric hammer drills exposes construction workers to high levels of hand vibration that may lead to hand-arm vibration syndrome and other musculoskeletal disorders. The aim of this laboratory study was to investigate the effect of bit wear on drill handle vibration and drilling productivity (e.g., drilling time per hole). A laboratory test bench system was used with an 8.3 kg electric hammer drill and 1.9 cm concrete bit (a typical drill and bit used in commercial construction). The system automatically advanced the active drill into aged concrete block under feed force control to a depth of 7.6 cm while handle vibration was measured according to ISO standards (ISO 5349 and 28927). Bits were worn to 4 levels by consecutive hole drilling to 4 cumulative drilling depths: 0, 1,900, 5,700, and 7,600 cm. Z-axis handle vibration increased significantly (pvibration did not increase further with bits worn more than 1900 cm of cumulative drilling depth. Neither x- nor y-axis handle vibration was effected by bit wear. The time to drill a hole increased by 58% for the bit with 5,700 cm of cumulative drilling depth compared to a new bit. Bit wear led to a small but significant increase in both ISO weighted and unweighted z-axis handle vibration. Perhaps more important, bit wear had a large effect on productivity. The effect on productivity will influence a worker's allowable daily drilling time if exposure to drill handle vibration is near the ACGIH Threshold Limit Value. ([1]) Construction contractors should implement a bit replacement program based on these findings.

  19. The anoikis effector Bit1 displays tumor suppressive function in lung cancer cells.

    Directory of Open Access Journals (Sweden)

    Xin Yao

    Full Text Available The mitochondrial Bit1 (Bcl-2 inhibitor of transcription 1 protein is a part of an apoptotic pathway that is uniquely regulated by integrin-mediated attachment. As an anoikis effector, Bit1 is released into the cytoplasm following loss of cell attachment and induces a caspase-independent form of apoptosis. Considering that anoikis resistance is a critical determinant of transformation, we hypothesized that cancer cells may circumvent the Bit1 apoptotic pathway to attain anchorage-independence and tumorigenic potential. Here, we provide the first evidence of the tumor suppressive effect of Bit1 through a mechanism involving anoikis induction in human lung adenocarcinoma derived A549 cells. Restitution of Bit1 in anoikis resistant A549 cells is sufficient to induce detachment induced-apoptosis despite defect in caspase activation and impairs their anchorage-independent growth. Conversely, stable downregulation of Bit1 in these cells significantly enhances their anoikis resistance and anchorage-independent growth. The Bit1 knockdown cells exhibit significantly enhanced tumorigenecity in vivo. It has been previously shown that the nuclear TLE1 corepressor is a putative oncogene in lung cancer, and we show here that TLE1 blocks Bit1 mediated anoikis in part by sequestering the pro-apoptotic partner of Bit1, the Amino-terminal Enhancer of Split (AES protein, in the nucleus. Taken together, these findings suggest a tumor suppressive role of the caspase-independent anoikis effector Bit1 in lung cancer. Consistent with its role as a tumor suppressor, we have found that Bit1 is downregulated in human non-small cell lung cancer (NSCLC tissues.

  20. The anoikis effector Bit1 displays tumor suppressive function in lung cancer cells.

    Science.gov (United States)

    Yao, Xin; Jennings, Scott; Ireland, Shubha Kale; Pham, Tri; Temple, Brandi; Davis, Mya; Chen, Renwei; Davenport, Ian; Biliran, Hector

    2014-01-01

    The mitochondrial Bit1 (Bcl-2 inhibitor of transcription 1) protein is a part of an apoptotic pathway that is uniquely regulated by integrin-mediated attachment. As an anoikis effector, Bit1 is released into the cytoplasm following loss of cell attachment and induces a caspase-independent form of apoptosis. Considering that anoikis resistance is a critical determinant of transformation, we hypothesized that cancer cells may circumvent the Bit1 apoptotic pathway to attain anchorage-independence and tumorigenic potential. Here, we provide the first evidence of the tumor suppressive effect of Bit1 through a mechanism involving anoikis induction in human lung adenocarcinoma derived A549 cells. Restitution of Bit1 in anoikis resistant A549 cells is sufficient to induce detachment induced-apoptosis despite defect in caspase activation and impairs their anchorage-independent growth. Conversely, stable downregulation of Bit1 in these cells significantly enhances their anoikis resistance and anchorage-independent growth. The Bit1 knockdown cells exhibit significantly enhanced tumorigenecity in vivo. It has been previously shown that the nuclear TLE1 corepressor is a putative oncogene in lung cancer, and we show here that TLE1 blocks Bit1 mediated anoikis in part by sequestering the pro-apoptotic partner of Bit1, the Amino-terminal Enhancer of Split (AES) protein, in the nucleus. Taken together, these findings suggest a tumor suppressive role of the caspase-independent anoikis effector Bit1 in lung cancer. Consistent with its role as a tumor suppressor, we have found that Bit1 is downregulated in human non-small cell lung cancer (NSCLC) tissues.

  1. Detection of bit location by acoustic emission technique in horizontal directional drilling. Kojo sakushin koho ni okeru bit ichi no AE ho ni yoru hyotei

    Energy Technology Data Exchange (ETDEWEB)

    Abe, M.; Niitsuma, H. (Tohoku Univ., Sendai (Japan). Faculty of Engineering); Sugimori, S. (Tohoku Univ., Sendai (Japan). Grauduate School); Nakajima, T. (NKK Corp., Tokyo (Japan))

    1991-09-20

    The accuracy of the bit location in the excavation of pilot holes with horizontal drilling technique must be kept less than several tens of centimeters. Such an accuracy is hard to be achieved by the existing controlling technology. The depth of the bit tip can be measured comparatively accurately using a clinometer and the like. The azimuth meter, gyroscope, underground radar, locator, etc. are used for the detection of azimuth of the bit, but every one of them has its own problem. Therefore, new measuring methods to be used in combination with the conventional methods are required which can cover up the shortcomings of the conventional methods. Acoustic emission (AE) technique is employed for the detection of the bit location, and the accompanying problems as well as detecting performance are investigated. It is used for the measurement in the drilling test performed at the reclaimed land on the premises of Keihin ironworks of NKK Corp. In connection with the detection of the bit location in horizontal pilot drilling, a study is made on the zone detection technique for AE signals generated by the bit when striking ground and those generated during drilling. 7 refs., 17 figs., 1 tab.

  2. Engineering Dissipation to Generate Entanglement Between Remote Superconducting Quantum Bits

    Science.gov (United States)

    Schwartz, Mollie Elisheva

    Superconducting quantum circuits provide a promising avenue for scalable quantum computation and simulation. Their chief advantage is that, unlike physical atoms or electrons, these ''artificial atoms'' can be designed with nearly-arbitrarily large coupling to one another and to their electromagnetic environment. This strong coupling allows for fast quantum bit (qubit) operations, and for efficient readout. However, strong coupling comes at a price: a qubit that is strongly coupled to its environment is also strongly susceptible to losses and dissipation, as coherent information leaks from the quantum system under study into inaccessible ''bath'' modes. Extensive work in the field is dedicated to engineering away these losses to the extent possible, and to using error correction to undo the effects of losses that are unavoidable. This dissertation explores an alternate approach to dissipation: we study avenues by which dissipation itself can be used to generate, rather than destroy, quantum resources. We do so specifically in the context of quantum entanglement, one of the most important and most counter-intuitive aspects of quantum mechanics. Entanglement generation and stabilization is critical to most non-trivial implementations of quantum computing and quantum simulation, as it is the property that distinguishes a multi-qubit quantum system from a string of classical bits. The ability to harness dissipation to generate, purify, and stabilize entanglement is therefore highly desirable. We begin with an overview of quantum dissipation and measurement, followed by an introduction to entanglement and to the superconducting quantum information architecture. We then discuss three sets of experiments that highlight and explore the powerful uses of dissipation in quantum systems. First, we use an entangling measurement to probabilistically generate entanglement between two qubits separated by more than one meter of ordinary cable. This represents the first achievement

  3. Transformative research: definitions, approaches and consequences.

    Science.gov (United States)

    Trevors, J T; Pollack, Gerald H; Saier, Milton H; Masson, Luke

    2012-06-01

    In this perspective a definition of transformative research (TR) is proposed and discussed. We define TR as that which "transforms" or causes a major change in thought patterns concerning an area of scientific endeavor. This type of research is often elusive, requires different approaches and sometimes depends on a bit of luck. TR concerns intangibles such as human intuition, serendipity, unpredictable events, implausible hypotheses, a well-prepared mind and often interpersonal communications. Examples are provided to illustrate how TR may unfold. Contributions it makes to basic and applied humanistic knowledge are highlighted.

  4. Technique for evaluating antiwear properties of lubricant grease for GN and GNU drill bits

    Energy Technology Data Exchange (ETDEWEB)

    Gubarev, A.S.; Butovets, V.V.; Dyachenko, Yu.P.; Krasnokutskaya, M.Ye.; Nedbaylyuk, P.Ye.; Oparin, V.A.; Yeremenko, V.F.

    1982-01-01

    A technique has been developed for determining under laboratory conditions the antiwear characteristics for lubricant grease used for drill bit supports models GN and GNU. A satisfactory coincidence of test results of lubricants USsA and Uniol-1 has been derived using the given technique, as well as satisfactory results for the drill bits operating in industrial conditions.

  5. Dispersion Tolerance of 40 Gbaud Multilevel Modulation Formats with up to 3 bits per Symbol

    DEFF Research Database (Denmark)

    Jensen, Jesper Bevensee; Tokle, Torger; Geng, Yan

    2006-01-01

    We present numerical and experimental investigations of dispersion tolerance for multilevel phase- and amplitude modulation with up to 3 bits per symbol at a symbol rate of 40 Gbaud......We present numerical and experimental investigations of dispersion tolerance for multilevel phase- and amplitude modulation with up to 3 bits per symbol at a symbol rate of 40 Gbaud...

  6. Up to 20 Gbit/s bit-rate transparent integrated interferometric wavelength converter

    DEFF Research Database (Denmark)

    Jørgensen, Carsten; Danielsen, Søren Lykke; Hansen, Peter Bukhave;

    1996-01-01

    We present a compact and optimised multiquantum-well based, integrated all-active Michelson interferometer for 26 Gbit/s optical wavelength conversion. Bit-rate transparent operation is demonstrated with a conversion penalty well below 0.5 dB at bit-rates ranging from 622 Mbit/s to 20 Gbit/s....

  7. Mutual information, bit error rate and security in W\\'{o}jcik's scheme

    CERN Document Server

    Zhang, Z

    2004-01-01

    In this paper the correct calculations of the mutual information of the whole transmission, the quantum bit error rate (QBER) are presented. Mistakes of the general conclusions relative to the mutual information, the quantum bit error rate (QBER) and the security in W\\'{o}jcik's paper [Phys. Rev. Lett. {\\bf 90}, 157901(2003)] have been pointed out and corrected.

  8. Enhanced bit rate-distance product impulse radio ultra-wideband over fiber link

    DEFF Research Database (Denmark)

    Rodes Lopez, Roberto; Jensen, Jesper Bevensee; Caballero Jambrina, Antonio

    2010-01-01

    We report on a record distance and bit rate-wireless impulse radio (IR) ultra-wideband (UWB) link with combined transmission over a 20 km long fiber link. We are able to improve the compliance with the regulated frequency emission mask and achieve bit rate-distance products as high as 16 Gbit/s·m....

  9. Purpose-built PDC bit successfully drills 7-in liner equipment and formation: An integrated solution

    Energy Technology Data Exchange (ETDEWEB)

    Puennel, J.G.A.; Huppertz, A.; Huizing, J. [and others

    1996-12-31

    Historically, drilling out the 7-in, liner equipment has been a time consuming operation with a limited success ratio. The success of the operation is highly dependent on the type of drill bit employed. Tungsten carbide mills and mill tooth rock bits required from 7.5 to 11.5 hours respectively to drill the pack-off bushings, landing collar, shoe track and shoe. Rates of penetration dropped dramatically when drilling the float equipment. While conventional PDC bits have drilled the liner equipment successfully (averaging 9.7 hours), severe bit damage invariably prevented them from continuing to drill the formation at cost-effective penetration rates. This paper describes the integrated development and application of an IADC M433 Class PDC bit, which was designed specifically to drill out the 7-in. liner equipment and continue drilling the formation at satisfactory penetration rates. The development was the result of a joint investigation There the operator and bit/liner manufacturers shared their expertise in solving a drilling problem, The heavy-set bit was developed following drill-off tests conducted to investigate the drillability of the 7-in. liner equipment. Key features of the new bit and its application onshore The Netherlands will be presented and analyzed.

  10. On swarm-level resource allocation in BitTorrent communities

    NARCIS (Netherlands)

    Vinko, T.; Santos, F.; Andrade, N.; Capota, M.

    2012-01-01

    BitTorrent is a peer-to-peer computer network protocol for sharing content in an efficient and scalable way. Modeling and analysis of the popular private BitTorrent communities has become an active area of research. In these communities users are strongly incentivized to contribute their resources,

  11. Advanced approaches to the improving of three-cone rock bits manufacturing method

    OpenAIRE

    Яким, Роман; Петрина, Юрій; Яким, Ігор

    2013-01-01

    The complex approach to the improvement of three-cone rock bits manufacturing method, that includes the requirements increase for the chemical composition of rock bit steels, and also the advanced approaches to the improvement of technological processes quality and efficiency are offered.

  12. Application of time-hopping UWB range-bit rate performance in the UWB sensor networks

    NARCIS (Netherlands)

    Nascimento, J.R.V. do; Nikookar, H.

    2008-01-01

    In this paper, the achievable range-bit rate performance is evaluated for Time-Hopping (TH) UWB networks complying with the FCC outdoor emission limits in the presence of Multiple Access Interference (MAI). Application of TH-UWB range-bit rate performance is presented for UWB sensor networks. Result

  13. An Auction-Bidding Protocol for Distributed Bit Allocation in RSSI-based Localization Networks

    Directory of Open Access Journals (Sweden)

    Ahmad A. Ababneh

    2016-06-01

    Full Text Available Several factors (e.g., target energy, sensor density affect estimation error at a point of interest in sensor networks. One of these factors is the number of allocated bits to sensors that cover the point of interest when quantization is employed. In this paper, we investigate bit allocation in such networks such that estimation error requirements at multiple points of interest are satisfied as best as possible. To solve this nonlinear integer programming problem, we propose an iterative distributed auctionbidding protocol. Starting with some initial bit distribution, a network is divided into a a number of clusters each with its own auction. Each cluster head (CH acts as an auctioneer and divides sensors into buyers or sellers of bits (i.e., commodity. With limited messaging, CHs redistribute bits among sensors, each bit at a time such that the difference between achieved and required estimation errors within each cluster is reduced in each round. We propose two bit-pricing schemes used by sensors to decide on exchanging bits. Finally, simulation results show that our proposed ‘distributed’ protocol’s error performance can be within 5%-10% of that of a ‘centralized’ genetic algorithm (GA solution.

  14. Least Reliable Bits Coding (LRBC) for high data rate satellite communications

    Science.gov (United States)

    Vanderaar, Mark; Wagner, Paul; Budinger, James

    1992-02-01

    An analysis and discussion of a bandwidth efficient multi-level/multi-stage block coded modulation technique called Least Reliable Bits Coding (LRBC) is presented. LRBC uses simple multi-level component codes that provide increased error protection on increasingly unreliable modulated bits in order to maintain an overall high code rate that increases spectral efficiency. Further, soft-decision multi-stage decoding is used to make decisions on unprotected bits through corrections made on more protected bits. Using analytical expressions and tight performance bounds it is shown that LRBC can achieve increased spectral efficiency and maintain equivalent or better power efficiency compared to that of Binary Phase Shift Keying (BPSK). Bit error rates (BER) vs. channel bit energy with Additive White Gaussian Noise (AWGN) are given for a set of LRB Reed-Solomon (RS) encoded 8PSK modulation formats with an ensemble rate of 8/9. All formats exhibit a spectral efficiency of 2.67 = (log2(8))(8/9) information bps/Hz. Bit by bit coded and uncoded error probabilities with soft-decision information are determined. These are traded with with code rate to determine parameters that achieve good performance. The relative simplicity of Galois field algebra vs. the Viterbi algorithm and the availability of high speed commercial Very Large Scale Integration (VLSI) for block codes indicates that LRBC using block codes is a desirable method for high data rate implementations.

  15. Towards the generation of random bits at terahertz rates based on a chaotic semiconductor laser

    Science.gov (United States)

    Kanter, Ido; Aviad, Yaara; Reidler, Igor; Cohen, Elad; Rosenbluh, Michael

    2010-06-01

    Random bit generators (RBGs) are important in many aspects of statistical physics and crucial in Monte-Carlo simulations, stochastic modeling and quantum cryptography. The quality of a RBG is measured by the unpredictability of the bit string it produces and the speed at which the truly random bits can be generated. Deterministic algorithms generate pseudo-random numbers at high data rates as they are only limited by electronic hardware speed, but their unpredictability is limited by the very nature of their deterministic origin. It is widely accepted that the core of any true RBG must be an intrinsically non-deterministic physical process, e.g. measuring thermal noise from a resistor. Owing to low signal levels, such systems are highly susceptible to bias, introduced by amplification, and to small nonrandom external perturbations resulting in a limited generation rate, typically less than 100M bit/s. We present a physical random bit generator, based on a chaotic semiconductor laser, having delayed optical feedback, which operates reliably at rates up to 300Gbit/s. The method uses a high derivative of the digitized chaotic laser intensity and generates the random sequence by retaining a number of the least significant bits of the high derivative value. The method is insensitive to laser operational parameters and eliminates the necessity for all external constraints such as incommensurate sampling rates and laser external cavity round trip time. The randomness of long bit strings is verified by standard statistical tests.

  16. Bit and Power Loading Approach for Broadband Multi-Antenna OFDM System

    DEFF Research Database (Denmark)

    Rahman, Muhammad Imadur; Das, Suvra S.; Wang, Yuanye

    2007-01-01

    In this work, we have studied bit and power allocation strategies for multi-antenna assisted Orthogonal Frequency Division Multiplexing (OFDM) systems and investigated the impact of different rates of bit and power allocations on various multi-antenna diversity schemes. It is observed that, if we...... allocations across OFDM sub-channels are required together for efficient exploitation of wireless channel....

  17. High power laser-mechanical drilling bit and methods of use

    Energy Technology Data Exchange (ETDEWEB)

    Grubb, Daryl L.; Kolachalam, Sharath K.; Faircloth, Brian O.; Rinzler, Charles C.; Allen, Erik C.; Underwood, Lance D.; Zediker, Mark S.

    2017-02-07

    An apparatus with a high power laser-mechanical bit for use with a laser drilling system and a method for advancing a borehole. The laser-mechanical bit has a beam path and mechanical removal devices that provide for the removal of laser-affected rock to advance a borehole.

  18. Credit scoring for individuals

    Directory of Open Access Journals (Sweden)

    Maria DIMITRIU

    2010-12-01

    Full Text Available Lending money to different borrowers is profitable, but risky. The profits come from the interest rate and the fees earned on the loans. Banks do not want to make loans to borrowers who cannot repay them. Even if the banks do not intend to make bad loans, over time, some of them can become bad. For instance, as a result of the recent financial crisis, the capability of many borrowers to repay their loans were affected, many of them being on default. That’s why is important for the bank to monitor the loans. The purpose of this paper is to focus on credit scoring main issues. As a consequence of this, we presented in this paper the scoring model of an important Romanian Bank. Based on this credit scoring model and taking into account the last lending requirements of the National Bank of Romania, we developed an assessment tool, in Excel, for retail loans which is presented in the case study.

  19. Earthquake forecast enrichment scores

    Directory of Open Access Journals (Sweden)

    Christine Smyth

    2012-03-01

    Full Text Available The Collaboratory for the Study of Earthquake Predictability (CSEP is a global project aimed at testing earthquake forecast models in a fair environment. Various metrics are currently used to evaluate the submitted forecasts. However, the CSEP still lacks easily understandable metrics with which to rank the universal performance of the forecast models. In this research, we modify a well-known and respected metric from another statistical field, bioinformatics, to make it suitable for evaluating earthquake forecasts, such as those submitted to the CSEP initiative. The metric, originally called a gene-set enrichment score, is based on a Kolmogorov-Smirnov statistic. Our modified metric assesses if, over a certain time period, the forecast values at locations where earthquakes have occurred are significantly increased compared to the values for all locations where earthquakes did not occur. Permutation testing allows for a significance value to be placed upon the score. Unlike the metrics currently employed by the CSEP, the score places no assumption on the distribution of earthquake occurrence nor requires an arbitrary reference forecast. In this research, we apply the modified metric to simulated data and real forecast data to show it is a powerful and robust technique, capable of ranking competing earthquake forecasts.

  20. An 18-bit high performance audio {sigma}-{Delta} D/A converter

    Energy Technology Data Exchange (ETDEWEB)

    Zhang Hao; Han Yan; Han Xiaoxia; Wang Hao; Liang Guo [Institute of Microelectronics and Photoelectronics, Zhejiang University, Hangzhou 310027 (China); Huang Xiaowei [CISD, Institute of Microelectronic CAD, Hangzhou 310018 (China); Cheung, Ray C., E-mail: huangxw@hdu.edu.c [Department of Electronic Engineering, City University of Hong Kong (Hong Kong)

    2010-07-15

    A multi-bit quantized high performance sigma-delta ({sigma}-{Delta}) audio DAC is presented. Compared to its single-bit counterpart, the multi-bit quantization offers many advantages, such as simpler {sigma}-{Delta} modulator circuit, lower clock frequency and smaller spurious tones. With the data weighted average (DWA) mismatch shaping algorithm, element mismatch errors induced by multi-bit quantization can be pushed out of the signal band, hence the noise floor inside the signal band is greatly lowered. To cope with the crosstalk between digital and analog circuits, every analog component is surrounded by a guard ring, which is an innovative attempt. The 18-bit DAC with the above techniques, which is implemented in a 0.18 {mu}m mixed-signal CMOS process, occupies a core area of 1.86 mm{sup 2}. The measured dynamic range (DR) and peak SNDR are 96 dB and 88 dB, respectively.

  1. Tree structure-based bit-to-symbol mapping for multidimensional modulation format

    Science.gov (United States)

    Zhaoxi, Li; Yujuan, Si; Guijun, Hu

    2017-06-01

    Bit-to-symbol mapping is one of the key issues in multidimensional modulation. In an effort to resolve this issue, a tree structure based bit-to-symbol mapping scheme is proposed. By constructing a tree structure of constellation points, any neighboring constellation points become nearest-neighbor constellation points with minimum Euclidean distance, which in turn, changes the bit-to-symbol mapping problem in multidimensional signal modulation from random to orderly. Then, through the orderly distribution of labels, the minimum Hamming distance between the nearest neighboring constellation points is ensured, eventually achieving bit-to-symbol mapping optimization for multidimensional signals. Simulation analysis indicates that, compared with random search mapping, tree mapping can effectively improve the bit error rate performance of multidimensional signal modulation without multiple searching, reducing the computational cost.

  2. Warped Discrete Cosine Transform-Based Low Bit-Rate Block Coding Using Image Downsampling

    Directory of Open Access Journals (Sweden)

    Ertürk Sarp

    2007-01-01

    Full Text Available This paper presents warped discrete cosine transform (WDCT-based low bit-rate block coding using image downsampling. While WDCT aims to improve the performance of conventional DCT by frequency warping, the WDCT has only been applicable to high bit-rate coding applications because of the overhead required to define the parameters of the warping filter. Recently, low bit-rate block coding based on image downsampling prior to block coding followed by upsampling after the decoding process is proposed to improve the compression performance for low bit-rate block coders. This paper demonstrates that a superior performance can be achieved if WDCT is used in conjunction with image downsampling-based block coding for low bit-rate applications.

  3. A hyperspectral images compression algorithm based on 3D bit plane transform

    Science.gov (United States)

    Zhang, Lei; Xiang, Libin; Zhang, Sam; Quan, Shengxue

    2010-10-01

    According the analyses of the hyper-spectral images, a new compression algorithm based on 3-D bit plane transform is proposed. The spectral coefficient is higher than the spatial. The algorithm is proposed to overcome the shortcoming of 1-D bit plane transform for it can only reduce the correlation when the neighboring pixels have similar values. The algorithm calculates the horizontal, vertical and spectral bit plane transform sequentially. As the spectral bit plane transform, the algorithm can be easily realized by hardware. In addition, because the calculation and encoding of the transform matrix of each bit are independent, the algorithm can be realized by parallel computing model, which can improve the calculation efficiency and save the processing time greatly. The experimental results show that the proposed algorithm achieves improved compression performance. With a certain compression ratios, the algorithm satisfies requirements of hyper-spectral images compression system, by efficiently reducing the cost of computation and memory usage.

  4. Context-Adaptive Arithmetic Coding Scheme for Lossless Bit Rate Reduction of MPEG Surround in USAC

    Science.gov (United States)

    Yoon, Sungyong; Pang, Hee-Suk; Sung, Koeng-Mo

    We propose a new coding scheme for lossless bit rate reduction of the MPEG Surround module in unified speech and audio coding (USAC). The proposed scheme is based on context-adaptive arithmetic coding for efficient bit stream composition of spatial parameters. Experiments show that it achieves the significant lossless bit reduction of 9.93% to 12.14% for spatial parameters and 8.64% to 8.96% for the overall MPEG Surround bit streams compared to the original scheme. The proposed scheme, which is not currently included in USAC, can be used for the improved coding efficiency of MPEG Surround in USAC, where the saved bits can be utilized by the other modules in USAC.

  5. Multi-bit upset aware hybrid error-correction for cache in embedded processors

    Science.gov (United States)

    Jiaqi, Dong; Keni, Qiu; Weigong, Zhang; Jing, Wang; Zhenzhen, Wang; Lihua, Ding

    2015-11-01

    For the processor working in the radiation environment in space, it tends to suffer from the single event effect on circuits and system failures, due to cosmic rays and high energy particle radiation. Therefore, the reliability of the processor has become an increasingly serious issue. The BCH-based error correction code can correct multi-bit errors, but it introduces large latency overhead. This paper proposes a hybrid error correction approach that combines BCH and EDAC to correct both multi-bit and single-bit errors for caches with low cost. The proposed technique can correct up to four-bit error, and correct single-bit error in one cycle. Evaluation results show that, the proposed hybrid error-correction scheme can improve the performance of cache accesses up to 20% compared to the pure BCH scheme.

  6. An 18-bit high performance audio σ-Δ D/A converter

    Science.gov (United States)

    Hao, Zhang; Xiaowei, Huang; Yan, Han; Cheung, Ray C.; Xiaoxia, Han; Hao, Wang; Guo, Liang

    2010-07-01

    A multi-bit quantized high performance sigma-delta (σ-Δ) audio DAC is presented. Compared to its single-bit counterpart, the multi-bit quantization offers many advantages, such as simpler σ-Δ modulator circuit, lower clock frequency and smaller spurious tones. With the data weighted average (DWA) mismatch shaping algorithm, element mismatch errors induced by multi-bit quantization can be pushed out of the signal band, hence the noise floor inside the signal band is greatly lowered. To cope with the crosstalk between digital and analog circuits, every analog component is surrounded by a guard ring, which is an innovative attempt. The 18-bit DAC with the above techniques, which is implemented in a 0.18 μm mixed-signal CMOS process, occupies a core area of 1.86 mm2. The measured dynamic range (DR) and peak SNDR are 96 dB and 88 dB, respectively.

  7. Drilling of bone: a robust automatic method for the detection of drill bit break-through.

    Science.gov (United States)

    Ong, F R; Bouazza-Marouf, K

    1998-01-01

    The aim of this investigation is to devise a robust detection method for drill bit break-through when drilling into long bones using an automated drilling system that is associated with mechatronic assisted surgery. This investigation looks into the effects of system compliance and inherent drilling force fluctuation on the profiles of drilling force, drilling force, drilling between successive samples and drill bit rotational speed. It is shown that these effects have significant influences on the bone drilling related profiles and thus on the detection of drill bit break-through. A robust method, based on a Kalman filter, has been proposed. Using a modified Kalman filter, it is possible to convert the profiles of drilling force difference between successive samples and/or the drill bit rotational speed into easily recognizable and more consistent profiles, allowing a robust and repeatable detection of drill bit break-through.

  8. BitTorrent Processing Unit BPU发展观望

    Institute of Scientific and Technical Information of China (English)

    Zone; 杨原青

    2007-01-01

    在电脑发展的早期,无论是运算处理、还是图形处理、还是输入、输出处理,都由CPU(Central Processing Unit,中央处理器)一力承担,然而随着处理专用化发展,1999年NVIDIA率先将图形处理独立出来,提出了GPU(Graphics Processing unit,绘图处理单元)概念。八年过去,现在GPU已经成为图形处理的中坚力量,并让所玩家耳熟能详。而近期,台湾2家公刊则提出了BPU(BitTorrent Processing Unit,BT处理单元)概念。下面,就让我们一起看看,这款极为新鲜的概念产品。

  9. Hill Cipher and Least Significant Bit for Image Messaging Security

    Directory of Open Access Journals (Sweden)

    Muhammad Husnul Arif

    2016-02-01

    Full Text Available Exchange of information through cyberspace has many benefits as an example fast estimated time, unlimited physical distance and space limits, etc. But in these activities can also pose a security risk for confidential information. It is necessary for the safety that can be used to protect data transmitted through the Internet. Encryption algorithm that used to encrypt message to be sent (plaintext into messages that have been randomized (ciphertext is cryptography and steganography algorithms. In application of cryptographic techniques that will be used is Hill Cipher. The technique is combined with steganography techniques Least Significant Bit. The result of merging techniques can maintain the confidentiality of messages because people who do not know the secret key used will be difficult to get the message contained in the stego-image and the image that has been inserted can not be used as a cover image. Message successfully inserted and extracted back on all samples with a good image formats * .bmp, * .png , * .jpg at a resolution of 512 x 512 pixels , 256 x 256 pixels. MSE and PSNR results are not influenced file format or file size, but influenced by dimensions of image. The larger dimensions of the image, then the smaller MSE that means error of image gets smaller.

  10. Demonstration of bit torque, load, RPM and survey tool

    Energy Technology Data Exchange (ETDEWEB)

    Ian Gray; Paul Clemence; Gary Paradise; Sean Charlton; Robert Dixon; Peter Hatherly [Sigra (Australia)

    2002-06-01

    In 1996, Sigra and CMTE began a joint research project aimed at developing a tool to provide geosteering options for in-seam drilling. The tool was to provide a survey capability, drill torque, thrust and rpm measurements, and geophysical measurements of rock resistivity and the spectrum of the natural gamma radiation. It was intended that the tool could reside behind the drill bit and communicate through the drill string via existing communication systems or a cableless system that Sigra was proposing to develop. The development of geosteering tools has proved to be far more difficult than originally expected. The results from various tests, however, are extremely encouraging. Sigra has demonstrated the acquisition of rock resistivity and drill parameters - torque, pressure and thrust while drilling is underway. The expectation is that the resistivity measurements can indicate the approach of the coal seam roof or floor from the borehole. CMTE has established through the logging of in-seam and vertical boreholes, that spectrometric analysis of natural gamma radiation allows a characteristic seam profile to be monitored and that stone bands in the seam can be distinguished from the roof and floor. The ratio of the counts due to thorium and potassium is particularly diagnostic when combined with the information on the total radiation. All tools have been designed and constructed in consideration of the rigours of the down-hole environment, the needs for intrinsic safety, the needs for power, modularity, down-hole processing and communications.

  11. Pushing BitTorrent Locality to the Limit

    CERN Document Server

    Blond, Stevens Le; Dabbous, Walid; 10.1016/j.comnet.2010.09.014

    2010-01-01

    Peer-to-peer (P2P) locality has recently raised a lot of interest in the community. Indeed, whereas P2P content distribution enables financial savings for the content providers, it dramatically increases the traffic on inter-ISP links. To solve this issue, the idea to keep a fraction of the P2P traffic local to each ISP was introduced a few years ago. Since then, P2P solutions exploiting locality have been introduced. However, several fundamental issues on locality still need to be explored. In particular, how far can we push locality, and what is, at the scale of the Internet, the reduction of traffic that can be achieved with locality? In this paper, we perform extensive experiments on a controlled environment with up to 10,000 BitTorrent clients to evaluate the impact of high locality on inter-ISP links traffic and peers download completion time. We introduce two simple mechanisms that make high locality possible in challenging scenarios and we show that we save up to several orders of magnitude inter-ISP ...

  12. Transforming networking within the ESIP Federation using ResearchBit

    Science.gov (United States)

    Robinson, E.

    2015-12-01

    Geoscientists increasingly need interdisciplinary teams to solve their research problems. Currently, geoscientists use Research Networking (RN) systems to connect with each other and find people of similar and dissimilar interests. As we shift to digitally mediated scholarship, we need innovative methods for scholarly communication. Formal methods for scholarly communication are undergoing vast transformation owing to the open-access movement and reproducible research. However, informal scholarly communication that takes place at professional society meetings and conferences, like AGU, has received limited research attention relying primarily on serendipitous interaction. The ResearchBit project aims to fundamentally improve informal methods of scholarly communication by leveraging the serendipitous interactions of researchers and making them more aware of co-located potential collaborators with mutual interests. This presentation will describe our preliminary hardware testing done at the Federation for Earth Science Information Partners (ESIP) Summer meeting this past July and the initial recommendation system design. The presentation will also cover the cultural shifts and hurdles to introducing new technology, the privacy concerns of tracking technology and how we are addressing those new issues.

  13. Bit-Interleaved Coded Multiple Beamforming with Perfect Coding

    CERN Document Server

    Li, Boyu

    2010-01-01

    When the channel state information is known by the transmitter as well as the receiver, beamforming techniques that employ Singular Value Decomposition (SVD) are commonly used in Multiple-Input Multiple-Output (MIMO) systems. Without channel coding, when a single symbol is transmitted, these systems achieve the full diversity order. Whereas, this property is lost when multiple symbols are simultaneously transmitted. Full diversity can be restored when channel coding is added, as long as the code rate Rc and the number of employed subchannels S satisfy the condition RcS =< 1. Moreover, by adding a proper constellation precoder, full diversity can be achieved for both uncoded and coded SVD systems, e.g., Fully Precoded Multiple Beamforming (FPMB) and Bit-Interleaved Coded Multiple Beamforming with Full Precoding (BICMB-FP). Perfect Space-Time Block Code (PSTBC) is a full-rate full-diversity space-time code, which achieves maximum coding gain for MIMO systems. Previously, Perfect Coded Multiple Beamforming (P...

  14. Modeling for write synchronization in bit patterned media recording

    Science.gov (United States)

    Lin, Maria Yu; Chan, Kheong Sann; Chua, Melissa; Zhang, Songhua; Kui, Cai; Elidrissi, Moulay Rachid

    2012-04-01

    Bit patterned media recording (BPMR) is a contender for next generation technology after conventional granular magnetic recording (CGMR) can no longer sustain the continued areal density growth. BPMR has several technological hurdles that need to be overcome, among them is solving the problem of write synchronization. With CGMR, grains are randomly distributed and occur almost all over the media. In contrast, BPMR has grains patterned into a regular lattice on the media with an approximate 50% duty cycle. Hence only about a quarter of the area is filled with magnetic material. During writing, the clock must be synchronized to the islands or the written in error rate becomes unacceptably large and the system fails. Maintaining synchronization during writing is a challenge as the system is not able to read and write simultaneously. Hence reading must occur periodically between the writing frequently enough to re-synchronize the writing clock to the islands. In this work, we study the requirements on the lengths of the synchronization and data sectors in a BPMR system using an advanced model for BPMR, and taking into consideration different spindle motor speed variations, which is the main cause of the mis-synchronization.

  15. Advanced High-Speed 16-Bit Digitizer System

    Energy Technology Data Exchange (ETDEWEB)

    None

    2012-05-01

    The fastest commercially available 16-bit ADC can only perform around 200 mega-samples per second (200 MS/s). Connecting ADC chips together in eight different time domains increases the quantity of samples taken by a factor of eight. This method of interleaving requires that the input signal being sampled is split into eight identical signals and arrives at each ADC chip at the same point in time. The splitting of the input signal is performed in the analog front end containing a wideband filter that impedance matches the input signal to the ADC chips. Each ADC uses a clock to tell it when to perform a conversion. Using eight unique clocks spaced in 45-degree increments is the method used to time shift when each ADC chip performs its conversion. Given that this control clock is a fixed frequency, the clock phase shifting is accomplished by tightly controlling the distance that the clock must travel, resulting in a time delay. The interleaved ADC chips will now generate digital data in eight different time domains. These data are processed inside a field-programmable gate array (FPGA) to move the data back into a single time domain and store it into memory. The FPGA also contains a Nios II processor that provides system control and data retrieval via Ethernet.

  16. Bits from photons: oversampled image acquisition using binary Poisson statistics.

    Science.gov (United States)

    Yang, Feng; Lu, Yue M; Sbaiz, Luciano; Vetterli, Martin

    2012-04-01

    We study a new image sensor that is reminiscent of a traditional photographic film. Each pixel in the sensor has a binary response, giving only a 1-bit quantized measurement of the local light intensity. To analyze its performance, we formulate the oversampled binary sensing scheme as a parameter estimation problem based on quantized Poisson statistics. We show that, with a single-photon quantization threshold and large oversampling factors, the Cramér-Rao lower bound (CRLB) of the estimation variance approaches that of an ideal unquantized sensor, i.e., as if there were no quantization in the sensor measurements. Furthermore, the CRLB is shown to be asymptotically achievable by the maximum-likelihood estimator (MLE). By showing that the log-likelihood function of our problem is concave, we guarantee the global optimality of iterative algorithms in finding the MLE. Numerical results on both synthetic data and images taken by a prototype sensor verify our theoretical analysis and demonstrate the effectiveness of our image reconstruction algorithm. They also suggest the potential application of the oversampled binary sensing scheme in high dynamic range photography.

  17. Thermally induced magnetic switching in bit-patterned media

    Science.gov (United States)

    Pfau, B.; Günther, C. M.; Hauet, T.; Eisebitt, S.; Hellwig, O.

    2017-07-01

    We have studied the thermal variation of the switching field of magnetic islands at room temperature. A model bit-pattern media composed of an assembly of islands with 80 nm width was fabricated by sputter deposition onto a pre-patterned substrate. Using direct magnetic-contrast imaging of the islands under applied field, we extract the switching probabilities of individual islands. Based on an analytical model for the thermally activated switching of the islands, we are able to determine the intrinsic magnetic anisotropy of each island and, consequentially, a distribution of anisotropies for the island ensemble investigated. In the distribution, we identify a separated group of islands with a particularly small anisotropy. We attribute this group to islands containing misaligned grains triggering the magnetic reversal. At room temperature and slow field sweep rates, the observed thermal broadening of the switching-field distribution is small compared to the intrinsic broadening. However, we illustrate that thermal fluctuations play a crucial role at high sweep rates by extrapolating our results to technological relevant regimes.

  18. Linking Chains Together: String Bits And The Bethe Ansatz

    CERN Document Server

    Lübcke, M

    2004-01-01

    This thesis is divided into two parts. In the first part we focus mainly on certain aspects of the AdS/CFT correspondence. The AdS/CFT correspondence is a proposed duality between Type IIB superstring theory on AdS5 × S5 and N = 4 supersymmetric Yang-Mills theory. In the BMN limit string states located in the center of AdS5 rotate quickly around the equator of the S5 and correspond, in the dual theory, to operators constructed as long chains of sub-operators. This structure of the operators can be formulated as a spin chain and by using the Bethe ansatz their properties can be obtained by solving a set of Bethe equations. Having infinitely many sub-operators, there are methods for solving the Bethe equations in certain sectors. In paper III finite size corrections to the anomalous dimensions in the SU(2) sector are calculated to leading order. Inspired by the chain structure of the corresponding operators, the theory of string bits treats the strings as a discrete sets of points. This theory suffers...

  19. Constellation labeling optimization for bit-interleaved coded APSK

    Science.gov (United States)

    Xiang, Xingyu; Mo, Zijian; Wang, Zhonghai; Pham, Khanh; Blasch, Erik; Chen, Genshe

    2016-05-01

    This paper investigates the constellation and mapping optimization for amplitude phase shift keying (APSK) modulation, which is deployed in Digital Video Broadcasting Satellite - Second Generation (DVB-S2) and Digital Video Broadcasting - Satellite services to Handhelds (DVB-SH) broadcasting standards due to its merits of power and spectral efficiency together with the robustness against nonlinear distortion. The mapping optimization is performed for 32-APSK according to combined cost functions related to Euclidean distance and mutual information. A Binary switching algorithm and its modified version are used to minimize the cost function and the estimated error between the original and received data. The optimized constellation mapping is tested by combining DVB-S2 standard Low-Density Parity-Check (LDPC) codes in both Bit-Interleaved Coded Modulation (BICM) and BICM with iterative decoding (BICM-ID) systems. The simulated results validate the proposed constellation labeling optimization scheme which yields better performance against conventional 32-APSK constellation defined in DVB-S2 standard.

  20. Feasibility Study of 8-Bit Microcontroller Applications for Ethernet

    Directory of Open Access Journals (Sweden)

    Lech Gulbinovič

    2011-08-01

    Full Text Available Feasibility study of 8-bit microcontroller applications for Ethernet is presented. Designed device is based on ATmega32 microcontroller and 10 Mbps Ethernet controller ENC28J60. Device is simulated as mass queuing theoretical model with ticket booking counter. Practical explorations are accomplished and characteristics are determined. Practical results are compared to theoretical ones. Program code and device packet processing speed optimization are discussed. Microcontroller packet processing speed and packet latency depend on packet size. For ICMP protocol packet processing speed varies 1.4–2.1 Mbps, latency – 0.8–8.4 ms. UDP protocol packet processing speed varies 1.3–1.8 Mbps, latency – 1.1–9.6 ms. Packet processing speed depends on compilation settings and program code compression level. Best results are reached on optimization le­vel ‑O3, then speed increased ~3% but program code size increased 68% comparing to –Os optimization level.Article in Lithuanian

  1. The International Bleeding Risk Score

    DEFF Research Database (Denmark)

    Laursen, Stig Borbjerg; Laine, L.; Dalton, H.

    2017-01-01

    The International Bleeding Risk Score: A New Risk Score that can Accurately Predict Mortality in Patients with Upper GI-Bleeding.......The International Bleeding Risk Score: A New Risk Score that can Accurately Predict Mortality in Patients with Upper GI-Bleeding....

  2. Autonomously stabilized entanglement between two superconducting quantum bits.

    Science.gov (United States)

    Shankar, S; Hatridge, M; Leghtas, Z; Sliwa, K M; Narla, A; Vool, U; Girvin, S M; Frunzio, L; Mirrahimi, M; Devoret, M H

    2013-12-19

    Quantum error correction codes are designed to protect an arbitrary state of a multi-qubit register from decoherence-induced errors, but their implementation is an outstanding challenge in the development of large-scale quantum computers. The first step is to stabilize a non-equilibrium state of a simple quantum system, such as a quantum bit (qubit) or a cavity mode, in the presence of decoherence. This has recently been accomplished using measurement-based feedback schemes. The next step is to prepare and stabilize a state of a composite system. Here we demonstrate the stabilization of an entangled Bell state of a quantum register of two superconducting qubits for an arbitrary time. Our result is achieved using an autonomous feedback scheme that combines continuous drives along with a specifically engineered coupling between the two-qubit register and a dissipative reservoir. Similar autonomous feedback techniques have been used for qubit reset, single-qubit state stabilization, and the creation and stabilization of states of multipartite quantum systems. Unlike conventional, measurement-based schemes, the autonomous approach uses engineered dissipation to counteract decoherence, obviating the need for a complicated external feedback loop to correct errors. Instead, the feedback loop is built into the Hamiltonian such that the steady state of the system in the presence of drives and dissipation is a Bell state, an essential building block for quantum information processing. Such autonomous schemes, which are broadly applicable to a variety of physical systems, as demonstrated by the accompanying paper on trapped ion qubits, will be an essential tool for the implementation of quantum error correction.

  3. Giga bit per second Differential Scheme for High Speed Interconnect

    Directory of Open Access Journals (Sweden)

    Mandeep Singh Narula

    2012-02-01

    Full Text Available The performance of many digital systems today is limited by the interconnection bandwidth between chips. Although the processing performance of a single chip has increased dramatically since the inception of the integrated circuit technology, the communication bandwidth between chips has not enjoyed as much benefit. Most CMOS chips, when communicating off-chip, drive un terminated lines with full-swing CMOS drivers. Such full-swing CMOS interconnect ring-up the line, and hence has a bandwidth that is limited by the length of the line rather than the performance of the semiconductor technology. Thus, as VLSI technology scales, the pin bandwidth does not improve with the technology, but rather remains limited by board and cable geometry, making off-chip bandwidth an even more critical bottleneck. In order to increase the I/O Bandwidth, some efficient high speed signaling standard must be used which considers the line termination, signal integrity, power dissipation, noise immunity etc In this work, a transmitter has been developed for high speed off chip communication. It consists of low speed input buffer, serializer which converts parallel input data into serial data and a current mode driver which converts the voltage mode input signals into current over the transmission line. Output of 32 low speed input buffers is fed to two serializer, each serializer converting 16 bit parallel data into serial data stream. Output of two serializers is fed to LVDS current mode driver. The serial link technique used in this work is the time division multiplex (TDM and point-to-point technique. It means that the low-speed parallel signals are transferred to the high-speed serial signal at the transmitter end and the high-speed serial signal is transferred to the low-speed parallel signals at the receiver end. Serial link is the design of choice in any application where the cost of the communication channel is high and duplicating the links in large numbers is

  4. Giga bit per second Differential Scheme for High Speed Interconnect

    Directory of Open Access Journals (Sweden)

    Mandeep Singh Narula

    2012-03-01

    Full Text Available The performance of many digital systems today is limited by the interconnection bandwidth between chips. Although the processing performance of a single chip has increased dramatically since the inception of the integrated circuit technology, the communication bandwidth between chips has not enjoyed as much benefit. Most CMOS chips, when communicating off-chip, drive unterminated lines with full-swing CMOS drivers. Such full-swing CMOS interconnect ring-up the line, and hence has a bandwidth that is limited by the length of the line rather than the performance of the semiconductor technology. Thus, as VLSI technology scales, the pin bandwidth does not improve with the technology, but rather remains limited by board and cable geometry, making off-chip bandwidth an even more critical bottleneck. In order to increase the I/O Bandwidth, some efficient high speed signaling standard must be used which considers the line termination, signal integrity, power dissipation, noise immunity etc In this work, a transmitter has been developed for high speed offchip communication. It consists of low speed input buffer, serializer which converts parallel input data into serial data and a current mode driver which converts the voltage mode input signals into current over the transmission line. Output of 32 low speed input buffers is fed to two serializer, each serializer converting 16 bit parallel data into serial data stream. Output of two serializers is fed to LVDS current mode driver. The serial link technique used in this work is the time division multiplex (TDM and point-to-point technique. It means that the low-speed parallel signals are transferred to the high-speed serial signal at the transmitter end and the high-speed serial signal is transferred to the low-speed parallel signals at the receiver end. Serial link is the design of choice in any application where the cost of the communication channel is high and duplicating the links in large numbers is

  5. An intermediate significant bit (ISB) watermarking technique using neural networks.

    Science.gov (United States)

    Zeki, Akram; Abubakar, Adamu; Chiroma, Haruna

    2016-01-01

    Prior research studies have shown that the peak signal to noise ratio (PSNR) is the most frequent watermarked image quality metric that is used for determining the levels of strength and weakness of watermarking algorithms. Conversely, normalised cross correlation (NCC) is the most common metric used after attacks were applied to a watermarked image to verify the strength of the algorithm used. Many researchers have used these approaches to evaluate their algorithms. These strategies have been used for a long time, however, which unfortunately limits the value of PSNR and NCC in reflecting the strength and weakness of the watermarking algorithms. This paper considers this issue to determine the threshold values of these two parameters in reflecting the amount of strength and weakness of the watermarking algorithms. We used our novel watermarking technique for embedding four watermarks in intermediate significant bits (ISB) of six image files one-by-one through replacing the image pixels with new pixels and, at the same time, keeping the new pixels very close to the original pixels. This approach gains an improved robustness based on the PSNR and NCC values that were gathered. A neural network model was built that uses the image quality metrics (PSNR and NCC) values obtained from the watermarking of six grey-scale images that use ISB as the desired output and that are trained for each watermarked image's PSNR and NCC. The neural network predicts the watermarked image's PSNR together with NCC after the attacks when a portion of the output of the same or different types of image quality metrics (PSNR and NCC) are obtained. The results indicate that the NCC metric fluctuates before the PSNR values deteriorate.

  6. A Novel Digital Background Calibration Technique for 16 bit SHA-less Multibit Pipelined ADC

    Directory of Open Access Journals (Sweden)

    Swina Narula

    2016-01-01

    Full Text Available In this paper, a high resolution of 16 bit and high speed of 125MS/s, multibit Pipelined ADC with digital background calibration is presented. In order to achieve low power, SHA-less front end is used with multibit stages. The first and second stages are used here as a 3.5 bit and the stages from third to seventh are of 2.5 bit and last stage is of 3-bit flash ADC. After bit alignment and truncation of total 19 bits, 16 bits are used as final digital output. To precise the remove linear gain error of the residue amplifier and capacitor mismatching error, a digital background calibration technique is used, which is a combination of signal dependent dithering (SDD and butterfly shuffler. To improve settling time of residue amplifier, a special circuit of voltage separation is used. With the proposed digital background calibration technique, the spurious-free dynamic range (SFDR has been improved to 97.74 dB @30 MHz and 88.9 dB @150 MHz, and the signal-to-noise and distortion ratio (SNDR has been improved to 79.77 dB @ 30 MHz, and 73.5 dB @ 150 MHz. The implementation of the Pipelined ADC has been completed with technology parameters of 0.18μm CMOS process with 1.8 V supply. Total power consumption is 300 mW by the proposed ADC.

  7. New reliable scoring system, Toyama mouse score, to evaluate locomotor function following spinal cord injury in mice.

    Science.gov (United States)

    Shigyo, Michiko; Tanabe, Norio; Kuboyama, Tomoharu; Choi, Song-Hyen; Tohda, Chihiro

    2014-06-03

    Among the variety of methods used to evaluate locomotor function following a spinal cord injury (SCI), the Basso Mouse Scale score (BMS) has been widely used for mice. However, the BMS mainly focuses on hindlimb movement rather than on graded changes in body support ability. In addition, some of the scoring methods include double or triple criteria within a single score, which likely leads to an increase in the deviation within the data. Therefore we aimed to establish a new scoring method reliable and easy to perform in mice with SCI. Our Toyama Mouse Score (TMS) was established by rearranging and simplifying the BMS score and combining it with the Body Support Scale score (BSS). The TMS reflects changes in both body support ability and hindlimb movement. The definition of single score is made by combing multiple criteria in the BMS. The ambiguity was improved in the TMS. Using contusive SCI mice, hindlimb function was measured using the TMS, BMS and BSS systems. The TMS could distinguish changes in hindlimb movements that were evaluated as the same score by the BMS. An analysis of the coefficient of variation (CV) of score points recorded for 11 days revealed that the CV for the TMS was significantly lower than the CV obtained using the BMS. A variation in intra evaluators was lower in the TMS than in the BMS. These results suggest that the TMS may be useful as a new reliable method for scoring locomotor function for SCI models.

  8. Fingerprinting of music scores

    Science.gov (United States)

    Irons, Jonathan; Schmucker, Martin

    2004-06-01

    Publishers of sheet music are generally reluctant in distributing their content via the Internet. Although online sheet music distribution's advantages are numerous the potential risk of Intellectual Property Rights (IPR) infringement, e.g. illegal online distributions, disables any innovation propensity. While active protection techniques only deter external risk factors, additional technology is necessary to adequately treat further risk factors. For several media types including music scores watermarking technology has been developed, which ebeds information in data by suitable data modifications. Furthermore, fingerprinting or perceptual hasing methods have been developed and are being applied especially for audio. These methods allow the identification of content without prior modifications. In this article we motivate the development of watermarking and fingerprinting technologies for sheet music. Outgoing from potential limitations of watermarking methods we explain why fingerprinting methods are important for sheet music and address potential applications. Finally we introduce a condept for fingerprinting of sheet music.

  9. Theoretical Study of Quantum Bit Rate in Free-Space Quantum Cryptography

    Institute of Scientific and Technical Information of China (English)

    MA Jing; ZHANG Guang-Yu; TAN Li-Ying

    2006-01-01

    The quantum bit rate is an important operating parameter in free-space quantum key distribution. We introduce the measuring factor and the sifting factor, and present the expressions of the quantum bit rate based on the ideal single-photon sources and the single-photon sources with Poisson distribution. The quantum bit rate is studied in the numerical simulation for the laser links between a ground station and a satellite in a low earth orbit. The results show that it is feasible to implement quantum key distribution between a ground station and a satellite in a low earth orbit.

  10. Telemetry System Parameters and Bit Error Performance of NRZ and DM PCM/FM

    Science.gov (United States)

    1976-03-29

    MODEL 400 4·POLE, LINEAR L ________ J PHASE FILTER ANDOM OM PSEUDO·R 0 PSEUDO·RA R NDOM :’olRZ EMR 721 TELEMETRY RECOVERED PCM SEQUENCE BIT...with variable bit rate. The NRZ and DM signals were pseudo-random sequences of 2,047 bits. The pre- modulation filter was a four-pole, linear phase ... filter with adjustable bandwidth. RF transmitter devia- tion and RF attenuation were adjustable on the FM signal generator which was operated at

  11. Inadvertently programmed bits in Samsung 128 Mbit flash devices: a flaky investigation

    Science.gov (United States)

    Swift, G.

    2002-01-01

    JPL's X2000 avionics design pioneers new territory by specifying a non-volatile memory (NVM) board based on flash memories. The Samsung 128Mb device chosen was found to demonstrate bit errors (mostly program disturbs) and block-erase failures that increase with cycling. Low temperature, certain pseudo- random patterns, and, probably, higher bias increase the observable bit errors. An experiment was conducted to determine the wearout dependence of the bit errors to 100k cycles at cold temperature using flight-lot devices (some pre-irradiated). The results show an exponential growth rate, a wide part-to-part variation, and some annealing behavior.

  12. Inadvertently programmed bits in Samsung 128 Mbit flash devices: a flaky investigation

    Science.gov (United States)

    Swift, G.

    2002-01-01

    JPL's X2000 avionics design pioneers new territory by specifying a non-volatile memory (NVM) board based on flash memories. The Samsung 128Mb device chosen was found to demonstrate bit errors (mostly program disturbs) and block-erase failures that increase with cycling. Low temperature, certain pseudo- random patterns, and, probably, higher bias increase the observable bit errors. An experiment was conducted to determine the wearout dependence of the bit errors to 100k cycles at cold temperature using flight-lot devices (some pre-irradiated). The results show an exponential growth rate, a wide part-to-part variation, and some annealing behavior.

  13. Apparatus for measuring weight, torque and side force on a drill bit

    Energy Technology Data Exchange (ETDEWEB)

    Maron, R.

    1990-09-25

    This patent describes an apparatus for measuring at least one load applied to a drill bit during the drilling of a well. It comprises: drillstring sub means adapted to be connected in a drillstring above the drill bit; a pair of diametrically opposite openings extending only partially through the wall of the sub from an outer surface of the sub means; plug means in each of the openings. The plug means cooperating with the openings to define an atmospheric chamber means in each of the openings; and weight sensor means in each of the opening for generating an output in response to at least the parameter of weight on the drill bit.

  14. Room temperature single-photon detectors for high bit rate quantum key distribution

    Energy Technology Data Exchange (ETDEWEB)

    Comandar, L. C.; Patel, K. A. [Toshiba Research Europe Ltd., 208 Cambridge Science Park, Milton Road, Cambridge CB4 0GZ (United Kingdom); Engineering Department, Cambridge University, 9 J J Thomson Ave., Cambridge CB3 0FA (United Kingdom); Fröhlich, B., E-mail: bernd.frohlich@crl.toshiba.co.uk; Lucamarini, M.; Sharpe, A. W.; Dynes, J. F.; Yuan, Z. L.; Shields, A. J. [Toshiba Research Europe Ltd., 208 Cambridge Science Park, Milton Road, Cambridge CB4 0GZ (United Kingdom); Penty, R. V. [Engineering Department, Cambridge University, 9 J J Thomson Ave., Cambridge CB3 0FA (United Kingdom)

    2014-01-13

    We report room temperature operation of telecom wavelength single-photon detectors for high bit rate quantum key distribution (QKD). Room temperature operation is achieved using InGaAs avalanche photodiodes integrated with electronics based on the self-differencing technique that increases avalanche discrimination sensitivity. Despite using room temperature detectors, we demonstrate QKD with record secure bit rates over a range of fiber lengths (e.g., 1.26 Mbit/s over 50 km). Furthermore, our results indicate that operating the detectors at room temperature increases the secure bit rate for short distances.

  15. Influence of Implementation on the Properties of Pseudorandom Number Generators with a Carry Bit

    CERN Document Server

    Vattulainen, I; Saarinen, J J; Ala-Nissilä, T

    1993-01-01

    We present results of extensive statistical and bit level tests on three implementations of a pseudorandom number generator algorithm using the lagged Fibonacci method with an occasional addition of an extra bit. First implementation is the RCARRY generator of James, which uses subtraction. The second is a modified version of it, where a suggested error present in the original implementation has been corrected. The third is our modification of RCARRY such that it utilizes addition of the carry bit. Our results show that there are no significant differences between the performance of these three generators.

  16. Digital PSK to BiO-L demodulator for 2 sup nx(bit rate) carrier

    Science.gov (United States)

    Shull, T. A.

    1979-01-01

    A phase shift key (PSK) to BiO-L demodulator which uses standard digital integrated circuits is discussed. The demodulator produces NRZ-L, bit clock, and BiO-L outputs from digital PSK input signals for which the carrier is a 2 to the Nth multiple of the bit rate. Various bit and carrier rates which are accommodated by changing various component values within the demodulator are described. The use of the unit for sinusoidal inputs as well as digital inputs is discussed.

  17. High-Order Entropy Compressed Bit Vectors with Rank/Select

    Directory of Open Access Journals (Sweden)

    Kai Beskers

    2014-11-01

    Full Text Available We design practical implementations of data structures for compressing bit-vectors to support efficient rank-queries (counting the number of ones up to a given point. Unlike previous approaches, which either store the bit vectors plainly, or focus on compressing bit-vectors with low densities of ones or zeros, we aim at low entropies of higher order, for example 101010...10. Our implementations achieve very good compression ratios, while showing only a modest increase in query time.

  18. An efficient parallel pseudorandom bit generator based on an asymmetric coupled chaotic map lattice

    Indian Academy of Sciences (India)

    Renfu Liang; Xue Tan; Hu Zhou; Shihong Wang

    2015-10-01

    In this paper, an asymmetric coupled map lattice (CML) combining sawtooth map as a local map is presented and its chaotic behaviours are analysed. Based on this asymmetric CML, a pseudorandom bit generator (PRBG) is proposed. The specific parameters of the system that make complicated floating-point computation and multiplication computation transform into simple shift bit operations are adopted, that not only ensures the nonlinear operations, but also increases the performance efficiency. The PRBG is implemented in software and hardware. The parallel output bit sequences pass all of the NIST SP800-22 statistical tests.

  19. Bit Error Rate Performance of a MIMO-CDMA System Employing Parity-Bit-Selected Spreading in Frequency Nonselective Rayleigh Fading

    Directory of Open Access Journals (Sweden)

    Claude D'Amours

    2011-01-01

    Full Text Available We analytically derive the upper bound for the bit error rate (BER performance of a single user multiple input multiple output code division multiple access (MIMO-CDMA system employing parity-bit-selected spreading in slowly varying, flat Rayleigh fading. The analysis is done for spatially uncorrelated links. The analysis presented demonstrates that parity-bit-selected spreading provides an asymptotic gain of 10log(Nt dB over conventional MIMO-CDMA when the receiver has perfect channel estimates. This analytical result concurs with previous works where the (BER is determined by simulation methods and provides insight into why the different techniques provide improvement over conventional MIMO-CDMA systems.

  20. [Scoring--criteria for operability].

    Science.gov (United States)

    Oestern, H J

    1997-01-01

    For therapeutic recommendations three different kinds of scores are essential: 1. The severity scores for trauma; 2. Severity scores for mangled extremities; 3. Intensive care scores. The severity of polytrauma patients is measurable by the AIS, ISS, RTS, PTS and TRISS which is a combination of RTS, ISS, age, and mechanism of injury. For mangled extremities there are also different scores available: MESI (Mangled Extremity Syndrome Index) and MESS (Mangled Extremity Severity Score). The aim of these scores is to assist in the indication with regard to amputate or to save the extremity. These scoring indices can be used to evaluate the severity of a systemic inflammatory reaction syndrome with respect to multiple organ failure. All scores are dynamic values which are variable with improvement of therapy.

  1. Only the good... get pirated: game piracy activity vs. metacritic score

    DEFF Research Database (Denmark)

    Drachen, Anders; Bauer, Kevin; Veitch, Robert W. D.

    2011-01-01

    the substantial interest in game piracy, there is very little objective information available about its magnitude or its distribution across game titles and game genres. This paper presents a large-scale analysis of the illegal distribution of digital game titles, which was conducted by monitoring the Bit...... encompass 5.27 million aggregated unique peers alone. In addition to genre, review scores were found to be positively correlated with the logarithm of the number of unique peers per game (p

  2. Relationship of Apgar Scores and Bayley Mental and Motor Scores

    Science.gov (United States)

    Serunian, Sally A.; Broman, Sarah H.

    1975-01-01

    Examined the relationship of newborns' 1-minute Apgar scores to their 8-month Bayley mental and motor scores and to 8-month classifications of their development as normal, suspect, or abnormal. Also investigated relationships between Apgar scores and race, longevity, and birth weight. (JMB)

  3. Recovery definitions: Do they change?

    Science.gov (United States)

    Kaskutas, Lee Ann; Witbrodt, Jane; Grella, Christine E

    2015-09-01

    The term "recovery" is widely used in the substance abuse literature and clinical settings, but data have not been available to empirically validate how recovery is defined by individuals who are themselves in recovery. The "What Is Recovery?" project developed a 39-item definition of recovery based on a large nationwide online survey of individuals in recovery. The objective of this paper is to report on the stability of those definitions one to two years later. To obtain a sample for studying recovery definitions that reflected the different pathways to recovery, the parent study involved intensive outreach. Follow-up interviews (n=1237) were conducted online and by telephone among respondents who consented to participate in follow-up studies. Descriptive analyses considered endorsement of individual recovery items at both surveys, and t-tests of summary scores studied significant change in the sample overall and among key subgroups. To assess item reliability, Cronbach's alpha was estimated. Rates of endorsement of individual items at both interviews was above 90% for a majority of the recovery elements, and there was about as much transition into endorsement as out of endorsement. Statistically significant t-test scores were of modest magnitude, and reliability statistics were high (ranging from .782 to .899). Longitudinal analyses found little evidence of meaningful change in recovery definitions at follow-up. Results thus suggest that the recovery definitions developed in the parent "What Is Recovery?" survey represent stable definitions of recovery that can be used to guide service provision in Recovery-Oriented Systems of Care. Copyright © 2015 Elsevier Ireland Ltd. All rights reserved.

  4. High bit rate germanium single photon detectors for 1310nm

    Science.gov (United States)

    Seamons, J. A.; Carroll, M. S.

    2008-04-01

    There is increasing interest in development of high speed, low noise and readily fieldable near infrared (NIR) single photon detectors. InGaAs/InP Avalanche photodiodes (APD) operated in Geiger mode (GM) are a leading choice for NIR due to their preeminence in optical networking. After-pulsing is, however, a primary challenge to operating InGaAs/InP single photon detectors at high frequencies1. After-pulsing is the effect of charge being released from traps that trigger false ("dark") counts. To overcome this problem, hold-off times between detection windows are used to allow the traps to discharge to suppress after-pulsing. The hold-off time represents, however, an upper limit on detection frequency that shows degradation beginning at frequencies of ~100 kHz in InGaAs/InP. Alternatively, germanium (Ge) single photon avalanche photodiodes (SPAD) have been reported to have more than an order of magnitude smaller charge trap densities than InGaAs/InP SPADs2, which allowed them to be successfully operated with passive quenching2 (i.e., no gated hold off times necessary), which is not possible with InGaAs/InP SPADs, indicating a much weaker dark count dependence on hold-off time consistent with fewer charge traps. Despite these encouraging results suggesting a possible higher operating frequency limit for Ge SPADs, little has been reported on Ge SPAD performance at high frequencies presumably because previous work with Ge SPADs has been discouraged by a strong demand to work at 1550 nm. NIR SPADs require cooling, which in the case of Ge SPADs dramatically reduces the quantum efficiency of the Ge at 1550 nm. Recently, however, advantages to working at 1310 nm have been suggested which combined with a need to increase quantum bit rates for quantum key distribution (QKD) motivates examination of Ge detectors performance at very high detection rates where InGaAs/InP does not perform as well. Presented in this paper are measurements of a commercially available Ge APD

  5. Klasifikasi Bit-Plane Noise untuk Penyisipan Pesan pada Teknik Steganography BPCS Menggunakan Fuzzy Inference Sistem Mamdani

    Directory of Open Access Journals (Sweden)

    Rahmad Hidayat

    2015-04-01

    Full Text Available Bit-Plane Complexity Segmentation (BPCS is a fairly new steganography technique. The most important process in BPCS is the calculation of complexity value of a bit-plane. The bit-plane complexity is calculated by looking at the amount of bit changes contained in a bit-plane. If a bit-plane has a high complexity, the bi-plane is categorized as a noise bit-plane that does not contain valuable information on the image. Classification of the bit-plane using the set cripst set (noise/not is not fair, where a little difference of the value will significantly change the status of the bit-plane. The purpose of this study is to apply the principles of fuzzy sets to classify the bit-plane into three sets that are informative, partly informative, and the noise region. Classification of the bit-plane into a fuzzy set is expected to classify the bit-plane in a more objective approach and ultimately message capacity of the images can be improved by using the Mamdani fuzzy inference to take decisions which bit-plane will be replaced with a message based on the classification of bit-plane and the size of the message that will be inserted. This research is able to increase the capability of BPCS steganography techniques to insert a message in bit-pane with more precise so that the container image quality would be better. It can be seen that the PSNR value of original image and stego-image is only slightly different.

  6. Semifragile Speech Watermarking Based on Least Significant Bit Replacement of Line Spectral Frequencies

    Directory of Open Access Journals (Sweden)

    Mohammad Ali Nematollahi

    2017-01-01

    Full Text Available There are various techniques for speech watermarking based on modifying the linear prediction coefficients (LPCs; however, the estimated and modified LPCs vary from each other even without attacks. Because line spectral frequency (LSF has less sensitivity to watermarking than LPC, watermark bits are embedded into the maximum number of LSFs by applying the least significant bit replacement (LSBR method. To reduce the differences between estimated and modified LPCs, a checking loop is added to minimize the watermark extraction error. Experimental results show that the proposed semifragile speech watermarking method can provide high imperceptibility and that any manipulation of the watermark signal destroys the watermark bits since manipulation changes it to a random stream of bits.

  7. Field application of a fully rotating point-the-bit rotary steerable system (SPE 67716)

    Energy Technology Data Exchange (ETDEWEB)

    Schaaf, S.; Pafitis, D. [Schlumberger Canada Ltd., Calgary, AB (Canada)

    2001-07-01

    Petroleum offshore operations can encounter downhole sliding problems related to maintaining drilling bit orientation, low effective ROP, poor hole cleaning and the inability of the bit to slide. Other problems include differential sticking, buckling, lock-up, high tortuosity, and build-up rate formation sensitive. Several illustrations were presented indicating ways to correct problems with the bit system through better steerability and orientation of the motors. Specifications and field test examples were presented. One of the test examples involved a land operation in California and another involved a vertical well in a strongly dipping formation. The success of the field tests proved the steering concept of an internally off-set drive-shaft. The point-the-bit rotary steerable system contains no stationary components in contact with the formation. In addition, the tool can be drilled at a tangent to the formation. The tests demonstrated that the system is reliable in experimental design. tabs., figs.

  8. An Experimentally Validated SOA Model for High-Bit Rate System Applications

    Institute of Scientific and Technical Information of China (English)

    Hasan I. Saleheen

    2003-01-01

    A comprehensive model of the Semiconductor Optical Amplifier with experimental validation result is presented. This model accounts for various physical behavior of the device which is necessary for high bit-rate system application.

  9. Improved method of generating bit reversed numbers for calculating fast fourier transform

    Digital Repository Service at National Institute of Oceanography (India)

    Suresh, T.

    Fast Fourier Transform (FFT) is an important tool required for signal processing in defence applications. This paper reports an improved method for generating bit reversed numbers needed in calculating FFT using radix-2. The refined algorithm takes...

  10. Gaussian Relay Channel Capacity to Within a Fixed Number of Bits

    CERN Document Server

    Chang, Woohyuk; Lee, Yong H

    2010-01-01

    In this paper, we show that the capacity of the three-node Gaussian relay channel can be achieved to within 1 and 2 bit/sec/Hz using compress-and-forward and amplify-and-forward relaying, respectively.

  11. Entropy rates of low-significance bits sampled from chaotic physical systems

    Science.gov (United States)

    Corron, Ned J.; Cooper, Roy M.; Blakely, Jonathan N.

    2016-10-01

    We examine the entropy of low-significance bits in analog-to-digital measurements of chaotic dynamical systems. We find the partition of measurement space corresponding to low-significance bits has a corrugated structure. Using simulated measurements of a map and experimental data from a circuit, we identify two consequences of this corrugated partition. First, entropy rates for sequences of low-significance bits more closely approach the metric entropy of the chaotic system, because the corrugated partition better approximates a generating partition. Second, accurate estimation of the entropy rate using low-significance bits requires long block lengths as the corrugated partition introduces more long-term correlation, and using only short block lengths overestimates the entropy rate. This second phenomenon may explain recent reports of experimental systems producing binary sequences that pass statistical tests of randomness at rates that may be significantly beyond the metric entropy rate of the physical source.

  12. A Methodology and Tool for Investigation of Artifacts Left by the BitTorrent Client

    Directory of Open Access Journals (Sweden)

    Algimantas Venčkauskas

    2016-05-01

    Full Text Available The BitTorrent client application is a popular utility for sharing large files over the Internet. Sometimes, this powerful utility is used to commit cybercrimes, like sharing of illegal material or illegal sharing of legal material. In order to help forensics investigators to fight against these cybercrimes, we carried out an investigation of the artifacts left by the BitTorrent client. We proposed a methodology to locate the artifacts that indicate the BitTorrent client activity performed. Additionally, we designed and implemented a tool that searches for the evidence left by the BitTorrent client application in a local computer running Windows. The tool looks for the four files holding the evidence. The files are as follows: *.torrent, dht.dat, resume.dat, and settings.dat. The tool decodes the files, extracts important information for the forensic investigator and converts it into XML format. The results are combined into a single result file.

  13. Quantum key distribution using vacuum-one-photon qubits: maximum number of transferable bits per particle

    CERN Document Server

    Lee, Su-Yong; Lee, Hai-Woong; Lee, Jae-Weon; Bergou, Janos A

    2009-01-01

    Quantum key distribution schemes which employ encoding on vacuum-one-photon qubits are capable of transferring more information bits per particle than the standard schemes employing polarization or phase coding. We calculate the maximum number of classical bits per particle that can be securely transferred when the key distribution is performed with the BB84 and B92 protocols, respectively, using the vacuum-one-photon qubits. In particular, we show that for a generalized B92 protocol with the vacuum-one-photon qubits, a maximum of two bits per particle can be securely transferred. We also demonstrate the advantage brought about by performing a generalized measurement that is optimized for unambiguous discrimination of the encoded states: the parameter range where the transfer of two bits per particle can be achieved is dramatically enhanced as compared to the corresponding parameter range of projective measurements.

  14. Switching field distribution of exchange coupled ferri-/ferromagnetic composite bit patterned media

    CERN Document Server

    Oezelt, Harald; Fischbacher, Johann; Matthes, Patrick; Kirk, Eugenie; Wohlhüter, Phillip; Heyderman, Laura Jane; Albrecht, Manfred; Schrefl, Thomas

    2016-01-01

    We investigate the switching field distribution and the resulting bit error rate of exchange coupled ferri-/ferromagnetic bilayer island arrays by micromagnetic simulations. Using islands with varying microstructure and anisotropic properties, the intrinsic switching field distribution is computed. The dipolar contribution to the switching field distribution is obtained separately by using a model of a hexagonal island array resembling $1.4\\,\\mathrm{Tb/in}^2$ bit patterned media. Both contributions are computed for different thickness of the soft exchange coupled ferrimagnet and also for ferromagnetic single phase FePt islands. A bit patterned media with a bilayer structure of FeGd($5\\,\\mathrm{nm}$)/FePt($5\\,\\mathrm{nm}$) shows a bit error rate of $10^{-4}$ with a write field of $1.2\\,\\mathrm{T}$.

  15. Single-chip pulse programmer for magnetic resonance imaging using a 32-bit microcontroller.

    Science.gov (United States)

    Handa, Shinya; Domalain, Thierry; Kose, Katsumi

    2007-08-01

    A magnetic resonance imaging (MRI) pulse programmer has been developed using a single-chip microcontroller (ADmicroC7026). The microcontroller includes all the components required for the MRI pulse programmer: a 32-bit RISC CPU core, 62 kbytes of flash memory, 8 kbytes of SRAM, two 32-bit timers, four 12-bit DA converters, and 40 bits of general purpose I/O. An evaluation board for the microcontroller was connected to a host personal computer (PC), an MRI transceiver, and a gradient driver using interface circuitry. Target (embedded) and host PC programs were developed to enable MRI pulse sequence generation by the microcontroller. The pulse programmer achieved a (nominal) time resolution of approximately 100 ns and a minimum time delay between successive events of approximately 9 micros. Imaging experiments using the pulse programmer demonstrated the effectiveness of our approach.

  16. Analysis of Button Bit Wear and Performance of Down-The-Hole ...

    African Journals Online (AJOL)

    Michael O. Mensah

    2015-12-02

    Dec 2, 2015 ... revealed that wear of rock drill bit is influenced by rock properties. .... oxide of 0.97%, chromium oxide, iron oxide, ... non-oxidised schist, silicon dioxide was again the ... minerals such as titanium oxide, chromium oxide,.

  17. Credit Scoring Modeling

    Directory of Open Access Journals (Sweden)

    Siana Halim

    2014-01-01

    Full Text Available It is generally easier to predict defaults accurately if a large data set (including defaults is available for estimating the prediction model. This puts not only small banks, which tend to have smaller data sets, at disadvantage. It can also pose a problem for large banks that began to collect their own historical data only recently, or banks that recently introduced a new rating system. We used a Bayesian methodology that enables banks with small data sets to improve their default probability. Another advantage of the Bayesian method is that it provides a natural way for dealing with structural differences between a bank’s internal data and additional, external data. In practice, the true scoring function may differ across the data sets, the small internal data set may contain information that is missing in the larger external data set, or the variables in the two data sets are not exactly the same but related. Bayesian method can handle such kind of problem.

  18. SOLAR TRACKER CERDAS DAN MURAH BERBASIS MIKROKONTROLER 8 BIT ATMega8535

    Directory of Open Access Journals (Sweden)

    I Wayan Sutaya

    2016-08-01

    Full Text Available prototipe produk solar tracker cerdas berbasis mikrokontroler AVR 8 bit. Solar tracker ini memasukkan filter digital IIR (Infinite Impulse Response pada bagian program. Memprogram filter ini membutuhkan perkalian 32 bit sedangkan prosesor yang tersedia pada mikrokontroler yang dipakai adalah 8 bit. Proses perkalian ini hanya bisa dilakukan pada mikrokontroler 8 bit dengan menggunakan bahasa assembly yang merupakan bahasa level hardware. Solar tracker cerdas yang menggunakan mikrokontroler 8 bit sebagai otak utama pada penelitian ini menjadikan produk ini berbiaya rendah. Pengujian yang dilakukan menunjukkan bahwa solar tracker cerdas dibandingkan dengan solar tracker biasa mempunyai perbedaan konsumsi daya baterai yang sangat signifikan yaitu terjadi penghematan sebesar 85 %. Besar penghematan konsumsi daya ini tentunya bukan sebuah angka konstan melainkan tergantung seberapa besar noise yang dikenakan pada alat solar tracker. Untuk sebuah perlakuan yang sama, maka semakin besar noise semakin besar pula perbedaan penghematan konsumsi daya pada solar tracker yang cerdas. Kata-kata kunci: solar tracker, filter digital, mikrokontroler 8 bit, konsumsi daya Abstract This research had made a prototype of smart solar tracker product based on microcontroller AVR 8 bit. The solar tracker used digital filter IIR (Infinite Impulse Response on its software. Filter programming needs 32 bit multiplication but the processor inside of the microcontroller that used in this research is 8 bit. This multiplication is only can be solved on microcontroller 8 bit by using assembly language in programming. The language is a hardware level language. The smart solar tracker using the microcontroller 8 bit as a main brain in this research made the product had a low cost. The test results show that the comparison in saving of baterai power consumption between the smart solar tracker and the normal one is 85 %. The percentage of the saving indubitably is not a constant

  19. HIGH-POWER TURBODRILL AND DRILL BIT FOR DRILLING WITH COILED TUBING

    Energy Technology Data Exchange (ETDEWEB)

    Robert Radtke; David Glowka; Man Mohan Rai; David Conroy; Tim Beaton; Rocky Seale; Joseph Hanna; Smith Neyrfor; Homer Robertson

    2008-03-31

    Commercial introduction of Microhole Technology to the gas and oil drilling industry requires an effective downhole drive mechanism which operates efficiently at relatively high RPM and low bit weight for delivering efficient power to the special high RPM drill bit for ensuring both high penetration rate and long bit life. This project entails developing and testing a more efficient 2-7/8 in. diameter Turbodrill and a novel 4-1/8 in. diameter drill bit for drilling with coiled tubing. The high-power Turbodrill were developed to deliver efficient power, and the more durable drill bit employed high-temperature cutters that can more effectively drill hard and abrasive rock. This project teams Schlumberger Smith Neyrfor and Smith Bits, and NASA AMES Research Center with Technology International, Inc (TII), to deliver a downhole, hydraulically-driven power unit, matched with a custom drill bit designed to drill 4-1/8 in. boreholes with a purpose-built coiled tubing rig. The U.S. Department of Energy National Energy Technology Laboratory has funded Technology International Inc. Houston, Texas to develop a higher power Turbodrill and drill bit for use in drilling with a coiled tubing unit. This project entails developing and testing an effective downhole drive mechanism and a novel drill bit for drilling 'microholes' with coiled tubing. The new higher power Turbodrill is shorter, delivers power more efficiently, operates at relatively high revolutions per minute, and requires low weight on bit. The more durable thermally stable diamond drill bit employs high-temperature TSP (thermally stable) diamond cutters that can more effectively drill hard and abrasive rock. Expectations are that widespread adoption of microhole technology could spawn a wave of 'infill development' drilling of wells spaced between existing wells, which could tap potentially billions of barrels of bypassed oil at shallow depths in mature producing areas. At the same time, microhole

  20. Re-use of Low Bandwidth Equipment for High Bit Rate Transmission Using Signal Slicing Technique

    DEFF Research Database (Denmark)

    Wagner, Christoph; Spolitis, S.; Vegas Olmos, Juan José;

    : Massive fiber-to-the-home network deployment requires never ending equipment upgrades operating at higher bandwidth. We show effective signal slicing method, which can reuse low bandwidth opto-electronical components for optical communications at higher bit rates.......: Massive fiber-to-the-home network deployment requires never ending equipment upgrades operating at higher bandwidth. We show effective signal slicing method, which can reuse low bandwidth opto-electronical components for optical communications at higher bit rates....

  1. Connected Bit Minwise Hashing%连接位Minwise Hash算法的研究

    Institute of Scientific and Technical Information of China (English)

    袁鑫攀; 龙军; 张祖平; 罗跃逸; 张昊; 桂卫华

    2013-01-01

    Minwise Hashing has become a standard technique for estimating the similarity of the collection (e.g. , resemblance) with applications in information retrieval. While traditional Minwise hashing methods store each hashed value using 64 bits, storing only the lowest b bits of each (Minwise) hashed value (e. g. , b=\\ or 2). The 6-bit Minwise hashing algorithm can gain substantial advantages in terms of computational efficiency and storage space. Based on the 6-bit Minwise hashing theory, a connected bit Minwise hashing algorithm is proposed. The unbiased estimator of the resemblance and storage factor of connected bit Minwise hashing are provided theoretically. It could be theoretically proved that the efficiency of similarity estimation is improved by the connected bit Minwise hashing algorithm since the number of comparisons is greatly reduced without significant loss of accuracy. Several key parameters (e. g. , precision, recall and efficiency) are analyzed, and the availability of several estimators for connected bit Minwise hashing is analyzed. Theoretical analysis and experimental results demonstrate the effectiveness of this method.%在信息检索中,Minwise Hash算法用于估计集合的相似度.b位Minwise Hash则通过存储Hash值的b位来估计相似度,从而节省了存储空间和计算时间.基于b位Minwise Hash的理论框架提出了连接位Minwise Hash算法,给出了连接位的相似度无偏估计和存储因子.通过理论证明了连接位Minwisc Hash算法不需要损失很大的精度却可以成倍地减少比对的次数,提升了算法的性能.理论分析和实验验证了此方法的有效性.

  2. Quantifying the Impact of Single Bit Flips on Floating Point Arithmetic

    Energy Technology Data Exchange (ETDEWEB)

    Elliott, James J [ORNL; Mueller, Frank [North Carolina State University; Stoyanov, Miroslav K [ORNL; Webster, Clayton G [ORNL

    2013-08-01

    In high-end computing, the collective surface area, smaller fabrication sizes, and increasing density of components have led to an increase in the number of observed bit flips. If mechanisms are not in place to detect them, such flips produce silent errors, i.e. the code returns a result that deviates from the desired solution by more than the allowed tolerance and the discrepancy cannot be distinguished from the standard numerical error associated with the algorithm. These phenomena are believed to occur more frequently in DRAM, but logic gates, arithmetic units, and other circuits are also susceptible to bit flips. Previous work has focused on algorithmic techniques for detecting and correcting bit flips in specific data structures, however, they suffer from lack of generality and often times cannot be implemented in heterogeneous computing environment. Our work takes a novel approach to this problem. We focus on quantifying the impact of a single bit flip on specific floating-point operations. We analyze the error induced by flipping specific bits in the most widely used IEEE floating-point representation in an architecture-agnostic manner, i.e., without requiring proprietary information such as bit flip rates and the vendor-specific circuit designs. We initially study dot products of vectors and demonstrate that not all bit flips create a large error and, more importantly, expected value of the relative magnitude of the error is very sensitive on the bit pattern of the binary representation of the exponent, which strongly depends on scaling. Our results are derived analytically and then verified experimentally with Monte Carlo sampling of random vectors. Furthermore, we consider the natural resilience properties of solvers based on the fixed point iteration and we demonstrate how the resilience of the Jacobi method for linear equations can be significantly improved by rescaling the associated matrix.

  3. Area-efficient readout with 14-bit SAR-ADC for CMOS image sensors

    Directory of Open Access Journals (Sweden)

    Aziza Sassi Ben

    2016-01-01

    Full Text Available This paper proposes a readout design for CMOS image sensors. It has been squeezed into a 7.5um pitch under a 0.28um 1P3M technology. The ADC performs one 14-bit conversion in only 1.5us and targets a theoretical DNL feature about +1.3/-1 at 14-bit accuracy. Correlated Double Sampling (CDS is performed both in the analog and digital domains to preserve the image quality.

  4. Euclidean Geometry Codes, minimum weight words and decodable error-patterns using bit-flipping

    DEFF Research Database (Denmark)

    Høholdt, Tom; Justesen, Jørn; Jonsson, Bergtor

    2005-01-01

    We determine the number of minimum wigth words in a class of Euclidean Geometry codes and link the performance of the bit-flipping decoding algorithm to the geometry of the error patterns.......We determine the number of minimum wigth words in a class of Euclidean Geometry codes and link the performance of the bit-flipping decoding algorithm to the geometry of the error patterns....

  5. A 1 GHz sample rate, 256-channel, 1-bit quantization, CMOS, digital correlator chip

    Science.gov (United States)

    Timoc, C.; Tran, T.; Wongso, J.

    1992-01-01

    This paper describes the development of a digital correlator chip with the following features: 1 Giga-sample/second; 256 channels; 1-bit quantization; 32-bit counters providing up to 4 seconds integration time at 1 GHz; and very low power dissipation per channel. The improvements in the performance-to-cost ratio of the digital correlator chip are achieved with a combination of systolic architecture, novel pipelined differential logic circuits, and standard 1.0 micron CMOS process.

  6. Developmental Sentence Scoring for Japanese

    Science.gov (United States)

    Miyata, Susanne; MacWhinney, Brian; Otomo, Kiyoshi; Sirai, Hidetosi; Oshima-Takane, Yuriko; Hirakawa, Makiko; Shirai, Yasuhiro; Sugiura, Masatoshi; Itoh, Keiko

    2013-01-01

    This article reports on the development and use of the Developmental Sentence Scoring for Japanese (DSSJ), a new morpho-syntactical measure for Japanese constructed after the model of Lee's English Developmental Sentence Scoring model. Using this measure, the authors calculated DSSJ scores for 84 children divided into six age groups between 2;8…

  7. Do Test Scores Buy Happiness?

    Science.gov (United States)

    McCluskey, Neal

    2017-01-01

    Since at least the enactment of No Child Left Behind in 2002, standardized test scores have served as the primary measures of public school effectiveness. Yet, such scores fail to measure the ultimate goal of education: maximizing happiness. This exploratory analysis assesses nation level associations between test scores and happiness, controlling…

  8. Line Lengths and Starch Scores.

    Science.gov (United States)

    Moriarty, Sandra E.

    1986-01-01

    Investigates readability of different line lengths in advertising body copy, hypothesizing a normal curve with lower scores for shorter and longer lines, and scores above the mean for lines in the middle of the distribution. Finds support for lower scores for short lines and some evidence of two optimum line lengths rather than one. (SKC)

  9. Grouping Synonyms by Definitions

    CERN Document Server

    Falk, Ingrid; Jacquey, Evelyne; Venant, Fabienne

    2009-01-01

    We present a method for grouping the synonyms of a lemma according to its dictionary senses. The senses are defined by a large machine readable dictionary for French, the TLFi (Tr\\'esor de la langue fran\\c{c}aise informatis\\'e) and the synonyms are given by 5 synonym dictionaries (also for French). To evaluate the proposed method, we manually constructed a gold standard where for each (word, definition) pair and given the set of synonyms defined for that word by the 5 synonym dictionaries, 4 lexicographers specified the set of synonyms they judge adequate. While inter-annotator agreement ranges on that task from 67% to at best 88% depending on the annotator pair and on the synonym dictionary being considered, the automatic procedure we propose scores a precision of 67% and a recall of 71%. The proposed method is compared with related work namely, word sense disambiguation, synonym lexicon acquisition and WordNet construction.

  10. Design, Analysis, Implementation and Synthesis of 16 bit Reversible ALU by using Xilinx 12.2

    Directory of Open Access Journals (Sweden)

    S.Anusha

    2014-04-01

    Full Text Available In the modern world, Arithmetic Logic Unit (ALU is one of the most crucial components of any system and is used in many appliances like calculators, cell phones, and computers and so on. An arithmetic logic unit is a multi-functional circuit that conditionally performs one of several possible functions on two operands A and B depending on control inputs. This paper proposes the design of programmable reversible logic gate structures, targeted for the ALU implementation and their use in the realization of an efficient reversible ALU. Reversible or information-lossless circuits have applications in digital signal processing, communication, computer graphics and cryptography. This ALU consists of thirteen operations, 5 arithmetic, 4 logical operations and 4 shifting operations. All the modules are being designed using the basic reversible gates. Using reversible logic gates instead of traditional logic AND/OR gates, a reversible ALU whose function is the same as traditional ALU is constructed. Comparing with the number of input bits and the discarded bits of the traditional ALU, the reversible ALU significantly reduce the use and loss of information bits. The proposed reversible 16-bit ALU reduces the information bits use and loss by reusing the logic information bits logically and realizes the goal of lowering power consumption of logic circuits. Programmable reversible logic gates are realized in Verilog by using XILINX 12.2. Key words:

  11. Design and testing of coring bits on drilling lunar rock simulant

    Science.gov (United States)

    Li, Peng; Jiang, Shengyuan; Tang, Dewei; Xu, Bo; Ma, Chao; Zhang, Hui; Qin, Hongwei; Deng, Zongquan

    2017-02-01

    Coring bits are widely utilized in the sampling of celestial bodies, and their drilling behaviors directly affect the sampling results and drilling security. This paper introduces a lunar regolith coring bit (LRCB), which is a key component of sampling tools for lunar rock breaking during the lunar soil sampling process. We establish the interaction model between the drill bit and rock at a small cutting depth, and the two main influential parameters (forward and outward rake angles) of LRCB on drilling loads are determined. We perform the parameter screening task of LRCB with the aim to minimize the weight on bit (WOB). We verify the drilling load performances of LRCB after optimization, and the higher penetrations per revolution (PPR) are, the larger drilling loads we gained. Besides, we perform lunar soil drilling simulations to estimate the efficiency on chip conveying and sample coring of LRCB. The results of the simulation and test are basically consistent on coring efficiency, and the chip removal efficiency of LRCB is slightly lower than HIT-H bit from simulation. This work proposes a method for the design of coring bits in subsequent extraterrestrial explorations.

  12. Design of replica bit line control circuit to optimize power for SRAM

    Science.gov (United States)

    Pengjun, Wang; Keji, Zhou; Huihong, Zhang; Daohui, Gong

    2016-12-01

    A design of a replica bit line control circuit to optimize power for SRAM is proposed. The proposed design overcomes the limitations of the traditional replica bit line control circuit, which cannot shut off the word line in time. In the novel design, the delay of word line enable and disable paths are balanced. Thus, the word line can be opened and shut off in time. Moreover, the chip select signal is decomposed, which prevents feedback oscillations caused by the replica bit line and the replica word line. As a result, the switch power caused by unnecessary discharging of the bit line is reduced. A 2-kb SRAM is fully custom designed in an SMIC 65-nm CMOS process. The traditional replica bit line control circuit and the new replica bit line control circuit are used in the designed SRAM, and their performances are compared with each other. The experimental results show that at a supply voltage of 1.2 V, the switch power consumption of the memory array can be reduced by 53.7%. Project supported by the Zhejiang Provincial Natural Science Foundation of China (No. LQ14F040001), the National Natural Science Foundation of China (Nos. 61274132, 61234002, 61474068), and the K. C. Wong Magna Fund in Ningbo University.

  13. Influence of pseudorandom bit format on the direct modulation performance of semiconductor lasers

    Indian Academy of Sciences (India)

    Moustafa Ahmed; Safwat W Z Mahmoud; Alaa A Mohmoud

    2012-12-01

    This paper investigates the direct gigabit modulation characteristics of semiconductor lasers using the return to zero (RZ) and non-return to zero (NRZ) formats. The modulation characteristics include the frequency chirp, eye diagram, and turn-on jitter (TOJ). The differences in the relative contributions of the intrinsic noise of the laser and the pseudorandom bit-pattern effect to the modulation characteristics are presented. We introduce an approximate estimation to the transient properties that control the digital modulation performance, namely, the modulation bit rate and the minimum (setting) bit rate required to yield a modulated laser signal free from the bit pattern effect. The results showed that the frequency chirp increases with the increase of the modulation current under both RZ and NRZ formats, and decreases remarkably with the increase of the bias current. The chirp is higher under the RZ modulation format than under the NRZ format. When the modulation bit rate is higher than the setting bit rate of the relaxation oscillation, the laser exhibits enhanced TOJ and the eye diagram is partially closed. TOJ decreases with the increase of the bias and/or modulation current for both formats of modulation.

  14. A Symmetric Chaos-Based Image Cipher with an Improved Bit-Level Permutation Strategy

    Directory of Open Access Journals (Sweden)

    Chong Fu

    2014-02-01

    Full Text Available Very recently, several chaos-based image ciphers using a bit-level permutation have been suggested and shown promising results. Due to the diffusion effect introduced in the permutation stage, the workload of the time-consuming diffusion stage is reduced, and hence the performance of the cryptosystem is improved. In this paper, a symmetric chaos-based image cipher with a 3D cat map-based spatial bit-level permutation strategy is proposed. Compared with those recently proposed bit-level permutation methods, the diffusion effect of the new method is superior as the bits are shuffled among different bit-planes rather than within the same bit-plane. Moreover, the diffusion key stream extracted from hyperchaotic system is related to both the secret key and the plain image, which enhances the security against known/chosen plaintext attack. Extensive security analysis has been performed on the proposed scheme, including the most important ones like key space analysis, key sensitivity analysis, plaintext sensitivity analysis and various statistical analyses, which has demonstrated the satisfactory security of the proposed scheme

  15. Micromagnetic analysis of current-driven domain wall motion of multi-bit in a nanowire with perpendicular magnetic anisotropy

    Energy Technology Data Exchange (ETDEWEB)

    Murakami, Hiroshi; Takahashi, Kouta; Komine, Takashi; Sugita, Ryuji, E-mail: komine@mx.ibaraki.ac.j [4-12-1 Nakanarusawa, Hitachi, Ibaraki 316-8511, Ibaraki University (Japan)

    2010-01-01

    The current-driven domain wall motion of a multi-bit in a magnetic nanowire with perpendicular magnetic anisotropy has been analyzed by performing a micromagnetic simulation. The multi-bit motion is determined by the applied current density and the non-adiabatic spin torque parameters, which is similar to the current-driven domain wall motion of the single wall. Consequently, it was found that are two modes in the multi-bit motion: (a) the bit length remains constant and (b) the bit length varies or the bit vanishes in the nanowire. It was found that these modes of the multi-bit motion can be classified by the critical current density or Walker breakdown for the single wall motion in a magnetic nanowire with perpendicular magnetic anisotropy.

  16. Influence of partially coherent beam passing through strong turbulence on bit error rate of laser communication systems%部分相干光通过强湍流对通信系统误码率的影响

    Institute of Scientific and Technical Information of China (English)

    王江安; 赵英俊; 吴荣华; 任席闯

    2009-01-01

    A theoretical base for using the technology of multibeam transmission and the reception in the ship laser communication systems was provided by the research on the influence of partially coherent beams passing through the strong turbulence on the bit error rate. The relation between system bit error rate and transmission range was obtained under the conditions of different turbulence measurement, transmission laser wavelength and light source coherence parameter by the aid of a method to parse the equation of laser transmission in atmospheric turbulence field, ignoring other noises in the system, but considering the bit error rate caused by atmospheric turbulence only. The result indicates that under the strong turbulence condition, the system bit error rate is increased gradually with the increase of the transmission range when the quantity of transmitting antennas reaches a certain number, but the system bit error rate tends to saturation when the transmission range accretion reaches a definite degree; the bigger the light source coherence parameter increases, the lower the system bit error rate becomes; the more the turbulence inner scale is, the higher the system bit error rate becomes; and the variation of the transmission laser wavelength has no obvious influence on the system bit error rate.%为研究部分相干光通过强湍流对系统误码率的影响,借助对激光在大气湍流场中的传输方程进行解析求解(忽略系统中其他噪声,仅考虑由大气湍流引起的系统误码率),得到不同湍流内尺度、传输激光波长和光源相干参数条件下,系统误码率和传输距离的关系.结果表明:在强湍流条件下,当发射天线数目达到一定时,随着传输距离的增加,系统误码率逐渐增大,但增大到一定程度后趋于饱和;光源相干参数越大,系统误码率越低;湍流内尺度越大,系统误码率越高;传输激光波长的变化对系统误码率无明显影响.

  17. [Propensity score matching in SPSS].

    Science.gov (United States)

    Huang, Fuqiang; DU, Chunlin; Sun, Menghui; Ning, Bing; Luo, Ying; An, Shengli

    2015-11-01

    To realize propensity score matching in PS Matching module of SPSS and interpret the analysis results. The R software and plug-in that could link with the corresponding versions of SPSS and propensity score matching package were installed. A PS matching module was added in the SPSS interface, and its use was demonstrated with test data. Score estimation and nearest neighbor matching was achieved with the PS matching module, and the results of qualitative and quantitative statistical description and evaluation were presented in the form of a graph matching. Propensity score matching can be accomplished conveniently using SPSS software.

  18. Confidence scores for prediction models

    DEFF Research Database (Denmark)

    Gerds, Thomas Alexander; van de Wiel, MA

    2011-01-01

    modelling strategy is applied to different training sets. For each modelling strategy we estimate a confidence score based on the same repeated bootstraps. A new decomposition of the expected Brier score is obtained, as well as the estimates of population average confidence scores. The latter can be used...... to distinguish rival prediction models with similar prediction performances. Furthermore, on the subject level a confidence score may provide useful supplementary information for new patients who want to base a medical decision on predicted risk. The ideas are illustrated and discussed using data from cancer...

  19. Experimental demonstration of arbitrary waveform generation by a 4-bit photonic digital-to-analog converter

    Science.gov (United States)

    Gao, Bindong; Zhang, Fangzheng; Pan, Shilong

    2017-01-01

    Arbitrary waveform generation by a serial photonic digital-to-analog converter (PDAC) is demonstrated in this paper. To construct the PDAC, an intensity weighted, time and wavelength interleaved optical pulse train is first generated by phase modulation and fiber dispersion. Then, on-off keying modulation of the optical pulses is implemented according to the input serial digital bits. After proper dispersion compensation, a combined optical pulse is obtained with its total power proportional to the weighted sum of the input digital bits, and digital-to-analog conversion is achieved after optical-to-electronic conversion. By properly designing the input bits and using a low pass filter for signal smoothing, arbitrary waveforms can be generated. Performance of the PDAC is experimentally investigated by establishing a 2.5 GSa/s 4-bit PDAC. The established PDAC is found to have a good linear transfer function and the effective number of bits (ENOB) reaches as high as 3.49. Based on the constructed PDAC, generation of multiple waveforms including triangular, parabolic, square and sawtooth pulses are implemented with the generated waveforms very close to the ideal waveforms.

  20. Enhanced intercarrier interference mitigation based on encoded bit-sequence distribution inside optical superchannels

    Science.gov (United States)

    Torres, Jhon James Granada; Soto, Ana María Cárdenas; González, Neil Guerrero

    2016-10-01

    In the context of gridless optical multicarrier systems, we propose a method for intercarrier interference (ICI) mitigation which allows bit error correction in scenarios of nonspectral flatness between the subcarriers composing the multicarrier system and sub-Nyquist carrier spacing. We propose a hybrid ICI mitigation technique which exploits the advantages of signal equalization at both levels: the physical level for any digital and analog pulse shaping, and the bit-data level and its ability to incorporate advanced correcting codes. The concatenation of these two complementary techniques consists of a nondata-aided equalizer applied to each optical subcarrier, and a hard-decision forward error correction applied to the sequence of bits distributed along the optical subcarriers regardless of prior subchannel quality assessment as performed in orthogonal frequency-division multiplexing modulations for the implementation of the bit-loading technique. The impact of the ICI is systematically evaluated in terms of bit-error-rate as a function of the carrier frequency spacing and the roll-off factor of the digital pulse-shaping filter for a simulated 3×32-Gbaud single-polarization quadrature phase shift keying Nyquist-wavelength division multiplexing system. After the ICI mitigation, a back-to-back error-free decoding was obtained for sub-Nyquist carrier spacings of 28.5 and 30 GHz and roll-off values of 0.1 and 0.4, respectively.

  1. Achieving high bit rate logical stochastic resonance in a bistable system by adjusting parameters

    Science.gov (United States)

    Yang, Ding-Xin; Gu, Feng-Shou; Feng, Guo-Jin; Yang, Yong-Min; Ball, Andrew

    2015-11-01

    The phenomenon of logical stochastic resonance (LSR) in a nonlinear bistable system is demonstrated by numerical simulations and experiments. However, the bit rates of the logical signals are relatively low and not suitable for practical applications. First, we examine the responses of the bistable system with fixed parameters to different bit rate logic input signals, showing that an arbitrary high bit rate LSR in a bistable system cannot be achieved. Then, a normalized transform of the LSR bistable system is introduced through a kind of variable substitution. Based on the transform, it is found that LSR for arbitrary high bit rate logic signals in a bistable system can be achieved by adjusting the parameters of the system, setting bias value and amplifying the amplitudes of logic input signals and noise properly. Finally, the desired OR and AND logic outputs to high bit rate logic inputs in a bistable system are obtained by numerical simulations. The study might provide higher feasibility of LSR in practical engineering applications. Project supported by the National Natural Science Foundation of China (Grant No. 51379526).

  2. Achieving high bit rate logical stochastic resonance in a bistable system by adjusting parameters

    Institute of Scientific and Technical Information of China (English)

    杨定新; 谷丰收; 冯国金; 杨拥民

    2015-01-01

    The phenomenon of logical stochastic resonance (LSR) in a nonlinear bistable system is demonstrated by numerical simulations and experiments. However, the bit rates of the logical signals are relatively low and not suitable for practical applications. First, we examine the responses of the bistable system with fixed parameters to different bit rate logic input signals, showing that an arbitrary high bit rate LSR in a bistable system cannot be achieved. Then, a normalized transform of the LSR bistable system is introduced through a kind of variable substitution. Based on the transform, it is found that LSR for arbitrary high bit rate logic signals in a bistable system can be achieved by adjusting the parameters of the system, setting bias value and amplifying the amplitudes of logic input signals and noise properly. Finally, the desired OR and AND logic outputs to high bit rate logic inputs in a bistable system are obtained by numerical simulations. The study might provide higher feasibility of LSR in practical engineering applications.

  3. Bounds on Minimum Energy per Bit for Optical Wireless Relay Channels

    Directory of Open Access Journals (Sweden)

    A. D. Raza

    2014-09-01

    Full Text Available An optical wireless relay channel (OWRC is the classical three node network consisting of source, re- lay and destination nodes with optical wireless connectivity. The channel law is assumed Gaussian. This paper studies the bounds on minimum energy per bit required for reliable communication over an OWRC. It is shown that capacity of an OWRC is concave and energy per bit is monotonically increasing in square of the peak optical signal power, and consequently the minimum energy per bit is inversely pro- portional to the square root of asymptotic capacity at low signal to noise ratio. This has been used to develop upper and lower bound on energy per bit as a function of peak signal power, mean to peak power ratio, and variance of channel noise. The upper and lower bounds on minimum energy per bit derived in this paper correspond respectively to the decode and forward lower bound and the min-max cut upper bound on OWRC capacity

  4. Four-Dimensional Coded Modulation with Bit-wise Decoders for Future Optical Communications

    CERN Document Server

    Alvarado, Alex

    2014-01-01

    Coded modulation (CM) is the combination of forward error correction (FEC) and multilevel constellations. Coherent optical communication systems result in a four-dimensional (4D) signal space, which naturally leads to 4D-CM transceivers. A practically attractive design paradigm is to use a bit-wise decoder, where the detection process is (suboptimally) separated into two steps: soft-decision demapping followed by binary decoding. In this paper, bit-wise decoders are studied from an information-theoretic viewpoint. 4D constellations with up to 4096 constellation points are considered. Metrics to predict the post-FEC bit-error rate (BER) of bit-wise decoders are analyzed. The mutual information is shown to fail at predicting the post-FEC BER of bit-wise decoders and the so-called generalized mutual information is shown to be a much more robust metric. It is also shown that constellations that transmit and receive information in each polarization and quadrature independently (e.g., PM-QPSK, PM-16QAM, and PM-64QA...

  5. Rate distortion optimal bit allocation methods for volumetric data using JPEG 2000.

    Science.gov (United States)

    Kosheleva, Olga M; Usevitch, Bryan E; Cabrera, Sergio D; Vidal, Edward

    2006-08-01

    Computer modeling programs that generate three-dimensional (3-D) data on fine grids are capable of generating very large amounts of information. These data sets, as well as 3-D sensor/measured data sets, are prime candidates for the application of data compression algorithms. A very flexible and powerful compression algorithm for imagery data is the newly released JPEG 2000 standard. JPEG 2000 also has the capability to compress volumetric data, as described in Part 2 of the standard, by treating the 3-D data as separate slices. As a decoder standard, JPEG 2000 does not describe any specific method to allocate bits among the separate slices. This paper proposes two new bit allocation algorithms for accomplishing this task. The first procedure is rate distortion optimal (for mean squared error), and is conceptually similar to postcompression rate distortion optimization used for coding codeblocks within JPEG 2000. The disadvantage of this approach is its high computational complexity. The second bit allocation algorithm, here called the mixed model (MM) approach, mathematically models each slice's rate distortion curve using two distinct regions to get more accurate modeling at low bit rates. These two bit allocation algorithms are applied to a 3-D Meteorological data set. Test results show that the MM approach gives distortion results that are nearly identical to the optimal approach, while significantly reducing computational complexity.

  6. Optimization on BitTorrent Protocol for Video Application%面向视频应用的BitTorrent协议优化

    Institute of Scientific and Technical Information of China (English)

    李敏宁; 鱼滨; 杨力

    2015-01-01

    BitTorrent protocol is a file sharing protocol based on P2P (Peer to Peer),with"the more users the download faster" feature. It reflects the superiority of the system especially for large files. In recent years,video media streams are a class file that the most amounts of Internet users occupied. With the further increase of consumer bandwidth,more and more people want to get the multimedia applica-tions such as video on demand. The traditional C/S architecture,when a sharp increase is conducted in the number of users,prone to over-load the server,using the server cluster or distributed system to cause the cost increases. BitTorrent can better reduce server load and im-prove the scalability and robustness of the system. But BitTorrent is designed for ordinary share large files,selecting the file fragments are disorder conduction,and cannot effectively support on-demand and live video for large files. In this paper,for video-on-demand needs of large files,fragment selection algorithm is optimized of BitTorrent protocol,realizing on-demand and live of video files.%BitTorrent协议是一种基于P2P(Peer to Peer)的文件共享协议,具有"用户越多,下载速度越快"的特点,尤其是针对大文件的下载,更能体现出系统的优越性.视频媒体流是近年来网络用户占有量最多的一类文件,随着消费者带宽的进一步增加,越来越多的人希望得到像视频点播这样的多媒体应用.传统的C/S架构在当用户数目急剧增加时,容易产生服务器过载现象,使用服务器集群或分布式系统成本增大.BitTorrent能够较好地降低服务器负担,提高系统的扩展性和健壮性.但是BitTorrent针对普通大文件的共享设计,对文件的片段选择是无序进行的,不能有效地支持视频大文件的点播和直播.文中针对视频大文件的点播需求,对BitTorrent协议的片段选择算法进行优化,实现了视频文件的点播和直播.

  7. 77 FR 47707 - Public Housing Assessment System (PHAS): Physical Condition Scoring Notice and Revised Dictionary...

    Science.gov (United States)

    2012-08-09

    ...): Physical Condition Scoring Notice and Revised Dictionary of Deficiency Definitions; Notice #0;#0;Federal... DEVELOPMENT Public Housing Assessment System (PHAS): Physical Condition Scoring Notice and Revised Dictionary... February 23, 2011. In addition, this notice makes changes to the Dictionary of Deficiency...

  8. A radiation tolerant 32-bit digital signal processor (DSP); Un processeur de traitement du signal 32 bits (DSP) tolerant aux radiations

    Energy Technology Data Exchange (ETDEWEB)

    Ramaswamy, S.; Alcom, C.; Haddad, N.; Lawson, D.; Page, T.; Scandalis, G.; Scott, T. [Lockheed Martin Federal Systems, Manassas, VA (United States); Robinson, P.; Bain, D. [Innovative Systems and Technologies Corp., Tampa, FL (United States)

    1999-07-01

    This paper describes the development of a radiation tolerant version of the Analog Devices Incorporated (ADI) ADSP-21020 (RH21020), a programmable 32/40-bit floating point DSP. Implementation of layout transfer and successful fabrication of RH21020 in a Qualified Manufacturers List (QML) radiation hardened process are discussed. Results of electrical and radiation characterization of the RH21020 are reported in this paper. (authors)

  9. Modelling sequentially scored item responses

    NARCIS (Netherlands)

    Akkermans, W.

    2000-01-01

    The sequential model can be used to describe the variable resulting from a sequential scoring process. In this paper two more item response models are investigated with respect to their suitability for sequential scoring: the partial credit model and the graded response model. The investigation is c

  10. Classification of current scoring functions.

    Science.gov (United States)

    Liu, Jie; Wang, Renxiao

    2015-03-23

    Scoring functions are a class of computational methods widely applied in structure-based drug design for evaluating protein-ligand interactions. Dozens of scoring functions have been published since the early 1990s. In literature, scoring functions are typically classified as force-field-based, empirical, and knowledge-based. This classification scheme has been quoted for more than a decade and is still repeatedly quoted by some recent publications. Unfortunately, it does not reflect the recent progress in this field. Besides, the naming convention used for describing different types of scoring functions has been somewhat jumbled in literature, which could be confusing for newcomers to this field. Here, we express our viewpoint on an up-to-date classification scheme and appropriate naming convention for current scoring functions. We propose that they can be classified into physics-based methods, empirical scoring functions, knowledge-based potentials, and descriptor-based scoring functions. We also outline the major difference and connections between different categories of scoring functions.

  11. The Machine Scoring of Writing

    Science.gov (United States)

    McCurry, Doug

    2010-01-01

    This article provides an introduction to the kind of computer software that is used to score student writing in some high stakes testing programs, and that is being promoted as a teaching and learning tool to schools. It sketches the state of play with machines for the scoring of writing, and describes how these machines work and what they do.…

  12. Skyrocketing Scores: An Urban Legend

    Science.gov (United States)

    Krashen, Stephen

    2005-01-01

    A new urban legend claims, "As a result of the state dropping bilingual education, test scores in California skyrocketed." Krashen disputes this theory, pointing out that other factors offer more logical explanations of California's recent improvements in SAT-9 scores. He discusses research on the effects of California's Proposition 227,…

  13. Quadratic prediction of factor scores

    NARCIS (Netherlands)

    Wansbeek, T

    1999-01-01

    Factor scores are naturally predicted by means of their conditional expectation given the indicators y. Under normality this expectation is linear in y but in general it is an unknown function of y. II is discussed that under nonnormality factor scores can be more precisely predicted by a quadratic

  14. Trends in Classroom Observation Scores

    Science.gov (United States)

    Casabianca, Jodi M.; Lockwood, J. R.; McCaffrey, Daniel F.

    2015-01-01

    Observations and ratings of classroom teaching and interactions collected over time are susceptible to trends in both the quality of instruction and rater behavior. These trends have potential implications for inferences about teaching and for study design. We use scores on the Classroom Assessment Scoring System-Secondary (CLASS-S) protocol from…

  15. D-score: a search engine independent MD-score.

    Science.gov (United States)

    Vaudel, Marc; Breiter, Daniela; Beck, Florian; Rahnenführer, Jörg; Martens, Lennart; Zahedi, René P

    2013-03-01

    While peptides carrying PTMs are routinely identified in gel-free MS, the localization of the PTMs onto the peptide sequences remains challenging. Search engine scores of secondary peptide matches have been used in different approaches in order to infer the quality of site inference, by penalizing the localization whenever the search engine similarly scored two candidate peptides with different site assignments. In the present work, we show how the estimation of posterior error probabilities for peptide candidates allows the estimation of a PTM score called the D-score, for multiple search engine studies. We demonstrate the applicability of this score to three popular search engines: Mascot, OMSSA, and X!Tandem, and evaluate its performance using an already published high resolution data set of synthetic phosphopeptides. For those peptides with phosphorylation site inference uncertainty, the number of spectrum matches with correctly localized phosphorylation increased by up to 25.7% when compared to using Mascot alone, although the actual increase depended on the fragmentation method used. Since this method relies only on search engine scores, it can be readily applied to the scoring of the localization of virtually any modification at no additional experimental or in silico cost.

  16. 39 fJ/bit On-Chip Identification ofWireless Sensors Based on Manufacturing Variation

    Directory of Open Access Journals (Sweden)

    Jonathan F. Bolus

    2014-09-01

    Full Text Available A 39 fJ/bit IC identification system based on FET mismatch is presented and implemented in a 130 nm CMOS process. ID bits are generated based on the ΔVT between identically drawn NMOS devices due to manufacturing variation, and the ID cell structure allows for the characterization of ID bit reliability by characterizing ΔVT . An addressing scheme is also presented that allows for reliable on-chip identification of ICs in the presence of unreliable ID bits. An example implementation is presented that can address 1000 unique ICs, composed of 31 ID bits and having an error rate less than 10-6, with up to 21 unreliable bits.

  17. A Bit Stream Scalable Speech/Audio Coder Combining Enhanced Regular Pulse Excitation and Parametric Coding

    Directory of Open Access Journals (Sweden)

    Albertus C. den Brinker

    2007-01-01

    Full Text Available This paper introduces a new audio and speech broadband coding technique based on the combination of a pulse excitation coder and a standardized parametric coder, namely, MPEG-4 high-quality parametric coder. After presenting a series of enhancements to regular pulse excitation (RPE to make it suitable for the modeling of broadband signals, it is shown how pulse and parametric codings complement each other and how they can be merged to yield a layered bit stream scalable coder able to operate at different points in the quality bit rate plane. The performance of the proposed coder is evaluated in a listening test. The major result is that the extra functionality of the bit stream scalability does not come at the price of a reduced performance since the coder is competitive with standardized coders (MP3, AAC, SSC.

  18. Efficient bit sifting scheme of post-processing in quantum key distribution

    Science.gov (United States)

    Li, Qiong; Le, Dan; Wu, Xianyan; Niu, Xiamu; Guo, Hong

    2015-10-01

    Bit sifting is an important step in the post-processing of quantum key distribution (QKD). Its function is to sift out the undetected original keys. The communication traffic of bit sifting has essential impact on the net secure key rate of a practical QKD system. In this paper, an efficient bit sifting scheme is presented, of which the core is a lossless source coding algorithm. Both theoretical analysis and experimental results demonstrate that the performance of the scheme is approaching the Shannon limit. The proposed scheme can greatly decrease the communication traffic of the post-processing of a QKD system, which means the proposed scheme can decrease the secure key consumption for classical channel authentication and increase the net secure key rate of the QKD system, as demonstrated by analyzing the improvement on the net secure key rate. Meanwhile, some recommendations on the application of the proposed scheme to some representative practical QKD systems are also provided.

  19. A novel symmetrical split-gate structure for 2-bit per cell flash memory

    Science.gov (United States)

    Liang, Fang; Weiran, Kong; Jing, Gu; Bo, Zhang; Shichang, Zou

    2014-07-01

    A fully self-aligned symmetrical split-gate cell structure for 2-bit per cell flash memory with a very competitive bit size is presented. One common select gate is located between two floating gates and a pair of source/drain junctions are shared by the 2 bits. The fabrication method utilized here to create a self-aligned structure is to form a spacer against the prior layer without any additional mask. Although the cell consists of three channels in a series, the attributes from conventional split gate flash are still preserved with appropriate bias conditions. Program and erase operation is performed by using a source side injection (SSI) and a poly-to-poly tunneling mechanism respectively.

  20. Encoding M classical bits in the arrival time of dense-coded photons

    CERN Document Server

    Hegazy, Salem F; Obayya, Salah S A

    2016-01-01

    We present a scheme to encode M extra classical bits to a dense-coded pair of photons. By tuning the delay of an entangled pair of photons to one of 2^M time-bins and then applying one of the quantum dense coding protocols, a receiver equipped with a synchronized clock of reference is able to decode M bits (via classical time-bin encoding) + 2 bits (via quantum dense coding). This protocol, yet simple, does not dispense several special features of the used programmable delay apparatus to maintain the coherence of the two-photon state. While this type of time-domain encoding may be thought to be ideally of boundless photonic capacity (by increasing the number of available time-bins), errors due to the environmental noise and the imperfect devices and channel evolve with the number of time-bins.

  1. An Improved Frame-Layer Bit Allocation Scheme for H.264/AVC Rate Control

    Institute of Scientific and Technical Information of China (English)

    LIN Gui-xu; ZHENG Shi-bao; ZHU Liang-jia

    2009-01-01

    In this paper, we aim at improving the video quality degradation due to high motions or scene changes. An improved frame-layer bit allocation scheme for H.264/AVC rate control is proposed. First, current frame is pre-encoded in 16×16 modes with a fixed quantization parameter (QP). The frame coding complexity is then measured based on the resulting bits and peak signal-to-ratio (PSNR) in the pre-coding stage. Finally, a bit budgetis calculated for current frame according to its coding complexity and inter-frame PSNR fluctuation, combined with the buffer status. Simulation results show that, in comparison with the H.264 adopted rate control scheme, our method is more efficient to suppress the sharp PSNR drops caused by high motions and scene changes. The visual quality variations in a sequence are also relieved.

  2. An Efficient Method for Image and Audio Steganography using Least Significant Bit (LSB) Substitution

    Science.gov (United States)

    Chadha, Ankit; Satam, Neha; Sood, Rakshak; Bade, Dattatray

    2013-09-01

    In order to improve the data hiding in all types of multimedia data formats such as image and audio and to make hidden message imperceptible, a novel method for steganography is introduced in this paper. It is based on Least Significant Bit (LSB) manipulation and inclusion of redundant noise as secret key in the message. This method is applied to data hiding in images. For data hiding in audio, Discrete Cosine Transform (DCT) and Discrete Wavelet Transform (DWT) both are used. All the results displayed prove to be time-efficient and effective. Also the algorithm is tested for various numbers of bits. For those values of bits, Mean Square Error (MSE) and Peak-Signal-to-Noise-Ratio (PSNR) are calculated and plotted. Experimental results show that the stego-image is visually indistinguishable from the original cover-image when nsteganography process does not reveal presence of any hidden message, thus qualifying the criteria of imperceptible message.

  3. All-optical repetition rate multiplication of pseudorandom bit sequences based on cascaded TOADs

    Science.gov (United States)

    Sun, Zhenchao; Wang, Zhi; Wu, Chongqing; Wang, Fu; Li, Qiang

    2016-03-01

    A scheme for all-optical repetition rate multiplication of pseudorandom bit sequences (PRBS) is demonstrated with all-optical wavelength conversion and optical logic gate 'OR' based on cascaded Tera-Hertz Optical Asymmetric Demultiplexers (TOADs). Its feasibility is verified by multiplication experiments from 500 Mb/s to 4 Gb/s for 23-1 PRBS and from 1 Gb/s to 4 Gb/s for 27-1 PRBS. This scheme can be employed for rate multiplication for much longer cycle PRBS at much higher bit rate over 40 Gb/s when the time-delay, the loss and the dispersion of the optical delay line are all precisely managed. The upper limit of bit rate will be restricted by the recovery time of semiconductor optical amplifier (SOA) finally.

  4. Digital post-calibration of a 5-bit 1.25 GS/s flash ADC

    Institute of Scientific and Technical Information of China (English)

    杨阳; 赵显利; 仲顺安; 李国峰

    2012-01-01

    We report a high-speed flash analog to digital converter (ADC) linearization technique employing the inverse Volterra model and digital post processing.First,a 1.25 GS/s 5-bit flash ADC is designed using a 0.18μm CMOS,and the signal is quantized by a distributed track-and-hold circuit.Second,based on the Volterra series,a proposed digital post-calibration model is introduced.Then,the model is applied to estimate and compensate the nonlinearity of the high-speed flash ADC.Simulation results indicate that the distortion is reduced effectively.Specifically,the ADC achieves gains of 4.83 effective bits for a 117.1 MHz frequency input and 4.74 effective bits for a Nyquist input at 1.25 GS/s.

  5. Is Content Publishing in BitTorrent Altruistic or Profit-Driven

    CERN Document Server

    Cuevas, Ruben; Cuevas, Angel; Kaune, Sebastian; Guerrero, Carmen; Rejaie, Reza

    2010-01-01

    BitTorrent is the most popular P2P content delivery application where individual users share various type of content with tens of thousands of other users. The growing popularity of BitTorrent is primarily due to the availability of valuable content without any cost for the consumers. However, apart from required resources, publishing (sharing) valuable (and often copyrighted) content has serious legal implications for user who publish the material (or publishers). This raises a question that whether (at least major) content publishers behave in an altruistic fashion or have other incentives such as financial. In this study, we identify the content publishers of more than 55k torrents in 2 major BitTorrent portals and examine their behavior. We demonstrate that a small fraction of publishers are responsible for 66% of published content and 75% of the downloads. Our investigations reveal that these major publishers respond to two different profiles. On one hand, antipiracy agencies and malicious publishers pub...

  6. Quantum gravity as a theory of quantized area bits fitting together

    CERN Document Server

    Sharatchandra, H S

    2000-01-01

    Non-Abelian Gauss law is interpreted in terms of area bits described in a local frame which fit together into closed surfaces and the Non-Abelian Stokes law in terms of length bits described in a local frame which fit together into closed loops. A new equation relating the area variables and the phase space variables (or equivalently, angular momentum variables of the lattice Yang-Mills theory and phase space variables of the continuum theory) is obtained. Canonical quantization applied to these variables implies area quantization. A complete orthonormal basis of states satisfying the Gauss constraint is obtained.It has the interpretation of quantized area bits with undefined orientations and edges but fitting together into closed surfaces.

  7. Robust Face Recognition using Voting by Bit-plane Images based on Sparse Representation

    Directory of Open Access Journals (Sweden)

    Dongmei Wei

    2015-08-01

    Full Text Available Plurality voting is widely employed as combination strategies in pattern recognition. As a technology proposed recently, sparse representation based classification codes the query image as a sparse linear combination of entire training images and classifies the query sample class by class exploiting the class representation error. In this paper, an improvement face recognition approach using sparse representation and plurality voting based on the binary bit-plane images is proposed. After being equalized, gray images are decomposed into eight bit-plane images, sparse representation based classification is exploited respectively on the five bit-plane images that have more discrimination information. Finally, the true identity of query image is voted by these five identities obtained. Experiment results shown that this proposed approach is preferable both in recognition accuracy and in recognition speed.

  8. Apparatus for measuring weight, torque and side force on a drill bit

    Energy Technology Data Exchange (ETDEWEB)

    Maron, R.

    1989-04-18

    This patent describes an apparatus for measuring at least one load applied to a drill bit during the drilling of a well, including: drill string sub means adapted to be connected in a drill string above the drill bit; hole means for defining a pair of diametrically opposite through-hole means in the wall of the sub; plug means in each of the hole means, the plug means cooperating with the through hole means to define an atmospheric chamber means in each of the through hole means; ring means in the centerbore of the drillstring sub; fastener means for connecting the plug means to the annular ring means; weight sensor means in each of the through hole means for generating an output in response to at least the parameter of weight on the drill bit.

  9. Ternary and Multi-Bit FIR Filter Area-Performance Tradeoffs in FPGA

    Directory of Open Access Journals (Sweden)

    Khalil-Ur-Rahman Dayo

    2013-01-01

    Full Text Available In this paper, performance and area of conventional FIR (Finite Impulse Responce filters versus ternary sigma delta modulated FIR filter is compared in FPGA (Field Programmable Gate Arrays using VHDL (Verilog Description Language. Two different approaches were designed and synthesized at same spectral performance by obtaining a TIR (Target Impulse Response. Both filters were synthesized on adaptive LUT (Look Up Table FPGA device in pipelined and non-pipelined modes. It is shown that the Ternary FIR filter occupies approximately the same area as the corresponding multi-bit filter, but for a given specification, the ternary FIR filter has 32% better performance in non-pipelined and 72% in pipelined mode, compared to its equivalent Multi-Bit filter at its optimum 12-bit coefficient quantization. These promising results shows that ternary logic based (i.e. +1,0,-1 filters can be used for huge chip area savings and higher performance.

  10. CRC Look-up Table Optimization for Single-Bit Error Correction

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    Many communication systems use the cyclic redundancy code (CRC) technique for protecting key data fields from transmission errors by enabling both single-bit error correction and multi-bit error detection. The look-up table design is very important for the error-correction implementation. This paper presents a CRC look-up table optimization method for single-bit error correction. The optimization method minimizes the address length of the pre-designed look-up table while satisfying certain restrictions. The circuit implementation is also presented to show the feasibility of the method in the application specific integrated circuit design. An application of the optimization method in the generic framing procedure protocol is implemented using field programmable gate arrays. The result shows that the memory address length has been minimized, while keeping a very simple circuit implementation.

  11. FlavBit: A GAMBIT module for computing flavour observables and likelihoods arXiv

    CERN Document Server

    Bernlochner, Florian U.; Dal, Lars A.; Farmer, Ben; Jackson, Paul; Kvellestad, Anders; Mahmoudi, Farvah; Putze, Antje; Rogan, Christopher; Scott, Pat; Serra, Nicola; Weniger, Christoph; White, Martin

    Flavour physics observables are excellent probes of new physics up to very high energy scales. Here we present FlavBit, the dedicated flavour physics module of the global-fitting package GAMBIT. FlavBit includes custom implementations of various likelihood routines for a wide range of flavour observables, including detailed uncertainties and correlations associated with LHCb measurements of rare, leptonic and semileptonic decays of B and D mesons, kaons and pions. It provides a generalised interface to external theory codes such as SuperIso, allowing users to calculate flavour observables in and beyond the Standard Model, and then test them in detail against all relevant experimental data. We describe FlavBit and its constituent physics in some detail, then give examples from supersymmetry and effective field theory illustrating how it can be used both as a standalone library for flavour physics, and within GAMBIT.

  12. A Novel Generic Session Based Bit Level Encryption Technique to Enhance Information Security

    CERN Document Server

    Paul, Manas; Pal, Suvajit; Saha, Ranit

    2009-01-01

    - In this paper a session based symmetric key encryption system has been proposed and is termed as Permutated Cipher Technique (PCT). This technique is more fast, suitable and secure for larger files. In this technique the input file is broken down into blocks of various sizes (of 2 power n order) and encrypted by shifting the position of each bit by a certain value for a certain number of times. A key is generated randomly wherein the length of each block is determined. Each block length generates a unique value of number of bits to be skipped. This value determines the new position of the bits within the block that are to be shifted. After the shifting and inverting each block is XORed with SHA 512 digest of the key. The resultant blocks from the cipher text. The key is generated according to the binary value of the input file size. Decryption is done following the same process as the technique is symmetric.

  13. A 12-bit 100 MS/s pipelined ADC with digital background calibration

    Institute of Scientific and Technical Information of China (English)

    Zhou Liren; Luo Lei; Ye Fan; Xu Jun; Ren Junyan

    2009-01-01

    This paper presents a 12-bit 100 MS/s CMOS pipelined analog-to-digital converter (ADC) with digital background calibration. A large magnitude calibration signal is injected into the multiplying digital-to-analog converter (MDAC) while the architecture of the MDAC remains unchanged. When sampled at 100 MS/s, it takes only 2.8 s to calibrate the 12-bit prototype ADC and achieves a peak spurious-free dynamic range of 85 dB and a peak signal-to-noise plus distortion ratio of 66 dB with 2 MHz input. Integral nonlinearity is improved from 1.9 to 0.6 least significant bits after calibration. The chip is fabricated in a 0.18μm CMOS process, occupies an active area of 2.3×1.6 mm~2, and consumes 205 mW at 1.8 V.

  14. An 11-bit ENOB, accuracy-programmable, and non-calibrating time-mode SAR ADC

    Institute of Scientific and Technical Information of China (English)

    Fan Hua; Han Xue; Wei Qi; Yang Huazhong

    2013-01-01

    A 10 or 12 bit programmable successive approximation register (SAR) ADC incorporating improved time-domain comparator for bridge stress monitoring systems is presented.Techniques for improving the accuracy of time-domain comparator are presented.The application of these approaches is illustrated using results from an experimental 10 or 12 bit programmable SAR ADC.Prototyped in a 0.18-μm,6M1P CMOS process,the ADC,at 12 bit,100 kS/s,achieves a Nyquist signal-to-noise-plus-distortion ratio (SNDR) of 68 dB (11 ENOB),a spurious free dynamic range (SFDR) of 77.48 dB,while dissipating 558 μW from a 1.8-V supply.Its differential nonlinearity (DNL) and integral nonlinearity (INL) are 0.2/-0.74 LSB and + 1.27/-0.97 LSB,respectively.

  15. A 16-bit cascaded sigma-delta pipeline A/D converter

    Institute of Scientific and Technical Information of China (English)

    Li Liang; Li Ruzhang; Yu Zhou; Zhang Jiabin; Zhang Jun'an

    2009-01-01

    A low-noise cascaded multi-bit sigma-delta pipeline analog-to-digital converter (ADC) with a low oversampling rate is presented. The architecture is composed of a 2-order 5-bit sigma-delta modulator and a cascaded 4-stage 12-bit pipelined ADC, and operates at a low 8X oversampling rate, The static and dynamic performances of the whole ADC can be improved by using dynamic element matching technique. The ADC operates at a 4 MHz clock rate and dissipates 300 mW at a 5 V/3 V analog/digital power supply. It is developed in a 0.35 μm CMOS process and achieves an SNR of 82 dB.

  16. A Coded Bit-Loading Linear Precoded Discrete Multitone Solution for Power Line Communication

    CERN Document Server

    Muhammad, Fahad Syed; Hélard, Jean-François; Crussière, Matthieu

    2008-01-01

    Linear precoded discrete multitone modulation (LP-DMT) system has been already proved advantageous with adaptive resource allocation algorithm in a power line communication (PLC) context. In this paper, we investigate the bit and energy allocation algorithm of an adaptive LP-DMT system taking into account the channel coding scheme. A coded adaptive LP-DMT system is presented in the PLC context with a loading algorithm which ccommodates the channel coding gains in bit and energy calculations. The performance of a concatenated channel coding scheme, consisting of an inner Wei's 4-dimensional 16-states trellis code and an outer Reed-Solomon code, in combination with the roposed algorithm is analyzed. Simulation results are presented for a fixed target bit error rate in a multicarrier scenario under power spectral density constraint. Using a multipath model of PLC channel, it is shown that the proposed coded adaptive LP-DMT system performs better than classical coded discrete multitone.

  17. Images from Bits: Non-Iterative Image Reconstruction for Quanta Image Sensors

    Directory of Open Access Journals (Sweden)

    Stanley H. Chan

    2016-11-01

    Full Text Available A quanta image sensor (QIS is a class of single-photon imaging devices that measure light intensity using oversampled binary observations. Because of the stochastic nature of the photon arrivals, data acquired by QIS is a massive stream of random binary bits. The goal of image reconstruction is to recover the underlying image from these bits. In this paper, we present a non-iterative image reconstruction algorithm for QIS. Unlike existing reconstruction methods that formulate the problem from an optimization perspective, the new algorithm directly recovers the images through a pair of nonlinear transformations and an off-the-shelf image denoising algorithm. By skipping the usual optimization procedure, we achieve orders of magnitude improvement in speed and even better image reconstruction quality. We validate the new algorithm on synthetic datasets, as well as real videos collected by one-bit single-photon avalanche diode (SPAD cameras.

  18. Beak necrosis in Hungarian partridges (Perdix perdix) associated with beak-bits and avian poxvirus infection.

    Science.gov (United States)

    Brower, Alexandra I; Cigel, Francine; Radi, Craig; Toohey-Kurth, Kathy

    2010-06-01

    Proliferative growth, consistent with poxvirus infection, encapsulated plastic beak-bits and covered the dorsal portion of the upper beak and nares of adult male and female captive-raised Hungarian partridges. Three representative birds were submitted to the Wisconsin Veterinary Diagnostic Laboratory for necropsy. Lesions in the necropsied birds extended through the nares, where the plastic bit ends are designed to rest. The lesions also variably extended caudally into the oropharynx and cranially within the beak epithelium, and included palate deformity and beak necrosis. Poxvirus was diagnosed in all of the birds examined based on histopathology, electron microscopy, and polymerase chain reaction amplification and sequencing. This report is the first to describe avian pox lesions associated with the application of beak-bits and the resulting beak and oral pathology.

  19. Images from Bits: Non-Iterative Image Reconstruction for Quanta Image Sensors.

    Science.gov (United States)

    Chan, Stanley H; Elgendy, Omar A; Wang, Xiran

    2016-11-22

    A quanta image sensor (QIS) is a class of single-photon imaging devices that measure light intensity using oversampled binary observations. Because of the stochastic nature of the photon arrivals, data acquired by QIS is a massive stream of random binary bits. The goal of image reconstruction is to recover the underlying image from these bits. In this paper, we present a non-iterative image reconstruction algorithm for QIS. Unlike existing reconstruction methods that formulate the problem from an optimization perspective, the new algorithm directly recovers the images through a pair of nonlinear transformations and an off-the-shelf image denoising algorithm. By skipping the usual optimization procedure, we achieve orders of magnitude improvement in speed and even better image reconstruction quality. We validate the new algorithm on synthetic datasets, as well as real videos collected by one-bit single-photon avalanche diode (SPAD) cameras.

  20. A low-power 10-bit 250-KSPS cyclic ADC with offset and mismatch correction*

    Institute of Scientific and Technical Information of China (English)

    Zhao Hongliang; Zhao Yiqiang; Geng Junfeng; Li Peng; Zhang Zhisheng

    2011-01-01

    A low power 10-bit 250-k sample per second (KSPS) cyclic analog to digital converter (ADC) is presented. The ADC's offset errors are successfully cancelled out through the proper choice of a capacitor switching sequence. The improved redundant signed digit algorithm used in the ADC can tolerate high levels of the comparator's offset errors and switched capacitor mismatch errors. With this structure, it has the advantages of simple circuit configuration, small chip area and low power dissipation. The cyclic ADC manufactured with the Chartered 0.35 μm 2P4M process shows a 58.5 dB signal to noise and distortion ratio and a 9.4 bit effective number of bits at a 250 KSPS sample rate. It dissipates 0.72 mW with a 3.3 V power supply and occupies dimensions of 0.42 × 0.68 mm2.