Science.gov

Sample records for optimization-based bit allocation

  1. Bit allocation for joint coding of multiple video programs

    NASA Astrophysics Data System (ADS)

    Wang, Limin; Vincent, Andre

    1997-01-01

    By dynamically distributing the channel capacity among video programs according to their respective scene complexities, joint coding has been a shown to be more efficient than independent coding for compression of multiple video programs. This paper examines the bit allocation issue for joint coding of multiple video programs and provides a bit allocation strategy that results in uniform picture quality among programs as will as within a program.

  2. A unified framework for optimal multiple video object bit allocation

    NASA Astrophysics Data System (ADS)

    Chen, Zhenzhong; Ngan, King Ngi

    2005-07-01

    MPEG-4 supports object-level video coding. It is a challenge to design an optimal bit allocation strategy which considers not only how to distribute bits among multiple video objects (MVO's) but also how to achieve optimization between the texture and shape information. In this paper, we present a uniform framework for optimal multiple video object bit allocation in MPEG-4. We combine the rate-distortion (R-D) models for the texture and shape information of arbitrarily shaped video objects to develop the joint texture-shape rate-distortion models. The dynamic programming (DP) technique is applied to optimize the bit allocation for the multiple video objects. The simulation results demonstrate that the proposed joint texture-shape optimization algorithm outperforms the MPEG-4 verification model on the decoded picture quality.

  3. Bit-rate allocation for multiple video streams using a pricing-based mechanism.

    PubMed

    Tiwari, Mayank; Groves, Theodore; Cosman, Pamela

    2011-11-01

    We consider the problem of bit-rate allocation for multiple video users sharing a common transmission channel. Previously, overall quality of multiple users was improved by exploiting relative video complexity. Users with high-complexity video benefit at the expense of video quality reduction for other users with simpler videos. The quality of all users can be improved by collectively allocating the bit rate in a centralized fashion which requires sharing video information with a central controller. In this paper, we present an informationally decentralized bit-rate allocation for multiple users where a user only needs to inform his demand to an allocator. Each user separately calculates his bit-rate demand based on his video complexity and bit-rate price, where the bit-rate price is announced by the allocator. The allocator adjusts the bit-rate price for the next period based on the bit rate demanded by the users and the total available bit-rate supply. Simulation results show that all users improve their quality by the pricing-based decentralized bit-rate allocation method compared with their allocation when acting individually. The results of our proposed method are comparable to the centralized bit-rate allocation. PMID:21518661

  4. Adaptive differential pulse-code modulation with adaptive bit allocation

    NASA Astrophysics Data System (ADS)

    Frangoulis, E. D.; Yoshida, K.; Turner, L. F.

    1984-08-01

    Studies have been conducted regarding the possibility to obtain good quality speech at data rates in the range from 16 kbit/s to 32 kbit/s. The techniques considered are related to adaptive predictive coding (APC) and adaptive differential pulse-code modulation (ADPCM). At 16 kbit/s adaptive transform coding (ATC) has also been used. The present investigation is concerned with a new method of speech coding. The described method employs adaptive bit allocation, similar to that used in adaptive transform coding, together with adaptive differential pulse-code modulation, employing first-order prediction. The new method has the objective to improve the quality of the speech over that which can be obtained with conventional ADPCM employing a fourth-order predictor. Attention is given to the ADPCM-AB system, the design of a subjective test, and the application of switched preemphasis to ADPCM.

  5. Proposed first-generation WSQ bit allocation procedure

    SciTech Connect

    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.

  6. Stereoscopic Visual Attention-Based Regional Bit Allocation Optimization for Multiview Video Coding

    NASA Astrophysics Data System (ADS)

    Zhang, Yun; Jiang, Gangyi; Yu, Mei; Chen, Ken; Dai, Qionghai

    2010-12-01

    We propose a Stereoscopic Visual Attention- (SVA-) based regional bit allocation optimization for Multiview Video Coding (MVC) by the exploiting visual redundancies from human perceptions. We propose a novel SVA model, where multiple perceptual stimuli including depth, motion, intensity, color, and orientation contrast are utilized, to simulate the visual attention mechanisms of human visual system with stereoscopic perception. Then, a semantic region-of-interest (ROI) is extracted based on the saliency maps of SVA. Both objective and subjective evaluations of extracted ROIs indicated that the proposed SVA model based on ROI extraction scheme outperforms the schemes only using spatial or/and temporal visual attention clues. Finally, by using the extracted SVA-based ROIs, a regional bit allocation optimization scheme is presented to allocate more bits on SVA-based ROIs for high image quality and fewer bits on background regions for efficient compression purpose. Experimental results on MVC show that the proposed regional bit allocation algorithm can achieve over [InlineEquation not available: see fulltext.]% bit-rate saving while maintaining the subjective image quality. Meanwhile, the image quality of ROIs is improved by [InlineEquation not available: see fulltext.] dB at the cost of insensitive image quality degradation of the background image.

  7. A unified framework of unsupervised subjective optimized bit allocation for multiple video object coding

    NASA Astrophysics Data System (ADS)

    Chen, Zhenzhong; Han, Junwei; Ngan, King Ngi

    2005-10-01

    MPEG-4 treats a scene as a composition of several objects or so-called video object planes (VOPs) that are separately encoded and decoded. Such a flexible video coding framework makes it possible to code different video object with different distortion scale. It is necessary to analyze the priority of the video objects according to its semantic importance, intrinsic properties and psycho-visual characteristics such that the bit budget can be distributed properly to video objects to improve the perceptual quality of the compressed video. This paper aims to provide an automatic video object priority definition method based on object-level visual attention model and further propose an optimization framework for video object bit allocation. One significant contribution of this work is that the human visual system characteristics are incorporated into the video coding optimization process. Another advantage is that the priority of the video object can be obtained automatically instead of fixing weighting factors before encoding or relying on the user interactivity. To evaluate the performance of the proposed approach, we compare it with traditional verification model bit allocation and the optimal multiple video object bit allocation algorithms. Comparing with traditional bit allocation algorithms, the objective quality of the object with higher priority is significantly improved under this framework. These results demonstrate the usefulness of this unsupervised subjective quality lifting framework.

  8. Optimal multitone bit allocation for fixed-rate video transmission over ADSL

    NASA Astrophysics Data System (ADS)

    Antonini, Marc; Moureaux, Jean-Marie; Lecuire, Vincent

    2002-01-01

    In this paper we propose a novel approach for the bit allocation performed in an ADSL modulator. This new method is based on the observation that the transmission speed using ADSL strongly depends on the distance between the central office and the subscriber's side and does not permit real-time transmission for high bitrate video on long distances. The algorithm we develop takes into account the characteristics of a video sequence and distributes the channel error according to visual sensitivity. This method involves variable transmission Bit Error Rate.

  9. MSE optimal bit-rate allocation in JPEG2000 Part 2 compression applied to a 3D data set

    NASA Astrophysics Data System (ADS)

    Kosheleva, Olga M.; Cabrera, Sergio D.; Usevitch, Bryan E.; Aguirre, Alberto; Vidal, Edward, Jr.

    2004-10-01

    A bit rate allocation (BRA) strategy is needed to optimally compress three-dimensional (3-D) data on a per-slice basis, treating it as a collection of two-dimensional (2-D) slices/components. This approach is compatible with the framework of JPEG2000 Part 2 which includes the option of pre-processing the slices with a decorrelation transform in the cross-component direction so that slices of transform coefficients are compressed. In this paper, we illustrate the impact of a recently developed inter-slice rate-distortion optimal bit-rate allocation approach that is applicable to this compression system. The approach exploits the MSE optimality of all JPEG2000 bit streams for all slices when each is produced in the quality progressive mode. Each bit stream can be used to produce a rate-distortion curve (RDC) for each slice that is MSE optimal at each bit rate of interest. The inter-slice allocation approach uses all RDCs for all slices to optimally select an overall optimal set of bit rates for all the slices using a constrained optimization procedure. The optimization is conceptually similar to Post-Compression Rate-Distortion optimization that is used within JPEG2000 to optimize bit rates allocated to codeblocks. Results are presented for two types of data sets: a 3-D computed tomography (CT) medical image, and a 3-D metereological data set derived from a particular modeling program. For comparison purposes, compression results are also illustrated for the traditional log-variance approach and for a uniform allocation strategy. The approach is illustrated using two decorrelation tranforms (the Karhunen Loeve transform, and the discrete wavelet transform) for which the inter-slice allocation scheme has the most impact.

  10. Bit and Power Allocation in Constrained Multicarrier Systems: The Single-User Case

    NASA Astrophysics Data System (ADS)

    Papandreou, Nikolaos; Antonakopoulos, Theodore

    2007-12-01

    Multicarrier modulation is a powerful transmission technique that provides improved performance in various communication fields. A fundamental topic of multicarrier communication systems is the bit and power loading, which is addressed in this article as a constrained multivariable nonlinear optimization problem. In particular, we present the main classes of loading problems, namely, rate maximization and margin maximization, and we discuss their optimal solutions for the single-user case. Initially, the classical water-filling solution subject to a total power constraint is presented using the Lagrange multipliers optimization approach. Next, the peak-power constraint is included and the concept of cup-limited waterfilling is introduced. The loading problem is also addressed subject to the integer-bit restriction and the optimal discrete solution is examined using combinatorial optimization methods. Furthermore, we investigate the duality conditions of the rate maximization and margin maximization problems and we highlight various ideas for low-complexity loading algorithms. This article surveys and reviews existing results on resource allocation in constrained multicarrier systems and presents new trends in this area.

  11. JAVA implemented MSE optimal bit-rate allocation applied to 3-D hyperspectral imagery using JPEG2000 compression

    NASA Astrophysics Data System (ADS)

    Melchor, J. L., Jr.; Cabrera, S. D.; Aguirre, A.; Kosheleva, O. M.; Vidal, E., Jr.

    2005-08-01

    This paper describes an efficient algorithm and its Java implementation for a recently developed mean-squared error (MSE) rate-distortion optimal (RDO) inter-slice bit-rate allocation (BRA) scheme applicable to the JPEG2000 Part 2 (J2KP2) framework. Its performance is illustrated on hyperspectral imagery data using the J2KP2 with the Karhunen- Loeve transform (KLT) for decorrelation. The results are contrasted with those obtained using the traditional logvariance based BRA method and with the original RDO algorithm. The implementation has been developed as a Java plug-in to be incorporated into our evolving multi-dimensional data compression software tool denoted CompressMD. The RDO approach to BRA uses discrete rate distortion curves (RDCs) for each slice of transform coefficients. The generation of each point on a RDC requires a full decompression of that slice, therefore, the efficient version minimizes the number of RDC points needed from each slice by using a localized coarse-to-fine approach denoted RDOEfficient. The scheme is illustrated in detail using a subset of 10 bands of hyperspectral imagery data and is contrasted to the original RDO implementation and the traditional (log-variance) method of BRA showing that better results are obtained with the RDO methods. The three schemes are also tested on two hyperspectral imagery data sets with all bands present: the Cuprite radiance data from AVIRIS and a set derived from the Hyperion satellite. The results from the RDO and RDOEfficient are very close to each other in the MSE sense indicating that the adaptive approach can find almost the same BRA solution. Surprisingly, the traditional method also performs very close to the RDO methods, indicating that it is very close to being optimal for these types of data sets.

  12. Drag bit construction

    DOEpatents

    Hood, Michael

    1986-01-01

    A mounting movable with respect to an adjacent hard face has a projecting drag bit adapted to engage the hard face. The drag bit is disposed for movement relative to the mounting by encounter of the drag bit with the hard face. That relative movement regulates a valve in a water passageway, preferably extending through the drag bit, to play a stream of water in the area of contact of the drag bit and the hard face and to prevent such water play when the drag bit is out of contact with the hard face.

  13. Drag bit construction

    DOEpatents

    Hood, M.

    1986-02-11

    A mounting movable with respect to an adjacent hard face has a projecting drag bit adapted to engage the hard face. The drag bit is disposed for movement relative to the mounting by encounter of the drag bit with the hard face. That relative movement regulates a valve in a water passageway, preferably extending through the drag bit, to play a stream of water in the area of contact of the drag bit and the hard face and to prevent such water play when the drag bit is out of contact with the hard face. 4 figs.

  14. Remote drill bit loader

    SciTech Connect

    Dokos, James A.

    1997-01-01

    A drill bit loader for loading a tapered shank of a drill bit into a similarly tapered recess in the end of a drill spindle. The spindle has a transverse slot at the inner end of the recess. The end of the tapered shank of the drill bit has a transverse tang adapted to engage in the slot so that the drill bit will be rotated by the spindle. The loader is in the form of a cylinder adapted to receive the drill bit with the shank projecting out of the outer end of the cylinder. Retainer pins prevent rotation of the drill bit in the cylinder. The spindle is lowered to extend the shank of the drill bit into the recess in the spindle and the spindle is rotated to align the slot in the spindle with the tang on the shank. A spring unit in the cylinder is compressed by the drill bit during its entry into the recess of the spindle and resiliently drives the tang into the slot in the spindle when the tang and slot are aligned.

  15. Remote drill bit loader

    DOEpatents

    Dokos, J.A.

    1997-12-30

    A drill bit loader is described for loading a tapered shank of a drill bit into a similarly tapered recess in the end of a drill spindle. The spindle has a transverse slot at the inner end of the recess. The end of the tapered shank of the drill bit has a transverse tang adapted to engage in the slot so that the drill bit will be rotated by the spindle. The loader is in the form of a cylinder adapted to receive the drill bit with the shank projecting out of the outer end of the cylinder. Retainer pins prevent rotation of the drill bit in the cylinder. The spindle is lowered to extend the shank of the drill bit into the recess in the spindle and the spindle is rotated to align the slot in the spindle with the tang on the shank. A spring unit in the cylinder is compressed by the drill bit during its entry into the recess of the spindle and resiliently drives the tang into the slot in the spindle when the tang and slot are aligned. 5 figs.

  16. Drag bit and cutters

    SciTech Connect

    Barr, J. D.

    1985-12-17

    A drill bit comprises a bit body having an operating end face. A plurality of self-sharpening cutters are mounted in the bit body and extend through the operating end face. The cutters have cutting faces adapted to engage an earth formation and cut the earth formation to a desired three-dimensional profile. The cutting faces define surfaces having back rake angles which decrease with distance from the profile. The individual cutting faces may be inwardly concave in a plane parallel to the intended direction of motion of the cutter in use.

  17. Double acting bit holder

    DOEpatents

    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.

  18. Hey! A Louse Bit Me!

    MedlinePlus

    ... Sledding, Skiing, Snowboarding, Skating Crushes What's a Booger? Hey! A Louse Bit Me! KidsHealth > For Kids > Hey! A Louse Bit Me! Print A A A ... For Kids For Parents MORE ON THIS TOPIC Hey! A Gnat Bit Me! Hey! A Flea Bit ...

  19. Lubrication of rotary rock bits

    SciTech Connect

    MacPhail, J.; Gardner, H.

    1996-12-01

    The rotary rock bit is designed so that both the bearings and cutting structure work together as one unit. Should the bearings wear prematurely before the cutting structure is worn out, then the complete bit will rapidly deteriorate leading to a shortened bit life. The optimum bit run is when the bearings and cutting structure wear out simultaneously, having obtained a good footage and rate of penetration. This paper discusses reasons why users of rotary air blast hole bits encounter premature bit failure due to bearing failure. It also discusses a lubrication system designed for rotary rock bits to combat bearing failure.

  20. Continuous coring drill bit

    SciTech Connect

    Ford, G.A.

    1987-09-22

    A continuous coring drill bit is described comprising: (a) body means defining a vertical axis and adapted for connection to drill pipe and forming an internal body cavity disposed in eccentric relation with the vertical axis and a generally circular throat in communication with the body cavity for conducting drilling fluid. The throat defining a throat axis coincident with the vertical axis and being of a configuration permitting passage of a formation core into the body cavity; (b) a generally cylindrical tubular core breaker being rotatably mounted within the body cavity and defining a vertical axis of rotation of generally parallel and offset relation with the vertical axis of the body means; and (c) a buttress element extending inwardly from the core breaker and adapted to contact the formation core. Upon each rotation of the drill bit the buttress element applying transverse force to the core for fracturing of the core into sections sufficiently small for transport by the drilling fluid.

  1. Positional information, in bits

    PubMed Central

    Dubuis, Julien O.; Tkačik, Gašper; Wieschaus, Eric F.; Gregor, Thomas; Bialek, William

    2013-01-01

    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 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. PMID:24089448

  2. 32-Bit-Wide Memory Tolerates Failures

    NASA Technical Reports Server (NTRS)

    Buskirk, Glenn A.

    1990-01-01

    Electronic memory system of 32-bit words corrects bit errors caused by some common type of failures - even failure of entire 4-bit-wide random-access-memory (RAM) chip. Detects failure of two such chips, so user warned that ouput of memory may contain errors. Includes eight 4-bit-wide DRAM's configured so each bit of each DRAM assigned to different one of four parallel 8-bit words. Each DRAM contributes only 1 bit to each 8-bit word.

  3. Drilling bits optimized for the Paris basin

    SciTech Connect

    Vennin, H.C. Pouyastruc )

    1989-07-31

    Paris basin wells have been successfully drilled using steel-body bits with stud-type cutters. These bits offer the possibility of optimizing the bit-face based on the strata to be drilled, as well as allowing replacement of worn cutters. This article discusses: bit manufacturing; bit repair; optimizing bits; hydraulics.

  4. Low bit rate speech transmission

    NASA Astrophysics Data System (ADS)

    Rothweiler, J.; Bertrand, J.

    The achievement of very low bit rates in all-digital military communications is important in tactical systems. Attention is presently given to a 400-2400 bit/sec system in which feature extraction is performed by standard linear predictive coding together with pattern matching by vector quantization and trellis coding. Some part of this system have been implemented in hardware, and others in simulation. Diagnostic rhyme test results are presented to indicate the performance of the system at various bit rates.

  5. Drag-type drill bit

    SciTech Connect

    Short, L.W. Jr.; Barr, J.D.

    1987-04-28

    A drag-type drill bit is described comprising: a bit body having an operating end face; and a multiplicity of superhard cutting elements interlocked to the body. The cutting elements define a multiplicity of cutting areas dispersed over the operating end face of the bit body in a pattern adapted to cause the cutting areas to cut an earth formation to a desired three-dimensional profile as the bit body is rotated, the cutting areas having back rake angles which become more negative with distance from the profile.

  6. Drill bit assembly for releasably retaining a drill bit cutter

    SciTech Connect

    Glowka, David A.; Raymond, David W.

    2002-01-01

    A drill bit assembly is provided for releasably retaining a polycrystalline diamond compact drill bit cutter. Two adjacent cavities formed in a drill bit body house, respectively, the disc-shaped drill bit cutter and a wedge-shaped cutter lock element with a removable fastener. The cutter lock element engages one flat surface of the cutter to retain the cutter in its cavity. The drill bit assembly thus enables the cutter to be locked against axial and/or rotational movement while still providing for easy removal of a worn or damaged cutter. The ability to adjust and replace cutters in the field reduces the effect of wear, helps maintains performance and improves drilling efficiency.

  7. Hey! A Chigger Bit Me!

    MedlinePlus

    ... Sledding, Skiing, Snowboarding, Skating Crushes What's a Booger? Hey! A Chigger Bit Me! KidsHealth > For Kids > Hey! A Chigger Bit Me! Print A A A ... For Kids For Parents MORE ON THIS TOPIC Hey! A Fire Ant Stung Me! Hey! A Gnat ...

  8. Positional Information, in bits

    NASA Astrophysics Data System (ADS)

    Dubuis, Julien; Bialek, William; Wieschaus, Eric; Gregor, Thomas

    2010-03-01

    Pattern formation in early embryonic development provides an important testing ground for ideas about the structure and dynamics of genetic regulatory networks. Spatial variations in the concentration of particular transcription factors act as ``morphogens,'' driving more complex patterns of gene expression that in turn define cell fates, which must be appropriate to the physical location of the cells in the embryo. Thus, in these networks, the regulation of gene expression serves to transmit and process ``positional information.'' Here, using the early Drosophila embryo as a model system, we measure the amount of positional information carried by a group of four genes (the gap genes Hunchback, Kr"uppel, Giant and Knirps) that respond directly to the primary maternal morphogen gradients. We find that the information carried by individual gap genes is much larger than one bit, so that their spatial patterns provide much more than the location of an ``expression boundary.'' Preliminary data indicate that, taken together these genes provide enough information to specify the location of every row of cells along the embryo's anterior-posterior axis.

  9. Experimental unconditionally secure bit commitment

    NASA Astrophysics Data System (ADS)

    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.

  10. Research on optimization-based design

    NASA Technical Reports Server (NTRS)

    Balling, R. J.; Parkinson, A. R.; Free, J. C.

    1989-01-01

    Research on optimization-based design is discussed. Illustrative examples are given for cases involving continuous optimization with discrete variables and optimization with tolerances. Approximation of computationally expensive and noisy functions, electromechanical actuator/control system design using decomposition and application of knowledge-based systems and optimization for the design of a valve anti-cavitation device are among the topics covered.

  11. Optimization-Based Models of Muscle Coordination

    PubMed Central

    Prilutsky, Boris I.; Zatsiorsky, Vladimir M.

    2010-01-01

    Optimization-based models may provide reasonably accurate estimates of activation and force patterns of individual muscles in selected well-learned tasks with submaximal efforts. Such optimization criteria as minimum energy expenditure, minimum muscle fatigue, and minimum sense of effort seem most promising. PMID:11800497

  12. Optimization-based models of muscle coordination.

    PubMed

    Prilutsky, Boris I; Zatsiorsky, Vladimir M

    2002-01-01

    Optimization-based models may provide reasonably accurate estimates of activation and force patterns of individual muscles in selected well-learned tasks with submaximal efforts. Such optimization criteria as minimum energy expenditure, minimum muscle fatigue, and minimum sense of effort seem most promising. PMID:11800497

  13. Experimental unconditionally secure bit commitment.

    PubMed

    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, Adán; Pan, Jian-Wei

    2014-01-10

    Quantum physics allows for unconditionally secure communication between parties that trust each other. However, when the parties do not trust each other such as in the bit commitment scenario, quantum physics is not enough to guarantee security unless extra assumptions are made. Unconditionally secure bit commitment only becomes feasible when quantum physics is combined with relativistic causality constraints. Here we experimentally implement a quantum bit commitment protocol 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. The security of the protocol relies on the properties of quantum information and relativity theory. In each run of the experiment, a bit is successfully committed with less than 5.68×10(-2) cheating probability. This demonstrates the experimental feasibility of quantum communication with relativistic constraints. PMID:24483878

  14. Experimental Unconditionally Secure Bit Commitment

    NASA Astrophysics Data System (ADS)

    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, Adán; Pan, Jian-Wei

    2014-01-01

    Quantum physics allows for unconditionally secure communication between parties that trust each other. However, when the parties do not trust each other such as in the bit commitment scenario, quantum physics is not enough to guarantee security unless extra assumptions are made. Unconditionally secure bit commitment only becomes feasible when quantum physics is combined with relativistic causality constraints. Here we experimentally implement a quantum bit commitment protocol 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. The security of the protocol relies on the properties of quantum information and relativity theory. In each run of the experiment, a bit is successfully committed with less than 5.68×10-2 cheating probability. This demonstrates the experimental feasibility of quantum communication with relativistic constraints.

  15. Multidimensional bit-rate control for video communication

    NASA Astrophysics Data System (ADS)

    Reed, Eric C.; Lim, Jae S.

    2000-12-01

    In conventional bit rate control schemes, the buffer level is controlled by adjusting the quantization step size while the frame rate and spatial resolution chosen for coding are fixed throughout the coding process. In this paper, we consider a more general Multidimensional (M-D) bit rate control where the frame rate, spatial resolution and quantization step size are jointly adapted for buffer control. In the M-D bit rate control setting, the problem is to decide which frames to code (and which frames to skip) along with the spatial resolution and the quantization step size to use for each coded frame. Given a finite set of operating points on a M-D grid, we formulate the optimal solution of the M-D buffer-constrained allocation problem. The formulation allows a skipped frame to be reconstructed from one coded frame using any temporal interpolation method. A dynamic programming algorithm is presented to obtain an optimal solution for the case of intraframe coding which is a special case of dependent coding. We experiment with both zero-order hold and motion-compensated temporal interpolation. Operational rate-distortion (R-D) bounds are illustrated for both the M-D and conventional bit rate control approaches. Our focus is one very low bit rate applications where a significant delay is tolerable.

  16. Optimal encryption of quantum bits

    SciTech Connect

    Boykin, P. Oscar; Roychowdhury, Vwani

    2003-04-01

    We show that 2n random classical bits are both necessary and sufficient for encrypting any unknown state of n quantum bits in an informationally secure manner. We also characterize the complete set of optimal protocols in terms of a set of unitary operations that comprise an orthonormal basis in a canonical inner product space. Moreover, a connection is made between quantum encryption and quantum teleportation that allows for a different proof of optimality of teleportation.

  17. String bit models for superstring

    SciTech Connect

    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.

  18. String bit models for superstring

    SciTech Connect

    Bergman, O.; Thorn, C.B.

    1995-11-15

    We extend the model of string as a polymer of string bits to the case of superstring. We 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 we 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 [({ital D}{minus}2)+1]-dimensional space-time. This means that Poincare invariance is reduced to the Galilei subgroup in {ital 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 {ital D}-dimensional space-time enjoying the full {ital N}=2 Poincare supersymmetric dynamics of type II-B superstring.

  19. Bit-level systolic arrays

    SciTech Connect

    De Groot, A.J.

    1989-01-01

    In this dissertation the author considered the design of bit - level systolic arrays where the basic computational unit consists of a simple one - bit logic unit, so that the systolic process is carried out at the level of individual bits. In order to pursue the foregoing research, several areas have been studied. First, the concept of systolic processing has been investigated. Several important algorithms were investigated and put into systolic form using graph-theoretic methods. The bit-level, word-level and block-level systolic arrays which have been designed for these algorithms exhibit linear speedup with respect to the number of processors and exhibit efficiency close to 100%, even with low interprocessor communication bandwidth. Block-level systolic arrays deal with blocks of data with block-level operations and communications. Block-level systolic arrays improve cell efficiency and are more efficient than their word-level counterparts. A comparison of bit-level, word-level and block-level systolic arrays was performed. In order to verify the foregoing theory and analysis a systolic processor called the SPRINT was developed to provide and environment where bit-level, word-level and block-level systolic algorithms could be confirmed by direct implementation rather than by computer simulation. The SPRINT is a supercomputer class, 64-element multiprocessor with a reconfigurable interconnection network. The theory has been confirmed by the execution on the SPRINT of the bit-level, word-level, and block-level systolic algorithms presented in the dissertation.

  20. Drill bit method and apparatus

    SciTech Connect

    Davis, K.

    1986-08-19

    This patent describes a drill bit having a lower cutting face which includes a plurality of stud assemblies radially spaced from a longitudinal axial centerline of the bit, each stud assembly being mounted within a stud receiving socket which is formed in the bit cutting face. The method of removing the stud assemblies from the sockets of the bit face consists of: forming a socket passageway along the longitudinal axial centerline of the stud receiving socket and extending the passageway rearwardly of the socket; forming a blind passageway which extends from the bit cutting face into the bit body, and into intersecting relationship respective to the socket passageway; while arranging the socket passageway and the blind passageway laterally respective to one another; forming a wedge face on one side of a tool, forming a support post which has one side inclined to receive the wedge face of the tool thereagainst; forcing a ball to move from the cutting face of the bit, into the blind passageway, onto the support post, then into the socket passageway, and into abutting engagement with a rear end portion of the stud assembly; placing the wedge face against the side of the ball which is opposed to the stud assembly; forcing the tool to move into the blind passageway while part of the tool engages the blind passageway and the wedge face engages the ball and thereby forces the ball to move in a direction away from the blind passageway; applying sufficient force to the tool to cause the ball to engage the stud assembly with sufficient force to be moved outwardly in a direction away from the socket, thereby releasing the stud assembly from the socket.

  1. Drill bit and method of renewing drill bit cutting face

    SciTech Connect

    Davis, K.

    1987-04-07

    This patent describes a drill bit having a lower formation engaging face which includes sockets formed therein, a stud assembly mounted in each socket. The method is described of removing the stud assemblies from the bit face comprises: placing a seal means about each stud assembly so that a stud assembly can sealingly reciprocate within a socket with a piston-like action; forming a reduced diameter passageway which extends rearwardly from communication with each socket to the exterior of the bit; flowing fluid into the passageway, thereby exerting fluid pressure against the rear end of the stud assembly; applying sufficient pressure to the fluid within the passageway to produce a pressure differential across the stud assembly to force the stud assembly to move outwardly in a direction away from the socket, thereby releasing the stud assembly from the socket.

  2. Bit by bit: the Darwinian basis of life.

    PubMed

    Joyce, Gerald F

    2012-01-01

    All known examples of life belong to the same biology, but there is increasing enthusiasm among astronomers, astrobiologists, and synthetic biologists that other forms of life may soon be discovered or synthesized. This enthusiasm should be tempered by the fact that the probability for life to originate is not known. As a guiding principle in parsing potential examples of alternative life, one should ask: How many heritable "bits" of information are involved, and where did they come from? A genetic system that contains more bits than the number that were required to initiate its operation might reasonably be considered a new form of life. PMID:22589698

  3. A bit serial sequential circuit

    NASA Technical Reports Server (NTRS)

    Hu, S.; Whitaker, S.

    1990-01-01

    Normally a sequential circuit with n state variables consists of n unique hardware realizations, one for each state variable. All variables are processed in parallel. This paper introduces a new sequential circuit architecture that allows the state variables to be realized in a serial manner using only one next state logic circuit. The action of processing the state variables in a serial manner has never been addressed before. This paper presents a general design procedure for circuit construction and initialization. Utilizing pass transistors to form the combinational next state forming logic in synchronous sequential machines, a bit serial state machine can be realized with a single NMOS pass transistor network connected to shift registers. The bit serial state machine occupies less area than other realizations which perform parallel operations. Moreover, the logical circuit of the bit serial state machine can be modified by simply changing the circuit input matrix to develop an adaptive state machine.

  4. Introduction to the Mu-bit

    NASA Astrophysics Data System (ADS)

    Smarandache, Florentin; Christianto, V.

    2011-03-01

    Mu-bit is defined here as `multi-space bit'. It is different from the standard meaning of bit in conventional computation, because in Smarandache's multispace theory (also spelt multi-space) the bit is created simultaneously in many subspaces (that form together a multi-space). This new `bit' term is different from multi-valued-bit already known in computer technology, for example as MVLong. This new concept is also different from qu-bit from quantum computation terminology. We know that using quantum mechanics logic we could introduce new way of computation with `qubit' (quantum bit), but the logic remains Neumann. Now, from the viewpoint of m-valued multi-space logic, we introduce a new term: `mu-bit' (from `multi-space bit).

  5. Hey! A Tarantula Bit Me!

    MedlinePlus

    ... leave you alone. Reviewed by: Elana Pearl Ben-Joseph, MD Date reviewed: April 2013 For Teens For Kids For Parents MORE ON THIS TOPIC Hey! A Fire Ant Stung Me! Hey! A Scorpion Stung Me! Hey! A Black Widow Spider Bit Me! Hey! A Brown Recluse ...

  6. Hey! A Mosquito Bit Me!

    MedlinePlus

    ... Here's Help White House Lunch Recipes 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 ...

  7. Hey! A Bedbug Bit Me!

    MedlinePlus

    ... Snowboarding, Skating Crushes What's a Booger? Hey! A Bedbug Bit Me! KidsHealth > For Kids > Hey! A Bedbug ... español ¡Ay! ¡Me picó una chinche! What a Bedbug Is A bedbug is a small (about the ...

  8. Local, Optimization-based Simplicial Mesh Smoothing

    Energy Science and Technology Software Center (ESTSC)

    1999-12-09

    OPT-MS is a C software package for the improvement and untangling of simplicial meshes (triangles in 2D, tetrahedra in 3D). Overall mesh quality is improved by iterating over the mesh vertices and adjusting their position to optimize some measure of mesh quality, such as element angle or aspect ratio. Several solution techniques (including Laplacian smoothing, "Smart" Laplacian smoothing, optimization-based smoothing and several combinations thereof) and objective functions (for example, element angle, sin (angle), and aspectmore » ratio) are available to the user for both two and three-dimensional meshes. If the mesh contains invalid elements (those with negative area) a different optimization algorithm for mesh untangling is provided.« less

  9. Stability of single skyrmionic bits

    PubMed Central

    Hagemeister, J.; Romming, N.; von Bergmann, K.; Vedmedenko, E. Y.; Wiesendanger, R.

    2015-01-01

    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. PMID:26465211

  10. Deterministic relativistic quantum bit commitment

    NASA Astrophysics Data System (ADS)

    Adlam, Emily; Kent, Adrian

    2015-06-01

    We describe new unconditionally secure bit commitment schemes whose security is based on Minkowski causality and the monogamy of quantum entanglement. We first describe an ideal scheme that is purely deterministic, in the sense that neither party needs to generate any secret randomness at any stage. We also describe a variant that allows the committer to proceed deterministically, requires only local randomness generation from the receiver, and allows the commitment to be verified in the neighborhood of the unveiling point. We show that these schemes still offer near-perfect security in the presence of losses and errors, which can be made perfect if the committer uses an extra single random secret bit. We discuss scenarios where these advantages are significant.

  11. Panel focuses on diamond shear bit care

    SciTech Connect

    Park, A.

    1982-10-04

    This article examines drilling parameters and marketability of Stratapax bits. Finds that core bits drill from 2 to 3 times faster than conventional diamond bits, thereby reducing filtrate invasion. Predicts that high speed drilling, downhole motors, deeper wells and slim hole drilling will mean greater Stratapax use.

  12. Development of PDC Bits for Downhole Motors

    SciTech Connect

    Karasawa, H.; Ohno, T.

    1995-01-01

    To develop polycrystalline hamond compact (PDC) bits of the full-face type which can be applied to downhole motor drilling, drilling tests for granite and two types of andesite were conducted using bits with 98.43 and 142.88 mm diameters. The bits successfully drilled these types of rock at rotary speeds from 300 to 400 rpm.

  13. Bit by Bit: The Darwinian Basis of Life

    PubMed Central

    Joyce, Gerald F.

    2012-01-01

    All known examples of life belong to the same biology, but there is increasing enthusiasm among astronomers, astrobiologists, and synthetic biologists that other forms of life may soon be discovered or synthesized. This enthusiasm should be tempered by the fact that the probability for life to originate is not known. As a guiding principle in parsing potential examples of alternative life, one should ask: How many heritable “bits” of information are involved, and where did they come from? A genetic system that contains more bits than the number that were required to initiate its operation might reasonably be considered a new form of life. PMID:22589698

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

    ERIC Educational Resources Information Center

    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…

  15. Proper nozzle location, bit profile, and cutter arrangement affect PDC-bit performance significantly

    SciTech Connect

    Garcia-Gavito, D.; Azar, J.J.

    1994-09-01

    During the past 20 years, the drilling industry has looked to new technology to halt the exponentially increasing costs of drilling oil, gas, and geothermal wells. This technology includes bit design innovations to improve overall drilling performance and reduce drilling costs. These innovations include development of drag bits that use PDC cutters, also called PDC bits, to drill long, continuous intervals of soft to medium-hard formations more economically than conventional three-cone roller-cone bits. The cost advantage is the result of higher rates of penetration (ROP's) and longer bit life obtained with the PDC bits. An experimental study comparing the effects of polycrystalline-diamond-compact (PDC)-bit design features on the dynamic pressure distribution at the bit/rock interface was conducted on a full-scale drilling rig. Results showed that nozzle location, bit profile, and cutter arrangement are significant factors in PDC-bit performance.

  16. Bit-serial neuroprocessor architecture

    NASA Technical Reports Server (NTRS)

    Tawel, Raoul (Inventor)

    2001-01-01

    A neuroprocessor architecture employs a combination of bit-serial and serial-parallel techniques for implementing the neurons of the neuroprocessor. The neuroprocessor architecture includes a neural module containing a pool of neurons, a global controller, a sigmoid activation ROM look-up-table, a plurality of neuron state registers, and a synaptic weight RAM. The neuroprocessor reduces the number of neurons required to perform the task by time multiplexing groups of neurons from a fixed pool of neurons to achieve the successive hidden layers of a recurrent network topology.

  17. Arbitrarily Long Relativistic Bit Commitment

    NASA Astrophysics Data System (ADS)

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

    2015-12-01

    We consider the recent relativistic bit commitment protocol introduced by Lunghi et al. [Phys. Rev. Lett. 115, 030502 (2015)] and present a new security analysis against classical attacks. In particular, while the initial complexity of the protocol scales double exponentially with the commitment time, our analysis shows that the correct dependence is only linear. This has dramatic implications in terms of implementation: in particular, the commitment time can easily be made arbitrarily long, by only requiring both parties to communicate classically and perform efficient classical computation.

  18. Efficient delivery techniques for variable-bit-rate multimedia

    NASA Astrophysics Data System (ADS)

    Zhao, Yanping; Eager, Derek L.; Vernon, Mary K.

    2001-12-01

    Two key technologies enabling scalable on-demand delivery of stored multimedia content are work-ahead smoothing and multicast delivery. Work-ahead smoothing reduces the burstiness of variable bit rate streams, simplifying server and network resource allocation. Recent multicast delivery techniques such as patching or bandwidth skimming serve clients that request the same content close together in time with (partially) shared multicasts, greatly reducing required server bandwidth. Although previous studies of work-ahead smoothing have generally assumed very limited client buffer space, in a number of contexts of current interest (such as systems that have significant settop storage), it becomes feasible to fully smooth variable bit rate content. We quantify the start-up delay and settop storage requirements of full smoothing for a number of sample variable bit rate objects. We then evaluate a fundamental conflict between aggressive smoothing and the new multicast delivery techniques. Work-ahead smoothing requires sending data for high rate portions of an object earlier than it is needed for playback, while multicast techniques yield their greatest benefit when data is delivered within each stream as late as possible so that more clients can share reception of that data. A new multicast delivery technique is proposed that can accommodate aggressive smoothing with increased efficiency in comparison to previous techniques, particularly for high request rates.

  19. Stability of single skyrmionic bits

    NASA Astrophysics Data System (ADS)

    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.

  20. Computer Processor Allocator

    Energy Science and Technology Software Center (ESTSC)

    2004-03-01

    The Compute Processor Allocator (CPA) provides an efficient and reliable mechanism for managing and allotting processors in a massively parallel (MP) computer. It maintains information in a database on the health. configuration and allocation of each processor. This persistent information is factored in to each allocation decision. The CPA runs in a distributed fashion to avoid a single point of failure.

  1. Josephson 32-bit shift register

    SciTech Connect

    Yuh, P.F.; Yao, C.T.; Bradley, P. )

    1991-03-01

    This paper reports on a 32-bit shift register designed by edge-triggered gates tested with {plus minus}25% bias margin and {plus minus}81% input margin for the full array. Simulations have shown {plus minus}55% bias margin at 3.3 GHz and working up to a maximum frequency of 30 GHz with a junction current density of 2000A/cm{sup 2} although the shift register has only been tested up to 500 MHz, limited by instrumentation. This edge-triggered gate consisting of a pair of conventional Josephson logic gates in series has the advantages of wide margins, short reset time, and insensitivity to global parameter-variations.

  2. FastBit Reference Manual

    SciTech Connect

    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.

  3. Improvement of PDC bit`s performance at high rotary speed

    SciTech Connect

    Karasawa, Hirokazu; Ohno, Tetsuji; Kobayashi, Hideo

    1996-12-31

    To develop polycrystalline diamond compact (PDC) full-face bits with high drilling efficiency, the effect of cutter diameter on the bit performance was investigated using 98.43 mm-dia bits. On the basis of this investigation, 142.88 mm-dia bits were fabricated and tested. The 142.88 mm-dia bits could drill through medium-hard to hard rocks at the rotary speeds from 256 to 400 rpm. Durability tests for granite using a 142.88 mm-dia bit revealed that it is necessary to improve the bit with regard to the arrangement of cutters and the number of cutters set on a bit body.

  4. REVERSIBLE N-BIT TO N-BIT INTEGER HAAR-LIKE TRANSFORMS

    SciTech Connect

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

    2004-02-14

    We introduce TLHaar, an n-bit to n-bit reversible transform similar to the Haar IntegerWavelet Transform (IWT). TLHaar uses lookup tables that approximate the Haar IWT, but reorder the coefficients so they fit into n bits. TLHaar is suited for lossless compression in fixed-width channels, such as digital video channels and graphics hardware frame buffers.

  5. Hey! A Brown Recluse Spider Bit Me!

    MedlinePlus

    ... putting them on. Reviewed by: Elana Pearl Ben-Joseph, MD Date reviewed: April 2013 For Teens For Kids For Parents MORE ON THIS TOPIC Hey! A Fire Ant Stung Me! Hey! A Tarantula Bit Me! Hey! A Scorpion Stung Me! Hey! A Black Widow Spider Bit Me! Camping and Woods Safety ...

  6. Efficient Bit-to-Symbol Likelihood Mappings

    NASA Technical Reports Server (NTRS)

    Moision, Bruce E.; Nakashima, Michael A.

    2010-01-01

    This innovation is an efficient algorithm designed to perform bit-to-symbol and symbol-to-bit likelihood mappings that represent a significant portion of the complexity of an error-correction code decoder for high-order constellations. Recent implementation of the algorithm in hardware has yielded an 8- percent reduction in overall area relative to the prior design.

  7. Multi-Bit Quantum Private Query

    NASA Astrophysics Data System (ADS)

    Shi, Wei-Xu; Liu, Xing-Tong; Wang, Jian; Tang, Chao-Jing

    2015-09-01

    Most of the existing Quantum Private Queries (QPQ) protocols provide only single-bit queries service, thus have to be repeated several times when more bits are retrieved. Wei et al.'s scheme for block queries requires a high-dimension quantum key distribution system to sustain, which is still restricted in the laboratory. Here, based on Markus Jakobi et al.'s single-bit QPQ protocol, we propose a multi-bit quantum private query protocol, in which the user can get access to several bits within one single query. We also extend the proposed protocol to block queries, using a binary matrix to guard database security. Analysis in this paper shows that our protocol has better communication complexity, implementability and can achieve a considerable level of security.

  8. An Improved N-Bit to N-Bit Reversible Haar-Like Transform

    SciTech Connect

    Senecal, J G; Lindstrom, P; Duchaineau, M A; Joy, K I

    2004-07-26

    We introduce the Piecewise-Linear Haar (PLHaar) transform, a reversible n-bit to n-bit transform that is based on the Haar wavelet transform. PLHaar is continuous, while all current n-bit to n-bit methods are not, and is therefore uniquely usable with both lossy and lossless methods (e.g. image compression). PLHaar has both integer and continuous (i.e. non-discrete) forms. By keeping the coefficients to n bits PLHaar is particularly suited for use in hardware environments where channel width is limited, such as digital video channels and graphics hardware.

  9. Bit-string scattering theory

    SciTech Connect

    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.

  10. Smoothing variable-bit-rate video in an internetwork

    NASA Astrophysics Data System (ADS)

    Rexford, Jennifer; Towsley, Don

    1997-10-01

    The burstiness of compressed video complicates the provisioning of network resources for emerging multimedia services. For stored video applications, the server can smooth the variable-bit-rate stream by prefetching frames into the client playback buffer in advanced of each burst. Drawing on a priori knowledge of the frame lengths and client buffer size, such bandwidth smoothing techniques can minimize the peak and variability of the rate requirements while avoiding underflow and overflow of the playback buffer. However, in an internetworking environment, a single service provider typically does not control the entire path from the stored-video server to the client buffer. To develop efficient techniques for transmitting variable-bit- rate video across a portion of the route, we investigate bandwidth smoothing across a tandem of nodes, which may or may not include the server and client sites. We show that it is possible to compute an optimal transmission schedule for the tandem system by solving a collection of independent single-link problems. To develop efficient techniques for minimizing the network bandwidth requirements, we characterize how the peak rate varies as a function of the buffer allocation and the playback delay. Simulation experiments illustrate the subtle interplay between buffer space, playback delay, and bandwidth requirements for a collection of full-length video traces. These analytic and empirical results suggest effective guidelines for provisioning network services for the transmission of compressed video.

  11. Allocation without locking

    SciTech Connect

    Appel, A.W.

    1988-01-01

    In a programming environment with both concurrency and automatic garbage collection, the allocation and initialization of a new record is a sensitive matter: if it is interrupted halfway through, the allocating process may be in a state that the garbage collector can't understand. In particular, the collector won't know which words of the new record have been initialized and which are meaningless (and unsafe to transverse). For this reason, parallel implementations usually use a locking or semaphore mechanism to ensure that allocation is an atomic operation. The locking significantly adds to the cost of allocation. This paper shows that allocation can run extremely quickly even in a multi-thread environment: open-coded, without locking.

  12. Design of bit error rate tester based on a high speed bit and sequence synchronization

    NASA Astrophysics Data System (ADS)

    Wang, Xuanmin; Zhao, Xiangmo; Zhang, Lichuan; Zhang, Yinglong

    2013-03-01

    In traditional BER (Bit Error Rate) tester, bit synchronization applied digital PLL and sequence synchronization utilized sequence's correlation.It resulted in a low speed on bit and sequence synchronization. this paper came up new method to realize bit and sequence synchronization .which were Bit-edge-tracking method and Immitting-sequence method.The BER tester based on FPGA was designed.The functions of inserting error-bit and removing the false sequence synchronization were added. The results of Debuging and simulating display that the time to realize bit synchronization is less than a bit width, the lagged time of the tracking bit pulse is 1/8 of the code cycle,and there is only a M sequence's cycle to realize sequence synchronization.This new BER tester has many advantages,such as a short time to realize bit and sequence synchronization,no false sequence synchronization,testing the ability of the receiving port's error -correcting and a simple hareware.

  13. PDC bits find applications in Oklahoma drilling

    SciTech Connect

    Offenbacher, L.A.; McDermaid, J.D.; Patterson, C.R.

    1983-02-01

    Drilling in Oklahoma is difficult by any standards. Polycrystalline diamond cutter (PDC) bits, with proven success drilling soft, homogenous formations common in the North Sea and U.S. Gulf Coast regions, have found some significant ''spot'' applications in Oklahoma. Applications qualified by bit design and application development over the past two (2) years include slim hole drilling in the deep Anadarko Basin, deviation control in Southern Oklahoma, drilling on mud motors, drilling in oil base mud, drilling cement, sidetracking, coring and some rotary drilling in larger hole sizes. PDC bits are formation sensitive, and care must be taken in selecting where to run them in Oklahoma. Most of the successful runs have been in water base mud drilling hard shales and soft, unconsolidated sands and lime, although bit life is often extended in oil-base muds.

  14. FastBit: Interactively Searching Massive Data

    SciTech Connect

    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.

  15. A practical quantum bit commitment protocol

    NASA Astrophysics Data System (ADS)

    Arash Sheikholeslam, S.; Aaron Gulliver, T.

    2012-01-01

    In this paper, we introduce a new quantum bit commitment protocol which is secure against entanglement attacks. A general cheating strategy is examined and shown to be practically ineffective against the proposed approach.

  16. 28-Bit serial word simulator/monitor

    NASA Technical Reports Server (NTRS)

    Durbin, J. W.

    1979-01-01

    Modular interface unit transfers data at high speeds along four channels. Device expedites variable-word-length communication between computers. Operation eases exchange of bit information by automatically reformatting coded input data and status information to match requirements of output.

  17. Adaptation of bit error rate by coding

    NASA Astrophysics Data System (ADS)

    Marguinaud, A.; Sorton, G.

    1984-07-01

    The use of coding in spacecraft wideband communication to reduce power transmission, save bandwith, and lower antenna specifications was studied. The feasibility of a coder decoder functioning at a bit rate of 10 Mb/sec with a raw bit error rate (BER) of 0.001 and an output BER of 0.000000001 is demonstrated. A single block code protection, and two coding levels protection are examined. A single level protection BCH code with 5 errors correction capacity, 16% redundancy, and interleaving depth 4 giving a coded block of 1020 bits is simple to implement, but has BER = 0.000000007. A single level BCH code with 7 errors correction capacity and 12% redundancy meets specifications, but is more difficult to implement. Two level protection with 9% BCH outer and 10% BCH inner codes, both levels with 3 errors correction capacity and 8% redundancy for a coded block of 7050 bits is the most complex, but offers performance advantages.

  18. Diffusion bonding of Stratapax for drill bits

    SciTech Connect

    Middleton, J.N.; Finger, J.T.

    1983-01-01

    A process has been developed for the diffusion bonding of General Electric's Stratapax drill blanks to support studs for cutter assemblies in drill bits. The diffusion bonding process is described and bond strength test data are provided for a variety of materials. The extensive process details, provided in the Appendices, should be sufficient to enable others to successfully build diffusion-bonded drill bit cutter assemblies.

  19. Performance of concatenated codes using 8-bit and 10-bit Reed-Solomon codes

    NASA Technical Reports Server (NTRS)

    Pollara, F.; Cheung, K.-M.

    1989-01-01

    The performance improvement of concatenated coding systems using 10-bit instead of 8-bit Reed-Solomon codes is measured by simulation. Three inner convolutional codes are considered: (7,1/2), (15,1/4), and (15,1/6). It is shown that approximately 0.2 dB can be gained at a bit error rate of 10(-6). The loss due to nonideal interleaving is also evaluated. Performance comparisons at very low bit error rates may be relevant for systems using data compression.

  20. The Unobtrusive Memory Allocator

    Energy Science and Technology Software Center (ESTSC)

    2003-03-31

    This library implements a memory allocator/manager which ask its host program or library for memory refions to manage rather than requesting them from the operating system. This allocator supports multiple distinct heaps within a single executable, each of which may grow either upward or downward in memory. The GNU mmalloc library has been modified in such a way that its allocation algorithms have been preserved, but the manner in which it obtains regions to managemore » has been changed to request memory from the host program or library. Additional modifications allow the allocator to manage each heap as either upward or downward-growing. By allowing the hosting program or library to determine what memory is managed, this package allows a greater degree of control than other memory allocation/management libraries. Additional distinguishing features include the ability to manage multiple distinct heaps with in a single executable, each of which may grow either upward or downward in memory. The most common use of this library is in conjunction with the Berkeley Unified Parallel C (UPC) Runtime Library. This package is a modified version of the LGPL-licensed "mmalloc" allocator from release 5.2 of the "gdb" debugger's source code.« less

  1. Antenna Allocation in MIMO Radar with Widely Separated Antennas for Multi-Target Detection

    PubMed Central

    Gao, Hao; Wang, Jian; Jiang, Chunxiao; Zhang, Xudong

    2014-01-01

    In this paper, we explore a new resource called multi-target diversity to optimize the performance of multiple input multiple output (MIMO) radar with widely separated antennas for detecting multiple targets. In particular, we allocate antennas of the MIMO radar to probe different targets simultaneously in a flexible manner based on the performance metric of relative entropy. Two antenna allocation schemes are proposed. In the first scheme, each antenna is allocated to illuminate a proper target over the entire illumination time, so that the detection performance of each target is guaranteed. The problem is formulated as a minimum makespan scheduling problem in the combinatorial optimization framework. Antenna allocation is implemented through a branch-and-bound algorithm and an enhanced factor 2 algorithm. In the second scheme, called antenna-time allocation, each antenna is allocated to illuminate different targets with different illumination time. Both antenna allocation and time allocation are optimized based on illumination probabilities. Over a large range of transmitted power, target fluctuations and target numbers, both of the proposed antenna allocation schemes outperform the scheme without antenna allocation. Moreover, the antenna-time allocation scheme achieves a more robust detection performance than branch-and-bound algorithm and the enhanced factor 2 algorithm when the target number changes. PMID:25350505

  2. Nugget hardfacing toughens roller cone bits

    SciTech Connect

    1996-11-25

    A new hardfacing material made of pure sintered tungsten carbide nuggets has improved roller cone rock bit performance in extremely hard lithologies, increasing penetration rates and extending bit life through multiple formations. In a recent test run in the Shushufindi 95 wells in Ecuador, a Security DBS 9 7/8-in. MPSF IADC 117M (International Association of Drilling Contractors bit code) bit with this new hardfacing drilled out the float equipment, cement, and show and then 3,309 ft of hard formations. The bit drilled through the Orteguaza claystone/shale/sand and chert formations and then to total depth at 6,309 ft in the Tiyuyacu shale/sand. The 3,309-ft interval was drilled at an average penetration rate (ROP) of 52.5 ft/hr. The proprietary nugget material was tested according to the American Society for Testing Materials (ASTM) G65 wear test method, a standard industry method of measuring wear resistance. The nugget material had ASTM wear test resistance more than twice that of standard hardfacing from conventional tungsten carbide.

  3. Using magnetic permeability bits to store information

    NASA Astrophysics Data System (ADS)

    Timmerwilke, John; Petrie, J. R.; Wieland, K. A.; Mencia, Raymond; Liou, Sy-Hwang; Cress, C. D.; Newburgh, G. A.; Edelstein, A. S.

    2015-10-01

    Steps are described in the development of a new magnetic memory technology, based on states with different magnetic permeability, with the capability to reliably store large amounts of information in a high-density form for decades. The advantages of using the permeability to store information include an insensitivity to accidental exposure to magnetic fields or temperature changes, both of which are known to corrupt memory approaches that rely on remanent magnetization. The high permeability media investigated consists of either films of Metglas 2826 MB (Fe40Ni38Mo4B18) or bilayers of permalloy (Ni78Fe22)/Cu. Regions of films of the high permeability media were converted thermally to low permeability regions by laser or ohmic heating. The permeability of the bits was read by detecting changes of an external 32 Oe probe field using a magnetic tunnel junction 10 μm away from the media. Metglas bits were written with 100 μs laser pulses and arrays of 300 nm diameter bits were read. The high and low permeability bits written using bilayers of permalloy/Cu are not affected by 10 Mrad(Si) of gamma radiation from a 60Co source. An economical route for writing and reading bits as small at 20 nm using a variation of heat assisted magnetic recording is discussed.

  4. Rig site computer optimizes bit weight

    SciTech Connect

    Enen, J.; Callas, N.P.; Sullivan, W.

    1984-02-13

    A new tool has been developed to optimize the factors which control hole angle so faster drilling rates can be achieved. A computer program determines best stabilizer placement to prevent sacrifice of bit weight. It also learns from the last bit run and corrects itself. The program can quickly evaluate the angle build or drop characteristics of a bottom hole assembly (BHA) and compare it with the well plan. A corollary program evaluates casing centralization and stand off. These techniques can save drilling time and money in several circumstances. Whenever time is lost in straight hole drilling because of low bit weight for angle control, the program suggests a better BHA and higher weights. In directional drilling, it finds the fastest approach through one or more targets, again at the highest practical bit weight. In both instances, weight and rpm are designed for the formation drillability; BHA is designed to control angle under those specific conditions. This in effect frees up incremental bit weight without undue risk of crooked hole.

  5. Managing the number of tag bits transmitted in a bit-tracking RFID collision resolution protocol.

    PubMed

    Landaluce, Hugo; Perallos, Asier; Angulo, Ignacio

    2014-01-01

    Radio Frequency Identification (RFID) technology faces the problem of message collisions. The coexistence of tags sharing the communication channel degrades bandwidth, and increases the number of bits transmitted. The window methodology, which controls the number of bits transmitted by the tags, is applied to the collision tree (CT) protocol to solve the tag collision problem. The combination of this methodology with the bit-tracking technology, used in CT, improves the performance of the window and produces a new protocol which decreases the number of bits transmitted. The aim of this paper is to show how the CT bit-tracking protocol is influenced by the proposed window, and how the performance of the novel protocol improves under different conditions of the scenario. Therefore, we have performed a fair comparison of the CT protocol, which uses bit-tracking to identify the first collided bit, and the new proposed protocol with the window methodology. Simulations results show that the proposed window positively decreases the total number of bits that are transmitted by the tags, and outperforms the CT protocol latency in slow tag data rate scenarios. PMID:24406861

  6. Managing the Number of Tag Bits Transmitted in a Bit-Tracking RFID Collision Resolution Protocol

    PubMed Central

    Landaluce, Hugo; Perallos, Asier; Angulo, Ignacio

    2014-01-01

    Radio Frequency Identification (RFID) technology faces the problem of message collisions. The coexistence of tags sharing the communication channel degrades bandwidth, and increases the number of bits transmitted. The window methodology, which controls the number of bits transmitted by the tags, is applied to the collision tree (CT) protocol to solve the tag collision problem. The combination of this methodology with the bit-tracking technology, used in CT, improves the performance of the window and produces a new protocol which decreases the number of bits transmitted. The aim of this paper is to show how the CT bit-tracking protocol is influenced by the proposed window, and how the performance of the novel protocol improves under different conditions of the scenario. Therefore, we have performed a fair comparison of the CT protocol, which uses bit-tracking to identify the first collided bit, and the new proposed protocol with the window methodology. Simulations results show that the proposed window positively decreases the total number of bits that are transmitted by the tags, and outperforms the CT protocol latency in slow tag data rate scenarios. PMID:24406861

  7. Evaluations of bit sleeve and twisted-body bit designs for controlling roof bolter dust

    PubMed Central

    Beck, T.W.

    2015-01-01

    Drilling into coal mine roof strata to install roof bolts has the potential to release substantial quantities of respirable dust. Due to the proximity of drill holes to the breathing zone of roof bolting personnel, dust escaping the holes and avoiding capture by the dust collection system pose a potential respiratory health risk. Controls are available to complement the typical dry vacuum collection system and minimize harmful exposures during the initial phase of drilling. This paper examines the use of a bit sleeve in combination with a dust-hog-type bit to improve dust extraction during the critical initial phase of drilling. A twisted-body drill bit is also evaluated to determine the quantity of dust liberated in comparison with the dust-hog-type bit. Based on the results of our laboratory tests, the bit sleeve may reduce dust emissions by one-half during the initial phase of drilling before the drill bit is fully enclosed by the drill hole. Because collaring is responsible for the largest dust liberations, overall dust emission can also be substantially reduced. The use of a twisted-body bit has minimal improvement on dust capture compared with the commonly used dust-hog-type bit. PMID:26257435

  8. Audio and video bit-rate reduction

    NASA Astrophysics Data System (ADS)

    Haskell, B. G.; Steele, R.

    1981-02-01

    The problem of estimating limits of bit-rate reduction for audio and video information is addressed. It is noted that binary encoding of such signals is performed by a variety of techniques, which are classified here into two categories (waveform and parameter). Encoders are compared on the basis of bits per Nyquist sample. Since minimizing the Nyquist sample requires a use of source signal statistics and human perception, audio and video sources and their statistics are discussed, as are the salient properties of hearing and vision and subjective assessments of quality. The present state of waveform and parameter encoding is assessed. It is predicted that waveform encoders will be refined to the point where bit rates will be nearly optimum but also highly variable. It is concluded that dramatic reductions will come about only through sophisticated parameter encoding.

  9. Friction of drill bits under Martian pressure

    NASA Astrophysics Data System (ADS)

    Zacny, K. A.; Cooper, G. A.

    2007-03-01

    Frictional behavior was investigated for two materials that are good candidates for Mars drill bits: Diamond Impregnated Segments and Polycrystalline Diamond Compacts (PDC). The bits were sliding against dry sandstone and basalt rocks under both Earth and Mars atmospheric pressures and also at temperatures ranging from subzero to over 400 °C. It was found that the friction coefficient dropped from approximately 0.16 to 0.1 as the pressure was lowered from the Earth's pressure to Mars' pressure, at room temperature. This is thought to be a result of the loss of weakly bound water on the sliding surfaces. Holding the pressure at 5 torr and increasing the temperature to approximately 200°C caused a sudden increase in the friction coefficient by approximately 50%. This is attributed to the loss of surface oxides. If no indication of the bit temperature is available, an increase in drilling torque could be misinterpreted as being caused by an increase in auger torque (due to accumulation of cuttings) rather than being the result of a loss of oxide layers due to elevated bit temperatures. An increase in rotational speed (to allow for clearing of cuttings) would then cause greater frictional heating and would increase the drilling torque further. Therefore it would be advisable to monitor the bit temperature or, if that is not possible, to include pauses in drilling to allow the heat to dissipate. Higher friction would also accelerate the wear of the drill bit and in turn reduce the depth of the hole.

  10. A simple model of bit whirl for deep drilling applications

    NASA Astrophysics Data System (ADS)

    Kovalyshen, Yevhen

    2013-11-01

    A simple analytical model of bit whirl is presented. In contrast to the previous works, which consider bottom hole assembly mass imbalance to model bit whirl, the model here takes into account the history-dependent boundary conditions at the bit-rock interface as well as the bit geometry. In particular, an analytical expression for the bit-rock interaction is derived. It is shown that the bit geometry affects the bit-rock interaction only through three dimensionless parameters. Depending on the value of these parameters the system can be stable or undergo forward or backward whirl.

  11. Model for the bit-rock interaction analysis

    NASA Astrophysics Data System (ADS)

    Palmov, Vladimir A.; Vetyukov, Yury M.

    2002-02-01

    In this report a model for drilling response of the so- called drag bits (or PDC bits) is presented. Forces acting on a single cutter are supposed to be known. Discrete and continuous cutters distribution over the bit surface are considered. Both lead to similar relations between the bit kinematics characteristics and the force factors acting on it. While the bit penetration rate into the rock is small, the force and the torque are shown to depend linearly on the ratio between the bit transitional and rotational velocities (the depth of cut per revolution). Particular cases of the bit shape are compared.

  12. On combining Laplacian and optimization-based mesh smoothing techniques

    SciTech Connect

    Freitag, L.A.

    1997-07-01

    Local mesh smoothing algorithms have been shown to be effective in repairing distorted elements in automatically generated meshes. The simplest such algorithm is Laplacian smoothing, which moves grid points to the geometric center of incident vertices. Unfortunately, this method operates heuristically and can create invalid meshes or elements of worse quality than those contained in the original mesh. In contrast, optimization-based methods are designed to maximize some measure of mesh quality and are very effective at eliminating extremal angles in the mesh. These improvements come at a higher computational cost, however. In this article the author proposes three smoothing techniques that combine a smart variant of Laplacian smoothing with an optimization-based approach. Several numerical experiments are performed that compare the mesh quality and computational cost for each of the methods in two and three dimensions. The author finds that the combined approaches are very cost effective and yield high-quality meshes.

  13. Anti-incendive coal cutter bits

    SciTech Connect

    Cheng, L.; Liebman, I.

    1981-11-09

    The invention is an improved cutter bit, useable with a material cutting mining machine, wherein the bit has an elongated shank portion which retains a cutting tip portion. The tip portion is enlarged in cross-section at its junction with the shank to partially mask the adjacent interface shank surface and thereby protect the shank from exposure at the point of impact. Two basic designs embody the invention. One is a mushroom shaped tip and the other is a dovetail tip/shank design.

  14. Shaft drill bit with overlapping cutter arrangement

    SciTech Connect

    Cunningham, R.A.; Pessier, R.C.

    1981-02-03

    An earth boring drill bit for large diameter shafts has an improved cutter arrangement. The drill bit has a cutter support member with a number of cutters mounted to it for disintegrating the earth formation face. At least one inner cutter is mounted near the center for cutting the center area. A number of gage cutters are mounted at the periphery to cut the gage area of the shaft. A number of intermediate cutters are spaced between the inner and gage cutters. Each intermediate cutter overlaps onehalf of its width with an adjacent intermediate cutter.

  15. Quantum bit commitment under Gaussian constraints

    NASA Astrophysics Data System (ADS)

    Mandilara, Aikaterini; Cerf, Nicolas J.

    2012-06-01

    Quantum bit commitment has long been known to be impossible. Nevertheless, just as in the classical case, imposing certain constraints on the power of the parties may enable the construction of asymptotically secure protocols. Here, we introduce a quantum bit commitment protocol and prove that it is asymptotically secure if cheating is restricted to Gaussian operations. This protocol exploits continuous-variable quantum optical carriers, for which such a Gaussian constraint is experimentally relevant as the high optical nonlinearity needed to effect deterministic non-Gaussian cheating is inaccessible.

  16. Protected Polycrystalline Diamond Compact Bits For Hard Rock Drilling

    SciTech Connect

    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.

  17. Bit-rate prediction for look-ahead coding with AVC

    NASA Astrophysics Data System (ADS)

    Beermann, Markus

    2004-01-01

    Compression of digitized video highly depends on, and varies with, the signal to be compressed. The relation of quantizer, distortion and rate needs to be modeled when control in a system involving video compression is asked for. An experimental analysis of the optimized video codec AVC of ITU-T and MPEG shows that its rate behavior can be modeled accurately enough to predict bit-rate on macroblock-level. Given information of allocated rates from a pre-encoding analysis step, the bit-rate profile at any different quantizer setting for the video can be predicted. Experiments, comparing predicted rate against actual encoding rate show good performance of the model.These reflect the performance of the model in rate-control schemes. A simple example pre-analysis rate-control based on the model will determine beforehand a possible rate-profile that the actual encoding should be able to follow with small quality variations. For a signal of varying complexity, a varying number of bits will be used to obtain constant quality. Such variations are limited by peak bit-rates and buffer-sizes that are defined by hypothetical reference decoders in AVC.

  18. Jet bit with onboard deviation means

    SciTech Connect

    Cherrington, M.D.

    1990-02-13

    This patent describes a directional drill bit utilizing pressurized fluid as a means for eroding earth in a forward path of said bit. It comprises: an elongate hollow body having a first proximal end and a first distal end, and having at least a rigid first section and at least a rigid second section. The first section and said second section being connected one to the other by a flexible joint positioned intermediately of said first section and said second section, with the combination of said first section, said flexible joint and said second section providing a conduit having lead-free annular sidewalls. The said combination thereby defining said elongate hollow body; a connecting means formed by said first proximal end for joining said elongated hollow body with an appropriate fluid conveyance means used to transport said pressurized fluid; a nozzle means borne by said first distal end. The nozzle means comprising a nozzle plate having at least one jet nozzle attached to and carried by said nozzle plate; and an articulation means. The articulation means being responsive to changes in fluid pressure and permitting a forward portion of said bit bearing said nozzle structure to change angular position with respect to an aft portion of the bit.

  19. 1 /N perturbations in superstring bit models

    NASA Astrophysics Data System (ADS)

    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.

  20. Security of quantum bit-string generation

    SciTech Connect

    Barrett, Jonathan; Massar, Serge

    2004-11-01

    We consider the cryptographic task of bit-string generation. This is a generalization of coin tossing in which two mistrustful parties wish to generate a string of random bits such that an honest party can be sure that the other cannot have biased the string too much. We consider a quantum protocol for this task, originally introduced in Phys. Rev. A 69, 022322 (2004), that is feasible with present day technology. We introduce security conditions based on the average bias of the bits and the Shannon entropy of the string. For each, we prove rigorous security bounds for this protocol in both noiseless and noisy conditions under the most general attacks allowed by quantum mechanics. Roughly speaking, in the absence of noise, a cheater can only bias significantly a vanishing fraction of the bits, whereas in the presence of noise, a cheater can bias a constant fraction, with this fraction depending quantitatively on the level of noise. We also discuss classical protocols for the same task, deriving upper bounds on how well a classical protocol can perform. This enables the determination of how much noise the quantum protocol can tolerate while still outperforming classical protocols. We raise several conjectures concerning both quantum and classical possibilities for large n cryptography. An experiment corresponding to the scheme analyzed in this paper has been performed and is reported elsewhere.

  1. REVERSIBLE N-BIT TO N-BIT INTEGER HAAR-LIKE TRANSFORMS

    SciTech Connect

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

    2004-07-26

    We introduce TLHaar, an n-bit to n-bit reversible transform similar to the S-transform. TLHaar uses lookup tables that approximate the S-transform, but reorder the coefficients so they fit into n bits. TLHaar is suited for lossless compression in fixed-width channels, such as digital video channels and graphics hardware frame buffers. Tests indicate that when the incoming image data has lines or hard edges TLHaar coefficients compress better than S-transform coefficients. For other types of image data TLHaar coefficients compress up to 2.5% worse than those of the S-transform, depending on the data and the compression method used.

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

    NASA Astrophysics Data System (ADS)

    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.

  3. Spectrum allocations above 40 GHz

    NASA Technical Reports Server (NTRS)

    Katzenstein, W. E.; Moore, R. P.; Kimball, H. G.

    1981-01-01

    The 1979 World Administrative Radio Conference (WARC-79) revised the International Table of Frequency Allocations to reflect increased interest and activity in the region of the EM spectrum above 40 GHz. The total width of the spectrum allocated (235 GHz) in the region above 40 GHz indicates the extent of this new spectrum resource, made accessible by advances in the state-of-the-art of telecommunications equipment. There are some striking differences between the approach to allocation above and below 40 GHz. For example, there are not bands allocated exclusively. This reflects the characteristics of propagation and the small antenna beamwidths achievable at these frequencies. Attention is given to atmospheric window and absorption band limits, allocations to satellite services, allocations to scientific services, allocations to terrestrial services, the future refinement of the radio regulations above 40 GHz, and allocations of WARC-79 and frequency management.

  4. Economics of spectrum allocation

    NASA Astrophysics Data System (ADS)

    Melody, W. H.

    The effective and efficient allocation and use of the spectrum can be ensured only by a set of sharing rules that will reflect the interests, values, and power of all affected parties. What is now happening is that the new interests and different values of the developing countries are pressing to change the international sharing rules established by a small group of high-technology nations. It is noted that the latter have established a massive telecommunications infrastructure on the basis of inherited sharing rules that reflect only their interests and a much simplified scarcity problem. Once long-term goals and underlying principles of allocation are established, communication technologies and markets can be directed, through a series of adjustment policies, to achieve them. A crucial first step in the creation of an international information environment in which 'free' flows will be balanced flows is the establishment of a balanced and equitable set of sharing rules for the radio spectrum.

  5. Myrmics Memory Allocator

    Energy Science and Technology Software Center (ESTSC)

    2011-09-23

    MMA is a stand-alone memory management system for MPI clusters. It implements a shared Partitioned Global Address Space, where multiple MPI processes request objects from the allocator and the latter provides them with system-wide unique memory addresses for each object. It provides applications with an intuitive way of managing the memory system in a unified way, thus enabling easier writing of irregular application code.

  6. Earth boring bit with eccentric seal boss

    SciTech Connect

    Helmick, J.E.

    1981-07-21

    A rolling cone cutter earth boring bit is provided with a sealing system that results in the seal being squeezed uniformly around the seal circumference during drilling. The bearing pin seal surface is machined eccentrically to the bearing pin by an amount equal to the radial clearance of the bearing. The bearing pin seal surface is machined about an axis that is offset from the central axis of the bearing pin in the direction of the unloaded side of the bearing pin. When the bit is drilling and the bearing pin is loaded the seal will run on an axis concentric with the axis of the seal surfaces of the bearing pin and the rolling cutter and will see uniform squeeze around its circumference.

  7. Time-dependent study of bit reset

    NASA Astrophysics Data System (ADS)

    Chiuchiú, D.

    2015-02-01

    In its most conservative formulation, the Landauer principle states that at least k_BT\\ln2 of heat must be produced to reset one bit. Theoretical derivations of this result for practical systems require complex mathematical tools; additionally, real experiments are sophisticated and sensitive. In the literature, it's then common practice to look for a global heat production of k_BT\\ln2 without further concern for heat exchanges at intermediate times. In this paper we want to recover such kind of description: we take a Brownian particle that moves in a bistable potential as bit. We then consider a reset protocol with a net heat production of k_BT\\ln{2} and study the time evolution of internal energy, work and heat. In particular, we show that these quantities are fully characterized by the changes that the protocol induces over the wells of the bistable potential.

  8. Attention allocation before antisaccades.

    PubMed

    Klapetek, Anna; Jonikaitis, Donatas; Deubel, Heiner

    2016-01-01

    In the present study, we investigated the distribution of attention before antisaccades. We used a dual task paradigm, in which participants made prosaccades or antisaccades and discriminated the orientation of a visual probe shown at the saccade goal, the visual cue location (antisaccade condition), or a neutral location. Moreover, participants indicated whether they had made a correct antisaccade or an erroneous prosaccade. We observed that, while spatial attention in the prosaccade task was allocated only to the saccade goal, attention in the antisaccade task was allocated both to the cued location and to the antisaccade goal. This suggests parallel attentional selection of the cued and antisaccade locations. We further observed that in error trials--in which participants made an incorrect prosaccade instead of an antisaccade--spatial attention was biased towards the prosaccade goal. These erroneous prosaccades were mostly unnoticed and were often followed by corrective antisaccades with very short latencies (<100 ms). Data from error trials therefore provide further evidence for the parallel programming of the reflexive prosaccade to the cue and the antisaccade to the intended location. Taken together, our results suggest that attention allocation and saccade goal selection in the antisaccade task are mediated by a common competitive process. PMID:26790843

  9. Cosmic Ray Induced Bit-Flipping Experiment

    NASA Astrophysics Data System (ADS)

    Pu, Ge; Callaghan, Ed; Parsons, Matthew; Cribflex Team

    2015-04-01

    CRIBFLEX is a novel approach to mid-altitude observational particle physics intended to correlate the phenomena of semiconductor bit-flipping with cosmic ray activity. Here a weather balloon carries a Geiger counter and DRAM memory to various altitudes; the data collected will contribute to the development of memory device protection. We present current progress toward initial flight and data acquisition. This work is supported by the Society of Physics Students with funding from a Chapter Research Award.

  10. Software Operates On Bit-Map Images

    NASA Technical Reports Server (NTRS)

    Choi, Diana

    1992-01-01

    PIXTOOLS is software for Silicon Graphics IRIS consisting of thirteen programs plus library for operating on bit-map images. Enables user to create, edit, and save high-resolution images in forms in which displayed on video screens, resize them, and capture them. Eleven programs print information and read and write files. Two offer graphical interfaces. Menus enable manipulation of images and background color and saving of an image screen to file. Written in C.

  11. NSC 800, 8-bit CMOS microprocessor

    NASA Technical Reports Server (NTRS)

    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.

  12. Junk basket, bit and reamer stabilizer

    SciTech Connect

    Garrett, W.R.

    1980-08-19

    A metal cup with an apertured bottom provides a junk basket. The cup is spindled on the pin of a drill bit, e.g., a tungsten carbide insert roller cone bit, the bottom edge being releasably clamped between the pin shoulder and the shoulder formed by the mouth of the box on the member forming the lower end of the drill stem, e.g., a roller reamer. The connection between the pin and box and cup form a rotary shouldered connection, the pin shoulder and/or box mouth being cut back providing a longer pin neck or shallower box to accommodate the cup. Every time the bit is removed from the stem, the interiorly upwardly flaring cup is automatically dumped. In a modification, especially for small diameter holes, in order to provide space for junk to move both up outside the cup and down into the cup, the box on the adjacent drill stem member can be fluted, e.g., with arcuate vertical section milled slots extending from above to below the rim of the cup to provide entrance for junk, so maximum exterior annulus space is left for upflow of junk; alternatively the cup aperture can be eccentric, so the space around the outside of the cup is large at one sector and the space around the box inside the cup is large at the opposite sector.

  13. An Optical Bit-Counting Algorithm

    NASA Technical Reports Server (NTRS)

    Mack, Marilyn; Lapir, Gennadi M.; Berkovich, Simon

    2000-01-01

    This paper addresses the omnipresent problem of counting bits - an operation discussed since the very early stages of the establishing of computer science. The need for a quick bit-counting method acquires a special significance with the proliferation of search engines on the Internet. It arises in several other computer applications. This is especially true in information retrieval in which an array of binary vectors is used to represent a characteristic function (CF) of a set of qualified documents. The number of "I"s in the CF equals the cardinality of the set. The process of repeated evaluations of this cardinality is a pivotal point in choosing a rational strategy for deciding whether to constrain or broaden the search criteria to ensure selection of the desired items. Another need for bit-counting occurs when trying to determine the differences between given files, (images or text), in terms of the Hamming distance. An Exclusive OR operation applied to a pair of files results in a binary vector array of mismatches that must be counted.

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

    NASA Technical Reports Server (NTRS)

    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

  15. Synaptic Tagging During Memory Allocation

    PubMed Central

    Rogerson, Thomas; Cai, Denise; Frank, Adam; Sano, Yoshitake; Shobe, Justin; Aranda, Manuel L.; Silva, Alcino J.

    2014-01-01

    There is now compelling evidence that the allocation of memory to specific neurons (neuronal allocation) and synapses (synaptic allocation) in a neurocircuit is not random and that instead specific mechanisms, such as increases in neuronal excitability and synaptic tagging and capture, determine the exact sites where memories are stored. We propose an integrated view of these processes, such that neuronal allocation, synaptic tagging and capture, spine clustering and metaplasticity reflect related aspects of memory allocation mechanisms. Importantly, the properties of these mechanisms suggest a set of rules that profoundly affect how memories are stored and recalled. PMID:24496410

  16. 50 CFR 660.323 - Pacific whiting allocations, allocation attainment, and inseason allocation reapportionment.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... 50 Wildlife and Fisheries 9 2010-10-01 2010-10-01 false Pacific whiting allocations, allocation...) FISHERIES OFF WEST COAST STATES West Coast Groundfish Fisheries § 660.323 Pacific whiting allocations... amounts that will be harvested, or a combination of the two. Estimates of the amount of Pacific...

  17. Holography optical memory recorded with error correcting bits

    NASA Astrophysics Data System (ADS)

    Song, J. H.; Moon, I.; Lee, Y. H.

    2014-06-01

    A novel error correction method is proposed for volume holographic memory systems. In this method the information of two adjacent binary bits is recorded in the space between the two bits, which is used to correct the errors in the data bits. The new method is compared with (15, 5) Reed—Solomon code using the same redundancy of 200% as ours. It is shown that the new method achieves the similar bit error rate as the RS code.

  18. Lathe tool bit and holder for machining fiberglass materials

    NASA Technical Reports Server (NTRS)

    Winn, L. E. (Inventor)

    1972-01-01

    A lathe tool and holder combination for machining resin impregnated fiberglass cloth laminates is described. The tool holder and tool bit combination is designed to accommodate a conventional carbide-tipped, round shank router bit as the cutting medium, and provides an infinite number of cutting angles in order to produce a true and smooth surface in the fiberglass material workpiece with every pass of the tool bit. The technique utilizes damaged router bits which ordinarily would be discarded.

  19. Method to manufacture bit patterned magnetic recording media

    SciTech Connect

    Raeymaekers, Bart; Sinha, Dipen N

    2014-05-13

    A method to increase the storage density on magnetic recording media by physically separating the individual bits from each other with a non-magnetic medium (so-called bit patterned media). This allows the bits to be closely packed together without creating magnetic "cross-talk" between adjacent bits. In one embodiment, ferromagnetic particles are submerged in a resin solution, contained in a reservoir. The bottom of the reservoir is made of piezoelectric material.

  20. Laboratory and field testing of improved geothermal rock bits

    SciTech Connect

    Hendrickson, R.R.; Jones, A.H.; Winzenried, R.W.; Maish, A.B.

    1980-07-01

    The development and testing of 222 mm (8-3/4 inch) unsealed, insert type, medium hard formation, high-temperature bits are described. The new bits were fabricated by substituting improved materials in critical bit components. These materials were selected on bases of their high temperature properties, machinability, and heat treatment response. Program objectives required that both machining and heat treating could be accomplished with existing rock bit production equipment. Two types of experimental bits were subjected to laboratory air drilling tests at 250/sup 0/C (482/sup 0/F) in cast iron. These tests indicated field testing could be conducted without danger to the hole, and that bearing wear would be substantially reduced. Six additional experimental bits, and eight conventional bits were then subjected to air drilling a 240/sup 0/C (464/sup 0/F) in Francisan Graywacke at The Geysers, CA. The materials selected improved roller wear by 200%, friction-pin wear by 150%, and lug wear by 150%. Geysers drilling performances compared directly to conventional bits indicate that in-gage drilling life was increased by 70%. All bits at The Geysers are subjected to reaming out-of-gage hole prior to drilling. Under these conditions the experimental bits showed a 30% increase in usable hole over the conventional bits. These tests demonstrated a potential well cost reduction of 4 to 8%. Savings of 12% are considered possible with drilling procedures optimized for the experimental bits.

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

    SciTech Connect

    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.

  2. An Optimization-based Atomistic-to-Continuum Coupling Method

    DOE PAGESBeta

    Olson, Derek; Bochev, Pavel B.; Luskin, Mitchell; Shapeev, Alexander V.

    2014-08-21

    In this paper, we present a new optimization-based method for atomistic-to-continuum (AtC) coupling. The main idea is to cast the latter as a constrained optimization problem with virtual Dirichlet controls on the interfaces between the atomistic and continuum subdomains. The optimization objective is to minimize the error between the atomistic and continuum solutions on the overlap between the two subdomains, while the atomistic and continuum force balance equations provide the constraints. Separation, rather then blending of the atomistic and continuum problems, and their subsequent use as constraints in the optimization problem distinguishes our approach from the existing AtC formulations. Finally,more » we present and analyze the method in the context of a one-dimensional chain of atoms modeled using a linearized two-body potential with next-nearest neighbor interactions.« less

  3. An Optimization-based Atomistic-to-Continuum Coupling Method

    SciTech Connect

    Olson, Derek; Bochev, Pavel B.; Luskin, Mitchell; Shapeev, Alexander V.

    2014-08-21

    In this paper, we present a new optimization-based method for atomistic-to-continuum (AtC) coupling. The main idea is to cast the latter as a constrained optimization problem with virtual Dirichlet controls on the interfaces between the atomistic and continuum subdomains. The optimization objective is to minimize the error between the atomistic and continuum solutions on the overlap between the two subdomains, while the atomistic and continuum force balance equations provide the constraints. Separation, rather then blending of the atomistic and continuum problems, and their subsequent use as constraints in the optimization problem distinguishes our approach from the existing AtC formulations. Finally, we present and analyze the method in the context of a one-dimensional chain of atoms modeled using a linearized two-body potential with next-nearest neighbor interactions.

  4. An Optimality-Based Fully-Distributed Watershed Ecohydrological Model

    NASA Astrophysics Data System (ADS)

    Chen, L., Jr.

    2015-12-01

    Watershed ecohydrological models are essential tools to assess the impact of climate change and human activities on hydrological and ecological processes for watershed management. Existing models can be classified as empirically based model, quasi-mechanistic and mechanistic models. The empirically based and quasi-mechanistic models usually adopt empirical or quasi-empirical equations, which may be incapable of capturing non-stationary dynamics of target processes. Mechanistic models that are designed to represent process feedbacks may capture vegetation dynamics, but often have more demanding spatial and temporal parameterization requirements to represent vegetation physiological variables. In recent years, optimality based ecohydrological models have been proposed which have the advantage of reducing the need for model calibration by assuming critical aspects of system behavior. However, this work to date has been limited to plot scale that only considers one-dimensional exchange of soil moisture, carbon and nutrients in vegetation parameterization without lateral hydrological transport. Conceptual isolation of individual ecosystem patches from upslope and downslope flow paths compromises the ability to represent and test the relationships between hydrology and vegetation in mountainous and hilly terrain. This work presents an optimality-based watershed ecohydrological model, which incorporates lateral hydrological process influence on hydrological flow-path patterns that emerge from the optimality assumption. The model has been tested in the Walnut Gulch watershed and shows good agreement with observed temporal and spatial patterns of evapotranspiration (ET) and gross primary productivity (GPP). Spatial variability of ET and GPP produced by the model match spatial distribution of TWI, SCA, and slope well over the area. Compared with the one dimensional vegetation optimality model (VOM), we find that the distributed VOM (DisVOM) produces more reasonable spatial

  5. Multi-Bit Nano-Electromechanical Nonvolatile Memory Cells (Zigzag T Cells) for the Suppression of Bit-to-Bit Interference.

    PubMed

    Choi, Woo Young; Han, Jae Hwan; Cha, Tae Min

    2016-05-01

    Multi-bit nano-electromechanical (NEM) nonvolatile memory cells such as T cells were proposed for higher memory density. However, they suffered from bit-to-bit interference (BI). In order to suppress BI without sacrificing cell size, this paper proposes zigzag T cell structures. The BI suppression of the proposed zigzag T cell is verified by finite-element modeling (FEM). Based on the FEM results, the design of zigzag T cells is optimized. PMID:27483893

  6. Telescope Time Allocation Tool

    NASA Astrophysics Data System (ADS)

    Alves, J.

    2005-03-01

    TaToo is ESO's new Time Allocation Tool. This software scheduler is a combination of a user-friendly graphical user interface and an intelligent constraint-programming engine fine-tuned to ESO's scheduling problem. TaToo is able to produce a high quality and reliable schedule taking into consideration all constraints of the recommended programs for all telescopes in about 15 minutes. This performance allows schedulers at ESO-VISAS to simulate and evaluate different scenarios, optimize the scheduling of engineering activities at the observatories, and in the end construct the most science efficient schedule possible.

  7. [Organ allocation. Ethical issues].

    PubMed

    Cattorini, P

    2010-01-01

    The criteria for allocating organs are one of the most debated ethical issue in the transplantation programs. The article examines some rules and principles followed by "Nord Italia Transplant program", summarized in its Principles' Charter and explained in a recent interdisciplinary book. General theories of justice and their application to individual clinical cases are commented and evaluated, in order to foster a public, democratic, transparent debate among professionals and citizens, scientific associations and customers' organizations. Some specific moral dilemmas are focused regarding the concepts of proportionate treatment, unselfish donation by living persons, promotion of local institutions efficiency. PMID:20677677

  8. Modeling micro-electronics drill bit behavior with ABAQUS Standard

    SciTech Connect

    Anderson, C.A.; Ricketson, E.

    1997-06-01

    Modeling of drill bit behavior under applied forces as well as modeling of the drilling process itself can aid in the understanding of the relative importance of the various drill bit process parameters and can eventually lead to improved drill bit designs. In this paper the authors illustrate the application of ABAQUS Standard to the stress and deformation analysis of micro-electronics drill bits that are used in manufacturing printed circuit boards. Effects of varying point geometry, web taper and flute length on the stress and deformation in a drill bit are illustrated.

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

    PubMed

    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. PMID:26636023

  10. Error correction using a bit redundancy

    NASA Astrophysics Data System (ADS)

    Schweikert, Robert; Dolainsky, Frank; Foerster, Hans Peter; Vinck, Adrianus Johannes

    1989-11-01

    Communication satellite systems are featuring increased use of channel coding methods for error correction. This paper describes a procedure which uses only one bit redundancy. Decoding this code is extremely simple and permits a significant reduction in requisite transmission capacity. The code is particularly useful where high transmission speeds are needed. The structure of the code is well suited for realizing decoder installations with an application-specific, integrated circuit. The VLSI design for a CMOS-gate-array for such a realization is discussed. Concatenated with other codes, the present code leads to significant hardware savings; an example concatenation with the Reed-Solomon code is shown.

  11. Cosmic Ray Induced Bit-Flipping Experiment

    NASA Astrophysics Data System (ADS)

    Callaghan, Edward; Parsons, Matthew

    2015-04-01

    CRIBFLEX is a novel approach to mid-altitude observational particle physics intended to correlate the phenomena of semiconductor bit-flipping with cosmic ray activity. Here a weather balloon carries a Geiger counter and DRAM memory to various altitudes; the data collected will contribute to the development of memory device protection. We present current progress toward initial flight and data acquisition. This work is supported by the Society of Physics Students with funding from a Chapter Research Award. Supported by a Society of Physics Students Chapter Research Award.

  12. Computationally efficient control allocation

    NASA Technical Reports Server (NTRS)

    Durham, Wayne (Inventor)

    2001-01-01

    A computationally efficient method for calculating near-optimal solutions to the three-objective, linear control allocation problem is disclosed. The control allocation problem is that of distributing the effort of redundant control effectors to achieve some desired set of objectives. The problem is deemed linear if control effectiveness is affine with respect to the individual control effectors. The optimal solution is that which exploits the collective maximum capability of the effectors within their individual physical limits. Computational efficiency is measured by the number of floating-point operations required for solution. The method presented returned optimal solutions in more than 90% of the cases examined; non-optimal solutions returned by the method were typically much less than 1% different from optimal and the errors tended to become smaller than 0.01% as the number of controls was increased. The magnitude of the errors returned by the present method was much smaller than those that resulted from either pseudo inverse or cascaded generalized inverse solutions. The computational complexity of the method presented varied linearly with increasing numbers of controls; the number of required floating point operations increased from 5.5 i, to seven times faster than did the minimum-norm solution (the pseudoinverse), and at about the same rate as did the cascaded generalized inverse solution. The computational requirements of the method presented were much better than that of previously described facet-searching methods which increase in proportion to the square of the number of controls.

  13. New Mechanisms of rock-bit wear in geothermal wells

    SciTech Connect

    Macini, Paolo

    1996-01-24

    This paper presents recent results of an investigation on failure mode and wear of rock-bits used to drill geothermal wells located in the area of Larderello (Italy). A new wear mechanism, conceived from drilling records and dull bit evaluation analysis, has been identified and a particular configuration of rock-bit has been developed and tested in order to reduce drilling costs. The role of high Bottom Hole Temperature (BHT) on rock-bit performances seems not yet very well understood: so far, only drillability and formation abrasiveness are generally considered to account for poor drilling performances. In this paper, the detrimental effects of high BHT on sealing and reservoir system of Friction Bearing Rock-bits (FBR) have been investigated, and a new bearing wear pattern for FBR's run in high BHT holes has been identified and further verified via laboratory inspections on dull bits. A novel interpretation of flat worn cutting structure has been derived from the above wear pattern, suggesting the design of a particular bit configuration. Test bits, designed in the light of the above criteria, have been prepared and field tested successfully. The paper reports the results of these tests, which yielded a new rock-bit application, today considered as a standad practice in Italian geothermal fields. This application suggests that the correct evaluation of rock-bit wear can help to improve the overall drilling performances and to minimize drilling problems through a better interpretation of the relationships amongst rock-bits, formation properties and downhole temperature.

  14. Popularity-aware rate allocation in multiview video

    NASA Astrophysics Data System (ADS)

    Fiandrotti, Attilio; Chakareski, Jacob; Frossard, Pascal

    2010-07-01

    We propose a framework for popularity-driven rate allocation in H.264/MVC-based multi-view video communications when the overall rate and the rate necessary for decoding each view are constrained in the delivery architecture. We formulate a rate allocation optimization problem that takes into account the popularity of each view among the client population and the rate-distortion characteristics of the multi-view sequence so that the performance of the system is maximized in terms of popularity-weighted average quality. We consider the cases where the global bit budget or the decoding rate of each view is constrained. We devise a simple ratevideo- quality model that accounts for the characteristics of interview prediction schemes typical of multi-view video. The video quality model is used for solving the rate allocation problem with the help of an interior point optimization method. We then show through experiments that the proposed rate allocation scheme clearly outperforms baseline solutions in terms of popularity-weighted video quality. In particular, we demonstrate that the joint knowledge of the rate-distortion characteristics of the video content, its coding dependencies, and the popularity factor of each view is key in achieving good coding performance in multi-view video systems.

  15. Object tracking based on bit-planes

    NASA Astrophysics Data System (ADS)

    Li, Na; Zhao, Xiangmo; Liu, Ying; Li, Daxiang; Wu, Shiqian; Zhao, Feng

    2016-01-01

    Visual object tracking is one of the most important components in computer vision. The main challenge for robust tracking is to handle illumination change, appearance modification, occlusion, motion blur, and pose variation. But in surveillance videos, factors such as low resolution, high levels of noise, and uneven illumination further increase the difficulty of tracking. To tackle this problem, an object tracking algorithm based on bit-planes is proposed. First, intensity and local binary pattern features represented by bit-planes are used to build two appearance models, respectively. Second, in the neighborhood of the estimated object location, a region that is most similar to the models is detected as the tracked object in the current frame. In the last step, the appearance models are updated with new tracking results in order to deal with environmental and object changes. Experimental results on several challenging video sequences demonstrate the superior performance of our tracker compared with six state-of-the-art tracking algorithms. Additionally, our tracker is more robust to low resolution, uneven illumination, and noisy video sequences.

  16. Research on allocation efficiency of the daisy chain allocation algorithm

    NASA Astrophysics Data System (ADS)

    Shi, Jingping; Zhang, Weiguo

    2013-03-01

    With the improvement of the aircraft performance in reliability, maneuverability and survivability, the number of the control effectors increases a lot. How to distribute the three-axis moments into the control surfaces reasonably becomes an important problem. Daisy chain method is simple and easy to be carried out in the design of the allocation system. But it can not solve the allocation problem for entire attainable moment subset. For the lateral-directional allocation problem, the allocation efficiency of the daisy chain can be directly measured by the area of its subset of attainable moments. Because of the non-linear allocation characteristic, the subset of attainable moments of daisy-chain method is a complex non-convex polygon, and it is difficult to solve directly. By analyzing the two-dimensional allocation problems with a "micro-element" idea, a numerical calculation algorithm is proposed to compute the area of the non-convex polygon. In order to improve the allocation efficiency of the algorithm, a genetic algorithm with the allocation efficiency chosen as the fitness function is proposed to find the best pseudo-inverse matrix.

  17. Progress in the Advanced Synthetic-Diamond Drill Bit Program

    SciTech Connect

    Glowka, D.A.; Dennis, T.; Le, Phi; Cohen, J.; Chow, J.

    1995-11-01

    Cooperative research is currently underway among five drill bit companies and Sandia National Laboratories to improve synthetic-diamond drill bits for hard-rock applications. This work, sponsored by the US Department of Energy and individual bit companies, is aimed at improving performance and bit life in harder rock than has previously been possible to drill effectively with synthetic-diamond drill bits. The goal is to extend to harder rocks the economic advantages seen in using synthetic-diamond drill bits in soft and medium rock formations. Four projects are being conducted under this research program. Each project is investigating a different area of synthetic diamond bit technology that builds on the current technology base and market interests of the individual companies involved. These projects include: optimization of the PDC claw cutter; optimization of the Track-Set PDC bit; advanced TSP bit development; and optimization of impregnated-diamond drill bits. This paper describes the progress made in each of these projects to date.

  18. Strategies for Model Reduction: Comparing Different Optimal Bases.

    NASA Astrophysics Data System (ADS)

    Crommelin, D. T.; Majda, A. J.

    2004-09-01

    Several different ways of constructing optimal bases for efficient dynamical modeling are compared: empirical orthogonal functions (EOFs), optimal persistence patterns (OPPs), and principal interaction patterns (PIPs). Past studies on fluid-dynamical topics have pointed out that EOF-based models can have difficulties reproducing behavior dominated by irregular transitions between different dynamical states. This issue is addressed in a geophysical context, by assessing the ability of these strategies for efficient dynamical modeling to reproduce the chaotic regime transitions in a simple atmosphere model. The atmosphere model is the well-known Charney DeVore model, a six-dimensional truncation of the equations describing barotropic flow over topography in a β-plane channel geometry. This model is able to generate regime transitions for well-chosen parameter settings. The models based on PIPs are found to be superior to the EOF- and OPP-based models, in spite of some undesirable sensitivities inherent to the PIP method.


  19. Impossibility of Growing Quantum Bit Commitments

    NASA Astrophysics Data System (ADS)

    Winkler, Severin; Tomamichel, Marco; Hengl, Stefan; Renner, Renato

    2011-08-01

    Quantum key distribution (QKD) is often, more correctly, called key growing. Given a short key as a seed, QKD enables two parties, connected by an insecure quantum channel, to generate a secret key of arbitrary length. Conversely, no key agreement is possible without access to an initial key. Here, we consider another fundamental cryptographic task, commitments. While, similar to key agreement, commitments cannot be realized from scratch, we ask whether they may be grown. That is, given the ability to commit to a fixed number of bits, is there a way to augment this to commitments to strings of arbitrary length? Using recently developed information-theoretic techniques, we answer this question in the negative.

  20. Second quantization in bit-string physics

    NASA Technical Reports Server (NTRS)

    Noyes, H. Pierre

    1993-01-01

    Using a new fundamental theory based on bit-strings, a finite and discrete version of the solutions of the free one particle Dirac equation as segmented trajectories with steps of length h/mc along the forward and backward light cones executed at velocity +/- c are derived. Interpreting the statistical fluctuations which cause the bends in these segmented trajectories as emission and absorption of radiation, these solutions are analogous to a fermion propagator in a second quantized theory. This allows us to interpret the mass parameter in the step length as the physical mass of the free particle. The radiation in interaction with it has the usual harmonic oscillator structure of a second quantized theory. How these free particle masses can be generated gravitationally using the combinatorial hierarchy sequence (3,10,137,2(sup 127) + 136), and some of the predictive consequences are sketched.

  1. Single Abrikosov vortices as quantized information bits

    NASA Astrophysics Data System (ADS)

    Golod, T.; Iovan, A.; Krasnov, V. M.

    2015-10-01

    Superconducting digital devices can be advantageously used in future supercomputers because they can greatly reduce the dissipation power and increase the speed of operation. Non-volatile quantized states are ideal for the realization of classical Boolean logics. A quantized Abrikosov vortex represents the most compact magnetic object in superconductors, which can be utilized for creation of high-density digital cryoelectronics. In this work we provide a proof of concept for Abrikosov-vortex-based random access memory cell, in which a single vortex is used as an information bit. We demonstrate high-endurance write operation and two different ways of read-out using a spin valve or a Josephson junction. These memory cells are characterized by an infinite magnetoresistance between 0 and 1 states, a short access time, a scalability to nm sizes and an extremely low write energy. Non-volatility and perfect reproducibility are inherent for such a device due to the quantized nature of the vortex.

  2. Drag drill bit having improved arrangement of cutting elements

    SciTech Connect

    Deane, J.D.

    1989-07-18

    This patent describes a rotary drill bit of the drag type for drilling a bore hole in an earth formation. The generally cylindrical bit body having a fluid passage therein adapted to be connected to a drill string for rotation therewith about a longitudinal axis and to receive drilling fluid from the drillstring; blades on the bit body extending in a generally spiral pattern from adjacent the center of the bit body to the outer periphery thereof and separated from each other by deep groves; each blade having a curved leading side with respect to the direction of rotation extending generally to the outer periphery of the generally cylindrical bit body, a curved trailing side spaced from the leading side, and an outer surface connecting the leading and trailing sides to define the lower surface and crown of the bit body. The surface providing a relatively long length mounting area thereon for cutting elements.

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

    NASA Astrophysics Data System (ADS)

    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.

  4. Effect of image bit depth on target acquisition modeling

    NASA Astrophysics Data System (ADS)

    Teaney, Brian P.; Reynolds, Joseph P.

    2008-04-01

    The impact of bit depth on human in the loop recognition and identification performance is of particular importance when considering trade-offs between resolution and band-width of sensor systems. This paper presents the results from two perception studies designed to measure the effects of quantization and finite bit depth on target acquisition performance. The results in this paper allow for the inclusion of limited bit depth and quantization as an additional noise term in NVESD sensor performance models.

  5. Sealed and lubricated rock bit with air protected seal ring

    SciTech Connect

    Galle, E.M.

    1983-03-01

    An earth boring rock bit having a sealed bearing and pressure lubrication system for drilling the earth with air or gas as the circulating medium. An annular groove is formed in the vicinity of the seal and connected to the interior of the bit for cooling the ring and cleaning debris from the area of the ring. The air pressure inside the bit is utilized to bias a movable element in the system to urge lubricant to the bearing.

  6. Cooling system for cooling the bits of a cutting machine

    SciTech Connect

    Wrulich, H.; Gekle, S.; Schetina, O.; Zitz, A.

    1984-06-26

    The invention refers to a system for cooling the bits of a cutting machine and comprising a nozzle for the cooling water to be ejected under pressure, said nozzle being arranged at the area of the bit, the water supply to said nozzle being closable by means of a shutoff valve and the bit being supported on the bit holder for limited axial shifting movement under the action of the cutting pressure against the force of a spring and against the hydraulic pressure of the cooling water and the shutoff valve being coupled with the bit by means of a coupling member such that the shutoff valve is opened on shifting movement of the bit in direction of the cutting pressure. In this system the arrangement is such that the bit (6) has in a manner known per se the shape of a cap and is enclosing a bit shaft (3) adapted to be inserted into the bit holder (1), in that the cap-shaped bit (6) is supported on the shaft (3) for shifting movement in axial direction and in that the shutoff valve (11) and the coupling member (10) are arranged within the bit shaft (3). The coupling member is formed of a push rod (10) acting on the closure member (11) of the valve, said push rod being guided within a central bore (9) of the bit shaft and the closure member (11) closing the valve in opposite direction to the action of the cutting pressure and being moved in open position by the push rod (10) in direction of the acting cutting pressure.

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

    SciTech Connect

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

    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.

  8. Continuous operation of high bit rate quantum key distribution

    NASA Astrophysics Data System (ADS)

    Dixon, A. R.; Yuan, Z. L.; Dynes, J. F.; Sharpe, A. W.; Shields, A. J.

    2010-04-01

    We demonstrate a quantum key distribution with a secure bit rate exceeding 1 Mbit/s over 50 km fiber averaged over a continuous 36 h period. Continuous operation of high bit rates is achieved using feedback systems to control path length difference and polarization in the interferometer and the timing of the detection windows. High bit rates and continuous operation allows finite key size effects to be strongly reduced, achieving a key extraction efficiency of 96% compared to keys of infinite lengths.

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

    SciTech Connect

    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.

  10. New PDC bit design increased penetration rate in slim wells

    SciTech Connect

    Gerbaud, L.; Sellami, H.; Lamine, E.; Sagot, A.

    1997-07-01

    This paper describes slim hole bit design developed at the Paris School of Mines and Security DBS. The design is a compromise between several criteria such as drilling efficiency, uniform wear distribution around the bit face and low level of vibration of the bit, according to the hole diameter and the formation characteristics. Two new bits were manufactured and run successfully in a full scale drilling test bench and in field test in Gabon. The result show improvement of the drilling performances in slimhole application.

  11. Improved seal for geothermal drill bit. Final technical report

    SciTech Connect

    Evans, R.F.

    1984-07-06

    Each of the two field test bits showed some promise though their performances were less than commercially acceptable. The Ohio test bit ran just over 3000 feet where about 4000 is considered a good run but it was noted that a Varel bit of the same type having a standard O ring seal was completely worn out after 8-1/2 hours (1750 feet drilled). The Texas test bit had good seal-bearing life but was the wrong cutting structure type for the formation being drilled and the penetration rate was low.

  12. Quantum bit commitment with cheat sensitive binding and approximate sealing

    NASA Astrophysics Data System (ADS)

    Li, Yan-Bing; Xu, Sheng-Wei; Huang, Wei; Wan, Zong-Jie

    2015-04-01

    This paper proposes a cheat-sensitive quantum bit commitment scheme based on single photons, in which Alice commits a bit to Bob. Here, Bob’s probability of success at cheating as obtains the committed bit before the opening phase becomes close to \\frac{1}{2} (just like performing a guess) as the number of single photons used is increased. And if Alice alters her committed bit after the commitment phase, her cheating will be detected with a probability that becomes close to 1 as the number of single photons used is increased. The scheme is easy to realize with present day technology.

  13. Core bit design reduces mud invasion, improves ROP

    SciTech Connect

    Clydesdale, G. ); Leseultre, A.; Lamine, E. )

    1994-08-08

    A recently developed core bit reduces fluid invasion in the cut core by minimizing the exposure to the drilling fluid and by increasing the rate of penetration (ROP). A high ROP during coring is one of the major factors in reducing mud filtrate invasion in cores. This new low-invasion polycrystalline diamond compact (PDC) core bit was designed to achieve a higher ROP than conventional PDC core bits without detriment to the cutting structure. The paper describes the bit and its operation, results of lab tests, fluid dynamics, and results of field tests.

  14. The Behavior of Free Riders in Bit Torrent Networks

    NASA Astrophysics Data System (ADS)

    Zghaibeh, Manaf; Anagnostakis, Kostas G.; Harmantzis, Fotios C.

    In this chapter we report on the results of two large-scale measurement studies on BitTorrent. We focus on identifying he strategic behavior of users in response to the incentives that are embedded in the design of BitTorrent. Our results regarding the first study that was performed in year 2005 illustrate a gap between what system designers and researchers expect from users in reaction to the provided incentives, and how users react to them. In particular, we divide users in BitTorrent into four classes based on their interactions with the system. We also provide a measurement of free riders' volume in the BitTorrent environment.

  15. Détection homodyne pour mémoires holographiques à stockage bit à bit

    NASA Astrophysics Data System (ADS)

    Maire, G.; Pauliat, G.; Roosen, G.

    2006-10-01

    Les mémoires holographiques à stockage bit à bit sont une alternative intéressante à l'approche holographique conventionnelle par pages de données du fait de leur architecture optique simplifiée. Nous proposons et validons ici une procédure de lecture adaptée à de telles mémoires et basée sur une détection homodyne de l'amplitude diffractée par les hologrammes. Ceci permet d'augmenter la quantité de signal utile détecté et s'avère donc prometteur pour accroître le taux de transfert de données de ces mémoires.

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

    SciTech Connect

    Borges, Raymond; Patton, Robert M; Kettani, Houssain; Masalmah, Yahya

    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.

  17. High density bit transition requirements versus the effects on BCH error correcting code. [bit synchronization

    NASA Technical Reports Server (NTRS)

    Ingels, F. M.; Schoggen, W. O.

    1982-01-01

    The design to achieve the required bit transition density for the Space Shuttle high rate multiplexes (HRM) data stream of the Space Laboratory Vehicle is reviewed. It contained a recommended circuit approach, specified the pseudo random (PN) sequence to be used and detailed the properties of the sequence. Calculations showing the probability of failing to meet the required transition density were included. A computer simulation of the data stream and PN cover sequence was provided. All worst case situations were simulated and the bit transition density exceeded that required. The Preliminary Design Review and the critical Design Review are documented. The Cover Sequence Generator (CSG) Encoder/Decoder design was constructed and demonstrated. The demonstrations were successful. All HRM and HRDM units incorporate the CSG encoder or CSG decoder as appropriate.

  18. Experimental test of Landauer’s principle in single-bit operations on nanomagnetic memory bits

    PubMed Central

    Hong, Jeongmin; Lambson, Brian; Dhuey, Scott; Bokor, Jeffrey

    2016-01-01

    Minimizing energy dissipation has emerged as the key challenge in continuing to scale the performance of digital computers. The question of whether there exists a fundamental lower limit to the energy required for digital operations is therefore of great interest. A well-known theoretical result put forward by Landauer states that any irreversible single-bit operation on a physical memory element in contact with a heat bath at a temperature T requires at least kBT ln(2) of heat be dissipated from the memory into the environment, where kB is the Boltzmann constant. We report an experimental investigation of the intrinsic energy loss of an adiabatic single-bit reset operation using nanoscale magnetic memory bits, by far the most ubiquitous digital storage technology in use today. Through sensitive, high-precision magnetometry measurements, we observed that the amount of dissipated energy in this process is consistent (within 2 SDs of experimental uncertainty) with the Landauer limit. This result reinforces the connection between “information thermodynamics” and physical systems and also provides a foundation for the development of practical information processing technologies that approach the fundamental limit of energy dissipation. The significance of the result includes insightful direction for future development of information technology. PMID:26998519

  19. Experimental test of Landauer's principle in single-bit operations on nanomagnetic memory bits.

    PubMed

    Hong, Jeongmin; Lambson, Brian; Dhuey, Scott; Bokor, Jeffrey

    2016-03-01

    Minimizing energy dissipation has emerged as the key challenge in continuing to scale the performance of digital computers. The question of whether there exists a fundamental lower limit to the energy required for digital operations is therefore of great interest. A well-known theoretical result put forward by Landauer states that any irreversible single-bit operation on a physical memory element in contact with a heat bath at a temperature T requires at least k B T ln(2) of heat be dissipated from the memory into the environment, where k B is the Boltzmann constant. We report an experimental investigation of the intrinsic energy loss of an adiabatic single-bit reset operation using nanoscale magnetic memory bits, by far the most ubiquitous digital storage technology in use today. Through sensitive, high-precision magnetometry measurements, we observed that the amount of dissipated energy in this process is consistent (within 2 SDs of experimental uncertainty) with the Landauer limit. This result reinforces the connection between "information thermodynamics" and physical systems and also provides a foundation for the development of practical information processing technologies that approach the fundamental limit of energy dissipation. The significance of the result includes insightful direction for future development of information technology. PMID:26998519

  20. Collaborative Resource Allocation

    NASA Technical Reports Server (NTRS)

    Wang, Yeou-Fang; Wax, Allan; Lam, Raymond; Baldwin, John; Borden, Chester

    2007-01-01

    Collaborative Resource Allocation Networking Environment (CRANE) Version 0.5 is a prototype created to prove the newest concept of using a distributed environment to schedule Deep Space Network (DSN) antenna times in a collaborative fashion. This program is for all space-flight and terrestrial science project users and DSN schedulers to perform scheduling activities and conflict resolution, both synchronously and asynchronously. Project schedulers can, for the first time, participate directly in scheduling their tracking times into the official DSN schedule, and negotiate directly with other projects in an integrated scheduling system. A master schedule covers long-range, mid-range, near-real-time, and real-time scheduling time frames all in one, rather than the current method of separate functions that are supported by different processes and tools. CRANE also provides private workspaces (both dynamic and static), data sharing, scenario management, user control, rapid messaging (based on Java Message Service), data/time synchronization, workflow management, notification (including emails), conflict checking, and a linkage to a schedule generation engine. The data structure with corresponding database design combines object trees with multiple associated mortal instances and relational database to provide unprecedented traceability and simplify the existing DSN XML schedule representation. These technologies are used to provide traceability, schedule negotiation, conflict resolution, and load forecasting from real-time operations to long-range loading analysis up to 20 years in the future. CRANE includes a database, a stored procedure layer, an agent-based middle tier, a Web service wrapper, a Windows Integrated Analysis Environment (IAE), a Java application, and a Web page interface.

  1. Document Retrieval Using a Serial Bit String Search.

    ERIC Educational Resources Information Center

    Harding, Alan F.; And Others

    1983-01-01

    The experimental best match information retrieval system described is based on serial file organization. Documents and queries are characterized by fixed length bit strings (generated by automatic and manual methods) and character-by-character term match is preceeded by bit string search to eliminate documents which cannot satisfy query.…

  2. A novel bit-wise adaptable entropy coding technique

    NASA Technical Reports Server (NTRS)

    Kiely, A.; Klimesh, M.

    2001-01-01

    We present a novel entropy coding technique which is adaptable in that each bit to be encoded may have an associated probability esitmate which depends on previously encoded bits. The technique may have advantages over arithmetic coding. The technique can achieve arbitrarily small redundancy and admits a simple and fast decoder.

  3. TriBITS (Tribal Build, Integrate, and Test System)

    Energy Science and Technology Software Center (ESTSC)

    2013-05-16

    TriBITS is a configuration, build, test, and reporting system that uses the Kitware open-source CMake/CTest/CDash system. TriBITS contains a number of custom CMake/CTest scripts and python scripts that extend the functionality of the out-of-the-box CMake/CTest/CDash system.

  4. Drill bit stud and method of manufacture

    SciTech Connect

    Hake, L.W.; Huff, C.F.; Miller, J.W.

    1984-10-23

    A polycrystalline diamond compact is a polycrystalline diamond wafer attached to a tungsten carbide substrate forming a disc. In this form, it is attached to a stud which is attached within a drill bit. The compact is attached to the stud with the aid of a positioning ring. When the stud is made of impact resistant material, a full pedestal may be formed on the stud to facilitate the use of the positioning ring. When the stud is made of brittle material, the positioning ring is attached to the flat face of the stud without a pedestal. The ring is positioned on a stud and the disc inserted in the ring so that the disc is positioned against the bonding surface. The disc remains in position against the bonding surface during the handling before and during the bonding process. As a second embodiment, the polycrystalline diamond compact is smaller than the disc itself and the remainder of the disc is formed of metal having the same thickness as the polycrystalline diamond compact or its tungsten carbide substrate. The shape of the smaller polycrystalline diamond compact may be semicircular, circular, polygon shaped, (i.e., triangular, square, etc.) or other geometric figures.

  5. Single Abrikosov vortices as quantized information bits

    PubMed Central

    Golod, T.; Iovan, A.; Krasnov, V. M.

    2015-01-01

    Superconducting digital devices can be advantageously used in future supercomputers because they can greatly reduce the dissipation power and increase the speed of operation. Non-volatile quantized states are ideal for the realization of classical Boolean logics. A quantized Abrikosov vortex represents the most compact magnetic object in superconductors, which can be utilized for creation of high-density digital cryoelectronics. In this work we provide a proof of concept for Abrikosov-vortex-based random access memory cell, in which a single vortex is used as an information bit. We demonstrate high-endurance write operation and two different ways of read-out using a spin valve or a Josephson junction. These memory cells are characterized by an infinite magnetoresistance between 0 and 1 states, a short access time, a scalability to nm sizes and an extremely low write energy. Non-volatility and perfect reproducibility are inherent for such a device due to the quantized nature of the vortex. PMID:26456592

  6. Continuous chain bit with downhole cycling capability

    DOEpatents

    Ritter, Don F.; St. Clair, Jack A.; Togami, Henry K.

    1983-01-01

    A continuous chain bit for hard rock drilling is capable of downhole cycling. A drill head assembly moves axially relative to a support body while the chain on the head assembly is held in position so that the bodily movement of the chain cycles the chain to present new composite links for drilling. A pair of spring fingers on opposite sides of the chain hold the chain against movement. The chain is held in tension by a spring-biased tensioning bar. A head at the working end of the chain supports the working links. The chain is centered by a reversing pawl and piston actuated by the pressure of the drilling mud. Detent pins lock the head assembly with respect to the support body and are also operated by the drilling mud pressure. A restricted nozzle with a divergent outlet sprays drilling mud into the cavity to remove debris. Indication of the centered position of the chain is provided by noting a low pressure reading indicating proper alignment of drilling mud slots on the links with the corresponding feed branches.

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

    NASA Astrophysics Data System (ADS)

    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.

  8. Variable length three-cone rock bit nozzles

    SciTech Connect

    Shoemaker, K.S.

    1987-05-19

    A three-cone sealed bearing rock bit is described of the type that utilizes drilling fluid during operation of the rock bit in an earth formation comprising: a rock bit body having a first pin end and a second cutting end. The cutting end consists of rotary cones mounted to journals that are cantilevered radially inwardly from legs extending from the rock bit body; a fluid chamber formed by the body. The fluid chamber is opened at the first pin end of the body; and at least three variable length nozzle bodies positioned about 120/sup 0/ one from the other, extend from a dome portion formed at a base of the bit body toward a bottom of a borehole in the earth formation. Each of the nozzle bodies communicates with the fluid chamber in the body and extends a different length from the dome portion.

  9. Evolution of a Hybrid Roller Cone/PDC core bit

    SciTech Connect

    Pettitt, R.; Laney, R.; George, D.; Clemens, G.

    1980-01-01

    The development of the hot dry rock (HDR) geothermal resource, as presently being accomplished by the Los Alamos Scientific Laboratory (LASL), requires that sufficient quantities of good quality core be obtained at a reasonable cost. The use of roller cone core bits, with tungsten carbide inserts, was initiated by the Deep Sea Drilling Program. These bits were modified for continental drilling in deep, hot, granitic rock for the LASL HDR Geothermal Site at Fenton Hill, New Mexico in 1974. After the advent of monocrystalline diamond Stratapax pads, a prototype hybrid roller cone/Stratapax core bit was fabricated by Smith Tool, and tested at Fenton Hill in 1978. During the drilling for a deeper HDR reservoir system in 1979 and 1980, six of the latest generation of these bits, now called Hybrid Roller Cone/Polycrystalline Diamond Cutter (PDC) core bits, were successfully used in granitic rock at depths below 11,000 ft.

  10. Montgomery Multiplication with Twice the Bit-Length of Multipliers

    NASA Astrophysics Data System (ADS)

    Yoshino, Masayuki; Okeya, Katsuyuki; Vuillaume, Camille

    We present a novel approach for computing 2n-bit Montgomery multiplications with n-bit hardware Montgomery multipliers. Smartcards are usually equipped with such hardware Montgomery multipliers; however, due to progresses in factoring algorithms, the recommended bit length of public-key schemes such as RSA is steadily increasing, making the hardware quickly obsolete. Thanks to our double-size technique, one can re-use the existing hardware while keeping pace with the latest security requirements. Unlike the other double-size techniques which rely on classical n-bit modular multipliers, our idea is tailored to take advantage of n-bit Montgomery multipliers. Thus, our technique increases the perenniality of existing products without compromises in terms of security.

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

    PubMed

    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. PMID:27230477

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

    NASA Astrophysics Data System (ADS)

    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

  13. Development of optimization-based probabilistic earthquake scenarios for the city of Tehran

    NASA Astrophysics Data System (ADS)

    Zolfaghari, M. R.; Peyghaleh, E.

    2016-01-01

    This paper presents the methodology and practical example for the application of optimization process to select earthquake scenarios which best represent probabilistic earthquake hazard in a given region. The method is based on simulation of a large dataset of potential earthquakes, representing the long-term seismotectonic characteristics in a given region. The simulation process uses Monte-Carlo simulation and regional seismogenic source parameters to generate a synthetic earthquake catalogue consisting of a large number of earthquakes, each characterized with magnitude, location, focal depth and fault characteristics. Such catalogue provides full distributions of events in time, space and size; however, demands large computation power when is used for risk assessment, particularly when other sources of uncertainties are involved in the process. To reduce the number of selected earthquake scenarios, a mixed-integer linear program formulation is developed in this study. This approach results in reduced set of optimization-based probabilistic earthquake scenario, while maintaining shape of hazard curves and full probabilistic picture by minimizing the error between hazard curves driven by full and reduced sets of synthetic earthquake scenarios. To test the model, the regional seismotectonic and seismogenic characteristics of northern Iran are used to simulate a set of 10,000-year worth of events consisting of some 84,000 earthquakes. The optimization model is then performed multiple times with various input data, taking into account probabilistic seismic hazard for Tehran city as the main constrains. The sensitivity of the selected scenarios to the user-specified site/return period error-weight is also assessed. The methodology could enhance run time process for full probabilistic earthquake studies like seismic hazard and risk assessment. The reduced set is the representative of the contributions of all possible earthquakes; however, it requires far less

  14. 24 CFR 92.50 - Formula allocation.

    Code of Federal Regulations, 2011 CFR

    2011-04-01

    ... 24 Housing and Urban Development 1 2011-04-01 2011-04-01 false Formula allocation. 92.50 Section 92.50 Housing and Urban Development Office of the Secretary, Department of Housing and Urban Development HOME INVESTMENT PARTNERSHIPS PROGRAM Allocation Formula § 92.50 Formula allocation. (a) Jurisdictions eligible for a formula allocation. HUD...

  15. Theoretical Accuracy for ESTL Bit Error Rate Tests

    NASA Technical Reports Server (NTRS)

    Lansdowne, Chatwin

    1998-01-01

    "Bit error rate" [BER] for the purposes of this paper is the fraction of binary bits which are inverted by passage through a communication system. BER can be measured for a block of sample bits by comparing a received block with the transmitted block and counting the erroneous bits. Bit Error Rate [BER] tests are the most common type of test used by the ESTL for evaluating system-level performance. The resolution of the test is obvious: the measurement cannot be resolved more finely than 1/N, the number of bits tested. The tolerance is not. This paper examines the measurement accuracy of the bit error rate test. It is intended that this information will be useful in analyzing data taken in the ESTL. This paper is divided into four sections and follows a logically ordered presentation, with results developed before they are evaluated. However, first-time readers will derive the greatest benefit from this paper by skipping the lengthy section devoted to analysis, and treating it as reference material. The analysis performed in this paper is based on a Probability Density Function [PDF] which is developed with greater detail in a past paper, Theoretical Accuracy for ESTL Probability of Acquisition Tests, EV4-98-609.

  16. Earth boring bit with pressure compensating rigid face seal

    SciTech Connect

    Burr, B. H.

    1985-05-14

    An earth boring bit having a cantilevered bearing shaft and a compensator system to equalize the pressure of the lubricant with the hydrostatic pressure of the drilling fluid surrounding the bit. A rigid face seal assembly, positioned between the cutter and bearing shaft of the bit, moves axially in response to, and to compensate for, dynamic pressure changes in the lubricant adjacent the seal. This is accomplished by the positioning and sizing of resilient energizer rings in relationship to the geometries of the mating grooves between the cutter and shaft and the rigid sealing rings of the face seal assembly.

  17. Impact of bit performance on geothermal-well cost

    SciTech Connect

    Lin, Y.T.

    1981-01-01

    The impacts of technological improvements in drill bits on geothermal well costs are evaluated using a compilation of well costs associated with conventional drilling technology. The compilation centers around well models that have been constructed for the major US geothermal areas. Parametric analyses showing the relative importance of the bit performance parameters in well cost reduction and the results of analyses of specific new bit technologies are presented. These results have been used to evaluate the benefits of new technologies and to direct their development.

  18. Fitness Probability Distribution of Bit-Flip Mutation.

    PubMed

    Chicano, Francisco; Sutton, Andrew M; Whitley, L Darrell; Alba, Enrique

    2015-01-01

    Bit-flip mutation is a common mutation operator for evolutionary algorithms applied to optimize functions over binary strings. In this paper, we develop results from the theory of landscapes and Krawtchouk polynomials to exactly compute the probability distribution of fitness values of a binary string undergoing uniform bit-flip mutation. We prove that this probability distribution can be expressed as a polynomial in p, the probability of flipping each bit. We analyze these polynomials and provide closed-form expressions for an easy linear problem (Onemax), and an NP-hard problem, MAX-SAT. We also discuss a connection of the results with runtime analysis. PMID:24885680

  19. Using Bit Errors To Diagnose Fiber-Optic Links

    NASA Technical Reports Server (NTRS)

    Bergman, L. A.; Hartmayer, R.; Marelid, S.

    1989-01-01

    Technique for diagnosis of fiber-optic digital communication link in local-area network of computers based on measurement of bit-error rates. Variable optical attenuator inserted in optical fiber to vary power of received signal. Bit-error rate depends on ratio of peak signal power to root-mean-square noise in receiver. For optimum measurements, one selects bit-error rate between 10 to negative 8th power and 10 to negative 4th power. Greater rates result in low accuracy in determination of signal-to-noise ratios, while lesser rates require impractically long measurement times.

  20. Collective credit allocation in science

    PubMed Central

    Shen, Hua-Wei; Barabási, Albert-László

    2014-01-01

    Collaboration among researchers is an essential component of the modern scientific enterprise, playing a particularly important role in multidisciplinary research. However, we continue to wrestle with allocating credit to the coauthors of publications with multiple authors, because the relative contribution of each author is difficult to determine. At the same time, the scientific community runs an informal field-dependent credit allocation process that assigns credit in a collective fashion to each work. Here we develop a credit allocation algorithm that captures the coauthors’ contribution to a publication as perceived by the scientific community, reproducing the informal collective credit allocation of science. We validate the method by identifying the authors of Nobel-winning papers that are credited for the discovery, independent of their positions in the author list. The method can also compare the relative impact of researchers working in the same field, even if they did not publish together. The ability to accurately measure the relative credit of researchers could affect many aspects of credit allocation in science, potentially impacting hiring, funding, and promotion decisions. PMID:25114238

  1. Simulation of bit-quantization influence on SAR-images

    NASA Astrophysics Data System (ADS)

    Wolframm, A. P.; Pike, T. K.

    The first European Remote Sensing satellite ERS-1 has two imaging modes, the conventional Synthetic Aperture Radar (SAR) mode and the wave mode. Two quantization schemes, 2-bit and 4-bit, have been proposed for the analogue-to-digital conversion of the video signal of the ERS-1 wave mode. This paper analyzes the influence of these two quantization schemes on ocean-wave spectra. The SAR-images were obtained through simulation using a static oceanwave radar model and a comprehensive software SAR-system simulation model (SARSIM) on the DFVLR computing system. The results indicate that spectra produced by the 4-bit quantization are not significantly degraded from the optimum, but that the 2-bit quantization requires some gain adjustment for optimal spectral reproduction. The conclusions are supported by images and spectral plots covering the various options simulated.

  2. Bit selection increases coiled tubing and slimhole success

    SciTech Connect

    Feiner, R.F.

    1995-07-01

    Slimhole applications have grown within the past few years to include deepening existing wells to untapped reservoirs, drilling smaller well programs to reduce tangible costs and recompleting wells to adjacent reservoirs through directional or horizontal sidetracks. When selecting the proper bit for an interval, the ultimate goal is the same in the slimhole application as in the conventional application -- to save the operator money by reducing drilling cost per foot (CPF). Slimhole bit selection is a three-step process: (1) identify the characteristics of the formations to be drilled; (2) analyze the operational limitations of the slimhole application; and (3) select the bit type that will most economically drill the interval. Knowledge of lithology is crucial to the selection process. Accurate formation knowledge can be acquired from offset well records, mud logs, cores, electric logs, compressive rock strength analysis and any other information relevant to the drilling operation. This paper reviews the steps in selecting slimhole bits and completion equipment.

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

    PubMed

    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. PMID:24237497

  4. Secure self-calibrating quantum random-bit generator

    SciTech Connect

    Fiorentino, M.; Santori, C.; Spillane, S. M.; Beausoleil, R. G.; Munro, W. J.

    2007-03-15

    Random-bit generators (RBGs) are key components of a variety of information processing applications ranging from simulations to cryptography. In particular, cryptographic systems require 'strong' RBGs that produce high-entropy bit sequences, but traditional software pseudo-RBGs have very low entropy content and therefore are relatively weak for cryptography. Hardware RBGs yield entropy from chaotic or quantum physical systems and therefore are expected to exhibit high entropy, but in current implementations their exact entropy content is unknown. Here we report a quantum random-bit generator (QRBG) that harvests entropy by measuring single-photon and entangled two-photon polarization states. We introduce and implement a quantum tomographic method to measure a lower bound on the 'min-entropy' of the system, and we employ this value to distill a truly random-bit sequence. This approach is secure: even if an attacker takes control of the source of optical states, a secure random sequence can be distilled.

  5. Optimality Versus Resilience In Patterns Of Carbon Allocation Within Plants Under Climate Change

    NASA Astrophysics Data System (ADS)

    Srinivasan, V.; Kumar, P.; Sivapalan, M.

    2010-12-01

    Predicting the allocation of assimilated carbon among different parts within a plant under current and future climates is a challenging task that is of significant interest. Several empirical and mechanistic models have been developed over the years to solve for the carbon allocation within a plant and these have demonstrated limited success. This challenge is further exacerbated when we need to consider the issue of plant acclimation due to climate change. Optimality based carbon allocation models have the ability to provide a general framework and have been proposed to be a strong alternative to empirical and mechanistic models. While several optimality functions have been proposed, more recently the idea of optimizing end of life cycle reproductive biomass has been demonstrated to have significant success (Iwasa 2000). This optimality function unlike others is more fundamental as it is directly based on the concept of evolutionary fitness of each individual. We apply an optimality based carbon allocation model to the soybean ecosystem and other ecosystems and analyze the predictions. Our analysis demonstrates that plants have the capability to achieve a given end state using different allocation strategies during a growing season. More importantly, the soybean ecosystem exhibits significant suboptimal behavior, where the end of life cycle reproductive biomass realized through field measurements, is lower than the model predicted optimum. From these one can infer that in reality, plants allocate a relatively larger fraction of its carbon to leaf and root biomass and a relatively smaller fraction to reproductive biomass when compared to the model predicted optimal allocation pathway. This trend is also obtained while simulating acclimation behavior under elevated CO2 conditions simulating future climate scenarios. We hypothesize that plants in nature exhibit a significant degree of resilience that prevents them from following an optimal pathway resulting in a

  6. 8-Bit Gray Scale Images of Fingerprint Image Groups

    National Institute of Standards and Technology Data Gateway

    NIST 8-Bit Gray Scale Images of Fingerprint Image Groups (PC database for purchase)   The NIST database of fingerprint images contains 2000 8-bit gray scale fingerprint image pairs. A newer version of the compression/decompression software on the CDROM can be found at the website http://www.nist.gov/itl/iad/ig/nigos.cfm as part of the NBIS package.

  7. Eight-Bit-Slice GaAs General Processor Circuit

    NASA Technical Reports Server (NTRS)

    Weissman, John; Gauthier, Robert V.

    1989-01-01

    Novel GaAs 8-bit slice enables quick and efficient implementation of variety of fast GaAs digital systems ranging from central processing units of computers to special-purpose processors for communications and signal-processing applications. With GaAs 8-bit slice, designers quickly configure and test hearts of many digital systems that demand fast complex arithmetic, fast and sufficient register storage, efficient multiplexing and routing of data words, and ease of control.

  8. Tuned support for cutting elements in a drag bit

    SciTech Connect

    Evans, R.F.

    1984-10-23

    Harmonic resonation of cutting elements against the earth formation is impeded in a rotary drag-type drill bit by providing connection means which yieldably and resiliently support the cutting elements from the drill bit but which deflects or vibrates with different natural resonant harmonic frequencies. The different natural harmonic frequencies tend to cancel or nullify resonance of any one of the connection means. The connection means can also be externally damped against vibrational movement.

  9. Drill-bit with full offset cutter bodies

    SciTech Connect

    Frear, L.

    1985-11-12

    A rotary drag drill bit is seen wherein cutter bodies are rotatively connected to a main body structure at a fully offset position. The fully offset position is defined by a rotational axis of each cutter body, a longitudinal axis of the drill bit and end support points or positions of the cutter bodies. The rotational axes of the cutter bodies are perpendicular to the longitudinal axis of the drill bit. The end supports of the cutter body are each equal distance from any point on the longitudinal axis of the drill bit. The cutter bodies of essentially ellipsoidal configuration, being slightly thicker at a mid-portion thereof. Cutting elements are connected to flutes projecting above an outer surface of each cutter body. In a primary rotational direction of the drill string and drill bit, the rows abrade the bottom and side walls of a well bore as the cutter body attacks the earth formation as the drill bit is rotated. The impingement of the cutting elements of the cutter body on the earth formation imparts a secondary rotation to the cutter bodies, which secondary rotation is induced by the primary rotation. The secondary rotation allows the rows of cutting elements to engage the side wall of the bore and gauge the hole as well as abrading away material from the bottom of the well bore. A roller bearing assembly is provided for the cutter body to permit the secondary rotation, while a thrust bearing assembly assists the primary abrasive action imparted by the primary rotational movement of the rotary drill bit. A lubrication system is included in the main body structure of the drill bit wherein both the roller bearing assembly and thrust bearing assembly are lubricated.

  10. Strong no-go theorem for Gaussian quantum bit commitment

    SciTech Connect

    Magnin, Loieck; Magniez, Frederic; Leverrier, Anthony

    2010-01-15

    Unconditionally secure bit commitment is forbidden by quantum mechanics. We extend this no-go theorem to continuous-variable protocols where both players are restricted to use Gaussian states and operations, which is a reasonable assumption in current-state optical implementations. Our Gaussian no-go theorem also provides a natural counter-example to a conjecture that quantum mechanics can be rederived from the assumption that key distribution is allowed while bit commitment is forbidden in Nature.

  11. A VLSI single chip 8-bit finite field multiplier

    NASA Technical Reports Server (NTRS)

    Deutsch, L. J.; Shao, H. M.; Hsu, I. S.; Truong, T. K.

    1985-01-01

    A Very Large Scale Integration (VLSI) architecture and layout for an 8-bit finite field multiplier is described. The algorithm used in this design was developed by Massey and Omura. A normal basis representation of finite field elements is used to reduce the multiplication complexity. It is shown that a drastic improvement was achieved in this design. This multiplier will be used intensively in the implementation of an 8-bit Reed-Solomon decoder and in many other related projects.

  12. Task allocation among multiple intelligent robots

    NASA Technical Reports Server (NTRS)

    Gasser, L.; Bekey, G.

    1987-01-01

    Researchers describe the design of a decentralized mechanism for allocating assembly tasks in a multiple robot assembly workstation. Currently, the approach focuses on distributed allocation to explore its feasibility and its potential for adaptability to changing circumstances, rather than for optimizing throughput. Individual greedy robots make their own local allocation decisions using both dynamic allocation policies which propagate through a network of allocation goals, and local static and dynamic constraints describing which robots are elibible for which assembly tasks. Global coherence is achieved by proper weighting of allocation pressures propagating through the assembly plan. Deadlock avoidance and synchronization is achieved using periodic reassessments of local allocation decisions, ageing of allocation goals, and short-term allocation locks on goals.

  13. Resource Allocation: A Participatory Process.

    ERIC Educational Resources Information Center

    Reid, Alban E.

    Whether a participatory process for resource allocation in a public community college setting occurs depends upon several key factors: (1) the leadership style of the institutional chief executive officer; (2) the administrative organizational structure of the institution; (3) the relationship which exists between and among members of the various…

  14. Report on Tribal Priority Allocations.

    ERIC Educational Resources Information Center

    Bureau of Indian Affairs (Dept. of Interior), Washington, DC.

    As part of Bureau of Indian Affairs (BIA) funding, Tribal Priority Allocations (TPA) are the principal source of funds for tribal governments and agency offices at the reservation level. According to their unique needs and circumstances, tribes may prioritize funding among eight general categories: government, human services, education, public…

  15. Regulating nutrient allocation in plants

    DOEpatents

    Udvardi, Michael; Yang, Jiading; Worley, Eric

    2014-12-09

    The invention provides coding and promoter sequences for a VS-1 and AP-2 gene, which affects the developmental process of senescence in plants. Vectors, transgenic plants, seeds, and host cells comprising heterologous VS-1 and AP-2 genes are also provided. Additionally provided are methods of altering nutrient allocation and composition in a plant using the VS-1 and AP-2 genes.

  16. Administrators' Decisions about Resource Allocation

    ERIC Educational Resources Information Center

    Knight, William E.; Folkins, John W.; Hakel, Milton D.; Kennell, Richard P.

    2011-01-01

    Do academic administrators make decisions about resource allocation differently depending on the discipline receiving the funding? Does an administrator's academic identity influence these decisions? This study explored those questions with a sample of 1,690 academic administrators at doctoral-research universities. Participants used fictional…

  17. Smooth quality streaming with bit-plane labeling

    NASA Astrophysics Data System (ADS)

    Cho, Chuan-Yu; Chen, Hong-Sheng; Wang, Jia-Shung

    2005-07-01

    Bit-plane coding techniques have been proposed as an efficient way to achieve the goal of fine granularity scalability (FGS). Both in image and video coding standards such as JPEG 2000 and MPEG-4, bit-plane coding techniques have been utilized to code a universal bit-stream for various bandwidth applications. With the bit-plane coding, a bit-stream can be truncated according to the available bandwidth. Hence, the video quality can be very sensitive to the network bandwidth variation especially while streaming a video over the Internet or a wireless link. For overall human perception, a consistent and smooth quality video is much better than to have high video quality in just a short period but with highly quality variation in general. We classify the quality variation into two categories: inter-frame and intraframe quality variation. The inter-frame quality variation may cause by the constant bit rate coded (CBR) base layer video or the network bandwidth variation, while the intra-frame quality variation causes mainly by the various motion types. For example, moving objects are usually more difficult to be encoded. This paper focuses on the inter-frame quality variation because quality variation is more significant between frames than within a frame. An enhancement layer labeling algorithm is proposed to reduce the inter-frame quality variation, and a dynamic bit-plane truncation scheme is utilized to maintain the smooth streaming video quality. The proposed algorithm has no overhead in the decoder, and the experimental results portray that our proposed algorithm can greatly eliminate the inter-frame quality variation.

  18. 23 CFR 660.107 - Allocations.

    Code of Federal Regulations, 2010 CFR

    2010-04-01

    ... 23 Highways 1 2010-04-01 2010-04-01 false Allocations. 660.107 Section 660.107 Highways FEDERAL HIGHWAY ADMINISTRATION, DEPARTMENT OF TRANSPORTATION ENGINEERING AND TRAFFIC OPERATIONS SPECIAL PROGRAMS (DIRECT FEDERAL) Forest Highways § 660.107 Allocations. On October 1 of each fiscal year, the FHWA will allocate 66 percent of Public Lands...

  19. 15 CFR 923.110 - Allocation formula.

    Code of Federal Regulations, 2010 CFR

    2010-01-01

    ... 15 Commerce and Foreign Trade 3 2010-01-01 2010-01-01 false Allocation formula. 923.110 Section... Grants § 923.110 Allocation formula. (a) As required by subsection 306(a), the Secretary may make grants...) Allocation formula factors and weighting. Each State eligible to receive a financial assistance award...

  20. 10 CFR 455.31 - Allocation formulas.

    Code of Federal Regulations, 2010 CFR

    2010-01-01

    ... 10 Energy 3 2010-01-01 2010-01-01 false Allocation formulas. 455.31 Section 455.31 Energy... § 455.31 Allocation formulas. (a) Financial assistance for conducting technical assistance programs for... this section. (c) The allocation factor (K) shall be determined by the formula: EC14NO91.086 where,...

  1. 24 CFR 574.130 - Formula allocations.

    Code of Federal Regulations, 2010 CFR

    2010-04-01

    ... 24 Housing and Urban Development 3 2010-04-01 2010-04-01 false Formula allocations. 574.130... URBAN DEVELOPMENT COMMUNITY FACILITIES HOUSING OPPORTUNITIES FOR PERSONS WITH AIDS Formula Entitlements § 574.130 Formula allocations. (a) Data sources. HUD will allocate funds based on the number of cases...

  2. 45 CFR 1355.57 - Cost allocation.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... 45 Public Welfare 4 2010-10-01 2010-10-01 false Cost allocation. 1355.57 Section 1355.57 Public... MAINTENANCE PAYMENTS, ADOPTION ASSISTANCE, AND CHILD AND FAMILY SERVICES GENERAL § 1355.57 Cost allocation. (a... maintenance payments or adoption assistance payments may be made under the State plan. (b) Cost allocation...

  3. 45 CFR 400.13 - Cost allocation.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... 45 Public Welfare 2 2010-10-01 2010-10-01 false Cost allocation. 400.13 Section 400.13 Public... for Refugee Resettlement Award of Grants to States § 400.13 Cost allocation. (a) A State must allocate... management of the State's refugee program (e.g., development of the State plan, overall program...

  4. 45 CFR 400.13 - Cost allocation.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... 45 Public Welfare 2 2011-10-01 2011-10-01 false Cost allocation. 400.13 Section 400.13 Public... for Refugee Resettlement Award of Grants to States § 400.13 Cost allocation. (a) A State must allocate... management of the State's refugee program (e.g., development of the State plan, overall program...

  5. 45 CFR 1355.57 - Cost allocation.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... 45 Public Welfare 4 2011-10-01 2011-10-01 false Cost allocation. 1355.57 Section 1355.57 Public... MAINTENANCE PAYMENTS, ADOPTION ASSISTANCE, AND CHILD AND FAMILY SERVICES GENERAL § 1355.57 Cost allocation. (a... maintenance payments or adoption assistance payments may be made under the State plan. (b) Cost allocation...

  6. 24 CFR 92.50 - Formula allocation.

    Code of Federal Regulations, 2014 CFR

    2014-04-01

    ... 24 Housing and Urban Development 1 2014-04-01 2014-04-01 false Formula allocation. 92.50 Section 92.50 Housing and Urban Development Office of the Secretary, Department of Housing and Urban Development HOME INVESTMENT PARTNERSHIPS PROGRAM Allocation Formula § 92.50 Formula allocation....

  7. 24 CFR 92.50 - Formula allocation.

    Code of Federal Regulations, 2013 CFR

    2013-04-01

    ... 24 Housing and Urban Development 1 2013-04-01 2013-04-01 false Formula allocation. 92.50 Section 92.50 Housing and Urban Development Office of the Secretary, Department of Housing and Urban Development HOME INVESTMENT PARTNERSHIPS PROGRAM Allocation Formula § 92.50 Formula allocation....

  8. 24 CFR 92.50 - Formula allocation.

    Code of Federal Regulations, 2012 CFR

    2012-04-01

    ... 24 Housing and Urban Development 1 2012-04-01 2012-04-01 false Formula allocation. 92.50 Section 92.50 Housing and Urban Development Office of the Secretary, Department of Housing and Urban Development HOME INVESTMENT PARTNERSHIPS PROGRAM Allocation Formula § 92.50 Formula allocation....

  9. 45 CFR 98.55 - Cost allocation.

    Code of Federal Regulations, 2014 CFR

    2014-10-01

    ... 45 Public Welfare 1 2014-10-01 2014-10-01 false Cost allocation. 98.55 Section 98.55 Public... of Child Care and Development Funds § 98.55 Cost allocation. (a) The Lead Agency and subgrantees shall keep on file cost allocation plans or indirect cost agreements, as appropriate, that have...

  10. 45 CFR 98.55 - Cost allocation.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... 45 Public Welfare 1 2011-10-01 2011-10-01 false Cost allocation. 98.55 Section 98.55 Public... of Child Care and Development Funds § 98.55 Cost allocation. (a) The Lead Agency and subgrantees shall keep on file cost allocation plans or indirect cost agreements, as appropriate, that have...

  11. 45 CFR 1355.57 - Cost allocation.

    Code of Federal Regulations, 2012 CFR

    2012-10-01

    ... 45 Public Welfare 4 2012-10-01 2012-10-01 false Cost allocation. 1355.57 Section 1355.57 Public... MAINTENANCE PAYMENTS, ADOPTION ASSISTANCE, AND CHILD AND FAMILY SERVICES GENERAL § 1355.57 Cost allocation. (a...) Cost allocation and distribution for the planning, design, development, installation and operation...

  12. 45 CFR 400.13 - Cost allocation.

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ... 45 Public Welfare 2 2013-10-01 2012-10-01 true Cost allocation. 400.13 Section 400.13 Public... for Refugee Resettlement Award of Grants to States § 400.13 Cost allocation. (a) A State must allocate... management of the State's refugee program (e.g., development of the State plan, overall program...

  13. 45 CFR 400.13 - Cost allocation.

    Code of Federal Regulations, 2012 CFR

    2012-10-01

    ... 45 Public Welfare 2 2012-10-01 2012-10-01 false Cost allocation. 400.13 Section 400.13 Public... for Refugee Resettlement Award of Grants to States § 400.13 Cost allocation. (a) A State must allocate... management of the State's refugee program (e.g., development of the State plan, overall program...

  14. Communication patterns and allocation strategies.

    SciTech Connect

    Leung, Vitus Joseph; Mache, Jens Wolfgang; Bunde, David P.

    2004-01-01

    Motivated by observations about job runtimes on the CPlant system, we use a trace-driven microsimulator to begin characterizing the performance of different classes of allocation algorithms on jobs with different communication patterns in space-shared parallel systems with mesh topology. We show that relative performance varies considerably with communication pattern. The Paging strategy using the Hilbert space-filling curve and the Best Fit heuristic performed best across several communication patterns.

  15. Minority Transportation Expenditure Allocation Model

    Energy Science and Technology Software Center (ESTSC)

    1993-04-12

    MITRAM (Minority TRansportation expenditure Allocation Model) can project various transportation related attributes of minority (Black and Hispanic) and majority (white) populations. The model projects vehicle ownership, vehicle miles of travel, workers, new car and on-road fleet fuel economy, amount and share of household income spent on gasoline, and household expenditures on public transportation and taxis. MITRAM predicts reactions to sustained fuel price changes for up to 10 years after the change.

  16. Fully photonics-based physical random bit generator.

    PubMed

    Li, Pu; Sun, Yuanyuan; Liu, Xianglian; Yi, Xiaogang; Zhang, Jianguo; Guo, Xiaomin; Guo, Yanqiang; Wang, Yuncai

    2016-07-15

    We propose a fully photonics-based approach for ultrafast physical random bit generation. This approach exploits a compact nonlinear loop mirror (called a terahertz optical asymmetric demultiplexer, TOAD) to sample the chaotic optical waveform in an all-optical domain and then generate random bit streams through further comparison with a threshold level. This method can efficiently overcome the electronic jitter bottleneck confronted by existing RBGs in practice. A proof-of-concept experiment demonstrates that this method can continuously extract 5 Gb/s random bit streams from the chaotic output of a distributed feedback laser diode (DFB-LD) with optical feedback. This limited generation rate is caused by the bandwidth of the used optical chaos. PMID:27420532

  17. Security bound of cheat sensitive quantum bit commitment

    PubMed Central

    He, Guang Ping

    2015-01-01

    Cheat sensitive quantum bit commitment (CSQBC) loosens the security requirement of quantum bit commitment (QBC), so that the existing impossibility proofs of unconditionally secure QBC can be evaded. But here we analyze the common features in all existing CSQBC protocols, and show that in any CSQBC having these features, the receiver can always learn a non-trivial amount of information on the sender's committed bit before it is unveiled, while his cheating can pass the security check with a probability not less than 50%. The sender's cheating is also studied. The optimal CSQBC protocols that can minimize the sum of the cheating probabilities of both parties are found to be trivial, as they are practically useless. We also discuss the possibility of building a fair protocol in which both parties can cheat with equal probabilities. PMID:25796977

  18. New bits, motors improve economics of slim hole horizontal wells

    SciTech Connect

    McDonald, S.; Felderhoff, F.; Fisher, K.

    1996-03-11

    The latest generation of small-diameter bits, combined with a new extended power section positive displacement motor (PDM), has improved the economics of slim hole drilling programs. As costs are driven down, redevelopment reserves are generated in the older, more established fields. New reserves result from increases in the ultimate recovery and accelerated production rates from the implementation of horizontal wells in reentry programs. This logic stimulated an entire development program for a Gulf of Mexico platform, which was performed without significant compromises in well bore geometry. The savings from this new-generation drilling system come from reducing the total number of trips required during the drilling phase. This paper reviews the design improvements of roller cone bits, PDC bits, and positive displacement motors for offshore directional drilling operations.

  19. Unconditionally secure bit commitment by transmitting measurement outcomes.

    PubMed

    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. PMID:23030073

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

    NASA Astrophysics Data System (ADS)

    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.

  1. Security bound of cheat sensitive quantum bit commitment

    NASA Astrophysics Data System (ADS)

    He, Guang Ping

    2015-03-01

    Cheat sensitive quantum bit commitment (CSQBC) loosens the security requirement of quantum bit commitment (QBC), so that the existing impossibility proofs of unconditionally secure QBC can be evaded. But here we analyze the common features in all existing CSQBC protocols, and show that in any CSQBC having these features, the receiver can always learn a non-trivial amount of information on the sender's committed bit before it is unveiled, while his cheating can pass the security check with a probability not less than 50%. The sender's cheating is also studied. The optimal CSQBC protocols that can minimize the sum of the cheating probabilities of both parties are found to be trivial, as they are practically useless. We also discuss the possibility of building a fair protocol in which both parties can cheat with equal probabilities.

  2. Can relativistic bit commitment lead to secure quantum oblivious transfer?

    NASA Astrophysics Data System (ADS)

    He, Guang Ping

    2015-05-01

    While unconditionally secure bit commitment (BC) is considered impossible within the quantum framework, it can be obtained under relativistic or experimental constraints. Here we study whether such BC can lead to secure quantum oblivious transfer (QOT). The answer is not completely negative. In one hand, we provide a detailed cheating strategy, showing that the "honest-but-curious adversaries" in some of the existing no-go proofs on QOT still apply even if secure BC is used, enabling the receiver to increase the average reliability of the decoded value of the transferred bit. On the other hand, it is also found that some other no-go proofs claiming that a dishonest receiver can always decode all transferred bits simultaneously with reliability 100% become invalid in this scenario, because their models of cryptographic protocols are too ideal to cover such a BC-based QOT.

  3. Security bound of cheat sensitive quantum bit commitment.

    PubMed

    He, Guang Ping

    2015-01-01

    Cheat sensitive quantum bit commitment (CSQBC) loosens the security requirement of quantum bit commitment (QBC), so that the existing impossibility proofs of unconditionally secure QBC can be evaded. But here we analyze the common features in all existing CSQBC protocols, and show that in any CSQBC having these features, the receiver can always learn a non-trivial amount of information on the sender's committed bit before it is unveiled, while his cheating can pass the security check with a probability not less than 50%. The sender's cheating is also studied. The optimal CSQBC protocols that can minimize the sum of the cheating probabilities of both parties are found to be trivial, as they are practically useless. We also discuss the possibility of building a fair protocol in which both parties can cheat with equal probabilities. PMID:25796977

  4. Bit-related lesions in Icelandic competition horses

    PubMed Central

    2014-01-01

    Background Oral lesions related to the use of the bit and bridle are reported to be common findings in horses worldwide and represent an important animal welfare issue. In order to provide an overview of bit-related lesions in Icelandic competition horses, a field examination of the rostral part of the oral cavity was performed in 424 competition horses coming to the two major national horse events in Iceland in 2012. Records from repeated examination of 77 horses prior to the finals were used to assess potential risk factors. Results Mild lesions were recorded in 152 horses (36%) prior to the preliminary rounds. They were most often located in the commissures of the lips and the adjacent buccal mucosa (n = 111). Severe lesions were found in 32 (8%) horses. For 77 horses examined prior to the finals, the frequency of findings in the area of the mandibular interdental space (bars of the mandible) had increased from 8% to 31% (P < 0.0001). These findings were most often (16/24) regarded as severe. The presence of lesions on the bars was strongly associated to the use of curb bits with a port (OR = 75, P = 0.009). Conclusions Bit-related lesions were found to be a general problem in Icelandic competition horses. The type of bits used influenced both the location and the severity of the lesions. The use of curb bits with a port was found to be a decisive risk factor for lesions on the bars of the mandible, most of which were regarded as severe. The results also raised questions about the head and neck carriage demanded for the competition horses. PMID:25116656

  5. Critique of a Hughes shuttle Ku-band data sampler/bit synchronizer

    NASA Technical Reports Server (NTRS)

    Holmes, J. K.

    1980-01-01

    An alternative bit synchronizer proposed for shuttle was analyzed in a noise-free environment by considering the basic operation of the loop via timing diagrams and by linearizing the bit synchronizer as an equivalent, continuous, phased-lock loop (PLL). The loop is composed of a high-frequency phase-frequency detector which is capable of detecting both phase and frequency errors and is used to track the clock, and a bit transition detector which attempts to track the transitions of the data bits. It was determined that the basic approach was a good design which, with proper implementation of the accumulator, up/down counter and logic should provide accurate mid-bit sampling with symmetric bits. However, when bit asymmetry occurs, the bit synchronizer can lock up with a large timing error, yet be quasi-stable (timing will not change unless the clock and bit sequence drift). This will result in incorrectly detecting some bits.

  6. Use of single-cutter data in the analysis of PDC bit designs

    SciTech Connect

    Glowka, D.A.

    1986-10-10

    A method is developed for predicting cutter forces, temperatures, and wear on PDC bits as well as integrated bit performance parameters such as weight-on-bit (WOB), drilling torque, and bit imbalance. A computer code called PDCWEAR has been developed to make this method available as a tool for general bit design. The method uses single-cutter data to provide a measure of rock drillability and employs theoretical considerations to account for interaction among closely spaced cutters on the bit. Experimental data are presented to establish the effects of cutter size and wearflat area on the forces that develop during rock cutting. Waterjet assistance is shown to significantly reduce cutting forces, thereby extending bit life and reducing WOB and torque requirements in hard rock. The effects of bit profile, cutter placement density, bit rotary speed, and wear mode on bit life and drilling performance are investigated. 21 refs., 34 figs., 4 tabs.

  7. A low cost alternative to high performance PCM bit synchronizers

    NASA Technical Reports Server (NTRS)

    Deshong, Bruce

    1993-01-01

    The Code Converter/Clock Regenerator (CCCR) provides a low-cost alternative to high-performance Pulse Code Modulation (PCM) bit synchronizers in environments with a large Signal-to-Noise Ratio (SNR). In many applications, the CCCR can be used in place of PCM bit synchronizers at about one fifth the cost. The CCCR operates at rates from 10 bps to 2.5 Mbps and performs PCM code conversion and clock regeneration. The CCCR has been integrated into a stand-alone system configurable from one to six channels and has also been designed for use in VMEbus compatible systems.

  8. Foldable Instrumented Bits for Ultrasonic/Sonic Penetrators

    NASA Technical Reports Server (NTRS)

    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

  9. Synthesis and evaluation of phase detectors for active bit synchronizers

    NASA Technical Reports Server (NTRS)

    Mcbride, A. L.

    1974-01-01

    Self-synchronizing digital data communication systems usually use active or phase-locked loop (PLL) bit synchronizers. The three main elements of PLL synchronizers are the phase detector, loop filter, and the voltage controlled oscillator. Of these three elements, phase detector synthesis is the main source of difficulty, particularly when the received signals are demodulated square-wave signals. A phase detector synthesis technique is reviewed that provides a physically realizable design for bit synchronizer phase detectors. The development is based upon nonlinear recursive estimation methods. The phase detector portion of the algorithm is isolated and analyzed.

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

    SciTech Connect

    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.

  11. Hanford coring bit temperature monitor development testing results report

    SciTech Connect

    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.

  12. Cloning the entanglement of a pair of quantum bits

    SciTech Connect

    Lamoureux, Louis-Philippe; Navez, Patrick; Cerf, Nicolas J.; Fiurasek, Jaromir

    2004-04-01

    It is shown that any quantum operation that perfectly clones the entanglement of all maximally entangled qubit pairs cannot preserve separability. This 'entanglement no-cloning' principle naturally suggests that some approximate cloning of entanglement is nevertheless allowed by quantum mechanics. We investigate a separability-preserving optimal cloning machine that duplicates all maximally entangled states of two qubits, resulting in 0.285 bits of entanglement per clone, while a local cloning machine only yields 0.060 bits of entanglement per clone.

  13. Bit-wise arithmetic coding for data compression

    NASA Technical Reports Server (NTRS)

    Kiely, A. B.

    1994-01-01

    This article examines the problem of compressing a uniformly quantized independent and identically distributed (IID) source. We present a new compression technique, bit-wise arithmetic coding, that assigns fixed-length codewords to the quantizer output and uses arithmetic coding to compress the codewords, treating the codeword bits as independent. We examine the performance of this method and evaluate the overhead required when used block-adaptively. Simulation results are presented for Gaussian and Laplacian sources. This new technique could be used as the entropy coder in a transform or subband coding system.

  14. Demonstration of low-power bit-interleaving TDM PON.

    PubMed

    Van Praet, Christophe; Chow, Hungkei; Suvakovic, Dusan; Van Veen, Doutje; Dupas, Arnaud; Boislaigue, Roger; Farah, Robert; Lau, Man Fai; Galaro, Joseph; Qua, Gin; Anthapadmanabhan, N Prasanth; Torfs, Guy; Yin, Xin; Vetter, Peter

    2012-12-10

    A functional demonstration of bit-interleaving TDM downstream protocol for passive optical networks (Bi-PON) is reported. The proposed protocol presents a significant reduction in dynamic power consumption in the customer premise equipment over the conventional TDM protocol. It allows to select the relevant bits of all aggregated incoming data immediately after clock and data recovery (CDR) and, hence, allows subsequent hardware to run at much lower user rate. Comparison of experimental results of FPGA-based implementations of Bi-PON and XG-PON shows that more than 30x energy-savings in protocol processing is achievable. PMID:23262914

  15. Allocating Variability and Reserve Requirements (Presentation)

    SciTech Connect

    Kirby, B.; King, J.; Milligan, M.

    2011-10-01

    This presentation describes how you could conceivably allocate variability and reserve requirements, including how to allocate aggregation benefits. Conclusions of this presentation are: (1) Aggregation provides benefits because individual requirements are not 100% correlated; (2) Method needed to allocate reduced requirement among participants; (3) Differences between allocation results are subtle - (a) Not immediately obvious which method is 'better'; (b) Many are numerically 'correct', they sum to the physical requirement; (c) Many are not 'fair', Results depend on sub-aggregation and/or the order individuals are included; and (4) Vector allocation method is simple and fair.

  16. 45 CFR 402.31 - Determination of allocations.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... ASSISTANCE GRANTS State Allocations § 402.31 Determination of allocations. (a) Allocation formula. Allocations will be computed according to a formula using the following factors and weights: (1) 50...

  17. 45 CFR 402.31 - Determination of allocations.

    Code of Federal Regulations, 2014 CFR

    2014-10-01

    ... State Allocations § 402.31 Determination of allocations. (a) Allocation formula. Allocations will be computed according to a formula using the following factors and weights: (1) 50 percent based on the...

  18. Bit-rate-variable and order-switchable optical multiplexing of high-speed pseudorandom bit sequence using optical delays.

    PubMed

    Wu, Xiaoxia; Wang, Jian; Yilmaz, Omer F; Nuccio, Scott R; Bogoni, Antonella; Willner, Alan E

    2010-09-15

    We experimentally demonstrate high-speed optical pseudorandom bit sequence (PRBS) multiplexing with coarse and fine bit-rate tuning capability and a switchable order using optical delays. Data multiplexing of 80 Gbit/s and 160 Gbit/s is shown, each with a tunable rate using a conversion/dispersion-based continuously tunable optical delay and tunable PRBS order with large switchable fiber delays. A 7% bit-rate tunability, i.e., 80-85.6 Gbit/s and 160-171.2 Gbit/s, is shown for both 2(7)-1 and 2(15)-1 PRBS. The rf spectra before and after multiplexing are measured in each case and show a suppression ratio of >30 dB, exhibiting the expected PRBS spectral characteristics. PMID:20847772

  19. A radiation-hardened 16/32-bit microprocessor

    SciTech Connect

    Hass, K.J.; Treece, R.K.; Giddings, A.E.

    1989-01-01

    A radiation-hardened 16/32-bit microprocessor has been fabricated and tested. Our initial evaluation has demonstrated that it is functional after a total gamma dose of 5Mrad(Si) and is immune to SEU from Krypton ions. 3 refs., 2 figs.

  20. Characterization of a 16-Bit Digitizer for Lidar Data Acquisition

    NASA Technical Reports Server (NTRS)

    Williamson, Cynthia K.; DeYoung, Russell J.

    2000-01-01

    A 6-MHz 16-bit waveform digitizer was evaluated for use in atmospheric differential absorption lidar (DIAL) measurements of ozone. The digitizer noise characteristics were evaluated, and actual ozone DIAL atmospheric returns were digitized. This digitizer could replace computer-automated measurement and control (CAMAC)-based commercial digitizers and improve voltage accuracy.

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

    NASA Astrophysics Data System (ADS)

    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.

  2. Rock bit requires no flushing medium to maintain drilling speed

    NASA Technical Reports Server (NTRS)

    1965-01-01

    Steel drill bit having terraces of teeth intersected by spiral grooves with teeth permits the boring of small holes through rock with low power. The cuttings are stored in a chamber behind the cutting head. Could be used as sampling device.

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

    NASA Astrophysics Data System (ADS)

    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.

  4. 16. STRUCTURAL DETAILS: CHANNEL, BIT & CLEAT, ANCHOR BOLTS & ...

    Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

    16. STRUCTURAL DETAILS: CHANNEL, BIT & CLEAT, ANCHOR BOLTS & PLATES FOR PIERS 4, 5, AND 6, DWG. NO. 97, 1-1/2" = 1', MADE BY A.F., JUNE 13, 1908 - Baltimore Inner Harbor, Pier 5, South of Pratt Street between Market Place & Concord Street, Baltimore, Independent City, MD

  5. Nonanalytic function generation routines for 16-bit microprocessors

    NASA Technical Reports Server (NTRS)

    Soeder, J. F.; Shaufl, M.

    1980-01-01

    Interpolation techniques for three types (univariate, bivariate, and map) of nonanalytic functions are described. These interpolation techniques are then implemented in scaled fraction arithmetic on a representative 16 bit microprocessor. A FORTRAN program is described that facilitates the scaling, documentation, and organization of data for use by these routines. Listings of all these programs are included in an appendix.

  6. Multi-bit operations in vertical spintronic shift registers

    NASA Astrophysics Data System (ADS)

    Lavrijsen, Reinoud; Petit, Dorothée C. M. C.; Fernández-Pacheco, Amalio; Lee, JiHyun; Mansell, Mansell; Cowburn, Russell P.

    2014-03-01

    Spintronic devices have in general demonstrated the feasibility of non-volatile memory storage and simple Boolean logic operations. Modern microprocessors have one further frequently used digital operation: bit-wise operations on multiple bits simultaneously. Such operations are important for binary multiplication and division and in efficient microprocessor architectures such as reduced instruction set computing (RISC). In this paper we show a four-stage vertical serial shift register made from RKKY coupled ultrathin (0.9 nm) perpendicularly magnetised layers into which a 3-bit data word is injected. The entire four stage shift register occupies a total length (thickness) of only 16 nm. We show how under the action of an externally applied magnetic field bits can be shifted together as a word and then manipulated individually, including being brought together to perform logic operations. This is one of the highest level demonstrations of logic operation ever performed on data in the magnetic state and brings closer the possibility of ultrahigh density all-magnetic microprocessors.

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

    NASA Technical Reports Server (NTRS)

    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.

  8. Numerical study of the simplest string bit model

    NASA Astrophysics Data System (ADS)

    Chen, Gaoli; Sun, Songge

    2016-05-01

    String bit models provide a possible method to formulate a string as a discrete chain of pointlike 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 the U (N ) color group. We show that the supersymmetry reduces the parameter number of a Hamiltonian from 7 to 3 and, at N =∞ , ensures a continuous energy spectrum, which implies the emergence of one spatial dimension. The Hamiltonian H0 is constructed so that in the large N limit it produces a world sheet spectrum with one Grassmann world sheet field. We concentrate on the numerical study of the model in finite N . For the Hamiltonian H0, we find that the would-be ground energy states disappear at N =(M -1 ) /2 for odd M ≤11 . Such a simple pattern is spoiled if H has an additional term ξ Δ H which does not affect the result of N =∞ . The disappearance point moves to higher (lower) N when ξ increases (decreases). Particularly, the ±(H0-Δ H ) cases suggest a possibility that the ground state could survive at large M and M ≫N . Our study reveals that the model has stringy behavior: when N is fixed and large enough, the ground energy decreases linearly with respect to M , and the excitation energy is roughly of order M-1. We also verify that a stable system of Hamiltonian ±H0+ξ Δ H requires ξ ≥∓1 .

  9. Investigation of optimization-based reconstruction with an image-total-variation constraint in PET

    NASA Astrophysics Data System (ADS)

    Zhang, Zheng; Ye, Jinghan; Chen, Buxin; Perkins, Amy E.; Rose, Sean; Sidky, Emil Y.; Kao, Chien-Min; Xia, Dan; Tung, Chi-Hua; Pan, Xiaochuan

    2016-08-01

    Interest remains in reconstruction-algorithm research and development for possible improvement of image quality in current PET imaging and for enabling innovative PET systems to enhance existing, and facilitate new, preclinical and clinical applications. Optimization-based image reconstruction has been demonstrated in recent years of potential utility for CT imaging applications. In this work, we investigate tailoring the optimization-based techniques to image reconstruction for PET systems with standard and non-standard scan configurations. Specifically, given an image-total-variation (TV) constraint, we investigated how the selection of different data divergences and associated parameters impacts the optimization-based reconstruction of PET images. The reconstruction robustness was explored also with respect to different data conditions and activity up-takes of practical relevance. A study was conducted particularly for image reconstruction from data collected by use of a PET configuration with sparsely populated detectors. Overall, the study demonstrates the robustness of the TV-constrained, optimization-based reconstruction for considerably different data conditions in PET imaging, as well as its potential to enable PET configurations with reduced numbers of detectors. Insights gained in the study may be exploited for developing algorithms for PET-image reconstruction and for enabling PET-configuration design of practical usefulness in preclinical and clinical applications.

  10. Investigation of optimization-based reconstruction with an image-total-variation constraint in PET.

    PubMed

    Zhang, Zheng; Ye, Jinghan; Chen, Buxin; Perkins, Amy E; Rose, Sean; Sidky, Emil Y; Kao, Chien-Min; Xia, Dan; Tung, Chi-Hua; Pan, Xiaochuan

    2016-08-21

    Interest remains in reconstruction-algorithm research and development for possible improvement of image quality in current PET imaging and for enabling innovative PET systems to enhance existing, and facilitate new, preclinical and clinical applications. Optimization-based image reconstruction has been demonstrated in recent years of potential utility for CT imaging applications. In this work, we investigate tailoring the optimization-based techniques to image reconstruction for PET systems with standard and non-standard scan configurations. Specifically, given an image-total-variation (TV) constraint, we investigated how the selection of different data divergences and associated parameters impacts the optimization-based reconstruction of PET images. The reconstruction robustness was explored also with respect to different data conditions and activity up-takes of practical relevance. A study was conducted particularly for image reconstruction from data collected by use of a PET configuration with sparsely populated detectors. Overall, the study demonstrates the robustness of the TV-constrained, optimization-based reconstruction for considerably different data conditions in PET imaging, as well as its potential to enable PET configurations with reduced numbers of detectors. Insights gained in the study may be exploited for developing algorithms for PET-image reconstruction and for enabling PET-configuration design of practical usefulness in preclinical and clinical applications. PMID:27452653

  11. Nodal Analysis Optimization Based on the Use of Virtual Current Sources: A Powerful New Pedagogical Method

    ERIC Educational Resources Information Center

    Chatzarakis, G. E.

    2009-01-01

    This paper presents a new pedagogical method for nodal analysis optimization based on the use of virtual current sources, applicable to any linear electric circuit (LEC), regardless of its complexity. The proposed method leads to straightforward solutions, mostly arrived at by inspection. Furthermore, the method is easily adapted to computer…

  12. A method for investigating system matrix properties in optimization-based CT reconstruction

    NASA Astrophysics Data System (ADS)

    Rose, Sean D.; Sidky, Emil Y.; Pan, Xiaochuan

    2016-04-01

    Optimization-based iterative reconstruction methods have shown much promise for a variety of applications in X-ray computed tomography (CT). In these reconstruction methods, the X-ray measurement is modeled as a linear mapping from a finite-dimensional image space to a finite dimensional data-space. This mapping is dependent on a number of factors including the basis functions used for image representation1 and the method by which the matrix representing this mapping is generated.2 Understanding the properties of this linear mapping and how it depends on our choice of parameters is fundamental to optimization-based reconstruction. In this work, we confine our attention to a pixel basis and propose a method to investigate the effect of pixel size in optimization-based reconstruction. The proposed method provides insight into the tradeoff between higher resolution image representation and matrix conditioning. We demonstrate this method for a particular breast CT system geometry. We find that the images obtained from accurate solution of a least squares reconstruction optimization problem have high sensitivity to pixel size within certain regimes. We propose two methods by which this sensitivity can be reduced and demonstrate their efficacy. Our results indicate that the choice of pixel size in optimization-based reconstruction can have great impact on the quality of the reconstructed image, and that understanding the properties of the linear mapping modeling the X-ray measurement can help guide us with this choice.

  13. Artificial intelligent techniques for optimizing water allocation in a reservoir watershed

    NASA Astrophysics Data System (ADS)

    Chang, Fi-John; Chang, Li-Chiu; Wang, Yu-Chung

    2014-05-01

    This study proposes a systematical water allocation scheme that integrates system analysis with artificial intelligence techniques for reservoir operation in consideration of the great uncertainty upon hydrometeorology for mitigating droughts impacts on public and irrigation sectors. The AI techniques mainly include a genetic algorithm and adaptive-network based fuzzy inference system (ANFIS). We first derive evaluation diagrams through systematic interactive evaluations on long-term hydrological data to provide a clear simulation perspective of all possible drought conditions tagged with their corresponding water shortages; then search the optimal reservoir operating histogram using genetic algorithm (GA) based on given demands and hydrological conditions that can be recognized as the optimal base of input-output training patterns for modelling; and finally build a suitable water allocation scheme through constructing an adaptive neuro-fuzzy inference system (ANFIS) model with a learning of the mechanism between designed inputs (water discount rates and hydrological conditions) and outputs (two scenarios: simulated and optimized water deficiency levels). The effectiveness of the proposed approach is tested on the operation of the Shihmen Reservoir in northern Taiwan for the first paddy crop in the study area to assess the water allocation mechanism during drought periods. We demonstrate that the proposed water allocation scheme significantly and substantially avails water managers of reliably determining a suitable discount rate on water supply for both irrigation and public sectors, and thus can reduce the drought risk and the compensation amount induced by making restrictions on agricultural use water.

  14. Latent IBP Compound Dirichlet Allocation.

    PubMed

    Archambeau, Cedric; Lakshminarayanan, Balaji; Bouchard, Guillaume

    2015-02-01

    We introduce the four-parameter IBP compound Dirichlet process (ICDP), a stochastic process that generates sparse non-negative vectors with potentially an unbounded number of entries. If we repeatedly sample from the ICDP we can generate sparse matrices with an infinite number of columns and power-law characteristics. We apply the four-parameter ICDP to sparse nonparametric topic modelling to account for the very large number of topics present in large text corpora and the power-law distribution of the vocabulary of natural languages. The model, which we call latent IBP compound Dirichlet allocation (LIDA), allows for power-law distributions, both, in the number of topics summarising the documents and in the number of words defining each topic. It can be interpreted as a sparse variant of the hierarchical Pitman-Yor process when applied to topic modelling. We derive an efficient and simple collapsed Gibbs sampler closely related to the collapsed Gibbs sampler of latent Dirichlet allocation (LDA), making the model applicable in a wide range of domains. Our nonparametric Bayesian topic model compares favourably to the widely used hierarchical Dirichlet process and its heavy tailed version, the hierarchical Pitman-Yor process, on benchmark corpora. Experiments demonstrate that accounting for the power-distribution of real data is beneficial and that sparsity provides more interpretable results. PMID:26353244

  15. Constrained Allocation Flux Balance Analysis.

    PubMed

    Mori, Matteo; Hwa, Terence; Martin, Olivier C; De Martino, Andrea; Marinari, Enzo

    2016-06-01

    New experimental results on bacterial growth inspire a novel top-down approach to study cell metabolism, combining mass balance and proteomic constraints to extend and complement Flux Balance Analysis. We introduce here Constrained Allocation Flux Balance Analysis, CAFBA, in which the biosynthetic costs associated to growth are accounted for in an effective way through a single additional genome-wide constraint. Its roots lie in the experimentally observed pattern of proteome allocation for metabolic functions, allowing to bridge regulation and metabolism in a transparent way under the principle of growth-rate maximization. We provide a simple method to solve CAFBA efficiently and propose an "ensemble averaging" procedure to account for unknown protein costs. Applying this approach to modeling E. coli metabolism, we find that, as the growth rate increases, CAFBA solutions cross over from respiratory, growth-yield maximizing states (preferred at slow growth) to fermentative states with carbon overflow (preferred at fast growth). In addition, CAFBA allows for quantitatively accurate predictions on the rate of acetate excretion and growth yield based on only 3 parameters determined by empirical growth laws. PMID:27355325

  16. Constrained Allocation Flux Balance Analysis

    PubMed Central

    Mori, Matteo; Hwa, Terence; Martin, Olivier C.

    2016-01-01

    New experimental results on bacterial growth inspire a novel top-down approach to study cell metabolism, combining mass balance and proteomic constraints to extend and complement Flux Balance Analysis. We introduce here Constrained Allocation Flux Balance Analysis, CAFBA, in which the biosynthetic costs associated to growth are accounted for in an effective way through a single additional genome-wide constraint. Its roots lie in the experimentally observed pattern of proteome allocation for metabolic functions, allowing to bridge regulation and metabolism in a transparent way under the principle of growth-rate maximization. We provide a simple method to solve CAFBA efficiently and propose an “ensemble averaging” procedure to account for unknown protein costs. Applying this approach to modeling E. coli metabolism, we find that, as the growth rate increases, CAFBA solutions cross over from respiratory, growth-yield maximizing states (preferred at slow growth) to fermentative states with carbon overflow (preferred at fast growth). In addition, CAFBA allows for quantitatively accurate predictions on the rate of acetate excretion and growth yield based on only 3 parameters determined by empirical growth laws. PMID:27355325

  17. Bit-to-bit error dependence in direct-sequence spread-spectrum multiple-access packet radio systems

    NASA Astrophysics Data System (ADS)

    Morrow, Robert K., Jr.

    1988-05-01

    Slotted direct-sequence spread-spectrum multiple-access (DS/SSMA) packet broadcasting systems with random signature sequences are analyzed within the framework of the lower three layers of the International Standards Organization Reference Model of Open Systems Interconnection. At the physical layer, we show that a widely-used Gaussian approximation (which we call the Standard Gaussian Approximation) for the probability of data bit error in a chip and phase asynchronous system is accurate only when there are a large number of simultaneous users on the channel; otherwise, this approximation can be optimistic by several orders of magnitude. For interfering signals with fixed delays and phases relative to the desired signal, however, the Standard Gaussian Approximation is quite accurate for any number of simultaneous users. To obtain a closer approximation to the probability of data bit error for an asynchronous system, we introduce the Improved Gaussian Approximation, which involves finding the distribution of the multiple-access interference variance over all possible delay and phase values and then taking a Gaussian approximation over the support of the distribution and averaging the results. To accurately analyze packet performance at the data link layer, we first use the theory of moment spaces to gain insight on the effect of bit-to-bit error dependence caused by the constant relative delays and (possibly) phases of the interfering signals over the duration of a desired packet.

  18. Allocating Railway Platforms Using A Genetic Algorithm

    NASA Astrophysics Data System (ADS)

    Clarke, M.; Hinde, C. J.; Withall, M. S.; Jackson, T. W.; Phillips, I. W.; Brown, S.; Watson, R.

    This paper describes an approach to automating railway station platform allocation. The system uses a Genetic Algorithm (GA) to find how a station’s resources should be allocated. Real data is used which needs to be transformed to be suitable for the automated system. Successful or ‘fit’ allocations provide a solution that meets the needs of the station schedule including platform re-occupation and various other constraints. The system associates the train data to derive the station requirements. The Genetic Algorithm is used to derive platform allocations. Finally, the system may be extended to take into account how further parameters that are external to the station have an effect on how an allocation should be applied. The system successfully allocates around 1000 trains to platforms in around 30 seconds requiring a genome of around 1000 genes to achieve this.

  19. Feedback Allocation for OFDMA Systems With Slow Frequency-Domain Scheduling

    NASA Astrophysics Data System (ADS)

    Ganapathy, Harish; Banerjee, Siddhartha; Dimitrov, Nedialko B.; Caramanis, Constantine

    2012-12-01

    We study the problem of allocating limited feedback resources across multiple users in an orthogonal-frequency-division-multiple-access downlink system with slow frequency-domain scheduling. Many flavors of slow frequency-domain scheduling (e.g., persistent scheduling, semi-persistent scheduling), that adapt user-sub-band assignments on a slower time-scale, are being considered in standards such as 3GPP Long-Term Evolution. In this paper, we develop a feedback allocation algorithm that operates in conjunction with any arbitrary slow frequency-domain scheduler with the goal of improving the throughput of the system. Given a user-sub-band assignment chosen by the scheduler, the feedback allocation algorithm involves solving a weighted sum-rate maximization at each (slow) scheduling instant. We first develop an optimal dynamic-programming-based algorithm to solve the feedback allocation problem with pseudo-polynomial complexity in the number of users and in the total feedback bit budget. We then propose two approximation algorithms with complexity further reduced, for scenarios where the problem exhibits additional structure.

  20. Power allocation strategies to minimize energy consumption in wireless body area networks.

    PubMed

    Kailas, Aravind

    2011-01-01

    The wide scale deployment of wireless body area networks (WBANs) hinges on designing energy efficient communication protocols to support the reliable communication as well as to prolong the network lifetime. Cooperative communications, a relatively new idea in wireless communications, offers the benefits of multi-antenna systems, thereby improving the link reliability and boosting energy efficiency. In this short paper, the advantages of resorting to cooperative communications for WBANs in terms of minimized energy consumption are investigated. Adopting an energy model that encompasses energy consumptions in the transmitter and receiver circuits, and transmitting energy per bit, it is seen that cooperative transmission can improve energy efficiency of the wireless network. In particular, the problem of optimal power allocation is studied with the constraint of targeted outage probability. Two strategies of power allocation are considered: power allocation with and without posture state information. Using analysis and simulation-based results, two key points are demonstrated: (i) allocating power to the on-body sensors making use of the posture information can reduce the total energy consumption of the WBAN; and (ii) when the channel condition is good, it is better to recruit less relays for cooperation to enhance energy efficiency. PMID:22254777

  1. Dynamic and balanced capacity allocation scheme with uniform bandwidth for OFDM-PON systems

    NASA Astrophysics Data System (ADS)

    Lei, Cheng; Chen, Hongwei; Chen, Minghua; Yu, Ying; Guo, Qiang; Yang, Sigang; Xie, Shizhong

    2015-03-01

    As the bitrate of orthogonal frequency division multiplexing passive optical network (OFDM-PON) system is continuously increasing, how to effectively allocate the system bandwidth among the huge number of optical network units (ONUs) is one of the key problems before OFDM-PON can be practical deployed. Unlike traditional bandwidth allocation scheme, in this paper, the transmission performance of single ONU is for the first time taken into consideration and optimized. To reduce the manufacturing complexity and fully utilize the processing ability of the receivers, the system bandwidth is equally distributed to the ONUs. Bit loading is used to allocate the total transmission capacity, and power loading is used to guarantee the ONUs have balanced transmission performance even if they operate at different bitrate. In this way, a dynamic and balanced capacity allocation scheme with uniform bandwidth for OFDM-PON systems can be realized. At last, an experimental system is established to verify the feasibility of the proposed scheme, and the influence that the scheme brings to the whole system is also analyzed.

  2. Constant-quality constrained-rate allocation for FGS video coded bitstreams

    NASA Astrophysics Data System (ADS)

    Zhang, Xi Min; Vetro, Anthony; Shi, Yun-Qing; Sun, Huifang

    2002-01-01

    This paper proposes an optimal rate allocation scheme for Fine-Granular Scalability (FGS) coded bitstreams that can achieve constant quality reconstruction of frames under a dynamic rate budget constraint. In doing so, we also aim to minimize the overall distortion at the same time. To achieve this, we propose a novel R-D labeling scheme to characterize the R-D relationship of the source coding process. Specifically, sets of R-D points are extracted during the encoding process and linear interpolation is used to estimate the actual R-D curve of the enhancement layer signal. The extracted R-D information is then used by an enhancement layer transcoder to determine the bits that should be allocated per frame. A sliding window based rate allocation method is proposed to realize constant quality among frames. This scheme is first considered for a single FGS coded source, then extended to operate on multiple sources. With the proposed scheme, the rate allocation can be performed in a single pass, hence the complexity is quite low. Experimental results confirm the effectiveness of the proposed scheme under static and dynamic bandwidth conditions.

  3. An intelligent allocation algorithm for parallel processing

    NASA Technical Reports Server (NTRS)

    Carroll, Chester C.; Homaifar, Abdollah; Ananthram, Kishan G.

    1988-01-01

    The problem of allocating nodes of a program graph to processors in a parallel processing architecture is considered. The algorithm is based on critical path analysis, some allocation heuristics, and the execution granularity of nodes in a program graph. These factors, and the structure of interprocessor communication network, influence the allocation. To achieve realistic estimations of the executive durations of allocations, the algorithm considers the fact that nodes in a program graph have to communicate through varying numbers of tokens. Coarse and fine granularities have been implemented, with interprocessor token-communication duration, varying from zero up to values comparable to the execution durations of individual nodes. The effect on allocation of communication network structures is demonstrated by performing allocations for crossbar (non-blocking) and star (blocking) networks. The algorithm assumes the availability of as many processors as it needs for the optimal allocation of any program graph. Hence, the focus of allocation has been on varying token-communication durations rather than varying the number of processors. The algorithm always utilizes as many processors as necessary for the optimal allocation of any program graph, depending upon granularity and characteristics of the interprocessor communication network.

  4. Constant time worker thread allocation via configuration caching

    DOEpatents

    Eichenberger, Alexandre E; O'Brien, John K. P.

    2014-11-04

    Mechanisms are provided for allocating threads for execution of a parallel region of code. A request for allocation of worker threads to execute the parallel region of code is received from a master thread. Cached thread allocation information identifying prior thread allocations that have been performed for the master thread are accessed. Worker threads are allocated to the master thread based on the cached thread allocation information. The parallel region of code is executed using the allocated worker threads.

  5. Earth boring bit with improved rigid face seal assembly

    SciTech Connect

    Burr, B.H.

    1987-05-19

    An earth boring bit is described with an improved pressure compensating face seal assembly having one rigid ring and sealing face carried by a bearing shaft and an opposed sealing face carried by the cutter. The bit comprises: a body; a cantilevered bearing shaft having a generally cylindrical journal bearing and positioned to extend obliquely inwardly and downwardly from the body; a cutter having a generally cylindrical bearing formed internally therein, secured for rotation about the journal bearing of the shaft; a lubrication system in the body, including a hydrostatic pressure compensator to lubricate the bearings; and a cutter seal groove formed near the outermost region of the cylindrical bearing in the cutter to have a circumferential, generally cylindrical wall.

  6. A 128K-bit CCD buffer memory system

    NASA Technical Reports Server (NTRS)

    Siemens, K. H.; Wallace, R. W.; Robinson, C. R.

    1976-01-01

    A prototype system was implemented to demonstrate that CCD's can be applied advantageously to the problem of low power digital storage and particularly to the problem of interfacing widely varying data rates. 8K-bit CCD shift register memories were used to construct a feasibility model 128K-bit buffer memory system. Peak power dissipation during a data transfer is less than 7 W., while idle power is approximately 5.4 W. The system features automatic data input synchronization with the recirculating CCD memory block start address. Descriptions are provided of both the buffer memory system and a custom tester that was used to exercise the memory. The testing procedures and testing results are discussed. Suggestions are provided for further development with regards to the utilization of advanced versions of CCD memory devices to both simplified and expanded memory system applications.

  7. Pack carburizing process for earth boring drill bits

    SciTech Connect

    Simons, R.W.; Scott, D.E.; Poland, J.R.

    1987-02-17

    A method is described of manufacturing an earth boring drill bit of the type having a bearing pin extending from a head section of the drill bit for rotatably mounting a cutter, comprising the steps of: providing a container having opposing end openings with sidewalls therebetween which define a container interior; placing the container over a portion of the head section so that the pin extends within the interior of the container; installing a spring spacer within the interior of the container about at least a portion of the circumference of the bearing pin at least one axial location; packing the container with a particulate treating medium; covering the container; and placing the pin and container into a furnace for a time and at a temperature to activate the treating medium.

  8. Efficient biased random bit generation for parallel processing

    SciTech Connect

    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.

  9. Fully Distrustful Quantum Bit Commitment and Coin Flipping

    NASA Astrophysics Data System (ADS)

    Silman, J.; Chailloux, A.; Aharon, N.; Kerenidis, I.; Pironio, S.; Massar, S.

    2011-06-01

    In the distrustful quantum cryptography model the parties have conflicting interests and do not trust one another. Nevertheless, they trust the quantum devices in their labs. The aim of the device-independent approach to cryptography is to do away with the latter assumption, and, consequently, significantly increase security. It is an open question whether the scope of this approach also extends to protocols in the distrustful cryptography model, thereby rendering them “fully” distrustful. In this Letter, we show that for bit commitment—one of the most basic primitives within the model—the answer is positive. We present a device-independent (imperfect) bit-commitment protocol, where Alice’s and Bob’s cheating probabilities are ≃0.854 and (3)/(4), which we then use to construct a device-independent coin flipping protocol with bias ≲0.336.

  10. Finger Vein Recognition Based on a Personalized Best Bit Map

    PubMed Central

    Yang, Gongping; Xi, Xiaoming; Yin, Yilong

    2012-01-01

    Finger vein patterns have recently been recognized as an effective biometric identifier. In this paper, we propose a finger vein recognition method based on a personalized best bit map (PBBM). Our method is rooted in a local binary pattern based method and then inclined to use the best bits only for matching. We first present the concept of PBBM and the generating algorithm. Then we propose the finger vein recognition framework, which consists of preprocessing, feature extraction, and matching. Finally, we design extensive experiments to evaluate the effectiveness of our proposal. Experimental results show that PBBM achieves not only better performance, but also high robustness and reliability. In addition, PBBM can be used as a general framework for binary pattern based recognition. PMID:22438735

  11. The 40 Gbps cascaded bit-interleaving PON

    NASA Astrophysics Data System (ADS)

    Vyncke, A.; Torfs, G.; Van Praet, C.; Verbeke, M.; Duque, A.; Suvakovic, D.; Chow, H. K.; Yin, X.

    2015-12-01

    In this paper, a 40 Gbps cascaded bit-interleaving passive optical network (CBI-PON) is proposed to achieve power reduction in the network. The massive number of devices in the access network makes that power consumption reduction in this part of the network has a major impact on the total network power consumption. Starting from the proven BiPON technology, an extension to this concept is proposed to introduce multiple levels of bit-interleaving. The paper discusses the CBI protocol in detail, as well as an ASIC implementation of the required custom CBI Repeater and End-ONT. From the measurements of this first 40 Gbps ASIC prototype, power consumption reduction estimates are presented.

  12. Very low bit rate voice for packetized mobile applications

    SciTech Connect

    Knittle, C.D.; Malone, K.T. )

    1991-01-01

    This paper reports that transmitting digital voice via packetized mobile communications systems that employ relatively short packet lengths and narrow bandwidths often necessitates very low bit rate coding of the voice data. Sandia National Laboratories is currently developing an efficient voice coding system operating at 800 bits per second (bps). The coding scheme is a modified version of the 2400 bps NSA LPC-10e standard. The most significant modification to the LPC-10e scheme is the vector quantization of the line spectrum frequencies associated with the synthesis filters. An outline of a hardware implementation for the 800 bps coder is presented. The speech quality of the coder is generally good, although speaker recognition is not possible. Further research is being conducted to reduce the memory requirements and complexity of the vector quantizer, and to increase the quality of the reconstructed speech. This work may be of use dealing with nuclear materials.

  13. Very low bit rate voice for packetized mobile applications

    SciTech Connect

    Knittle, C.D.; Malone, K.T.

    1991-01-01

    Transmitting digital voice via packetized mobile communications systems that employ relatively short packet lengths and narrow bandwidths often necessitates very low bit rate coding of the voice data. Sandia National Laboratories is currently developing an efficient voice coding system operating at 800 bits per second (bps). The coding scheme is a modified version of the 2400 bps NSA LPC-10e standard. The most significant modification to the LPC-10e scheme is the vector quantization of the line spectrum frequencies associated with the synthesis filters. An outline of a hardware implementation for the 800 bps coder is presented. The speech quality of the coder is generally good, although speaker recognition is not possible. Further research is being conducted to reduce the memory requirements and complexity of the vector quantizer, and to increase the quality of the reconstructed speech. 4 refs., 2 figs., 3 tabs.

  14. Photon-number-resolving detector with 10 bits of resolution

    SciTech Connect

    Jiang, Leaf A.; Dauler, Eric A.; Chang, Joshua T

    2007-06-15

    A photon-number-resolving detector with single-photon resolution is described and demonstrated. It has 10 bits of resolution, does not require cryogenic cooling, and is sensitive to near ir wavelengths. This performance is achieved by flood illuminating a 32x32 element In{sub x}Ga{sub 1-x}AsP Geiger-mode avalanche photodiode array that has an integrated counter and digital readout circuit behind each pixel.

  15. Photon-number-resolving detector with 10bits of resolution

    NASA Astrophysics Data System (ADS)

    Jiang, Leaf A.; Dauler, Eric A.; Chang, Joshua T.

    2007-06-01

    A photon-number-resolving detector with single-photon resolution is described and demonstrated. It has 10bits of resolution, does not require cryogenic cooling, and is sensitive to near ir wavelengths. This performance is achieved by flood illuminating a 32×32 element InxGa1-xAsP Geiger-mode avalanche photodiode array that has an integrated counter and digital readout circuit behind each pixel.

  16. High performance 14-bit pipelined redundant signed digit ADC

    NASA Astrophysics Data System (ADS)

    Narula, Swina; Pandey, Sujata

    2016-03-01

    A novel architecture of a pipelined redundant-signed-digit analog to digital converter (RSD-ADC) is presented featuring a high signal to noise ratio (SNR), spurious free dynamic range (SFDR) and signal to noise plus distortion (SNDR) with efficient background correction logic. The proposed ADC architecture shows high accuracy with a high speed circuit and efficient utilization of the hardware. This paper demonstrates the functionality of the digital correction logic of 14-bit pipelined ADC at each 1.5 bit/stage. This prototype of ADC architecture accounts for capacitor mismatch, comparator offset and finite Op-Amp gain error in the MDAC (residue amplification circuit) stages. With the proposed architecture of ADC, SNDR obtained is 85.89 dB, SNR is 85.9 dB and SFDR obtained is 102.8 dB at the sample rate of 100 MHz. This novel architecture of digital correction logic is transparent to the overall system, which is demonstrated by using 14-bit pipelined ADC. After a latency of 14 clocks, digital output will be available at every clock pulse. To describe the circuit behavior of the ADC, VHDL and MATLAB programs are used. The proposed architecture is also capable of reducing the digital hardware. Silicon area is also the complexity of the design.

  17. Simplified 2-bit photonic digital-to-analog conversion unit based on polarization multiplexing

    NASA Astrophysics Data System (ADS)

    Zhang, Fangzheng; Gao, Bindong; Ge, Xiaozhong; Pan, Shilong

    2016-03-01

    A 2-bit photonic digital-to-analog conversion unit is proposed and demonstrated based on polarization multiplexing. The proposed 2-bit digital-to-analog converter (DAC) unit is realized by optical intensity weighting and summing, and its complexity is greatly reduced compared with the traditional 2-bit photonic DACs. Performance of the proposed 2-bit DAC unit is experimentally investigated. The established 2-bit DAC unit achieves a good linear transfer function, and the effective number of bits is calculated to be 1.3. Based on the proposed 2-bit DAC unit, two DAC structures with higher (>2) bit resolutions are proposed and discussed, and the system complexity is expected to be reduced by half by using the proposed technique.

  18. 40 CFR 74.26 - Allocation formula.

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ... 40 Protection of Environment 16 2010-07-01 2010-07-01 false Allocation formula. 74.26 Section 74.26 Protection of Environment ENVIRONMENTAL PROTECTION AGENCY (CONTINUED) AIR PROGRAMS (CONTINUED) SULFUR DIOXIDE OPT-INS Allowance Calculations for Combustion Sources § 74.26 Allocation formula. (a)...

  19. Projected 1999-2000 Cost Allocation Summary.

    ERIC Educational Resources Information Center

    Wisconsin Technical Coll. System Board, Madison.

    Information contained in this summary was derived from data submitted by Wisconsin technical colleges on their 1999-2000 projected cost allocation schedules. Cost allocation information is used to calculate the distribution of state aids to each college, and prepare financial and enrollment reports including state statistical summaries and reports…

  20. 45 CFR 205.150 - Cost allocation.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... ASSISTANCE PROGRAMS § 205.150 Cost allocation. A State plan under title I, IV-A, X, XIV, or XVI (AABD) of the Social Security Act must provide that the State agency will have an approved cost allocation plan on file with the Department in accordance with the requirements contained in subpart E of 45 CFR part...

  1. 45 CFR 205.150 - Cost allocation.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... ASSISTANCE PROGRAMS § 205.150 Cost allocation. A State plan under title I, IV-A, X, XIV, or XVI (AABD) of the Social Security Act must provide that the State agency will have an approved cost allocation plan on file with the Department in accordance with the requirements contained in subpart E of 45 CFR part...

  2. 24 CFR 945.203 - Allocation plan.

    Code of Federal Regulations, 2012 CFR

    2012-04-01

    ... units based on information provided by: (A) The needs assessment prepared in accordance with 24 CFR 8.25... dwelling units in the project for the year preceding the date of submission of the allocation plan to HUD... available for occupancy during the two-year period following the date of submission of the allocation...

  3. 50 CFR 600.517 - Allocations.

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ... 50 Wildlife and Fisheries 12 2013-10-01 2013-10-01 false Allocations. 600.517 Section 600.517 Wildlife and Fisheries FISHERY CONSERVATION AND MANAGEMENT, NATIONAL OCEANIC AND ATMOSPHERIC ADMINISTRATION, DEPARTMENT OF COMMERCE MAGNUSON-STEVENS ACT PROVISIONS Foreign Fishing § 600.517 Allocations. The...

  4. 50 CFR 600.517 - Allocations.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... 50 Wildlife and Fisheries 8 2010-10-01 2010-10-01 false Allocations. 600.517 Section 600.517 Wildlife and Fisheries FISHERY CONSERVATION AND MANAGEMENT, NATIONAL OCEANIC AND ATMOSPHERIC ADMINISTRATION, DEPARTMENT OF COMMERCE MAGNUSON-STEVENS ACT PROVISIONS Foreign Fishing § 600.517 Allocations. The...

  5. 50 CFR 660.320 - Allocations.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... limited entry gear is open. When the fishery for a vessel's limited entry gear has closed, groundfish caught by that vessel with open access gear will be counted against the open access allocation. All... Indian fishery, is divided into limited entry and open access fisheries. Separate allocations for...

  6. Thematic Mapper data for forest resource allocation

    NASA Technical Reports Server (NTRS)

    Zeff, Ilene S.; Merry, Carolyn J.

    1993-01-01

    A technique for classifying a Landsat Thematic Mapper image was demonstrated on the Wayne National Forest of southeastern Ohio. The classified image was integrated into a geographic information system database, and prescriptive forest land use allocation models were developed using the techniques of cartographic modeling. Timber harvest sites and accompanying haul roads were allocated.

  7. 23 CFR 1240.15 - Allocations.

    Code of Federal Regulations, 2014 CFR

    2014-04-01

    ... 23 Highways 1 2014-04-01 2014-04-01 false Allocations. 1240.15 Section 1240.15 Highways NATIONAL HIGHWAY TRAFFIC SAFETY ADMINISTRATION AND FEDERAL HIGHWAY ADMINISTRATION, DEPARTMENT OF TRANSPORTATION GUIDELINES SAFETY INCENTIVE GRANTS FOR USE OF SEAT BELTS-ALLOCATIONS BASED ON SEAT BELT USE...

  8. 23 CFR 1240.15 - Allocations.

    Code of Federal Regulations, 2010 CFR

    2010-04-01

    ... 23 Highways 1 2010-04-01 2010-04-01 false Allocations. 1240.15 Section 1240.15 Highways NATIONAL HIGHWAY TRAFFIC SAFETY ADMINISTRATION AND FEDERAL HIGHWAY ADMINISTRATION, DEPARTMENT OF TRANSPORTATION GUIDELINES SAFETY INCENTIVE GRANTS FOR USE OF SEAT BELTS-ALLOCATIONS BASED ON SEAT BELT USE...

  9. 23 CFR 1240.15 - Allocations.

    Code of Federal Regulations, 2013 CFR

    2013-04-01

    ... 23 Highways 1 2013-04-01 2013-04-01 false Allocations. 1240.15 Section 1240.15 Highways NATIONAL HIGHWAY TRAFFIC SAFETY ADMINISTRATION AND FEDERAL HIGHWAY ADMINISTRATION, DEPARTMENT OF TRANSPORTATION GUIDELINES SAFETY INCENTIVE GRANTS FOR USE OF SEAT BELTS-ALLOCATIONS BASED ON SEAT BELT USE...

  10. 23 CFR 1240.15 - Allocations.

    Code of Federal Regulations, 2011 CFR

    2011-04-01

    ... 23 Highways 1 2011-04-01 2011-04-01 false Allocations. 1240.15 Section 1240.15 Highways NATIONAL HIGHWAY TRAFFIC SAFETY ADMINISTRATION AND FEDERAL HIGHWAY ADMINISTRATION, DEPARTMENT OF TRANSPORTATION GUIDELINES SAFETY INCENTIVE GRANTS FOR USE OF SEAT BELTS-ALLOCATIONS BASED ON SEAT BELT USE...

  11. 23 CFR 1240.15 - Allocations.

    Code of Federal Regulations, 2012 CFR

    2012-04-01

    ... 23 Highways 1 2012-04-01 2012-04-01 false Allocations. 1240.15 Section 1240.15 Highways NATIONAL HIGHWAY TRAFFIC SAFETY ADMINISTRATION AND FEDERAL HIGHWAY ADMINISTRATION, DEPARTMENT OF TRANSPORTATION GUIDELINES SAFETY INCENTIVE GRANTS FOR USE OF SEAT BELTS-ALLOCATIONS BASED ON SEAT BELT USE...

  12. 10 CFR 490.503 - Credit allocation.

    Code of Federal Regulations, 2011 CFR

    2011-01-01

    ... 10 Energy 3 2011-01-01 2011-01-01 false Credit allocation. 490.503 Section 490.503 Energy DEPARTMENT OF ENERGY ENERGY CONSERVATION ALTERNATIVE FUEL TRANSPORTATION PROGRAM Alternative Fueled Vehicle... described in section 490.507 of this part, DOE shall allocate one credit for each alternative fueled...

  13. 10 CFR 490.503 - Credit allocation.

    Code of Federal Regulations, 2010 CFR

    2010-01-01

    ... 10 Energy 3 2010-01-01 2010-01-01 false Credit allocation. 490.503 Section 490.503 Energy DEPARTMENT OF ENERGY ENERGY CONSERVATION ALTERNATIVE FUEL TRANSPORTATION PROGRAM Alternative Fueled Vehicle... described in section 490.507 of this part, DOE shall allocate one credit for each alternative fueled...

  14. 10 CFR 490.503 - Credit allocation.

    Code of Federal Regulations, 2013 CFR

    2013-01-01

    ... 10 Energy 3 2013-01-01 2013-01-01 false Credit allocation. 490.503 Section 490.503 Energy DEPARTMENT OF ENERGY ENERGY CONSERVATION ALTERNATIVE FUEL TRANSPORTATION PROGRAM Alternative Fueled Vehicle... described in section 490.507 of this part, DOE shall allocate one credit for each alternative fueled...

  15. 10 CFR 490.503 - Credit allocation.

    Code of Federal Regulations, 2012 CFR

    2012-01-01

    ... 10 Energy 3 2012-01-01 2012-01-01 false Credit allocation. 490.503 Section 490.503 Energy DEPARTMENT OF ENERGY ENERGY CONSERVATION ALTERNATIVE FUEL TRANSPORTATION PROGRAM Alternative Fueled Vehicle... described in section 490.507 of this part, DOE shall allocate one credit for each alternative fueled...

  16. Rethinking Reinforcement: Allocation, Induction, and Contingency

    ERIC Educational Resources Information Center

    Baum, William M.

    2012-01-01

    The concept of reinforcement is at least incomplete and almost certainly incorrect. An alternative way of organizing our understanding of behavior may be built around three concepts: "allocation," "induction," and "correlation." Allocation is the measure of behavior and captures the centrality of choice: All behavior entails choice and consists of…

  17. A Time Allocation Study of University Faculty

    ERIC Educational Resources Information Center

    Link, Albert N.; Swann, Christopher A.; Bozeman, Barry

    2008-01-01

    Many previous time allocation studies treat work as a single activity and examine trade-offs between work and other activities. This paper investigates the at-work allocation of time among teaching, research, grant writing and service by science and engineering faculty at top US research universities. We focus on the relationship between tenure…

  18. 50 CFR 660.55 - Allocations.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... halibut regulations) is managed under regulations at 50 CFR part 300, subpart E. Beginning with the 2011..., the OY is reduced by the Pacific Coast treaty Indian tribal harvest (allocations, set-asides, and...: recreational estimates are not deducted here). (1) Pacific Coast treaty Indian tribal allocations,...

  19. Acquisitions Allocations: Fairness, Equity and Bundled Pricing.

    ERIC Educational Resources Information Center

    Packer, Donna

    2001-01-01

    Examined the effect of an interdisciplinary Web-based citation database with full text, the ProQuest Research Library, on the Western State University library's acquisitions allocation plan. Used list price of full-text journals to calculate increases in acquisitions funding. A list of articles discussing formula allocation is appended.…

  20. 42 CFR 24.2 - Allocation.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... 42 Public Health 1 2011-10-01 2011-10-01 false Allocation. 24.2 Section 24.2 Public Health PUBLIC HEALTH SERVICE, DEPARTMENT OF HEALTH AND HUMAN SERVICES PERSONNEL SENIOR BIOMEDICAL RESEARCH SERVICE § 24.2 Allocation. (a) The Secretary, within the number authorized in the PHS Act, shall determine...

  1. 42 CFR 24.2 - Allocation.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... 42 Public Health 1 2010-10-01 2010-10-01 false Allocation. 24.2 Section 24.2 Public Health PUBLIC HEALTH SERVICE, DEPARTMENT OF HEALTH AND HUMAN SERVICES PERSONNEL SENIOR BIOMEDICAL RESEARCH SERVICE § 24.2 Allocation. (a) The Secretary, within the number authorized in the PHS Act, shall determine...

  2. 48 CFR 5452.249 - Allocation.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... 48 Federal Acquisition Regulations System 7 2011-10-01 2011-10-01 false Allocation. 5452.249 Section 5452.249 Federal Acquisition Regulations System DEFENSE LOGISTICS AGENCY, DEPARTMENT OF DEFENSE SOLICITATION PROVISIONS AND CONTRACT CLAUSES Texts of Provisions and Clauses 5452.249 Allocation. The...

  3. 39 CFR 3060.12 - Asset allocation.

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ... 39 Postal Service 1 2010-07-01 2010-07-01 false Asset allocation. 3060.12 Section 3060.12 Postal Service POSTAL REGULATORY COMMISSION PERSONNEL ACCOUNTING PRACTICES AND TAX RULES FOR THE THEORETICAL COMPETITIVE PRODUCTS ENTERPRISE § 3060.12 Asset allocation. Within 6 months of January 23, 2009, and for...

  4. 42 CFR 433.34 - Cost allocation.

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ... Department in accordance with the requirements contained in subpart E of 45 CFR part 95. Subpart E also sets... 42 Public Health 4 2013-10-01 2013-10-01 false Cost allocation. 433.34 Section 433.34 Public... Provisions § 433.34 Cost allocation. A State plan under Title XIX of the Social Security Act must...

  5. 42 CFR 433.34 - Cost allocation.

    Code of Federal Regulations, 2012 CFR

    2012-10-01

    ... Department in accordance with the requirements contained in subpart E of 45 CFR part 95. Subpart E also sets... 42 Public Health 4 2012-10-01 2012-10-01 false Cost allocation. 433.34 Section 433.34 Public... Provisions § 433.34 Cost allocation. A State plan under Title XIX of the Social Security Act must...

  6. 42 CFR 433.34 - Cost allocation.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... Department in accordance with the requirements contained in subpart E of 45 CFR part 95. Subpart E also sets... 42 Public Health 4 2011-10-01 2011-10-01 false Cost allocation. 433.34 Section 433.34 Public... Provisions § 433.34 Cost allocation. A State plan under Title XIX of the Social Security Act must...

  7. 48 CFR 5452.249 - Allocation.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... 48 Federal Acquisition Regulations System 7 2010-10-01 2010-10-01 false Allocation. 5452.249 Section 5452.249 Federal Acquisition Regulations System DEFENSE LOGISTICS AGENCY, DEPARTMENT OF DEFENSE SOLICITATION PROVISIONS AND CONTRACT CLAUSES Texts of Provisions and Clauses 5452.249 Allocation. The...

  8. 45 CFR 98.55 - Cost allocation.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... 45 Public Welfare 1 2010-10-01 2010-10-01 false Cost allocation. 98.55 Section 98.55 Public Welfare DEPARTMENT OF HEALTH AND HUMAN SERVICES GENERAL ADMINISTRATION CHILD CARE AND DEVELOPMENT FUND Use of Child Care and Development Funds § 98.55 Cost allocation. (a) The Lead Agency and...

  9. 42 CFR 24.2 - Allocation.

    Code of Federal Regulations, 2014 CFR

    2014-10-01

    ... 42 Public Health 1 2014-10-01 2014-10-01 false Allocation. 24.2 Section 24.2 Public Health PUBLIC HEALTH SERVICE, DEPARTMENT OF HEALTH AND HUMAN SERVICES PERSONNEL SENIOR BIOMEDICAL RESEARCH SERVICE § 24... number of SBRS slots to be allocated to each participating Operating Division. (b) The SBRS Policy...

  10. 42 CFR 24.2 - Allocation.

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ... 42 Public Health 1 2013-10-01 2013-10-01 false Allocation. 24.2 Section 24.2 Public Health PUBLIC HEALTH SERVICE, DEPARTMENT OF HEALTH AND HUMAN SERVICES PERSONNEL SENIOR BIOMEDICAL RESEARCH SERVICE § 24... number of SBRS slots to be allocated to each participating Operating Division. (b) The SBRS Policy...

  11. 42 CFR 24.2 - Allocation.

    Code of Federal Regulations, 2012 CFR

    2012-10-01

    ... 42 Public Health 1 2012-10-01 2012-10-01 false Allocation. 24.2 Section 24.2 Public Health PUBLIC HEALTH SERVICE, DEPARTMENT OF HEALTH AND HUMAN SERVICES PERSONNEL SENIOR BIOMEDICAL RESEARCH SERVICE § 24... number of SBRS slots to be allocated to each participating Operating Division. (b) The SBRS Policy...

  12. 50 CFR 660.55 - Allocations.

    Code of Federal Regulations, 2012 CFR

    2012-10-01

    ... Sablefish S. of 36° N. lat. 42 58 PACIFIC OCEAN PERCH 95 5 WIDOW 91 9 Chilipepper S. of 40°10′ N. lat. 75 25... rockfish, Pacific Ocean Perch, and widow rockfish, the trawl allocation will be further subdivided among.... For darkblotched rockfish, Pacific Ocean Perch, and widow rockfish, the trawl allocation is...

  13. 50 CFR 660.55 - Allocations.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... Sablefish S. of 36° N. lat. 42 58 PACIFIC OCEAN PERCH 95 5 WIDOW 91 9 Chilipepper S. of 40°10′ N. lat. 75 25... rockfish, Pacific Ocean Perch, and widow rockfish, the trawl allocation will be further subdivided among.... For darkblotched rockfish, Pacific Ocean Perch, and widow rockfish, the trawl allocation is...

  14. 50 CFR 660.55 - Allocations.

    Code of Federal Regulations, 2014 CFR

    2014-10-01

    ... PACIFIC OCEAN PERCH 95 5 WIDOW 91 9 Chilipepper S. of 40°10′ N. lat. 75 25 Splitnose S. of 40°10′ N. lat... rockfish, Pacific Ocean Perch, and widow rockfish, the trawl allocation is further subdivided among the... nonwhiting fishery. (B) Pacific Ocean Perch (POP). Allocate 17 percent or 30 mt, whichever is greater, of...

  15. 50 CFR 660.55 - Allocations.

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ... 50 Wildlife and Fisheries 13 2013-10-01 2013-10-01 false Allocations. 660.55 Section 660.55 Wildlife and Fisheries FISHERY CONSERVATION AND MANAGEMENT, NATIONAL OCEANIC AND ATMOSPHERIC ADMINISTRATION, DEPARTMENT OF COMMERCE (CONTINUED) FISHERIES OFF WEST COAST STATES West Coast Groundfish Fisheries § 660.55 Allocations. (a) General. An...

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

    NASA Astrophysics Data System (ADS)

    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.

  17. Artifact reduction in short-scan CBCT by use of optimization-based reconstruction

    NASA Astrophysics Data System (ADS)

    Zhang, Zheng; Han, Xiao; Pearson, Erik; Pelizzari, Charles; Sidky, Emil Y.; Pan, Xiaochuan

    2016-05-01

    Increasing interest in optimization-based reconstruction in research on, and applications of, cone-beam computed tomography (CBCT) exists because it has been shown to have to potential to reduce artifacts observed in reconstructions obtained with the Feldkamp–Davis–Kress (FDK) algorithm (or its variants), which is used extensively for image reconstruction in current CBCT applications. In this work, we carried out a study on optimization-based reconstruction for possible reduction of artifacts in FDK reconstruction specifically from short-scan CBCT data. The investigation includes a set of optimization programs such as the image-total-variation (TV)-constrained data-divergency minimization, data-weighting matrices such as the Parker weighting matrix, and objects of practical interest for demonstrating and assessing the degree of artifact reduction. Results of investigative work reveal that appropriately designed optimization-based reconstruction, including the image-TV-constrained reconstruction, can reduce significant artifacts observed in FDK reconstruction in CBCT with a short-scan configuration.

  18. Are outcome-adaptive allocation trials ethical?

    PubMed

    Hey, Spencer Phillips; Kimmelman, Jonathan

    2015-04-01

    Randomization is firmly established as a cornerstone of clinical trial methodology. Yet, the ethics of randomization continues to generate controversy. The default, and most efficient, allocation scheme randomizes patients equally (1:1) across all arms of study. However, many randomized trials are using outcome-adaptive allocation schemes, which dynamically adjust the allocation ratio in favor of the better performing treatment arm. Advocates of outcome-adaptive allocation contend that it better accommodates clinical equipoise and promotes informed consent, since such trials limit patient-subject exposure to sub-optimal care. In this essay, we argue that this purported ethical advantage of outcome-adaptive allocation does not stand up to careful scrutiny in the setting of two-armed studies and/or early-phase research. PMID:25649106

  19. Bioethics for clinicians: 13. Resource allocation.

    PubMed

    McKneally, M F; Dickens, B M; Meslin, E M; Singer, P A

    1997-07-15

    Questions of resource allocation can pose practical and ethical dilemmas for clinicians. In the Aristotelian conception of distributive justice, the unequal allocation of a scarce resource may be justified by morally relevant factors such as need or likelihood of benefit. Even using these criteria, it can be difficult to reconcile completing claims to determine which patients should be given priority. To what extent the physician's fiduciary duty toward a patient should supersede the interests of other patients and society as a whole is also a matter of controversy. Although the courts have been reluctant to become involved in allocation decisions in health care, they expect physicians to show allegiance to their patients regardless of budgetary concerns. The allocation of resources on the basis of clinically irrelevant factors such as religion or sexual orientation is prohibited. Clear, fair and publicly acceptable institutional and professional policies can help to ensure that resource allocation decisions are transparent and defensible. PMID:9238146

  20. Core drill's bit is replaceable without withdrawal of drill stem - A concept

    NASA Technical Reports Server (NTRS)

    Rushing, F. C.; Simon, A. B.

    1970-01-01

    Drill bit is divided into several sectors. When collapsed, the outside diameter is forced down the drill stem, when it reaches bottom the sectors are forced outward and form a cutting bit. A dulled bit is retracted by reversal of this procedure.

  1. Carbon allocation and accumulation in conifers

    SciTech Connect

    Gower, S.T.; Isebrands, J.G.; Sheriff, D.W.

    1995-07-01

    Forests cover approximately 33% of the land surface of the earth, yet they are responsible for 65% of the annual carbon (C) accumulated by all terrestrial biomes. In general, total C content and net primary production rates are greater for forests than for other biomes, but C budgets differ greatly among forests. Despite several decades of research on forest C budgets, there is still an incomplete understanding of the factors controlling C allocation. Yet, if we are to understand how changing global events such as land use, climate change, atmospheric N deposition, ozone, and elevated atmospheric CO{sub 2} affect the global C budget, a mechanistic understanding of C assimilation, partitioning, and allocation is necessary. The objective of this chapter is to review the major factors that influence C allocation and accumulation in conifer trees and forests. In keeping with the theme of this book, we will focus primarily on evergreen conifers. However, even among evergreen conifers, leaf, canopy, and stand-level C and nutrient allocation patterns differ, often as a function of leaf development and longevity. The terminology related to C allocation literature is often inconsistent, confusing and inadequate for understanding and integrating past and current research. For example, terms often used synonymously to describe C flow or movement include translocation, transport, distribution, allocation, partitioning, apportionment, and biomass allocation. A common terminology is needed because different terms have different meanings to readers. In this paper we use C allocation, partitioning, and accumulation according to the definitions of Dickson and Isebrands (1993). Partitioning is the process of C flow into and among different chemical, storage, and transport pools. Allocation is the distribution of C to different plant parts within the plant (i.e., source to sink). Accumulation is the end product of the process of C allocation.

  2. Universality and clustering in 1 + 1 dimensional superstring-bit models

    SciTech Connect

    Bergman, O.; Thorn, C.B.

    1996-03-01

    We construct a 1+1 dimensional superstring-bit model for D=3 Type IIB superstring. This low dimension model escapes the problem encountered in higher dimension models: (1) It possesses full Galilean supersymmetry; (2) For noninteracting Polymers of bits, the exactly soluble linear superpotential describing bit interactions is in a large universality class of superpotentials which includes ones bounded at spatial infinity; (3) The latter are used to construct a superstring-bit model with the clustering properties needed to define an S-matrix for closed polymers of superstring-bits.

  3. Universality and clustering in {bold 1+1} dimensional superstring-bit models

    SciTech Connect

    Bergman, O.; Thorn, C.B.

    1996-03-01

    We construct a 1+1 dimensional superstring-bit model for {ital D}=3 type IIB superstring. This low dimension model escapes the problems encountered in higher dimension models: (1) It possesses full Galilean supersymmetry. (2) For noninteracting polymers of bits, the exactly soluble linear superpotential describing bit interactions is in a large universality class of superpotentials which includes ones bounded at spatial infinity. (3) The latter are used to construct a superstring-bit model with the clustering properties needed to define an {ital S} matrix for closed polymers of superstring bits. {copyright} {ital 1996 The American Physical Society.}

  4. Floating-point function generation routines for 16-bit microcomputers

    NASA Technical Reports Server (NTRS)

    Mackin, M. A.; Soeder, J. F.

    1984-01-01

    Several computer subroutines have been developed that interpolate three types of nonanalytic functions: univariate, bivariate, and map. The routines use data in floating-point form. However, because they are written for use on a 16-bit Intel 8086 system with an 8087 mathematical coprocessor, they execute as fast as routines using data in scaled integer form. Although all of the routines are written in assembly language, they have been implemented in a modular fashion so as to facilitate their use with high-level languages.

  5. Development of an autonomous 32-bit intelligent device controller

    NASA Astrophysics Data System (ADS)

    Bishop, D.; Waters, G.; Dale, D.; Ewert, T.; Harrison, D.; Lam, J.; Keitel, R.

    1994-12-01

    This paper describes the development and present status of an intelligent device controller for embedded systems. The controller is a low-cost single-board module in Euro-card format based on a Motorola MC68332 microcontroller. An onboard Ethernet interface allows software downloading and remote device control. Also included are 12 ADC channels, 4 DAC channels, 56 bits of digital I/O and 3 serial ports. Custom modules may be added using a backplane bus. The controller is designed to function as a VME slave device. A multitasking environment is provided by the VxWorks kernel.

  6. A fast 2-bit digitizer for radio astronomy

    NASA Astrophysics Data System (ADS)

    Padin, Stephen; Ewing, Martin S.

    1989-12-01

    The design and performance details for a 2-bit digitizer operating at a 250-MHz clock rate are presented. The digitizer is part of a new correlator system for a three-element millimeter-wave interferometer. The performance of the digitizer circuit is analyzed in terms of threshold errors, indecision, sampling aperture width, and timing errors. For an input bandwidth of 125 MHz, digitizer distortion actually improves the sensitivity of the interferometer by about 0.3 percent but limits the dynamic range of the instrument to about 2 X 10 to the 3rd.

  7. Fast computational scheme of image compression for 32-bit microprocessors

    NASA Technical Reports Server (NTRS)

    Kasperovich, Leonid

    1994-01-01

    This paper presents a new computational scheme of image compression based on the discrete cosine transform (DCT), underlying JPEG and MPEG International Standards. The algorithm for the 2-d DCT computation uses integer operations (register shifts and additions / subtractions only); its computational complexity is about 8 additions per image pixel. As a meaningful example of an on-board image compression application we consider the software implementation of the algorithm for the Mars Rover (Marsokhod, in Russian) imaging system being developed as a part of Mars-96 International Space Project. It's shown that fast software solution for 32-bit microprocessors may compete with the DCT-based image compression hardware.

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

    NASA Astrophysics Data System (ADS)

    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.

  9. Bit Storage by 360 (°) Domain Walls in Ferromagnetic Nanorings

    NASA Astrophysics Data System (ADS)

    Muratov, Cyrill B.; Osipov, Viatcheslav V.

    2009-08-01

    We propose a design for the magnetic memory cell which allows an efficient storage, recording, and readout of information on the basis of thin film ferromagnetic nanorings. The information bit is represented by the polarity of a stable 360$^\\circ$ domain wall introduced into the ring. Switching between the two magnetization states is achieved by the current applied to a wire passing through the ring, whereby the $360^\\circ$ domain wall splits into two charged $180^\\circ$ walls, which then move to the opposite extreme of the ring to recombine into a $360^\\circ$ wall of the opposite polarity.

  10. Simplified quantum bit commitment using single photon nonlocality

    NASA Astrophysics Data System (ADS)

    He, Guang Ping

    2014-10-01

    We simplified our previously proposed quantum bit commitment (QBC) protocol based on the Mach-Zehnder interferometer, by replacing symmetric beam splitters with asymmetric ones. It eliminates the need for random sending time of the photons; thus, the feasibility and efficiency are both improved. The protocol is immune to the cheating strategy in the Mayers-Lo-Chau no-go theorem of unconditionally secure QBC, because the density matrices of the committed states do not satisfy a crucial condition on which the no-go theorem holds.

  11. Twisted transition of one bit written by trapezoidal single pole

    NASA Astrophysics Data System (ADS)

    Hu, Shengbin; Yuan, Zhimin; Taslim, Sumitro Joyo; Yu, Shengkai; Liu, Bo

    This paper investigates bits transition shift written by a trapezoid single pole at a large skew angle. This work uses the even harmonic ripple effect to modulate the demagnetization field and observe the transition shape clearly. Experiment results indicate that the trapezoid single pole can produce a twisted transition at a large skew angle. This phenomenon is mainly due to the low-frequency data overwriting on the media. The twisted transition will limit the recording density in the perpendicular recording. Simulation work was completed to validate our experiment results. It suggests that the structure of single pole should be further improved to solve the twisted transition generated by the trapezoid single pole.

  12. The allocation of the radio spectrum

    NASA Astrophysics Data System (ADS)

    Jackson, C. L.

    1980-02-01

    The system of the radio spectrum (10 kHz-300 GHz) allocation is discussed in its technical, economic, and managerial aspects. Possible improvements to the system are considered, such as minimizing human management, establishing a single authority for the allocation of the spectrum, and stimulating a more efficient use of the spectrum with economic incentives. The 'anarchy band' concept, a system of dynamic allocation, is suggested as a means of replacing human management with electronic equipment. The growing importance of the satellite portion of the spectrum is also shown.

  13. Linear modelling of attentional resource allocation

    NASA Technical Reports Server (NTRS)

    Pierce, B.

    1978-01-01

    Eight subjects time-shared performance of two compensatory tracking tasks under conditions when both were of constant difficulty, and when the control order of one task (designated primary) was varied over time within a trial. On line performance feedback was presented on half of the trials. The data are interpreted in terms of a linear model of the operator's attention allocation system, and suggest that this allocation is strongly suboptimal. Furthermore, the limitations in reallocating attentional resources between tasks, in response to difficulty fluctuations were not reduced by augmented performance feedback. Some characteristics of the allocation system are described, and reasons for its limitations suggested.

  14. SBI allocation between heavy and singlet missiles

    SciTech Connect

    Canavan, G.H.

    1991-04-01

    The optimal allocation of space-based interceptors (SBIs) between fixed, heavy missiles and mobile singlets can be derived from approximate expressions for the boost-phase penetration of each. Singlets can cluster before launch and have shorter burn times, which reduce their availability to SBIs by an order of magnitude. Singlet penetration decreased slowly with the number of SBIs allocated to them; heavy missile penetration falls rapidly. The allocation to the heavy missiles falls linearly with their number. The penetration of heavy and singlet missiles is proportional to their numbers and inversely proportional to their availability. 8 refs., 2 figs.

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

    NASA Astrophysics Data System (ADS)

    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.

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

    PubMed

    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. PMID:25362380

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

    SciTech Connect

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

    2014-10-15

    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.

  18. Evolution of polycrystalline diamond compact bit designs for Rocky Mountain drilling

    SciTech Connect

    Pain, D.D.; Schieck, B.E.

    1985-07-01

    The Rocky Mountain region of the U.S. has proved to be a good area for polycrystalline diamond compact (PDC) bits in selected formations. Lower costs per foot as a result of higher penetration rates and longer bit lives have been realized in many applications. PDC bits are used routinely in Wyoming in the Green River and Powder River basins. Simply using a PDC bit in these areas does not necessarily ensure an economical run. Care must be taken in choosing the correct bit design for each application to obtain the lowest cost per foot. Since the first PDC bit run, there has been an evolution of designs to enhance penetration rates, and thus to lower drilling cost per foot. This evolution has included changes in bit profile, cutter density, cutter exposure, cutter side rake, and cutter shape. When optimally combined, these features have increased penetration rates by well over 100% in many formations.

  19. Asymmetric Programming: A Highly Reliable Metadata Allocation Strategy for MLC NAND Flash Memory-Based Sensor Systems

    PubMed Central

    Huang, Min; Liu, Zhaoqing; Qiao, Liyan

    2014-01-01

    While the NAND flash memory is widely used as the storage medium in modern sensor systems, the aggressive shrinking of process geometry and an increase in the number of bits stored in each memory cell will inevitably degrade the reliability of NAND flash memory. In particular, it's critical to enhance metadata reliability, which occupies only a small portion of the storage space, but maintains the critical information of the file system and the address translations of the storage system. Metadata damage will cause the system to crash or a large amount of data to be lost. This paper presents Asymmetric Programming, a highly reliable metadata allocation strategy for MLC NAND flash memory storage systems. Our technique exploits for the first time the property of the multi-page architecture of MLC NAND flash memory to improve the reliability of metadata. The basic idea is to keep metadata in most significant bit (MSB) pages which are more reliable than least significant bit (LSB) pages. Thus, we can achieve relatively low bit error rates for metadata. Based on this idea, we propose two strategies to optimize address mapping and garbage collection. We have implemented Asymmetric Programming on a real hardware platform. The experimental results show that Asymmetric Programming can achieve a reduction in the number of page errors of up to 99.05% with the baseline error correction scheme. PMID:25310473

  20. 50 CFR 679.62 - Inshore sector cooperative allocation program.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... pollock cooperative permit. (3) Conversion of quota share percentage to TAC allocations. (Effective April... that subarea. Each cooperative's annual pollock TAC allocation may be published in the proposed...

  1. 50 CFR 679.62 - Inshore sector cooperative allocation program.

    Code of Federal Regulations, 2012 CFR

    2012-10-01

    ... pollock cooperative permit. (3) Conversion of quota share percentage to TAC allocations. (Effective April... that subarea. Each cooperative's annual pollock TAC allocation may be published in the proposed...

  2. 50 CFR 679.62 - Inshore sector cooperative allocation program.

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ... pollock cooperative permit. (3) Conversion of quota share percentage to TAC allocations. (Effective April... that subarea. Each cooperative's annual pollock TAC allocation may be published in the proposed...

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

    NASA Astrophysics Data System (ADS)

    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.

  4. Analysis of an optimization-based atomistic-to-continuum coupling method for point defects

    DOE PAGESBeta

    Olson, Derek; Shapeev, Alexander V.; Bochev, Pavel B.; Luskin, Mitchell

    2015-11-16

    Here, we formulate and analyze an optimization-based Atomistic-to-Continuum (AtC) coupling method for problems with point defects. Application of a potential-based atomistic model near the defect core enables accurate simulation of the defect. Away from the core, where site energies become nearly independent of the lattice position, the method switches to a more efficient continuum model. The two models are merged by minimizing the mismatch of their states on an overlap region, subject to the atomistic and continuum force balance equations acting independently in their domains. We prove that the optimization problem is well-posed and establish error estimates.

  5. A 32-bit Ultrafast Parallel Correlator using Resonant Tunneling Devices

    NASA Technical Reports Server (NTRS)

    Kulkarni, Shriram; Mazumder, Pinaki; Haddad, George I.

    1995-01-01

    An ultrafast 32-bit pipeline correlator has been implemented using resonant tunneling diodes (RTD) and hetero-junction bipolar transistors (HBT). The negative differential resistance (NDR) characteristics of RTD's is the basis of logic gates with the self-latching property that eliminates pipeline area and delay overheads which limit throughput in conventional technologies. The circuit topology also allows threshold logic functions such as minority/majority to be implemented in a compact manner resulting in reduction of the overall complexity and delay of arbitrary logic circuits. The parallel correlator is an essential component in code division multi-access (CDMA) transceivers used for the continuous calculation of correlation between an incoming data stream and a PN sequence. Simulation results show that a nano-pipelined correlator can provide and effective throughput of one 32-bit correlation every 100 picoseconds, using minimal hardware, with a power dissipation of 1.5 watts. RTD plus HBT based logic gates have been fabricated and the RTD plus HBT based correlator is compared with state of the art complementary metal oxide semiconductor (CMOS) implementations.

  6. Improved Hardfacing for Drill Bits and Drilling Tools

    NASA Astrophysics Data System (ADS)

    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.

  7. Subjective quality evaluation of low-bit-rate video

    NASA Astrophysics Data System (ADS)

    Masry, Mark; Hemami, Sheila S.; Osberger, Wilfried M.; Rohaly, Ann M.

    2001-06-01

    A subjective quality evaluation was performed to qualify vie4wre responses to visual defects that appear in low bit rate video at full and reduced frame rates. The stimuli were eight sequences compressed by three motion compensated encoders - Sorenson Video, H.263+ and a Wavelet based coder - operating at five bit/frame rate combinations. The stimulus sequences exhibited obvious coding artifacts whose nature differed across the three coders. The subjective evaluation was performed using the Single Stimulus Continuos Quality Evaluation method of UTI-R Rec. BT.500-8. Viewers watched concatenated coded test sequences and continuously registered the perceived quality using a slider device. Data form 19 viewers was colleted. An analysis of their responses to the presence of various artifacts across the range of possible coding conditions and content is presented. The effects of blockiness and blurriness on perceived quality are examined. The effects of changes in frame rate on perceived quality are found to be related to the nature of the motion in the sequence.

  8. Qualification of BitClean technology in photomask production

    NASA Astrophysics Data System (ADS)

    Robinson, Tod; White, Roy; Bozak, Ron; Archuletta, Mike; Brinkley, David; Yi, Daniel

    2010-09-01

    Makers and users of advanced technology photomasks have seen increased difficulties with the removal of persistent, or stubborn, nano-particle contamination. Shrinking pattern geometries, and new mask clean technologies to minimize haze, have both increased the number of problems and loss of mask yield due to these non-removable nano-particles. A novel technique (BitCleanTM) has been developed using the MerlinTM platform, a scanning probe microscope system originally designed for nanomachining photomask defect repair. Progress in the technical development of this approach into a manufacture-able solution is reviewed and its effectiveness is shown in selectively removing adherent particles without touching surrounding sensitive structures. Results will also be reviewed that were generated in the qualification and acceptance of this new technology in a photomask production environment. These results will be discussed in their relation to the minimum particle size allowed on a given design, particle removal efficiency per pass of the NanoBitTM (PREPP), and the resultant average removal throughput of particles unaffected by any other available mask clean process.

  9. Device-independent bit commitment based on the CHSH inequality

    NASA Astrophysics Data System (ADS)

    Aharon, N.; Massar, S.; Pironio, S.; Silman, J.

    2016-02-01

    Bit commitment and coin flipping occupy a unique place in the device-independent landscape, as the only device-independent protocols thus far suggested for these tasks are reliant on tripartite GHZ correlations. Indeed, we know of no other bipartite tasks, which admit a device-independent formulation, but which are not known to be implementable using only bipartite nonlocality. Another interesting feature of these protocols is that the pseudo-telepathic nature of GHZ correlations—in contrast to the generally statistical character of nonlocal correlations, such as those arising in the violation of the CHSH inequality—is essential to their formulation and analysis. In this work, we present a device-independent bit commitment protocol based on CHSH testing, which achieves the same security as the optimal GHZ-based protocol, albeit at the price of fixing the time at which Alice reveals her commitment. The protocol is analyzed in the most general settings, where the devices are used repeatedly and may have long-term quantum memory. We also recast the protocol in a post-quantum setting where both honest and dishonest parties are restricted only by the impossibility of signaling, and find that overall the supra-quantum structure allows for greater security.

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

    NASA Astrophysics Data System (ADS)

    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.

  11. Extending Landauer's Bound from Bit Erasure to Arbitrary Computation

    NASA Astrophysics Data System (ADS)

    Wolpert, David

    Recent analyses have calculated the minimal thermodynamic work required to perform any computation π whose output is independent of its input, e.g., bit erasure. First I extend these analyses to calculate the work required even if the output of π depends on its input. Next I show that if a physical computer C implementing a computation π will be re-used, then the work required depends only on the dynamics of the logical variables under π, independent of the physical details of C. This establishes a formal identity between the thermodynamics of (re-usable) computers and theoretical computer science. To illustrate this identity, I prove that the minimal work required to compute a bit string σ on a (physical) Turing machine M is kB Tln (2) [ Kolmogorov complexity(σ) + log (Bernoulli measure of the set of strings that compute σ) + log(halting probability of M) ] . I also prove that uncertainty about the distribution over inputs to the computer increases the minimal work required to run the computer. I end by using these results to relate the free energy flux incident on an organism / robot / biosphere to the maximal amount of computation that the organism / robot / biosphere can do per unit time.

  12. Challenges and promises in the fabrication of bit patterned media

    NASA Astrophysics Data System (ADS)

    Moneck, Matthew T.; Zhu, Jian-Gang

    2010-09-01

    Bit patterned media (BPM) is one of the promising technologies for ultra-high density storage in future hard disk drives. However, there are many challenges in fabricating BPM. In particular, applications with area density much greater than 1 Tbit/in2 require magnetic bits to be at sub-10 nm dimensions. Etching at these scales is difficult to achieve with conventional ion milling techniques. Instead, reactive ion etching (RIE) techniques must be developed to meet the challenge. In this work, research is presented on the development of a methanol based RIE scheme for fabricating BPM at ultra-high area densities. The paper will discuss the ability of methanol RIE to etch magnetic and nonmagnetic films in both the parallel plate and inductively coupled plasma (ICP) RIE configurations, as well as the advantages of both configurations over Ar ion milling, including enhanced selectivity, minimal redeposition, and less etch induced damage or erosion. We demonstrate the ability to etch sub-20 nm features in commercially available CoCrPt based perpendicular recording media and NiFe with selectivity greater than 10:1 relative to mask materials, such as Ta, TaNx, Ti, and SiNx. These results, the promises of such a technique, and the feasibility of sub-10 nm scale etching are discussed in detail.

  13. 42 CFR 457.228 - Cost allocation.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... or appropriate CHIP Agency will have an approved cost allocation plan on file with the Department in accordance with the requirements contained in subpart E of 45 CFR part 95. Subpart E also sets forth...

  14. 50 CFR 648.87 - Sector allocation.

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ... permit sanctions pursuant to 15 CFR part 904. If an ACE allocated to a sector is not exceeded in a given... CFR part 904, each sector, permit/vessel owner, and vessel operator participating in the sector may...

  15. The Ethics of Allocating Uterine Transplants.

    PubMed

    Bayefsky, Michelle J; Berkman, Benjamin E

    2016-07-01

    In September 2014, a healthy male child was born in Sweden following a successful uterine transplantation (UTx). The event brought hope to many women without functional uteruses around the world. Having a child with a transplanted uterus is now possible, and as knowledge of the procedure proliferates and interest in UTx grows, it is important to begin thinking about how a scarce supply of uteruses will be allocated. This article represents a first discussion of the range of factors that must be considered in answering the allocation question. The primary issues addressed are (1) the motivation to seek treatment, (2) allocation by age, (3) child-rearing capacity, and (4) the amount of infertility treatment required. A set of eligibility and ranking criteria are presented. These criteria are not exhaustive but are intended to spark discussion about how uteruses can be allocated in a just manner. PMID:26864991

  16. Optimal Resource Allocation in Library Systems

    ERIC Educational Resources Information Center

    Rouse, William B.

    1975-01-01

    Queueing theory is used to model processes as either waiting or balking processes. The optimal allocation of resources to these processes is defined as that which maximizes the expected value of the decision-maker's utility function. (Author)

  17. Fund allocation using capacitated vehicle routing problem

    NASA Astrophysics Data System (ADS)

    Mamat, Nur Jumaadzan Zaleha; Jaaman, Saiful Hafizah; Ahmad, Rokiah Rozita; Darus, Maslina

    2014-09-01

    In investment fund allocation, it is unwise for an investor to distribute his fund into several assets simultaneously due to economic reasons. One solution is to allocate the fund into a particular asset at a time in a sequence that will either maximize returns or minimize risks depending on the investor's objective. The vehicle routing problem (VRP) provides an avenue to this issue. VRP answers the question on how to efficiently use the available fleet of vehicles to meet a given service demand, subjected to a set of operational requirements. This paper proposes an idea of using capacitated vehicle routing problem (CVRP) to optimize investment fund allocation by employing data of selected stocks in the FTSE Bursa Malaysia. Results suggest that CRVP can be applied to solve the issue of investment fund allocation and increase the investor's profit.

  18. Optimal dynamic bandwidth allocation for complex networks

    NASA Astrophysics Data System (ADS)

    Jiang, Zhong-Yuan; Liang, Man-Gui; Li, Qian; Guo, Dong-Chao

    2013-03-01

    Traffic capacity of one network strongly depends on the link’s bandwidth allocation strategy. In previous bandwidth allocation mechanisms, once one link’s bandwidth is allocated, it will be fixed throughout the overall traffic transmission process. However, the traffic load of every link changes from time to time. In this paper, with finite total bandwidth resource of the network, we propose to dynamically allocate the total bandwidth resource in which each link’s bandwidth is proportional to the queue length of the output buffer of the link per time step. With plenty of data packets in the network, the traffic handling ability of all links of the network achieves full utilization. The theoretical analysis and the extensive simulation results on complex networks are consistent. This work is valuable for network service providers to improve network performance or to do reasonable network design efficiently.

  19. 49 CFR 262.5 - Allocation requirements.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... IMPROVEMENT PROJECTS § 262.5 Allocation requirements. At least fifty percent of all grant funds awarded under this section out of funds appropriated for a fiscal year shall be provided as grant awards of not...

  20. 49 CFR 262.5 - Allocation requirements.

    Code of Federal Regulations, 2014 CFR

    2014-10-01

    ... IMPROVEMENT PROJECTS § 262.5 Allocation requirements. At least fifty percent of all grant funds awarded under this section out of funds appropriated for a fiscal year shall be provided as grant awards of not...

  1. 49 CFR 262.5 - Allocation requirements.

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ... IMPROVEMENT PROJECTS § 262.5 Allocation requirements. At least fifty percent of all grant funds awarded under this section out of funds appropriated for a fiscal year shall be provided as grant awards of not...

  2. 49 CFR 262.5 - Allocation requirements.

    Code of Federal Regulations, 2012 CFR

    2012-10-01

    ... IMPROVEMENT PROJECTS § 262.5 Allocation requirements. At least fifty percent of all grant funds awarded under this section out of funds appropriated for a fiscal year shall be provided as grant awards of not...

  3. Allocating petroleum products during oil supply disruptions.

    PubMed

    Bezdek, R H; Taylor, W B

    1981-06-19

    Four options for allocating a long-term, severe shortfall of petroleum imports are analyzed: oil price and allocation controls, coupon gasoline rationing, variable gasoline tax and rebate, and no oil price controls with partial rebates. Each of these options is evaluated in terms of four criteria: microeconomic effects, macroeconomic effects, equity, and practical problems. The implications of this analysis for energy contingency planning are discussed. PMID:17746245

  4. Optimality versus stability in water resource allocation.

    PubMed

    Read, Laura; Madani, Kaveh; Inanloo, Bahareh

    2014-01-15

    Water allocation is a growing concern in a developing world where limited resources like fresh water are in greater demand by more parties. Negotiations over allocations often involve multiple groups with disparate social, economic, and political status and needs, who are seeking a management solution for a wide range of demands. Optimization techniques for identifying the Pareto-optimal (social planner solution) to multi-criteria multi-participant problems are commonly implemented, although often reaching agreement for this solution is difficult. In negotiations with multiple-decision makers, parties who base decisions on individual rationality may find the social planner solution to be unfair, thus creating a need to evaluate the willingness to cooperate and practicality of a cooperative allocation solution, i.e., the solution's stability. This paper suggests seeking solutions for multi-participant resource allocation problems through an economics-based power index allocation method. This method can inform on allocation schemes that quantify a party's willingness to participate in a negotiation rather than opt for no agreement. Through comparison of the suggested method with a range of distance-based multi-criteria decision making rules, namely, least squares, MAXIMIN, MINIMAX, and compromise programming, this paper shows that optimality and stability can produce different allocation solutions. The mismatch between the socially-optimal alternative and the most stable alternative can potentially result in parties leaving the negotiation as they may be too dissatisfied with their resource share. This finding has important policy implications as it justifies why stakeholders may not accept the socially optimal solution in practice, and underlies the necessity of considering stability where it may be more appropriate to give up an unstable Pareto-optimal solution for an inferior stable one. Authors suggest assessing the stability of an allocation solution as an

  5. Allocation Games: Addressing the Ill-Posed Nature of Allocation in Life-Cycle Inventories.

    PubMed

    Hanes, Rebecca J; Cruze, Nathan B; Goel, Prem K; Bakshi, Bhavik R

    2015-07-01

    Allocation is required when a life cycle contains multi-functional processes. One approach to allocation is to partition the embodied resources in proportion to a criterion, such as product mass or cost. Many practitioners apply multiple partitioning criteria to avoid choosing one arbitrarily. However, life cycle results from different allocation methods frequently contradict each other, making it difficult or impossible for the practitioner to draw any meaningful conclusions from the study. Using the matrix notation for life-cycle inventory data, we show that an inventory that requires allocation leads to an ill-posed problem: an inventory based on allocation is one of an infinite number of inventories that are highly dependent upon allocation methods. This insight is applied to comparative life-cycle assessment (LCA), in which products with the same function but different life cycles are compared. Recently, there have been several studies that applied multiple allocation methods and found that different products were preferred under different methods. We develop the Comprehensive Allocation Investigation Strategy (CAIS) to examine any given inventory under all possible allocation decisions, enabling us to detect comparisons that are not robust to allocation, even when the comparison appears robust under conventional partitioning methods. While CAIS does not solve the ill-posed problem, it provides a systematic way to parametrize and examine the effects of partitioning allocation. The practical usefulness of this approach is demonstrated with two case studies. The first compares ethanol produced from corn stover hydrolysis, corn stover gasification, and corn grain fermentation. This comparison was not robust to allocation. The second case study compares 1,3-propanediol (PDO) produced from fossil fuels and from biomass, which was found to be a robust comparison. PMID:26061700

  6. Advances in liver transplantation allocation systems

    PubMed Central

    Schilsky, Michael L; Moini, Maryam

    2016-01-01

    With the growing number of patients in need of liver transplantation, there is a need for adopting new and modifying existing allocation policies that prioritize patients for liver transplantation. Policy should ensure fair allocation that is reproducible and strongly predictive of best pre and post transplant outcomes while taking into account the natural history of the potential recipients liver disease and its complications. There is wide acceptance for allocation policies based on urgency in which the sickest patients on the waiting list with the highest risk of mortality receive priority. Model for end-stage liver disease and Child-Turcotte-Pugh scoring system, the two most universally applicable systems are used in urgency-based prioritization. However, other factors must be considered to achieve optimal allocation. Factors affecting pre-transplant patient survival and the quality of the donor organ also affect outcome. The optimal system should have allocation prioritization that accounts for both urgency and transplant outcome. We reviewed past and current liver allocation systems with the aim of generating further discussion about improvement of current policies. PMID:26973389

  7. Advances in liver transplantation allocation systems.

    PubMed

    Schilsky, Michael L; Moini, Maryam

    2016-03-14

    With the growing number of patients in need of liver transplantation, there is a need for adopting new and modifying existing allocation policies that prioritize patients for liver transplantation. Policy should ensure fair allocation that is reproducible and strongly predictive of best pre and post transplant outcomes while taking into account the natural history of the potential recipients liver disease and its complications. There is wide acceptance for allocation policies based on urgency in which the sickest patients on the waiting list with the highest risk of mortality receive priority. Model for end-stage liver disease and Child-Turcotte-Pugh scoring system, the two most universally applicable systems are used in urgency-based prioritization. However, other factors must be considered to achieve optimal allocation. Factors affecting pre-transplant patient survival and the quality of the donor organ also affect outcome. The optimal system should have allocation prioritization that accounts for both urgency and transplant outcome. We reviewed past and current liver allocation systems with the aim of generating further discussion about improvement of current policies. PMID:26973389

  8. Texture enhanced optimization-based image reconstruction (TxE-OBIR) from sparse projection views

    NASA Astrophysics Data System (ADS)

    Xie, Huiqiao; Niu, Tianye; Yang, Yi; Ren, Yi; Tang, Xiangyang

    2016-03-01

    The optimization-based image reconstruction (OBIR) has been proposed and investigated in recent years to reduce radiation dose in X-ray computed tomography (CT) through acquiring sparse projection views. However, the OBIR usually generates images with a quite different noise texture compared to the clinical widely used reconstruction method (i.e. filtered back-projection - FBP). This may make the radiologists/physicians less confident while they are making clinical decisions. Recognizing the fact that the X-ray photon noise statistics is relatively uniform across the detector cells, which is enabled by beam forming devices (e.g. bowtie filters), we propose and evaluate a novel and practical texture enhancement method in this work. In the texture enhanced optimization-based image reconstruction (TxEOBIR), we first reconstruct a texture image with the FBP algorithm from a full set of synthesized projection views of noise. Then, the TxE-OBIR image is generated by adding the texture image into the OBIR reconstruction. As qualitatively confirmed by visual inspection and quantitatively by noise power spectrum (NPS) evaluation, the proposed method can produce images with textures that are visually identical to those of the gold standard FBP images.

  9. Optimization-based multicriteria decision analysis for identification of desired petroleum-contaminated groundwater remediation strategies.

    PubMed

    Lu, Hongwei; Feng, Mao; He, Li; Ren, Lixia

    2015-06-01

    The conventional multicriteria decision analysis (MCDA) methods used for pollution control generally depend on the data currently available. This could limit their real-world applications, especially where the input data (e.g., the most cost-effective remediation cost and eventual contaminant concentration) might vary by scenario. This study proposes an optimization-based MCDA (OMCDA) framework to address such a challenge. It is capable of (1) capturing various preferences of decision-makers, (2) screening and analyzing the performance of various optimized remediation strategies under changeable scenarios, and (3) compromising incongruous decision analysis results. A real-world case study is employed for demonstration, where four scenarios are considered with each one corresponding to a set of weights representative of the preference of the decision-makers. Four criteria are selected, i.e., optimal total pumping rate, remediation cost, contaminant concentration, and fitting error. Their values are determined through running optimization and optimization-based simulation procedures. Four sets of the most desired groundwater remediation strategies are identified, implying specific pumping rates under varied scenarios. Results indicate that the best action lies in groups 32 and 16 for the 5-year, groups 49 and 36 for the 10-year, groups 26 and 13 for the 15-year, and groups 47 and 13 for the 20-year remediation. PMID:25613797

  10. Inter-bit prediction based on maximum likelihood estimate for distributed video coding

    NASA Astrophysics Data System (ADS)

    Klepko, Robert; Wang, Demin; Huchet, Grégory

    2010-01-01

    Distributed Video Coding (DVC) is an emerging video coding paradigm for the systems that require low complexity encoders supported by high complexity decoders. A typical real world application for a DVC system is mobile phones with video capture hardware that have a limited encoding capability supported by base-stations with a high decoding capability. Generally speaking, a DVC system operates by dividing a source image sequence into two streams, key frames and Wyner-Ziv (W) frames, with the key frames being used to represent the source plus an approximation to the W frames called S frames (where S stands for side information), while the W frames are used to correct the bit errors in the S frames. This paper presents an effective algorithm to reduce the bit errors in the side information of a DVC system. The algorithm is based on the maximum likelihood estimation to help predict future bits to be decoded. The reduction in bit errors in turn reduces the number of parity bits needed for error correction. Thus, a higher coding efficiency is achieved since fewer parity bits need to be transmitted from the encoder to the decoder. The algorithm is called inter-bit prediction because it predicts the bit-plane to be decoded from previously decoded bit-planes, one bitplane at a time, starting from the most significant bit-plane. Results provided from experiments using real-world image sequences show that the inter-bit prediction algorithm does indeed reduce the bit rate by up to 13% for our test sequences. This bit rate reduction corresponds to a PSNR gain of about 1.6 dB for the W frames.

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

    NASA Astrophysics Data System (ADS)

    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).

  12. A radiation-hardened 16/32-bit microprocessor

    SciTech Connect

    Hass, K.J.; Treece, R.K.; Giddings, A.E. )

    1989-12-01

    This paper reports on the development of single chip radiation-hardened 16/32-bit microprocessor. This device, the SA3300, is an emulation of National Semiconductor's NS32C016. The SA3300 is designed to withstand high levels of ionizing radiation and is resistant to single event upset (SEU) caused by heavy ions. New techniques were used to improve immunity to SEU effects in combinational logic. The authors' testing has demonstrated that the SA3300 is functional after a total gamma dose of 5 Mrad(Si). The device does not latch up from SEU, and parts without SEU resistors have an SEU linear energy transfer (LET) upset threshold greater than 28 MeV/mg/cm{sup 2}.

  13. Quantum random bit generation using stimulated Raman scattering.

    PubMed

    Bustard, Philip J; Moffatt, Doug; Lausten, Rune; Wu, Guorong; Walmsley, Ian A; Sussman, Benjamin J

    2011-12-01

    Random number sequences are a critical resource in a wide variety of information systems, including applications in cryptography, simulation, and data sampling. We introduce a quantum random number generator based on the phase measurement of Stokes light generated by amplification of zero-point vacuum fluctuations using stimulated Raman scattering. This is an example of quantum noise amplification using the most noise-free process possible: near unitary quantum evolution. The use of phase offers robustness to classical pump noise and the ability to generate multiple bits per measurement. The Stokes light is generated with high intensity and as a result, fast detectors with high signal-to-noise ratios can be used for measurement, eliminating the need for single-photon sensitive devices. The demonstrated implementation uses optical phonons in bulk diamond. PMID:22273908

  14. Supercomputing on massively parallel bit-serial architectures

    NASA Technical Reports Server (NTRS)

    Iobst, Ken

    1985-01-01

    Research on the Goodyear Massively Parallel Processor (MPP) suggests that high-level parallel languages are practical and can be designed with powerful new semantics that allow algorithms to be efficiently mapped to the real machines. For the MPP these semantics include parallel/associative array selection for both dense and sparse matrices, variable precision arithmetic to trade accuracy for speed, micro-pipelined train broadcast, and conditional branching at the processing element (PE) control unit level. The preliminary design of a FORTRAN-like parallel language for the MPP has been completed and is being used to write programs to perform sparse matrix array selection, min/max search, matrix multiplication, Gaussian elimination on single bit arrays and other generic algorithms. A description is given of the MPP design. Features of the system and its operation are illustrated in the form of charts and diagrams.

  15. Retractable tool bit having latch type catch mechanism

    NASA Technical Reports Server (NTRS)

    Voellmer, George (Inventor)

    1993-01-01

    A retractable tool bit assembly for a tool such as an allen key is presented. The assembly includes one or more spring loaded nestable or telescoping tubular sections together with a catch mechanism for capturing and holding the tool in its retracted position. The catch mechanism consists of a latch mechanism located in a base section and which engages a conically shaped tool head located at the inner end of the tool. The tool head adjoins an eccentric oval type neck portion which extends to a rear lip of the tool head. The latch mechanism releases when the ovular neck portion rotates about the catch members upon actuation of a rotary tool drive motor. When released, all the telescoping sections and the tool extends fully outward to a use position.

  16. A low power 12-bit ADC for nuclear instrumentation

    SciTech Connect

    Adachi, R.; Landis, D.; Madden, N. ); Silver, E.; LeGros, M. )

    1992-10-01

    A low power, successive approximation, analog-to-digital converter (ADC) for low rate, low cost, battery powered applications is described. The ADC is based on a commercial 50 mW successive approximation CMOS device (CS5102). An on-chip self-calibration circuit reduces the inherent differential nonlinearity to 7%. A further reduction of the differential nonlinearity to 0.5% is attained with a four bit Gatti function. The Gatti function is distributed to minimize battery power consumption. All analog functions reside with the ADC while the noisy digital functions reside in the personal computer based histogramming memory. Fiber optic cables carry afl digital information between the ADC and the personal computer based histogramming memory.

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

    PubMed

    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. PMID:20366244

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

    NASA Astrophysics Data System (ADS)

    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. Atomistic simulation of static magnetic properties of bit patterned media

    NASA Astrophysics Data System (ADS)

    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.

  20. Information gain on reheating: The one bit milestone

    NASA Astrophysics Data System (ADS)

    Martin, Jérôme; Ringeval, Christophe; Vennin, Vincent

    2016-05-01

    We show that the Planck 2015 and BICEP2/KECK measurements of the cosmic microwave background (CMB) anisotropies provide together an information gain of 0.82 ±0.13 bits on the reheating history over all slow-roll single-field models of inflation. This corresponds to a 40% improvement compared to the Planck 2013 constraints on the reheating. Our method relies on an exhaustive CMB data analysis performed over nearly 200 models of inflation to derive the Kullback-Leibler entropy between the prior and the fully marginalized posterior of the reheating parameter. This number is a weighted average by the Bayesian evidence of each model to explain the data thereby ensuring its fairness and robustness.

  1. Power of one bit of quantum information in quantum metrology

    NASA Astrophysics Data System (ADS)

    Cable, Hugo; Gu, Mile; Modi, Kavan

    2016-04-01

    We present a model of quantum metrology inspired by the computational model known as deterministic quantum computation with one quantum bit (DQC1). Using only one pure qubit together with l fully mixed qubits we obtain measurement precision (defined as root-mean-square error for the parameter being estimated) at the standard quantum limit, which is typically obtained using the same number of uncorrelated qubits in fully pure states. In principle, the standard quantum limit can be exceeded using an additional qubit which adds only a small amount of purity. We show that the discord in the final state vanishes only in the limit of attaining infinite precision for the parameter being estimated.

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

    NASA Technical Reports Server (NTRS)

    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.

  3. Bit-Serial Adder Based on Quantum Dots

    NASA Technical Reports Server (NTRS)

    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

  4. Bit-string physics: A novel theory of everything

    SciTech Connect

    Noyes, H.P.

    1994-08-01

    We encode the quantum numbers of the standard model of quarks and leptons using constructed bitstrings of length 256. These label a grouting universe of bit-strings of growing length that eventually construct a finite and discrete space-time with reasonable cosmological properties. Coupling constants and mass ratios, computed from closure under XOR and a statistical hypothesis, using only {h_bar}, c and m{sub p} to fix our units of mass, length and time in terms of standard (meterkilogram-second) metrology, agree with the first four to seven significant figures of accepted experimental results. Finite and discrete conservation laws and commutation relations insure the essential characteristics of relativistic quantum mechanics, including particle-antiparticle pair creation. The correspondence limit in (free space) Maxwell electromagnetism and Einstein gravitation is consistent with the Feynman-Dyson-Tanimura ``proof.``

  5. A one-bit approach for image registration

    NASA Astrophysics Data System (ADS)

    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.

  6. An Evolutionary Model Based on Bit-String with Intelligence

    NASA Astrophysics Data System (ADS)

    He, Mingfeng; Pan, Qiuhui; Yu, Binglin

    An evolutionary model based on bit-strings with intelligence is set up in this paper. In this model, gene is divided into two parts which relative to health and intelligence. The accumulated intelligence influences the survival process by the effect of food and space restrictions. We modify the Verhulst factor to study this effect. Both asexual and sexual model are discussed in this paper. The results show that after many time steps, stability is reached and the population self-organizes, just like the standard Penna model. The intelligence made the equilibrium to be reached larger both in asexual model and sexual model. Compared with asexual model the population size fluctuates more strongly in the sexual model.

  7. 7 CFR 1780.18 - Allocation of program funds.

    Code of Federal Regulations, 2010 CFR

    2010-01-01

    ... amounts held in reserve or distributed by base or administrative allocation times the basic State factor... available for allocation−NO reserve−total base and administrative allocations) × SF. (4) Transition formula... program section. (5) Base allocation. An amount that may be allocated to each State dependent upon...

  8. 49 CFR 198.13 - Grant allocation formula.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... 49 Transportation 3 2010-10-01 2010-10-01 false Grant allocation formula. 198.13 Section 198.13... PIPELINE SAFETY PROGRAMS Grant Allocation § 198.13 Grant allocation formula. (a) Beginning in calendar year... state agency comments on any proposed changes to the allocation formula. (f) Grants are limited to...

  9. 49 CFR 198.13 - Grant allocation formula.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... 49 Transportation 3 2011-10-01 2011-10-01 false Grant allocation formula. 198.13 Section 198.13... PIPELINE SAFETY PROGRAMS Grant Allocation § 198.13 Grant allocation formula. (a) Beginning in calendar year... state agency comments on any proposed changes to the allocation formula. (f) Grants are limited to...

  10. 49 CFR 198.13 - Grant allocation formula.

    Code of Federal Regulations, 2012 CFR

    2012-10-01

    ... 49 Transportation 3 2012-10-01 2012-10-01 false Grant allocation formula. 198.13 Section 198.13... PIPELINE SAFETY PROGRAMS Grant Allocation § 198.13 Grant allocation formula. (a) Beginning in calendar year... state agency comments on any proposed changes to the allocation formula. (f) Grants are limited to...

  11. 49 CFR 198.13 - Grant allocation formula.

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ... 49 Transportation 3 2013-10-01 2013-10-01 false Grant allocation formula. 198.13 Section 198.13... PIPELINE SAFETY PROGRAMS Grant Allocation § 198.13 Grant allocation formula. (a) Beginning in calendar year... state agency comments on any proposed changes to the allocation formula. (f) Grants are limited to...

  12. 49 CFR 198.13 - Grant allocation formula.

    Code of Federal Regulations, 2014 CFR

    2014-10-01

    ... 49 Transportation 3 2014-10-01 2014-10-01 false Grant allocation formula. 198.13 Section 198.13... PIPELINE SAFETY PROGRAMS Grant Allocation § 198.13 Grant allocation formula. (a) Beginning in calendar year... state agency comments on any proposed changes to the allocation formula. (f) Grants are limited to...

  13. 47 CFR 2.106 - Table of Frequency Allocations.

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ... 47 Telecommunication 1 2013-10-01 2013-10-01 false Table of Frequency Allocations. 2.106 Section 2.106 Telecommunication FEDERAL COMMUNICATIONS COMMISSION GENERAL FREQUENCY ALLOCATIONS AND RADIO TREATY MATTERS; GENERAL RULES AND REGULATIONS Allocation, Assignment, and Use of Radio Frequencies § 2.106 Table of Frequency Allocations. Editorial...

  14. 47 CFR 2.106 - Table of Frequency Allocations.

    Code of Federal Regulations, 2014 CFR

    2014-10-01

    ... 47 Telecommunication 1 2014-10-01 2014-10-01 false Table of Frequency Allocations. 2.106 Section 2.106 Telecommunication FEDERAL COMMUNICATIONS COMMISSION GENERAL FREQUENCY ALLOCATIONS AND RADIO TREATY MATTERS; GENERAL RULES AND REGULATIONS Allocation, Assignment, and Use of Radio Frequencies § 2.106 Table of Frequency Allocations. Link to...

  15. 47 CFR 2.106 - Table of Frequency Allocations.

    Code of Federal Regulations, 2012 CFR

    2012-10-01

    ... 47 Telecommunication 1 2012-10-01 2012-10-01 false Table of Frequency Allocations. 2.106 Section 2.106 Telecommunication FEDERAL COMMUNICATIONS COMMISSION GENERAL FREQUENCY ALLOCATIONS AND RADIO TREATY MATTERS; GENERAL RULES AND REGULATIONS Allocation, Assignment, and Use of Radio Frequencies § 2.106 Table of Frequency Allocations. Editorial...

  16. 12 CFR 28.52 - Allocated transfer risk reserve.

    Code of Federal Regulations, 2010 CFR

    2010-01-01

    ... 12 Banks and Banking 1 2010-01-01 2010-01-01 false Allocated transfer risk reserve. 28.52 Section... ACTIVITIES International Lending Supervision § 28.52 Allocated transfer risk reserve. (a) Establishment of allocated transfer risk reserve. A banking institution shall establish an allocated transfer risk...

  17. 26 CFR 1.141-6 - Allocation and accounting rules.

    Code of Federal Regulations, 2012 CFR

    2012-04-01

    ... 26 Internal Revenue 2 2012-04-01 2012-04-01 false Allocation and accounting rules. 1.141-6 Section... Allocation and accounting rules. (a) Allocation of proceeds to expenditures. For purposes of §§ 1.141-1.... Thus, allocations generally may be made using any reasonable, consistently applied accounting...

  18. 26 CFR 1.141-6 - Allocation and accounting rules.

    Code of Federal Regulations, 2014 CFR

    2014-04-01

    ... 26 Internal Revenue 2 2014-04-01 2014-04-01 false Allocation and accounting rules. 1.141-6 Section... Allocation and accounting rules. (a) Allocation of proceeds to expenditures. For purposes of §§ 1.141-1.... Thus, allocations generally may be made using any reasonable, consistently applied accounting...

  19. 26 CFR 1.141-6 - Allocation and accounting rules.

    Code of Federal Regulations, 2013 CFR

    2013-04-01

    ... 26 Internal Revenue 2 2013-04-01 2013-04-01 false Allocation and accounting rules. 1.141-6 Section... Allocation and accounting rules. (a) Allocation of proceeds to expenditures. For purposes of §§ 1.141-1.... Thus, allocations generally may be made using any reasonable, consistently applied accounting...

  20. 12 CFR 28.52 - Allocated transfer risk reserve.

    Code of Federal Regulations, 2013 CFR

    2013-01-01

    ... 12 Banks and Banking 1 2013-01-01 2013-01-01 false Allocated transfer risk reserve. 28.52 Section... ACTIVITIES International Lending Supervision § 28.52 Allocated transfer risk reserve. (a) Establishment of allocated transfer risk reserve. A banking institution shall establish an allocated transfer risk...

  1. 12 CFR 28.52 - Allocated transfer risk reserve.

    Code of Federal Regulations, 2012 CFR

    2012-01-01

    ... 12 Banks and Banking 1 2012-01-01 2012-01-01 false Allocated transfer risk reserve. 28.52 Section... ACTIVITIES International Lending Supervision § 28.52 Allocated transfer risk reserve. (a) Establishment of allocated transfer risk reserve. A banking institution shall establish an allocated transfer risk...

  2. 12 CFR 28.52 - Allocated transfer risk reserve.

    Code of Federal Regulations, 2014 CFR

    2014-01-01

    ... 12 Banks and Banking 1 2014-01-01 2014-01-01 false Allocated transfer risk reserve. 28.52 Section... ACTIVITIES International Lending Supervision § 28.52 Allocated transfer risk reserve. (a) Establishment of allocated transfer risk reserve. A banking institution shall establish an allocated transfer risk...

  3. 12 CFR 28.52 - Allocated transfer risk reserve.

    Code of Federal Regulations, 2011 CFR

    2011-01-01

    ... 12 Banks and Banking 1 2011-01-01 2011-01-01 false Allocated transfer risk reserve. 28.52 Section... ACTIVITIES International Lending Supervision § 28.52 Allocated transfer risk reserve. (a) Establishment of allocated transfer risk reserve. A banking institution shall establish an allocated transfer risk...

  4. 47 CFR 64.903 - Cost allocation manuals.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... 47 Telecommunication 3 2010-10-01 2010-10-01 false Cost allocation manuals. 64.903 Section 64.903... RULES RELATING TO COMMON CARRIERS Allocation of Costs § 64.903 Cost allocation manuals. (a) Each... mid-sized incumbent local exchange carriers is required to file a cost allocation manual...

  5. 49 CFR 33.54 - Elements of an allocation order.

    Code of Federal Regulations, 2012 CFR

    2012-10-01

    ... Transportation Priorities and Allocations System regulation (49 CFR Part 33)”; and (e) A current copy of the Transportation Priorities and Allocations System regulation (49 CFR Part 33) as of the date of the allocation... 49 Transportation 1 2012-10-01 2012-10-01 false Elements of an allocation order. 33.54 Section...

  6. 10 CFR 217.54 - Elements of an allocation order.

    Code of Federal Regulations, 2014 CFR

    2014-01-01

    ... Allocations System regulation (10 CFR part 217), which is part of the Federal Priorities and Allocations System”; and (e) A current copy of the Energy Priorities and Allocations System regulation (10 CFR part... 10 Energy 3 2014-01-01 2014-01-01 false Elements of an allocation order. 217.54 Section...

  7. 10 CFR 217.54 - Elements of an allocation order.

    Code of Federal Regulations, 2013 CFR

    2013-01-01

    ... Allocations System regulation (10 CFR part 217), which is part of the Federal Priorities and Allocations System”; and (e) A current copy of the Energy Priorities and Allocations System regulation (10 CFR part... 10 Energy 3 2013-01-01 2013-01-01 false Elements of an allocation order. 217.54 Section...

  8. 49 CFR 33.54 - Elements of an allocation order.

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ... Transportation Priorities and Allocations System regulation (49 CFR Part 33)”; and (e) A current copy of the Transportation Priorities and Allocations System regulation (49 CFR Part 33) as of the date of the allocation... 49 Transportation 1 2013-10-01 2013-10-01 false Elements of an allocation order. 33.54 Section...

  9. 49 CFR 33.54 - Elements of an allocation order.

    Code of Federal Regulations, 2014 CFR

    2014-10-01

    ... Transportation Priorities and Allocations System regulation (49 CFR Part 33)”; and (e) A current copy of the Transportation Priorities and Allocations System regulation (49 CFR Part 33) as of the date of the allocation... 49 Transportation 1 2014-10-01 2014-10-01 false Elements of an allocation order. 33.54 Section...

  10. 10 CFR 217.54 - Elements of an allocation order.

    Code of Federal Regulations, 2012 CFR

    2012-01-01

    ... Allocations System regulation (10 CFR part 217), which is part of the Federal Priorities and Allocations System”; and (e) A current copy of the Energy Priorities and Allocations System regulation (10 CFR part... 10 Energy 3 2012-01-01 2012-01-01 false Elements of an allocation order. 217.54 Section...

  11. Brownian motion properties of optoelectronic random bit generators based on laser chaos.

    PubMed

    Li, Pu; Yi, Xiaogang; Liu, Xianglian; Wang, Yuncai; Wang, Yongge

    2016-07-11

    The nondeterministic property of the optoelectronic random bit generator (RBG) based on laser chaos are experimentally analyzed from two aspects of the central limit theorem and law of iterated logarithm. The random bits are extracted from an optical feedback chaotic laser diode using a multi-bit extraction technique in the electrical domain. Our experimental results demonstrate that the generated random bits have no statistical distance from the Brownian motion, besides that they can pass the state-of-the-art industry-benchmark statistical test suite (NIST SP800-22). All of them give a mathematically provable evidence that the ultrafast random bit generator based on laser chaos can be used as a nondeterministic random bit source. PMID:27410852

  12. Shuttle bit rate synchronizer. [signal to noise ratios and error analysis

    NASA Technical Reports Server (NTRS)

    Huey, D. C.; Fultz, G. L.

    1974-01-01

    A shuttle bit rate synchronizer brassboard unit was designed, fabricated, and tested, which meets or exceeds the contractual specifications. The bit rate synchronizer operates at signal-to-noise ratios (in a bit rate bandwidth) down to -5 dB while exhibiting less than 0.6 dB bit error rate degradation. The mean acquisition time was measured to be less than 2 seconds. The synchronizer is designed around a digital data transition tracking loop whose phase and data detectors are integrate-and-dump filters matched to the Manchester encoded bits specified. It meets the reliability (no adjustments or tweaking) and versatility (multiple bit rates) of the shuttle S-band communication system through an implementation which is all digital after the initial stage of analog AGC and A/D conversion.

  13. Design and operation of mechanical and hydraulic bit releases. Technical report

    SciTech Connect

    Peterson, M.N.A.

    1984-02-01

    The Deep Sea Drilling Project Technical Report documents the history, incentives and development details of the bit release technology used aboard the GLOMAR CHALLENGER. Descriptions of the most current models and operational guidelines for both the earlier Mechanical Bit Release (MBR) and the later Hydraulic Bit Release (HBR) are included. Operational deployments of both systems are summarized. Appendices are included with certain significant engineering calculations and machine drawings.

  14. Compact fibre Bragg grating-based thermometer for on-line temperature monitoring of drill bits

    NASA Astrophysics Data System (ADS)

    Hey Tow, Kenny; Llera, Miguel; Le Floch, Sébastien; Salvadé, Yves; Thévenaz, Luc

    2016-05-01

    In this communication, a novel compact fibre Bragg grating-based thermometer for on-line temperature monitoring of drill bits is reported. Our proposed technique can potentially be used to optimize any drilling process, requiring the use of small drill bits, through direct temperature measurement at the drill bit instead of relying on indirect parameters (speed of rotation, applied force) in order to avoid an overheating as it is currently done nowadays.

  15. Development and Testing of a Jet Assisted Polycrystalline Diamond Drilling Bit. Phase II Development Efforts

    SciTech Connect

    David S. Pixton

    1999-09-20

    Phase II efforts to develop a jet-assisted rotary-percussion drill bit are discussed. Key developments under this contract include: (1) a design for a more robust polycrystalline diamond drag cutter; (2) a new drilling mechanism which improves penetration and life of cutters; and (3) a means of creating a high-pressure mud jet inside of a percussion drill bit. Field tests of the new drill bit and the new robust cutter are forthcoming.

  16. An Analysis and Allocation System for Library Collections Budgets: The Comprehensive Allocation Process (CAP)

    ERIC Educational Resources Information Center

    Lyons, Lucy Eleonore; Blosser, John

    2012-01-01

    The "Comprehensive Allocation Process" (CAP) is a reproducible decision-making structure for the allocation of new collections funds, for the reallocation of funds within stagnant budgets, and for budget cuts in the face of reduced funding levels. This system was designed to overcome common shortcomings of current methods. Its philosophical…

  17. Field drilling tests on improved geothermal unsealed roller-cone bits. Final report

    SciTech Connect

    Hendrickson, R.R.; Jones, A.H.; Winzenried, R.W.; Maish, A.B.

    1980-05-01

    The development and field testing of a 222 mm (8-3/4 inch) unsealed, insert type, medium hard formation, high-temperature bit are described. Increased performance was gained by substituting improved materials in critical bit components. These materials were selected on bases of their high temperature properties, machinability and heat treatment response. Program objectives required that both machining and heat treating could be accomplished with existing rock bit production equipment. Six of the experimental bits were subjected to air drilling at 240/sup 0/C (460/sup 0/F) in Franciscan graywacke at the Geysers (California). Performances compared directly to conventional bits indicate that in-gage drilling time was increased by 70%. All bits at the Geysers are subjected to reaming out-of-gage hole prior to drilling. Under these conditions the experimental bits showed a 30% increase in usable hole drilled, compared with the conventional bits. The materials selected improved roller wear by 200%, friction per wear by 150%, and lug wear by 150%. These tests indicate a potential well cost savings of 4 to 8%. Savings of 12% are considered possible with drilling procedures optimized for the experimental bits.

  18. Design and verification of a bit error rate tester in Altera FPGA for optical link developments

    NASA Astrophysics Data System (ADS)

    Cao, T.; Chang, J.; Gong, D.; Liu, C.; Liu, T.; Xiang, A.; Ye, J.

    2010-12-01

    This paper presents a custom bit error rate (BER) tester implementation in an Altera Stratix II GX signal integrity development kit. This BER tester deploys a parallel to serial pseudo random bit sequence (PRBS) generator, a bit and link status error detector and an error logging FIFO. The auto-correlation pattern enables receiver synchronization without specifying protocol at the physical layer. The error logging FIFO records both bit error data and link operation events. The tester's BER and data acquisition functions are utilized in a proton test of a 5 Gbps serializer. Experimental and data analysis results are discussed.

  19. High-performance TSD bits improve penetration rate. [Thermally Stable Diamond

    SciTech Connect

    Cohen, J.H.; Maurer, W.C. ); Westcott, P.A. )

    1993-04-12

    Optimizing the number, size, and orientation of clutters on thermally stable diamond (TSD) bits increases penetration rate and extends bit life. The use of optimized TSD (also commonly referred to as thermally stable product or TSP) bits on high-power drilling motors can greatly reduce drilling time for harsh-environment wells, such as deep gas wells. The power delivered to the rock governs drilling rate, and at high speed the optimized TSD bits are capable of effectively delivering power to drill the rock. This article reviews a 3-year project to develop advanced thermally stable diamond bits that can operate at a power level 5-10 times greater than that typically delivered by conventional rotary drilling. These bits are designed to operate on advanced drilling motors that drill three to six times faster than rotary drilling. These advanced bits and motors are especially designed for use in slim-hole and horizontal drilling applications. The TSD bit design parameters which were varied during the tests were cutter size, shape, density (number of cutters), and orientation. Drilling tests in limestone, sandstone, marble, and granite blocks showed that these optimized bits drilled many of these rocks at 500-1,000 ft/hr compared to 50-100 ft/hr for conventional rotary drilling. A sensitivity model showed that doubling the rate of penetration significantly reduced the time to drill a well and reduced costs by 13 %.

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

    PubMed

    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. PMID:21806174

  1. Parameter estimation of copula functions using an optimization-based method

    NASA Astrophysics Data System (ADS)

    Abdi, Amin; Hassanzadeh, Yousef; Talatahari, Siamak; Fakheri-Fard, Ahmad; Mirabbasi, Rasoul

    2016-02-01

    Application of the copulas can be useful for the accurate multivariate frequency analysis of hydrological phenomena. There are many copula functions and some methods were proposed for estimating the copula parameters. Since the copula functions are mathematically complicated, estimating of the copula parameter is an effortful work. In the present study, an optimization-based method (OBM) is proposed to obtain the parameters of copulas. The usefulness of the proposed method is illustrated on drought events. For this purpose, three commonly used copulas of Archimedean family, namely, Clayton, Frank, and Gumbel copulas are used to construct the joint probability distribution of drought characteristics of 60 gauging sites located in East-Azarbaijan province, Iran. The performance of OBM was compared with two conventional methods, namely, method of moments and inference function for margins. The results illustrate the supremacy of the OBM to estimate the copula parameters compared to the other considered methods.

  2. Optimization-based additive decomposition of weakly coercive problems with applications

    DOE PAGESBeta

    Bochev, Pavel B.; Ridzal, Denis

    2016-01-27

    In this study, we present an abstract mathematical framework for an optimization-based additive decomposition of a large class of variational problems into a collection of concurrent subproblems. The framework replaces a given monolithic problem by an equivalent constrained optimization formulation in which the subproblems define the optimization constraints and the objective is to minimize the mismatch between their solutions. The significance of this reformulation stems from the fact that one can solve the resulting optimality system by an iterative process involving only solutions of the subproblems. Consequently, assuming that stable numerical methods and efficient solvers are available for every subproblem,more » our reformulation leads to robust and efficient numerical algorithms for a given monolithic problem by breaking it into subproblems that can be handled more easily. An application of the framework to the Oseen equations illustrates its potential.« less

  3. Experimental validation of optimization-based integrated controls-structures design methodology for flexible space structures

    NASA Technical Reports Server (NTRS)

    Maghami, Peiman G.; Gupta, Sandeep; Joshi, Suresh M.; Walz, Joseph E.

    1993-01-01

    An optimization-based integrated design approach for flexible space structures is experimentally validated using three types of dissipative controllers, including static, dynamic, and LQG dissipative controllers. The nominal phase-0 of the controls structure interaction evolutional model (CEM) structure is redesigned to minimize the average control power required to maintain specified root-mean-square line-of-sight pointing error under persistent disturbances. The redesign structure, phase-1 CEM, was assembled and tested against phase-0 CEM. It is analytically and experimentally demonstrated that integrated controls-structures design is substantially superior to that obtained through the traditional sequential approach. The capability of a software design tool based on an automated design procedure in a unified environment for structural and control designs is demonstrated.

  4. An optimization-based integrated controls-structures design methodology for flexible space structures

    NASA Technical Reports Server (NTRS)

    Maghami, Peiman G.; Joshi, Suresh M.; Armstrong, Ernest S.

    1993-01-01

    An approach for an optimization-based integrated controls-structures design is presented for a class of flexible spacecraft that require fine attitude pointing and vibration suppression. The integrated design problem is posed in the form of simultaneous optimization of both structural and control design variables. The approach is demonstrated by application to the integrated design of a generic space platform and to a model of a ground-based flexible structure. The numerical results obtained indicate that the integrated design approach can yield spacecraft designs that have substantially superior performance over a conventional design wherein the structural and control designs are performed sequentially. For example, a 40-percent reduction in the pointing error is observed along with a slight reduction in mass, or an almost twofold increase in the controlled performance is indicated with more than a 5-percent reduction in the overall mass of the spacecraft (a reduction of hundreds of kilograms).

  5. Comparison of optimization-based approaches to imaging spectroscopic inversion in coastal waters

    NASA Astrophysics Data System (ADS)

    Filippi, Anthony M.; Mishonov, Andrey

    2005-06-01

    The United States Navy has recently shifted focus from open-ocean warfare to joint operations in optically complex nearshore regions. Accurately estimating bathymetry and water column inherent optical properties (IOPs) from passive remotely sensed imagery can be an important facilitator of naval operations. Lee et al. developed a semianalytical model that describes the relationship between shallow-water bottom depth, IOPs and subsurface and above-surface reflectance. They also developed a nonlinear optimization-based technique that estimates bottom depth and IOPs, using only measured spectral remote sensing reflectance as input. While quite effective, inversion using noisy field data can limit its accuracy. In this research, the nonlinear optimization-based Lee et al. inversion algorithm was used as a baseline method, and it provided the framework for a proposed hybrid evolutionary/classical optimization approach to hyperspectral data processing. All aspects of the proposed implementation were held constant with that of Lee et al., except that a hybrid evolutionary/classical optimizer (HECO) was substituted for the nonlinear method. HECO required more computer-processing time. In addition, HECO is nondeterministic, and the termination strategy is heuristic. However, the HECO method makes no assumptions regarding the mathematical form of the problem functions. Also, whereas smooth nonlinear optimization is only guaranteed to find a locally optimal solution, HECO has a higher probability of finding a more globally optimal result. While the HECO-acquired results are not provably optimal, we have empirically found that for certain variables, HECO does provide estimates comparable to nonlinear optimization (e.g., bottom albedo at 550 nm).

  6. Task mapping for non-contiguous allocations.

    SciTech Connect

    Leung, Vitus Joseph; Bunde, David P.; Ebbers, Johnathan; Price, Nicholas W.; Swank, Matthew; Feer, Stefan P.; Rhodes, Zachary D.

    2013-02-01

    This paper examines task mapping algorithms for non-contiguously allocated parallel jobs. Several studies have shown that task placement affects job running time for both contiguously and non-contiguously allocated jobs. Traditionally, work on task mapping either uses a very general model where the job has an arbitrary communication pattern or assumes that jobs are allocated contiguously, making them completely isolated from each other. A middle ground between these two cases is the mapping problem for non-contiguous jobs having a specific communication pattern. We propose several task mapping algorithms for jobs with a stencil communication pattern and evaluate them using experiments and simulations. Our strategies improve the running time of a MiniApp by as much as 30% over a baseline strategy. Furthermore, this improvement increases markedly with the job size, demonstrating the importance of task mapping as systems grow toward exascale.

  7. Biomass Resource Allocation among Competing End Uses

    SciTech Connect

    Newes, E.; Bush, B.; Inman, D.; Lin, Y.; Mai, T.; Martinez, A.; Mulcahy, D.; Short, W.; Simpkins, T.; Uriarte, C.; Peck, C.

    2012-05-01

    The Biomass Scenario Model (BSM) is a system dynamics model developed by the U.S. Department of Energy as a tool to better understand the interaction of complex policies and their potential effects on the biofuels industry in the United States. However, it does not currently have the capability to account for allocation of biomass resources among the various end uses, which limits its utilization in analysis of policies that target biomass uses outside the biofuels industry. This report provides a more holistic understanding of the dynamics surrounding the allocation of biomass among uses that include traditional use, wood pellet exports, bio-based products and bioproducts, biopower, and biofuels by (1) highlighting the methods used in existing models' treatments of competition for biomass resources; (2) identifying coverage and gaps in industry data regarding the competing end uses; and (3) exploring options for developing models of biomass allocation that could be integrated with the BSM to actively exchange and incorporate relevant information.

  8. Resource allocation for efficient environmental management.

    PubMed

    McCarthy, Michael A; Thompson, Colin J; Hauser, Cindy; Burgman, Mark A; Possingham, Hugh P; Moir, Melinda L; Tiensin, Thanawat; Gilbert, Marius

    2010-10-01

    Environmental managers must decide how to invest available resources. Researchers have previously determined how to allocate conservation resources among regions, design nature reserves, allocate funding to species conservation programs, design biodiversity surveys and monitoring programs, manage species and invest in greenhouse gas mitigation schemes. However, these issues have not been addressed with a unified theory. Furthermore, uncertainty is prevalent in environmental management, and needs to be considered to manage risks. We present a theory for optimal environmental management, synthesizing previous approaches to the topic and incorporating uncertainty. We show that the theory solves a diverse range of important problems of resource allocation, including distributing conservation resources among the world's biodiversity hotspots; surveillance to detect the highly pathogenic avian influenza H5N1 virus in Thailand; and choosing survey methods for the insect order Hemiptera. Environmental management decisions are similar to decisions about financial investments, with trade-offs between risk and reward. PMID:20718844

  9. Allocation of Attention by Fishing Vessel Watchkeepers

    NASA Astrophysics Data System (ADS)

    Findlay, Malcolm

    2006-05-01

    This study examines the way in which attention is allocated by watchkeepers on fishing vessels and identifies differences in the approach displayed by individuals with different levels of training and experience. A method of analysing the way in which attention is allocated on a sample of UK fishing vessels is described. It was found that both skippers and mates allocated disproportionate amounts of attention to fishfinding equipment at certain stages of the fishing trip, while crewmen were heavily reliant upon the track plotter both while fishing and on passage. Those with more training and experience appeared to treat the array of navigation and control components as an integrated system, while untrained crewmen dealt with each aspect in isolation.

  10. Allocation of resources for organ transplantation.

    PubMed

    Kandula, Praveen; Anderson, T Anthony; Vagefi, Parsia A

    2013-12-01

    Over the last 6 decades, organ transplantation has achieved great success to become standard therapy for the treatment of patients with end-stage organ failure. With this success has emerged candidate wait lists that greatly outnumber the current supply of deceased donor organs. The increasing number of candidates and transplants performed has resulted in an organ allocation process that occurs at a local, regional, and sometimes national level. A brief description of the history is presented as well as the methodologies involved in allocation of a donor organ to a single recipient. PMID:24287345

  11. Allocation for the SANDAC multiprocessor system

    SciTech Connect

    Ravl, T.M.; Ercegovac, M.D.

    1986-01-01

    This report describes an algorithm for the static allocation of tasks in a general Dataflow Multiprocessor and the SANDAC IV system in particular. Initially a model of execution and the underlying assumptions about the architecture are outlined. The authors then discuss a Graph Reduction algorithm for preprocessing the computation graph. The Graph Reduction algorithm reduces a fine grain graph to an optimal grain graph. The heuristic allocation algorithm is presented and is based on giving precedence to critical paths and minimizing the communication time between tasks. The performance of the algorithm is analyzed and the effect of varying parameters is studied. Subsequently an alternative variation with better characteristics is proposed.

  12. The Allocation of Federal Expenditures Among States

    NASA Technical Reports Server (NTRS)

    Lee, Maw Lin

    1967-01-01

    This study explores factors associated with the allocation offederal expenditures by states and examines the implications of theseexpenditures on the state by state distribution of incomes. Theallocation of federal expenditures is functionally oriented toward theobjectives for which various government programs are set up. Thegeographical distribution of federal expenditures, therefore, washistorically considered to be a problem incidental to governmentactivity. Because of this, relatively little attention was given tothe question of why some states receive more federal allocation thanothers. In addition, the implications of this pattern of allocationamong the several states have not been intensively investigated.

  13. NOAO/IRAF's ``Save The Bits'' - A Pragmatic Data Archive

    NASA Astrophysics Data System (ADS)

    Seaman, Rob

    Archival data has been pivotal to astronomy throughout history. Without Tycho's carefully recorded observations, Kepler's insight into the elliptical nature of the orbits of the planets would not have been possible. In our lifetime, the Palomar Sky Survey has been scrutinized daily for four decades by thousands of pairs of eyes. However, for a variety of reasons ground-based optical observatories have been late-comers, by and large, to the archiving of digital images. The era of the CCD has been one of data diaspora. Many of the impediments to creating an archive are peripheral to any archive's principal mission of saving the information for future generations. There is a moral imperative to do at least this much. Modern computer networks now provide the tools to build an image archive that is pragmatic both in terms of programming effort and cost. The NOAO ``Save The Bits'' archive described is now nightly (and daily) automatically archiving the raw data from a half dozen Kitt Peak telescopes via the ICE (IRAF Control Environment) data acquisition software. As images are acquired at each telescope using IRAF/ICE, a unique identifying string constructed from the telescope name, the date, and the UT of the observation is edited into each image header. The IRAF wfits task translates the images to FITS from within the ICE postprocessing script. A print spooler ( e.g. , Unix lpr / lpd ) provides a secure mechanism for transferring the FITS files across the network to a central archive server where they are queued for processing. The data from several telescopes are multiplexed onto a single archive medium ( e.g. , exabyte). As the FITS files are processed by the queue software, each is now stamped with a running sequence number and the resulting FITS header is appended to a catalog file, cross-referenced to the archive tape index. To promote efficient I/O, the individual images are concatenated into FITS Image Extension tape files several tens of Megabytes in size. A

  14. Development of a method for predicting the performance and wear of PDC (polycrystalline diamond compact) drill bits

    SciTech Connect

    Glowka, D.A.

    1987-09-01

    A method is developed for predicting cutter forces, temperatures, and wear on PDC bits as well as integrated bit performance parameters such as weight-on-bit, drilling torque, and bit imbalance. A computer code called PDCWEAR has been developed to make this method available as a tool for general bit design and analysis. The method uses single-cutter data to provide a measure of rock drillability and employs theoretical considerations to account for interaction among closely spaced cutters on the bit. Experimental data are presented to establish the effects of cutter size and wearflat area on the forces that develop during rock cutting. Waterjet assistance is shown to significantly reduce cutting forces, thereby potentially extending bit life and reducing weight-on-bit and torque requirements in hard rock. The effects of several other design and operating parameters on bit life and drilling performance are also investigated.

  15. Concurrent Validity of K-BIT Using the WISC-III as the Criterion.

    ERIC Educational Resources Information Center

    Seagle, Donna L.; Rust, James O.

    The Kaufman Brief Intelligence Test (K-BIT) was used as a screening instrument to predict Wechsler Intelligence Scale for Children-Third Edition (WISC-III) scores of 94 students referred for psychoeducational evaluations. Although the correlation coefficient between the K-BIT IQ Composite and the WISC-III Full Scale IQ was 0.771 for the entire…

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

    NASA Astrophysics Data System (ADS)

    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.

  17. Precious bits: frame synchronization in Jet Propulsion Laboratory's Advanced Multi-Mission Operations System (AMMOS)

    NASA Technical Reports Server (NTRS)

    Wilson, E.

    2001-01-01

    The Jet Propulsion Laboratory's (JPL) Advanced Multi-Mission Operations System (AMMOS) system processes data received from deep-space spacecraft, where error rates are high, bit rates are low, and every bit is precious. Frame synchronization and data extraction as performed by AMMOS enhanced data acquisition and reliability for maximum data return and validity.

  18. Performance of reduced bit-depth acquisition for optical frequency domain imaging

    PubMed Central

    Goldberg, Brian D.; Vakoc, Benjamin J.; Oh, Wang-Yuhl; Suter, Melissa J.; Waxman, Sergio; Freilich, Mark I.; Bouma, Brett E.; Tearney, Guillermo J.

    2009-01-01

    High-speed optical frequency domain imaging (OFDI) has enabled practical wide-field microscopic imaging in the biological laboratory and clinical medicine. The imaging speed of OFDI, and therefore the field of view, of current systems is limited by the rate at which data can be digitized and archived rather than the system sensitivity or laser performance. One solution to this bottleneck is to natively digitize OFDI signals at reduced bit depths, e.g., at 8-bit depth rather than the conventional 12–14 bit depth, thereby reducing overall bandwidth. However, the implications of reduced bit-depth acquisition on image quality have not been studied. In this paper, we use simulations and empirical studies to evaluate the effects of reduced depth acquisition on OFDI image quality. We show that image acquisition at 8-bit depth allows high system sensitivity with only a minimal drop in the signal-to-noise ratio compared to higher bit-depth systems. Images of a human coronary artery acquired in vivo at 8-bit depth are presented and compared with images at higher bit-depth acquisition. PMID:19770914

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

    NASA Technical Reports Server (NTRS)

    Vanderaar, Mark; Wagner, Paul; Budinger, James

    1992-01-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.

  20. Designing the ejector pellet impact drill bit for hard and tough rock drilling

    NASA Astrophysics Data System (ADS)

    Kovalyov, A. V.; Ryabchikov, S. Ya; Isaev, Ye D.; Aliev, F. R.; Gorbenko, M. V.; Strelnikova, A. B.

    2015-02-01

    There are many types of ejector pellet impact drill bit providing impact rock drilling. Basic types of drill strings have been regarded, the essential requirements for the most efficient facilities to drill hard and tough rocks are formulated. With regard to these requirements, the ejector pellet impact drill bit design appropriate for operating under given conditions has been proposed

  1. Scheduling, bandwidth allocation and performance evaluation of DOCSIS protocol over cable networks

    NASA Astrophysics Data System (ADS)

    Kuo, Wen-Kuang; Kumar, Sunil; Kuo, C.-C. Jay

    2002-12-01

    The Data Over Cable Service Interface Specifications (DOCSIS) of the Multimedia Cable Network System (MCNS) organization intends to support IP traffics over HFC (hybrid fiber/coax) networks with significantly higher data rates than analog modems and Integrated Service Digital Network (ISDN) links. The availability of high speed-access enables the delivery of high quality audio, video and interactive services. To support quality-of-service (QoS) for such applications, it is important for HFC networks to provide effective medium access and traffic scheduling mechanisms. In this work, a novel scheduling mechanism and a new bandwidth allocation scheme are proposed to support multimedia traffic over DOCSIS (Data Over Cable System Interface Specification)-compliant cable networks. The primary goal of our research is to improve the transmission of real-time variable bit rate (VBR) traffic in terms of throughput and delay under DOCSIS. To support integrated services, we also consider the transmission of constant bit rate (CBR) traffic and non-real-time traffic in the simulation. To demonstrate the performance, we compare the result of the proposed scheme with that of a simple multiple priority scheme. It is shown via simulation that the proposed method provides a significant amount of improvement over existing QoS scheduling services in DOCSIS. Finally, a discrete-time Markov model is used to analyze the performance of the voice traffic over DOCSIS-supported cable networks.

  2. Speech coding at low to medium bit rates

    NASA Astrophysics Data System (ADS)

    Leblanc, Wilfred Paul

    1992-09-01

    Improved search techniques coupled with improved codebook design methodologies are proposed to improve the performance of conventional code-excited linear predictive coders for speech. Improved methods for quantizing the short term filter are developed by employing a tree search algorithm and joint codebook design to multistage vector quantization. Joint codebook design procedures are developed to design locally optimal multistage codebooks. Weighting during centroid computation is introduced to improve the outlier performance of the multistage vector quantizer. Multistage vector quantization is shown to be both robust against input characteristics and in the presence of channel errors. Spectral distortions of about 1 dB are obtained at rates of 22-28 bits/frame. Structured codebook design procedures for excitation in code-excited linear predictive coders are compared to general codebook design procedures. Little is lost using significant structure in the excitation codebooks while greatly reducing the search complexity. Sparse multistage configurations are proposed for reducing computational complexity and memory size. Improved search procedures are applied to code-excited linear prediction which attempt joint optimization of the short term filter, the adaptive codebook, and the excitation. Improvements in signal to noise ratio of 1-2 dB are realized in practice.

  3. Transforming networking within the ESIP Federation using ResearchBit

    NASA Astrophysics Data System (ADS)

    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.

  4. Advanced High-Speed 16-Bit Digitizer System

    SciTech Connect

    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.

  5. Transnational exchange of scientific data: The ``Bits of Power'' report

    NASA Astrophysics Data System (ADS)

    Berry, R. Stephen

    1998-07-01

    In 1994, the U.S. National Committee for the Committee on Data for Science and Technology (CODATA), organized under the Commission on Physical Sciences, Mathematics and Applications of the National Research Council established the Committee on Issues in the Transborder Flow of Scientific Data. The purpose of this Committee was to examine the current state of global access to scientific data, to identify strengths, problems and challenges confronting scientists now, or likely to arise in the next few years, and to make recommendations on building the strengths and ameliorating or avoiding the problems. The Committee's report appeared as the book Bits of Power: Issues in Global Access to Scientific Data (National Academy Press, Washington, D.C., 1997). This presentation is a brief summary of that report, particularly as it pertains to atomic and molecular data. The context is necessarily the evolution toward increasing electronic acquisition, archiving and distribution of scientific data. Thus the central issues were divided into the technological infrastructure, the issues for the sciences and scientists in the various disciplines, the economic aspects and the legal issues. For purposes of this study, the sciences fell naturally into four groups: the laboratory physical sciences, the biological sciences, the earth sciences and the astronomical and planetary sciences. Some of the substantive scientific aspects are specific to particular groups of sciences, but the matters of infrastructure, economic questions and legal issues apply, for the most part, to all the sciences.

  6. Modeling for write synchronization in bit patterned media recording

    NASA Astrophysics Data System (ADS)

    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.

  7. A short impossibility proof of quantum bit commitment

    NASA Astrophysics Data System (ADS)

    Chiribella, Giulio; D'Ariano, Giacomo Mauro; Perinotti, Paolo; Schlingemann, Dirk; Werner, Reinhard

    2013-06-01

    Bit commitment protocols, whose security is based on the laws of quantum mechanics alone, are generally held to be impossible on the basis of a concealment-bindingness tradeoff (Lo and Chau, 1997 [1], Mayers, 1997 [2]). A strengthened and explicit impossibility proof has been given in D'Ariano et al. (2007) [3] in the Heisenberg picture and in a C*-algebraic framework, considering all conceivable protocols in which both classical and quantum information is exchanged. In the present Letter we provide a new impossibility proof in the Schrödinger picture, greatly simplifying the classification of protocols and strategies using the mathematical formulation in terms of quantum combs (Chiribella et al., 2008 [4]), with each single-party strategy represented by a conditioned comb. We prove that assuming a stronger notion of concealment-for each classical communication history, not in average-allows Alice's cheat to pass also the worst-case Bob's test. The present approach allows us to restate the concealment-bindingness tradeoff in terms of the continuity of dilations of probabilistic quantum combs with the metric given by the comb discriminability-distance.

  8. 3D bit-oriented optical storage in photopolymers

    NASA Astrophysics Data System (ADS)

    Orlic, Susanna; Ulm, Steffen; Eichler, Hans Joachim

    2001-01-01

    The bit-oriented data storage of conventional optical disks may be expanded into the third dimension by using microscopic reflection gratings instead of pits. Microgratings are holographically induced in a photopolymer layer. The Bragg selectivity of holographic volume gratings makes the application of multiplexing methods possible. High storage density may be achieved by combining wavelength multiplexing and multilayer storage. Wavelength multiplexing is realized by recording several gratings overlapping with write beams of different wavelengths. All gratings are recorded simultaneously in the same volume element. By translating a photopolymer sample perpendicularly to the laser beam axis during exposure, stripe-shaped microgratings are induced dynamically with constant linear velocity. The length of a grating is defined by the exposure time. Stripe-shaped gratings are required to realize an areal structure of recorded data similar to the pit-land structure of conventional disks that allows us to overtake the progress made in proceeding CD/DVD technology. Experimental results have been obtained for writing and reading of microholograms in different photopolymer materials including DuPont holographic recording films and CROP photopolymers from Polaroid.

  9. A Complete Graphical Calculus for Spekkens' Toy Bit Theory

    NASA Astrophysics Data System (ADS)

    Backens, Miriam; Duman, Ali Nabi

    2016-01-01

    While quantum theory cannot be described by a local hidden variable model, it is nevertheless possible to construct such models that exhibit features commonly associated with quantum mechanics. These models are also used to explore the question of ψ -ontic versus ψ -epistemic theories for quantum mechanics. Spekkens' toy theory is one such model. It arises from classical probabilistic mechanics via a limit on the knowledge an observer may have about the state of a system. The toy theory for the simplest possible underlying system closely resembles stabilizer quantum mechanics, a fragment of quantum theory which is efficiently classically simulable but also non-local. Further analysis of the similarities and differences between those two theories can thus yield new insights into what distinguishes quantum theory from classical theories, and ψ -ontic from ψ -epistemic theories. In this paper, we develop a graphical language for Spekkens' toy theory. Graphical languages offer intuitive and rigorous formalisms for the analysis of quantum mechanics and similar theories. To compare quantum mechanics and a toy model, it is useful to have similar formalisms for both. We show that our language fully describes Spekkens' toy theory and in particular, that it is complete: meaning any equality that can be derived using other formalisms can also be derived entirely graphically. Our language is inspired by a similar graphical language for quantum mechanics called the ZX-calculus. Thus Spekkens' toy bit theory and stabilizer quantum mechanics can be analysed and compared using analogous graphical formalisms.

  10. 23 CFR 660.107 - Allocations.

    Code of Federal Regulations, 2014 CFR

    2014-04-01

    ... 23 Highways 1 2014-04-01 2014-04-01 false Allocations. 660.107 Section 660.107 Highways FEDERAL HIGHWAY ADMINISTRATION, DEPARTMENT OF TRANSPORTATION ENGINEERING AND TRAFFIC OPERATIONS SPECIAL PROGRAMS... approved Federal Lands Coordinated Technology Implementation Program studies....

  11. 23 CFR 660.107 - Allocations.

    Code of Federal Regulations, 2011 CFR

    2011-04-01

    ... 23 Highways 1 2011-04-01 2011-04-01 false Allocations. 660.107 Section 660.107 Highways FEDERAL HIGHWAY ADMINISTRATION, DEPARTMENT OF TRANSPORTATION ENGINEERING AND TRAFFIC OPERATIONS SPECIAL PROGRAMS... approved Federal Lands Coordinated Technology Implementation Program studies....

  12. 23 CFR 660.107 - Allocations.

    Code of Federal Regulations, 2013 CFR

    2013-04-01

    ... 23 Highways 1 2013-04-01 2013-04-01 false Allocations. 660.107 Section 660.107 Highways FEDERAL HIGHWAY ADMINISTRATION, DEPARTMENT OF TRANSPORTATION ENGINEERING AND TRAFFIC OPERATIONS SPECIAL PROGRAMS... approved Federal Lands Coordinated Technology Implementation Program studies....

  13. 23 CFR 660.107 - Allocations.

    Code of Federal Regulations, 2012 CFR

    2012-04-01

    ... 23 Highways 1 2012-04-01 2012-04-01 false Allocations. 660.107 Section 660.107 Highways FEDERAL HIGHWAY ADMINISTRATION, DEPARTMENT OF TRANSPORTATION ENGINEERING AND TRAFFIC OPERATIONS SPECIAL PROGRAMS... approved Federal Lands Coordinated Technology Implementation Program studies....

  14. Principles of allocation of health care resources.

    PubMed Central

    Knox, E G

    1978-01-01

    The methods and principles of allocating centrally provided health care resources to regions and areas are reviewed using the report of the Resource Allocation Working Party (RAWP) (Department of Health and Social Security, 1976) and the consultative document (Department of Health and Social Security, 1976a) as a basis. A range of practical problems arising from these papers (especially the report of the RAWP) is described and traced to the terms of reference. It is concluded that the RAWP misinterpreted aspects of social and administrative reality, and it failed to recognise clearly that the several principles on which it had to work conflicted with each other and demanded decisions of priority. The consequential errors led to (a) an injudicious imposition of 'objectivity' at all levels of allocation, (b) an unjustified insistence that the same method be used at each administrative level in an additive and transitive manner, (c) the exclusion of general practitioner services from their considerations, (d) a failure to delineate those decisions which are in fact political decisions, thus to concatenate them, inappropriately, with technical and professional issues. The main requirement in a revised system is for a mechanism which allocates different priorities to different principles at each appropriate administrative and distributive level, and adapts the working methods of each tier to meet separately defined objectives. PMID:262585

  15. Resource Allocation Patterns and Student Achievement

    ERIC Educational Resources Information Center

    James, Lori; Pate, James; Leech, Donald; Martin, Ellice; Brockmeier, Lantry; Dees, Elizabeth

    2011-01-01

    This quantitative research study was designed to examine the relationship between system resource allocation patterns and student achievement, as measured by eighth grade Criterion-Referenced Competency Test (CRCT) mathematics, eighth grade CRCT reading, eleventh grade Georgia High School Graduation Test (GHSGT) mathematics, eleventh grade and…

  16. Back to the Basics with Resource Allocations.

    ERIC Educational Resources Information Center

    Matlock, John; Humphries, Frederick S.

    A resource allocation and utilization study was undertaken of Tennessee State University and the results, recommendations and policy decisions that evolved are presented. The President's Council, comprised of the President, the Vice Presidents, and the Director of Planning, Management and Evaluation, directed the study. Data from the Office of…

  17. 45 CFR 304.15 - Cost allocation.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... Department in accordance with the requirements contained in Subpart E of 45 CFR part 95. Subpart E also sets... Welfare Regulations Relating to Public Welfare OFFICE OF CHILD SUPPORT ENFORCEMENT (CHILD SUPPORT... FEDERAL FINANCIAL PARTICIPATION § 304.15 Cost allocation. A State agency in support of its claims...

  18. 45 CFR 400.13 - Cost allocation.

    Code of Federal Regulations, 2014 CFR

    2014-10-01

    ... Welfare Regulations Relating to Public Welfare OFFICE OF REFUGEE RESETTLEMENT, ADMINISTRATION FOR CHILDREN AND FAMILIES, DEPARTMENT OF HEALTH AND HUMAN SERVICES REFUGEE RESETTLEMENT PROGRAM Grants to States for Refugee Resettlement Award of Grants to States § 400.13 Cost allocation. (a) A State must...

  19. Ground data systems resource allocation process

    NASA Technical Reports Server (NTRS)

    Berner, Carol A.; Durham, Ralph; Reilly, Norman B.

    1989-01-01

    The Ground Data Systems Resource Allocation Process at the Jet Propulsion Laboratory provides medium- and long-range planning for the use of Deep Space Network and Mission Control and Computing Center resources in support of NASA's deep space missions and Earth-based science. Resources consist of radio antenna complexes and associated data processing and control computer networks. A semi-automated system was developed that allows operations personnel to interactively generate, edit, and revise allocation plans spanning periods of up to ten years (as opposed to only two or three weeks under the manual system) based on the relative merit of mission events. It also enhances scientific data return. A software system known as the Resource Allocation and Planning Helper (RALPH) merges the conventional methods of operations research, rule-based knowledge engineering, and advanced data base structures. RALPH employs a generic, highly modular architecture capable of solving a wide variety of scheduling and resource sequencing problems. The rule-based RALPH system has saved significant labor in resource allocation. Its successful use affirms the importance of establishing and applying event priorities based on scientific merit, and the benefit of continuity in planning provided by knowledge-based engineering. The RALPH system exhibits a strong potential for minimizing development cycles of resource and payload planning systems throughout NASA and the private sector.

  20. Allocation of Human Resources for Collection Development.

    ERIC Educational Resources Information Center

    Bryant, Bonita

    1986-01-01

    This article reviews personnel administration techniques that have been used to establish work-load parameters, but offer no aid in subject deployment. A model which identifies elements that must be included in a consideration of work-load measurement and subject allocation for library collection development tasks is presented. Thirty-four…

  1. 50 CFR 648.87 - Sector allocation.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... 50 Wildlife and Fisheries 8 2010-10-01 2010-10-01 false Sector allocation. 648.87 Section 648.87 Wildlife and Fisheries FISHERY CONSERVATION AND MANAGEMENT, NATIONAL OCEANIC AND ATMOSPHERIC ADMINISTRATION, DEPARTMENT OF COMMERCE FISHERIES OF THE NORTHEASTERN UNITED STATES Management Measures for the NE Multispecies and Monkfish Fisheries §...

  2. 24 CFR 574.130 - Formula allocations.

    Code of Federal Regulations, 2011 CFR

    2011-04-01

    ... 24 Housing and Urban Development 3 2011-04-01 2010-04-01 true Formula allocations. 574.130 Section 574.130 Housing and Urban Development Regulations Relating to Housing and Urban Development (Continued) OFFICE OF ASSISTANT SECRETARY FOR COMMUNITY PLANNING AND DEVELOPMENT, DEPARTMENT OF HOUSING AND...

  3. 24 CFR 92.50 - Formula allocation.

    Code of Federal Regulations, 2010 CFR

    2010-04-01

    ... 24 Housing and Urban Development 1 2010-04-01 2010-04-01 false Formula allocation. 92.50 Section 92.50 Housing and Urban Development Office of the Secretary, Department of Housing and Urban... previous fiscal year, are metropolitan cities, urban counties, or consortia approved under § 92.101;...

  4. Issues in organ procurement, allocation, and transplantation.

    PubMed

    Nierste, Deborah

    2013-01-01

    Organ transplantation extends lives and improves health but presents complex ethical dilemmas for nurses caring for donors, recipients, and their families. This article overviews organ procurement and allocation, discusses ethical dilemmas in transplantation, and offers strategies from professional and biblical perspectives for coping with moral distress and maintaining compassionate care. PMID:23607154

  5. controlling retained insurance costs through an allocation.

    PubMed

    Frese, Richard C

    2015-06-01

    An insurance allocation may help a hospital or health system achieve the following goals for its professional liability and workers' compensation self-insurance or large-deductible programs: Loss-control incentive. Stability. Equity. Comprehension. Ease of administration. PMID:26665334

  6. Limits on linearity of missile allocation optimization

    SciTech Connect

    Canavan, G.H.

    1997-12-01

    Optimizations of missile allocation based on linearized exchange equations produce accurate allocations, but the limits of validity of the linearization are not known. These limits are explored in the context of the upload of weapons by one side to initially small, equal forces of vulnerable and survivable weapons. The analysis compares analytic and numerical optimizations and stability induces based on aggregated interactions of the two missile forces, the first and second strikes they could deliver, and they resulting costs. This note discusses the costs and stability indices induced by unilateral uploading of weapons to an initially symmetrical low force configuration. These limits are quantified for forces with a few hundred missiles by comparing analytic and numerical optimizations of first strike costs. For forces of 100 vulnerable and 100 survivable missiles on each side, the analytic optimization agrees closely with the numerical solution. For 200 vulnerable and 200 survivable missiles on each side, the analytic optimization agrees with the induces to within about 10%, but disagrees with the allocation of the side with more weapons by about 50%. The disagreement comes from the interaction of the possession of more weapons with the shift of allocation from missiles to value that they induce.

  7. Resource Allocation in U. K. Universities.

    ERIC Educational Resources Information Center

    Taylor, Bryan J. R.

    1982-01-01

    Information on resource allocation in United Kingdom (UK) universities, which is derived from a study by a Working Party of the Conference of University administrators, is presented. Attention is directed to: structures and constitutions; the use of norms and formulas; administration and central services; minor works, maintenance, and space; and…

  8. 10 CFR 490.503 - Credit allocation.

    Code of Federal Regulations, 2014 CFR

    2014-01-01

    ... DEPARTMENT OF ENERGY ENERGY CONSERVATION ALTERNATIVE FUEL TRANSPORTATION PROGRAM Alternative Fueled Vehicle... described in section 490.507 of this part, DOE shall allocate one credit for each alternative fueled vehicle a fleet or covered person acquires that exceeds the number of alternative fueled vehicles that...

  9. RESOURCES ALLOCATION TO OPTIMIZE MINING POLLUTION CONTROL

    EPA Science Inventory

    A comprehensive model for mine drainage simulation and optimization of resource allocation to control mine acid pollution in a watershed has been developed. The model is capable of: (a) Producing a time trace of acid load and flow from acid drainage sources as a function of clima...

  10. 42 CFR 457.228 - Cost allocation.

    Code of Federal Regulations, 2012 CFR

    2012-10-01

    ... or appropriate CHIP Agency will have an approved cost allocation plan on file with the Department in accordance with the requirements contained in subpart E of 45 CFR part 95. Subpart E also sets forth the... Health CENTERS FOR MEDICARE & MEDICAID SERVICES, DEPARTMENT OF HEALTH AND HUMAN SERVICES...

  11. 42 CFR 457.228 - Cost allocation.

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ... 42 Public Health 4 2013-10-01 2013-10-01 false Cost allocation. 457.228 Section 457.228 Public Health CENTERS FOR MEDICARE & MEDICAID SERVICES, DEPARTMENT OF HEALTH AND HUMAN SERVICES (CONTINUED) STATE CHILDREN'S HEALTH INSURANCE PROGRAMS (SCHIPs) ALLOTMENTS AND GRANTS TO STATES General Administration-Reviews and Audits; Withholding for...

  12. 42 CFR 457.228 - Cost allocation.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... or appropriate CHIP Agency will have an approved cost allocation plan on file with the Department in accordance with the requirements contained in subpart E of 45 CFR part 95. Subpart E also sets forth the... Health CENTERS FOR MEDICARE & MEDICAID SERVICES, DEPARTMENT OF HEALTH AND HUMAN SERVICES...

  13. 42 CFR 457.228 - Cost allocation.

    Code of Federal Regulations, 2014 CFR

    2014-10-01

    ... or appropriate CHIP Agency will have an approved cost allocation plan on file with the Department in accordance with the requirements contained in subpart E of 45 CFR part 95. Subpart E also sets forth the... Health CENTERS FOR MEDICARE & MEDICAID SERVICES, DEPARTMENT OF HEALTH AND HUMAN SERVICES...

  14. 2 CFR 200.405 - Allocable costs.

    Code of Federal Regulations, 2014 CFR

    2014-01-01

    ... Grants and Agreements Office of Management and Budget Guidance for Grants and Agreements OFFICE OF MANAGEMENT AND BUDGET GUIDANCE Reserved UNIFORM ADMINISTRATIVE REQUIREMENTS, COST PRINCIPLES, AND AUDIT REQUIREMENTS FOR FEDERAL AWARDS Cost Principles Basic Considerations § 200.405 Allocable costs. (a) A cost...

  15. 24 CFR 945.203 - Allocation plan.

    Code of Federal Regulations, 2013 CFR

    2013-04-01

    ... 24 Housing and Urban Development 4 2013-04-01 2013-04-01 false Allocation plan. 945.203 Section 945.203 Housing and Urban Development REGULATIONS RELATING TO HOUSING AND URBAN DEVELOPMENT (CONTINUED) OFFICE OF ASSISTANT SECRETARY FOR PUBLIC AND INDIAN HOUSING, DEPARTMENT OF HOUSING AND URBAN...

  16. Rural Attitudes toward Public Welfare Allocation.

    ERIC Educational Resources Information Center

    Davis, Laura F.

    1988-01-01

    Examines 1984 Wyoming opinion poll. Wyoming respondents agreed welfare allocation should be based on need, but 50 percent believed welfare recipients should not receive more than minimum-wage income. Wyoming's welfare support is lower than national average. Rurality may contribute to results. Recommends ways to increase rural support for welfare…

  17. Unveiling the BitTorrent Performance in Mobile WiMAX Networks

    NASA Astrophysics Data System (ADS)

    Wang, Xiaofei; Kim, Seungbae; Kwon, Ted "Taekyoung"; Kim, Hyun-Chul; Choi, Yanghee

    As mobile Internet environments are becoming widespread, how to revamp peer-to-peer (P2P) operations for mobile hosts is gaining more attention. In this paper, we carry out empirical measurement of BitTorrent users in a commercial WiMAX network. We investigate how handovers in WiMAX networks impact the BitTorrent performance, how BitTorrent peers perform from the aspects of connectivity, stability and capability, and how the BitTorrent protocol behaves depending on user mobility. We observe that the drawbacks of BitTorrent for mobile users are characterized by poor connectivity among peers, short download session times, small download throughput, negligible upload contributions, and high signaling overhead.

  18. All-optical 2-bit header recognition and packet switching using polarization bistable VCSELs.

    PubMed

    Hayashi, Daisuke; Nakao, Kazuya; Katayama, Takeo; Kawaguchi, Hitoshi

    2015-04-01

    We propose and evaluate an all-optical 2-bit header recognition and packet switching method using two 1.55-µm polarization bistable vertical-cavity surface-emitting lasers (VCSELs) and three optical switches. Polarization bistable VCSELs acted as flip-flop devices by using AND-gate operations of the header and set pulses, together with the reset pulses. Optical packets including 40-Gb/s non-return-to-zero pseudo-random bit-sequence payloads were successfully sent to one of four ports according to the state of two bits in the headers with a 4-bit 500-Mb/s return-to-zero format. The input pulse powers were 17.2 to 31.8 dB lower than the VCSEL output power. We also examined an extension of this method to multi-bit header recognition and packet switching. PMID:25968674

  19. Changes realized from extended bit-depth and metal artifact reduction in CT

    SciTech Connect

    Glide-Hurst, C.; Chen, D.; Zhong, H.; Chetty, I. J.

    2013-06-15

    Purpose: High-Z material in computed tomography (CT) yields metal artifacts that degrade image quality and may cause substantial errors in dose calculation. This study couples a metal artifact reduction (MAR) algorithm with enhanced 16-bit depth (vs standard 12-bit) to quantify potential gains in image quality and dosimetry. Methods: Extended CT to electron density (CT-ED) curves were derived from a tissue characterization phantom with titanium and stainless steel inserts scanned at 90-140 kVp for 12- and 16-bit reconstructions. MAR was applied to sinogram data (Brilliance BigBore CT scanner, Philips Healthcare, v.3.5). Monte Carlo simulation (MC-SIM) was performed on a simulated double hip prostheses case (Cerrobend rods embedded in a pelvic phantom) using BEAMnrc/Dosxyz (400 000 0000 histories, 6X, 10 Multiplication-Sign 10 cm{sup 2} beam traversing Cerrobend rod). A phantom study was also conducted using a stainless steel rod embedded in solid water, and dosimetric verification was performed with Gafchromic film analysis (absolute difference and gamma analysis, 2% dose and 2 mm distance to agreement) for plans calculated with Anisotropic Analytic Algorithm (AAA, Eclipse v11.0) to elucidate changes between 12- and 16-bit data. Three patients (bony metastases to the femur and humerus, and a prostate cancer case) with metal implants were reconstructed using both bit depths, with dose calculated using AAA and derived CT-ED curves. Planar dose distributions were assessed via matrix analyses and using gamma criteria of 2%/2 mm. Results: For 12-bit images, CT numbers for titanium and stainless steel saturated at 3071 Hounsfield units (HU), whereas for 16-bit depth, mean CT numbers were much larger (e.g., titanium and stainless steel yielded HU of 8066.5 {+-} 56.6 and 13 588.5 {+-} 198.8 for 16-bit uncorrected scans at 120 kVp, respectively). MC-SIM was well-matched between 12- and 16-bit images except downstream of the Cerrobend rod, where 16-bit dose was {approx}6

  20. The allocation of cargo to channel missions

    SciTech Connect

    Liu, Cheng; Harrison, G.

    1992-01-01

    Each month the armed services provide a forecast of tons of cargo by channel to MAC. The purpose of the Channels Allocation Algorithm is to allocate cargo requirements to specific Channel Missions. The objective of the allocation is algorithm is to minimize frequency and cargo requirements shortfall. The constraints on the allocation model include flying hours, channel frequencies, mission structure, mission operation days, and aircraft capacity. Cargo requirements shortfall is defined as the tonnage of cargo not moved from the airfields in the United States that are channel staging points to overseas locations. Channel frequencies are defined by the number of times a destination is served by an origin in one month. The mission structures are defined as sets of missions usually in the form of circuit. Mission operating days are determined by the operating day rules for the month, or they can be input by the user for an individual month. One of the assumptions in this model is that there is only one transshipment allowed between any origin and a destination if there is no mission that actually connects the stations. The transshipment stations are also restricted in that only certain stations can serve as transshipment stations. The Channels Allocation Algorithm consists of two linear programs that incorporate three objectives. The objectives are: (1) to minimize that number of frequency channels not met. (2) to minimize cargo shortfall, and (3) to minimize operating cost. The first linear program minimizes frequency channels not met, subject to the mission structure, number of times the mission operates, and total flying hours available. The second linear program minimizes the fleet operating cost cargo handling cost, and cargo shortfall, subject to frequency channels met by the first linear program, aircraft capacity, and total flying hours available. This document is comprised of viewgraphs.

  1. The allocation of cargo to channel missions

    SciTech Connect

    Liu, Cheng; Harrison, G.

    1992-06-01

    Each month the armed services provide a forecast of tons of cargo by channel to MAC. The purpose of the Channels Allocation Algorithm is to allocate cargo requirements to specific Channel Missions. The objective of the allocation is algorithm is to minimize frequency and cargo requirements shortfall. The constraints on the allocation model include flying hours, channel frequencies, mission structure, mission operation days, and aircraft capacity. Cargo requirements shortfall is defined as the tonnage of cargo not moved from the airfields in the United States that are channel staging points to overseas locations. Channel frequencies are defined by the number of times a destination is served by an origin in one month. The mission structures are defined as sets of missions usually in the form of circuit. Mission operating days are determined by the operating day rules for the month, or they can be input by the user for an individual month. One of the assumptions in this model is that there is only one transshipment allowed between any origin and a destination if there is no mission that actually connects the stations. The transshipment stations are also restricted in that only certain stations can serve as transshipment stations. The Channels Allocation Algorithm consists of two linear programs that incorporate three objectives. The objectives are: (1) to minimize that number of frequency channels not met. (2) to minimize cargo shortfall, and (3) to minimize operating cost. The first linear program minimizes frequency channels not met, subject to the mission structure, number of times the mission operates, and total flying hours available. The second linear program minimizes the fleet operating cost cargo handling cost, and cargo shortfall, subject to frequency channels met by the first linear program, aircraft capacity, and total flying hours available. This document is comprised of viewgraphs.

  2. PDC Bit Testing at Sandia Reveals Influence of Chatter in Hard-Rock Drilling

    SciTech Connect

    RAYMOND,DAVID W.

    1999-10-14

    Polycrystalline diamond compact (PDC) bits have yet to be routinely applied to drilling the hard-rock formations characteristic of geothermal reservoirs. Most geothermal production wells are currently drilled with tungsten-carbide-insert roller-cone bits. PDC bits have significantly improved penetration rates and bit life beyond roller-cone bits in the oil and gas industry where soft to medium-hard rock types are encountered. If PDC bits could be used to double current penetration rates in hard rock geothermal well-drilling costs could be reduced by 15 percent or more. PDC bits exhibit reasonable life in hard-rock wear testing using the relatively rigid setups typical of laboratory testing. Unfortunately, field experience indicates otherwise. The prevailing mode of failure encountered by PDC bits returning from hard-rock formations in the field is catastrophic, presumably due to impact loading. These failures usually occur in advance of any appreciable wear that might dictate cutter replacement. Self-induced bit vibration, or ''chatter'', is one of the mechanisms that may be responsible for impact damage to PDC cutters in hard-rock drilling. Chatter is more severe in hard-rock formations since they induce significant dynamic loading on the cutter elements. Chatter is a phenomenon whereby the drillstring becomes dynamically unstable and excessive sustained vibrations occur. Unlike forced vibration, the force (i.e., weight on bit) that drives self-induced vibration is coupled with the response it produces. Many of the chatter principles derived in the machine tool industry are applicable to drilling. It is a simple matter to make changes to a machine tool to study the chatter phenomenon. This is not the case with drilling. Chatter occurs in field drilling due to the flexibility of the drillstring. Hence, laboratory setups must be made compliant to observe chatter.

  3. A new method for ship inner shell optimization based on parametric technique

    NASA Astrophysics Data System (ADS)

    Yu, Yan-Yun; Lin, Yan; Li, Kai

    2015-01-01

    A new method for ship Inner Shell optimization, which is called Parametric Inner Shell Optimization Method (PISOM), is presented in this paper in order to improve both hull performance and design efficiency of transport ship. The foundation of PISOM is the parametric Inner Shell Plate (ISP) model, which is a fully-associative model driven by dimensions. A method to create parametric ISP model is proposed, including geometric primitives, geometric constraints, geometric constraint solving etc. The standard optimization procedure of ship ISP optimization based on parametric ISP model is put forward, and an efficient optimization approach for typical transport ship is developed based on this procedure. This approach takes the section area of ISP and the other dominant parameters as variables, while all the design requirements such as propeller immersion, fore bottom wave slap, bridge visibility, longitudinal strength etc, are made constraints. The optimization objective is maximum volume of cargo oil tanker/cargo hold, and the genetic algorithm is used to solve this optimization model. This method is applied to the optimization of a product oil tanker and a bulk carrier, and it is proved to be effective, highly efficient, and engineering practical.

  4. Aircraft wing structural design optimization based on automated finite element modelling and ground structure approach

    NASA Astrophysics Data System (ADS)

    Yang, Weizhu; Yue, Zhufeng; Li, Lei; Wang, Peiyan

    2016-01-01

    An optimization procedure combining an automated finite element modelling (AFEM) technique with a ground structure approach (GSA) is proposed for structural layout and sizing design of aircraft wings. The AFEM technique, based on CATIA VBA scripting and PCL programming, is used to generate models automatically considering the arrangement of inner systems. GSA is used for local structural topology optimization. The design procedure is applied to a high-aspect-ratio wing. The arrangement of the integral fuel tank, landing gear and control surfaces is considered. For the landing gear region, a non-conventional initial structural layout is adopted. The positions of components, the number of ribs and local topology in the wing box and landing gear region are optimized to obtain a minimum structural weight. Constraints include tank volume, strength, buckling and aeroelastic parameters. The results show that the combined approach leads to a greater weight saving, i.e. 26.5%, compared with three additional optimizations based on individual design approaches.

  5. Globally Optimal Base Station Clustering in Interference Alignment-Based Multicell Networks

    NASA Astrophysics Data System (ADS)

    Brandt, Rasmus; Mochaourab, Rami; Bengtsson, Mats

    2016-04-01

    Coordinated precoding based on interference alignment is a promising technique for improving the throughputs in future wireless multicell networks. In small networks, all base stations can typically jointly coordinate their precoding. In large networks however, base station clustering is necessary due to the otherwise overwhelmingly high channel state information (CSI) acquisition overhead. In this work, we provide a branch and bound algorithm for finding the globally optimal base station clustering. The algorithm is mainly intended for benchmarking existing suboptimal clustering schemes. We propose a general model for the user throughputs, which only depends on the long-term CSI statistics. The model assumes intracluster interference alignment and is able to account for the CSI acquisition overhead. By enumerating a search tree using a best-first search and pruning sub-trees in which the optimal solution provably cannot be, the proposed method converges to the optimal solution. The pruning is done using specifically derived bounds, which exploit some assumed structure in the throughput model. It is empirically shown that the proposed method has an average complexity which is orders of magnitude lower than that of exhaustive search.

  6. Optimization-based reconstruction for reduction of CBCT artifact in IGRT

    NASA Astrophysics Data System (ADS)

    Xia, Dan; Zhang, Zheng; Paysan, Pascal; Seghers, Dieter; Brehm, Marcus; Munro, Peter; Sidky, Emil Y.; Pelizzari, Charles; Pan, Xiaochuan

    2016-04-01

    Kilo-voltage cone-beam computed tomography (CBCT) plays an important role in image guided radiation therapy (IGRT) by providing 3D spatial information of tumor potentially useful for optimizing treatment planning. In current IGRT CBCT system, reconstructed images obtained with analytic algorithms, such as FDK algorithm and its variants, may contain artifacts. In an attempt to compensate for the artifacts, we investigate optimization-based reconstruction algorithms such as the ASD-POCS algorithm for potentially reducing arti- facts in IGRT CBCT images. In this study, using data acquired with a physical phantom and a patient subject, we demonstrate that the ASD-POCS reconstruction can significantly reduce artifacts observed in clinical re- constructions. Moreover, patient images reconstructed by use of the ASD-POCS algorithm indicate a contrast level of soft-tissue improved over that of the clinical reconstruction. We have also performed reconstructions from sparse-view data, and observe that, for current clinical imaging conditions, ASD-POCS reconstructions from data collected at one half of the current clinical projection views appear to show image quality, in terms of spatial and soft-tissue-contrast resolution, higher than that of the corresponding clinical reconstructions.

  7. Optimization Based Data Mining Approah for Forecasting Real-Time Energy Demand

    SciTech Connect

    Omitaomu, Olufemi A; Li, Xueping; Zhou, Shengchao

    2015-01-01

    The worldwide concern over environmental degradation, increasing pressure on electric utility companies to meet peak energy demand, and the requirement to avoid purchasing power from the real-time energy market are motivating the utility companies to explore new approaches for forecasting energy demand. Until now, most approaches for forecasting energy demand rely on monthly electrical consumption data. The emergence of smart meters data is changing the data space for electric utility companies, and creating opportunities for utility companies to collect and analyze energy consumption data at a much finer temporal resolution of at least 15-minutes interval. While the data granularity provided by smart meters is important, there are still other challenges in forecasting energy demand; these challenges include lack of information about appliances usage and occupants behavior. Consequently, in this paper, we develop an optimization based data mining approach for forecasting real-time energy demand using smart meters data. The objective of our approach is to develop a robust estimation of energy demand without access to these other building and behavior data. Specifically, the forecasting problem is formulated as a quadratic programming problem and solved using the so-called support vector machine (SVM) technique in an online setting. The parameters of the SVM technique are optimized using simulated annealing approach. The proposed approach is applied to hourly smart meters data for several residential customers over several days.

  8. The Virtual Solar Observatory at Eight and a Bit!

    NASA Astrophysics Data System (ADS)

    Davey, Alisdair R.; VSO Team

    2011-05-01

    The Virtual Solar Observatory (VSO) was the first virtual observatory in the solar and heliophysics data space. It first saw the light of day in 2003 with a mission to serve the solar physics community by enabling homogenous access to heterogeneous data, and hiding the gory details of doing so from the user. The VSO pioneered what was to become the "Small Box" methodology, setting out to provide only the services required to navigate the user to the data and then letting them directly transferred the data from the data providers. After eight and a bit years the VSO now serves data from 72 different instruments covering a multitude of space and ground based observatories, including data from SDO. Dealing with the volume of data from SDO has proved to be our most difficult challenge, forcing us from the small box approach to one where the various VSO sites not only serve SDO data, but are central to the distribution of the data within the US and to Europe and other parts of the world. With SDO data serving mostly in place we are now working on integration with the Heliophysics Event Knowledgebase (HEK) and including a number of new solar data sets in the VSO family. We have a complete VSO search interface in IDL now, enabling searching, downloading and processing solar data, all be done without leaving the IDL command line, and will be releasing a brand new web interface providing users and data providers, with the ability to create far more detailed and instrument specific searches. Eight years on and the VSO has plenty of work in front of it.

  9. Improving bit error rate through multipath differential demodulation

    NASA Astrophysics Data System (ADS)

    Lize, Yannick Keith; Christen, Louis; Nuccio, Scott; Willner, Alan E.; Kashyap, Raman

    2007-02-01

    Differential phase shift keyed transmission (DPSK) is currently under serious consideration as a deployable datamodulation format for high-capacity optical communication systems due mainly to its 3 dB OSNR advantage over intensity modulation. However DPSK OSNR requirements are still 3 dB higher than its coherent counter part, PSK. Some strategies have been proposed to reduce this penalty through multichip soft detection but the improvement is limited to 0.3dB at BER 10-3. Better performance is expected from other soft-detection schemes using feedback control but the implementation is not straight forward. We present here an optical multipath error correction technique for differentially encoded modulation formats such as differential-phase-shift-keying (DPSK) and differential polarization shift keying (DPolSK) for fiber-based and free-space communication. This multipath error correction method combines optical and electronic logic gates. The scheme can easily be implemented using commercially available interferometers and high speed logic gates and does not require any data overhead therefore does not affect the effective bandwidth of the transmitted data. It is not merely compatible but also complementary to error correction codes commonly used in optical transmission systems such as forward-error-correction (FEC). The technique consists of separating the demodulation at the receiver in multiple paths. Each path consists of a Mach-Zehnder interferometer with an integer bit delay and a different delay is used in each path. Some basic logical operations follow and the three paths are compared using a simple majority vote algorithm. Receiver sensitivity is improved by 0.35 dB in simulations and 1.5 dB experimentally at BER of 10-3.

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

    PubMed

    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. PMID:27386317

  11. Adaptive sensing and optimal power allocation for wireless video sensors with sigma-delta imager.

    PubMed

    Marijan, Malisa; Demirkol, Ilker; Maricić I, Danijel; Sharma, Gaurav; Ignjatovi, Zeljko

    2010-10-01

    We consider optimal power allocation for wireless video sensors (WVSs), including the image sensor subsystem in the system analysis. By assigning a power-rate-distortion (P-R-D) characteristic for the image sensor, we build a comprehensive P-R-D optimization framework for WVSs. For a WVS node operating under a power budget, we propose power allocation among the image sensor, compression, and transmission modules, in order to minimize the distortion of the video reconstructed at the receiver. To demonstrate the proposed optimization method, we establish a P-R-D model for an image sensor based upon a pixel level sigma-delta (Σ∆) image sensor design that allows investigation of the tradeoff between the bit depth of the captured images and spatio-temporal characteristics of the video sequence under the power constraint. The optimization results obtained in this setting confirm that including the image sensor in the system optimization procedure can improve the overall video quality under power constraint and prolong the lifetime of the WVSs. In particular, when the available power budget for a WVS node falls below a threshold, adaptive sensing becomes necessary to ensure that the node communicates useful information about the video content while meeting its power budget. PMID:20551000

  12. 17 CFR 256.01-11 - Methods of allocation.

    Code of Federal Regulations, 2011 CFR

    2011-04-01

    ... HOLDING COMPANY ACT OF 1935 General Instructions § 256.01-11 Methods of allocation. Indirect costs and... indirect costs of work orders for two or more associate companies shall be allocated among such...

  13. 50 CFR 679.62 - Inshore sector cooperative allocation program.

    Code of Federal Regulations, 2014 CFR

    2014-10-01

    ...) Conversion of quota share percentage to TAC allocations. (Effective April 1, 2005) Each inshore pollock... annual pollock TAC allocation may be published in the proposed and final BSAI harvest...

  14. 25 CFR 170.200 - How does BIA allocate IRR Program funds?

    Code of Federal Regulations, 2010 CFR

    2010-04-01

    ... ROADS PROGRAM Indian Reservation Roads Program Funding Tribal Transportation Allocation Methodology... Transportation Allocation Methodology (TTAM) that BIA uses to allocate IRR Program funds. After...

  15. Investigation of diamond-impregnated drill bit wear while drilling under Earth and Mars conditions

    NASA Astrophysics Data System (ADS)

    Zacny, K. A.; Cooper, G. A.

    2004-07-01

    Experiments conducted on a dry and a water-saturated rock under Martian and Earth atmospheric pressures revealed two different wear behaviors in diamond-impregnated drill bits. When the rock was saturated, drilling under Martian pressure caused the water in contact with the rotating bit to vaporize. Since the volumetric expansion of the liquid water or ice as it turned into a vapor was 170,000, the continuous flow of water vapor cleared the cuttings out of the hole. Thus the bit matrix was always exposed to abrasive wear by the rock cuttings and was continually wearing down and exposing new diamonds to the rock. When the rock was dry, an accumulation of rock cuttings protected the matrix from abrasive wear. Since fresh diamonds were not exposed in a timely manner, the rate of penetration dropped. Both rock conditions, namely, dry or water saturated, may exist on Mars. This adds to the complexity of the drill bit design as, ideally, a bit should penetrate the rock irrespective of whether it is dry or water saturated. The ``fail-safe'' bit would have a very soft matrix to always produce some rock penetration at the expense of potential excessive bit wear and shallower than anticipated hole depth.

  16. 7 CFR 761.205 - Computing the formula allocation.

    Code of Federal Regulations, 2010 CFR

    2010-01-01

    ... held in the National Office reserve and distributed by base and administrative allocation, multiplied... allocation−national reserve−base allocation−administrative allocation) × State Factor (b) To calculate the..., DEPARTMENT OF AGRICULTURE SPECIAL PROGRAMS GENERAL PROGRAM ADMINISTRATION Allocation of Farm Loan...

  17. 49 CFR 93.1 - Issuance of aircraft allocations.

    Code of Federal Regulations, 2012 CFR

    2012-10-01

    ... 49 Transportation 1 2012-10-01 2012-10-01 false Issuance of aircraft allocations. 93.1 Section 93.1 Transportation Office of the Secretary of Transportation AIRCRAFT ALLOCATION § 93.1 Issuance of aircraft allocations. From time to time, the Director, Office of Emergency Transportation, issues...

  18. 49 CFR 93.1 - Issuance of aircraft allocations.

    Code of Federal Regulations, 2014 CFR

    2014-10-01

    ... 49 Transportation 1 2014-10-01 2014-10-01 false Issuance of aircraft allocations. 93.1 Section 93.1 Transportation Office of the Secretary of Transportation AIRCRAFT ALLOCATION § 93.1 Issuance of aircraft allocations. From time to time, the Director, Office of Emergency Transportation, issues...

  19. 49 CFR 93.1 - Issuance of aircraft allocations.

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ... 49 Transportation 1 2013-10-01 2013-10-01 false Issuance of aircraft allocations. 93.1 Section 93.1 Transportation Office of the Secretary of Transportation AIRCRAFT ALLOCATION § 93.1 Issuance of aircraft allocations. From time to time, the Director, Office of Emergency Transportation, issues...

  20. 49 CFR 93.1 - Issuance of aircraft allocations.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... Reserve Air Fleet Program of the Department of Defense. The current listing of aircraft allocations may be... 49 Transportation 1 2011-10-01 2011-10-01 false Issuance of aircraft allocations. 93.1 Section 93.1 Transportation Office of the Secretary of Transportation AIRCRAFT ALLOCATION § 93.1 Issuance...