WorldWideScience

Sample records for pseudorandom binary code

  1. A Pseudorandom Code Modulated LIDAR

    Science.gov (United States)

    Hunt, K. P.; Eichinger, W. E.; Kruger, A.

    2009-12-01

    Typical Light Detection and Ranging (LIDAR) uses high power pulsed lasers to ensure a detectable return signal. For short ranges, modulated diode lasers offer an attractive alternative, particularly in the areas of size, weight, cost, eye safety and use of energy. Flexible electronic modulation of the laser diode allows the development of pseudorandom code (PRC) LIDAR systems that can overcome the disadvantage of low output power and thus low signal to noise ratios. Different PRCs have been proposed. For example, so called M-sequences can be generated simply, but are unbalanced: they have more ones than zeros, which results in a residual noise component. Other sequences such as the A1 and A2 sequences are balanced, but have two autocorrelation peaks, resulting in undesirable pickup of signals from different ranges. In this work, we investigate a new code, an M-sequence with a zero added at the end. The result is still easily generated and has a single autocorrelation peak, but is now balanced. We loaded these sequences into a commercial arbitrary waveform generator (ARB), an Agilent 33250A, which then modulates the laser diode. This allows sequences to be changed quickly and easily, permitting us to design and investigate a wide range of PRC sequences with desirable properties. The ARB modulates a Melles Griot 56ICS near infrared laser diode at a 10 MHz chip rate. Backscatter is collected and focused by a telescope and the detected signal is sampled and correlated with the known PRC. We have gathered data from this LIDAR system and experimentally assessed the performance of this new class of codes.

  2. Preliminary study of pseudorandom binary sequence pulsing of ORELA

    International Nuclear Information System (INIS)

    Larson, N.M.; Olsen, D.K.

    1980-03-01

    It has been suggested that pseudorandom binary sequence (PRBS) pulsing might enhance the performance of the Oak Ridge Electron Linear Accelerator (ORELA) for neutron-induced, time-of-flight (TOF) cross-section measurements. In this technical memorandum, equations are developed for expected count rates, statistical variances, and backgrounds for a pulsing scheme in which a PRBS is superimposed on the periodic equalintensity ORELA bursts. Introduction of the PRBS modification permits neutrons of different energies originating from different bursts to reach the detector simultaneously, and the signal corresponding to a unique flight time to be extracted mathematically. Relative advantages and disadvantages of measurements from conventional and PRBS pulsing modes are discussed in terms of counting statistics and backgrounds. Computer models of TOF spectra are generated for both pulsing modes, using as examples a 20-meter 233 U fission-chamber measurement and a 155-meter 238 U sample-in transmission measurement. Detailed comparisons of PRBS vs conventional results are presented. This study indicates that although PRBS pulsing could enhance ORELA performance for selected measurements, for general ORELA operation the disadvantages from PRBS pulsing probably outweigh the advantages

  3. Synchronizing microelectrode and electronic goniometer data using a pseudo-random binary signal.

    Science.gov (United States)

    Moore, Tyler Robert; Jacobs, Rennie Underwood; Yang, Alexander Cheung; Richter, Erich Oscar

    2013-04-01

    Intra-operative investigation of the subthalamic nucleus (STN) requires concurrent measurement of microelectrode voltage, electrode depth and joint movement during deep brain stimulation (DBS) surgery. Commercial solutions to this problem exist but are more expensive. Multiple instruments from different manufacturers can collect the same data, but data from incompatible instruments are collected on disparate clocks, precluding quantitative analysis. A pseudo-random binary signal recorded simultaneously by each set of instruments allows for chronological reconciliation. A custom program collects microelectrode data while simultaneously sending a pseudo-random binary signal to instruments measuring joint movement. The record of this signal is later used to express microelectrode voltage and joint position in a single chronological frame of reference. ClockSynch was used in 15 DBS procedures. After each surgery, records of microelectrode and joint movement were successfully chronologically reconciled. In conclusion, a pseudo-random binary signal integrates disparate systems of instrumentation at a significantly decreased cost.

  4. Calibration of Modulation Transfer Function of Surface Profilometers with 1D and 2D Binary Pseudo-random Array Standards

    International Nuclear Information System (INIS)

    Yashchuk, Valeriy V.; McKinney, Wayne R.; Takacs, Peter Z.

    2008-01-01

    We suggest and describe the use of a binary pseudo-random grating as a standard test surface for calibration of the modulation transfer function of microscopes. Results from calibration of a MicromapTM-570 interferometric microscope are presented.

  5. The synthesis of the correlation function of pseudorandom binary numbers at the output shift register

    Science.gov (United States)

    Galustov, G. G.; Voronin, V. V.

    2017-05-01

    The sequence generator generates a sequence of pseudorandom binary numbers using a linear-feedback shift register (LFSR). This block implements LFSR using a simple shift register generator (SSRG, or Fibonacci) configuration. In this article we introduce the concept of probabilistic binary element provides requirements, which ensure compliance with the criterion of "uniformity" in the implementation of the basic physical generators uniformly distributed random number sequences. Based on these studies, we obtained an analytic relation between the parameters of the binary sequence and parameters of a numerical sequence with the shift register output. The received analytical dependencies can help in evaluating the statistical characteristics of the processes in solving problems of statistical modeling. It is supposed that the formation of the binary sequence output from the binary probabilistic element is produced using a physical noise process. It is shown that the observed errors in statistical modeling using pseudo-random numbers do not occur if the model examines linear systems with constant parameters, but in case models of nonlinear systems, higher order moments can have a Gaussian distribution.

  6. All-fiber single-mode high modulation rate pseudorandom-coded laser

    Science.gov (United States)

    Zhang, Xin; Yang, Fang; Liu, Yuan; He, Yan; Hou, Xia; Chen, Weibiao

    2013-12-01

    An all-fiber high modulation speed pseudorandom-coded laser based on master oscillator power amplifier configuration is proposed. We use a high modulation rate distributed feedback laser diode as the seed laser to generate the original pseudorandom pulse train. The modulation rate is 1 Gb/s, which corresponds to a minimum pulse interval of 1 ns. A 1 kHz repetition frequency of 10-order M-sequence pseudorandom pulse train is chosen to balance on-line data processing speed and laser ranging resolution. Then, the pseudorandom pulse train is amplified by two-stage amplifiers to boost the output power. All components used in the amplifiers are built in single mode (SM) fiber, so the final output laser is SM with excellent beam quality. Finally, the peak power of pseudorandom code laser is amplified to 23.6 W from 1.5 mW without wave distortion, corresponding to a gain of 42 dB. The ranging experiment of using the optical fiber delay method indoors shows the transmitter of combining modulated laser diode and multistage fiber amplifiers as a promising solution for developing laser for pseudorandom-coded laser ranging.

  7. Characterization of electron microscopes with binary pseudo-random multilayer test samples

    Science.gov (United States)

    Yashchuk, Valeriy V.; Conley, Raymond; Anderson, Erik H.; Barber, Samuel K.; Bouet, Nathalie; McKinney, Wayne R.; Takacs, Peter Z.; Voronov, Dmitriy L.

    2011-09-01

    Verification of the reliability of metrology data from high quality X-ray optics requires that adequate methods for test and calibration of the instruments be developed. For such verification for optical surface profilometers in the spatial frequency domain, a modulation transfer function (MTF) calibration method based on binary pseudo-random (BPR) gratings and arrays has been suggested [1,2] and proven to be an effective calibration method for a number of interferometric microscopes, a phase shifting Fizeau interferometer, and a scatterometer [5]. Here we describe the details of development of binary pseudo-random multilayer (BPRML) test samples suitable for characterization of scanning (SEM) and transmission (TEM) electron microscopes. We discuss the results of TEM measurements with the BPRML test samples fabricated from a WiSi 2/Si multilayer coating with pseudo-randomly distributed layers. In particular, we demonstrate that significant information about the metrological reliability of the TEM measurements can be extracted even when the fundamental frequency of the BPRML sample is smaller than the Nyquist frequency of the measurements. The measurements demonstrate a number of problems related to the interpretation of the SEM and TEM data. Note that similar BPRML test samples can be used to characterize X-ray microscopes. Corresponding work with X-ray microscopes is in progress.

  8. Characterization of electron microscopes with binary pseudo-random multilayer test samples

    International Nuclear Information System (INIS)

    Yashchuk, Valeriy V.; Conley, Raymond; Anderson, Erik H.; Barber, Samuel K.; Bouet, Nathalie; McKinney, Wayne R.; Takacs, Peter Z.; Voronov, Dmitriy L.

    2011-01-01

    Verification of the reliability of metrology data from high quality X-ray optics requires that adequate methods for test and calibration of the instruments be developed. For such verification for optical surface profilometers in the spatial frequency domain, a modulation transfer function (MTF) calibration method based on binary pseudo-random (BPR) gratings and arrays has been suggested and proven to be an effective calibration method for a number of interferometric microscopes, a phase shifting Fizeau interferometer, and a scatterometer [5]. Here we describe the details of development of binary pseudo-random multilayer (BPRML) test samples suitable for characterization of scanning (SEM) and transmission (TEM) electron microscopes. We discuss the results of TEM measurements with the BPRML test samples fabricated from a WiSi 2 /Si multilayer coating with pseudo-randomly distributed layers. In particular, we demonstrate that significant information about the metrological reliability of the TEM measurements can be extracted even when the fundamental frequency of the BPRML sample is smaller than the Nyquist frequency of the measurements. The measurements demonstrate a number of problems related to the interpretation of the SEM and TEM data. Note that similar BPRML test samples can be used to characterize X-ray microscopes. Corresponding work with X-ray microscopes is in progress.

  9. Cardiorespiratory Kinetics Determined by Pseudo-Random Binary Sequences - Comparisons between Walking and Cycling.

    Science.gov (United States)

    Koschate, J; Drescher, U; Thieschäfer, L; Heine, O; Baum, K; Hoffmann, U

    2016-12-01

    This study aims to compare cardiorespiratory kinetics as a response to a standardised work rate protocol with pseudo-random binary sequences between cycling and walking in young healthy subjects. Muscular and pulmonary oxygen uptake (V̇O 2 ) kinetics as well as heart rate kinetics were expected to be similar for walking and cycling. Cardiac data and V̇O 2 of 23 healthy young subjects were measured in response to pseudo-random binary sequences. Kinetics were assessed applying time series analysis. Higher maxima of cross-correlation functions between work rate and the respective parameter indicate faster kinetics responses. Muscular V̇O 2 kinetics were estimated from heart rate and pulmonary V̇O 2 using a circulatory model. Muscular (walking vs. cycling [mean±SD in arbitrary units]: 0.40±0.08 vs. 0.41±0.08) and pulmonary V̇O 2 kinetics (0.35±0.06 vs. 0.35±0.06) were not different, although the time courses of the cross-correlation functions of pulmonary V̇O 2 showed unexpected biphasic responses. Heart rate kinetics (0.50±0.14 vs. 0.40±0.14; P=0.017) was faster for walking. Regarding the biphasic cross-correlation functions of pulmonary V̇O 2 during walking, the assessment of muscular V̇O 2 kinetics via pseudo-random binary sequences requires a circulatory model to account for cardio-dynamic distortions. Faster heart rate kinetics for walking should be considered by comparing results from cycle and treadmill ergometry. © Georg Thieme Verlag KG Stuttgart · New York.

  10. Binary pseudorandom test standard to determine the modulation transfer function of optical microscopes

    Science.gov (United States)

    Lacey, Ian; Anderson, Erik H.; Artemiev, Nikolay A.; Babin, Sergey; Cabrini, Stefano; Calafiore, Guiseppe; Chan, Elaine R.; McKinney, Wayne R.; Peroz, Christophe; Takacs, Peter Z.; Yashchuk, Valeriy V.

    2015-09-01

    This work reports on the development of a binary pseudo-random test sample optimized to calibrate the MTF of optical microscopes. The sample consists of a number of 1-D and 2-D patterns, with different minimum sizes of spatial artifacts from 300 nm to 2 microns. We describe the mathematical background, fabrication process, data acquisition and analysis procedure to return spatial frequency based instrument calibration. We show that the developed samples satisfy the characteristics of a test standard: functionality, ease of specification and fabrication, reproducibility, and low sensitivity to manufacturing error.

  11. Binary pseudorandom test standard to determine the modulation transfer function of optical microscopes

    Energy Technology Data Exchange (ETDEWEB)

    Novak, Erik; Trolinger, James D.; Lacey, Ian; Anderson, Erik H.; Artemiev, Nikolay A.; Babin, Sergey; Cabrini, Stefano; Calafiore, Guiseppe; Chan, Elaine R.; McKinney, Wayne R.; Peroz, Christophe; Takacs, Peter Z.; Yashchuk, Valeriy V.

    2015-09-01

    This work reports on the development of a binary pseudo-random test sample optimized to calibrate the MTF of optical microscopes. The sample consists of a number of 1-D and 2-D patterns, with different minimum sizes of spatial artifacts from 300 nm to 2 microns. We describe the mathematical background, fabrication process, data acquisition and analysis procedure to return spatial frequency based instrument calibration. We show that the developed samples satisfy the characteristics of a test standard: functionality, ease of specification and fabrication, reproducibility, and low sensitivity to manufacturing error. © (2015) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.

  12. Generating Constant Weight Binary Codes

    Science.gov (United States)

    Knight, D.G.

    2008-01-01

    The determination of bounds for A(n, d, w), the maximum possible number of binary vectors of length n, weight w, and pairwise Hamming distance no less than d, is a classic problem in coding theory. Such sets of vectors have many applications. A description is given of how the problem can be used in a first-year undergraduate computational…

  13. Binary Pseudo-Random Gratings and Arrays for Calibration of Modulation Transfer Functions of Surface Profilometers

    Energy Technology Data Exchange (ETDEWEB)

    Barber, Samuel K.; Anderson, Erik D.; Cambie, Rossana; McKinney, Wayne R.; Takacs, Peter Z.; Stover, John C.; Voronov, Dmitriy L.; Yashchuk, Valeriy V.

    2009-09-11

    A technique for precise measurement of the modulation transfer function (MTF), suitable for characterization of a broad class of surface profilometers, is investigated in detail. The technique suggested in [Proc. SPIE 7077-7, (2007), Opt. Eng. 47(7), 073602-1-5 (2008)]is based on use of binary pseudo-random (BPR) gratings and arrays as standard MTF test surfaces. Unlike most conventional test surfaces, BPR gratings and arrays possess white-noise-like inherent power spectral densities (PSD), allowing the direct determination of the one- and two-dimensional MTF, respectively, with a sensitivity uniform over the entire spatial frequency range of a profiler. In the cited work, a one dimensional realization of the suggested method based on use of BPR gratings has been demonstrated. Here, a high-confidence of the MTF calibration technique is demonstrated via cross comparison measurements of a number of two dimensional BPR arrays using two different interferometric microscopes and a scatterometer. We also present the results of application of the experimentally determined MTF correction to the measurement taken with the MicromapTM-570 interferometric microscope of the surface roughness of a super-polished test mirror. In this particular case, without accounting for the instrumental MTF, the surface rms roughness over half of the instrumental spatial frequency bandwidth would be underestimated by a factor of approximately 1.4.

  14. Graphical User Interface and Microprocessor Control Enhancement of a Pseudorandom Code Generator

    National Research Council Canada - National Science Library

    Kos, John

    1999-01-01

    .... This thesis addresses the issue of providing automated computer control to previously built, manually controlled hardware incorporating the Stanford Telecom STEL-1032 Pseudo-Random Number (PRN) Coder...

  15. A Brain Computer Interface for Robust Wheelchair Control Application Based on Pseudorandom Code Modulated Visual Evoked Potential

    DEFF Research Database (Denmark)

    Mohebbi, Ali; Engelsholm, Signe K.D.; Puthusserypady, Sadasivan

    2015-01-01

    In this pilot study, a novel and minimalistic Brain Computer Interface (BCI) based wheelchair control application was developed. The system was based on pseudorandom code modulated Visual Evoked Potentials (c-VEPs). The visual stimuli in the scheme were generated based on the Gold code......, and the VEPs were recognized and classified using subject-specific algorithms. The system provided the ability of controlling a wheelchair model (LEGO R MINDSTORM R EV3 robot) in 4 different directions based on the elicited c-VEPs. Ten healthy subjects were evaluated in testing the system where an average...

  16. Binary pseudo-random gratings and arrays for calibration of the modulation transfer function of surface profilometers: recent developments

    Energy Technology Data Exchange (ETDEWEB)

    Barber, Samuel K.; Soldate, Paul; Anderson, Erik H.; Cambie, Rossana; Marchesini, Stefano; McKinney, Wanye R.; Takacs, Peter Z.; Voronov, Dmitry L.; Yashchuk, Valeriy V.

    2009-07-07

    The major problem of measurement of a power spectral density (PSD) distribution of the surface heights with surface profilometers arises due to the unknown Modulation Transfer Function (MTF) of the instruments. The MTF tends to distort the PSD at higher spatial frequencies. It has been suggested [Proc. SPIE 7077-7, (2007), Opt. Eng. 47 (7), 073602-1-5 (2008)] that the instrumental MTF of a surface profiler can be precisely measured using standard test surfaces based on binary pseudo-random (BPR) patterns. In the cited work, a one dimensional (1D) realization of the suggested method based on use of BPR gratings has been demonstrated. Here, we present recent achievements made in fabricating and using two-dimensional (2D) BPR arrays that allow for a direct 2D calibration of the instrumental MTF. The 2D BPRAs were used as standard test surfaces for 2D MTF calibration of the MicromapTM-570 interferometric microscope with all available objectives. The effects of fabrication imperfections on the efficiency of calibration are also discussed.

  17. Calibration of the modulation transfer function of surface profilometers with binary pseudo-random test standards: expanding the application range

    Energy Technology Data Exchange (ETDEWEB)

    Yashchuk, Valeriy V.; Anderson, Erik H.; Barber, Samuel K.; Bouet, Nathalie; Cambie, Rossana; Conley, Raymond; McKinney, Wayne R.; Takacs, Peter Z.; Voronov, Dmitriy L.

    2011-03-14

    A modulation transfer function (MTF) calibration method based on binary pseudo-random (BPR) gratings and arrays [Proc. SPIE 7077-7 (2007), Opt. Eng. 47, 073602 (2008)] has been proven to be an effective MTF calibration method for a number of interferometric microscopes and a scatterometer [Nucl. Instr. and Meth. A616, 172 (2010)]. Here we report on a further expansion of the application range of the method. We describe the MTF calibration of a 6 inch phase shifting Fizeau interferometer. Beyond providing a direct measurement of the interferometer's MTF, tests with a BPR array surface have revealed an asymmetry in the instrument's data processing algorithm that fundamentally limits its bandwidth. Moreover, the tests have illustrated the effects of the instrument's detrending and filtering procedures on power spectral density measurements. The details of the development of a BPR test sample suitable for calibration of scanning and transmission electron microscopes are also presented. Such a test sample is realized as a multilayer structure with the layer thicknesses of two materials corresponding to BPR sequence. The investigations confirm the universal character of the method that makes it applicable to a large variety of metrology instrumentation with spatial wavelength bandwidths from a few nanometers to hundreds of millimeters.

  18. Calibration of the modulation transfer function of surface profilometers with binary pseudo-random test standards: Expanding the application range

    Energy Technology Data Exchange (ETDEWEB)

    Yashchuk, Valeriy V; Anderson, Erik H.; Barber, Samuel K.; Bouet, Nathalie; Cambie, Rossana; Conley, Raymond; McKinney, Wayne R.; Takacs, Peter Z.; Voronov, Dmitriy L.

    2010-07-26

    A modulation transfer function (MTF) calibration method based on binary pseudo-random (BPR) gratings and arrays [Proc. SPIE 7077-7 (2007), Opt. Eng. 47(7), 073602-1-5 (2008)] has been proven to be an effective MTF calibration method for a number of interferometric microscopes and a scatterometer [Nucl. Instr. and Meth. A 616, 172-82 (2010]. Here we report on a significant expansion of the application range of the method. We describe the MTF calibration of a 6 inch phase shifting Fizeau interferometer. Beyond providing a direct measurement of the interferometer's MTF, tests with a BPR array surface have revealed an asymmetry in the instrument's data processing algorithm that fundamentally limits its bandwidth. Moreover, the tests have illustrated the effects of the instrument's detrending and filtering procedures on power spectral density measurements. The details of the development of a BPR test sample suitable for calibration of scanning and transmission electron microscopes are also presented. Such a test sample is realized as a multilayer structure with the layer thicknesses of two materials corresponding to BPR sequence. The investigations confirm the universal character of the method that makes it applicable to a large variety of metrology instrumentation with spatial wavelength bandwidths from a few nanometers to hundreds of millimeters.

  19. Calibration of the modulation transfer function of surface profilometers with binary pseudo-random test standards: expanding the application range

    International Nuclear Information System (INIS)

    Yashchuk, Valeriy V.; Anderson, Erik H.; Barber, Samuel K.; Bouet, Nathalie; Cambie, Rossana; Conley, Raymond; McKinney, Wayne R.; Takacs, Peter Z.; Voronov, Dmitriy L.

    2011-01-01

    A modulation transfer function (MTF) calibration method based on binary pseudo-random (BPR) gratings and arrays (Proc. SPIE 7077-7 (2007), Opt. Eng. 47, 073602 (2008)) has been proven to be an effective MTF calibration method for a number of interferometric microscopes and a scatterometer (Nucl. Instr. and Meth. A616, 172 (2010)). Here we report on a further expansion of the application range of the method. We describe the MTF calibration of a 6 inch phase shifting Fizeau interferometer. Beyond providing a direct measurement of the interferometer's MTF, tests with a BPR array surface have revealed an asymmetry in the instrument's data processing algorithm that fundamentally limits its bandwidth. Moreover, the tests have illustrated the effects of the instrument's detrending and filtering procedures on power spectral density measurements. The details of the development of a BPR test sample suitable for calibration of scanning and transmission electron microscopes are also presented. Such a test sample is realized as a multilayer structure with the layer thicknesses of two materials corresponding to BPR sequence. The investigations confirm the universal character of the method that makes it applicable to a large variety of metrology instrumentation with spatial wavelength bandwidths from a few nanometers to hundreds of millimeters.

  20. Graphical User Interface and Microprocessor Control Enhancement of a Pseudorandom Code Generator

    National Research Council Canada - National Science Library

    Kos, John

    1999-01-01

    .... The ability to quickly and easily produce various codes such as maximal length codes, Gold codes, Jet Propulsion Laboratory ranging codes, syncopated codes, and non-linear codes in a laboratory environment is essential...

  1. A decoding method of an n length binary BCH code through (n + 1n length binary cyclic code

    Directory of Open Access Journals (Sweden)

    TARIQ SHAH

    2013-09-01

    Full Text Available For a given binary BCH code Cn of length n = 2 s - 1 generated by a polynomial of degree r there is no binary BCH code of length (n + 1n generated by a generalized polynomial of degree 2r. However, it does exist a binary cyclic code C (n+1n of length (n + 1n such that the binary BCH code Cn is embedded in C (n+1n . Accordingly a high code rate is attained through a binary cyclic code C (n+1n for a binary BCH code Cn . Furthermore, an algorithm proposed facilitates in a decoding of a binary BCH code Cn through the decoding of a binary cyclic code C (n+1n , while the codes Cn and C (n+1n have the same minimum hamming distance.

  2. Some Bounds on Binary LCD Codes

    OpenAIRE

    Galvez, Lucky; Kim, Jon-Lark; Lee, Nari; Roe, Young Gun; Won, Byung-Sun

    2017-01-01

    A linear code with a complementary dual (or LCD code) is defined to be a linear code $C$ whose dual code $C^{\\perp}$ satisfies $C \\cap C^{\\perp}$= $\\left\\{ \\mathbf{0}\\right\\} $. Let $LCD{[}n,k{]}$ denote the maximum of possible values of $d$ among $[n,k,d]$ binary LCD codes. We give exact values of $LCD{[}n,k{]}$ for $1 \\le k \\le n \\le 12$. We also show that $LCD[n,n-i]=2$ for any $i\\geq2$ and $n\\geq2^{i}$. Furthermore, we show that $LCD[n,k]\\leq LCD[n,k-1]$ for $k$ odd and $LCD[n,k]\\leq LCD[...

  3. The simultaneous use of several pseudo-random binary sequences in the identification of linear multivariable dynamic systems

    International Nuclear Information System (INIS)

    Cummins, J.D.

    1965-02-01

    With several white noise sources the various transmission paths of a linear multivariable system may be determined simultaneously. This memorandum considers the restrictions on pseudo-random two state sequences to effect simultaneous identification of several transmission paths and the consequential rejection of cross-coupled signals in linear multivariable systems. The conditions for simultaneous identification are established by an example, which shows that the integration time required is large i.e. tends to infinity, as it does when white noise sources are used. (author)

  4. FREQUENCY ANALYSIS OF RLE-BLOCKS REPETITIONS IN THE SERIES OF BINARY CODES WITH OPTIMAL MINIMAX CRITERION OF AUTOCORRELATION FUNCTION

    Directory of Open Access Journals (Sweden)

    A. A. Kovylin

    2013-01-01

    Full Text Available The article describes the problem of searching for binary pseudo-random sequences with quasi-ideal autocorrelation function, which are to be used in contemporary communication systems, including mobile and wireless data transfer interfaces. In the synthesis of binary sequences sets, the target set is manning them based on the minimax criterion by which a sequence is considered to be optimal according to the intended application. In the course of the research the optimal sequences with order of up to 52 were obtained; the analysis of Run Length Encoding was carried out. The analysis showed regularities in the distribution of series number of different lengths in the codes that are optimal on the chosen criteria, which would make it possible to optimize the searching process for such codes in the future.

  5. Cooperative multi-user detection and ranging based on pseudo-random codes

    Science.gov (United States)

    Morhart, C.; Biebl, E. M.

    2009-05-01

    We present an improved approach for a Round Trip Time of Flight distance measurement system. The system is intended for the usage in a cooperative localisation system for automotive applications. Therefore, it is designed to address a large number of communication partners per measurement cycle. By using coded signals in a time divison multiple access order, we can detect a large number of pedestrian sensors with just one car sensor. We achieve this by using very short transmit bursts in combination with a real time correlation algorithm. Futhermore, the correlation approach offers real time data, concerning the time of arrival, that can serve as a trigger impulse for other comunication systems. The distance accuracy of the correlation result was further increased by adding a fourier interpolation filter. The system performance was checked with a prototype at 2.4 GHz. We reached a distance measurement accuracy of 12 cm at a range up to 450 m.

  6. Cooperative multi-user detection and ranging based on pseudo-random codes

    Directory of Open Access Journals (Sweden)

    C. Morhart

    2009-05-01

    Full Text Available We present an improved approach for a Round Trip Time of Flight distance measurement system. The system is intended for the usage in a cooperative localisation system for automotive applications. Therefore, it is designed to address a large number of communication partners per measurement cycle. By using coded signals in a time divison multiple access order, we can detect a large number of pedestrian sensors with just one car sensor. We achieve this by using very short transmit bursts in combination with a real time correlation algorithm. Futhermore, the correlation approach offers real time data, concerning the time of arrival, that can serve as a trigger impulse for other comunication systems. The distance accuracy of the correlation result was further increased by adding a fourier interpolation filter. The system performance was checked with a prototype at 2.4 GHz. We reached a distance measurement accuracy of 12 cm at a range up to 450 m.

  7. Learning Short Binary Codes for Large-scale Image Retrieval.

    Science.gov (United States)

    Liu, Li; Yu, Mengyang; Shao, Ling

    2017-03-01

    Large-scale visual information retrieval has become an active research area in this big data era. Recently, hashing/binary coding algorithms prove to be effective for scalable retrieval applications. Most existing hashing methods require relatively long binary codes (i.e., over hundreds of bits, sometimes even thousands of bits) to achieve reasonable retrieval accuracies. However, for some realistic and unique applications, such as on wearable or mobile devices, only short binary codes can be used for efficient image retrieval due to the limitation of computational resources or bandwidth on these devices. In this paper, we propose a novel unsupervised hashing approach called min-cost ranking (MCR) specifically for learning powerful short binary codes (i.e., usually the code length shorter than 100 b) for scalable image retrieval tasks. By exploring the discriminative ability of each dimension of data, MCR can generate one bit binary code for each dimension and simultaneously rank the discriminative separability of each bit according to the proposed cost function. Only top-ranked bits with minimum cost-values are then selected and grouped together to compose the final salient binary codes. Extensive experimental results on large-scale retrieval demonstrate that MCR can achieve comparative performance as the state-of-the-art hashing algorithms but with significantly shorter codes, leading to much faster large-scale retrieval.

  8. Binary codes with impulse autocorrelation functions for dynamic experiments

    International Nuclear Information System (INIS)

    Corran, E.R.; Cummins, J.D.

    1962-09-01

    A series of binary codes exist which have autocorrelation functions approximating to an impulse function. Signals whose behaviour in time can be expressed by such codes have spectra which are 'whiter' over a limited bandwidth and for a finite time than signals from a white noise generator. These codes are used to determine system dynamic responses using the correlation technique. Programmes have been written to compute codes of arbitrary length and to compute 'cyclic' autocorrelation and cross-correlation functions. Complete listings of these programmes are given, and a code of 1019 bits is presented. (author)

  9. Method of all-optical frequency encoded decimal to binary and binary coded decimal, binary to gray, and gray to binary data conversion using semiconductor optical amplifiers.

    Science.gov (United States)

    Garai, Sisir Kumar

    2011-07-20

    Conversion of optical data from decimal to binary format is very important in optical computing and optical signal processing. There are many binary code systems to represent decimal numbers, the most common being the binary coded decimal (BCD) and gray code system. There are a wide choice of BCD codes, one of which is a natural BCD having a weighted code of 8421, by means of which it is possible to represent a decimal number from 0 to 9 with a combination of 4 bit binary digits. The reflected binary code, also known as the Gray code, is a binary numeral system where two successive values differ in only 1 bit. The Gray code is very important in digital optical communication as it is used to prevent spurious output from optical switches as well as to facilitate error correction in digital communications in an optical domain. Here in this communication, the author proposes an all-optical frequency encoded method of ":decimal to binary, BCD," "binary to gray," and "gray to binary" data conversion using the high-speed switching actions of semiconductor optical amplifiers. To convert decimal numbers to a binary form, a frequency encoding technique is adopted to represent two binary bits, 0 and 1. The frequency encoding technique offers advantages over conventional encoding techniques in terms of less probability of bit errors and greater reliability. Here the author has exploited the polarization switch made of a semiconductor optical amplifier (SOA) and a property of nonlinear rotation of the state of polarization of the probe beam in SOA for frequency conversion to develop the method of frequency encoded data conversion. © 2011 Optical Society of America

  10. Spread-spectrum communication using binary spatiotemporal chaotic codes

    International Nuclear Information System (INIS)

    Wang Xingang; Zhan Meng; Gong Xiaofeng; Lai, C.H.; Lai, Y.-C.

    2005-01-01

    We propose a scheme to generate binary code for baseband spread-spectrum communication by using a chain of coupled chaotic maps. We compare the performances of this type of spatiotemporal chaotic code with those of a conventional code used frequently in digital communication, the Gold code, and demonstrate that our code is comparable or even superior to the Gold code in several key aspects: security, bit error rate, code generation speed, and the number of possible code sequences. As the field of communicating with chaos faces doubts in terms of performance comparison with conventional digital communication schemes, our work gives a clear message that communicating with chaos can be advantageous and it deserves further attention from the nonlinear science community

  11. Improvements on binary coding using parallel computing

    CERN Document Server

    Fuentes, P A; Quintas, D G

    2011-01-01

    The error-correcting codes have many applications in fields related to communications. This paper tackles some partition algorithms to optimize the data encoding. These algorithms are based on sliding windows and allow for a parallel implementation. We analyse them and then expound a comparative study between the different partition methods that we propose.

  12. A contribution to the design of fast code converters for position encoders

    Science.gov (United States)

    Denic, Dragan B.; Dincic, Milan R.; Miljkovic, Goran S.; Peric, Zoran H.

    2016-10-01

    Pseudorandom binary sequences (PRBS) are very useful in many areas of applications. Absolute position encoders based on PRBS have many advantages. However, the pseudorandom code is not directly applicable to the digital electronic systems, hence a converter from pseudorandom to natural binary code is needed. Recently, a fast pseudorandom/natural code converter based on Galois PRBS generator (much faster than previously used converter based on Fibonacci PRBS generator) was proposed. One of the main parts of the Galois code converter is an initial logic. The problem of the design of the initial logic has been solved only for some single values of resolution, but it is still not solved for any value of resolution, which significantly limits the applicability of the fast Galois code converter. This paper solves this problem presenting the solution for the design of the initial logic of the fast Galois pseudorandom/natural code converters used in the pseudorandom position encoders, in general manner, that is for any value of the resolution, allowing for a wide applicability of the fast Galois pseudorandom position encoders. Rigorous mathematical derivation of the formula for the designing of the initial logic is presented. Simulation of the proposed converter is performed in NI MultiSim software. The proposed solution, although developed for pseudorandom position encoders, can be used in many other fields where PRBS are used.

  13. Cryptographic pseudo-random sequences from the chaotic Hénon ...

    Indian Academy of Sciences (India)

    2-dimensional chaotic maps for the generation of pseudorandom sequences. 3. Pseudo-random sequence generation scheme. Generating a pseudorandom binary sequence from the orbit of a chaotic map essentially requires mapping the state of the system to {0,1}. For the Hénon map, consider the two bits bx and by ...

  14. Blind Recognition of Binary BCH Codes for Cognitive Radios

    Directory of Open Access Journals (Sweden)

    Jing Zhou

    2016-01-01

    Full Text Available A novel algorithm of blind recognition of Bose-Chaudhuri-Hocquenghem (BCH codes is proposed to solve the problem of Adaptive Coding and Modulation (ACM in cognitive radio systems. The recognition algorithm is based on soft decision situations. The code length is firstly estimated by comparing the Log-Likelihood Ratios (LLRs of the syndromes, which are obtained according to the minimum binary parity check matrixes of different primitive polynomials. After that, by comparing the LLRs of different minimum polynomials, the code roots and generator polynomial are reconstructed. When comparing with some previous approaches, our algorithm yields better performance even on very low Signal-Noise-Ratios (SNRs with lower calculation complexity. Simulation results show the efficiency of the proposed algorithm.

  15. Expanding Pseudorandom Functions

    DEFF Research Database (Denmark)

    Damgård, Ivan Bjerre; Nielsen, Jesper Buus

    2002-01-01

    Given any weak pseudorandom function, we present a general and efficient technique transforming such a function to a new weak pseudorandom function with an arbitrary length output. This implies, among other things, an encryption mode for block ciphers. The mode is as efficient as known (and widely...

  16. Binary to Octal and Octal to Binary Code Converter Using Mach-Zehnder Interferometer for High Speed Communication

    Science.gov (United States)

    Pal, Amrindra; Kumar, Santosh; Sharma, Sandeep

    2017-05-01

    Binary to octal and octal to binary code converter is a device that allows placing digital information from many inputs to many outputs. Any application of combinational logic circuit can be implemented by using external gates. In this paper, binary to octal and octal to binary code converter is proposed using electro-optic effect inside lithium-niobate based Mach-Zehnder interferometers (MZIs). The MZI structures have powerful capability to switching an optical input signal to a desired output port. The paper constitutes a mathematical description of the proposed device and thereafter simulation using MATLAB. The study is verified using beam propagation method (BPM).

  17. SYMBOL LEVEL DECODING FOR DUO-BINARY TURBO CODES

    Directory of Open Access Journals (Sweden)

    Yogesh Beeharry

    2017-05-01

    Full Text Available This paper investigates the performance of three different symbol level decoding algorithms for Duo-Binary Turbo codes. Explicit details of the computations involved in the three decoding techniques, and a computational complexity analysis are given. Simulation results with different couple lengths, code-rates, and QPSK modulation reveal that the symbol level decoding with bit-level information outperforms the symbol level decoding by 0.1 dB on average in the error floor region. Moreover, a complexity analysis reveals that symbol level decoding with bit-level information reduces the decoding complexity by 19.6 % in terms of the total number of computations required for each half-iteration as compared to symbol level decoding.

  18. DNA as a Binary Code: How the Physical Structure of Nucleotide Bases Carries Information

    Science.gov (United States)

    McCallister, Gary

    2005-01-01

    The DNA triplet code also functions as a binary code. Because double-ring compounds cannot bind to double-ring compounds in the DNA code, the sequence of bases classified simply as purines or pyrimidines can encode for smaller groups of possible amino acids. This is an intuitive approach to teaching the DNA code. (Contains 6 figures.)

  19. Brains and pseudorandom generators

    OpenAIRE

    Chvátal, Vašek; Goldsmith, Mark; Yang, Nan

    2013-01-01

    In a pioneering classic, Warren McCulloch and Walter Pitts proposed a model of the central nervous system; motivated by EEG recordings of normal brain activity, Chv\\' atal and Goldsmith asked whether or not this model can be engineered to provide pseudorandom number generators. We supply evidence suggesting that the answer is negative.

  20. Cryptographic pseudo-random sequences from the chaotic Hénon ...

    Indian Academy of Sciences (India)

    Cryptographic pseudo-random sequences from the chaotic Hénon map. Madhekar ... Chaos; nonlinear difference equations; random number generation; stream ciphers; cryptography. Abstract. A scheme for pseudo-random binary sequence generation based on the two-dimensional discrete-time Hénon map is proposed.

  1. On Rational Interpolation-Based List-Decoding and List-Decoding Binary Goppa Codes

    DEFF Research Database (Denmark)

    Beelen, Peter; Høholdt, Tom; Nielsen, Johan Sebastian Rosenkilde

    2013-01-01

    a new application of the Wu list decoder by decoding irreducible binary Goppa codes up to the binary Johnson radius. Finally, we point out a connection between the governing equations of the Wu algorithm and the Guruswami–Sudan algorithm, immediately leading to equality in the decoding range...

  2. Cross-indexing of binary SIFT codes for large-scale image search.

    Science.gov (United States)

    Liu, Zhen; Li, Houqiang; Zhang, Liyan; Zhou, Wengang; Tian, Qi

    2014-05-01

    In recent years, there has been growing interest in mapping visual features into compact binary codes for applications on large-scale image collections. Encoding high-dimensional data as compact binary codes reduces the memory cost for storage. Besides, it benefits the computational efficiency since the computation of similarity can be efficiently measured by Hamming distance. In this paper, we propose a novel flexible scale invariant feature transform (SIFT) binarization (FSB) algorithm for large-scale image search. The FSB algorithm explores the magnitude patterns of SIFT descriptor. It is unsupervised and the generated binary codes are demonstrated to be dispreserving. Besides, we propose a new searching strategy to find target features based on the cross-indexing in the binary SIFT space and original SIFT space. We evaluate our approach on two publicly released data sets. The experiments on large-scale partial duplicate image retrieval system demonstrate the effectiveness and efficiency of the proposed algorithm.

  3. Ultrafast optical binary to gray code and gray to binary code conversion based on phase modulation in Mach-Zehnder interferometer

    Science.gov (United States)

    Katti, Rohan; Prince, Shanthi

    2017-02-01

    Optical 4-bit binary to gray and gray to binary code conversion has been demonstrated. The encoders are designed by implementing XOR gates in optical domain. Phase modulation in Mach-Zehnder interferometer has been exploited to achieve results at considerably high data rates of up to 60 Gbps. Also, the designs, being reversible in nature, will amount to less power consumption when embedded in an optical network. Performance parameters of the design, such as Q factor and extinction ratio, are analyzed based on simulation results carried out using comprehensive design suite OptiSystem-13.

  4. Representation and processing of structures with binary sparse distributed codes

    OpenAIRE

    Rachkovskij, Dmitri A.

    1999-01-01

    The schemes for compositional distributed representations include those allowing on-the-fly construction of fixed dimensionality codevectors to encode structures of various complexity. Similarity of such codevectors takes into account both structural and semantic similarity of represented structures. In this paper we provide a comparative description of sparse binary distributed representation developed in the frames of the Associative-Projective Neural Network architecture and more well-know...

  5. Information-Dispersion-Entropy-Based Blind Recognition of Binary BCH Codes in Soft Decision Situations

    Directory of Open Access Journals (Sweden)

    Yimeng Zhang

    2013-05-01

    Full Text Available A method of blind recognition of the coding parameters for binary Bose-Chaudhuri-Hocquenghem (BCH codes is proposed in this paper. We consider an intelligent communication receiver which can blindly recognize the coding parameters of the received data stream. The only knowledge is that the stream is encoded using binary BCH codes, while the coding parameters are unknown. The problem can be addressed on the context of the non-cooperative communications or adaptive coding and modulations (ACM for cognitive radio networks. The recognition processing includes two major procedures: code length estimation and generator polynomial reconstruction. A hard decision method has been proposed in a previous literature. In this paper we propose the recognition approach in soft decision situations with Binary-Phase-Shift-Key modulations and Additive-White-Gaussian-Noise (AWGN channels. The code length is estimated by maximizing the root information dispersion entropy function. And then we search for the code roots to reconstruct the primitive and generator polynomials. By utilizing the soft output of the channel, the recognition performance is improved and the simulations show the efficiency of the proposed algorithm.

  6. Further results on binary convolutional codes with an optimum distance profile

    DEFF Research Database (Denmark)

    Johannesson, Rolf; Paaske, Erik

    1978-01-01

    Fixed binary convolutional codes are considered which are simultaneously optimal or near-optimal according to three criteria: namely, distance profiled, free distanced_{ infty}, and minimum number of weightd_{infty}paths. It is shown how the optimum distance profile criterion can be used to limit...

  7. A Tough Call : Mitigating Advanced Code-Reuse Attacks at the Binary Level

    NARCIS (Netherlands)

    Veen, Victor Van Der; Goktas, Enes; Contag, Moritz; Pawoloski, Andre; Chen, Xi; Rawat, Sanjay; Bos, Herbert; Holz, Thorsten; Athanasopoulos, Ilias; Giuffrida, Cristiano

    2016-01-01

    Current binary-level Control-Flow Integrity (CFI) techniques are weak in determining the set of valid targets for indirect control flow transfers on the forward edge. In particular, the lack of source code forces existing techniques to resort to a conservative address-taken policy that

  8. An efficient algorithm for encoding and decoding of raptor codes over the binary erasure channel

    Science.gov (United States)

    Zhang, Ya-Hang; Cheng, Bo-Wen; Zou, Guang-Nan; Wen, Wei-Ping; Qing, Si-Han

    2009-12-01

    As the most advanced rateless fountain codes, Systematic Raptor codes has been adopted by the 3GPP standard as a forward error correction scheme in Multimedia Broadcast/Multicast Services (MBMS). It has been shown to be an efficient channel coding technique which guarantees high symbol diversity in overlay networks. The 3GPP standard outlined a time-efficient maximum-likelihood (ML) decoding scheme that can be implemented using Gaussian elimination. But when the number of encoding symbols grows large, Gaussian elimination need to deal with a large matrix with O (K3) binary arithmetic operations, so the larger K becomes, the worse ML decoding scheme performs. This paper presents a better time-efficient encoding and decoding scheme while maintaining the same symbol recoverable performance, this encoding and decoding scheme is named Rapid Raptor Code. It will be shown that the proposed Rapid Raptor code Scheme significantly improves traditional Raptor codes' efficiency while maintaining the same performance.

  9. High-affinity single-domain binding proteins with a binary-code interface.

    Science.gov (United States)

    Koide, Akiko; Gilbreth, Ryan N; Esaki, Kaori; Tereshko, Valentina; Koide, Shohei

    2007-04-17

    High degrees of sequence and conformation complexity found in natural protein interaction interfaces are generally considered essential for achieving tight and specific interactions. However, it has been demonstrated that specific antibodies can be built by using an interface with a binary code consisting of only Tyr and Ser. This surprising result might be attributed to yet undefined properties of the antibody scaffold that uniquely enhance its capacity for target binding. In this work we tested the generality of the binary-code interface by engineering binding proteins based on a single-domain scaffold. We show that Tyr/Ser binary-code interfaces consisting of only 15-20 positions within a fibronectin type III domain (FN3; 95 residues) are capable of producing specific binding proteins (termed "monobodies") with a low-nanomolar K(d). A 2.35-A x-ray crystal structure of a monobody in complex with its target, maltose-binding protein, and mutation analysis revealed dominant contributions of Tyr residues to binding as well as striking molecular mimicry of a maltose-binding protein substrate, beta-cyclodextrin, by the Tyr/Ser binary interface. This work suggests that an interaction interface with low chemical diversity but with significant conformational diversity is generally sufficient for tight and specific molecular recognition, providing fundamental insights into factors governing protein-protein interactions.

  10. Fréchet Metric for Space of Binary Coded Software

    Directory of Open Access Journals (Sweden)

    Masárová Renáta

    2014-12-01

    Full Text Available As stated in (7, binary coded computer programs can be shown as a metric space. Therefore, they can be measured by metric in a sense of metric space theory. This paper presents the proof that Fréchet metric is a metric on the space of all sequences of elements M={0,1t} Therefore, it is usable to build a system of software metrics based on the metric space theory

  11. The COBAIN (COntact Binary Atmospheres with INterpolation) Code for Radiative Transfer

    Science.gov (United States)

    Kochoska, Angela; Prša, Andrej; Horvat, Martin

    2018-01-01

    Standard binary star modeling codes make use of pre-existing solutions of the radiative transfer equation in stellar atmospheres. The various model atmospheres available today are consistently computed for single stars, under different assumptions - plane-parallel or spherical atmosphere approximation, local thermodynamical equilibrium (LTE) or non-LTE (NLTE), etc. However, they are nonetheless being applied to contact binary atmospheres by populating the surface corresponding to each component separately and neglecting any mixing that would typically occur at the contact boundary. In addition, single stellar atmosphere models do not take into account irradiance from a companion star, which can pose a serious problem when modeling close binaries. 1D atmosphere models are also solved under the assumption of an atmosphere in hydrodynamical equilibrium, which is not necessarily the case for contact atmospheres, as the potentially different densities and temperatures can give rise to flows that play a key role in the heat and radiation transfer.To resolve the issue of erroneous modeling of contact binary atmospheres using single star atmosphere tables, we have developed a generalized radiative transfer code for computation of the normal emergent intensity of a stellar surface, given its geometry and internal structure. The code uses a regular mesh of equipotential surfaces in a discrete set of spherical coordinates, which are then used to interpolate the values of the structural quantites (density, temperature, opacity) in any given point inside the mesh. The radiaitive transfer equation is numerically integrated in a set of directions spanning the unit sphere around each point and iterated until the intensity values for all directions and all mesh points converge within a given tolerance. We have found that this approach, albeit computationally expensive, is the only one that can reproduce the intensity distribution of the non-symmetric contact binary atmosphere and

  12. Construction of Fixed Rate Non-Binary WOM Codes Based on Integer Programming

    Science.gov (United States)

    Fujino, Yoju; Wadayama, Tadashi

    In this paper, we propose a construction of non-binary WOM (Write-Once-Memory) codes for WOM storages such as flash memories. The WOM codes discussed in this paper are fixed rate WOM codes where messages in a fixed alphabet of size $M$ can be sequentially written in the WOM storage at least $t^*$-times. In this paper, a WOM storage is modeled by a state transition graph. The proposed construction has the following two features. First, it includes a systematic method to determine the encoding regions in the state transition graph. Second, the proposed construction includes a labeling method for states by using integer programming. Several novel WOM codes for $q$ level flash memories with 2 cells are constructed by the proposed construction. They achieve the worst numbers of writes $t^*$ that meet the known upper bound in many cases. In addition, we constructed fixed rate non-binary WOM codes with the capability to reduce ICI (inter cell interference) of flash cells. One of the advantages of the proposed construction is its flexibility. It can be applied to various storage devices, to various dimensions (i.e, number of cells), and various kind of additional constraints.

  13. On models of the genetic code generated by binary dichotomic algorithms.

    Science.gov (United States)

    Gumbel, Markus; Fimmel, Elena; Danielli, Alberto; Strüngmann, Lutz

    2015-02-01

    In this paper we introduce the concept of a BDA-generated model of the genetic code which is based on binary dichotomic algorithms (BDAs). A BDA-generated model is based on binary dichotomic algorithms (BDAs). Such a BDA partitions the set of 64 codons into two disjoint classes of size 32 each and provides a generalization of known partitions like the Rumer dichotomy. We investigate what partitions can be generated when a set of different BDAs is applied sequentially to the set of codons. The search revealed that these models are able to generate code tables with very different numbers of classes ranging from 2 to 64. We have analyzed whether there are models that map the codons to their amino acids. A perfect matching is not possible. However, we present models that describe the standard genetic code with only few errors. There are also models that map all 64 codons uniquely to 64 classes showing that BDAs can be used to identify codons precisely. This could serve as a basis for further mathematical analysis using coding theory, for example. The hypothesis that BDAs might reflect a molecular mechanism taking place in the decoding center of the ribosome is discussed. The scan demonstrated that binary dichotomic partitions are able to model different aspects of the genetic code very well. The search was performed with our tool Beady-A. This software is freely available at http://mi.informatik.hs-mannheim.de/beady-a. It requires a JVM version 6 or higher. Copyright © 2014 Elsevier Ireland Ltd. All rights reserved.

  14. Pseudo-Random Number Generators

    Science.gov (United States)

    Howell, L. W.; Rheinfurth, M. H.

    1984-01-01

    Package features comprehensive selection of probabilistic distributions. Monte Carlo simulations resorted to whenever systems studied not amenable to deterministic analyses or when direct experimentation not feasible. Random numbers having certain specified distribution characteristic integral part of simulations. Package consists of collector of "pseudorandom" number generators for use in Monte Carlo simulations.

  15. Protostellar binary fragmentation: a comparison of results from two distinct second-order hydrodynamic codes.

    Science.gov (United States)

    Di G. Sigalotti, L.; Klapp, J.

    1997-03-01

    A new second-order Eulerian code is compared with a version of the TREESPH code formulated by Hernquist & Katz (1989ApJS...70..419H) for the standard isothermal collapse test. The results indicate that both codes produce a very similar evolution ending with the formation of a protostellar binary system. Contrary to previous first-order calculations, the binary forms by direct fragmentation, i.e., without the occurrence of an intermediate bar configuration. A similar trend was also found in recent second-order Eulerian calculations (Myhill & Boss 1993ApJS...89..345M), suggesting that it is a result of the decreased numerical diffusion associated with the new second-order schemes. The results have also implications on the differences between the finite difference methods and the particle method SPH, raised by Monaghan & Lattanzio (1986A&A...158..207M) for this problem. In particular, the Eulerian calculation does not result in a run-away collapse of the fragments, and as found in the TREESPH evolution, they also show a clear tendency to get closer together. In agreement with previous SPH calculations (Monaghan & Lattanzio 1986A&A...158..207M), the results of the long term evolution with code TREESPH show that the gravitational interaction between the two fragments may become important, and eventually induce the binary to coalesce. However, most recent SPH calculations (Bate, Bonnell & Price 1995MNRAS.277..362B ) indicate that the two fragments, after having reached a minimum separation distance, do not merge but continue to orbit each other.

  16. Binary Large Object-Based Approach for QR Code Detection in Uncontrolled Environments

    Directory of Open Access Journals (Sweden)

    Omar Lopez-Rincon

    2017-01-01

    Full Text Available Quick Response QR barcode detection in nonarbitrary environment is still a challenging task despite many existing applications for finding 2D symbols. The main disadvantage of recent applications for QR code detection is a low performance for rotated and distorted single or multiple symbols in images with variable illumination and presence of noise. In this paper, a particular solution for QR code detection in uncontrolled environments is presented. The proposal consists in recognizing geometrical features of QR code using a binary large object- (BLOB- based algorithm with subsequent iterative filtering QR symbol position detection patterns that do not require complex processing and training of classifiers frequently used for these purposes. The high precision and speed are achieved by adaptive threshold binarization of integral images. In contrast to well-known scanners, which fail to detect QR code with medium to strong blurring, significant nonuniform illumination, considerable symbol deformations, and noising, the proposed technique provides high recognition rate of 80%–100% with a speed compatible to real-time applications. In particular, speed varies from 200 ms to 800 ms per single or multiple QR code detected simultaneously in images with resolution from 640 × 480 to 4080 × 2720, respectively.

  17. Short binary convolutional codes with maximal free distance for rates 2/3 and 3/4

    DEFF Research Database (Denmark)

    Paaske, Erik

    1974-01-01

    A search procedure is developed to find good short binary(N,N - 1)convolutional codes. It uses simple rules to discard from the complete ensemble of codes a large fraction whose free distanced_{free}either cannot achieve the maximum value or is equal tod_{free}of some code in the remaining set....... Farther, the search among the remaining codes is started in a subset in which we expect the possibility of finding codes with large values ofd_{free}to be good. A number of short, optimum (in the sense of maximizingd_{free}), rate-2/3 and 3/4 codes found by the search procedure are listed....

  18. Fast Binary Coding for the Scene Classification of High-Resolution Remote Sensing Imagery

    Directory of Open Access Journals (Sweden)

    Fan Hu

    2016-06-01

    Full Text Available Scene classification of high-resolution remote sensing (HRRS imagery is an important task in the intelligent processing of remote sensing images and has attracted much attention in recent years. Although the existing scene classification methods, e.g., the bag-of-words (BOW model and its variants, can achieve acceptable performance, these approaches strongly rely on the extraction of local features and the complicated coding strategy, which are usually time consuming and demand much expert effort. In this paper, we propose a fast binary coding (FBC method, to effectively generate efficient discriminative scene representations of HRRS images. The main idea is inspired by the unsupervised feature learning technique and the binary feature descriptions. More precisely, equipped with the unsupervised feature learning technique, we first learn a set of optimal “filters” from large quantities of randomly-sampled image patches and then obtain feature maps by convolving the image scene with the learned filters. After binarizing the feature maps, we perform a simple hashing step to convert the binary-valued feature map to the integer-valued feature map. Finally, statistical histograms computed on the integer-valued feature map are used as global feature representations of the scenes of HRRS images, similar to the conventional BOW model. The analysis of the algorithm complexity and experiments on HRRS image datasets demonstrate that, in contrast with existing scene classification approaches, the proposed FBC has much faster computational speed and achieves comparable classification performance. In addition, we also propose two extensions to FBC, i.e., the spatial co-occurrence matrix and different visual saliency maps, for further improving its final classification accuracy.

  19. Multiprime Blum-Blum-Shub Pseudorandom Number Generator

    Science.gov (United States)

    2016-09-01

    0) or ( y ==n-1): return 1 y = pow( y ,2,n) return 0 A.3 NIST Tests: randtest.py The code below is downloaded to test the generated sequences against the...NAVAL POSTGRADUATE SCHOOL MONTEREY, CALIFORNIA THESIS MULTIPRIME BLUM-BLUM-SHUB PSEUDORANDOM NUMBER GENERATOR by Bijesh Shrestha September 2016...Davis Highway, Suite 1204, Arlington, VA 22202–4302, and to the Office of Management and Budget , Paperwork Reduction Project (0704-0188) Washington DC

  20. Cryptographic pseudo-random sequences from the chaotic Hénon ...

    Indian Academy of Sciences (India)

    Abstract. A scheme for pseudo-random binary sequence generation based on the two-dimensional discrete-time Hénon map is proposed. Properties of the proposed sequences pertaining to linear complexity, linear complexity profile, correlation and auto-correlation are investigated. All these properties of the sequences ...

  1. Binary analysis: 1. part: definitions and treatment of binary functions; 2. part: applications and functions of trans-coding

    International Nuclear Information System (INIS)

    Vallee, R.L.

    1968-01-01

    The study of binary groups under their mathematical aspects constitutes the matter of binary analysis, the purpose of which consists in developing altogether simple, rigorous and practical methods needed by the technicians, the engineers and all those who may be mainly concerned by digital processing. This subject, fast extending if not determining, however tends actually to play a main part in nuclear electronics as well as in several other research areas. (authors) [fr

  2. Isometries and binary images of linear block codes over ℤ4 + uℤ4 and ℤ8 + uℤ8

    Science.gov (United States)

    Sison, Virgilio; Remillion, Monica

    2017-10-01

    Let {{{F}}}2 be the binary field and ℤ2 r the residue class ring of integers modulo 2 r , where r is a positive integer. For the finite 16-element commutative local Frobenius non-chain ring ℤ4 + uℤ4, where u is nilpotent of index 2, two weight functions are considered, namely the Lee weight and the homogeneous weight. With the appropriate application of these weights, isometric maps from ℤ4 + uℤ4 to the binary spaces {{{F}}}24 and {{{F}}}28, respectively, are established via the composition of other weight-based isometries. The classical Hamming weight is used on the binary space. The resulting isometries are then applied to linear block codes over ℤ4+ uℤ4 whose images are binary codes of predicted length, which may or may not be linear. Certain lower and upper bounds on the minimum distances of the binary images are also derived in terms of the parameters of the ℤ4 + uℤ4 codes. Several new codes and their images are constructed as illustrative examples. An analogous procedure is performed successfully on the ring ℤ8 + uℤ8, where u 2 = 0, which is a commutative local Frobenius non-chain ring of order 64. It turns out that the method is possible in general for the class of rings ℤ2 r + uℤ2 r , where u 2 = 0, for any positive integer r, using the generalized Gray map from ℤ2 r to {{{F}}}2{2r-1}.

  3. FFT Algorithm for Binary Extension Finite Fields and Its Application to Reed–Solomon Codes

    KAUST Repository

    Lin, Sian Jheng

    2016-08-15

    Recently, a new polynomial basis over binary extension fields was proposed, such that the fast Fourier transform (FFT) over such fields can be computed in the complexity of order O(n lg(n)), where n is the number of points evaluated in FFT. In this paper, we reformulate this FFT algorithm, such that it can be easier understood and be extended to develop frequency-domain decoding algorithms for (n = 2(m), k) systematic Reed-Solomon (RS) codes over F-2m, m is an element of Z(+), with n-k a power of two. First, the basis of syndrome polynomials is reformulated in the decoding procedure so that the new transforms can be applied to the decoding procedure. A fast extended Euclidean algorithm is developed to determine the error locator polynomial. The computational complexity of the proposed decoding algorithm is O(n lg(n-k)+(n-k)lg(2)(n-k)), improving upon the best currently available decoding complexity O(n lg(2)(n) lg lg(n)), and reaching the best known complexity bound that was established by Justesen in 1976. However, Justesen\\'s approach is only for the codes over some specific fields, which can apply Cooley-Tukey FFTs. As revealed by the computer simulations, the proposed decoding algorithm is 50 times faster than the conventional one for the (2(16), 2(15)) RS code over F-216.

  4. Adaptation of Zerotrees Using Signed Binary Digit Representations for 3D Image Coding

    Directory of Open Access Journals (Sweden)

    Mailhes Corinne

    2007-01-01

    Full Text Available Zerotrees of wavelet coefficients have shown a good adaptability for the compression of three-dimensional images. EZW, the original algorithm using zerotree, shows good performance and was successfully adapted to 3D image compression. This paper focuses on the adaptation of EZW for the compression of hyperspectral images. The subordinate pass is suppressed to remove the necessity to keep the significant pixels in memory. To compensate the loss due to this removal, signed binary digit representations are used to increase the efficiency of zerotrees. Contextual arithmetic coding with very limited contexts is also used. Finally, we show that this simplified version of 3D-EZW performs almost as well as the original one.

  5. Neural coding of binary mixtures in a structurally related odorant pair

    Science.gov (United States)

    Cruz, Georgina; Lowe, Graeme

    2013-01-01

    The encoding of odorant mixtures by olfactory sensory neurons depends on molecular interactions at peripheral receptors. However, the pharmacological basis of these interactions is not well defined. Both competitive and noncompetitive mechanisms of receptor binding and activation, or suppression, could contribute to coding. We studied this by analyzing responses of olfactory bulb glomeruli evoked by a pair of structurally related odorants, eugenol (EG) and methyl isoeugenol (MIEG). Fluorescence imaging in synaptopHluorin (spH) mice revealed that EG and MIEG evoked highly overlapped glomerular inputs, increasing the likelihood of mixture interactions. Glomerular responses to binary mixtures of EG and MIEG mostly showed hypoadditive interactions at intermediate and high odorant concentrations, with a few near threshold responses showing hyperadditivity. Dose-response profiles were well fitted by a model of two odorants competitively binding and activating a shared receptor linked to a non-linear transduction cascade. We saw no evidence of non-competitive mechanisms. PMID:23386975

  6. A comparative study of pseudorandom sequences used in a c-VEP based BCI for online wheelchair control

    DEFF Research Database (Denmark)

    Isaksen, Jonas L.; Mohebbi, Ali; Puthusserypady, Sadasivan

    2016-01-01

    In this study, a c-VEP based BCI system was developed to run on three distinctive pseudorandom sequences, namely the m-code, the Gold-code, and the Barker-code. The Visual Evoked Potentials (VEPs) were provoked using these codes. In the online session, subjects controlled a LEGO® Mindstorms® robot...

  7. Learning binary code via PCA of angle projection for image retrieval

    Science.gov (United States)

    Yang, Fumeng; Ye, Zhiqiang; Wei, Xueqi; Wu, Congzhong

    2018-01-01

    With benefits of low storage costs and high query speeds, binary code representation methods are widely researched for efficiently retrieving large-scale data. In image hashing method, learning hashing function to embed highdimensions feature to Hamming space is a key step for accuracy retrieval. Principal component analysis (PCA) technical is widely used in compact hashing methods, and most these hashing methods adopt PCA projection functions to project the original data into several dimensions of real values, and then each of these projected dimensions is quantized into one bit by thresholding. The variances of different projected dimensions are different, and with real-valued projection produced more quantization error. To avoid the real-valued projection with large quantization error, in this paper we proposed to use Cosine similarity projection for each dimensions, the angle projection can keep the original structure and more compact with the Cosine-valued. We used our method combined the ITQ hashing algorithm, and the extensive experiments on the public CIFAR-10 and Caltech-256 datasets validate the effectiveness of the proposed method.

  8. Context adaptive binary arithmetic coding-based data hiding in partially encrypted H.264/AVC videos

    Science.gov (United States)

    Xu, Dawen; Wang, Rangding

    2015-05-01

    A scheme of data hiding directly in a partially encrypted version of H.264/AVC videos is proposed which includes three parts, i.e., selective encryption, data embedding and data extraction. Selective encryption is performed on context adaptive binary arithmetic coding (CABAC) bin-strings via stream ciphers. By careful selection of CABAC entropy coder syntax elements for selective encryption, the encrypted bitstream is format-compliant and has exactly the same bit rate. Then a data-hider embeds the additional data into partially encrypted H.264/AVC videos using a CABAC bin-string substitution technique without accessing the plaintext of the video content. Since bin-string substitution is carried out on those residual coefficients with approximately the same magnitude, the quality of the decrypted video is satisfactory. Video file size is strictly preserved even after data embedding. In order to adapt to different application scenarios, data extraction can be done either in the encrypted domain or in the decrypted domain. Experimental results have demonstrated the feasibility and efficiency of the proposed scheme.

  9. Accelerating Pseudo-Random Number Generator for MCNP on GPU

    Science.gov (United States)

    Gong, Chunye; Liu, Jie; Chi, Lihua; Hu, Qingfeng; Deng, Li; Gong, Zhenghu

    2010-09-01

    Pseudo-random number generators (PRNG) are intensively used in many stochastic algorithms in particle simulations, artificial neural networks and other scientific computation. The PRNG in Monte Carlo N-Particle Transport Code (MCNP) requires long period, high quality, flexible jump and fast enough. In this paper, we implement such a PRNG for MCNP on NVIDIA's GTX200 Graphics Processor Units (GPU) using CUDA programming model. Results shows that 3.80 to 8.10 times speedup are achieved compared with 4 to 6 cores CPUs and more than 679.18 million double precision random numbers can be generated per second on GPU.

  10. LASIP-III, a generalized processor for standard interface files. [For creating binary files from BCD input data and printing binary file data in BCD format (devised for fast reactor physics codes)

    Energy Technology Data Exchange (ETDEWEB)

    Bosler, G.E.; O' Dell, R.D.; Resnik, W.M.

    1976-03-01

    The LASIP-III code was developed for processing Version III standard interface data files which have been specified by the Committee on Computer Code Coordination. This processor performs two distinct tasks, namely, transforming free-field format, BCD data into well-defined binary files and providing for printing and punching data in the binary files. While LASIP-III is exported as a complete free-standing code package, techniques are described for easily separating the processor into two modules, viz., one for creating the binary files and one for printing the files. The two modules can be separated into free-standing codes or they can be incorporated into other codes. Also, the LASIP-III code can be easily expanded for processing additional files, and procedures are described for such an expansion. 2 figures, 8 tables.

  11. Perbandingan Algoritma Even-Rodeh Code dan Algoritma Variable Length Binary Encoding (VLBE) Pada Kompresi File Teks

    OpenAIRE

    Abdullah, Ade Rani

    2016-01-01

    Technology has an important role in dispatch information. Compression has a purpose to diminish the measurement of the data becomes smaller from the authentic data. Even-Rodeh Code and Variable Length Binary Encoding (VLBE) Algorithm are the kinds of lossless compression that used in this research, it will be measured the performance by Compression Ratio (CR), Ratio of Compression (RC), Redundancy (RD), Time of Compression (millisecond) and Time of Decompression (millisecond). ...

  12. Security problems for a pseudorandom sequence generator based on the Chen chaotic system

    Science.gov (United States)

    Özkaynak, Fatih; Yavuz, Sırma

    2013-09-01

    Recently, a novel pseudorandom number generator scheme based on the Chen chaotic system was proposed. In this study, we analyze the security weaknesses of the proposed generator. By applying a brute force attack on a reduced key space, we show that 66% of the generated pseudorandom number sequences can be revealed. Executable C# code is given for the proposed attack. The computational complexity of this attack is O(n), where n is the sequence length. Both mathematical proofs and experimental results are presented to support the proposed attack.

  13. Experimental demonstration of all-optical 781.25-Mb/s binary phase-coded UWB Signal Generation and Transmission

    DEFF Research Database (Denmark)

    Yu, Xianbin; Gibbon, Timothy Braidwood; Tafur Monroy, Idelfonso

    2009-01-01

    In this letter, an all-optical incoherent scheme for generation of binary phase-coded ultra-wideband (UWB) impulse radio signals is proposed. The generated UWB pulses utilize relaxation oscillations of an optically injected distributed feedback laser that are binary phase encoded (0 and ) and meet...

  14. I-Ching, dyadic groups of binary numbers and the geno-logic coding in living bodies.

    Science.gov (United States)

    Hu, Zhengbing; Petoukhov, Sergey V; Petukhova, Elena S

    2017-12-01

    The ancient Chinese book I-Ching was written a few thousand years ago. It introduces the system of symbols Yin and Yang (equivalents of 0 and 1). It had a powerful impact on culture, medicine and science of ancient China and several other countries. From the modern standpoint, I-Ching declares the importance of dyadic groups of binary numbers for the Nature. The system of I-Ching is represented by the tables with dyadic groups of 4 bigrams, 8 trigrams and 64 hexagrams, which were declared as fundamental archetypes of the Nature. The ancient Chinese did not know about the genetic code of protein sequences of amino acids but this code is organized in accordance with the I-Ching: in particularly, the genetic code is constructed on DNA molecules using 4 nitrogenous bases, 16 doublets, and 64 triplets. The article also describes the usage of dyadic groups as a foundation of the bio-mathematical doctrine of the geno-logic code, which exists in parallel with the known genetic code of amino acids but serves for a different goal: to code the inherited algorithmic processes using the logical holography and the spectral logic of systems of genetic Boolean functions. Some relations of this doctrine with the I-Ching are discussed. In addition, the ratios of musical harmony that can be revealed in the parameters of DNA structure are also represented in the I-Ching book. Copyright © 2017 Elsevier Ltd. All rights reserved.

  15. Context based Coding of Binary Shapes by Object Boundary Straightness Analysis

    DEFF Research Database (Denmark)

    Aghito, Shankar Manuel; Forchhammer, Søren

    2004-01-01

    A new lossless compression scheme for bilevel images targeted at binary shapes of image and video objects is presented. The scheme is based on a local analysis of the digital straightness of the causal part of the object boundary, which is used in the context definition for arithmetic encoding...

  16. Accelerating execution of the integrated TIGER series Monte Carlo radiation transport codes

    International Nuclear Information System (INIS)

    Smith, L.M.; Hochstedler, R.D.

    1997-01-01

    Execution of the integrated TIGER series (ITS) of coupled electron/photon Monte Carlo radiation transport codes has been accelerated by modifying the FORTRAN source code for more efficient computation. Each member code of ITS was benchmarked and profiled with a specific test case that directed the acceleration effort toward the most computationally intensive subroutines. Techniques for accelerating these subroutines included replacing linear search algorithms with binary versions, replacing the pseudo-random number generator, reducing program memory allocation, and proofing the input files for geometrical redundancies. All techniques produced identical or statistically similar results to the original code. Final benchmark timing of the accelerated code resulted in speed-up factors of 2.00 for TIGER (the one-dimensional slab geometry code), 1.74 for CYLTRAN (the two-dimensional cylindrical geometry code), and 1.90 for ACCEPT (the arbitrary three-dimensional geometry code)

  17. Accelerating execution of the integrated TIGER series Monte Carlo radiation transport codes

    Science.gov (United States)

    Smith, L. M.; Hochstedler, R. D.

    1997-02-01

    Execution of the integrated TIGER series (ITS) of coupled electron/photon Monte Carlo radiation transport codes has been accelerated by modifying the FORTRAN source code for more efficient computation. Each member code of ITS was benchmarked and profiled with a specific test case that directed the acceleration effort toward the most computationally intensive subroutines. Techniques for accelerating these subroutines included replacing linear search algorithms with binary versions, replacing the pseudo-random number generator, reducing program memory allocation, and proofing the input files for geometrical redundancies. All techniques produced identical or statistically similar results to the original code. Final benchmark timing of the accelerated code resulted in speed-up factors of 2.00 for TIGER (the one-dimensional slab geometry code), 1.74 for CYLTRAN (the two-dimensional cylindrical geometry code), and 1.90 for ACCEPT (the arbitrary three-dimensional geometry code).

  18. Experimental study of non-binary LDPC coding for long-haul coherent optical QPSK transmissions.

    Science.gov (United States)

    Zhang, Shaoliang; Arabaci, Murat; Yaman, Fatih; Djordjevic, Ivan B; Xu, Lei; Wang, Ting; Inada, Yoshihisa; Ogata, Takaaki; Aoki, Yasuhiro

    2011-09-26

    The performance of rate-0.8 4-ary LDPC code has been studied in a 50 GHz-spaced 40 Gb/s DWDM system with PDM-QPSK modulation. The net effective coding gain of 10 dB is obtained at BER of 10(-6). With the aid of time-interleaving polarization multiplexing and MAP detection, 10,560 km transmission over legacy dispersion managed fiber is achieved without any countable errors. The proposed nonbinary quasi-cyclic LDPC code achieves an uncoded BER threshold at 4×10(-2). Potential issues like phase ambiguity and coding length are also discussed when implementing LDPC in current coherent optical systems. © 2011 Optical Society of America

  19. Quality pseudo-random number generator

    International Nuclear Information System (INIS)

    Tarasiuk, J.

    1996-01-01

    The pseudo-random number generator (RNG) was written to match needs of nuclear and high-energy physics computation which in some cases require very long and independent random number sequences. In this random number generator the repetition period is about 10 36 what should be sufficient for all computers in the world. In this article the test results of RNG correlation, speed and identity of computations for PC, Sun4 and VAX computer tests are presented

  20. On the Influence of the Extrinsic Information Scaling Coefficient on the Performance of Single and Double Binary Turbo Codes

    Directory of Open Access Journals (Sweden)

    BALTA, H.

    2013-05-01

    Full Text Available This paper presents a study on the influence of the extrinsic information scaling coefficient value (eic on the bit and frame error rate (BER/FER, for single and double binary turbo codes (S/DBTC decoded with maximum a posteriori (MAP and maximum logarithmic MAP (MaxLogMAP component algorithms. Firstly, we estimate the distance spectrum of the code with the so-called error impulse method (EIM, and we analyze its dependence as well as the dependence of the asymptotic FER on eic. Secondly, we estimate the actual FER using Monte Carlo simulations with eic as a parameter. The comparison of the FER(eic curves obtained by the two methods allows us, on the one hand, to assess the quality of the decoding algorithms, and on the other hand, to estimate the very low BER/FER performance of TCs, where the Monte Carlo method is practically unusable. The results presented also provide a practical guide for the appreciation of the optimal value of the scaling factor, eic. We may notice that also the MAP algorithm performance could be improved using eic<1.

  1. Why a New Code for Novae Evolution and Mass Transfer in Binaries?

    Directory of Open Access Journals (Sweden)

    G. Shaviv

    2015-02-01

    Full Text Available One of the most interesting problems in Cataclysmic Variables is the long time scale evolution. This problem appears in long time evolution, which is also very important in the search for the progenitor of SN Ia. The classical approach to overcome this problem in the simulation of novae evolution is to assume: (1 A constant in time, rate of mass transfer. (2 The mass transfer rate that does not vary throughout the life time of the nova, even when many eruptions are considered. Here we show that these assumptions are valid only for a single thermonuclear flash and such a calculation cannot be the basis for extrapolation of the behavior over many flashes. In particular, such calculation cannot be used to predict under what conditions an accreting WD may reach the Chandrasekhar mass and collapse. We report on a new code to attack this problem. The basic idea is to create two parallel processes, one calculating the mass losing star and the other the accreting white dwarf. The two processes communicate continuously with each other and follow the time depended mass loss.

  2. Primary Displacement Damage Calculation Induced by Neutron and Ion Using Binary Collision Approximation Techniques (Marlowe Code)

    International Nuclear Information System (INIS)

    Mota, F.; Ortiz, C. J.; Vila, R.

    2012-01-01

    Irradiation Experimental Area of TechnoFusion will emulate the extreme irradiation fusion conditions in materials by means of three ion accelerators: one used for self-implanting heavy ions (Fe, Si, C,...) to emulate the displacement damage induced by fusion neutrons and the other two for light ions (H and He) to emulate the transmutation induced by fusion neutrons. This Laboratory will play an essential role in the selection of functional materials for DEMO reactor since it will allow reproducing the effects of neutron radiation on fusion materials. Ion irradiation produces little or no residual radioactivity, allowing handling of samples without the need for special precautions. Currently, two different methods are used to calculate the primary displacement damage by neutron irradiation or by ion irradiation. On one hand, the displacement damage doses induced by neutrons are calculated considering the NRT model based on the electronic screening theory of Linhard. This methodology is commonly used since 1975. On the other hand, for experimental research community the SRIM code is commonly used to calculate the primary displacement damage dose induced by ion irradiation. Therefore, both methodologies of primary displacement damage calculation have nothing in common. However, if we want to design ion irradiation experiments capable to emulate the neutron fusion effect in materials, it is necessary to develop comparable methodologies of damage calculation for both kinds of radiation. It would allow us to define better the ion irradiation parameters (Ion, current, Ion energy, dose, etc) required to emulate a specific neutron irradiation environment. Therefore, our main objective was to find the way to calculate the primary displacement damage induced by neutron irradiation and by ion irradiation starting from the same point, that is, the PKA spectrum. In order to emulate the neutron irradiation that would prevail under fusion conditions, two approaches are contemplated: a) on

  3. Implementation of LT codes based on chaos

    International Nuclear Information System (INIS)

    Zhou Qian; Li Liang; Chen Zengqiang; Zhao Jiaxiang

    2008-01-01

    Fountain codes provide an efficient way to transfer information over erasure channels like the Internet. LT codes are the first codes fully realizing the digital fountain concept. They are asymptotically optimal rateless erasure codes with highly efficient encoding and decoding algorithms. In theory, for each encoding symbol of LT codes, its degree is randomly chosen according to a predetermined degree distribution, and its neighbours used to generate that encoding symbol are chosen uniformly at random. Practical implementation of LT codes usually realizes the randomness through pseudo-randomness number generator like linear congruential method. This paper applies the pseudo-randomness of chaotic sequence in the implementation of LT codes. Two Kent chaotic maps are used to determine the degree and neighbour(s) of each encoding symbol. It is shown that the implemented LT codes based on chaos perform better than the LT codes implemented by the traditional pseudo-randomness number generator. (general)

  4. Cracking the Binary Code

    Directory of Open Access Journals (Sweden)

    Hazlehurst Benny

    2014-03-01

    Full Text Available This paper offers a critique of the ‘binary’ nature of much biblical interpretation and ethical belief in the Church, rejecting simplistic ‘either-or’ approaches to both. Instead there is offered an interpretation of key biblical texts through the lenses of circumstances, needs and motivation. It is argued that, when these factors are taken into account, even for Evangelicals, there is no longer a substantive biblical case against the acceptance of faithful, loving same-sex partnerships and the development of a positive Christian ethic for lesbian, gay, bisexual and transgender people. At the very least, the complexity of the interpretive task must lead to greater openness to and acceptance of those from whom we differ.

  5. A pseudo-random number generator and its spectral test

    International Nuclear Information System (INIS)

    Wang Lai

    1998-01-01

    The author introduces a pseudo-random number generator and describes its algorithm and C language implementation. The performance of the generator is tested and compared with some well known LCG generators

  6. Pseudo-random bit generator based on Chebyshev map

    Science.gov (United States)

    Stoyanov, B. P.

    2013-10-01

    In this paper, we study a pseudo-random bit generator based on two Chebyshev polynomial maps. The novel derivative algorithm shows perfect statistical properties established by number of statistical tests.

  7. Hardware implementation of a GFSR pseudo-random number generator

    Science.gov (United States)

    Aiello, G. R.; Budinich, M.; Milotti, E.

    1989-12-01

    We describe the hardware implementation of a pseudo-random number generator of the "Generalized Feedback Shift Register" (GFSR) type. After brief theoretical considerations we describe two versions of the hardware, the tests done and the performances achieved.

  8. A Multi-Threaded Cryptographic Pseudorandom Number Generator Test Suite

    Science.gov (United States)

    2016-09-01

    faq.html. Accessed Jul. 1, 2016. [7] A. Desai, A. Hevia, and Y . L. Yin, A Practice-Oriented Treatment of Pseudorandom Number Generators . Berlin, Heidelberg...NAVAL POSTGRADUATE SCHOOL MONTEREY, CALIFORNIA THESIS A MULTI-THREADED CRYPTOGRAPHIC PSEUDORANDOM NUMBER GENERATOR TEST SUITE by Zhibin Zhang...Jefferson Davis Highway, Suite 1204, Arlington, VA 22202–4302, and to the Office of Management and Budget , Paperwork Reduction Project (0704-0188) Washington

  9. A Repetition Test for Pseudo-Random Number Generators

    OpenAIRE

    Gil, Manuel; Gonnet, Gaston H.; Petersen, Wesley P.

    2017-01-01

    A new statistical test for uniform pseudo-random number generators (PRNGs) is presented. The idea is that a sequence of pseudo-random numbers should have numbers reappear with a certain probability. The expectation time that a repetition occurs provides the metric for the test. For linear congruential generators (LCGs) failure can be shown theoretically. Empirical test results for a number of commonly used PRNGs are reported, showing that some PRNGs considered to have good statistical propert...

  10. Orbits for 18 Visual Binaries and Two Double-line Spectroscopic Binaries Observed with HRCAM on the CTIO SOAR 4 m Telescope, Using a New Bayesian Orbit Code Based on Markov Chain Monte Carlo

    Science.gov (United States)

    Mendez, Rene A.; Claveria, Ruben M.; Orchard, Marcos E.; Silva, Jorge F.

    2017-11-01

    We present orbital elements and mass sums for 18 visual binary stars of spectral types B to K (five of which are new orbits) with periods ranging from 20 to more than 500 yr. For two double-line spectroscopic binaries with no previous orbits, the individual component masses, using combined astrometric and radial velocity data, have a formal uncertainty of ˜ 0.1 {M}⊙ . Adopting published photometry and trigonometric parallaxes, plus our own measurements, we place these objects on an H-R diagram and discuss their evolutionary status. These objects are part of a survey to characterize the binary population of stars in the Southern Hemisphere using the SOAR 4 m telescope+HRCAM at CTIO. Orbital elements are computed using a newly developed Markov chain Monte Carlo (MCMC) algorithm that delivers maximum-likelihood estimates of the parameters, as well as posterior probability density functions that allow us to evaluate the uncertainty of our derived parameters in a robust way. For spectroscopic binaries, using our approach, it is possible to derive a self-consistent parallax for the system from the combined astrometric and radial velocity data (“orbital parallax”), which compares well with the trigonometric parallaxes. We also present a mathematical formalism that allows a dimensionality reduction of the feature space from seven to three search parameters (or from 10 to seven dimensions—including parallax—in the case of spectroscopic binaries with astrometric data), which makes it possible to explore a smaller number of parameters in each case, improving the computational efficiency of our MCMC code. Based on observations obtained at the Southern Astrophysical Research (SOAR) telescope, which is a joint project of the Ministério da Ciência, Tecnologia, e Inovação (MCTI) da República Federativa do Brasil, the U.S. National Optical Astronomy Observatory (NOAO), the University of North Carolina at Chapel Hill (UNC), and Michigan State University (MSU).

  11. A comparative study of pseudorandom sequences used in a c-VEP based BCI for online wheelchair control.

    Science.gov (United States)

    Isaksen, Jonas; Mohebbi, Ali; Puthusserypady, Sadasivan

    2016-08-01

    In this study, a c-VEP based BCI system was developed to run on three distinctive pseudorandom sequences, namely the m-code, the Gold-code, and the Barker-code. The Visual Evoked Potentials (VEPs) were provoked using these codes. In the online session, subjects controlled a LEGO ® Mindstorms ® robot around a fixed track. Choosing the optimal code proved a significant increase in accuracy (p<;0.00001) over the average performance. No single code proved significantly more accurate than the others (p=0.81), suggesting that the term "optimal code" is subject-dependent. However, the Gold-code was significantly faster than both alternatives (p=0.006, p=0.016). When choosing the optimal code for accuracy, no significant decrease in Time Per Identification (TPI) was found (p=0.67). Thus, when creating an online c-VEP based BCI system, it is recommended to use multiple random sequences for increased performance.

  12. A Bidirectional Generalized Synchronization Theorem-Based Chaotic Pseudo-random Number Generator

    Directory of Open Access Journals (Sweden)

    Han Shuangshuang

    2013-07-01

    Full Text Available Based on a bidirectional generalized synchronization theorem for discrete chaos system, this paper introduces a new 5-dimensional bidirectional generalized chaos synchronization system (BGCSDS, whose prototype is a novel chaotic system introduced in [12]. Numerical simulation showed that two pair variables of the BGCSDS achieve generalized chaos synchronization via a transform H.A chaos-based pseudo-random number generator (CPNG was designed by the new BGCSDS. Using the FIPS-140-2 tests issued by the National Institute of Standard and Technology (NIST verified the randomness of the 1000 binary number sequences generated via the CPNG and the RC4 algorithm respectively. The results showed that all the tested sequences passed the FIPS-140-2 tests. The confidence interval analysis showed the statistical properties of the randomness of the sequences generated via the CPNG and the RC4 algorithm do not have significant differences.

  13. Pseudo-Random Number Generator Based on Coupled Map Lattices

    Science.gov (United States)

    Lü, Huaping; Wang, Shihong; Hu, Gang

    A one-way coupled chaotic map lattice is used for generating pseudo-random numbers. It is shown that with suitable cooperative applications of both chaotic and conventional approaches, the output of the spatiotemporally chaotic system can easily meet the practical requirements of random numbers, i.e., excellent random statistical properties, long periodicity of computer realizations, and fast speed of random number generations. This pseudo-random number generator system can be used as ideal synchronous and self-synchronizing stream cipher systems for secure communications.

  14. Pseudo-random number generation for Brownian Dynamics and Dissipative Particle Dynamics simulations on GPU devices

    International Nuclear Information System (INIS)

    Phillips, Carolyn L.; Anderson, Joshua A.; Glotzer, Sharon C.

    2011-01-01

    Highlights: → Molecular Dynamics codes implemented on GPUs have achieved two-order of magnitude computational accelerations. → Brownian Dynamics and Dissipative Particle Dynamics simulations require a large number of random numbers per time step. → We introduce a method for generating small batches of pseudorandom numbers distributed over many threads of calculations. → With this method, Dissipative Particle Dynamics is implemented on a GPU device without requiring thread-to-thread communication. - Abstract: Brownian Dynamics (BD), also known as Langevin Dynamics, and Dissipative Particle Dynamics (DPD) are implicit solvent methods commonly used in models of soft matter and biomolecular systems. The interaction of the numerous solvent particles with larger particles is coarse-grained as a Langevin thermostat is applied to individual particles or to particle pairs. The Langevin thermostat requires a pseudo-random number generator (PRNG) to generate the stochastic force applied to each particle or pair of neighboring particles during each time step in the integration of Newton's equations of motion. In a Single-Instruction-Multiple-Thread (SIMT) GPU parallel computing environment, small batches of random numbers must be generated over thousands of threads and millions of kernel calls. In this communication we introduce a one-PRNG-per-kernel-call-per-thread scheme, in which a micro-stream of pseudorandom numbers is generated in each thread and kernel call. These high quality, statistically robust micro-streams require no global memory for state storage, are more computationally efficient than other PRNG schemes in memory-bound kernels, and uniquely enable the DPD simulation method without requiring communication between threads.

  15. Comparison of Two Output-Coding Strategies for Multi-Class Tumor Classification Using Gene Expression Data and Latent Variable Model as Binary Classifier

    Directory of Open Access Journals (Sweden)

    Sandeep J. Joseph

    2010-03-01

    Full Text Available Multi-class cancer classification based on microarray data is described. A generalized output-coding scheme based on One Versus One (OVO combined with Latent Variable Model (LVM is used. Results from the proposed One Versus One (OVO output- coding strategy is compared with the results obtained from the generalized One Versus All (OVA method and their efficiencies of using them for multi-class tumor classification have been studied. This comparative study was done using two microarray gene expression data: Global Cancer Map (GCM dataset and brain cancer (BC dataset. Primary feature selection was based on fold change and penalized t-statistics. Evaluation was conducted with varying feature numbers. The OVO coding strategy worked quite well with the BC data, while both OVO and OVA results seemed to be similar for the GCM data. The selection of output coding methods for combining binary classifiers for multi-class tumor classification depends on the number of tumor types considered, the discrepancies between the tumor samples used for training as well as the heterogeneity of expression within the cancer subtypes used as training data.

  16. Influence of pseudorandom bit format on the direct modulation ...

    Indian Academy of Sciences (India)

    noise of the laser, which originates from the inclusion of the spontaneous emission into the lasing mode and electron–hole recombination processes [4,5], makes the turn-on time a randomly fluctuating quantity [6]. Moreover, in digital transmission systems the laser is subjected to direct digital modulation by pseudorandom ...

  17. McCulloch-Pitts brains and pseudorandom functions

    OpenAIRE

    Chvátal, Vašek; Goldsmith, Mark; Yang, Nan

    2016-01-01

    In a pioneering classic, Warren McCulloch and Walter Pitts proposed a model of the central nervous system. Motivated by EEG recordings of normal brain activity, Chv\\'atal and Goldsmith asked whether or not these dynamical systems can be engineered to produce trajectories which are irregular, disorderly, apparently unpredictable. We show that they cannot build weak pseudorandom functions.

  18. McCulloch-Pitts Brains and Pseudorandom Functions.

    Science.gov (United States)

    Chvátal, Vašek; Goldsmith, Mark; Yang, Nan

    2016-06-01

    In a pioneering classic, Warren McCulloch and Walter Pitts proposed a model of the central nervous system. Motivated by EEG recordings of normal brain activity, Chvátal and Goldsmith asked whether these dynamical systems can be engineered to produce trajectories that are irregular, disorderly, and apparently unpredictable. We show that they cannot build weak pseudorandom functions.

  19. Kolmogorov complexity, pseudorandom generators and statistical models testing

    Czech Academy of Sciences Publication Activity Database

    Šindelář, Jan; Boček, Pavel

    2002-01-01

    Roč. 38, č. 6 (2002), s. 747-759 ISSN 0023-5954 R&D Projects: GA ČR GA102/99/1564 Institutional research plan: CEZ:AV0Z1075907 Keywords : Kolmogorov complexity * pseudorandom generators * statistical models testing Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 0.341, year: 2002

  20. On pseudorandom generators in NC0

    DEFF Research Database (Denmark)

    Cryan, Mary; Miltersen, Peter Bro

    2001-01-01

    In this paper we consider the question of whether NC 0 circuits can generate pseudorandom distributions. While we leave the general question unanswered, we show – • Generators computed by NC 0 circuits where each output bit depends on at most 3 input bits (i.e, DNC 3 0 circuits) and with stretch...

  1. Cryptography, statistics and pseudo-randomness (Part 1)

    NARCIS (Netherlands)

    Brands, S.; Gill, R.D.

    1995-01-01

    In the classical approach to pseudo-random number generators, a generator is considered to perform well if its output sequences pass a battery of statistical tests that has become standard. In recent years, it has turned out that this approach is not satisfactory. Many generators have turned out to

  2. Generation of pseudo-random sequences for spread spectrum systems

    Science.gov (United States)

    Moser, R.; Stover, J.

    1985-05-01

    The characteristics of pseudo random radio signal sequences (PRS) are explored. The randomness of the PSR is a matter of artificially altering the sequence of binary digits broadcast. Autocorrelations of the two sequences shifted in time, if high, determine if the signals are the same and thus allow for position identification. Cross-correlation can also be calculated between sequences. Correlations closest to zero are obtained with large volume of prime numbers in the sequences. Techniques for selecting optimal and maximal lengths for the sequences are reviewed. If the correlations are near zero in the sequences, then signal channels can accommodate multiple users. Finally, Gold codes are discussed as a technique for maximizing the code lengths.

  3. Logistic chaotic maps for binary numbers generations

    International Nuclear Information System (INIS)

    Kanso, Ali; Smaoui, Nejib

    2009-01-01

    Two pseudorandom binary sequence generators, based on logistic chaotic maps intended for stream cipher applications, are proposed. The first is based on a single one-dimensional logistic map which exhibits random, noise-like properties at given certain parameter values, and the second is based on a combination of two logistic maps. The encryption step proposed in both algorithms consists of a simple bitwise XOR operation of the plaintext binary sequence with the keystream binary sequence to produce the ciphertext binary sequence. A threshold function is applied to convert the floating-point iterates into binary form. Experimental results show that the produced sequences possess high linear complexity and very good statistical properties. The systems are put forward for security evaluation by the cryptographic committees.

  4. Comparison of two output-coding strategies for multi-class tumor classification using gene expression data and Latent Variable Model as binary classifier.

    Science.gov (United States)

    Joseph, Sandeep J; Robbins, Kelly R; Zhang, Wensheng; Rekaya, Romdhane

    2010-03-10

    Multi-class cancer classification based on microarray data is described. A generalized output-coding scheme based on One Versus One (OVO) combined with Latent Variable Model (LVM) is used. Results from the proposed One Versus One (OVO) outputcoding strategy is compared with the results obtained from the generalized One Versus All (OVA) method and their efficiencies of using them for multi-class tumor classification have been studied. This comparative study was done using two microarray gene expression data: Global Cancer Map (GCM) dataset and brain cancer (BC) dataset. Primary feature selection was based on fold change and penalized t-statistics. Evaluation was conducted with varying feature numbers. The OVO coding strategy worked quite well with the BC data, while both OVO and OVA results seemed to be similar for the GCM data. The selection of output coding methods for combining binary classifiers for multi-class tumor classification depends on the number of tumor types considered, the discrepancies between the tumor samples used for training as well as the heterogeneity of expression within the cancer subtypes used as training data.

  5. Range walk error correction and modeling on Pseudo-random photon counting system

    Science.gov (United States)

    Shen, Shanshan; Chen, Qian; He, Weiji

    2017-08-01

    Signal to noise ratio and depth accuracy are modeled for the pseudo-random ranging system with two random processes. The theoretical results, developed herein, capture the effects of code length and signal energy fluctuation are shown to agree with Monte Carlo simulation measurements. First, the SNR is developed as a function of the code length. Using Geiger-mode avalanche photodiodes (GMAPDs), longer code length is proven to reduce the noise effect and improve SNR. Second, the Cramer-Rao lower bound on range accuracy is derived to justify that longer code length can bring better range accuracy. Combined with the SNR model and CRLB model, it is manifested that the range accuracy can be improved by increasing the code length to reduce the noise-induced error. Third, the Cramer-Rao lower bound on range accuracy is shown to converge to the previously published theories and introduce the Gauss range walk model to range accuracy. Experimental tests also converge to the presented boundary model in this paper. It has been proven that depth error caused by the fluctuation of the number of detected photon counts in the laser echo pulse leads to the depth drift of Time Point Spread Function (TPSF). Finally, numerical fitting function is used to determine the relationship between the depth error and the photon counting ratio. Depth error due to different echo energy is calibrated so that the corrected depth accuracy is improved to 1cm.

  6. ACORN—A new method for generating sequences of uniformly distributed Pseudo-random Numbers

    Science.gov (United States)

    Wikramaratna, R. S.

    1989-07-01

    A new family of pseudo-random number generators, the ACORN ( additive congruential random number) generators, is proposed. The resulting numbers are distributed uniformly in the interval [0, 1). The ACORN generators are defined recursively, and the ( k + 1)th order generator is easily derived from the kth order generator. Some theorems concerning the period length are presented and compared with existing results for linear congruential generators. A range of statistical tests are applied to the ACORN generators, and their performance is compared with that of the linear congruential generators and the Chebyshev generators. The tests show the ACORN generators to be statistically superior to the Chebyshev generators, while being statistically similar to the linear congruential generators. However, the ACORN generators execute faster than linear congruential generators for the same statistical faithfulness. The main advantages of the ACORN generator are speed of execution, long period length, and simplicity of coding.

  7. Chaos-based Pseudo-random Number Generation

    KAUST Repository

    Barakat, Mohamed L.

    2014-04-10

    Various methods and systems related to chaos-based pseudo-random number generation are presented. In one example, among others, a system includes a pseudo-random number generator (PRNG) to generate a series of digital outputs and a nonlinear post processing circuit to perform an exclusive OR (XOR) operation on a first portion of a current digital output of the PRNG and a permutated version of a corresponding first portion of a previous post processed output to generate a corresponding first portion of a current post processed output. In another example, a method includes receiving at least a first portion of a current output from a PRNG and performing an XOR operation on the first portion of the current PRNG output with a permutated version of a corresponding first portion of a previous post processed output to generate a corresponding first portion of a current post processed output.

  8. Primitive polynomials selection method for pseudo-random number generator

    Science.gov (United States)

    Anikin, I. V.; Alnajjar, Kh

    2018-01-01

    In this paper we suggested the method for primitive polynomials selection of special type. This kind of polynomials can be efficiently used as a characteristic polynomials for linear feedback shift registers in pseudo-random number generators. The proposed method consists of two basic steps: finding minimum-cost irreducible polynomials of the desired degree and applying primitivity tests to get the primitive ones. Finally two primitive polynomials, which was found by the proposed method, used in pseudorandom number generator based on fuzzy logic (FRNG) which had been suggested before by the authors. The sequences generated by new version of FRNG have low correlation magnitude, high linear complexity, less power consumption, is more balanced and have better statistical properties.

  9. Correlations of pseudo-random numbers of multiplicative sequence

    International Nuclear Information System (INIS)

    Bukin, A.D.

    1989-01-01

    An algorithm is suggested for searching with a computer in unit n-dimensional cube the sets of planes where all the points fall whose coordinates are composed of n successive pseudo-random numbers of multiplicative sequence. This effect should be taken into account in Monte-Carlo calculations with definite constructive dimension. The parameters of these planes are obtained for three random number generators. 2 refs.; 2 tabs

  10. Graphical analysis of some pseudo-random number generators

    OpenAIRE

    Lewis, Peter A. W.

    1986-01-01

    There exist today many 'good' pseudo-random number generators; the problem is to retrieve them. This document discusses three commonly used pseudo- random number generators, the first being RANDU, a notoriously bad generator, but one which is still occasionally used. The next is the widely used prime modulus, multiplicative congruential generator used in LL-RANDOMII, the Naval Postgraduate School random number package, and the last is the random number generator provided for microcomputers wi...

  11. A new pseudorandom number generator based on a complex number chaotic equation

    International Nuclear Information System (INIS)

    Liu Yang; Tong Xiao-Jun

    2012-01-01

    In recent years, various chaotic equation based pseudorandom number generators have been proposed. However, the chaotic equations are all defined in the real number field. In this paper, an equation is proposed and proved to be chaotic in the imaginary axis. And a pseudorandom number generator is constructed based on the chaotic equation. The alteration of the definitional domain of the chaotic equation from the real number field to the complex one provides a new approach to the construction of chaotic equations, and a new method to generate pseudorandom number sequences accordingly. Both theoretical analysis and experimental results show that the sequences generated by the proposed pseudorandom number generator possess many good properties

  12. a Pseudo-Random Number Generator Employing Multiple RÉNYI Maps

    Science.gov (United States)

    Lui, Oi-Yan; Yuen, Ching-Hung; Wong, Kwok-Wo

    2013-11-01

    The increasing risk along with the drastic development of multimedia data transmission has raised a big concern on data security. A good pseudo-random number generator is an essential tool in cryptography. In this paper, we propose a novel pseudo-random number generator based on the controlled combination of the outputs of several digitized chaotic Rényi maps. The generated pseudo-random sequences have passed both the NIST 800-22 Revision 1a and the DIEHARD tests. Moreover, simulation results show that the proposed pseudo-random number generator requires less operation time than existing generators and is highly sensitive to the seed.

  13. A CABAC codec of H.264AVC with secure arithmetic coding

    Science.gov (United States)

    Neji, Nihel; Jridi, Maher; Alfalou, Ayman; Masmoudi, Nouri

    2013-02-01

    This paper presents an optimized H.264/AVC coding system for HDTV displays based on a typical flow with high coding efficiency and statics adaptivity features. For high quality streaming, the codec uses a Binary Arithmetic Encoding/Decoding algorithm with high complexity and a JVCE (Joint Video compression and encryption) scheme. In fact, particular attention is given to simultaneous compression and encryption applications to gain security without compromising the speed of transactions [1]. The proposed design allows us to encrypt the information using a pseudo-random number generator (PRNG). Thus we achieved the two operations (compression and encryption) simultaneously and in a dependent manner which is a novelty in this kind of architecture. Moreover, we investigated the hardware implementation of CABAC (Context-based adaptive Binary Arithmetic Coding) codec. The proposed architecture is based on optimized binarizer/de-binarizer to handle significant pixel rates videos with low cost and high performance for most frequent SEs. This was checked using HD video frames. The obtained synthesis results using an FPGA (Xilinx's ISE) show that our design is relevant to code main profile video stream.

  14. Design of Wireless Automatic Synchronization for the Low-Frequency Coded Ground Penetrating Radar

    Directory of Open Access Journals (Sweden)

    Zhenghuan Xia

    2015-01-01

    Full Text Available Low-frequency coded ground penetrating radar (GPR with a pair of wire dipole antennas has some advantages for deep detection. Due to the large distance between the two antennas, the synchronization design is a major challenge of implementing the GPR system. This paper proposes a simple and stable wireless automatic synchronization method based on our developed GPR system, which does not need any synchronization chips or modules and reduces the cost of the hardware system. The transmitter omits the synchronization preamble and pseudorandom binary sequence (PRBS at an appropriate time interval, while receiver automatically estimates the synchronization time and receives the returned signal from the underground targets. All the processes are performed in a single FPGA. The performance of the proposed synchronization method is validated with experiment.

  15. Program pseudo-random number generator for microcomputers

    International Nuclear Information System (INIS)

    Ososkov, G.A.

    1980-01-01

    Program pseudo-random number generators (PNG) intended for the test of control equipment and communication channels are considered. In the case of 8-bit microcomputers it is necessary to assign 4 words of storage to allocate one random number. The proposed economical algorithms of the random number generation are based on the idea of the ''mixing'' of such quarters of the preceeding random number to obtain the next one. Test results of the PNG are displayed for two such generators. A FORTRAN variant of the PNG is presented along with a program realizing the PNG made on the base of the INTEL-8080 autocode

  16. New Trends in Pseudo-Random Number Generation

    Science.gov (United States)

    Gutbrod, F.

    Properties of pseudo-random number generators are reviewed. The emphasis is on correlations between successive random numbers and their suppression by improvement steps. The generators under discussion are the linear congruential generators, lagged Fibonacci generators with various operations, and the improvement techniques combination, shuffling and decimation. The properties of the RANSHI generator are reviewed somewhat more extensively. The transition to 64-bit technology is discussed in several cases. The generators are subject to several tests, which look both for short range and for long range correlations. Some performance figures are given for a Pentium Pro PC. Recommendations are presented in the final chapter.

  17. Method for Generating Pseudorandom Sequences with the Assured Period Based on R-blocks

    Directory of Open Access Journals (Sweden)

    M. A. Ivanov

    2011-03-01

    Full Text Available The article describes the characteristics of a new class of fast-acting pseudorandom number generators, based on the use of stochastic adders or R-blocks. A new method for generating pseudorandom sequences with the assured length of period is offered.

  18. Polynomial weights and code constructions

    DEFF Research Database (Denmark)

    Massey, J; Costello, D; Justesen, Jørn

    1973-01-01

    polynomial included. This fundamental property is then used as the key to a variety of code constructions including 1) a simplified derivation of the binary Reed-Muller codes and, for any primepgreater than 2, a new extensive class ofp-ary "Reed-Muller codes," 2) a new class of "repeated-root" cyclic codes...... that are subcodes of the binary Reed-Muller codes and can be very simply instrumented, 3) a new class of constacyclic codes that are subcodes of thep-ary "Reed-Muller codes," 4) two new classes of binary convolutional codes with large "free distance" derived from known binary cyclic codes, 5) two new classes...... of long constraint length binary convolutional codes derived from2^r-ary Reed-Solomon codes, and 6) a new class ofq-ary "repeated-root" constacyclic codes with an algebraic decoding algorithm....

  19. Quantum-key-distribution protocol with pseudorandom bases

    Science.gov (United States)

    Trushechkin, A. S.; Tregubov, P. A.; Kiktenko, E. O.; Kurochkin, Y. V.; Fedorov, A. K.

    2018-01-01

    Quantum key distribution (QKD) offers a way for establishing information-theoretical secure communications. An important part of QKD technology is a high-quality random number generator for the quantum-state preparation and for post-processing procedures. In this work, we consider a class of prepare-and-measure QKD protocols, utilizing additional pseudorandomness in the preparation of quantum states. We study one of such protocols and analyze its security against the intercept-resend attack. We demonstrate that, for single-photon sources, the considered protocol gives better secret key rates than the BB84 and the asymmetric BB84 protocols. However, the protocol strongly requires single-photon sources.

  20. Programmable pseudo-random detector-pulse-pattern generator

    International Nuclear Information System (INIS)

    Putten, R. van der; Nationaal Inst. voor Kernfysica en Hoge-Energiefysica

    1990-01-01

    This report discusses the design and realization of the digital part of the programmable pseudo-random detector pulse-pattern generator. For the design and realization use has been made of F-TTL and high speed special purpose ic's, in particular FAL's (15 ns). The design possibilities offered by the software for pro-gramming of the FAL's have been utilized as much as possible. In this way counters, registers and a state machine with extended control possibilities have been designed and an advanced 8 channel pulse generator has been developed which is controlled via the VME system bus. the generator possesses an internal clock oscillator of 16 MHZ. The moment when a pulse is generated can be adjusted with a step size of 250 ps. 2000 different periods (time windows) can be stored for generating a pattern. (author). 37 refs.; 6 figs

  1. Quantifiers for randomness of chaotic pseudo-random number generators.

    Science.gov (United States)

    De Micco, L; Larrondo, H A; Plastino, A; Rosso, O A

    2009-08-28

    We deal with randomness quantifiers and concentrate on their ability to discern the hallmark of chaos in time series used in connection with pseudo-random number generators (PRNGs). Workers in the field are motivated to use chaotic maps for generating PRNGs because of the simplicity of their implementation. Although there exist very efficient general-purpose benchmarks for testing PRNGs, we feel that the analysis provided here sheds additional didactic light on the importance of the main statistical characteristics of a chaotic map, namely (i) its invariant measure and (ii) the mixing constant. This is of help in answering two questions that arise in applications: (i) which is the best PRNG among the available ones? and (ii) if a given PRNG turns out not to be good enough and a randomization procedure must still be applied to it, which is the best applicable randomization procedure? Our answer provides a comparative analysis of several quantifiers advanced in the extant literature.

  2. Pseudo-random number generator for the Sigma 5 computer

    Science.gov (United States)

    Carroll, S. N.

    1983-01-01

    A technique is presented for developing a pseudo-random number generator based on the linear congruential form. The two numbers used for the generator are a prime number and a corresponding primitive root, where the prime is the largest prime number that can be accurately represented on a particular computer. The primitive root is selected by applying Marsaglia's lattice test. The technique presented was applied to write a random number program for the Sigma 5 computer. The new program, named S:RANDOM1, is judged to be superior to the older program named S:RANDOM. For applications requiring several independent random number generators, a table is included showing several acceptable primitive roots. The technique and programs described can be applied to any computer having word length different from that of the Sigma 5.

  3. Pseudo-random number generator based on asymptotic deterministic randomness

    International Nuclear Information System (INIS)

    Wang Kai; Pei Wenjiang; Xia Haishan; Cheung Yiuming

    2008-01-01

    A novel approach to generate the pseudorandom-bit sequence from the asymptotic deterministic randomness system is proposed in this Letter. We study the characteristic of multi-value correspondence of the asymptotic deterministic randomness constructed by the piecewise linear map and the noninvertible nonlinearity transform, and then give the discretized systems in the finite digitized state space. The statistic characteristics of the asymptotic deterministic randomness are investigated numerically, such as stationary probability density function and random-like behavior. Furthermore, we analyze the dynamics of the symbolic sequence. Both theoretical and experimental results show that the symbolic sequence of the asymptotic deterministic randomness possesses very good cryptographic properties, which improve the security of chaos based PRBGs and increase the resistance against entropy attacks and symbolic dynamics attacks

  4. Pseudo-random number generator based on asymptotic deterministic randomness

    Science.gov (United States)

    Wang, Kai; Pei, Wenjiang; Xia, Haishan; Cheung, Yiu-ming

    2008-06-01

    A novel approach to generate the pseudorandom-bit sequence from the asymptotic deterministic randomness system is proposed in this Letter. We study the characteristic of multi-value correspondence of the asymptotic deterministic randomness constructed by the piecewise linear map and the noninvertible nonlinearity transform, and then give the discretized systems in the finite digitized state space. The statistic characteristics of the asymptotic deterministic randomness are investigated numerically, such as stationary probability density function and random-like behavior. Furthermore, we analyze the dynamics of the symbolic sequence. Both theoretical and experimental results show that the symbolic sequence of the asymptotic deterministic randomness possesses very good cryptographic properties, which improve the security of chaos based PRBGs and increase the resistance against entropy attacks and symbolic dynamics attacks.

  5. Characterization of electron microscopes with binary pseudo-random multilayer test samples

    International Nuclear Information System (INIS)

    Yashchuk, Valeriy V.; Conley, Raymond; Anderson, Erik H.; Barber, Samuel K.; Bouet, Nathalie; McKinney, Wayne R.; Takacs, Peter Z.; Voronov, Dmitriy L.

    2010-01-01

    We discuss the results of SEM and TEM measurements with the BPRML test samples fabricated from a BPRML (WSi2/Si with fundamental layer thickness of 3 nm) with a Dual Beam FIB (focused ion beam)/SEM technique. In particular, we demonstrate that significant information about the metrological reliability of the TEM measurements can be extracted even when the fundamental frequency of the BPRML sample is smaller than the Nyquist frequency of the measurements. The measurements demonstrate a number of problems related to the interpretation of the SEM and TEM data. Note that similar BPRML test samples can be used to characterize x-ray microscopes. Corresponding work with x-ray microscopes is in progress.

  6. Three-dimensional pseudo-random number generator for implementing in hybrid computer systems

    International Nuclear Information System (INIS)

    Ivanov, M.A.; Vasil'ev, N.P.; Voronin, A.V.; Kravtsov, M.Yu.; Maksutov, A.A.; Spiridonov, A.A.; Khudyakova, V.I.; Chugunkov, I.V.

    2012-01-01

    The algorithm for generating pseudo-random numbers oriented to implementation by using hybrid computer systems is considered. The proposed solution is characterized by a high degree of parallel computing [ru

  7. Using pseudo-random number generator for making iterative algorithms of hashing data

    International Nuclear Information System (INIS)

    Ivanov, M.A.; Vasil'ev, N.P.; Kozyrskij, B.L.

    2014-01-01

    The method of stochastic data transformation made for usage in cryptographic methods of information protection has been analyzed. The authors prove the usage of cryptographically strong pseudo-random number generators as a basis for Sponge construction. This means that the analysis of the quality of the known methods and tools for assessing the statistical security of pseudo-random number generators can be used effectively [ru

  8. Pseudo-random number generation using a 3-state cellular automaton

    Science.gov (United States)

    Bhattacharjee, Kamalika; Paul, Dipanjyoti; Das, Sukanta

    This paper investigates the potentiality of pseudo-random number generation of a 3-neighborhood 3-state cellular automaton (CA) under periodic boundary condition. Theoretical and empirical tests are performed on the numbers, generated by the CA, to observe the quality of it as pseudo-random number generator (PRNG). We analyze the strength and weakness of the proposed PRNG and conclude that the selected CA is a good random number generator.

  9. High-Performance Pseudo-Random Number Generation on Graphics Processing Units

    OpenAIRE

    Nandapalan, Nimalan; Brent, Richard P.; Murray, Lawrence M.; Rendell, Alistair

    2011-01-01

    This work considers the deployment of pseudo-random number generators (PRNGs) on graphics processing units (GPUs), developing an approach based on the xorgens generator to rapidly produce pseudo-random numbers of high statistical quality. The chosen algorithm has configurable state size and period, making it ideal for tuning to the GPU architecture. We present a comparison of both speed and statistical quality with other common parallel, GPU-based PRNGs, demonstrating favourable performance o...

  10. Division Unit for Binary Integer Decimals

    DEFF Research Database (Denmark)

    Lang, Tomas; Nannarelli, Alberto

    2009-01-01

    In this work, we present a radix-10 division unit that is based on the digit-recurrence algorithm and implements binary encodings (binary integer decimal or BID) for significands. Recent decimal division designs are all based on the binary coded decimal (BCD) encoding. We adapt the radix-10 digit...

  11. Very high performance pseudo-random number generation on DAP

    Science.gov (United States)

    Smith, K. A.; Reddaway, S. F.; Scott, D. M.

    1985-07-01

    Since the National DAP Service began at QMC in 1980, extensive use has been made of pseudo-random numbers in Monte Carlo simulation. Matrices of uniform numbers have been produced by various generators: (a) multiplicative ( x+ 1 = 13 13xn mod 2 59); (b) very long period shift register ( x4423 + x271 + 1); (c) multiple shorter period ( x127 + x7 + 1) shift registers generating several matrices per iteration. The above uniform generators can also feed a normal distribution generator that uses the Box-Muller transformation. This paper describes briefly the generators, their implementation and speed. Generator (b) has been greatly speeded-up by re-implementation, and now produces more than 100 × 10 6 high quality 16-bit numbers/s. Generator (c) is under development and will achieve even higher performance, mainly due to producing data in greater bulk. High quality numbers are expected, and performance will range from 400 to 800 × 10 6 numbers/s, depending on how the generator is used.

  12. Protocols for data hiding in pseudo-random state

    Science.gov (United States)

    Craver, Scott; Li, Enping; Yu, Jun

    2009-02-01

    An emerging form of steganographic communication uses ciphertext to replace the output of a random or strong pseudo-random number generator. PRNG-driven media, for example computer animated backdrops in video-conferencing channels, can then be used as a covert channel, if the PRNG bits that generated a piece of content can be estimated by the recipient. However, all bits sent over such a channel must be computationally indistinguishable from i.i.d. coin flips. Ciphertext messages and even key exchange datagrams are easily shaped to match this distribution; however, when placing these messages into a continous stream of PRNG bits, the sender is unable to provide synchronization markers, metadata, or error correction to ensure the message's location and proper decoding. In this paper we explore methods for message transmission and steganographic key exchange in such a "coin flip" channel. We establish that key exchange is generally not possible in this channel if an adversary possesses even a modest noise budget. If the warden is not vigilant in adding noise, however, communication is very simple.

  13. Calibration of Correlation Radiometers Using Pseudo-Random Noise Signals

    Directory of Open Access Journals (Sweden)

    Sebastián Pantoja

    2009-08-01

    Full Text Available The calibration of correlation radiometers, and particularly aperture synthesis interferometric radiometers, is a critical issue to ensure their performance. Current calibration techniques are based on the measurement of the cross-correlation of receivers’ outputs when injecting noise from a common noise source requiring a very stable distribution network. For large interferometric radiometers this centralized noise injection approach is very complex from the point of view of mass, volume and phase/amplitude equalization. Distributed noise injection techniques have been proposed as a feasible alternative, but are unable to correct for the so-called “baseline errors” associated with the particular pair of receivers forming the baseline. In this work it is proposed the use of centralized Pseudo-Random Noise (PRN signals to calibrate correlation radiometers. PRNs are sequences of symbols with a long repetition period that have a flat spectrum over a bandwidth which is determined by the symbol rate. Since their spectrum resembles that of thermal noise, they can be used to calibrate correlation radiometers. At the same time, since these sequences are deterministic, new calibration schemes can be envisaged, such as the correlation of each receiver’s output with a baseband local replica of the PRN sequence, as well as new distribution schemes of calibration signals. This work analyzes the general requirements and performance of using PRN sequences for the calibration of microwave correlation radiometers, and particularizes the study to a potential implementation in a large aperture synthesis radiometer using an optical distribution network.

  14. Generalized concatenated quantum codes

    International Nuclear Information System (INIS)

    Grassl, Markus; Shor, Peter; Smith, Graeme; Smolin, John; Zeng Bei

    2009-01-01

    We discuss the concept of generalized concatenated quantum codes. This generalized concatenation method provides a systematical way for constructing good quantum codes, both stabilizer codes and nonadditive codes. Using this method, we construct families of single-error-correcting nonadditive quantum codes, in both binary and nonbinary cases, which not only outperform any stabilizer codes for finite block length but also asymptotically meet the quantum Hamming bound for large block length.

  15. Interacting binaries

    CERN Document Server

    Shore, S N; van den Heuvel, EPJ

    1994-01-01

    This volume contains lecture notes presented at the 22nd Advanced Course of the Swiss Society for Astrophysics and Astronomy. The contributors deal with symbiotic stars, cataclysmic variables, massive binaries and X-ray binaries, in an attempt to provide a better understanding of stellar evolution.

  16. High Throughput Pseudorandom Number Generator Based on Variable Argument Unified Hyperchaos

    Directory of Open Access Journals (Sweden)

    Kaiyu Wang

    2014-01-01

    Full Text Available This paper presents a new multioutput and high throughput pseudorandom number generator. The scheme is to make the homogenized Logistic chaotic sequence as unified hyperchaotic system parameter. So the unified hyperchaos can transfer in different chaotic systems and the output can be more complex with the changing of homogenized Logistic chaotic output. Through processing the unified hyperchaotic 4-way outputs, the output will be extended to 26 channels. In addition, the generated pseudorandom sequences have all passed NIST SP800-22 standard test and DIEHARD test. The system is designed in Verilog HDL and experimentally verified on a Xilinx Spartan 6 FPGA for a maximum throughput of 16.91 Gbits/s for the native chaotic output and 13.49 Gbits/s for the resulting pseudorandom number generators.

  17. Non-periodic pseudo-random numbers used in Monte Carlo calculations

    International Nuclear Information System (INIS)

    Barberis, Gaston E.

    2007-01-01

    The generation of pseudo-random numbers is one of the interesting problems in Monte Carlo simulations, mostly because the common computer generators produce periodic numbers. We used simple pseudo-random numbers generated with the simplest chaotic system, the logistic map, with excellent results. The numbers generated in this way are non-periodic, which we demonstrated for 10 13 numbers, and they are obtained in a deterministic way, which allows to repeat systematically any calculation. The Monte Carlo calculations are the ideal field to apply these numbers, and we did it for simple and more elaborated cases. Chemistry and Information Technology use this kind of simulations, and the application of this numbers to quantum Monte Carlo and cryptography is immediate. I present here the techniques to calculate, analyze and use these pseudo-random numbers, show that they lack periodicity up to 10 13 numbers and that they are not correlated

  18. Robust video watermarking via optimization algorithm for quantization of pseudo-random semi-global statistics

    Science.gov (United States)

    Kucukgoz, Mehmet; Harmanci, Oztan; Mihcak, Mehmet K.; Venkatesan, Ramarathnam

    2005-03-01

    In this paper, we propose a novel semi-blind video watermarking scheme, where we use pseudo-random robust semi-global features of video in the three dimensional wavelet transform domain. We design the watermark sequence via solving an optimization problem, such that the features of the mark-embedded video are the quantized versions of the features of the original video. The exact realizations of the algorithmic parameters are chosen pseudo-randomly via a secure pseudo-random number generator, whose seed is the secret key, that is known (resp. unknown) by the embedder and the receiver (resp. by the public). We experimentally show the robustness of our algorithm against several attacks, such as conventional signal processing modifications and adversarial estimation attacks.

  19. Non-periodic pseudo-random numbers used in Monte Carlo calculations

    Science.gov (United States)

    Barberis, Gaston E.

    2007-09-01

    The generation of pseudo-random numbers is one of the interesting problems in Monte Carlo simulations, mostly because the common computer generators produce periodic numbers. We used simple pseudo-random numbers generated with the simplest chaotic system, the logistic map, with excellent results. The numbers generated in this way are non-periodic, which we demonstrated for 1013 numbers, and they are obtained in a deterministic way, which allows to repeat systematically any calculation. The Monte Carlo calculations are the ideal field to apply these numbers, and we did it for simple and more elaborated cases. Chemistry and Information Technology use this kind of simulations, and the application of this numbers to quantum Monte Carlo and cryptography is immediate. I present here the techniques to calculate, analyze and use these pseudo-random numbers, show that they lack periodicity up to 1013 numbers and that they are not correlated.

  20. Error Correcting Codes -34 ...

    Indian Academy of Sciences (India)

    the reading of data from memory the receiving process. Protecting data in computer memories was one of the earliest applications of Hamming codes. We now describe the clever scheme invented by Hamming in 1948. To keep things simple, we describe the binary length 7 Hamming code. Encoding in the Hamming Code.

  1. Study of Z(n)-gauge theories on a three-dimensional pseudorandom lattice

    International Nuclear Information System (INIS)

    Pertermann, D.; Ranft, J.

    1987-10-01

    Using the simplicial pseudorandom version of lattice gauge theory we study simple Z(n)-gauge models in D = 3 dimensions. In this formulation it is possible to interpolate continuously between a regular simplicial lattice and a pseudorandom lattice. Calculating average plaquette expectation values we look for the phase transitions of the Z(n)-gauge models with n = 2 and 3. We find all the phase transitions to be of first order, also in the case of the Z(2)-model. The critical couplings increase with the irregularity of the lattice. (author)

  2. Statistical independence of a new class of inversive congruential pseudorandom numbers

    International Nuclear Information System (INIS)

    Eichenauer-Herrmann, J.

    1993-01-01

    Linear congruential pseudorandom numbers show several undesirable regularities which can render them useless for certain stochastic simulations. This was the motiviation for important recent developments in nonlinear congruential methods for generating uniform pseudorandom numbers. It is particularly promising to achieve nonlinearity by employing the operation of multiplicative inversion with respect to a prime modulus. In the present paper a new class of such inversive congruential generators is introduced and analyzed. It is shown that they have excellent statistical independence properties and model true random numbers very closely. The methods of proof rely heavily on Weil-Stepanov bounds for rational exponential sums. 39 refs

  3. Pseudo-random number generators for Monte Carlo simulations on ATI Graphics Processing Units

    Science.gov (United States)

    Demchik, Vadim

    2011-03-01

    Basic uniform pseudo-random number generators are implemented on ATI Graphics Processing Units (GPU). The performance results of the realized generators (multiplicative linear congruential (GGL), XOR-shift (XOR128), RANECU, RANMAR, RANLUX and Mersenne Twister (MT19937)) on CPU and GPU are discussed. The obtained speed up factor is hundreds of times in comparison with CPU. RANLUX generator is found to be the most appropriate for using on GPU in Monte Carlo simulations. The brief review of the pseudo-random number generators used in modern software packages for Monte Carlo simulations in high-energy physics is presented.

  4. Determination of spatially dependent transfer function of zero power reactor by using pseudo-random incentive

    International Nuclear Information System (INIS)

    Kostic, Lj.

    1973-01-01

    Specially constructed fast reactivity oscillator was stimulating the zero power reactor by a stimulus which caused pseudo-random reactivity changes. Measuring system included stochastic oscillator BCR-1 supplied by pseudo-random pulses from noise generator GBS-16, instrumental tape-recorder, system for data acquisition and digital computer ZUSE-Z-23. For measuring the spatially dependent transfer function, reactor response was measured at a number of different positions of stochastic oscillator and ionization chamber. In order to keep the reactor system linear, experiment was limited to small reactivity fluctuations. Experimental results were compared to theoretical ones

  5. Stream cipher based on pseudorandom number generation using optical affine transformation

    Science.gov (United States)

    Sasaki, Toru; Togo, Hiroyuki; Tanida, Jun; Ichioka, Yoshiki

    2000-07-01

    We propose a new stream cipher technique for 2D image data which can be implemented by iterative optical transformation. The stream cipher uses a pseudo-random number generator (PRNG) to generate pseudo-random bit sequence. The proposed method for the PRNG is composed of iterative operation of 2D affine transformation achieved by optical components, and modulo-n addition of the transformed images. The method is expected to be executed efficiently by optical parallel processing. We verify performance of the proposed method in terms of security strength and clarify problems on optical implementation by the optical fractal synthesizer.

  6. Optimal pseudorandom sequence selection for online c-VEP based BCI control applications

    DEFF Research Database (Denmark)

    Isaksen, Jonas L.; Mohebbi, Ali; Puthusserypady, Sadasivan

    2017-01-01

    predictor. Conclusions: The simple and fast method presented in this study as the Accuracy Score, allows c-VEP based BCI systems to support multiple pseudorandom sequences without increase in trial length. This allows for more personalized BCI systems with better performance to be tested without increased...

  7. Pseudo-Random Number Generators for Vector Processors and Multicore Processors

    DEFF Research Database (Denmark)

    Fog, Agner

    2015-01-01

    Large scale Monte Carlo applications need a good pseudo-random number generator capable of utilizing both the vector processing capabilities and multiprocessing capabilities of modern computers in order to get the maximum performance. The requirements for such a generator are discussed. New ways...

  8. Pseudo-random Trees: Multiple Independent Sequence Generators for Parallel and Branching Computations

    Science.gov (United States)

    Halton, John H.

    1989-09-01

    A class of families of linear congruential pseudo-random sequences is defined, for which it is possible to branch at any event without changing the sequence of random numbers used in the original random walk and for which the sequences in different branches show properties analogous to mutual statistical independence. This is a hitherto unavailable, and computationally desirable, tool.

  9. Pseudorandom numbers: evolutionary models in image processing, biology, and nonlinear dynamic systems

    Science.gov (United States)

    Yaroslavsky, Leonid P.

    1996-11-01

    We show that one can treat pseudo-random generators, evolutionary models of texture images, iterative local adaptive filters for image restoration and enhancement and growth models in biology and material sciences in a unified way as special cases of dynamic systems with a nonlinear feedback.

  10. About the problem of generating three-dimensional pseudo-random points.

    Science.gov (United States)

    Carpintero, D. D.

    The author demonstrates that a popular pseudo-random number generator is not adequate in some circumstances to generate n-dimensional random points, n > 2. This problem is particularly noxious when direction cosines are generated. He proposes several soultions, among them a good generator that satisfies all statistical criteria.

  11. Reduction of coherent artifacts in dynamic holographic three-dimensional displays by diffraction-specific pseudorandom diffusion

    Science.gov (United States)

    Kim, Donghyun

    2004-03-01

    An electroholographic display based on diffraction-specific computation can reduce speckle by electronic diffusion through selective addition of a pseudorandom sequence. Intensity fluctuation as a result of the introduction of pseudorandom noise does not affect three-dimensional (3-D) images significantly since spatial windows formed by diffused basis fringes do not widen noticeably at low pseudorandom spread, whereas the features of the fluctuation are much smaller than human visual resolution. Experimental results obtained on the Massachusetts Institute of Technology holographic video system confirmed that the diffusion smooths 3-D images and improves the intensity nonuniformity among horizontal holographic lines.

  12. Computer simulation of different designs of pseudo-random time-of-flight velocity analysers for molecular beam scattering experiments

    International Nuclear Information System (INIS)

    Rotzoll, G.

    1982-01-01

    After a brief summary of the pseudo-random time-of-flight (TOF) method, the design criteria for construction of a pseudo-random TOF disc are considered and complemented by computer simulations. The question of resolution and the choice of the sequence length and number of time channels per element are discussed. Moreover, the stability requirements of the chopper motor frequency are investigated. (author)

  13. Cryptographic applications of analytic number theory complexity lower bounds and pseudorandomness

    CERN Document Server

    2003-01-01

    The book introduces new ways of using analytic number theory in cryptography and related areas, such as complexity theory and pseudorandom number generation. Key topics and features: - various lower bounds on the complexity of some number theoretic and cryptographic problems, associated with classical schemes such as RSA, Diffie-Hellman, DSA as well as with relatively new schemes like XTR and NTRU - a series of very recent results about certain important characteristics (period, distribution, linear complexity) of several commonly used pseudorandom number generators, such as the RSA generator, Blum-Blum-Shub generator, Naor-Reingold generator, inversive generator, and others - one of the principal tools is bounds of exponential sums, which are combined with other number theoretic methods such as lattice reduction and sieving - a number of open problems of different level of difficulty and proposals for further research - an extensive and up-to-date bibliography Cryptographers and number theorists will find th...

  14. Security Flaws in an Efficient Pseudo-Random Number Generator for Low-Power Environments

    Science.gov (United States)

    Peris-Lopez, Pedro; Hernandez-Castro, Julio C.; Tapiador, Juan M. E.; Millán, Enrique San; van der Lubbe, Jan C. A.

    In 2004, Settharam and Rhee tackled the design of a lightweight Pseudo-Random Number Generator (PRNG) suitable for low-power environments (e.g. sensor networks, low-cost RFID tags). First, they explicitly fixed a set of requirements for this primitive. Then, they proposed a PRNG conforming to these requirements and using a free-running timer [9]. We analyze this primitive discovering important security faults. The proposed algorithm fails to pass even relatively non-stringent batteries of randomness such as ENT (i.e. a pseudorandom number sequence test program). We prove that their recommended PRNG has a very short period due to the flawed design of its core. The internal state can be easily revealed, compromising its backward and forward security. Additionally, the rekeying algorithm is defectively designed mainly related to the unpractical value proposed for this purpose.

  15. Modular Transformations, Order-Chaos Transitions and Pseudo-Random Number Generation

    Science.gov (United States)

    Bonelli, Antonio; Ruffo, Stefano

    Successive pairs of pseudo-random numbers generated by standard linear congruential transformations display ordered patterns of parallel lines. We study the "ordered" and "chaotic" distribution of such pairs by solving the eigenvalue problem for two-dimensional modular transformations over integers. We conjecture that the optimal uniformity for pair distribution is obtained when the slope of linear modular eigenspaces takes the value n opt =maxint (p/√ {p-1}), where p is a prime number. We then propose a new generator of pairs of independent pseudo-random numbers, which realizes an optimal uniform distribution (in the "statistical" sense) of points on the unit square (0, 1] × (0, 1]. The method can be easily generalized to the generation of k-tuples of random numbers (with k>2).

  16. A Bidirectional Generalized Synchronization Theorem-Based Chaotic Pseudo-random Number Generator

    OpenAIRE

    Han Shuangshuang; Min Lequan

    2013-01-01

    Based on a bidirectional generalized synchronization theorem for discrete chaos system, this paper introduces a new 5-dimensional bidirectional generalized chaos synchronization system (BGCSDS), whose prototype is a novel chaotic system introduced in [12]. Numerical simulation showed that two pair variables of the BGCSDS achieve generalized chaos synchronization via a transform H.A chaos-based pseudo-random number generator (CPNG) was designed by the new BGCSDS. Using the FIPS-140-2 tests iss...

  17. Distributed Pseudo-Random Number Generation and Its Application to Cloud Database

    OpenAIRE

    Chen, Jiageng; Miyaji, Atsuko; Su, Chunhua

    2014-01-01

    Cloud database is now a rapidly growing trend in cloud computing market recently. It enables the clients run their computation on out-sourcing databases or access to some distributed database service on the cloud. At the same time, the security and privacy concerns is major challenge for cloud database to continue growing. To enhance the security and privacy of the cloud database technology, the pseudo-random number generation (PRNG) plays an important roles in data encryptions and privacy-pr...

  18. Trifork, a New Pseudorandom Number Generator Based on Lagged Fibonacci Maps

    OpenAIRE

    Orue, A.B.; Montoya, F.; Hernández Encinas, Luis

    2010-01-01

    A new family of cryptographically secure pseudorandom number generators, is described. It is based on the combination of the sequences generated by three coupled Lagged Fibonacci generators, mutually perturbed. The mutual perturbation method consists of the bitwise XOR cross-addition of the output of each generator with the right-shifted output of the nearby generator. The proposed generator has better entropy and much longer repetition period than the conventional Lagged Fibonacci Generator....

  19. Pseudo-random number generator based on mixing of three chaotic maps

    Science.gov (United States)

    François, M.; Grosges, T.; Barchiesi, D.; Erra, R.

    2014-04-01

    A secure pseudo-random number generator three-mixer is proposed. The principle of the method consists in mixing three chaotic maps produced from an input initial vector. The algorithm uses permutations whose positions are computed and indexed by a standard chaotic function and a linear congruence. The performance of that scheme is evaluated through statistical analysis. Such a cryptosystem lets appear significant cryptographic qualities for a high security level.

  20. Evolution of Supermassive Black-Hole Binaries

    Science.gov (United States)

    Milosavljevic, M.; Merritt, D.

    2000-10-01

    Binary supermassive black holes are expected to form in galactic nuclei following galaxy mergers. We report large-scale N-body simulations using the Aarseth/Spurzem parallel code NBODY6++ of the formation and evolution of such binaries. Initial conditions are drawn from a tree-code simulation of the merger of two spherical galaxies with ρ ~ r-2 density cusps (Cruz & Merritt, AAS Poster). Once the two black holes form a bound pair at the center of the merged galaxies, the evolution is continued using NBODY6++ at much higher resolution. Its exact force calculations generate faithful binary dynamics until the onset of gravity wave-dominated dissipation. We discuss the binary hardening rate, the amplitude of the binary's wandering, and the evolution of the structure of the galactic stellar nucleus.

  1. Analyzing logistic map pseudorandom number generators for periodicity induced by finite precision floating-point representation

    International Nuclear Information System (INIS)

    Persohn, K.J.; Povinelli, R.J.

    2012-01-01

    Highlights: ► A chaotic pseudorandom number generator (C-PRNG) poorly explores the key space. ► A C-PRNG is finite and periodic when implemented on a finite precision computer. ► We present a method to determine the period lengths of a C-PRNG. - Abstract: Because of the mixing and aperiodic properties of chaotic maps, such maps have been used as the basis for pseudorandom number generators (PRNGs). However, when implemented on a finite precision computer, chaotic maps have finite and periodic orbits. This manuscript explores the consequences finite precision has on the periodicity of a PRNG based on the logistic map. A comparison is made with conventional methods of generating pseudorandom numbers. The approach used to determine the number, delay, and period of the orbits of the logistic map at varying degrees of precision (3 to 23 bits) is described in detail, including the use of the Condor high-throughput computing environment to parallelize independent tasks of analyzing a large initial seed space. Results demonstrate that in terms of pathological seeds and effective bit length, a PRNG based on the logistic map performs exponentially worse than conventional PRNGs.

  2. Optimal interference code based on machine learning

    Science.gov (United States)

    Qian, Ye; Chen, Qian; Hu, Xiaobo; Cao, Ercong; Qian, Weixian; Gu, Guohua

    2016-10-01

    In this paper, we analyze the characteristics of pseudo-random code, by the case of m sequence. Depending on the description of coding theory, we introduce the jamming methods. We simulate the interference effect or probability model by the means of MATLAB to consolidate. In accordance with the length of decoding time the adversary spends, we find out the optimal formula and optimal coefficients based on machine learning, then we get the new optimal interference code. First, when it comes to the phase of recognition, this study judges the effect of interference by the way of simulating the length of time over the decoding period of laser seeker. Then, we use laser active deception jamming simulate interference process in the tracking phase in the next block. In this study we choose the method of laser active deception jamming. In order to improve the performance of the interference, this paper simulates the model by MATLAB software. We find out the least number of pulse intervals which must be received, then we can make the conclusion that the precise interval number of the laser pointer for m sequence encoding. In order to find the shortest space, we make the choice of the greatest common divisor method. Then, combining with the coding regularity that has been found before, we restore pulse interval of pseudo-random code, which has been already received. Finally, we can control the time period of laser interference, get the optimal interference code, and also increase the probability of interference as well.

  3. EVOLUTION OF THE BINARY FRACTION IN DENSE STELLAR SYSTEMS

    International Nuclear Information System (INIS)

    Fregeau, John M.; Ivanova, Natalia; Rasio, Frederic A.

    2009-01-01

    Using our recently improved Monte Carlo evolution code, we study the evolution of the binary fraction in globular clusters. In agreement with previous N-body simulations, we find generally that the hard binary fraction in the core tends to increase with time over a range of initial cluster central densities for initial binary fractions ∼<90%. The dominant processes driving the evolution of the core binary fraction are mass segregation of binaries into the cluster core and preferential destruction of binaries there. On a global scale, these effects and the preferential tidal stripping of single stars tend to roughly balance, leading to overall cluster binary fractions that are roughly constant with time. Our findings suggest that the current hard binary fraction near the half-mass radius is a good indicator of the hard primordial binary fraction. However, the relationship between the true binary fraction and the fraction of main-sequence stars in binaries (which is typically what observers measure) is nonlinear and rather complicated. We also consider the importance of soft binaries, which not only modify the evolution of the binary fraction, but can also drastically change the evolution of the cluster as a whole. Finally, we briefly describe the recent addition of single and binary stellar evolution to our cluster evolution code.

  4. Binary sequence detector uses minimum number of decision elements

    Science.gov (United States)

    Perlman, M.

    1966-01-01

    Detector of an n bit binary sequence code within a serial binary data system assigns states to memory elements of a code sequence detector by employing the same order of states for the sequence detector as that of the sequence generator when the linear recursion relationship employed by the sequence generator is given.

  5. Rate-adaptive BCH codes for distributed source coding

    DEFF Research Database (Denmark)

    Salmistraro, Matteo; Larsen, Knud J.; Forchhammer, Søren

    2013-01-01

    This paper considers Bose-Chaudhuri-Hocquenghem (BCH) codes for distributed source coding. A feedback channel is employed to adapt the rate of the code during the decoding process. The focus is on codes with short block lengths for independently coding a binary source X and decoding it given its...... correlated side information Y. The proposed codes have been analyzed in a high-correlation scenario, where the marginal probability of each symbol, Xi in X, given Y is highly skewed (unbalanced). Rate-adaptive BCH codes are presented and applied to distributed source coding. Adaptive and fixed checking...

  6. Binary translation using peephole translation rules

    Science.gov (United States)

    Bansal, Sorav; Aiken, Alex

    2010-05-04

    An efficient binary translator uses peephole translation rules to directly translate executable code from one instruction set to another. In a preferred embodiment, the translation rules are generated using superoptimization techniques that enable the translator to automatically learn translation rules for translating code from the source to target instruction set architecture.

  7. Optimized reversible binary-coded decimal adders

    DEFF Research Database (Denmark)

    Thomsen, Michael Kirkedal; Glück, Robert

    2008-01-01

    their design. The optimized 1-decimal BCD full-adder, a 13 × 13 reversible logic circuit, is faster, and has lower circuit cost and less garbage bits. It can be used to build a fast reversible m-decimal BCD full-adder that has a delay of only m + 17 low-power reversible CMOS gates. For a 32-decimal (128-bit...... in reversible logic design by drastically reducing the number of garbage bits. Specialized designs benefit from support by reversible logic synthesis. All circuit components required for optimizing the original design could also be synthesized successfully by an implementation of an existing synthesis algorithm...

  8. Pseudo-random Aloha for inter-frame soft combining in RFID systems

    DEFF Research Database (Denmark)

    Castiglione, Paolo; Ricciato, Fabio; Popovski, Petar

    2013-01-01

    In this work we consider a recently proposed variant of the classical Framed Slotted-ALOHA where slot selection is based on a pseudo-random function of the message to be transmitted and of the frame index. We couple this feature with convolutional encoding, that allows to perform Inter-frame Soft...... cancellation (instead of combining). Numerical simulation results show that the ISoC scheme brings a noticeable throughput gain over traditional schemes in a dense RFID scenario with multiple concurrent Tag transmissions....

  9. Pseudo-random tool paths for CNC sub-aperture polishing and other applications.

    Science.gov (United States)

    Dunn, Christina R; Walker, David D

    2008-11-10

    In this paper we first contrast classical and CNC polishing techniques in regard to the repetitiveness of the machine motions. We then present a pseudo-random tool path for use with CNC sub-aperture polishing techniques and report polishing results from equivalent random and raster tool-paths. The random tool-path used - the unicursal random tool-path - employs a random seed to generate a pattern which never crosses itself. Because of this property, this tool-path is directly compatible with dwell time maps for corrective polishing. The tool-path can be used to polish any continuous area of any boundary shape, including surfaces with interior perforations.

  10. Generation of pseudo-random numbers from given probabilistic distribution with the use of chaotic maps

    Science.gov (United States)

    Lawnik, Marcin

    2018-01-01

    The scope of the paper is the presentation of a new method of generating numbers from a given distribution. The method uses the inverse cumulative distribution function and a method of flattening of probabilistic distributions. On the grounds of these methods, a new construction of chaotic maps was derived, which generates values from a given distribution. The analysis of the new method was conducted on the example of a newly constructed chaotic recurrences, based on the Box-Muller transformation and the quantile function of the exponential distribution. The obtained results certify that the proposed method may be successively applicable for the construction of generators of pseudo-random numbers.

  11. Pseudo-Random Sequences Generated by a Class of One-Dimensional Smooth Map

    Science.gov (United States)

    Wang, Xing-Yuan; Qin, Xue; Xie, Yi-Xin

    2011-08-01

    We extend a class of a one-dimensional smooth map. We make sure that for each desired interval of the parameter the map's Lyapunov exponent is positive. Then we propose a novel parameter perturbation method based on the good property of the extended one-dimensional smooth map. We perturb the parameter r in each iteration by the real number xi generated by the iteration. The auto-correlation function and NIST statistical test suite are taken to illustrate the method's randomness finally. We provide an application of this method in image encryption. Experiments show that the pseudo-random sequences are suitable for this application.

  12. Pseudo-random properties of a linear congruential generator investigated by b-adic diaphony

    Science.gov (United States)

    Stoev, Peter; Stoilova, Stanislava

    2017-12-01

    In the proposed paper we continue the study of the diaphony, defined in b-adic number system, and we extend it in different directions. We investigate this diaphony as a tool for estimation of the pseudorandom properties of some of the most used random number generators. This is done by evaluating the distribution of specially constructed two-dimensional nets on the base of the obtained random numbers. The aim is to see how the generated numbers are suitable for calculations in some numerical methods (Monte Carlo etc.).

  13. Pseudo-Random Sequences Generated by a Class of One-Dimensional Smooth Map

    International Nuclear Information System (INIS)

    Wang Xing-Yuan; Qin Xue; Xie Yi-Xin

    2011-01-01

    We extend a class of a one-dimensional smooth map. We make sure that for each desired interval of the parameter the map's Lyapunov exponent is positive. Then we propose a novel parameter perturbation method based on the good property of the extended one-dimensional smooth map. We perturb the parameter r in each iteration by the real number x i generated by the iteration. The auto-correlation function and NIST statistical test suite are taken to illustrate the method's randomness finally. We provide an application of this method in image encryption. Experiments show that the pseudo-random sequences are suitable for this application. (general)

  14. Comparison of a quantum random number generator with pseudorandom number generators for their use in molecular Monte Carlo simulations.

    Science.gov (United States)

    Ghersi, Dario; Parakh, Abhishek; Mezei, Mihaly

    2017-12-05

    Four pseudorandom number generators were compared with a physical, quantum-based random number generator using the NIST suite of statistical tests, which only the quantum-based random number generator could successfully pass. We then measured the effect of the five random number generators on various calculated properties in different Markov-chain Monte Carlo simulations. Two types of systems were tested: conformational sampling of a small molecule in aqueous solution and liquid methanol under constant temperature and pressure. The results show that poor quality pseudorandom number generators produce results that deviate significantly from those obtained with the quantum-based random number generator, particularly in the case of the small molecule in aqueous solution setup. In contrast, the widely used Mersenne Twister pseudorandom generator and a 64-bit Linear Congruential Generator with a scrambler produce results that are statistically indistinguishable from those obtained with the quantum-based random number generator. © 2017 Wiley Periodicals, Inc. © 2017 Wiley Periodicals, Inc.

  15. Speech coding

    Energy Technology Data Exchange (ETDEWEB)

    Ravishankar, C., Hughes Network Systems, Germantown, MD

    1998-05-08

    Speech is the predominant means of communication between human beings and since the invention of the telephone by Alexander Graham Bell in 1876, speech services have remained to be the core service in almost all telecommunication systems. Original analog methods of telephony had the disadvantage of speech signal getting corrupted by noise, cross-talk and distortion Long haul transmissions which use repeaters to compensate for the loss in signal strength on transmission links also increase the associated noise and distortion. On the other hand digital transmission is relatively immune to noise, cross-talk and distortion primarily because of the capability to faithfully regenerate digital signal at each repeater purely based on a binary decision. Hence end-to-end performance of the digital link essentially becomes independent of the length and operating frequency bands of the link Hence from a transmission point of view digital transmission has been the preferred approach due to its higher immunity to noise. The need to carry digital speech became extremely important from a service provision point of view as well. Modem requirements have introduced the need for robust, flexible and secure services that can carry a multitude of signal types (such as voice, data and video) without a fundamental change in infrastructure. Such a requirement could not have been easily met without the advent of digital transmission systems, thereby requiring speech to be coded digitally. The term Speech Coding is often referred to techniques that represent or code speech signals either directly as a waveform or as a set of parameters by analyzing the speech signal. In either case, the codes are transmitted to the distant end where speech is reconstructed or synthesized using the received set of codes. A more generic term that is applicable to these techniques that is often interchangeably used with speech coding is the term voice coding. This term is more generic in the sense that the

  16. The EISCAT meteor code

    Directory of Open Access Journals (Sweden)

    G. Wannberg

    2008-08-01

    Full Text Available The EISCAT UHF system has the unique capability to determine meteor vector velocities from the head echo Doppler shifts measured at the three sites. Since even meteors spending a very short time in the common volume produce analysable events, the technique lends itself ideally to mapping the orbits of meteors arriving from arbitrary directions over most of the upper hemisphere.

    A radar mode optimised for this application was developed in 2001/2002. A specially selected low-sidelobe 32-bit pseudo-random binary sequence is used to binary phase shift key (BPSK the transmitted carrier. The baud-length is 2.4 μs and the receiver bandwidth is 1.6 MHz to accommodate both the resulting modulation bandwidth and the target Doppler shift. Sampling is at 0.6 μs, corresponding to 90-m range resolution. Target range and Doppler velocity are extracted from the raw data in a multi-step matched-filter procedure. For strong (SNR>5 events the Doppler velocity standard deviation is 100–150 m/s. The effective range resolution is about 30 m, allowing very accurate time-of-flight velocity estimates. On average, Doppler and time-of-flight (TOF velocities agree to within about one part in 103. Two or more targets simultaneously present in the beam can be resolved down to a range separation <300 m as long as their Doppler shifts differ by more than a few km/s.

  17. Combining binary classifiers to improve tree species discrimination at leaf level

    CSIR Research Space (South Africa)

    Dastile, X

    2012-11-01

    Full Text Available , direct 7-class prediction results in high misclassification rates. We therefore construct binary classifiers for all possible binary classification problems and combine them using Error Correcting Output Codes (ECOC) to form a 7-class predictor. ECOC...

  18. Generalized hardware post-processing technique for chaos-based pseudorandom number generators

    KAUST Repository

    Barakat, Mohamed L.

    2013-06-01

    This paper presents a generalized post-processing technique for enhancing the pseudorandomness of digital chaotic oscillators through a nonlinear XOR-based operation with rotation and feedback. The technique allows full utilization of the chaotic output as pseudorandom number generators and improves throughput without a significant area penalty. Digital design of a third-order chaotic system with maximum function nonlinearity is presented with verified chaotic dynamics. The proposed post-processing technique eliminates statistical degradation in all output bits, thus maximizing throughput compared to other processing techniques. Furthermore, the technique is applied to several fully digital chaotic oscillators with performance surpassing previously reported systems in the literature. The enhancement in the randomness is further examined in a simple image encryption application resulting in a better security performance. The system is verified through experiment on a Xilinx Virtex 4 FPGA with throughput up to 15.44 Gbit/s and logic utilization less than 0.84% for 32-bit implementations. © 2013 ETRI.

  19. Pseudo-random number generation for Brownian Dynamics and Dissipative Particle Dynamics simulations on GPU devices

    Science.gov (United States)

    Phillips, Carolyn L.; Anderson, Joshua A.; Glotzer, Sharon C.

    2011-08-01

    Brownian Dynamics (BD), also known as Langevin Dynamics, and Dissipative Particle Dynamics (DPD) are implicit solvent methods commonly used in models of soft matter and biomolecular systems. The interaction of the numerous solvent particles with larger particles is coarse-grained as a Langevin thermostat is applied to individual particles or to particle pairs. The Langevin thermostat requires a pseudo-random number generator (PRNG) to generate the stochastic force applied to each particle or pair of neighboring particles during each time step in the integration of Newton's equations of motion. In a Single-Instruction-Multiple-Thread (SIMT) GPU parallel computing environment, small batches of random numbers must be generated over thousands of threads and millions of kernel calls. In this communication we introduce a one-PRNG-per-kernel-call-per-thread scheme, in which a micro-stream of pseudorandom numbers is generated in each thread and kernel call. These high quality, statistically robust micro-streams require no global memory for state storage, are more computationally efficient than other PRNG schemes in memory-bound kernels, and uniquely enable the DPD simulation method without requiring communication between threads.

  20. Improving the pseudo-randomness properties of chaotic maps using deep-zoom

    Science.gov (United States)

    Machicao, Jeaneth; Bruno, Odemir M.

    2017-05-01

    A generalized method is proposed to compose new orbits from a given chaotic map. The method provides an approach to examine discrete-time chaotic maps in a "deep-zoom" manner by using k-digits to the right from the decimal separator of a given point from the underlying chaotic map. Interesting phenomena have been identified. Rapid randomization was observed, i.e., chaotic patterns tend to become indistinguishable when compared to the original orbits of the underlying chaotic map. Our results were presented using different graphical analyses (i.e., time-evolution, bifurcation diagram, Lyapunov exponent, Poincaré diagram, and frequency distribution). Moreover, taking advantage of this randomization improvement, we propose a Pseudo-Random Number Generator (PRNG) based on the k-logistic map. The pseudo-random qualities of the proposed PRNG passed both tests successfully, i.e., DIEHARD and NIST, and were comparable with other traditional PRNGs such as the Mersenne Twister. The results suggest that simple maps such as the logistic map can be considered as good PRNG methods.

  1. Generation of pseudo-random numbers with the use of inverse chaotic transformation

    Directory of Open Access Journals (Sweden)

    Lawnik Marcin

    2018-02-01

    Full Text Available In (Lawnik M., Generation of numbers with the distribution close to uniform with the use of chaotic maps, In: Obaidat M.S., Kacprzyk J., Ören T. (Ed., International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH (28-30 August 2014, Vienna, Austria, SCITEPRESS, 2014 Lawnik discussed a method of generating pseudo-random numbers from uniform distribution with the use of adequate chaotic transformation. The method enables the “flattening” of continuous distributions to uniform one. In this paper a inverse process to the above-mentioned method is presented, and, in consequence, a new manner of generating pseudo-random numbers from a given continuous distribution. The method utilizes the frequency of the occurrence of successive branches of chaotic transformation in the process of “flattening”. To generate the values from the given distribution one discrete and one continuous value of a random variable are required. The presented method does not directly involve the knowledge of the density function or the cumulative distribution function, which is, undoubtedly, a great advantage in comparison with other well-known methods. The described method was analysed on the example of the standard normal distribution.

  2. Bondi-Hoyle-Lyttleton Accretion onto Binaries

    Science.gov (United States)

    Antoni, Andrea; MacLeod, Morgan; Ramírez-Ruiz, Enrico

    2018-01-01

    Binary stars are not rare. While only close binary stars will eventually interact with one another, even the widest binary systems interact with their gaseous surroundings. The rates of accretion and the gaseous drag forces arising in these interactions are the key to understanding how these systems evolve. This poster examines accretion flows around a binary system moving supersonically through a background gas. We perform three-dimensional hydrodynamic simulations of Bondi-Hoyle-Lyttleton accretion using the adaptive mesh refinement code FLASH. We simulate a range of values of semi-major axis of the orbit relative to the gravitational focusing impact parameter of the pair. On large scales, gas is gravitationally focused by the center-of-mass of the binary, leading to dynamical friction drag and to the accretion of mass and momentum. On smaller scales, the orbital motion imprints itself on the gas. Notably, the magnitude and direction of the forces acting on the binary inherit this orbital dependence. The long-term evolution of the binary is determined by the timescales for accretion, slow down of the center-of-mass, and decay of the orbit. We use our simulations to measure these timescales and to establish a hierarchy between them. In general, our simulations indicate that binaries moving through gaseous media will slow down before the orbit decays.

  3. Goal-independent mechanisms for free response generation: creative and pseudo-random performance share neural substrates.

    Science.gov (United States)

    de Manzano, Örjan; Ullén, Fredrik

    2012-01-02

    To what extent free response generation in different tasks uses common and task-specific neurocognitive processes has remained unclear. Here, we investigated overlap and differences in neural activity during musical improvisation and pseudo-random response generation. Brain activity was measured using fMRI in a group of professional classical pianists, who performed musical improvisation of melodies, pseudo-random key-presses and a baseline condition (sight-reading), on either two, six or twelve keys on a piano keyboard. The results revealed an extensive overlap in neural activity between the two generative conditions. Active regions included the dorsolateral and dorsomedial prefrontal cortices, inferior frontal gyrus, anterior cingulate cortex and pre-SMA. No regions showed higher activity in improvisation than in pseudo-random generation. These findings suggest that the activated regions fulfill generic functions that are utilized in different types of free generation tasks, independent of overall goal. In contrast, pseudo-random generation was accompanied by higher activity than improvisation in several regions. This presumably reflects the participants' musical expertise as well as the pseudo-random generation task's high load on attention, working memory, and executive control. The results highlight the significance of using naturalistic tasks to study human behavior and cognition. No brain activity was related to the size of the response set. We discuss that this may reflect that the musicians were able to use specific strategies for improvisation, by which there was no simple relationship between response set size and neural activity. Copyright © 2011 Elsevier Inc. All rights reserved.

  4. Research of the method of pseudo-random number generation based on asynchronous cellular automata with several active cells

    Directory of Open Access Journals (Sweden)

    Bilan Stepan

    2017-01-01

    Full Text Available To date, there are many tasks that are aimed at studying the dynamic changes in physical processes. These tasks do not give advance known result. The solution of such problems is based on the construction of a dynamic model of the object. Successful structural and functional implementation of the object model can give a positive result in time. This approach uses the task of constructing artificial biological objects. To solve such problems, pseudo-random number generators are used, which also find wide application for information protection tasks. Such generators should have good statistical properties and give a long repetition period of the generated pseudo-random bit sequence. This work is aimed at improving these characteristics. The paper considers the method of forming pseudo-random sequences of numbers on the basis of aperiodic cellular automata with two active cells. A pseudo-random number generator is proposed that generates three bit sequences. The first two bit sequences are formed by the corresponding two active cells in the cellular automaton. The third bit sequence is the result of executing the XOR function over the bits of the first two sequences and it has better characteristics compared to them. The use of cellular automata with two active cells allowed to improve the statistical properties of the formed bit sequence, as well as its repetition period. This is proved by using graphical tests for generators built based on cellular automata using the neighborhoods of von Neumann and Moore. The tests showed high efficiency of the generator based on an asynchronous cellular automaton with the neighborhood of Moore. The proposed pseudo-random number generators have good statistical properties, which makes it possible to use them in information security systems, as well as for simulation tasks of various dynamic processes.

  5. CNN-aware Binary Map for General Semantic Segmentation

    OpenAIRE

    Ravanbakhsh, Mahdyar; Mousavi, Hossein; Nabi, Moin; Rastegari, Mohammad; Regazzoni, Carlo

    2016-01-01

    In this paper we introduce a novel method for general semantic segmentation that can benefit from general semantics of Convolutional Neural Network (CNN). Our segmentation proposes visually and semantically coherent image segments. We use binary encoding of CNN features to overcome the difficulty of the clustering on the high-dimensional CNN feature space. These binary codes are very robust against noise and non-semantic changes in the image. These binary encoding can be embedded into the CNN...

  6. The Tap code - a code similar to Morse code for communication by tapping

    OpenAIRE

    Rafler, Stephan

    2013-01-01

    A code is presented for fast, easy and efficient communication over channels that allow only two signal types: a single sound (e.g. a knock), or no sound (i.e. silence). This is a true binary code while Morse code is a ternary code and does not work in such situations. Thus the presented code is more universal than Morse and can be used in much more situations. Additionally it is very tolerant to variations in signal strength or duration. The paper contains various ways in which the code can ...

  7. P-RnaPredict--a parallel evolutionary algorithm for RNA folding: effects of pseudorandom number quality.

    Science.gov (United States)

    Wiese, Kay C; Hendriks, Andrew; Deschênes, Alain; Ben Youssef, Belgacem

    2005-09-01

    This paper presents a fully parallel version of RnaPredict, a genetic algorithm (GA) for RNA secondary structure prediction. The research presented here builds on previous work and examines the impact of three different pseudorandom number generators (PRNGs) on the GA's performance. The three generators tested are the C standard library PRNG RAND, a parallelized multiplicative congruential generator (MCG), and a parallelized Mersenne Twister (MT). A fully parallel version of RnaPredict using the Message Passing Interface (MPI) was implemented on a 128-node Beowulf cluster. The PRNG comparison tests were performed with known structures whose sequences are 118, 122, 468, 543, and 556 nucleotides in length. The effects of the PRNGs are investigated and the predicted structures are compared to known structures. Results indicate that P-RnaPredict demonstrated good prediction accuracy, particularly so for shorter sequences.

  8. Pseudo-random arranged color filter array for controlling moiré patterns in display.

    Science.gov (United States)

    Zhou, Yangui; Fan, Hang; An, Sengzhong; Li, Juntao; Wang, Jiahui; Zhou, Jianying; Liu, Yikun

    2015-11-16

    Optical display quality can be degraded by the appearance of moiré pattern occurring in a display system consisting of a basic matrix superimposed with a functional structured optical layer. We propose in this paper a novel pseudo-random arranged color filter array with the table number arranged with an optimal design scenario. We show that the moiré pattern can be significantly reduced with the introduction of the special color filter array. The idea is tested with an experiment that gives rise to a substantially reduced moiré pattern in a display system. It is believed that the novel functional optical structures have significant impact to complex structured display system in general and to the autostereoscopic and integrated display systems in particular.

  9. A Fast, High Quality, and Reproducible Parallel Lagged-Fibonacci Pseudorandom Number Generator

    Science.gov (United States)

    Mascagni, Michael; Cuccaro, Steven A.; Pryor, Daniel V.; Robinson, M. L.

    1995-07-01

    We study the suitability of the additive lagged-Fibonacci pseudo-random number generator for parallel computation. This generator has relatively short period with respect to the size of its seed. However, the short period is more than made up for with the huge number of full-period cycles it contains. These different full period cycles are called equivalence classes. We show how to enumerate the equivalence classes and how to compute seeds to select a given equivalence class, In addition, we present some theoretical measures of quality for this generator when used in parallel. Next, we conjecture on the size of these measures of quality for this generator. Extensive empirical evidence supports this conjecture. In addition, a probabilistic interpretation of these measures leads to another conjecture similarly supported by empirical evidence. Finally we give an explicit parallelization suitable for a fully reproducible asynchronous MIMD implementation.

  10. Solving a binary puzzle

    NARCIS (Netherlands)

    P.H. Utomo (Putranto); R.H. Makarim (Rusydi)

    2017-01-01

    textabstractA Binary puzzle is a Sudoku-like puzzle with values in each cell taken from the set (Formula presented.). Let (Formula presented.) be an even integer, a solved binary puzzle is an (Formula presented.) binary array that satisfies the following conditions: (1) no three consecutive ones and

  11. Binary Biometric Representation through Pairwise Adaptive Phase Quantization

    NARCIS (Netherlands)

    Chen, C.; Veldhuis, Raymond N.J.

    Extracting binary strings from real-valued biometric templates is a fundamental step in template compression and protection systems, such as fuzzy commitment, fuzzy extractor, secure sketch, and helper data systems. Quantization and coding is the straightforward way to extract binary representations

  12. Eclipsing binaries in open clusters

    DEFF Research Database (Denmark)

    Southworth, John; Clausen, J.V.

    2006-01-01

    Stars: fundamental parameters - Stars : binaries : eclipsing - Stars: Binaries: spectroscopic - Open clusters and ass. : general Udgivelsesdato: 5 August......Stars: fundamental parameters - Stars : binaries : eclipsing - Stars: Binaries: spectroscopic - Open clusters and ass. : general Udgivelsesdato: 5 August...

  13. BPASS predictions for binary black hole mergers

    Science.gov (United States)

    Eldridge, J. J.; Stanway, E. R.

    2016-11-01

    Using the Binary Population and Spectral Synthesis code, BPASS, we have calculated the rates, time-scales and mass distributions for binary black hole (BH) mergers as a function of metallicity. We consider these in the context of the recently reported first Laser Interferometer Gravitational-Wave Observatory (LIGO) event detection. We find that the event has a very low probability of arising from a stellar population with initial metallicity mass fraction above Z = 0.010 (Z ≳ 0.5 Z⊙). Binary BH merger events with the reported masses are most likely in populations below 0.008 (Z ≲ 0.4 Z⊙). Events of this kind can occur at all stellar population ages from 3 Myr up to the age of the Universe, but constitute only 0.1-0.4 per cent of binary BH mergers between metallicities of Z = 0.001 and 0.008. However at metallicity Z = 10-4, 26 per cent of binary BH mergers would be expected to have the reported masses. At this metallicity, the progenitor merger times can be close to ≈10 Gyr and rotationally mixed stars evolving through quasi-homogeneous evolution, due to mass transfer in a binary, dominate the rate. The masses inferred for the BHs in the binary progenitor of GW 150914 are amongst the most massive expected at anything but the lowest metallicities in our models. We discuss the implications of our analysis for the electromagnetic follow-up of future LIGO event detections.

  14. Time Shifted PN Codes for CW Lidar, Radar, and Sonar

    Science.gov (United States)

    Campbell, Joel F. (Inventor); Prasad, Narasimha S. (Inventor); Harrison, Fenton W. (Inventor); Flood, Michael A. (Inventor)

    2013-01-01

    A continuous wave Light Detection and Ranging (CW LiDAR) system utilizes two or more laser frequencies and time or range shifted pseudorandom noise (PN) codes to discriminate between the laser frequencies. The performance of these codes can be improved by subtracting out the bias before processing. The CW LiDAR system may be mounted to an artificial satellite orbiting the earth, and the relative strength of the return signal for each frequency can be utilized to determine the concentration of selected gases or other substances in the atmosphere.

  15. Compact binary hashing for music retrieval

    Science.gov (United States)

    Seo, Jin S.

    2014-03-01

    With the huge volume of music clips available for protection, browsing, and indexing, there is an increased attention to retrieve the information contents of the music archives. Music-similarity computation is an essential building block for browsing, retrieval, and indexing of digital music archives. In practice, as the number of songs available for searching and indexing is increased, so the storage cost in retrieval systems is becoming a serious problem. This paper deals with the storage problem by extending the supervector concept with the binary hashing. We utilize the similarity-preserving binary embedding in generating a hash code from the supervector of each music clip. Especially we compare the performance of the various binary hashing methods for music retrieval tasks on the widely-used genre dataset and the in-house singer dataset. Through the evaluation, we find an effective way of generating hash codes for music similarity estimation which improves the retrieval performance.

  16. Binary palmprint representation for feature template protection

    NARCIS (Netherlands)

    Mu, Meiru; Ruan, Qiuqi; Shao, X.; Spreeuwers, Lieuwe Jan; Veldhuis, Raymond N.J.

    2012-01-01

    The major challenge of biometric template protection comes from the intraclass variations of biometric data. The helper data scheme aims to solve this problem by employing the Error Correction Codes (ECC). However, many reported biometric binary features from the same user reach bit error rate (BER)

  17. Binary Arithmetic From Hariot (CA, 1600 A.D.) to the Computer Age.

    Science.gov (United States)

    Glaser, Anton

    This history of binary arithmetic begins with details of Thomas Hariot's contribution and includes specific references to Hariot's manuscripts kept at the British Museum. A binary code developed by Sir Francis Bacon is discussed. Briefly mentioned are contributions to binary arithmetic made by Leibniz, Fontenelle, Gauss, Euler, Benzout, Barlow,…

  18. Quasi-Coherent Noise Jamming to LFM Radar Based on Pseudo-random Sequence Phase-modulation

    Directory of Open Access Journals (Sweden)

    N. Tai

    2015-12-01

    Full Text Available A novel quasi-coherent noise jamming method is proposed against linear frequency modulation (LFM signal and pulse compression radar. Based on the structure of digital radio frequency memory (DRFM, the jamming signal is acquired by the pseudo-random sequence phase-modulation of sampled radar signal. The characteristic of jamming signal in time domain and frequency domain is analyzed in detail. Results of ambiguity function indicate that the blanket jamming effect along the range direction will be formed when jamming signal passes through the matched filter. By flexible controlling the parameters of interrupted-sampling pulse and pseudo-random sequence, different covering distances and jamming effects will be achieved. When the jamming power is equivalent, this jamming obtains higher process gain compared with non-coherent jamming. The jamming signal enhances the detection threshold and the real target avoids being detected. Simulation results and circuit engineering implementation validate that the jamming signal covers real target effectively.

  19. Pseudo-random generator to allow to an electronic pulse simulator the ability to emulate radioisotopes spectra

    International Nuclear Information System (INIS)

    Lucianna F A; Carrillo M A; Mangussi M J

    2012-01-01

    The present work describes the development of a pseudo-random system to provide to a simulator pulse of radiation detectors the ability to emit pulses patterns similar to those recorded when measuring actual radioisotope. The idea is that the system can emulate characteristic spectral distributions of known radioisotopes, as well as creating individual spectra for specific purposes. This design is based on an improvement in terms of software from earlier development that only supplied predefined amplitude pulses at constant intervals (author)

  20. Light Curve Solutions of Eclipsing Binaries in the Large Magellanic Cloud

    Science.gov (United States)

    Rawls, Meredith L.; Rao, M. S.

    2012-01-01

    We present model light curves for nine eclipsing binary stars in the Large Magellanic Cloud (LMC). These systems are detached binaries with nearly circular orbits, and were pseudorandomly selected from three of 21 LMC regions in the Optical Gravitational Lensing Experiment II (OGLE-II) survey. We make use of light curves, orbital periods, and binary classification as reported in Wyrzykowski et al. (2003). We present light curve solutions created with the software PHysics Of Eclipsing BinariEs (PHOEBE, Prsa & Zwitter 2005). Each solution has the best-fit mass ratio q, system inclination i, component temperatures T1 and T2, and modified Kopal potentials Ω1 and Ω2. PHOEBE employs a Nelder & Mead's Simplex fitting method that adjusts all the input parameters to find the best fit to the light curve. Many of the light curves have significant scatter, which can lead to multiple degenerate best-fit solutions, and we discuss what can be done in the future to refine our results, derive global stellar parameters, and place these nine systems in a larger context. We acknowledge the support of the International Research Experience for Students (IRES) program, which is sponsored by the NSF and administered by NSO/GONG.

  1. Eclipsing Binary B-Star Mass Determinations

    Science.gov (United States)

    Townsend, Amanda; Eikenberry, Stephen S.

    2016-01-01

    B-stars in binary pairs provide a laboratory for key astrophysical measurements of massive stars, including key insights for the formation of compact objects (neutron stars and black holes). In their paper, Martayan et al (2004) find 23 Be binary star pairs in NGC2004 in the Large Magellanic Cloud, five of which are both eclipsing and spectroscopic binaries with archival data from VLT-Giraffe and photometric data from MACHO. By using the Wilson eclipsing binary code (e.g., Wilson, 1971), we can determine preliminary stellar masses of the binary components. We present the first results from this analysis. This study also serves as proof-of-concept for future observations with the Photonic Synthesis Telescope Array (Eikenberry et al., in prep) that we are currently building for low-cost, precision spectroscopic observations. With higher resolution and dedicated time for observations, we can follow-up observations of these Be stars as well as Be/X-ray binaries, for improved mass measurements of neutron stars and black holes and better constraints on their origin/formation.

  2. Interacting binary stars

    CERN Document Server

    Sahade, Jorge; Ter Haar, D

    1978-01-01

    Interacting Binary Stars deals with the development, ideas, and problems in the study of interacting binary stars. The book consolidates the information that is scattered over many publications and papers and gives an account of important discoveries with relevant historical background. Chapters are devoted to the presentation and discussion of the different facets of the field, such as historical account of the development in the field of study of binary stars; the Roche equipotential surfaces; methods and techniques in space astronomy; and enumeration of binary star systems that are studied

  3. Binary Masking & Speech Intelligibility

    DEFF Research Database (Denmark)

    Boldt, Jesper

    The purpose of this thesis is to examine how binary masking can be used to increase intelligibility in situations where hearing impaired listeners have difficulties understanding what is being said. The major part of the experiments carried out in this thesis can be categorized as either experime......The purpose of this thesis is to examine how binary masking can be used to increase intelligibility in situations where hearing impaired listeners have difficulties understanding what is being said. The major part of the experiments carried out in this thesis can be categorized as either...... experiments under ideal conditions or as experiments under more realistic conditions useful for real-life applications such as hearing aids. In the experiments under ideal conditions, the previously defined ideal binary mask is evaluated using hearing impaired listeners, and a novel binary mask -- the target...... binary mask -- is introduced. The target binary mask shows the same substantial increase in intelligibility as the ideal binary mask and is proposed as a new reference for binary masking. In the category of real-life applications, two new methods are proposed: a method for estimation of the ideal binary...

  4. Pseudorandom dynamics of frequency combs in free-running quantum cascade lasers

    Science.gov (United States)

    Henry, Nathan; Burghoff, David; Yang, Yang; Hu, Qing; Khurgin, Jacob B.

    2018-01-01

    Recent research has shown that free-running quantum cascade lasers are capable of producing frequency combs in midinfrared and THz regions of the spectrum. Unlike familiar frequency combs originating from mode-locked lasers, these do not require any additional optical elements inside the cavity and have temporal characteristics that are dramatically different from the periodic pulse train of conventional combs. Frequency combs from quantum cascade lasers are characterized by the absence of sharp pulses and strong frequency modulation, periodic with the cavity round trip time but lacking any periodicity within that period. To explicate for this seemingly perplexing behavior, we develop a model of the gain medium using optical Bloch equations that account for hole burning in spectral, spatial, and temporal domains. With this model, we confirm that the most efficient mode of operation of a free-running quantum cascade laser is indeed a pseudorandom frequency-modulated field with nearly constant intensity. We show that the optimum modulation period is commensurate with the gain recovery time of the laser medium and the optimum modulation amplitude is comparable to the gain bandwidth, behavior that has been observed in the experiments.

  5. Text Encryption Scheme Realized with a Chaotic Pseudo-Random Bit Generator

    Directory of Open Access Journals (Sweden)

    Ch. K. Volos

    2013-09-01

    Full Text Available In this work a new encryption scheme, which is realized with a Chaotic Pseudo-Random Bit Generator (CPRBG based on a Logistic map, is presented. The proposed system is used for encrypting text files for the purpose of creating secure data bases. The Logistic map is the most studied discrete nonlinear map because it has been used in many scientific fields. Also, the fact, that this discrete map has a known algebraic distribution, made the Logistic map a good candidate for use in the design of random bit generators. The proposed CPRBG, which is very easily implemented, uses the X-OR function, in the bit sequences, that are produced by two Logistic maps with different initial conditions and system’s parameters, to achieve better results concerning the “randomness” of the produced bits sequence. The detailed results of the statistical testing on generated bit sequences, done by the most well known tests of randomness: the FIPS-140-2 suite tests, confirmed the specific characteristics expected of random bit sequences.

  6. Targeted reduction of highly abundant transcripts using pseudo-random primers.

    Science.gov (United States)

    Arnaud, Ophélie; Kato, Sachi; Poulain, Stéphane; Plessy, Charles

    2016-04-01

    Transcriptome studies based on quantitative sequencing can estimate levels of gene expression by measuring target RNA abundance in sequencing libraries. Sequencing costs are proportional to the total number of sequenced reads, and in order to cover rare RNAs, considerable quantities of abundant and identical reads are needed. This major limitation can be addressed by depleting a proportion of the most abundant sequences from the library. However, such depletion strategies involve either extra handling of the input RNA sample or use of a large number of reverse transcription primers, termed not-so-random (NSR) primers, which are costly to synthesize. Taking advantage of the high tolerance of reverse transcriptase to mis-prime, we found that it is possible to use as few as 40 pseudo-random (PS) reverse transcription primers to decrease the rate of undesirable abundant sequences within a library without affecting the overall transcriptome diversity. PS primers are simple to design and can be used to deplete several undesirable RNAs simultaneously, thus creating a flexible tool for enriching transcriptome libraries for rare transcript sequences.

  7. Novel pseudo-random number generator based on quantum random walks

    Science.gov (United States)

    Yang, Yu-Guang; Zhao, Qian-Qian

    2016-02-01

    In this paper, we investigate the potential application of quantum computation for constructing pseudo-random number generators (PRNGs) and further construct a novel PRNG based on quantum random walks (QRWs), a famous quantum computation model. The PRNG merely relies on the equations used in the QRWs, and thus the generation algorithm is simple and the computation speed is fast. The proposed PRNG is subjected to statistical tests such as NIST and successfully passed the test. Compared with the representative PRNG based on quantum chaotic maps (QCM), the present QRWs-based PRNG has some advantages such as better statistical complexity and recurrence. For example, the normalized Shannon entropy and the statistical complexity of the QRWs-based PRNG are 0.999699456771172 and 1.799961178212329e-04 respectively given the number of 8 bits-words, say, 16Mbits. By contrast, the corresponding values of the QCM-based PRNG are 0.999448131481064 and 3.701210794388818e-04 respectively. Thus the statistical complexity and the normalized entropy of the QRWs-based PRNG are closer to 0 and 1 respectively than those of the QCM-based PRNG when the number of words of the analyzed sequence increases. It provides a new clue to construct PRNGs and also extends the applications of quantum computation.

  8. Surface detection performance evaluation of pseudo-random noise continuous wave laser radar

    Science.gov (United States)

    Mitev, Valentin; Matthey, Renaud; Pereira do Carmo, Joao

    2017-11-01

    A number of space missions (including in the ESA Exploration Programme) foreseen a use of laser radar sensor (or lidar) for determination of range between spacecrafts or between spacecraft and ground surface (altimetry). Such sensors need to be compact, robust and power efficient, at the same time with high detection performance. These requirements can be achieved with a Pseudo-Random Noise continuous wave lidar (PRN cw lidar). Previous studies have pointed to the advantages of this lidar with respect to space missions, but they also identified its limitations in high optical background. The progress of the lasers and the detectors in the near IR spectral range requires a re-evaluation of the PRN cw lidar potential. Here we address the performances of this lidar for surface detection (altimetry) in planetary missions. The evaluation is based on the following system configuration: (i) A cw fiber amplifier as lidar transmitter. The seeding laser exhibits a single-frequency spectral line, with subsequent amplitude modulation. The fiber amplifier allows high output power level, keeping the spectral characteristics and the modulation of the seeding light input. (ii) An avalanche photodiode in photon counting detection; (iii) Measurement scenarios representative for Earth, Mercury and Mars.

  9. A quick and easy improvement of Monte Carlo codes for simulation

    Science.gov (United States)

    Lebrere, A.; Talhi, R.; Tripathy, M.; Pyée, M.

    The simulation of trials of independent random variables of given distribution is a critical element of running Monte-Carlo codes. This is usually performed by using pseudo-random number generators (and in most cases linearcongruential ones). We present here an alternative way to generate sequences with given statistical properties. This sequences are purely deterministic and are given by closed formulae, and can give in some cases better results than classical generators.

  10. Parallelization of a Monte Carlo particle transport simulation code

    Science.gov (United States)

    Hadjidoukas, P.; Bousis, C.; Emfietzoglou, D.

    2010-05-01

    We have developed a high performance version of the Monte Carlo particle transport simulation code MC4. The original application code, developed in Visual Basic for Applications (VBA) for Microsoft Excel, was first rewritten in the C programming language for improving code portability. Several pseudo-random number generators have been also integrated and studied. The new MC4 version was then parallelized for shared and distributed-memory multiprocessor systems using the Message Passing Interface. Two parallel pseudo-random number generator libraries (SPRNG and DCMT) have been seamlessly integrated. The performance speedup of parallel MC4 has been studied on a variety of parallel computing architectures including an Intel Xeon server with 4 dual-core processors, a Sun cluster consisting of 16 nodes of 2 dual-core AMD Opteron processors and a 200 dual-processor HP cluster. For large problem size, which is limited only by the physical memory of the multiprocessor server, the speedup results are almost linear on all systems. We have validated the parallel implementation against the serial VBA and C implementations using the same random number generator. Our experimental results on the transport and energy loss of electrons in a water medium show that the serial and parallel codes are equivalent in accuracy. The present improvements allow for studying of higher particle energies with the use of more accurate physical models, and improve statistics as more particles tracks can be simulated in low response time.

  11. Binary effectivity rules

    DEFF Research Database (Denmark)

    Keiding, Hans; Peleg, Bezalel

    2006-01-01

    effectivity rule is regular if it is the effectivity rule of some regular binary SCR. We characterize completely the family of regular binary effectivity rules. Quite surprisingly, intrinsically defined von Neumann-Morgenstern solutions play an important role in this characterization...

  12. Binary colloidal crystals

    NARCIS (Netherlands)

    Christova-Zdravkova, C.G.

    2005-01-01

    Binary crystals are crystals composed of two types of particles having different properties like size, mass density, charge etc. In this thesis several new approaches to make binary crystals of colloidal particles that differ in size, material and charge are reported We found a variety of crystal

  13. Formation and Evolution of Binary Systems Containing Collapsed Stars

    Science.gov (United States)

    Rappaport, Saul; West, Donald (Technical Monitor)

    2003-01-01

    This research includes theoretical studies of the formation and evolution of five types of interacting binary systems. Our main focus has been on developing a number of comprehensive population synthesis codes to study the following types of binary systems: (i) cataclysmic variables (#3, #8, #12, #15), (ii) low- and intermediate-mass X-ray binaries (#13, #20, #21), (iii) high-mass X-ray binaries (#14, #17, #22), (iv) recycled binary millisecond pulsars in globular clusters (#5, #10, #ll), and (v) planetary nebulae which form in interacting binaries (#6, #9). The numbers in parentheses refer to papers published or in preparation that are listed in this paper. These codes take a new unified approach to population synthesis studies. The first step involves a Monte Carlo selection of the primordial binaries, including the constituent masses, and orbital separations and eccentricities. Next, a variety of analytic methods are used to evolve the primary star to the point where either a dynamical episode of mass transfer to the secondary occurs (the common envelope phase), or the system evolves down an alternate path. If the residual core of the primary is greater than 2.5 solar mass, it will evolve to Fe core collapse and the production of a neutron star and a supernova explosion. In the case of systems involving neutron stars, a kick velocity is chosen randomly from an appropriate distribution and added to the orbital dynamics which determine the state of the binary system after the supernova explosion. In the third step, all binaries which commence stable mass transfer from the donor star (the original secondary in the binary system) to the compact object, are followed with a detailed binary evolution code. Finally, we include all the relevant dynamics of the binary system. For example, in the case of LMXBs, the binary system, with its recoil velocity from the supernova explosion, is followed in time through its path in the Galactic potential. For our globular cluster

  14. Rotation invariant deep binary hashing for fast image retrieval

    Science.gov (United States)

    Dai, Lai; Liu, Jianming; Jiang, Aiwen

    2017-07-01

    In this paper, we study how to compactly represent image's characteristics for fast image retrieval. We propose supervised rotation invariant compact discriminative binary descriptors through combining convolutional neural network with hashing. In the proposed network, binary codes are learned by employing a hidden layer for representing latent concepts that dominate on class labels. A loss function is proposed to minimize the difference between binary descriptors that describe reference image and the rotated one. Compared with some other supervised methods, the proposed network doesn't have to require pair-wised inputs for binary code learning. Experimental results show that our method is effective and achieves state-of-the-art results on the CIFAR-10 and MNIST datasets.

  15. BINARY MINOR PLANETS

    Data.gov (United States)

    National Aeronautics and Space Administration — The data set lists orbital and physical properties for well-observed or suspected binary/multiple minor planets including the Pluto system, compiled from the...

  16. Close binary stars

    International Nuclear Information System (INIS)

    Larsson-Leander, G.

    1979-01-01

    Studies of close binary stars are being persued more vigorously than ever, with about 3000 research papers and notes pertaining to the field being published during the triennium 1976-1978. Many major advances and spectacular discoveries were made, mostly due to increased observational efficiency and precision, especially in the X-ray, radio, and ultraviolet domains. Progress reports are presented in the following areas: observational techniques, methods of analyzing light curves, observational data, physical data, structure and models of close binaries, statistical investigations, and origin and evolution of close binaries. Reports from the Coordinates Programs Committee, the Committee for Extra-Terrestrial Observations and the Working Group on RS CVn binaries are included. (Auth./C.F.)

  17. On the short-term predictability of fully digital chaotic oscillators for pseudo-random number generation

    KAUST Repository

    Radwan, Ahmed Gomaa

    2014-06-18

    This paper presents a digital implementation of a 3rd order chaotic system using the Euler approximation. Short-term predictability is studied in relation to system precision, Euler step size and attractor size and optimal parameters for maximum performance are derived. Defective bits from the native chaotic output are neglected and the remaining pass the NIST SP. 800-22 tests without post-processing. The resulting optimized pseudorandom number generator has throughput up to 17.60 Gbits/s for a 64-bit design experimentally verified on a Xilinx Virtex 4 FPGA with logic utilization less than 1.85%.

  18. Binary and ternary systems

    International Nuclear Information System (INIS)

    Petrov, D.A.

    1986-01-01

    Conditions for thermodynamical equilibrium in binary and ternary systems are considered. Main types of binary and ternary system phase diagrams are sequently constructed on the basis of general regularities on the character of transition from one equilibria to others. New statements on equilibrium line direction in the diagram triple points and their isothermal cross sections are developed. New represenations on equilibria in case of monovariant curve minimum and maximum on three-phase equilibrium formation in ternary system are introduced

  19. Binary and Millisecond Pulsars

    OpenAIRE

    Lorimer, D. R.

    2005-01-01

    We review the main properties, demographics and applications of binary and millisecond radio pulsars. Our knowledge of these exciting objects has greatly increased in recent years, mainly due to successful surveys which have brought the known pulsar population to over 1800. There are now 83 binary and millisecond pulsars associated with the disk of our Galaxy, and a further 140 pulsars in 26 of the Galactic globular clusters. Recent highlights include the discovery of the young relativistic b...

  20. Astrophysics of white dwarf binaries

    NARCIS (Netherlands)

    Nelemans, G.A.

    2006-01-01

    White dwarf binaries are the most common compact binaries in the Universe and are especially important for low-frequency gravitational wave detectors such as LISA. There are a number of open questions about binary evolution and the Galactic population of white dwarf binaries that can be solved using

  1. Evolution of cataclysmic binaries

    International Nuclear Information System (INIS)

    Paczynski, B.

    1981-01-01

    Cataclysmic binaries with short orbital periods have low mass secondary components. Their nuclear time scale is too long to be of evolutionary significance. Angular momentum loss from the binary drives the mass transfer between the two components. As long as the characteristic time scale is compared with the Kelvin-Helmholtz time scale of the mass losing secondary the star remains close to the main sequence, and the binary period decreases with time. If angular momentum loss is due to gravitational radiation then the mass transfer time scale becomes comparable to the Kelvin-Helmoltz time scale when the secondary's mass decreases to 0.12 Msub(sun), and the binary period is reduced to 80 minutes. Later, the mass losing secondary departs from the main sequence and gradually becomes degenerate. Now the orbital period increases with time. The observed lower limit to the orbital periods of hydrogen rich cataclysmic binaries implies that gravitational radiation is the main driving force for the evolution of those systems. It is shown that binaries emerging from a common envelope phase of evolution are well detached. They have to lose additional angular momentum to become semidetached cataclysmic variables. (author)

  2. Contamination of RR Lyrae stars from Binary Evolution Pulsators

    Science.gov (United States)

    Karczmarek, Paulina; Pietrzyński, Grzegorz; Belczyński, Krzysztof; Stępień, Kazimierz; Wiktorowicz, Grzegorz; Iłkiewicz, Krystian

    2016-06-01

    Binary Evolution Pulsator (BEP) is an extremely low-mass member of a binary system, which pulsates as a result of a former mass transfer to its companion. BEP mimics RR Lyrae-type pulsations but has different internal structure and evolution history. We present possible evolution channels to produce BEPs, and evaluate the contamination value, i.e. how many objects classified as RR Lyrae stars can be undetected BEPs. In this analysis we use population synthesis code StarTrack.

  3. Pseudo-random data acquisition geometry in 3D seismic survey; Sanjigen jishin tansa ni okeru giji random data shutoku reiauto ni tsuite

    Energy Technology Data Exchange (ETDEWEB)

    Minegishi, M.; Tsuburaya, Y. [Japan National Oil Corp., Tokyo (Japan). Technology Research Center

    1996-10-01

    Influence of pseudo-random geometry on the imaging for 3D seismic exploration data acquisition has been investigate using a simple model by comparing with the regular geometry. When constituting wave front by the interference of elemental waves, pseudo-random geometry data did not always provide good results. In the case of a point diffractor, the imaging operation, where the constituted wave front was returned to the point diffractor by the interference of elemental waves for the spatial alias records, did not always give clear images. In the case of multi point diffractor, good images were obtained with less noise generation in spite of alias records. There are a lot of diffractors in the actual geological structures, which corresponds to the case of multi point diffractors. Finally, better images could be obtained by inputting records acquired using the pseudo-random geometry rather than by inputting spatial alias records acquired using the regular geometry. 7 refs., 6 figs.

  4. Runaway stars from young star clusters containing initial binaries. I. Equal-mass, equal-energy binaries

    Energy Technology Data Exchange (ETDEWEB)

    Leonard, P.J.T.; Duncan, M.J.

    1988-07-01

    The production of runaway stars by the dynamical-ejection mechanism in an open star cluster containing 50 percent binaries of equal mass and energy is investigated theoretically by means of numerical simulations using the NBODY5 code of Aarseth (1985). The construction of the models is outlined, and the results are presented graphically and characterized in detail. It is shown that binary-binary collisions capable of producing runaways can occur (via formation and disruption, with some stellar collisions, of hierarchical double binaries) in clusters of relatively low density (e.g., pc-sized clusters of O or B stars). The frequency of binaries in the runaway population is found to vary between 0 and 50 percent, with the majority of runaways being unevolved early-type stars. 38 references.

  5. ``Supermassive Black-Hole Binaries in Merging Cusps''

    Science.gov (United States)

    Milosavljevic, M.; Merritt, D.

    2000-12-01

    We present N-body simulations of the formation and evolution of supermassive black-hole binaries in galactic nuclei. Initial conditions are drawn from a tree-code simulation of the merger of two spherical galaxies containing central point masses and ρ ~ r-2 central density cusps. Once the two black holes form a bound pair at the center of the merged galaxies, the evolution is continued using the Aarseth/Spurzem parallel tree code NBODY6++ at much higher resolution. Immediately following the formation of a hard black-hole binary, the density cusp of the merged galaxies is nearly homologous to the cusps in the initial galaxies. However the central density decreases rapidly as the binary black hole ejects stars which pass near to it, reducing the slope of the cusp from ~ r-2 to ~ r-1. When the distance between the black holes becomes comparable to the average stellar separation in the cusp, the binary begins to wander about the center while engaging in hard encounters with stars on radial orbits that are ejected at high speed. Ejection induces further shrinking of the binary at a decreasing rate. We discuss the dynamics of black hole binaries in the limit of large N, appropriate to real galactic nuclei, and discuss the possibility that supermassive black hole binaries can survive over cosmological times.

  6. Binary Neutron Star Mergers

    Directory of Open Access Journals (Sweden)

    Joshua A. Faber

    2012-07-01

    Full Text Available We review the current status of studies of the coalescence of binary neutron star systems. We begin with a discussion of the formation channels of merging binaries and we discuss the most recent theoretical predictions for merger rates. Next, we turn to the quasi-equilibrium formalisms that are used to study binaries prior to the merger phase and to generate initial data for fully dynamical simulations. The quasi-equilibrium approximation has played a key role in developing our understanding of the physics of binary coalescence and, in particular, of the orbital instability processes that can drive binaries to merger at the end of their lifetimes. We then turn to the numerical techniques used in dynamical simulations, including relativistic formalisms, (magneto-hydrodynamics, gravitational-wave extraction techniques, and nuclear microphysics treatments. This is followed by a summary of the simulations performed across the field to date, including the most recent results from both fully relativistic and microphysically detailed simulations. Finally, we discuss the likely directions for the field as we transition from the first to the second generation of gravitational-wave interferometers and while supercomputers reach the petascale frontier.

  7. Skewed Binary Search Trees

    DEFF Research Database (Denmark)

    Brodal, Gerth Stølting; Moruz, Gabriel

    2006-01-01

    It is well-known that to minimize the number of comparisons a binary search tree should be perfectly balanced. Previous work has shown that a dominating factor over the running time for a search is the number of cache faults performed, and that an appropriate memory layout of a binary search tree...... can reduce the number of cache faults by several hundred percent. Motivated by the fact that during a search branching to the left or right at a node does not necessarily have the same cost, e.g. because of branch prediction schemes, we in this paper study the class of skewed binary search trees....... For all nodes in a skewed binary search tree the ratio between the size of the left subtree and the size of the tree is a fixed constant (a ratio of 1/2 gives perfect balanced trees). In this paper we present an experimental study of various memory layouts of static skewed binary search trees, where each...

  8. Modelling binary data

    CERN Document Server

    Collett, David

    2002-01-01

    INTRODUCTION Some Examples The Scope of this Book Use of Statistical Software STATISTICAL INFERENCE FOR BINARY DATA The Binomial Distribution Inference about the Success Probability Comparison of Two Proportions Comparison of Two or More Proportions MODELS FOR BINARY AND BINOMIAL DATA Statistical Modelling Linear Models Methods of Estimation Fitting Linear Models to Binomial Data Models for Binomial Response Data The Linear Logistic Model Fitting the Linear Logistic Model to Binomial Data Goodness of Fit of a Linear Logistic Model Comparing Linear Logistic Models Linear Trend in Proportions Comparing Stimulus-Response Relationships Non-Convergence and Overfitting Some other Goodness of Fit Statistics Strategy for Model Selection Predicting a Binary Response Probability BIOASSAY AND SOME OTHER APPLICATIONS The Tolerance Distribution Estimating an Effective Dose Relative Potency Natural Response Non-Linear Logistic Regression Models Applications of the Complementary Log-Log Model MODEL CHECKING Definition of Re...

  9. Evolution of dwarf binaries

    International Nuclear Information System (INIS)

    Tutukov, A.V.; Fedorova, A.V.; Yungel'son, L.R.

    1982-01-01

    The conditions of mass exchange in close binary systems with masses of components less or equal to one solar mass have been analysed for the case, when the system radiates gravitational waves. It has been shown that the mass exchange rate depends in a certain way on the mass ratio of components and on the mass of component that fills its inner critical lobe. The comparison of observed periods, masses of contact components, and mass exchange rates of observed cataclysmic binaries have led to the conclusion that the evolution of close binaries WZ Sge, OY Car, Z Cha, TT Ari, 2A 0311-227, and G 61-29 may be driven by the emission of gravitational waves [ru

  10. Evolution of dwarf binaries

    International Nuclear Information System (INIS)

    Tutukov, A.V.; Fedorova, A.V.; Yungel'son, L.R.

    1982-01-01

    The circumstances of mass exchange in close binary systems whose components have a mass < or approx. =1 M/sub sun/ are analyzed for the case where the system is losing orbital angular momentum by radiation of gravitational waves. The mass exchange rate will depend on the mass ratio of the components and on the mass of the component that is overfilling its critical Roche lobe. A comparison of the observed orbital periods, masses of the components losing material, and mass exchange rates against the theoretical values for cataclysmic binaries indicates that the evolution of the close binaries WZ Sge, OY Car, Z Cha, TT Ari, 2A 0311-227, and G61-29 may be driven by the emission of gravitational waves

  11. Binary and Millisecond Pulsars

    Directory of Open Access Journals (Sweden)

    Lorimer Duncan R.

    2008-11-01

    Full Text Available We review the main properties, demographics and applications of binary and millisecond radio pulsars. Our knowledge of these exciting objects has greatly increased in recent years, mainly due to successful surveys which have brought the known pulsar population to over 1800. There are now 83 binary and millisecond pulsars associated with the disk of our Galaxy, and a further 140 pulsars in 26 of the Galactic globular clusters. Recent highlights include the discovery of the young relativistic binary system PSR J1906+0746, a rejuvination in globular cluster pulsar research including growing numbers of pulsars with masses in excess of 1.5M_⊙, a precise measurement of relativistic spin precession in the double pulsar system and a Galactic millisecond pulsar in an eccentric (e = 0.44 orbit around an unevolved companion.

  12. The Brightest Binaries

    Science.gov (United States)

    Vanbeveren, D., Van Rensbergen, W., De Loore, C.

    Massive stars are distributed all over the upper part of the Hertzsprung-Russell diagram according to their subsequent phases of stellar evolution from main sequence to supernova. Massive stars may either be single or they may be a component of a close binary. The observed single star/binary frequency is known only in a small part of the Galaxy. Whether this holds for the whole galaxy or for the whole cosmos is questionable and needs many more high quality observations. Massive star evolution depends critically on mass loss by stellar wind and this stellar wind mass loss may change dramatically when stars evolve from one phase to another. We start the book with a critical discussion of observations of the different types of massive stars, observations that are of fundamental importance in relation to stellar evolution, with special emphasis on mass loss by stellar wind. We update our knowledge of the physics that models the structure and evolution of massive single stars and we present new calculations. The conclusions resulting from a comparison between these calculations and observations are then used to study the evolution of massive binaries. This book provides our current knowledge of a great variety of massive binaries, and hence of a great variety of evolutionary phases. A large number of case studies illustrates the existence of these phases. Finally, we present the results of massive star population number synthesis, including the effect of binaries. The results indicate that neglecting them leads to a conclusion which may be far from reality. This book is written for researchers in massive star evolution. We hope that, after reading this book, university-level astrophysics students will become fascinated by the exciting world of the `Brightest Binaries'.

  13. Study on random number generator in Monte Carlo code

    International Nuclear Information System (INIS)

    Oya, Kentaro; Kitada, Takanori; Tanaka, Shinichi

    2011-01-01

    The Monte Carlo code uses a sequence of pseudo-random numbers with a random number generator (RNG) to simulate particle histories. A pseudo-random number has its own period depending on its generation method and the period is desired to be long enough not to exceed the period during one Monte Carlo calculation to ensure the correctness especially for a standard deviation of results. The linear congruential generator (LCG) is widely used as Monte Carlo RNG and the period of LCG is not so long by considering the increasing rate of simulation histories in a Monte Carlo calculation according to the remarkable enhancement of computer performance. Recently, many kinds of RNG have been developed and some of their features are better than those of LCG. In this study, we investigate the appropriate RNG in a Monte Carlo code as an alternative to LCG especially for the case of enormous histories. It is found that xorshift has desirable features compared with LCG, and xorshift has a larger period, a comparable speed to generate random numbers, a better randomness, and good applicability to parallel calculation. (author)

  14. Encounters of binaries

    International Nuclear Information System (INIS)

    Mikkola, S.

    1983-01-01

    Gravitational encounters of pairs of binaries have been studied numerically. Various cross-sections have been calculated for qualitative final results of the interaction and for energy transfer between the binding energy and the centre of mass kinetic energy. The distribution of the kinetic energies, resulting from the gravitational collision, were found to be virtually independent of the impact velocity in the case of collision of hard binaries. It was found that one out of five collisions, which are not simple fly-by's, leads to the formation of a stable three-body system. (author)

  15. Binary and Millisecond Pulsars

    Directory of Open Access Journals (Sweden)

    Duncan R. Lorimer

    1998-09-01

    Full Text Available Our knowledge of binary and millisecond pulsars has greatly increased in recent years. This is largely due to the success of large-area surveys which have brought the known population of such systems in the Galactic disk to around 50. As well as being interesting as a population of astronomical sources, many pulsars turn out to be superb celestial clocks. In this review we summarise the main properties of binary and millisecond pulsars and highlight some of their applications to relativistic astrophysics.

  16. Binary and Millisecond Pulsars

    Directory of Open Access Journals (Sweden)

    Lorimer Duncan R.

    2005-11-01

    Full Text Available We review the main properties, demographics and applications of binary and millisecond radio pulsars. Our knowledge of these exciting objects has greatly increased in recent years, mainly due to successful surveys which have brought the known pulsar population to over 1700. There are now 80 binary and millisecond pulsars associated with the disk of our Galaxy, and a further 103 pulsars in 24 of the Galactic globular clusters. Recent highlights have been the discovery of the first ever double pulsar system and a recent flurry of discoveries in globular clusters, in particular Terzan 5.

  17. Asteroseismic modelling of the Binary HD 176465

    Directory of Open Access Journals (Sweden)

    Nsamba B.

    2017-01-01

    Full Text Available The detection and analysis of oscillations in binary star systems is critical in understanding stellar structure and evolution. This is partly because such systems have the same initial chemical composition and age. Solar-like oscillations have been detected by Kepler in both components of the asteroseismic binary HD 176465. We present an independent modelling of each star in this binary system. Stellar models generated using MESA (Modules for Experiments in Stellar Astrophysics were fitted to both the observed individual frequencies and complementary spectroscopic parameters. The individual theoretical oscillation frequencies for the corresponding stellar models were obtained using GYRE as the pulsation code. A Bayesian approach was applied to find the probability distribution functions of the stellar parameters using AIMS (Asteroseismic Inference on a Massive Scale as the optimisation code. The ages of HD 176465 A and HD 176465 B were found to be 2.81 ± 0.48 Gyr and 2.52 ± 0.80 Gyr, respectively. These results are in agreement when compared to previous studies carried out using other asteroseismic modelling techniques and gyrochronology.

  18. Binary Stochastic Representations for Large Multi-class Classification

    KAUST Repository

    Gerald, Thomas

    2017-10-23

    Classification with a large number of classes is a key problem in machine learning and corresponds to many real-world applications like tagging of images or textual documents in social networks. If one-vs-all methods usually reach top performance in this context, these approaches suffer of a high inference complexity, linear w.r.t. the number of categories. Different models based on the notion of binary codes have been proposed to overcome this limitation, achieving in a sublinear inference complexity. But they a priori need to decide which binary code to associate to which category before learning using more or less complex heuristics. We propose a new end-to-end model which aims at simultaneously learning to associate binary codes with categories, but also learning to map inputs to binary codes. This approach called Deep Stochastic Neural Codes (DSNC) keeps the sublinear inference complexity but do not need any a priori tuning. Experimental results on different datasets show the effectiveness of the approach w.r.t. baseline methods.

  19. Studies of Gas Disks in Binary Systems

    Science.gov (United States)

    de Val-Borro, Miguel

    There are over 300 exoplanets detected through radial velocity surveys and photometric studies showing a tremendous variety of masses, compositions and orbital parameters. Understanding the way these planets formed and evolved within the circumstellar disks they were initially embedded in is a crucial issue. In the first part of this thesis we study the physical interaction between a gaseous protoplanetary disk and an embedded planet using numerical simulations. In order to trust the results from simulations it is important to compare different methods. However, the standard test problems for hydrodynamic codes differ considerably from the case of a protoplanetary disk interacting with an embedded planet. We have carried out a code comparison in which the problem of a massive planet in a protoplanetary disk was studied with various numerical schemes. We compare the surface density, potential vorticity and azimuthally averaged density profiles at several times. There is overall good agreement between our codes for Neptune and Jupiter-sized planets. We performed simulations for each planet in an inviscid disk and including physical viscosity. The surface density profiles agree within about 5% for the grid-based schemes while the particle codes have less resolution in the low density regions and weaker spiral wakes. In Paper II, we study hydrodynamical instabilities in disks with planets. Vortices are generated close to the gap in our numerical models in agreement with the linear modal analysis. The vortices exert strong perturbations on the planet as they move along the gap and can change its migration rate. In addition, disk viscosity can be modified by the presence of vortices. The last part of this thesis studies the mass transfer in symbiotic binaries and close T Tauri binary systems. Our simulations of gravitationally focused wind accretion in binary systems show the formation of stream flows and enhanced accretion rates onto the compact component.

  20. Pseudo-Random Number Generation in Children with High-Functioning Autism and Asperger's Disorder: Further Evidence for a Dissociation in Executive Functioning?

    Science.gov (United States)

    Rinehart, Nicole J.; Bradshaw, John L.; Moss, Simon A.; Brereton, Avril V.; Tonge, Bruce J.

    2006-01-01

    The repetitive, stereotyped and obsessive behaviours, which are core diagnostic features of autism, are thought to be underpinned by executive dysfunction. This study examined executive impairment in individuals with autism and Asperger's disorder using a verbal equivalent of an established pseudo-random number generating task. Different patterns…

  1. Efficient implementation of Bailey and Borwein pseudo-random number generator based on normal numbers

    Science.gov (United States)

    Beliakov, G.; Creighton, D.; Johnstone, M.; Wilkin, T.

    2013-08-01

    This paper describes an implementation of a Linear Congruential Generator (LCG) based on the binary representation of the normal number α, and of a combined generator based on that LCG. The base LCG with the modulus 333 provides a quality sequence with the period ≈3.7ṡ1015, which passes all but two statistical tests from BigCrush test suite. We improved on the original implementation by adapting Barrett's modular reduction method, which resulted in four-fold increase in efficiency. The combined generator has the period of ≈1023 and passes all tests from BigCrush suite.

  2. A Novel Hardware Efficient Reconfigurable 32-Bit Arithmetic Unit for Binary, BCD and Floating Point Operands

    OpenAIRE

    Mohit Tyagi,; Kavita Khare

    2011-01-01

    This paper provides the details for novel adder/subtractor arithmetic unit that combines Binary, Binary Code Decimal (BCD) and single precision Binary floating point operations in a single structure. The unit is able to perform effective addition-subtraction operations on unsigned, sign-magnitude, and various complement representations. The design is runtime reconfigurable or can be implemented in ASIC as a runtime configurable unit and maximum utilization of hardware resource are the feature...

  3. Interacting binary stars

    International Nuclear Information System (INIS)

    Pringle, J.E.; Wade, R.A.

    1985-01-01

    This book reviews the theoretical and observational knowledge of interacting binary stars. The topics discussed embrace the following features of these objects: their orbits, evolution, mass transfer, angular momentum losses, X-ray emission, eclipses, variability, and other related phenomena. (U.K.)

  4. Equational binary decision diagrams

    NARCIS (Netherlands)

    J.F. Groote (Jan Friso); J.C. van de Pol (Jaco)

    2000-01-01

    textabstractWe incorporate equations in binary decision diagrams (BDD). The resulting objects are called EQ-BDDs. A straightforward notion of ordered EQ-BDDs (EQ-OBDD) is defined, and it is proved that each EQ-BDD is logically equivalent to an EQ-OBDD. Moreover, on EQ-OBDDs satisfiability and

  5. N-Bit Binary Resistor

    Science.gov (United States)

    Tcheng, Ping

    1989-01-01

    Binary resistors in series tailored to precise value of resistance. Desired value of resistance obtained by cutting appropriate traces across resistors. Multibit, binary-based, adjustable resistor with high resolution used in many applications where precise resistance required.

  6. Coding Partitions

    Directory of Open Access Journals (Sweden)

    Fabio Burderi

    2007-05-01

    Full Text Available Motivated by the study of decipherability conditions for codes weaker than Unique Decipherability (UD, we introduce the notion of coding partition. Such a notion generalizes that of UD code and, for codes that are not UD, allows to recover the ``unique decipherability" at the level of the classes of the partition. By tacking into account the natural order between the partitions, we define the characteristic partition of a code X as the finest coding partition of X. This leads to introduce the canonical decomposition of a code in at most one unambiguouscomponent and other (if any totally ambiguouscomponents. In the case the code is finite, we give an algorithm for computing its canonical partition. This, in particular, allows to decide whether a given partition of a finite code X is a coding partition. This last problem is then approached in the case the code is a rational set. We prove its decidability under the hypothesis that the partition contains a finite number of classes and each class is a rational set. Moreover we conjecture that the canonical partition satisfies such a hypothesis. Finally we consider also some relationships between coding partitions and varieties of codes.

  7. Coding Class

    DEFF Research Database (Denmark)

    Ejsing-Duun, Stine; Hansbøl, Mikala

    Sammenfatning af de mest væsentlige pointer fra hovedrapporten: Dokumentation og evaluering af Coding Class......Sammenfatning af de mest væsentlige pointer fra hovedrapporten: Dokumentation og evaluering af Coding Class...

  8. The maximum number of minimal codewords in long codes

    DEFF Research Database (Denmark)

    Alahmadi, A.; Aldred, R.E.L.; dela Cruz, R.

    2013-01-01

    Upper bounds on the maximum number of minimal codewords in a binary code follow from the theory of matroids. Random coding provides lower bounds. In this paper, we compare these bounds with analogous bounds for the cycle code of graphs. This problem (in the graphic case) was considered in 1981...

  9. Black holes in binary stars

    NARCIS (Netherlands)

    Wijers, R.A.M.J.

    1996-01-01

    Introduction Distinguishing neutron stars and black holes Optical companions and dynamical masses X-ray signatures of the nature of a compact object Structure and evolution of black-hole binaries High-mass black-hole binaries Low-mass black-hole binaries Low-mass black holes Formation of black holes

  10. Discovery of a Faint Eclipsing Binary GSC 02265-01456 DF Guo1, K ...

    Indian Academy of Sciences (India)

    Abstract. When observing the transiting extrasolar planets, we found a new eclipsing binary named GSC 02265-01456. The V and Rc obser- vations were carried out for this binary. The photometric light curves of the two bands were simultaneously analyzed using the W–D code. The solutions show that GSC 02265-01456 ...

  11. Extracting biometric binary strings with minimal area under the FRR curve for the hamming distance classifier

    NARCIS (Netherlands)

    Chen, C.; Veldhuis, Raymond N.J.

    Extracting binary strings from real-valued biometric templates is a fundamental step in template compression and protection systems, such as fuzzy commitment, fuzzy extractor, secure sketch and helper data systems. Quantization and coding are the straightforward way to extract binary representations

  12. Propagation of pulse pseudorandom signals from a shelf into shallow water in winter hydrological conditions of the Sea of Japan

    Science.gov (United States)

    Morgunov, Yu. N.; Burenin, A. V.; Besotvetnykh, V. V.; Golov, A. A.

    2017-11-01

    The paper discusses the results of an experiment conducted in the Sea of Japan in March 2016 on an acoustic track 194 km long under winter hydrological conditions. We have studied the most complex case of propagation of pulse pseudorandom signals from the shelf into shallow water during vortex generation on the acoustic track. Analysis of the experimentally obtained pulse characteristics have shown that the maximum first approach of acoustic energy recorded at all points agrees well with the calculation. This testifies to the fact that at a given reception depth, the first to arrive are pulses that have passed in the near-surface sound channel over the shortest distance and at small angles close to zero. We propose a technique for calculating the mean sound velocity on the track from satellite monitoring data on the surface temperature, which makes it possible to rely on the successful application of the results obtained in acoustic ranging and navigation problems.

  13. Mismatch negativity to single and multiple pitch-deviant tones in regular and pseudo-random complex tone sequences.

    Science.gov (United States)

    Vaz Pato, M; Jones, S J; Perez, N; Sprague, L

    2002-04-01

    To determine whether the process responsible for the mismatch negativity (MMN) might be involved in the analysis of temporal sound patterns for information. Synthesized musical instrument tones of 'clarinet' timbre were delivered in a continuous sequence at 16 tones/s, such that there was virtually no N1 potential to each individual tone. The standard sequence comprised 4 or 5 adjacent notes of the diatonic scale, presented either as a regularly repeated, rising pattern or pseudo-randomly. The deviant stimuli were 1-5 consecutive tones of higher pitch than the standards. A MMN was evoked by a single deviant tone, 1 or 5 semitones above the pitch range of the standards. The response to the 5-semitone deviant was significantly larger (mean of 7.3 microV) when the standard pattern was regular as compared with pseudo-random. The MMN latency, on the other hand, was only influenced by the magnitude of pitch deviation. A second MMN was evoked by a second deviant tone, immediately (SOA 62.5 ms) following the first. Further consecutive MMNs were not consistently evoked. The large amplitude of these MMNs can be attributed to the use of complex tones, continuous presentation and a rapid rate of pitch changes, such that no waveform subtraction was required. Over and above the probability with which each individual tone occurs in the standard sequence, the mismatch process is influenced by its temporal structure, i.e. can be regarded as a temporal pattern analyzer. Contrary to the findings of some other groups, we found that two consecutive deviants can evoke an MMN, even at high rates of presentation such that both occur within the postulated 'temporal window of integration' of ca. 170 ms. These findings suggest that the mismatch process might be involved in the extraction of sequential information from repetitive and non-repetitive sound patterns.

  14. Device for logarithmic representation of binary numbers in analog form

    International Nuclear Information System (INIS)

    Georgiev, A.; Zhuravlev, N.I.; Zinov, V.G.; Salamatin, A.V.

    1986-01-01

    A logarithmic converter is described in which the mantissa of the logarithm is obtained from the values of several more-significant bits of a binary number with the aid of a table stored in read-only memory. The obtained codes are then put into analog form by a digital-analog converter. The error for 16-bit numbers is 0.17%

  15. Analysis and Design of Binary Message-Passing Decoders

    DEFF Research Database (Denmark)

    Lechner, Gottfried; Pedersen, Troels; Kramer, Gerhard

    2012-01-01

    Binary message-passing decoders for low-density parity-check (LDPC) codes are studied by using extrinsic information transfer (EXIT) charts. The channel delivers hard or soft decisions and the variable node decoder performs all computations in the L-value domain. A hard decision channel results i...

  16. Binary gabor statistical features for palmprint template protection

    NARCIS (Netherlands)

    Mu, Meiru; Ruan, Qiuqi; Shao, X.; Spreeuwers, Lieuwe Jan; Veldhuis, Raymond N.J.

    2012-01-01

    The biometric template protection system requires a highquality biometric channel and a well-designed error correction code (ECC). Due to the intra-class variations of biometric data, an efficient fixed-length binary feature extractor is required to provide a high-quality biometric channel so that

  17. EXIT Chart Analysis of Binary Message-Passing Decoders

    DEFF Research Database (Denmark)

    Lechner, Gottfried; Pedersen, Troels; Kramer, Gerhard

    2007-01-01

    Binary message-passing decoders for LDPC codes are analyzed using EXIT charts. For the analysis, the variable node decoder performs all computations in the L-value domain. For the special case of a hard decision channel, this leads to the well know Gallager B algorithm, while the analysis can...

  18. Discovery of a Faint Eclipsing Binary GSC 02265-01456

    Indian Academy of Sciences (India)

    2016-01-27

    Jan 27, 2016 ... ... of the two bands were simultaneously analyzed using the W–D code. The solutions show that GSC 02265-01456 is an extremely low mass ratio ( = 0.087) overcontact binary system with a contact degree of = 82.5%. The difference between the two maxima of the light curve can be explained by a dark ...

  19. Compressing Binary Decision Diagrams

    DEFF Research Database (Denmark)

    Hansen, Esben Rune; Satti, Srinivasa Rao; Tiedemann, Peter

    2008-01-01

    The paper introduces a new technique for compressing Binary Decision Diagrams in those cases where random access is not required. Using this technique, compression and decompression can be done in linear time in the size of the BDD and compression will in many cases reduce the size of the BDD to ......-2 bits per node. Empirical results for our compression technique are presented, including comparisons with previously introduced techniques, showing that the new technique dominate on all tested instances......The paper introduces a new technique for compressing Binary Decision Diagrams in those cases where random access is not required. Using this technique, compression and decompression can be done in linear time in the size of the BDD and compression will in many cases reduce the size of the BDD to 1...

  20. Compressing Binary Decision Diagrams

    DEFF Research Database (Denmark)

    Rune Hansen, Esben; Srinivasa Rao, S.; Tiedemann, Peter

    The paper introduces a new technique for compressing Binary Decision Diagrams in those cases where random access is not required. Using this technique, compression and decompression can be done in linear time in the size of the BDD and compression will in many cases reduce the size of the BDD to ......-2 bits per node. Empirical results for our compression technique are presented, including comparisons with previously introduced techniques, showing that the new technique dominate on all tested instances.......The paper introduces a new technique for compressing Binary Decision Diagrams in those cases where random access is not required. Using this technique, compression and decompression can be done in linear time in the size of the BDD and compression will in many cases reduce the size of the BDD to 1...

  1. Parametric binary dissection

    Science.gov (United States)

    Bokhari, Shahid H.; Crockett, Thomas W.; Nicol, David M.

    1993-01-01

    Binary dissection is widely used to partition non-uniform domains over parallel computers. This algorithm does not consider the perimeter, surface area, or aspect ratio of the regions being generated and can yield decompositions that have poor communication to computation ratio. Parametric Binary Dissection (PBD) is a new algorithm in which each cut is chosen to minimize load + lambda x(shape). In a 2 (or 3) dimensional problem, load is the amount of computation to be performed in a subregion and shape could refer to the perimeter (respectively surface) of that subregion. Shape is a measure of communication overhead and the parameter permits us to trade off load imbalance against communication overhead. When A is zero, the algorithm reduces to plain binary dissection. This algorithm can be used to partition graphs embedded in 2 or 3-d. Load is the number of nodes in a subregion, shape the number of edges that leave that subregion, and lambda the ratio of time to communicate over an edge to the time to compute at a node. An algorithm is presented that finds the depth d parametric dissection of an embedded graph with n vertices and e edges in O(max(n log n, de)) time, which is an improvement over the O(dn log n) time of plain binary dissection. Parallel versions of this algorithm are also presented; the best of these requires O((n/p) log(sup 3)p) time on a p processor hypercube, assuming graphs of bounded degree. How PBD is applied to 3-d unstructured meshes and yields partitions that are better than those obtained by plain dissection is described. Its application to the color image quantization problem is also discussed, in which samples in a high-resolution color space are mapped onto a lower resolution space in a way that minimizes the color error.

  2. Binary Masking & Speech Intelligibility

    OpenAIRE

    Boldt, Jesper

    2010-01-01

    The purpose of this thesis is to examine how binary masking can be used to increase intelligibility in situations where hearing impaired listeners have difficulties understanding what is being said. The major part of the experiments carried out in this thesis can be categorized as either experiments under ideal conditions or as experiments under more realistic conditions useful for real-life applications such as hearing aids. In the experiments under ideal conditions, the previously defined i...

  3. Dynamic Binary Modification Tools, Techniques and Applications

    CERN Document Server

    Hazelwood, Kim

    2011-01-01

    Dynamic binary modification tools form a software layer between a running application and the underlying operating system, providing the powerful opportunity to inspect and potentially modify every user-level guest application instruction that executes. Toolkits built upon this technology have enabled computer architects to build powerful simulators and emulators for design-space exploration, compiler writers to analyze and debug the code generated by their compilers, software developers to fully explore the features, bottlenecks, and performance of their software, and even end-users to extend

  4. Robust Reed Solomon Coded MPSK Modulation

    Directory of Open Access Journals (Sweden)

    Emir M. Husni

    2014-10-01

    Full Text Available In this paper, construction of partitioned Reed Solomon coded modulation (RSCM, which is robust for the additive white Gaussian noise channel and a Rayleigh fading channel, is investigated. By matching configuration of component codes with the channel characteristics, it is shown that this system is robust for the Gaussian and a Rayleigh fading channel. This approach is compared with non-partitioned RSCM, a Reed Solomon code combined with an MPSK signal set using Gray mapping; and block coded MPSK modulation using binary codes, Reed Muller codes. All codes use hard decision decoding algorithm. Simulation results for these schemes show that RSCM based on set partitioning performs better than those that are not based on set partitioning and Reed Muller Coded Modulation across a wide range of conditions. The novel idea here is that in the receiver, we use a rotated 2^(m+1-PSK detector if the transmitter uses a 2^m-PSK modulator.

  5. Adaptable Value-Set Analysis for Low-Level Code

    OpenAIRE

    Brauer, Jörg; Hansen, René Rydhof; Kowalewski, Stefan; Larsen, Kim G.; Olesen, Mads Chr.

    2012-01-01

    This paper presents a framework for binary code analysis that uses only SAT-based algorithms. Within the framework, incremental SAT solving is used to perform a form of weakly relational value-set analysis in a novel way, connecting the expressiveness of the value sets to computational complexity. Another key feature of our framework is that it translates the semantics of binary code into an intermediate representation. This allows for a straightforward translation of the program semantics in...

  6. GridRun: A lightweight packaging and execution environment forcompact, multi-architecture binaries

    Energy Technology Data Exchange (ETDEWEB)

    Shalf, John; Goodale, Tom

    2004-02-01

    GridRun offers a very simple set of tools for creating and executing multi-platform binary executables. These ''fat-binaries'' archive native machine code into compact packages that are typically a fraction the size of the original binary images they store, enabling efficient staging of executables for heterogeneous parallel jobs. GridRun interoperates with existing distributed job launchers/managers like Condor and the Globus GRAM to greatly simplify the logic required launching native binary applications in distributed heterogeneous environments.

  7. Optical three-step binary-logic-gate-based MSD arithmetic

    Science.gov (United States)

    Fyath, R. S.; Alsaffar, A. A. W.; Alam, M. S.

    2003-11-01

    A three-step modified signed-digit (MSD) adder is proposed which can be optically implmented using binary logic gates. The proposed scheme depends on encoding each MSD digits into a pair of binary digits using a two-state and multi-position based encoding scheme. The design algorithm depends on constructing the addition truth table of binary-coded MSD numbers and then using Karnaugh map to achieve output minimization. The functions associated with the optical binary logic gates are achieved by simply programming the decoding masks of an optical shadow-casting logic system.

  8. Massive Black Hole Binary Evolution

    Directory of Open Access Journals (Sweden)

    Merritt David

    2005-11-01

    Full Text Available Coalescence of binary supermassive black holes (SBHs would constitute the strongest sources of gravitational waves to be observed by LISA. While the formation of binary SBHs during galaxy mergers is almost inevitable, coalescence requires that the separation between binary components first drop by a few orders of magnitude, due presumably to interaction of the binary with stars and gas in a galactic nucleus. This article reviews the observational evidence for binary SBHs and discusses how they would evolve. No completely convincing case of a bound, binary SBH has yet been found, although a handful of systems (e.g. interacting galaxies; remnants of galaxy mergers are now believed to contain two SBHs at projected separations of <~ 1kpc. N-body studies of binary evolution in gas-free galaxies have reached large enough particle numbers to reproduce the slow, “diffusive” refilling of the binary’s loss cone that is believed to characterize binary evolution in real galactic nuclei. While some of the results of these simulations - e.g. the binary hardening rate and eccentricity evolution - are strongly N-dependent, others - e.g. the “damage” inflicted by the binary on the nucleus - are not. Luminous early-type galaxies often exhibit depleted cores with masses of ~ 1-2 times the mass of their nuclear SBHs, consistent with the predictions of the binary model. Studies of the interaction of massive binaries with gas are still in their infancy, although much progress is expected in the near future. Binary coalescence has a large influence on the spins of SBHs, even for mass ratios as extreme as 10:1, and evidence of spin-flips may have been observed.

  9. Network Coding

    Indian Academy of Sciences (India)

    message symbols downstream, network coding achieves vast performance gains by permitting intermediate nodes to carry out algebraic oper- ations on the incoming data. In this article we present a tutorial introduction to network coding as well as an application to the e±cient operation of distributed data-storage networks.

  10. Quantum Hash function and its application to privacy amplification in quantum key distribution, pseudo-random number generation and image encryption

    Science.gov (United States)

    Yang, Yu-Guang; Xu, Peng; Yang, Rui; Zhou, Yi-Hua; Shi, Wei-Min

    2016-01-01

    Quantum information and quantum computation have achieved a huge success during the last years. In this paper, we investigate the capability of quantum Hash function, which can be constructed by subtly modifying quantum walks, a famous quantum computation model. It is found that quantum Hash function can act as a hash function for the privacy amplification process of quantum key distribution systems with higher security. As a byproduct, quantum Hash function can also be used for pseudo-random number generation due to its inherent chaotic dynamics. Further we discuss the application of quantum Hash function to image encryption and propose a novel image encryption algorithm. Numerical simulations and performance comparisons show that quantum Hash function is eligible for privacy amplification in quantum key distribution, pseudo-random number generation and image encryption in terms of various hash tests and randomness tests. It extends the scope of application of quantum computation and quantum information.

  11. Fully digital jerk-based chaotic oscillators for high throughput pseudo-random number generators up to 8.77Gbits/s

    KAUST Repository

    Mansingka, Abhinav S.

    2014-06-18

    This paper introduces fully digital implementations of four di erent systems in the 3rd order jerk-equation based chaotic family using the Euler approximation. The digitization approach enables controllable chaotic systems that reliably provide sinusoidal or chaotic output based on a selection input. New systems are introduced, derived using logical and arithmetic operations between two system implementations of different bus widths, with up to 100x higher maximum Lyapunov exponent than the original jerkequation based chaotic systems. The resulting chaotic output is shown to pass the NIST sp. 800-22 statistical test suite for pseudorandom number generators without post-processing by only eliminating the statistically defective bits. The systems are designed in Verilog HDL and experimentally verified on a Xilinx Virtex 4 FPGA for a maximum throughput of 15.59 Gbits/s for the native chaotic output and 8.77 Gbits/s for the resulting pseudo-random number generators.

  12. Quantum Hash function and its application to privacy amplification in quantum key distribution, pseudo-random number generation and image encryption

    Science.gov (United States)

    Yang, Yu-Guang; Xu, Peng; Yang, Rui; Zhou, Yi-Hua; Shi, Wei-Min

    2016-01-01

    Quantum information and quantum computation have achieved a huge success during the last years. In this paper, we investigate the capability of quantum Hash function, which can be constructed by subtly modifying quantum walks, a famous quantum computation model. It is found that quantum Hash function can act as a hash function for the privacy amplification process of quantum key distribution systems with higher security. As a byproduct, quantum Hash function can also be used for pseudo-random number generation due to its inherent chaotic dynamics. Further we discuss the application of quantum Hash function to image encryption and propose a novel image encryption algorithm. Numerical simulations and performance comparisons show that quantum Hash function is eligible for privacy amplification in quantum key distribution, pseudo-random number generation and image encryption in terms of various hash tests and randomness tests. It extends the scope of application of quantum computation and quantum information. PMID:26823196

  13. Binary black holes on a budget: simulations using workstations

    International Nuclear Information System (INIS)

    Marronetti, Pedro; Tichy, Wolfgang; Bruegmann, Bernd; Gonzalez, Jose; Hannam, Mark; Husa, Sascha; Sperhake, Ulrich

    2007-01-01

    Binary black hole simulations have traditionally been computationally very expensive: current simulations are performed in supercomputers involving dozens if not hundreds of processors, thus systematic studies of the parameter space of binary black hole encounters still seem prohibitive with current technology. Here we show how the multi-layered refinement level code BAM can be used on dual processor workstations to simulate certain binary black hole systems. BAM, based on the moving punctures method, provides grid structures composed of boxes of increasing resolution near the centre of the grid. In the case of binaries, the highest resolution boxes are placed around each black hole and they track them in their orbits until the final merger when a single set of levels surrounds the black hole remnant. This is particularly useful when simulating spinning black holes since the gravitational fields gradients are larger. We present simulations of binaries with equal mass black holes with spins parallel to the binary axis and intrinsic magnitude of S/m 2 = 0.75. Our results compare favourably to those of previous simulations of this particular system. We show that the moving punctures method produces stable simulations at maximum spatial resolutions up to M/160 and for durations of up to the equivalent of 20 orbital periods

  14. Binary Cockroach Swarm Optimization for Combinatorial Optimization Problem

    Directory of Open Access Journals (Sweden)

    Ibidun Christiana Obagbuwa

    2016-09-01

    Full Text Available The Cockroach Swarm Optimization (CSO algorithm is inspired by cockroach social behavior. It is a simple and efficient meta-heuristic algorithm and has been applied to solve global optimization problems successfully. The original CSO algorithm and its variants operate mainly in continuous search space and cannot solve binary-coded optimization problems directly. Many optimization problems have their decision variables in binary. Binary Cockroach Swarm Optimization (BCSO is proposed in this paper to tackle such problems and was evaluated on the popular Traveling Salesman Problem (TSP, which is considered to be an NP-hard Combinatorial Optimization Problem (COP. A transfer function was employed to map a continuous search space CSO to binary search space. The performance of the proposed algorithm was tested firstly on benchmark functions through simulation studies and compared with the performance of existing binary particle swarm optimization and continuous space versions of CSO. The proposed BCSO was adapted to TSP and applied to a set of benchmark instances of symmetric TSP from the TSP library. The results of the proposed Binary Cockroach Swarm Optimization (BCSO algorithm on TSP were compared to other meta-heuristic algorithms.

  15. Development of PARASOL code

    Energy Technology Data Exchange (ETDEWEB)

    Hosokawa, Masanari [Research Organization for Information Science and Technology, Tokai, Ibaraki (Japan); Takizuka, Tomonori [Japan Atomic Energy Research Inst., Naka, Ibaraki (Japan). Naka Fusion Research Establishment

    2000-05-01

    The divertor is expected to play key roles in tokamak reactors, such as ITER, for the heat removal, ash exhaust, and impurity shielding. Its performance is being predicted by using comprehensive simulation codes with the fluid model. In the fluid model for scrape-off layer (SOL) and divertor plasmas, various physics models are introduced. Kinetic approach is required to examine the validity of such physics models. One of the most powerful kinetic models is the particle simulation. Therefore a particle code PARASOL has been developed, and is being used for the simulation study of SOL and divertor plasmas. The PARASOL code treats the plasma bounded by two divertor plates, in which motions of ions and electrons are traced by using a electrostatic PIC method. Effects of Coulomb collisions are simulated by using a Monte-Carlo=method binary collision model. Motions of neutral particles are traced simultaneously with charged particles. In this report, we describe the physics model of PARASOL, the numerical methods, the configuration of the program, input parameters, output formats, samples of simulation results, the parallel computing method. The efficiency of the parallel computing with Paragon XP/S15-256 is demonstrated. (author)

  16. Analysis and Defense of Vulnerabilities in Binary Code

    Science.gov (United States)

    2008-09-29

    applications. Currently, protocol reverse engineering is mostly manual. For example, it took the open source Samba project over 10 years of work to reverse...2004. [100] Andrew Tridgell. How samba was written. http://www.samba.org/ ftp/tridge/misc/french_cafe.txt, August 2003. URL Checked on 8/21/2008. [101

  17. Binary CFG Rebuilt of Self-Modifying Codes

    Science.gov (United States)

    2016-10-03

    Modern malware extensively applies self-modifying obfuscation techniques, e.g., self-decryption and mutation, which are often automatically prepared...industry to analyze malware is a dynamic analysis in a sand-box. Alternatively, we apply a hybrid method combining concolic testing (dynamic symbolic...strong disassembly ability (control flow graph generation) at the cost of relatively heavy execution. For instance, BE-PUM automatically detects the

  18. Magnetic binary nanofillers

    Energy Technology Data Exchange (ETDEWEB)

    Morales Mendoza, N. [INQUIMAE, CONICET-UBA, Ciudad Universitaria, Pab2, (C1428EHA) Bs As (Argentina); LPyMC, Dep. De Fisica, FCEN-UBA and IFIBA -CONICET, Ciudad Universitaria, Cap. Fed. (Argentina); Goyanes, S. [LPyMC, Dep. De Fisica, FCEN-UBA and IFIBA -CONICET, Ciudad Universitaria, Cap. Fed. (Argentina); Chiliotte, C.; Bekeris, V. [LBT, Dep. De Fisica, FCEN-UBA. Ciudad Universitaria, Pab1, C1428EGA CABA (Argentina); Rubiolo, G. [LPyMC, Dep. De Fisica, FCEN-UBA and IFIBA -CONICET, Ciudad Universitaria, Cap. Fed. (Argentina); Unidad de Actividad Materiales, CNEA, Av Gral. Paz 1499, San Martin (1650), Prov. de Bs As (Argentina); Candal, R., E-mail: candal@qi.fcen.uba.ar [INQUIMAE, CONICET-UBA, Ciudad Universitaria, Pab2, (C1428EHA) Bs As (Argentina); Escuela de Ciencia y Tecnologia, 3iA, Universidad de Gral. San Martin, San Martin, Prov. Bs As (Argentina)

    2012-08-15

    Magnetic binary nanofillers containing multiwall carbon nanotubes (MWCNT) and hercynite were synthesized by Chemical Vapor Deposition (CVD) on Fe/AlOOH prepared by the sol-gel method. The catalyst precursor was fired at 450 Degree-Sign C, ground and sifted through different meshes. Two powders were obtained with different particle sizes: sample A (50-75 {mu}m) and sample B (smaller than 50 {mu}m). These powders are composed of iron oxide particles widely dispersed in the non-crystalline matrix of aluminum oxide and they are not ferromagnetic. After reduction process the powders are composed of {alpha}-Fe nanoparticles inside hercynite matrix. These nanofillers are composed of hercynite containing {alpha}-Fe nanoparticles and MWCNT. The binary magnetic nanofillers were slightly ferromagnetic. The saturation magnetization of the nanofillers depended on the powder particle size. The nanofiller obtained from powder particles in the range 50-75 {mu}m showed a saturation magnetization 36% higher than the one formed from powder particles smaller than 50 {mu}m. The phenomenon is explained in terms of changes in the magnetic environment of the particles as consequence of the presence of MWCNT.

  19. Simulation of Code Spectrum and Code Flow of Cultured Neuronal Networks.

    Science.gov (United States)

    Tamura, Shinichi; Nishitani, Yoshi; Hosokawa, Chie; Miyoshi, Tomomitsu; Sawai, Hajime

    2016-01-01

    It has been shown that, in cultured neuronal networks on a multielectrode, pseudorandom-like sequences (codes) are detected, and they flow with some spatial decay constant. Each cultured neuronal network is characterized by a specific spectrum curve. That is, we may consider the spectrum curve as a "signature" of its associated neuronal network that is dependent on the characteristics of neurons and network configuration, including the weight distribution. In the present study, we used an integrate-and-fire model of neurons with intrinsic and instantaneous fluctuations of characteristics for performing a simulation of a code spectrum from multielectrodes on a 2D mesh neural network. We showed that it is possible to estimate the characteristics of neurons such as the distribution of number of neurons around each electrode and their refractory periods. Although this process is a reverse problem and theoretically the solutions are not sufficiently guaranteed, the parameters seem to be consistent with those of neurons. That is, the proposed neural network model may adequately reflect the behavior of a cultured neuronal network. Furthermore, such prospect is discussed that code analysis will provide a base of communication within a neural network that will also create a base of natural intelligence.

  20. Coding Class

    DEFF Research Database (Denmark)

    Ejsing-Duun, Stine; Hansbøl, Mikala

    Denne rapport rummer evaluering og dokumentation af Coding Class projektet1. Coding Class projektet blev igangsat i skoleåret 2016/2017 af IT-Branchen i samarbejde med en række medlemsvirksomheder, Københavns kommune, Vejle Kommune, Styrelsen for IT- og Læring (STIL) og den frivillige forening......, design tænkning og design-pædagogik, Stine Ejsing-Duun fra Forskningslab: It og Læringsdesign (ILD-LAB) ved Institut for kommunikation og psykologi, Aalborg Universitet i København. Vi har fulgt og gennemført evaluering og dokumentation af Coding Class projektet i perioden november 2016 til maj 2017....... Coding Class projektet er et pilotprojekt, hvor en række skoler i København og Vejle kommuner har igangsat undervisningsaktiviteter med fokus på kodning og programmering i skolen. Evalueringen og dokumentationen af projektet omfatter kvalitative nedslag i udvalgte undervisningsinterventioner i efteråret...

  1. Coding Labour

    Directory of Open Access Journals (Sweden)

    Anthony McCosker

    2014-03-01

    Full Text Available As well as introducing the Coding Labour section, the authors explore the diffusion of code across the material contexts of everyday life, through the objects and tools of mediation, the systems and practices of cultural production and organisational management, and in the material conditions of labour. Taking code beyond computation and software, their specific focus is on the increasingly familiar connections between code and labour with a focus on the codification and modulation of affect through technologies and practices of management within the contemporary work organisation. In the grey literature of spreadsheets, minutes, workload models, email and the like they identify a violence of forms through which workplace affect, in its constant flux of crisis and ‘prodromal’ modes, is regulated and governed.

  2. Contact Binary Asteroids

    Science.gov (United States)

    Rieger, Samantha

    2015-05-01

    Recent observations have found that some contact binaries are oriented such that the secondary impacts with the primary at a high inclination. This research investigates the evolution of how such contact binaries came to exist. This process begins with an asteroid pair, where the secondary lies on the Laplace plane. The Laplace plane is a plane normal to the axis about which the pole of a satellites orbit precesses, causing a near constant inclination for such an orbit. For the study of the classical Laplace plane, the secondary asteroid is in circular orbit around an oblate primary with axial tilt. This system is also orbiting the Sun. Thus, there are two perturbations on the secondarys orbit: J2 and third body Sun perturbations. The Laplace surface is defined as the group of orbits that lie on the Laplace plane at varying distances from the primary. If the secondary is very close to the primary, the inclination of the Laplace plane will be near the equator of the asteroid, while further from the primary the inclination will be similar to the asteroid-Sun plane. The secondary will lie on the Laplace plane because near the asteroid the Laplace plane is stable to large deviations in motion, causing the asteroid to come to rest in this orbit. Assuming the secondary is asymmetrical in shape and the bodys rotation is synchronous with its orbit, the secondary will experience the BYORP effect. BYORP can cause secular motion such as the semi-major axis of the secondary expanding or contracting. Assuming the secondary expands due to BYORP, the secondary will eventually reach the unstable region of the Laplace plane. The unstable region exists if the primary has an obliquity of 68.875 degrees or greater. The unstable region exists at 0.9 Laplace radius to 1.25 Laplace radius, where the Laplace radius is defined as the distance from the central body where the inclination of the Laplace plane orbit is half the obliquity. In the unstable region, the eccentricity of the orbit

  3. Formation and Evolution of X-ray Binaries

    Science.gov (United States)

    Shao, Y.

    2017-07-01

    use of both binary population synthesis and detailed binary evolution calculations. We find that the birthrate is around 10-4 yr-1 for the incipient X-ray binaries in both cases. We demonstrate the distribution of the ULX population in the donor mass - orbital period plane. Our results suggest that, compared with black hole X-ray binaries, neutron star X-ray binaries may significantly contribute to the ULX population, and high/intermediate-mass X-ray binaries dominate the neutron star ULX population in M82/Milky Way-like galaxies, respectively. In Chapter 6, the population of intermediate- and low-mass X-ray binaries in the Galaxy is explored. We investigate the formation and evolutionary sequences of Galactic intermediate- and low-mass X-ray binaries by combining binary population synthesis (BPS) and detailed stellar evolutionary calculations. Using an updated BPS code we compute the evolution of massive binaries that leads to the formation of incipient I/LMXBs, and present their distribution in the initial donor mass vs. initial orbital period diagram. We then follow the evolution of I/LMXBs until the formation of binary millisecond pulsars (BMSPs). We show that during the evolution of I/LMXBs they are likely to be observed as relatively compact binaries. The resultant BMSPs have orbital periods ranging from about 1 day to a few hundred days. These features are consistent with observations of LMXBs and BMSPs. We also confirm the discrepancies between theoretical predictions and observations mentioned in the literature, that is, the theoretical average mass transfer rates of LMXBs are considerably lower than observed, and the number of BMSPs with orbital periods ˜ 0.1-1 \\unit{d} is severely underestimated. Both imply that something is missing in the modeling of LMXBs, which is likely to be related to the mechanisms of the orbital angular momentum loss. Finally in Chapter 7 we summarize our results and give the prospects for the future work.

  4. Relativistic Binaries in Globular Clusters

    Directory of Open Access Journals (Sweden)

    Matthew J. Benacquista

    2013-03-01

    Full Text Available Galactic globular clusters are old, dense star systems typically containing 10^4 – 10^6 stars. As an old population of stars, globular clusters contain many collapsed and degenerate objects. As a dense population of stars, globular clusters are the scene of many interesting close dynamical interactions between stars. These dynamical interactions can alter the evolution of individual stars and can produce tight binary systems containing one or two compact objects. In this review, we discuss theoretical models of globular cluster evolution and binary evolution, techniques for simulating this evolution that leads to relativistic binaries, and current and possible future observational evidence for this population. Our discussion of globular cluster evolution will focus on the processes that boost the production of tight binary systems and the subsequent interaction of these binaries that can alter the properties of both bodies and can lead to exotic objects. Direct N-body integrations and Fokker–Planck simulations of the evolution of globular clusters that incorporate tidal interactions and lead to predictions of relativistic binary populations are also discussed. We discuss the current observational evidence for cataclysmic variables, millisecond pulsars, and low-mass X-ray binaries as well as possible future detection of relativistic binaries with gravitational radiation.

  5. Spectral properties of binary asteroids

    Science.gov (United States)

    Pajuelo, Myriam; Birlan, Mirel; Carry, Benoît; DeMeo, Francesca E.; Binzel, Richard P.; Berthier, Jérôme

    2018-04-01

    We present the first attempt to characterize the distribution of taxonomic class among the population of binary asteroids (15% of all small asteroids). For that, an analysis of 0.8-2.5{μ m} near-infrared spectra obtained with the SpeX instrument on the NASA/IRTF is presented. Taxonomic class and meteorite analog is determined for each target, increasing the sample of binary asteroids with known taxonomy by 21%. Most binary systems are bound in the S-, X-, and C- classes, followed by Q and V-types. The rate of binary systems in each taxonomic class agrees within uncertainty with the background population of small near-Earth objects and inner main belt asteroids, but for the C-types which are under-represented among binaries.

  6. Planets in Binary Star Systems

    CERN Document Server

    Haghighipour, Nader

    2010-01-01

    The discovery of extrasolar planets over the past decade has had major impacts on our understanding of the formation and dynamical evolution of planetary systems. There are features and characteristics unseen in our solar system and unexplainable by the current theories of planet formation and dynamics. Among these new surprises is the discovery of planets in binary and multiple-star systems. The discovery of such "binary-planetary" systems has confronted astrodynamicists with many new challenges, and has led them to re-examine the theories of planet formation and dynamics. Among these challenges are: How are planets formed in binary star systems? What would be the notion of habitability in such systems? Under what conditions can binary star systems have habitable planets? How will volatiles necessary for life appear on such planets? This volume seeks to gather the current research in the area of planets in binary and multistar systems and to familiarize readers with its associated theoretical and observation...

  7. Long-term variability of low-mass X-ray binaries

    Directory of Open Access Journals (Sweden)

    Filippova E.

    2014-01-01

    Full Text Available We consider modulations of mass captured by the compact object from the companion star’s stellar wind in Low Mass X-ray Binaries with late type giants. Based on 3D simulations with two different hydrodynamic codes used Lagrangian and Eulerian approaches – the SPH code GADGET and the Eulerian code PLUTO, we conclude that a hydrodynamical interaction of the wind matter within a binary system even without eccentricity results in variability of the mass accretion rate with characteristic time-scales close to the orbital period. Observational appearances of this wind might be similar to that of an accretion disc corona/wind.

  8. Embedding intensity image into a binary hologram with strong noise resistant capability

    Science.gov (United States)

    Zhuang, Zhaoyong; Jiao, Shuming; Zou, Wenbin; Li, Xia

    2017-11-01

    A digital hologram can be employed as a host image for image watermarking applications to protect information security. Past research demonstrates that a gray level intensity image can be embedded into a binary Fresnel hologram by error diffusion method or bit truncation coding method. However, the fidelity of the retrieved watermark image from binary hologram is generally not satisfactory, especially when the binary hologram is contaminated with noise. To address this problem, we propose a JPEG-BCH encoding method in this paper. First, we employ the JPEG standard to compress the intensity image into a binary bit stream. Next, we encode the binary bit stream with BCH code to obtain error correction capability. Finally, the JPEG-BCH code is embedded into the binary hologram. By this way, the intensity image can be retrieved with high fidelity by a BCH-JPEG decoder even if the binary hologram suffers from serious noise contamination. Numerical simulation results show that the image quality of retrieved intensity image with our proposed method is superior to the state-of-the-art work reported.

  9. BINARY ASTROMETRIC MICROLENSING WITH GAIA

    Energy Technology Data Exchange (ETDEWEB)

    Sajadian, Sedighe, E-mail: sajadian@ipm.ir [School of Astronomy, Institute for Research in Fundamental Sciences (IPM), P.O. Box 19395-5531, Tehran (Iran, Islamic Republic of); Department of Physics, Sharif University of Technology, P.O. Box 11155-9161, Tehran (Iran, Islamic Republic of)

    2015-04-15

    We investigate whether or not Gaia can specify the binary fractions of massive stellar populations in the Galactic disk through astrometric microlensing. Furthermore, we study whether or not some information about their mass distributions can be inferred via this method. In this regard, we simulate the binary astrometric microlensing events due to massive stellar populations according to the Gaia observing strategy by considering (i) stellar-mass black holes, (ii) neutron stars, (iii) white dwarfs, and (iv) main-sequence stars as microlenses. The Gaia efficiency for detecting the binary signatures in binary astrometric microlensing events is ∼10%–20%. By calculating the optical depth due to the mentioned stellar populations, the numbers of the binary astrometric microlensing events being observed with Gaia with detectable binary signatures, for the binary fraction of about 0.1, are estimated to be 6, 11, 77, and 1316, respectively. Consequently, Gaia can potentially specify the binary fractions of these massive stellar populations. However, the binary fraction of black holes measured with this method has a large uncertainty owing to a low number of the estimated events. Knowing the binary fractions in massive stellar populations helps with studying the gravitational waves. Moreover, we investigate the number of massive microlenses for which Gaia specifies masses through astrometric microlensing of single lenses toward the Galactic bulge. The resulting efficiencies of measuring the mass of mentioned populations are 9.8%, 2.9%, 1.2%, and 0.8%, respectively. The numbers of their astrometric microlensing events being observed in the Gaia era in which the lens mass can be inferred with the relative error less than 0.5 toward the Galactic bulge are estimated as 45, 34, 76, and 786, respectively. Hence, Gaia potentially gives us some information about the mass distribution of these massive stellar populations.

  10. Period variation studies of six contact binaries in M4

    Science.gov (United States)

    Rukmini, Jagirdar; Shanti Priya, Devarapalli

    2018-04-01

    We present the first period study of six contact binaries in the closest globular cluster M4 the data collected from June 1995‑June 2009 and Oct 2012‑Sept 2013. New times of minima are determined for all the six variables and eclipse timing (O-C) diagrams along with the quadratic fit are presented. For all the variables, the study of (O-C) variations reveals changes in the periods. In addition, the fundamental parameters for four of the contact binaries obtained using the Wilson-Devinney code (v2003) are presented. Planned observations of these binaries using the 3.6-m Devasthal Optical Telescope (DOT) and the 4-m International Liquid Mirror Telescope (ILMT) operated by the Aryabhatta Research Institute of Observational Sciences (ARIES; Nainital) can throw light on their evolutionary status from long term period variation studies.

  11. Collisional Dynamics around Binary Black Holes in Galactic Centers

    Science.gov (United States)

    Hemsendorf, Marc; Sigurdsson, Steinn; Spurzem, Rainer

    2002-12-01

    We follow the sinking of two massive black holes in a spherical stellar system where the black holes become bound under the influence of dynamical friction. Once bound, the binary hardens by three-body encounters with surrounding stars. We find that the binary wanders inside the core, providing an enhanced supply of reaction partners for the hardening. The binary evolves into a highly eccentric orbit leading to coalescence well beyond a Hubble time. These are the first results from a hybrid ``self-consistent field'' (SCF) and direct Aarseth N-body integrator (NBODY6), which combines the advantages of the direct force calculation with the efficiency of the field method. The code is designed for use on parallel architectures and is therefore applicable to collisional N-body integrations with extraordinarily large particle numbers (>105). This creates the possibility of simulating the dynamics of both globular clusters with realistic collisional relaxation and stellar systems surrounding supermassive black holes in galactic nuclei.

  12. DNA Barcoding through Quaternary LDPC Codes.

    Directory of Open Access Journals (Sweden)

    Elizabeth Tapia

    Full Text Available For many parallel applications of Next-Generation Sequencing (NGS technologies short barcodes able to accurately multiplex a large number of samples are demanded. To address these competitive requirements, the use of error-correcting codes is advised. Current barcoding systems are mostly built from short random error-correcting codes, a feature that strongly limits their multiplexing accuracy and experimental scalability. To overcome these problems on sequencing systems impaired by mismatch errors, the alternative use of binary BCH and pseudo-quaternary Hamming codes has been proposed. However, these codes either fail to provide a fine-scale with regard to size of barcodes (BCH or have intrinsic poor error correcting abilities (Hamming. Here, the design of barcodes from shortened binary BCH codes and quaternary Low Density Parity Check (LDPC codes is introduced. Simulation results show that although accurate barcoding systems of high multiplexing capacity can be obtained with any of these codes, using quaternary LDPC codes may be particularly advantageous due to the lower rates of read losses and undetected sample misidentification errors. Even at mismatch error rates of 10(-2 per base, 24-nt LDPC barcodes can be used to multiplex roughly 2000 samples with a sample misidentification error rate in the order of 10(-9 at the expense of a rate of read losses just in the order of 10(-6.

  13. Kodo: An Open and Research Oriented Network Coding Library

    DEFF Research Database (Denmark)

    Pedersen, Morten Videbæk; Heide, Janus; Fitzek, Frank

    2011-01-01

    We consider the problem of efficient decoding of a random linear code over a finite field. In particular we are interested in the case where the code is random, relatively sparse, and use the binary finite field as an example. The goal is to decode the data using fewer operations to potentially a...

  14. Cognitive Code-Division Links with Blind Primary-System Identification

    Science.gov (United States)

    2011-11-01

    covert communications, steganography, compressive sam- pling, adaptive multiuser detection , robust spread-spectrum communications, supervised and...system. We first develop a blind primary-user identification scheme to detect the binary code sequences (signatures) utilized by primary users. To...transmitting power and binary code-channel assignment in accordance with the detected primary code channels to avoid "harmful" interference. At the same

  15. Decoding Algorithms for Random Linear Network Codes

    DEFF Research Database (Denmark)

    Heide, Janus; Pedersen, Morten Videbæk; Fitzek, Frank

    2011-01-01

    We consider the problem of efficient decoding of a random linear code over a finite field. In particular we are interested in the case where the code is random, relatively sparse, and use the binary finite field as an example. The goal is to decode the data using fewer operations to potentially...... achieve a high coding throughput, and reduce energy consumption.We use an on-the-fly version of the Gauss-Jordan algorithm as a baseline, and provide several simple improvements to reduce the number of operations needed to perform decoding. Our tests show that the improvements can reduce the number...

  16. NSURE code

    International Nuclear Information System (INIS)

    Rattan, D.S.

    1993-11-01

    NSURE stands for Near-Surface Repository code. NSURE is a performance assessment code. developed for the safety assessment of near-surface disposal facilities for low-level radioactive waste (LLRW). Part one of this report documents the NSURE model, governing equations and formulation of the mathematical models, and their implementation under the SYVAC3 executive. The NSURE model simulates the release of nuclides from an engineered vault, their subsequent transport via the groundwater and surface water pathways tot he biosphere, and predicts the resulting dose rate to a critical individual. Part two of this report consists of a User's manual, describing simulation procedures, input data preparation, output and example test cases

  17. Speaking Code

    DEFF Research Database (Denmark)

    Cox, Geoff

    Speaking Code begins by invoking the “Hello World” convention used by programmers when learning a new language, helping to establish the interplay of text and code that runs through the book. Interweaving the voice of critical writing from the humanities with the tradition of computing and softwa...... expression in the public realm. The book’s line of argument defends language against its invasion by economics, arguing that speech continues to underscore the human condition, however paradoxical this may seem in an era of pervasive computing....

  18. Content identification: binary content fingerprinting versus binary content encoding

    Science.gov (United States)

    Ferdowsi, Sohrab; Voloshynovskiy, Svyatoslav; Kostadinov, Dimche

    2014-02-01

    In this work, we address the problem of content identification. We consider content identification as a special case of multiclass classification. The conventional approach towards identification is based on content fingerprinting where a short binary content description known as a fingerprint is extracted from the content. We propose an alternative solution based on elements of machine learning theory and digital communications. Similar to binary content fingerprinting, binary content representation is generated based on a set of trained binary classifiers. We consider several training/encoding strategies and demonstrate that the proposed system can achieve the upper theoretical performance limits of content identification. The experimental results were carried out both on a synthetic dataset with different parameters and the FAMOS dataset of microstructures from consumer packages.

  19. Optimally cloned binary coherent states

    Science.gov (United States)

    Müller, C. R.; Leuchs, G.; Marquardt, Ch.; Andersen, U. L.

    2017-10-01

    Binary coherent state alphabets can be represented in a two-dimensional Hilbert space. We capitalize this formal connection between the otherwise distinct domains of qubits and continuous variable states to map binary phase-shift keyed coherent states onto the Bloch sphere and to derive their quantum-optimal clones. We analyze the Wigner function and the cumulants of the clones, and we conclude that optimal cloning of binary coherent states requires a nonlinearity above second order. We propose several practical and near-optimal cloning schemes and compare their cloning fidelity to the optimal cloner.

  20. The Aster code; Code Aster

    Energy Technology Data Exchange (ETDEWEB)

    Delbecq, J.M

    1999-07-01

    The Aster code is a 2D or 3D finite-element calculation code for structures developed by the R and D direction of Electricite de France (EdF). This dossier presents a complete overview of the characteristics and uses of the Aster code: introduction of version 4; the context of Aster (organisation of the code development, versions, systems and interfaces, development tools, quality assurance, independent validation); static mechanics (linear thermo-elasticity, Euler buckling, cables, Zarka-Casier method); non-linear mechanics (materials behaviour, big deformations, specific loads, unloading and loss of load proportionality indicators, global algorithm, contact and friction); rupture mechanics (G energy restitution level, restitution level in thermo-elasto-plasticity, 3D local energy restitution level, KI and KII stress intensity factors, calculation of limit loads for structures), specific treatments (fatigue, rupture, wear, error estimation); meshes and models (mesh generation, modeling, loads and boundary conditions, links between different modeling processes, resolution of linear systems, display of results etc..); vibration mechanics (modal and harmonic analysis, dynamics with shocks, direct transient dynamics, seismic analysis and aleatory dynamics, non-linear dynamics, dynamical sub-structuring); fluid-structure interactions (internal acoustics, mass, rigidity and damping); linear and non-linear thermal analysis; steels and metal industry (structure transformations); coupled problems (internal chaining, internal thermo-hydro-mechanical coupling, chaining with other codes); products and services. (J.S.)

  1. Intermanual transfer effect in young children after training in a complex skill: mechanistic, pseudorandomized, pretest-posttest study.

    Science.gov (United States)

    Romkema, Sietske; Bongers, Raoul M; van der Sluis, Corry K

    2015-05-01

    Intermanual transfer implies that motor skills learned on one side of the body transfer to the untrained side. This effect was previously noted in adults practicing with a prosthesis simulator. The study objective was to determine whether intermanual transfer is present in children practicing prosthetic handling. A mechanistic, pseudorandomized, pretest-posttest design was used. The study was conducted in a primary school in the Netherlands. The participants were children who were able-bodied (N=48; 25 boys, 23 girls; mean age=5.1 years) and randomly assigned to an experimental group or a control group. The experimental group performed 5 training sessions using a prosthesis simulator on the training arm. Before (pretest), immediately after (posttest), and 6 days after (retention test) the training program, their ability to handle the prosthesis with the contralateral (test) arm was measured. The control group only performed the tests. Half of the children performed the tests with the dominant hand, and the other half performed the tests with the nondominant hand. During the tests, movement time and control of force were measured. An interaction effect of group by test was found for movement time. Post hoc tests revealed significant improvement in the experimental group between the posttest and the retention test. No force control effect was found. Only children who were able-bodied were included. Measurements should have been masked and obtained without tester interference. The fact that 4 children whose results were slower than the mean result discontinued training may have biased the findings. The intermanual transfer effect was present in 5-year-old children undergoing training in prosthetic handling. After training of one hand, children's movement times for the other, untrained hand improved. This finding may be helpful for training children who are novice users of a prosthesis. © 2015 American Physical Therapy Association.

  2. ANIMAL code

    Energy Technology Data Exchange (ETDEWEB)

    Lindemuth, I.R.

    1979-02-28

    This report describes ANIMAL, a two-dimensional Eulerian magnetohydrodynamic computer code. ANIMAL's physical model also appears. Formulated are temporal and spatial finite-difference equations in a manner that facilitates implementation of the algorithm. Outlined are the functions of the algorithm's FORTRAN subroutines and variables.

  3. Network Coding

    Indian Academy of Sciences (India)

    Home; Journals; Resonance – Journal of Science Education; Volume 15; Issue 7. Network Coding. K V Rashmi Nihar B Shah P Vijay Kumar. General Article Volume 15 Issue 7 July 2010 pp 604-621. Fulltext. Click here to view fulltext PDF. Permanent link: https://www.ias.ac.in/article/fulltext/reso/015/07/0604-0621 ...

  4. ANIMAL code

    International Nuclear Information System (INIS)

    Lindemuth, I.R.

    1979-01-01

    This report describes ANIMAL, a two-dimensional Eulerian magnetohydrodynamic computer code. ANIMAL's physical model also appears. Formulated are temporal and spatial finite-difference equations in a manner that facilitates implementation of the algorithm. Outlined are the functions of the algorithm's FORTRAN subroutines and variables

  5. Expander Codes

    Indian Academy of Sciences (India)

    Codes and Channels. A noisy communication channel is illustrated in Fig- ... nication channel. Suppose we want to transmit a message over the unreliable communication channel so that even if the channel corrupts some of the bits we are able to recover ..... is d-regular, meaning thereby that every vertex has de- gree d.

  6. Expander Codes

    Indian Academy of Sciences (India)

    Home; Journals; Resonance – Journal of Science Education; Volume 10; Issue 1. Expander Codes - The Sipser–Spielman Construction. Priti Shankar. General Article Volume 10 ... Author Affiliations. Priti Shankar1. Department of Computer Science and Automation, Indian Institute of Science Bangalore 560 012, India.

  7. Network Coding

    Indian Academy of Sciences (India)

    Network coding is a technique to increase the amount of information °ow in a network by mak- ing the key observation that information °ow is fundamentally different from commodity °ow. Whereas, under traditional methods of opera- tion of data networks, intermediate nodes are restricted to simply forwarding their incoming.

  8. Binary typing of staphylococcus aureus

    NARCIS (Netherlands)

    W.B. van Leeuwen (Willem)

    2002-01-01

    textabstractThis thesis describes the development. application and validation of straindifferentiating DNA probes for the characterization of Staphylococcus aureus strains in a system. that yields a binary output. By comparing the differential hybridization of these DNA probes to staphylococcal

  9. Mesoscopic model for binary fluids

    Science.gov (United States)

    Echeverria, C.; Tucci, K.; Alvarez-Llamoza, O.; Orozco-Guillén, E. E.; Morales, M.; Cosenza, M. G.

    2017-10-01

    We propose a model for studying binary fluids based on the mesoscopic molecular simulation technique known as multiparticle collision, where the space and state variables are continuous, and time is discrete. We include a repulsion rule to simulate segregation processes that does not require calculation of the interaction forces between particles, so binary fluids can be described on a mesoscopic scale. The model is conceptually simple and computationally efficient; it maintains Galilean invariance and conserves the mass and energy in the system at the micro- and macro-scale, whereas momentum is conserved globally. For a wide range of temperatures and densities, the model yields results in good agreement with the known properties of binary fluids, such as the density profile, interface width, phase separation, and phase growth. We also apply the model to the study of binary fluids in crowded environments with consistent results.

  10. Constructing snake-in-the-box codes and families of such codes covering the hypercube

    NARCIS (Netherlands)

    Haryanto, L.

    2007-01-01

    A snake-in-the-box code (or snake) is a list of binary words of length n such that each word differs from its successor in the list in precisely one bit position. Moreover, any two words in the list differ in at least two positions, unless they are neighbours in the list. The list is considered to

  11. Formation of the first three gravitational-wave observations through isolated binary evolution.

    Science.gov (United States)

    Stevenson, Simon; Vigna-Gómez, Alejandro; Mandel, Ilya; Barrett, Jim W; Neijssel, Coenraad J; Perkins, David; de Mink, Selma E

    2017-04-05

    During its first four months of taking data, Advanced LIGO has detected gravitational waves from two binary black hole mergers, GW150914 and GW151226, along with the statistically less significant binary black hole merger candidate LVT151012. Here we use the rapid binary population synthesis code COMPAS to show that all three events can be explained by a single evolutionary channel-classical isolated binary evolution via mass transfer including a common envelope phase. We show all three events could have formed in low-metallicity environments (Z=0.001) from progenitor binaries with typical total masses ≳160M ⊙ , ≳60M ⊙ and ≳90M ⊙ , for GW150914, GW151226 and LVT151012, respectively.

  12. Binding and Normalization of Binary Sparse Distributed Representations by Context-Dependent Thinning

    OpenAIRE

    Rachkovskij, Dmitri A.; Kussul, Ernst M.

    2001-01-01

    Distributed representations were often criticized as inappropriate for encoding of data with a complex structure. However Plate's Holographic Reduced Representations and Kanerva's Binary Spatter Codes are recent schemes that allow on-the-fly encoding of nested compositional structures by real-valued or dense binary vectors of fixed dimensionality. In this paper we consider procedures of the Context-Dependent Thinning which were developed for representation of complex hierarchical items in the...

  13. Comparison of tool feed influence in CNC polishing between a novel circular-random path and other pseudo-random paths.

    Science.gov (United States)

    Takizawa, Ken; Beaucamp, Anthony

    2017-09-18

    A new category of circular pseudo-random paths is proposed in order to suppress repetitive patterns and improve surface waviness on ultra-precision polished surfaces. Random paths in prior research had many corners, therefore deceleration of the polishing tool affected the surface waviness. The new random path can suppress velocity changes of the polishing tool and thus restrict degradation of the surface waviness, making it suitable for applications with stringent mid-spatial-frequency requirements such as photomask blanks for EUV lithography.

  14. Panda code

    International Nuclear Information System (INIS)

    Altomare, S.; Minton, G.

    1975-02-01

    PANDA is a new two-group one-dimensional (slab/cylinder) neutron diffusion code designed to replace and extend the FAB series. PANDA allows for the nonlinear effects of xenon, enthalpy and Doppler. Fuel depletion is allowed. PANDA has a completely general search facility which will seek criticality, maximize reactivity, or minimize peaking. Any single parameter may be varied in a search. PANDA is written in FORTRAN IV, and as such is nearly machine independent. However, PANDA has been written with the present limitations of the Westinghouse CDC-6600 system in mind. Most computation loops are very short, and the code is less than half the useful 6600 memory size so that two jobs can reside in the core at once. (auth)

  15. Clustering and Dimensionality Reduction to Discover Interesting Patterns in Binary Data

    Science.gov (United States)

    Palumbo, Francesco; D'Enza, Alfonso Iodice

    The attention towards binary data coding increased consistently in the last decade due to several reasons. The analysis of binary data characterizes several fields of application, such as market basket analysis, DNA microarray data, image mining, text mining and web-clickstream mining. The paper illustrates two different approaches exploiting a profitable combination of clustering and dimensionality reduction for the identification of non-trivial association structures in binary data. An application in the Association Rules framework supports the theory with the empirical evidence.

  16. Be discs in coplanar circular binaries: Phase-locked variations of emission lines

    Science.gov (United States)

    Panoglou, Despina; Faes, Daniel M.; Carciofi, Alex C.; Okazaki, Atsuo T.; Baade, Dietrich; Rivinius, Thomas; Borges Fernandes, Marcelo

    2018-01-01

    In this paper, we present the first results of radiative transfer calculations on decretion discs of binary Be stars. A smoothed particle hydrodynamics code computes the structure of Be discs in coplanar circular binary systems for a range of orbital and disc parameters. The resulting disc configuration consists of two spiral arms, and this can be given as input into a Monte Carlo code, which calculates the radiative transfer along the line of sight for various observational coordinates. Making use of the property of steady disc structure in coplanar circular binaries, observables are computed as functions of the orbital phase. Some orbital-phase series of line profiles are given for selected parameter sets under various viewing angles, to allow comparison with observations. Flat-topped profiles with and without superimposed multiple structures are reproduced, showing, for example, that triple-peaked profiles do not have to be necessarily associated with warped discs and misaligned binaries. It is demonstrated that binary tidal effects give rise to phase-locked variability of the violet-to-red (V/R) ratio of hydrogen emission lines. The V/R ratio exhibits two maxima per cycle; in certain cases those maxima are equal, leading to a clear new V/R cycle every half orbital period. This study opens a way to identifying binaries and to constraining the parameters of binary systems that exhibit phase-locked variations induced by tidal interaction with a companion star.

  17. Effects of Hardness of Primordial Binaries on Evolution of Star Clusters

    Science.gov (United States)

    Tanikawa, A.; Fukushige, T.

    2008-05-01

    We performed N-body simulations of star clusters with primordial binaries using a new code, GORILLA. It is based on Makino and Aarseth (1992)'s integration scheme on GRAPE, and includes a special treatment for relatively isolated binaries. Using the new code, we investigated effects of hardness of primordial binaries on whole evolution of the clusters. We simulated seven N=16384 equal-mass clusters containing 10% (in mass) primordial binaries whose binding energies are 1, 3, 10, 30, 100, 300, and 1000kT, respectively. Additionally, we also simulated a cluster without primordial binaries and that in which all binaries are replaced by stars with double mass, as references of soft and hard limits, respectively. We found that, in both soft (≤ 3kT) and hard (≥ 1000kT) limits, clusters experiences deep core collapse and shows gravothermal oscillations. On the other hands, in the intermediate hardness (10-300kT), the core collapses halt halfway due an energy releases of the primordial binaries.

  18. Advanced hardware design for error correcting codes

    CERN Document Server

    Coussy, Philippe

    2015-01-01

    This book provides thorough coverage of error correcting techniques. It includes essential basic concepts and the latest advances on key topics in design, implementation, and optimization of hardware/software systems for error correction. The book’s chapters are written by internationally recognized experts in this field. Topics include evolution of error correction techniques, industrial user needs, architectures, and design approaches for the most advanced error correcting codes (Polar Codes, Non-Binary LDPC, Product Codes, etc). This book provides access to recent results, and is suitable for graduate students and researchers of mathematics, computer science, and engineering. • Examines how to optimize the architecture of hardware design for error correcting codes; • Presents error correction codes from theory to optimized architecture for the current and the next generation standards; • Provides coverage of industrial user needs advanced error correcting techniques.

  19. Schroedinger’s code: Source code availability and transparency in astrophysics

    Science.gov (United States)

    Ryan, PW; Allen, Alice; Teuben, Peter

    2018-01-01

    Astronomers use software for their research, but how many of the codes they use are available as source code? We examined a sample of 166 papers from 2015 for clearly identified software use, then searched for source code for the software packages mentioned in these research papers. We categorized the software to indicate whether source code is available for download and whether there are restrictions to accessing it, and if source code was not available, whether some other form of the software, such as a binary, was. Over 40% of the source code for the software used in our sample was not available for download.As URLs have often been used as proxy citations for software, we also extracted URLs from one journal’s 2015 research articles, removed those from certain long-term, reliable domains, and tested the remainder to determine what percentage of these URLs were still accessible in September and October, 2017.

  20. Testing theory of binary evolution with interacting binary stars

    Science.gov (United States)

    Ergma, E.; Sarna, M. J.

    2002-01-01

    Of particular interest to us is the study of mass loss and its influence on the evolution of a binary systems. For this we use theoretical evolutionary models, which include: mass accretion, mass loss, novae explosion, super--efficient wind, and mixing processes. To test our theoretical prediction we proposed to determine the 12C / 13C ratio via measurements of the 12CO and 13CO bands around 2.3 micron. The available observations (Exter at al. 2001, in preparation) show good agreement with the theoretical predictions (Sarna 1992), for Algol-type binaries. Our preliminary estimates of the isotopic ratios for pre-CV's and CV's (Catalan et al. 2000, Dhillon et al. 2001) agree with the theoretical predictions from the common--envelope binary evolution models by Sarna et al. (1995). For the SXT we proposed (Ergma & Sarna 2001) similar observational test, which has not been done yet.

  1. Detecting unresolved binary stars in Euclid VIS images

    Science.gov (United States)

    Kuntzer, T.; Courbin, F.

    2017-10-01

    Measuring a weak gravitational lensing signal to the level required by the next generation of space-based surveys demands exquisite reconstruction of the point-spread function (PSF). However, unresolved binary stars can significantly distort the PSF shape. In an effort to mitigate this bias, we aim at detecting unresolved binaries in realistic Euclid stellar populations. We tested methods in numerical experiments where (I) the PSF shape is known to Euclid requirements across the field of view; and (II) the PSF shape is unknown. We drew simulated catalogues of PSF shapes for this proof-of-concept paper. Following the Euclid survey plan, the objects were observed four times. We propose three methods to detect unresolved binary stars. The detection is based on the systematic and correlated biases between exposures of the same object. One method is a simple correlation analysis, while the two others use supervised machine-learning algorithms (random forest and artificial neural network). In both experiments, we demonstrate the ability of our methods to detect unresolved binary stars in simulated catalogues. The performance depends on the level of prior knowledge of the PSF shape and the shape measurement errors. Good detection performances are observed in both experiments. Full complexity, in terms of the images and the survey design, is not included, but key aspects of a more mature pipeline are discussed. Finding unresolved binaries in objects used for PSF reconstruction increases the quality of the PSF determination at arbitrary positions. We show, using different approaches, that we are able to detect at least binary stars that are most damaging for the PSF reconstruction process. The code corresponding to the algorithms used in this work and all scripts to reproduce the results are publicly available from a GitHub repository accessible via http://lastro.epfl.ch/software

  2. The effectiveness of correcting codes in reception in the whole in additive normal white noise

    Science.gov (United States)

    Shtarkov, Y. M.

    1974-01-01

    Some possible criteria for estimating the effectiveness of correcting codes are presented, and the energy effectiveness of correcting codes is studied for symbol-by-symbol reception. Expressions for the energetic effectiveness of binary correcting codes for reception in the whole are produced. Asymptotic energetic effectiveness and finite signal/noise ratio cases are considered.

  3. Biclustering sparse binary genomic data.

    Science.gov (United States)

    van Uitert, Miranda; Meuleman, Wouter; Wessels, Lodewyk

    2008-12-01

    Genomic datasets often consist of large, binary, sparse data matrices. In such a dataset, one is often interested in finding contiguous blocks that (mostly) contain ones. This is a biclustering problem, and while many algorithms have been proposed to deal with gene expression data, only two algorithms have been proposed that specifically deal with binary matrices. None of the gene expression biclustering algorithms can handle the large number of zeros in sparse binary matrices. The two proposed binary algorithms failed to produce meaningful results. In this article, we present a new algorithm that is able to extract biclusters from sparse, binary datasets. A powerful feature is that biclusters with different numbers of rows and columns can be detected, varying from many rows to few columns and few rows to many columns. It allows the user to guide the search towards biclusters of specific dimensions. When applying our algorithm to an input matrix derived from TRANSFAC, we find transcription factors with distinctly dissimilar binding motifs, but a clear set of common targets that are significantly enriched for GO categories.

  4. Frequency characteristic measurement of a fiber optic gyroscope using a correlation spectrum analysis method based on a pseudo-random sequence

    Science.gov (United States)

    Li, Yang; Chen, Xingfan; Liu, Cheng

    2015-08-01

    The frequency characteristic is an important indicator of a system’s dynamic performance. The identification of a fiber optic gyroscope (FOG)’s frequency characteristic using a correlation spectrum analysis method based on a pseudo-random sequence is proposed. Taking the angle vibrator as the source of the test rotation stimulation and a pseudo-random sequence as the test signal, the frequency characteristic of a FOG is calculated according to the power spectral density of the rotation rate signal and the cross-power spectral density of the FOG’s output signal and rotation rate signal. A theoretical simulation is done to confirm the validity of this method. An experiment system is built and the test results indicate that the measurement error of the normalized amplitude-frequency response is less than 0.01, that the error of the phase-frequency response is less than 0.3 rad, and the overall measurement accuracy is superior to the traditional frequency-sweep method. By using this method, the FOG’s amplitude-frequency response and phase-frequency response can be measured simultaneously, quickly, accurately, and with a high frequency resolution. The described method meets the requirements of engineering applications.

  5. From concatenated codes to graph codes

    DEFF Research Database (Denmark)

    Justesen, Jørn; Høholdt, Tom

    2004-01-01

    We consider codes based on simple bipartite expander graphs. These codes may be seen as the first step leading from product type concatenated codes to more complex graph codes. We emphasize constructions of specific codes of realistic lengths, and study the details of decoding by message passing...

  6. Overloaded CDMA Systems with Displaced Binary Signatures

    Directory of Open Access Journals (Sweden)

    Vanhaverbeke Frederik

    2004-01-01

    Full Text Available We extend three types of overloaded CDMA systems, by displacing in time the binary signature sequences of these systems: (1 random spreading (PN, (2 multiple-OCDMA (MO, and (3 PN/OCDMA (PN/O. For each of these systems, we determine the time shifts that minimize the overall multiuser interference power. The achievable channel load with coded and uncoded data is evaluated for the conventional (without displacement and improved (with displacement systems, as well as for systems based on quasi-Welch-bound-equality (QWBE sequences, by means of several types of turbo detectors. For each system, the best performing turbo detector is selected in order to compare the performance of these systems. It is found that the improved systems substantially outperform their original counterparts. With uncoded data, (improved PN/O yields the highest acceptable channel load. For coded data, MO allows for the highest acceptable channel load over all considered systems, both for the conventional and the improved systems. In the latter case, channel loads of about 280% are achievable with a low degradation as compared to a single user system.

  7. The Young Visual Binary Survey

    Science.gov (United States)

    Prato, Lisa; Avilez, Ian; Lindstrom, Kyle; Graham, Sean; Sullivan, Kendall; Biddle, Lauren; Skiff, Brian; Nofi, Larissa; Schaefer, Gail; Simon, Michal

    2018-01-01

    Differences in the stellar and circumstellar properties of the components of young binaries provide key information about star and disk formation and evolution processes. Because objects with separations of a few to a few hundred astronomical units share a common environment and composition, multiple systems allow us to control for some of the factors which play into star formation. We are completing analysis of a rich sample of about 100 pre-main sequence binaries and higher order multiples, primarily located in the Taurus and Ophiuchus star forming regions. This poster will highlight some of out recent, exciting results. All reduced spectra and the results of our analysis will be publicly available to the community at http://jumar.lowell.edu/BinaryStars/. Support for this research was provided in part by NSF award AST-1313399 and by NASA Keck KPDA funding.

  8. PHYSICS OF ECLIPSING BINARIES. II. TOWARD THE INCREASED MODEL FIDELITY

    Energy Technology Data Exchange (ETDEWEB)

    Prša, A.; Conroy, K. E.; Horvat, M.; Kochoska, A.; Hambleton, K. M. [Villanova University, Dept. of Astrophysics and Planetary Sciences, 800 E Lancaster Avenue, Villanova PA 19085 (United States); Pablo, H. [Université de Montréal, Pavillon Roger-Gaudry, 2900, boul. Édouard-Montpetit Montréal QC H3T 1J4 (Canada); Bloemen, S. [Radboud University Nijmegen, Department of Astrophysics, IMAPP, P.O. Box 9010, 6500 GL, Nijmegen (Netherlands); Giammarco, J. [Eastern University, Dept. of Astronomy and Physics, 1300 Eagle Road, St. Davids, PA 19087 (United States); Degroote, P. [KU Leuven, Instituut voor Sterrenkunde, Celestijnenlaan 200D, B-3001 Heverlee (Belgium)

    2016-12-01

    The precision of photometric and spectroscopic observations has been systematically improved in the last decade, mostly thanks to space-borne photometric missions and ground-based spectrographs dedicated to finding exoplanets. The field of eclipsing binary stars strongly benefited from this development. Eclipsing binaries serve as critical tools for determining fundamental stellar properties (masses, radii, temperatures, and luminosities), yet the models are not capable of reproducing observed data well, either because of the missing physics or because of insufficient precision. This led to a predicament where radiative and dynamical effects, insofar buried in noise, started showing up routinely in the data, but were not accounted for in the models. PHOEBE (PHysics Of Eclipsing BinariEs; http://phoebe-project.org) is an open source modeling code for computing theoretical light and radial velocity curves that addresses both problems by incorporating missing physics and by increasing the computational fidelity. In particular, we discuss triangulation as a superior surface discretization algorithm, meshing of rotating single stars, light travel time effects, advanced phase computation, volume conservation in eccentric orbits, and improved computation of local intensity across the stellar surfaces that includes the photon-weighted mode, the enhanced limb darkening treatment, the better reflection treatment, and Doppler boosting. Here we present the concepts on which PHOEBE is built and proofs of concept that demonstrate the increased model fidelity.

  9. Error Control Coding Techniques for Space and Satellite Communications

    Science.gov (United States)

    Lin, Shu

    2000-01-01

    This paper presents a concatenated turbo coding system in which a Reed-Solomom outer code is concatenated with a binary turbo inner code. In the proposed system, the outer code decoder and the inner turbo code decoder interact to achieve both good bit error and frame error performances. The outer code decoder helps the inner turbo code decoder to terminate its decoding iteration while the inner turbo code decoder provides soft-output information to the outer code decoder to carry out a reliability-based soft-decision decoding. In the case that the outer code decoding fails, the outer code decoder instructs the inner code decoder to continue its decoding iterations until the outer code decoding is successful or a preset maximum number of decoding iterations is reached. This interaction between outer and inner code decoders reduces decoding delay. Also presented in the paper are an effective criterion for stopping the iteration process of the inner code decoder and a new reliability-based decoding algorithm for nonbinary codes.

  10. Protocols for quantum binary voting

    Science.gov (United States)

    Thapliyal, Kishore; Sharma, Rishi Dutt; Pathak, Anirban

    Two new protocols for quantum binary voting are proposed. One of the proposed protocols is designed using a standard scheme for controlled deterministic secure quantum communication (CDSQC), and the other one is designed using the idea of quantum cryptographic switch, which uses a technique known as permutation of particles. A few possible alternative approaches to accomplish the same task (quantum binary voting) have also been discussed. Security of the proposed protocols is analyzed. Further, the efficiencies of the proposed protocols are computed, and are compared with that of the existing protocols. The comparison has established that the proposed protocols are more efficient than the existing protocols.

  11. Matter in compact binary mergers

    Science.gov (United States)

    Read, Jocelyn; LIGO Scientific Collaboration, Virgo Scientific Collaboration

    2018-01-01

    Mergers of binary neutron stars or neutron-star/black-hole systems are promising targets for gravitational-wave detection. The dynamics of merging compact objects, and thus their gravitational-wave signatures, are primarily determined by the mass and spin of the components. However, the presence of matter can make an imprint on the final orbits and merger of a binary system. I will outline efforts to understand the impact of neutron-star matter on gravitational waves, using both theoretical and computational input, so that gravitational-wave observations can be used to measure the properties of source systems with neutron-star components.

  12. Mental Effort in Binary Categorization Aided by Binary Cues

    Science.gov (United States)

    Botzer, Assaf; Meyer, Joachim; Parmet, Yisrael

    2013-01-01

    Binary cueing systems assist in many tasks, often alerting people about potential hazards (such as alarms and alerts). We investigate whether cues, besides possibly improving decision accuracy, also affect the effort users invest in tasks and whether the required effort in tasks affects the responses to cues. We developed a novel experimental tool…

  13. Algebraic coding theory over finite commutative rings

    CERN Document Server

    Dougherty, Steven T

    2017-01-01

    This book provides a self-contained introduction to algebraic coding theory over finite Frobenius rings. It is the first to offer a comprehensive account on the subject. Coding theory has its origins in the engineering problem of effective electronic communication where the alphabet is generally the binary field. Since its inception, it has grown as a branch of mathematics, and has since been expanded to consider any finite field, and later also Frobenius rings, as its alphabet. This book presents a broad view of the subject as a branch of pure mathematics and relates major results to other fields, including combinatorics, number theory and ring theory. Suitable for graduate students, the book will be of interest to anyone working in the field of coding theory, as well as algebraists and number theorists looking to apply coding theory to their own work.

  14. The Uses of Binary Thinking.

    Science.gov (United States)

    Elbow, Peter

    1993-01-01

    Argues that oppositional thinking, if handled in the right way, will serve as a way to avoid the very problems that Jonathan Culler and Paul de Mann are troubled by: "purity, order, and hierarchy." Asserts that binary thinking can serve to encourage difference--indeed, encourage nondominance, nontranscendence, instability, and disorder.…

  15. Biclustering Sparse Binary Genomic Data

    NARCIS (Netherlands)

    Van Uitert, M.; Meuleman, W.; Wessels, L.F.A.

    2008-01-01

    Genomic datasets often consist of large, binary, sparse data matrices. In such a dataset, one is often interested in finding contiguous blocks that (mostly) contain ones. This is a biclustering problem, and while many algorithms have been proposed to deal with gene expression data, only two

  16. Misclassification in binary choice models

    Czech Academy of Sciences Publication Activity Database

    Meyer, B. D.; Mittag, Nikolas

    2017-01-01

    Roč. 200, č. 2 (2017), s. 295-311 ISSN 0304-4076 R&D Projects: GA ČR(CZ) GJ16-07603Y Institutional support: Progres-Q24 Keywords : measurement error * binary choice models * program take-up Subject RIV: AH - Economics OBOR OECD: Economic Theory Impact factor: 1.633, year: 2016

  17. Misclassification in binary choice models

    Czech Academy of Sciences Publication Activity Database

    Meyer, B. D.; Mittag, Nikolas

    2017-01-01

    Roč. 200, č. 2 (2017), s. 295-311 ISSN 0304-4076 Institutional support: RVO:67985998 Keywords : measurement error * binary choice models * program take-up Subject RIV: AH - Economics OBOR OECD: Economic Theory Impact factor: 1.633, year: 2016

  18. BHMcalc: Binary Habitability Mechanism Calculator

    Science.gov (United States)

    Zuluaga, Jorge I.; Mason, Paul; Cuartas-Restrepo, Pablo A.; Clark, Joni

    2018-02-01

    BHMcalc provides renditions of the instantaneous circumbinary habital zone (CHZ) and also calculates BHM properties of the system including those related to the rotational evolution of the stellar components and the combined XUV and SW fluxes as measured at different distances from the binary. Moreover, it provides numerical results that can be further manipulated and used to calculate other properties.

  19. Subluminous X-ray binaries

    NARCIS (Netherlands)

    Armas Padilla, M.

    2013-01-01

    The discovery of the first X-ray binary, Scorpius X-1, by Giacconi et al. (1962), marked the birth of X-ray astronomy. Following that discovery, many additional X-ray sources where found with the first generation of X-ray rockets and observatories (e.g., UHURU and Einstein). The short-timescale

  20. The Meritfactor of Binary Seqences

    DEFF Research Database (Denmark)

    Høholdt, Tom

    1999-01-01

    Binary sequences with small aperiodic correlations play an important role in many applications ranging from radar to modulation and testing of systems. Golay(1977) introduced the merit factor as a measure of the goodness of the sequence and conjectured an upper bound for this. His conjecture...

  1. Modeling binary correlated responses using SAS, SPSS and R

    CERN Document Server

    Wilson, Jeffrey R

    2015-01-01

    Statistical tools to analyze correlated binary data are spread out in the existing literature. This book makes these tools accessible to practitioners in a single volume. Chapters cover recently developed statistical tools and statistical packages that are tailored to analyzing correlated binary data. The authors showcase both traditional and new methods for application to health-related research. Data and computer programs will be publicly available in order for readers to replicate model development, but learning a new statistical language is not necessary with this book. The inclusion of code for R, SAS, and SPSS allows for easy implementation by readers. For readers interested in learning more about the languages, though, there are short tutorials in the appendix. Accompanying data sets are available for download through the book s website. Data analysis presented in each chapter will provide step-by-step instructions so these new methods can be readily applied to projects.  Researchers and graduate stu...

  2. APPLICATION OF GAS DYNAMICAL FRICTION FOR PLANETESIMALS. II. EVOLUTION OF BINARY PLANETESIMALS

    Energy Technology Data Exchange (ETDEWEB)

    Grishin, Evgeni; Perets, Hagai B. [Physics Department, Technion—Israel Institute of Technology, Haifa, 3200003 (Israel)

    2016-04-01

    One of the first stages of planet formation is the growth of small planetesimals and their accumulation into large planetesimals and planetary embryos. This early stage occurs long before the dispersal of most of the gas from the protoplanetary disk. At this stage gas–planetesimal interactions play a key role in the dynamical evolution of single intermediate-mass planetesimals (m{sub p} ∼ 10{sup 21}–10{sup 25} g) through gas dynamical friction (GDF). A significant fraction of all solar system planetesimals (asteroids and Kuiper-belt objects) are known to be binary planetesimals (BPs). Here, we explore the effects of GDF on the evolution of BPs embedded in a gaseous disk using an N-body code with a fiducial external force accounting for GDF. We find that GDF can induce binary mergers on timescales shorter than the disk lifetime for masses above m{sub p} ≳ 10{sup 22} g at 1 au, independent of the binary initial separation and eccentricity. Such mergers can affect the structure of merger-formed planetesimals, and the GDF-induced binary inspiral can play a role in the evolution of the planetesimal disk. In addition, binaries on eccentric orbits around the star may evolve in the supersonic regime, where the torque reverses and the binary expands, which would enhance the cross section for planetesimal encounters with the binary. Highly inclined binaries with small mass ratios, evolve due to the combined effects of Kozai–Lidov (KL) cycles with GDF which lead to chaotic evolution. Prograde binaries go through semi-regular KL evolution, while retrograde binaries frequently flip their inclination and ∼50% of them are destroyed.

  3. Interactions in Massive Colliding Wind Binaries

    Directory of Open Access Journals (Sweden)

    Michael F. Corcoran

    2012-03-01

    Full Text Available There are observational difficulties determining dynamical masses of binary star components in the upper HR diagram both due to the scarcity of massive binary systems and spectral and photometric contamination produced by the strong wind outflows in these systems. We discuss how variable X-ray emission in these systems produced by wind-wind collisions in massive binaries can be used to constrain the system parameters, with application to two important massive binaries, Eta Carinae and WR 140.

  4. Automatic coding method of the ACR Code

    International Nuclear Information System (INIS)

    Park, Kwi Ae; Ihm, Jong Sool; Ahn, Woo Hyun; Baik, Seung Kook; Choi, Han Yong; Kim, Bong Gi

    1993-01-01

    The authors developed a computer program for automatic coding of ACR(American College of Radiology) code. The automatic coding of the ACR code is essential for computerization of the data in the department of radiology. This program was written in foxbase language and has been used for automatic coding of diagnosis in the Department of Radiology, Wallace Memorial Baptist since May 1992. The ACR dictionary files consisted of 11 files, one for the organ code and the others for the pathology code. The organ code was obtained by typing organ name or code number itself among the upper and lower level codes of the selected one that were simultaneous displayed on the screen. According to the first number of the selected organ code, the corresponding pathology code file was chosen automatically. By the similar fashion of organ code selection, the proper pathologic dode was obtained. An example of obtained ACR code is '131.3661'. This procedure was reproducible regardless of the number of fields of data. Because this program was written in 'User's Defined Function' from, decoding of the stored ACR code was achieved by this same program and incorporation of this program into program in to another data processing was possible. This program had merits of simple operation, accurate and detail coding, and easy adjustment for another program. Therefore, this program can be used for automation of routine work in the department of radiology

  5. Stability criterion for a light binary attracted by a heavy body

    Science.gov (United States)

    Vasilkova, O. O.

    2010-03-01

    Dynamical behaviour of a small binary with equal components, each of mass m, is considered under attraction of a heavy body of mass M. Differential equations of the general three-body problem are integrated numerically using the code by S. J. Aarseth (Aarseth, Zare 1974) for mass ratios m/M within 10-11-10-4 range. The direct and retrograde orbits of light bodies about each other are considered which lie either in the plane of moving their center of mass or in the plane perpendicular to it. It is shown numerically that the critical separation between the binary components which leads to disruption of binary is proportional to ( m/M)1/3. The criterion can be used for studying (in the first approximation) the motion of double stars and binary asteroids or computing the parameters of magnetic monopol and antimonopol pairs.

  6. A New Method Of Gene Coding For A Genetic Algorithm Designed For Parametric Optimization

    Directory of Open Access Journals (Sweden)

    Radu BELEA

    2003-12-01

    Full Text Available In a parametric optimization problem the genes code the real parameters of the fitness function. There are two coding techniques known under the names of: binary coded genes and real coded genes. The comparison between these two is a controversial subject since the first papers about parametric optimization have appeared. An objective analysis regarding the advantages and disadvantages of the two coding techniques is difficult to be done while different format information is compared. The present paper suggests a gene coding technique that uses the same format for both binary coded genes and for the real coded genes. After unifying the real parameters representation, the next criterion is going to be applied: the differences between the two techniques are statistically measured by the effect of the genetic operators over some random generated fellows.

  7. Fundamentals of convolutional coding

    CERN Document Server

    Johannesson, Rolf

    2015-01-01

    Fundamentals of Convolutional Coding, Second Edition, regarded as a bible of convolutional coding brings you a clear and comprehensive discussion of the basic principles of this field * Two new chapters on low-density parity-check (LDPC) convolutional codes and iterative coding * Viterbi, BCJR, BEAST, list, and sequential decoding of convolutional codes * Distance properties of convolutional codes * Includes a downloadable solutions manual

  8. GPU accelerated manifold correction method for spinning compact binaries

    Science.gov (United States)

    Ran, Chong-xi; Liu, Song; Zhong, Shuang-ying

    2018-04-01

    The graphics processing unit (GPU) acceleration of the manifold correction algorithm based on the compute unified device architecture (CUDA) technology is designed to simulate the dynamic evolution of the Post-Newtonian (PN) Hamiltonian formulation of spinning compact binaries. The feasibility and the efficiency of parallel computation on GPU have been confirmed by various numerical experiments. The numerical comparisons show that the accuracy on GPU execution of manifold corrections method has a good agreement with the execution of codes on merely central processing unit (CPU-based) method. The acceleration ability when the codes are implemented on GPU can increase enormously through the use of shared memory and register optimization techniques without additional hardware costs, implying that the speedup is nearly 13 times as compared with the codes executed on CPU for phase space scan (including 314 × 314 orbits). In addition, GPU-accelerated manifold correction method is used to numerically study how dynamics are affected by the spin-induced quadrupole-monopole interaction for black hole binary system.

  9. Features of the propagation of pseudorandom pulse signals from the shelf to deep water in the presence of gyre formation on the acoustic track

    Science.gov (United States)

    Akulichev, V. A.; Burenin, A. V.; Ladychenko, S. Yu.; Lobanov, V. B.; Morgunov, Yu. N.

    2017-08-01

    The paper discusses the results of an experiment conducted in the Sea of Japan in March 2016 on an acoustic track 194 km long in winter hydrological conditions. The most complex case of propagation of pseudorandom pulse signals from the shelf to deep water in the presence of gyre formation on the acoustic track. An analysis of the experimentally obtained pulse characteristics show that at all points, a maximum, in terms of amplitude, first arrival of acoustic energy is recorded. This is evidence that at a given depth horizon, pulses that have passed the shortest distance through a near-surface sound channel at small angles close to zero are received first. The calculation method of mean sound velocity on the track, based on the satellite data of surface temperature monitoring, is proposed. We expect that the results obtained with this method can be successfully used for the purposes of acoustic range finding and navigation.

  10. Emission-line diagnostics of nearby H II regions including interacting binary populations

    Science.gov (United States)

    Xiao, Lin; Stanway, Elizabeth R.; Eldridge, J. J.

    2018-03-01

    We present numerical models of the nebular emission from H II regions around young stellar populations over a range of compositions and ages. The synthetic stellar populations include both single stars and interacting binary stars. We compare these models to the observed emission lines of 254 H II regions of 13 nearby spiral galaxies and 21 dwarf galaxies drawn from archival data. The models are created using the combination of the Binary Population and Spectral Synthesis (BPASS) code with the photoionization code CLOUDY to study the differences caused by the inclusion of interacting binary stars in the stellar population. We obtain agreement with the observed emission line ratios from the nearby star-forming regions and discuss the effect of binary star evolution pathways on the nebular ionization of H II regions. We find that at population ages above 10 Myr, single-star models rapidly decrease in flux and ionization strength, while binary-star models still produce strong flux and high [O III]/Hβ ratios. Our models can reproduce the metallicity of H II regions from spiral galaxies but we find higher metallicities than previously estimated for the H II regions from dwarf galaxies. Comparing the equivalent width of Hβ emission between models and observations, we find that accounting for ionizing photon leakage can affect age estimates for H II regions. When it is included, the typical age derived for H II regions is 5 Myr from single-star models, and up to 10 Myr with binary-star models. This is due to the existence of binary-star evolution pathways which produce more hot WR and helium stars at older ages. For future reference, we calculate new BPASS binary maximal starburst lines as a function of metallicity, and for the total model population, and present these in Appendix A.

  11. Permutation Entropy for Random Binary Sequences

    Directory of Open Access Journals (Sweden)

    Lingfeng Liu

    2015-12-01

    Full Text Available In this paper, we generalize the permutation entropy (PE measure to binary sequences, which is based on Shannon’s entropy, and theoretically analyze this measure for random binary sequences. We deduce the theoretical value of PE for random binary sequences, which can be used to measure the randomness of binary sequences. We also reveal the relationship between this PE measure with other randomness measures, such as Shannon’s entropy and Lempel–Ziv complexity. The results show that PE is consistent with these two measures. Furthermore, we use PE as one of the randomness measures to evaluate the randomness of chaotic binary sequences.

  12. Physical Parameters of the Overcontact Binary AH Cnc in the Old Open Cluster M 67

    NARCIS (Netherlands)

    Yakut, K.; Aerts, C.C.

    2006-01-01

    We present a photometric study of the overcontact binary AH Cnc. The CCD observations were done with the Russian-Turkish 1.5 m telescope and the light-curve was solved with the Wilson-Devinney code. The physical parameters of the components have been deduced as M1 = 1.22 Msun,

  13. The use of hyperspectral data for tree species discrimination: Combining binary classifiers

    CSIR Research Space (South Africa)

    Dastile, X

    2010-11-01

    Full Text Available ). A review on the combination of binary classifiers in multiclass problems. Springer science and Business Media B.V [7] Dietterich T.G and Bakiri G.(1995). Solving Multiclass Learning Problem via Error-Correcting Output Codes. AI Access Foundation...

  14. PatternCoder: A Programming Support Tool for Learning Binary Class Associations and Design Patterns

    Science.gov (United States)

    Paterson, J. H.; Cheng, K. F.; Haddow, J.

    2009-01-01

    PatternCoder is a software tool to aid student understanding of class associations. It has a wizard-based interface which allows students to select an appropriate binary class association or design pattern for a given problem. Java code is then generated which allows students to explore the way in which the class associations are implemented in a…

  15. Information sets as permutation cycles for quadratic residue codes

    Directory of Open Access Journals (Sweden)

    Richard A. Jenson

    1982-01-01

    Full Text Available The two cases p=7 and p=23 are the only known cases where the automorphism group of the [p+1,   (p+1/2] extended binary quadratic residue code, O(p, properly contains PSL(2,p. These codes have some of their information sets represented as permutation cycles from Aut(Q(p. Analysis proves that all information sets of Q(7 are so represented but those of Q(23 are not.

  16. Utility subroutine package used by Applied Physics Division export codes

    International Nuclear Information System (INIS)

    Adams, C.H.; Derstine, K.L.; Henryson, H. II; Hosteny, R.P.; Toppel, B.J.

    1983-04-01

    This report describes the current state of the utility subroutine package used with codes being developed by the staff of the Applied Physics Division. The package provides a variety of useful functions for BCD input processing, dynamic core-storage allocation and managemnt, binary I/0 and data manipulation. The routines were written to conform to coding standards which facilitate the exchange of programs between different computers

  17. Gravity waves from relativistic binaries

    OpenAIRE

    Levin, Janna; O'Reilly, Rachel; Copeland, E. J.

    1999-01-01

    The stability of binary orbits can significantly shape the gravity wave signal which future Earth-based interferometers hope to detect. The inner most stable circular orbit has been of interest as it marks the transition from the late inspiral to final plunge. We consider purely relativistic orbits beyond the circular assumption. Homoclinic orbits are of particular importance to the question of stability as they lie on the boundary between dynamical stability and instability. We identify thes...

  18. Memorizing binary vector sequences by a sparsely encoded network.

    Science.gov (United States)

    Baram, Y

    1994-01-01

    We present a neural network employing Hebbian storage and sparse internal coding, which is capable of memorizing and correcting sequences of binary vectors by association. A ternary version of the Kanerva memory, folded into a feedback configuration, is shown to perform the basic sequence memorization and regeneration function. The inclusion of lateral connections between the internal cells increases the network capacity considerably and facilitates the correction of individual input patterns and the detection of large errors. The introduction of higher delays in the transmission lines between the external input-output layer and the internal memory layer is shown to further improve the network's error correction capability.

  19. Simulations of Tidally Driven Formation of Binary Planet Systems

    Science.gov (United States)

    Murray, R. Zachary P.; Guillochon, James

    2018-01-01

    In the last decade there have been hundreds of exoplanets discovered by the Kepler, CoRoT and many other initiatives. This wealth of data suggests the possibility of detecting exoplanets with large satellites. This project seeks to model the interactions between orbiting planets using the FLASH hydrodynamics code developed by The Flash Center for Computational Science at University of Chicago. We model the encounters in a wide variety of encounter scenarios and initial conditions including variations in encounter depth, mass ratio, and encounter velocity and attempt to constrain what sorts of binary planet configurations are possible and stable.

  20. Time efficient signed Vedic multiplier using redundant binary representation

    Directory of Open Access Journals (Sweden)

    Ranjan Kumar Barik

    2017-03-01

    Full Text Available This study presents a high-speed signed Vedic multiplier (SVM architecture using redundant binary (RB representation in Urdhva Tiryagbhyam (UT sutra. This is the first ever effort towards extension of Vedic algorithms to the signed numbers. The proposed multiplier architecture solves the carry propagation issue in UT sutra, as carry free addition is possible in RB representation. The proposed design is coded in VHDL and synthesised in Xilinx ISE 14.4 of various FPGA devices. The proposed SVM architecture has better speed performances as compared with various state-of-the-art conventional as well as Vedic architectures.

  1. Binary evolution and observational constraints

    International Nuclear Information System (INIS)

    Loore, C. de

    1984-01-01

    The evolution of close binaries is discussed in connection with problems concerning mass and angular momentum losses. Theoretical and observational evidence for outflow of matter, leaving the system during evolution is given: statistics on total masses and mass ratios, effects of the accretion of the mass gaining component, the presence of streams, disks, rings, circumstellar envelopes, period changes, abundance changes in the atmosphere. The effects of outflowing matter on the evolution is outlined, and estimates of the fraction of matter expelled by the loser, and leaving the system, are given. The various time scales involved with evolution and observation are compared. Examples of non conservative evolution are discussed. Problems related to contact phases, on mass and energy losses, in connection with entropy changes are briefly analysed. For advanced stages the disruption probabilities for supernova explosions are examined. A global picture is given for the evolution of massive close binaries, from ZAMS, through WR phases, X-ray phases, leading to runaway pulsars or to a binary pulsar and later to a millisecond pulsar. (Auth.)

  2. Efficient Coding of Shape and Transparency for Video Objects

    DEFF Research Database (Denmark)

    Aghito, Shankar Manuel; Forchhammer, Søren

    2007-01-01

    the strong correlation with the binary shape layer by morphological erosion operations. Finally, three solutions are proposed for coding the intermediate layer. The knowledge of the two previously encoded layers is utilized in order to increase compression efficiency. Experimental results are reported...

  3. Preliminary design of a Binary Breeder Reactor

    International Nuclear Information System (INIS)

    Garcia C, E. Y.; Francois, J. L.; Lopez S, R. C.

    2014-10-01

    A binary breeder reactor (BBR) is a reactor that by means of the transmutation and fission process can operates through the depleted uranium burning with a small quantity of fissile material. The advantages of a BBR with relation to other nuclear reactor types are numerous, taking into account their capacity to operate for a long time without requiring fuel reload or re-arrangement. In this work four different simulations are shown carried out with the MCNPX code with libraries Jeff-3.1 to 1200 K. The objective of this study is to compare two different models of BBR: a spherical reactor and a cylindrical one, using two fuel cycles for each one of them (U-Pu and Th-U) and different reflectors for the two different geometries. For all the models a super-criticality state was obtained at least 10.9 years without carrying out some fuel re-arrangement or reload. The plutonium-239 production was achieved in the models where natural uranium was used in the breeding area, while the production of uranium-233 was observed in the cases where thorium was used in the fertile area. Finally, a behavior of stationary wave reactor was observed inside the models of spherical reactor when contemplating the power uniform increment in the breeding area, while inside the cylindrical models was observed the behavior of a traveling wave reactor when registering the displacement of the burnt wave along the cylindrical model. (Author)

  4. Model Children's Code.

    Science.gov (United States)

    New Mexico Univ., Albuquerque. American Indian Law Center.

    The Model Children's Code was developed to provide a legally correct model code that American Indian tribes can use to enact children's codes that fulfill their legal, cultural and economic needs. Code sections cover the court system, jurisdiction, juvenile offender procedures, minor-in-need-of-care, and termination. Almost every Code section is…

  5. Affine Grassmann codes

    DEFF Research Database (Denmark)

    Høholdt, Tom; Beelen, Peter; Ghorpade, Sudhir Ramakant

    2010-01-01

    We consider a new class of linear codes, called affine Grassmann codes. These can be viewed as a variant of generalized Reed-Muller codes and are closely related to Grassmann codes.We determine the length, dimension, and the minimum distance of any affine Grassmann code. Moreover, we show that af...

  6. Performance Tuning of x86 OpenMP Codes with MAQAO

    Science.gov (United States)

    Barthou, Denis; Charif Rubial, Andres; Jalby, William; Koliai, Souad; Valensi, Cédric

    Failing to find the best optimization sequence for a given application code can lead to compiler generated codes with poor performances or inappropriate code. It is necessary to analyze performances from the assembly generated code to improve over the compilation process. This paper presents a tool for the performance analysis of multithreaded codes (OpenMP programs support at the moment). MAQAO relies on static performance evaluation to identify compiler optimizations and assess performance of loops. It exploits static binary rewriting for reading and instrumenting object files or executables. Static binary instrumentation allows the insertion of probes at instruction level. Memory accesses can be captured to help tune the code, but such traces require to be compressed. MAQAO can analyze the results and provide hints for tuning the code. We show on some examples how this can help users improve their OpenMP applications.

  7. Optimal design strategies for sibling studies with binary exposures.

    Science.gov (United States)

    Li, Zhigang; McKeague, Ian W; Lumey, Lambert H

    2014-01-01

    Sibling studies have become increasingly popular because they provide better control over confounding by unmeasured family-level risk factors than can be obtained in standard cohort studies. However, little attention has been devoted to the development of efficient design strategies for sibling studies in terms of optimizing power. We here address this issue in commonly encountered types of sibling studies, allowing for continuous and binary outcomes and varying numbers of exposed and unexposed siblings. For continuous outcomes, we show that in families with sibling pairs, optimal study power is obtained by recruiting discordant (exposed-control) pairs of siblings. More generally, balancing the exposure status within each family as evenly as possible is shown to be optimal. For binary outcomes, we elucidate how the optimal strategy depends on the variation of the binary response; as the within-family correlation increases, the optimal strategy tends toward only recruiting discordant sibling pairs (as in the case of continuous outcomes). R code for obtaining the optimal strategies is included.

  8. Decimal multiplication using compressor based-BCD to binary converter

    Directory of Open Access Journals (Sweden)

    Sasidhar Mukkamala

    2018-02-01

    Full Text Available The objective of this work is to implement a scalable decimal to binary converter from 8 to 64 bits (i.e 2-digit to 16-digit using parallel architecture. The proposed converters, along with binary coded decimal (BCD adder and binary to BCD converters, are used in parallel implementation of Urdhva Triyakbhyam (UT-based 32-bit BCD multiplier. To increase the performance, compressor circuits were used in converters and multiplier. The designed hardware circuits were verified by behavioural and post layout simulations. The implementation was carried out using Virtex-6 Field Programmable Gate Array (FPGA and Application Specific Integrated Circuit (ASIC with 90-nm technology library platforms. The results on FPGA shows that compressor based converters and multipliers produced less amount of propagation delay with a slight increase of hardware resources. In case of ASIC implementation, a compressor based converter delay is equivalent to conventional converter with a slight increase of gate count. However, the reduction of delay is evident in case of compressor based multiplier.

  9. Object tracking on mobile devices using binary descriptors

    Science.gov (United States)

    Savakis, Andreas; Quraishi, Mohammad Faiz; Minnehan, Breton

    2015-03-01

    With the growing ubiquity of mobile devices, advanced applications are relying on computer vision techniques to provide novel experiences for users. Currently, few tracking approaches take into consideration the resource constraints on mobile devices. Designing efficient tracking algorithms and optimizing performance for mobile devices can result in better and more efficient tracking for applications, such as augmented reality. In this paper, we use binary descriptors, including Fast Retina Keypoint (FREAK), Oriented FAST and Rotated BRIEF (ORB), Binary Robust Independent Features (BRIEF), and Binary Robust Invariant Scalable Keypoints (BRISK) to obtain real time tracking performance on mobile devices. We consider both Google's Android and Apple's iOS operating systems to implement our tracking approach. The Android implementation is done using Android's Native Development Kit (NDK), which gives the performance benefits of using native code as well as access to legacy libraries. The iOS implementation was created using both the native Objective-C and the C++ programing languages. We also introduce simplified versions of the BRIEF and BRISK descriptors that improve processing speed without compromising tracking accuracy.

  10. Odor concentration invariance by chemical ratio coding

    Directory of Open Access Journals (Sweden)

    Naoshige Uchida

    2008-08-01

    Full Text Available Many animal species rely on chemical signals to extract ecologically important information from the environment. Yet in natural conditions chemical signals will frequently undergo concentration changes that produce differences in both level and pattern of activation of olfactory receptor neurons. Thus, a central problem in olfactory processing is how the system is able to recognize the same stimulus across different concentrations. To signal species identity for mate recognition, some insects use the ratio of two components in a binary chemical mixture to produce a code that is invariant to dilution. Here, using psychophysical methods, we show that rats also classify binary odor mixtures according to the molar ratios of their components, spontaneously generalizing over at least a tenfold concentration range. These results indicate that extracting chemical ratio information is not restricted to pheromone signaling and suggest a general solution for concentration-invariant odor recognition by the mammalian olfactory system.

  11. Rateless feedback codes

    DEFF Research Database (Denmark)

    Sørensen, Jesper Hemming; Koike-Akino, Toshiaki; Orlik, Philip

    2012-01-01

    This paper proposes a concept called rateless feedback coding. We redesign the existing LT and Raptor codes, by introducing new degree distributions for the case when a few feedback opportunities are available. We show that incorporating feedback to LT codes can significantly decrease both...... the coding overhead and the encoding/decoding complexity. Moreover, we show that, at the price of a slight increase in the coding overhead, linear complexity is achieved with Raptor feedback coding....

  12. Low Complexity List Decoding for Polar Codes with Multiple CRC Codes

    Directory of Open Access Journals (Sweden)

    Jong-Hwan Kim

    2017-04-01

    Full Text Available Polar codes are the first family of error correcting codes that provably achieve the capacity of symmetric binary-input discrete memoryless channels with low complexity. Since the development of polar codes, there have been many studies to improve their finite-length performance. As a result, polar codes are now adopted as a channel code for the control channel of 5G new radio of the 3rd generation partnership project. However, the decoder implementation is one of the big practical problems and low complexity decoding has been studied. This paper addresses a low complexity successive cancellation list decoding for polar codes utilizing multiple cyclic redundancy check (CRC codes. While some research uses multiple CRC codes to reduce memory and time complexity, we consider the operational complexity of decoding, and reduce it by optimizing CRC positions in combination with a modified decoding operation. Resultingly, the proposed scheme obtains not only complexity reduction from early stopping of decoding, but also additional reduction from the reduced number of decoding paths.

  13. The structures of binary compounds

    CERN Document Server

    Hafner, J; Jensen, WB; Majewski, JA; Mathis, K; Villars, P; Vogl, P; de Boer, FR

    1990-01-01

    - Up-to-date compilation of the experimental data on the structures of binary compounds by Villars and colleagues. - Coloured structure maps which order the compounds into their respective structural domains and present for the first time the local co-ordination polyhedra for the 150 most frequently occurring structure types, pedagogically very helpful and useful in the search for new materials with a required crystal structure. - Crystal co-ordination formulas: a flexible notation for the interpretation of solid-state structures by chemist Bill Jensen. - Recent important advances in unders

  14. Young and Waltzing Binary Stars

    Science.gov (United States)

    2001-10-01

    ADONIS Observes Low-mass Eclipsing System in Orion Summary A series of very detailed images of a binary system of two young stars have been combined into a movie . In merely 3 days, the stars swing around each other. As seen from the earth, they pass in front of each other twice during a full revolution, producing eclipses during which their combined brightness diminishes . A careful analysis of the orbital motions has now made it possible to deduce the masses of the two dancing stars . Both turn out to be about as heavy as our Sun. But while the Sun is about 4500 million years old, these two stars are still in their infancy. They are located some 1500 light-years away in the Orion star-forming region and they probably formed just 10 million years ago . This is the first time such an accurate determination of the stellar masses could be achieved for a young binary system of low-mass stars . The new result provides an important piece of information for our current understanding of how young stars evolve. The observations were obtained by a team of astronomers from Italy and ESO [1] using the ADaptive Optics Near Infrared System (ADONIS) on the 3.6-m telescope at the ESO La Silla Observatory. PR Photo 29a/01 : The RXJ 0529.4+0041 system before primary eclipse PR Photo 29b/01 : The RXJ 0529.4+0041 system at mid-primary eclipse PR Photo 29c/01 : The RXJ 0529.4+0041 system after primary eclipse PR Photo 29d/01 : The RXJ 0529.4+0041 system before secondary eclipse PR Photo 29e/01 : The RXJ 0529.4+0041 system at mid-secondary eclipse PR Photo 29f/01 : The RXJ 0529.4+0041 system after secondary eclipse PR Video Clip 06/01 : Video of the RXJ 0529.4+0041 system Binary stars and stellar masses Since some time, astronomers have noted that most stars seem to form in binary or multiple systems. This is quite fortunate, as the study of binary stars is the only way in which it is possible to measure directly one of the most fundamental quantities of a star, its mass. The mass of a

  15. Pulsar magnetospheres in binary systems

    Science.gov (United States)

    Ershkovich, A. I.; Dolan, J. F.

    1985-01-01

    The criterion for stability of a tangential discontinuity interface in a magnetized, perfectly conducting inviscid plasma is investigated by deriving the dispersion equation including the effects of both gravitational and centrifugal acceleration. The results are applied to neutron star magnetospheres in X-ray binaries. The Kelvin-Helmholtz instability appears to be important in determining whether MHD waves of large amplitude generated by instability may intermix the plasma effectively, resulting in accretion onto the whole star as suggested by Arons and Lea and leading to no X-ray pulsar behavior.

  16. Tomographic reconstruction of binary fields

    International Nuclear Information System (INIS)

    Roux, Stéphane; Leclerc, Hugo; Hild, François

    2012-01-01

    A novel algorithm is proposed for reconstructing binary images from their projection along a set of different orientations. Based on a nonlinear transformation of the projection data, classical back-projection procedures can be used iteratively to converge to the sought image. A multiscale implementation allows for a faster convergence. The algorithm is tested on images up to 1 Mb definition, and an error free reconstruction is achieved with a very limited number of projection data, saving a factor of about 100 on the number of projections required for classical reconstruction algorithms.

  17. Self-orthogonal codes from some bush-type Hadamard matrices ...

    African Journals Online (AJOL)

    By means of a construction method outlined by Harada and Tonchev, we determine some non-binary self-orthogonal codes obtained from the row span of orbit matrices of Bush-type Hadamard matrices that admit a xed-point-free and xed-block-free automorphism of prime order. We show that the code [20; 15; 4]5 obtained ...

  18. Microlensing Signature of Binary Black Holes

    Science.gov (United States)

    Schnittman, Jeremy; Sahu, Kailash; Littenberg, Tyson

    2012-01-01

    We calculate the light curves of galactic bulge stars magnified via microlensing by stellar-mass binary black holes along the line-of-sight. We show the sensitivity to measuring various lens parameters for a range of survey cadences and photometric precision. Using public data from the OGLE collaboration, we identify two candidates for massive binary systems, and discuss implications for theories of star formation and binary evolution.

  19. Coding for dummies

    CERN Document Server

    Abraham, Nikhil

    2015-01-01

    Hands-on exercises help you learn to code like a pro No coding experience is required for Coding For Dummies,your one-stop guide to building a foundation of knowledge inwriting computer code for web, application, and softwaredevelopment. It doesn't matter if you've dabbled in coding or neverwritten a line of code, this book guides you through the basics.Using foundational web development languages like HTML, CSS, andJavaScript, it explains in plain English how coding works and whyit's needed. Online exercises developed by Codecademy, a leading online codetraining site, help hone coding skill

  20. Advanced video coding systems

    CERN Document Server

    Gao, Wen

    2015-01-01

    This comprehensive and accessible text/reference presents an overview of the state of the art in video coding technology. Specifically, the book introduces the tools of the AVS2 standard, describing how AVS2 can help to achieve a significant improvement in coding efficiency for future video networks and applications by incorporating smarter coding tools such as scene video coding. Topics and features: introduces the basic concepts in video coding, and presents a short history of video coding technology and standards; reviews the coding framework, main coding tools, and syntax structure of AV

  1. Establishing Malware Attribution and Binary Provenance Using Multicompilation Techniques

    Energy Technology Data Exchange (ETDEWEB)

    Ramshaw, M. J. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)

    2017-07-28

    Malware is a serious problem for computer systems and costs businesses and customers billions of dollars a year in addition to compromising their private information. Detecting malware is particularly difficult because malware source code can be compiled in many different ways and generate many different digital signatures, which causes problems for most anti-malware programs that rely on static signature detection. Our project uses a convolutional neural network to identify malware programs but these require large amounts of data to be effective. Towards that end, we gather thousands of source code files from publicly available programming contest sites and compile them with several different compilers and flags. Building upon current research, we then transform these binary files into image representations and use them to train a long-term recurrent convolutional neural network that will eventually be used to identify how a malware binary was compiled. This information will include the compiler, version of the compiler and the options used in compilation, information which can be critical in determining where a malware program came from and even who authored it.

  2. Survival of planets around shrinking stellar binaries

    Science.gov (United States)

    Muñoz, Diego J.; Lai, Dong

    2015-01-01

    The discovery of transiting circumbinary planets by the Kepler mission suggests that planets can form efficiently around binary stars. None of the stellar binaries currently known to host planets has a period shorter than 7 d, despite the large number of eclipsing binaries found in the Kepler target list with periods shorter than a few days. These compact binaries are believed to have evolved from wider orbits into their current configurations via the so-called Lidov–Kozai migration mechanism, in which gravitational perturbations from a distant tertiary companion induce large-amplitude eccentricity oscillations in the binary, followed by orbital decay and circularization due to tidal dissipation in the stars. Here we explore the orbital evolution of planets around binaries undergoing orbital decay by this mechanism. We show that planets may survive and become misaligned from their host binary, or may develop erratic behavior in eccentricity, resulting in their consumption by the stars or ejection from the system as the binary decays. Our results suggest that circumbinary planets around compact binaries could still exist, and we offer predictions as to what their orbital configurations should be like. PMID:26159412

  3. Speech perception of noise with binary gains

    DEFF Research Database (Denmark)

    Wang, DeLiang; Kjems, Ulrik; Pedersen, Michael Syskind

    2008-01-01

    For a given mixture of speech and noise, an ideal binary time-frequency mask is constructed by comparing speech energy and noise energy within local time-frequency units. It is observed that listeners achieve nearly perfect speech recognition from gated noise with binary gains prescribed...... by the ideal binary mask. Only 16 filter channels and a frame rate of 100 Hz are sufficient for high intelligibility. The results show that, despite a dramatic reduction of speech information, a pattern of binary gains provides an adequate basis for speech perception....

  4. Survival of planets around shrinking stellar binaries.

    Science.gov (United States)

    Muñoz, Diego J; Lai, Dong

    2015-07-28

    The discovery of transiting circumbinary planets by the Kepler mission suggests that planets can form efficiently around binary stars. None of the stellar binaries currently known to host planets has a period shorter than 7 d, despite the large number of eclipsing binaries found in the Kepler target list with periods shorter than a few days. These compact binaries are believed to have evolved from wider orbits into their current configurations via the so-called Lidov-Kozai migration mechanism, in which gravitational perturbations from a distant tertiary companion induce large-amplitude eccentricity oscillations in the binary, followed by orbital decay and circularization due to tidal dissipation in the stars. Here we explore the orbital evolution of planets around binaries undergoing orbital decay by this mechanism. We show that planets may survive and become misaligned from their host binary, or may develop erratic behavior in eccentricity, resulting in their consumption by the stars or ejection from the system as the binary decays. Our results suggest that circumbinary planets around compact binaries could still exist, and we offer predictions as to what their orbital configurations should be like.

  5. Robust image transmission performed by SPIHT and turbo-codes

    Directory of Open Access Journals (Sweden)

    Lakhdar Moulay Abdelmounaim

    2008-01-01

    Full Text Available This work describes the method for providing robustness to errors from a binary symmetric channel for the SPIHT image compression. The source rate and channel rate are jointly optimized by a stream of fixed-size channel packets. Punctured turbo codes are used for the channel coding, providing stronger error protection than previously available codes. We use the most appropriate set of puncturing patterns that ensure the best source rate. The presented rate allocation scheme obtains all necessary information from the SPIHT encoder, without requiring image decompression.

  6. Circulant Arrays on Cyclic Subgroups of Finite Fields: Rank Analysis and Construction of Quasi-Cyclic LDPC Codes

    OpenAIRE

    Zhang, Li; Lin, Shu; Abdel-Ghaffar, Khaled; Ding, Zhi; Zhou, Bo

    2010-01-01

    This paper consists of three parts. The first part presents a large class of new binary quasi-cyclic (QC)-LDPC codes with girth of at least 6 whose parity-check matrices are constructed based on cyclic subgroups of finite fields. Experimental results show that the codes constructed perform well over the binary-input AWGN channel with iterative decoding using the sum-product algorithm (SPA). The second part analyzes the ranks of the p...

  7. A Stream Encryption Scheme with Both Key and Plaintext Avalanche Effects for Designing Chaos-Based Pseudorandom Number Generator with Application to Image Encryption

    Science.gov (United States)

    Han, Dandan; Min, Lequan; Chen, Guanrong

    Based on a stream encryption scheme with avalanche effect (SESAE), a stream encryption scheme with both key avalanche effect and plaintext avalanche effect (SESKPAE) is introduced. Using this scheme and an ideal 2d-word (d-segment) pseudorandom number generator (PRNG), a plaintext can be encrypted such that each bit of the ciphertext block has a change with the probable probability of (2d - 1)/2d when any word of the key is changed or any bit of the plaintext is changed. To that end, a novel four-dimensional discrete chaotic system (4DDCS) is proposed. Combining the 4DDCS with a generalized synchronization (GS) theorem, a novel eight-dimensional discrete GS chaotic system (8DDGSCS) is constructed. Using the 8DDGSCS, a 216-word chaotic pseudorandom number generator (CPRNG) is designed. The keyspace of the 216-word CPRNG is larger than 21195. Then, the FIPS 140-2 test suit/generalized FIPS 140-2 test suit is used to test the randomness of the 1000-key streams consisting of 20000 bits generated by the 216-word CPRNG, the RC4 algorithm PRNG and the ZUC algorithm PRNG, respectively. The test results show that for the three PRNGs, there are 100%/98.9%, 99.9%/98.8%, 100%/97.9% key streams passing the tests, respectively. Furthermore, the SP800-22 test suite is used to test the randomness of four 100-key streams consisting of 1000000 bits generated by four PRNGs, respectively. The numerical results show that the randomness performances of the 216-word CPRNG is promising, showing that there are no significant correlations between the key streams and the perturbed key streams generated via the 216-word CPRNG. Finally, using the 216-word CPRNG and the SESKPAE to encrypt two gray-scale images, test results demonstrate that the 216-word CPRNG is able to generate both key avalanche effect and plaintext avalanche effect, which are similar to those generated via an ideal CPRNG, and performs better than other comparable schemes.

  8. Locally orderless registration code

    DEFF Research Database (Denmark)

    2012-01-01

    This is code for the TPAMI paper "Locally Orderless Registration". The code requires intel threadding building blocks installed and is provided for 64 bit on mac, linux and windows.......This is code for the TPAMI paper "Locally Orderless Registration". The code requires intel threadding building blocks installed and is provided for 64 bit on mac, linux and windows....

  9. Error Correcting Codes

    Indian Academy of Sciences (India)

    sound quality is, in essence, obtained by accurate waveform coding and decoding of the audio signals. In addition, the coded audio information is protected against disc errors by the use of a Cross Interleaved Reed-Solomon Code (CIRC). Reed-. Solomon codes were discovered by Irving Reed and Gus Solomon in 1960.

  10. Binary Relations as a Foundation of Mathematics

    NARCIS (Netherlands)

    Kuper, Jan; Barendsen, E.; Capretta, V.; Geuvers, H.; Niqui, M.

    2007-01-01

    We describe a theory for binary relations in the Zermelo-Fraenkel style. We choose for ZFCU, a variant of ZFC Set theory in which the Axiom of Foundation is replaced by an axiom allowing for non-wellfounded sets. The theory of binary relations is shown to be equi-consistent ZFCU by constructing a

  11. Novel quantum inspired binary neural network algorithm

    Indian Academy of Sciences (India)

    In this paper, a quantum based binary neural network algorithm is proposed, named as novel quantum binary neural network algorithm (NQ-BNN). It forms a neural network structure by deciding weights and separability parameter in quantum based manner. Quantum computing concept represents solution probabilistically ...

  12. The Evolution of Compact Binary Star Systems.

    Science.gov (United States)

    Postnov, Konstantin A; Yungelson, Lev R

    2014-01-01

    We review the formation and evolution of compact binary stars consisting of white dwarfs (WDs), neutron stars (NSs), and black holes (BHs). Mergings of compact-star binaries are expected to be the most important sources for forthcoming gravitational-wave (GW) astronomy. In the first part of the review, we discuss observational manifestations of close binaries with NS and/or BH components and their merger rate, crucial points in the formation and evolution of compact stars in binary systems, including the treatment of the natal kicks, which NSs and BHs acquire during the core collapse of massive stars and the common envelope phase of binary evolution, which are most relevant to the merging rates of NS-NS, NS-BH and BH-BH binaries. The second part of the review is devoted mainly to the formation and evolution of binary WDs and their observational manifestations, including their role as progenitors of cosmologically-important thermonuclear SN Ia. We also consider AM CVn-stars, which are thought to be the best verification binary GW sources for future low-frequency GW space interferometers.

  13. The Evolution of Compact Binary Star Systems

    Directory of Open Access Journals (Sweden)

    Yungelson, Lev R.

    2006-12-01

    Full Text Available We review the formation and evolution of compact binary stars consisting of white dwarfs (WDs, neutron stars (NSs, and black holes (BHs. Binary NSs and BHs are thought to be the primary astrophysical sources of gravitational waves (GWs within the frequency band of ground-based detectors, while compact binaries of WDs are important sources of GWs at lower frequencies to be covered by space interferometers (LISA. Major uncertainties in the current understanding of properties of NSs and BHs most relevant to the GW studies are discussed, including the treatment of the natal kicks which compact stellar remnants acquire during the core collapse of massive stars and the common envelope phase of binary evolution. We discuss the coalescence rates of binary NSs and BHs and prospects for their detections, the formation and evolution of binary WDs and their observational manifestations. Special attention is given to AM CVn-stars -- compact binaries in which the Roche lobe is filled by another WD or a low-mass partially degenerate helium-star, as these stars are thought to be the best LISA verification binary GW sources.

  14. The Evolution of Compact Binary Star Systems

    Directory of Open Access Journals (Sweden)

    Konstantin A. Postnov

    2014-05-01

    Full Text Available We review the formation and evolution of compact binary stars consisting of white dwarfs (WDs, neutron stars (NSs, and black holes (BHs. Mergings of compact-star binaries are expected to be the most important sources for forthcoming gravitational-wave (GW astronomy. In the first part of the review, we discuss observational manifestations of close binaries with NS and/or BH components and their merger rate, crucial points in the formation and evolution of compact stars in binary systems, including the treatment of the natal kicks, which NSs and BHs acquire during the core collapse of massive stars and the common envelope phase of binary evolution, which are most relevant to the merging rates of NS-NS, NS-BH and BH-BH binaries. The second part of the review is devoted mainly to the formation and evolution of binary WDs and their observational manifestations, including their role as progenitors of cosmologically-important thermonuclear SN Ia. We also consider AM CVn-stars, which are thought to be the best verification binary GW sources for future low-frequency GW space interferometers.

  15. Microlensing Binaries with Candidate Brown Dwarf Companions

    DEFF Research Database (Denmark)

    Shin, I.-G; Han, C.; Gould, A.

    2012-01-01

    Brown dwarfs are important objects because they may provide a missing link between stars and planets, two populations that have dramatically different formation histories. In this paper, we present the candidate binaries with brown dwarf companions that are found by analyzing binary microlensing...... with well-covered light curves increases with new-generation searches....

  16. Statistical properties of spectroscopic binary stars

    NARCIS (Netherlands)

    Hogeveen, S.J.

    1992-01-01

    As part of a study of the mass-ratio distribution of spectroscopic binary stars, the statistical properties of the systems in the Eighth Catalogue of the Orbital Elements of Spectroscopic Binary Stars, compiled by Batten et al. (1989), are investigated. Histograms are presented of the

  17. An Acidity Scale for Binary Oxides.

    Science.gov (United States)

    Smith, Derek W.

    1987-01-01

    Discusses the classification of binary oxides as acidic, basic, or amphoteric. Demonstrates how a numerical scale for acidity/basicity of binary oxides can be constructed using thermochemical data for oxoacid salts. Presents the calculations derived from the data that provide the numeric scale values. (TW)

  18. Binary trees equipped with semivaluations | Pajoohesh ...

    African Journals Online (AJOL)

    Our interest in this lattice stems from its application to binary decision trees. Binary decision trees form a crucial tool for algorithmic time analysis. The lattice properties of Tn are studied and we show that every Tn has a sublattice isomorphic to Tn-1 and prove that Tn is generated by Tn-1. Also we show that the distance from ...

  19. Eliciting Subjective Probabilities with Binary Lotteries

    DEFF Research Database (Denmark)

    Harrison, Glenn W.; Martínez-Correa, Jimmy; Swarthout, J. Todd

    objective probabilities. Drawing a sample from the same subject population, we find evidence that the binary lottery procedure induces linear utility in a subjective probability elicitation task using the Quadratic Scoring Rule. We also show that the binary lottery procedure can induce direct revelation...

  20. Network Coding Taxonomy

    OpenAIRE

    Adamson , Brian; Adjih , Cédric; Bilbao , Josu; Firoiu , Victor; Fitzek , Frank; Samah , Ghanem ,; Lochin , Emmanuel; Masucci , Antonia; Montpetit , Marie-Jose; Pedersen , Morten V.; Peralta , Goiuri; Roca , Vincent; Paresh , Saxena; Sivakumar , Senthil

    2017-01-01

    Internet Research Task Force - Working document of the Network Coding Research Group (NWCRG), draft-irtf-nwcrg-network-coding-taxonomy-05 (work in progress), https://datatracker.ietf.org/doc/draft-irtf-nwcrg-network-coding-taxonomy/; This document summarizes a recommended terminology for Network Coding concepts and constructs. It provides a comprehensive set of terms with unique names in order to avoid ambiguities in future Network Coding IRTF and IETF documents. This document is intended to ...

  1. QR Codes 101

    Science.gov (United States)

    Crompton, Helen; LaFrance, Jason; van 't Hooft, Mark

    2012-01-01

    A QR (quick-response) code is a two-dimensional scannable code, similar in function to a traditional bar code that one might find on a product at the supermarket. The main difference between the two is that, while a traditional bar code can hold a maximum of only 20 digits, a QR code can hold up to 7,089 characters, so it can contain much more…

  2. Mass Transfer in Mira-Type Binaries

    Directory of Open Access Journals (Sweden)

    Mohamed S.

    2012-06-01

    Full Text Available Detached, symbiotic binaries are generally assumed to interact via Bondi-Hoyle-Littleton (BHL wind accretion. However, the accretion rates and outflow geometries that result from this mass-transfer mechanism cannot adequately explain the observations of the nearest and best studied symbiotic binary, Mira, or the formation of some post-AGB binaries, e.g. barium stars. We propose a new mass-transfer mode for Mira-type binaries, which we call ‘wind Roche-lobe overflow’ (WRLOF, and which we demonstrate with 3D hydrodynamic simulations. Importantly, we show that the circumstellar outflows which result from WRLOF tend to be highly aspherical and strongly focused towards the binary orbital plane. Furthermore, the subsequent mass-transfer rates are at least an order of magnitude greater than the analogous BHL values. We discuss the implications of these results for the shaping of bipolar (proto-planetary nebulae and other related systems.

  3. Detection Rates for Close Binaries via Microlensing

    Science.gov (United States)

    Gaudi, B. Scott; Gould, Andrew

    1997-06-01

    Microlensing is one of the most promising methods of reconstructing the stellar mass function down to masses even below the hydrogen-burning limit. The fundamental limit to this technique is the presence of unresolved binaries, which can, in principle, significantly alter the inferred mass function. Here we quantify the fraction of binaries that can be detected using microlensing, considering specifically the mass ratio and separation of the binary. We find that almost all binary systems with separations greater than b ~ 0.4 of their combined Einstein ring radius are detectable assuming a detection threshold of 3%. For two M dwarfs, this corresponds to a limiting separation of >~1 AU. Since very few observed M dwarfs have companions at separations corrupt the measurements of the mass function. We find that the detectability depends only weakly on the mass ratio. For those events for which individual masses can be determined, we find that binaries can be detected down to b ~ 0.2.

  4. Phonons in fcc binary alloys

    International Nuclear Information System (INIS)

    Sharma, Amita; Rathore, R.P.S.

    1992-01-01

    Born-Mayer potential has been modified to account for the unpaired (three body) forces among the common nearest neighbours of the ordered binary fcc alloys i.e. Ni 3 Fe 7 , Ni 5 Fe 5 and Ni 75 Fe 25 . The three body potential is added to the two body form of Morse to formalize the total interaction potential. Measured inverse ionic compressibility, cohesive energy, lattice constant and one measured phonon frequency are used to evaluate the defining parameters of the potential. The potential seeks to bring about the binding among 140 and 132 atoms though pair wise (two body) and non-pair wise (three body) forces respectively. The phonon-dispersion relations obtained by solving the secular equation are compared with the experimental findings on the aforesaid alloys. (author). 19 refs., 3 figs

  5. A Comparison of Grid-based and SPH Binary Mass-transfer and Merger Simulations

    Energy Technology Data Exchange (ETDEWEB)

    Motl, Patrick M. [Indiana University Kokomo, School of Sciences, P.O. Box 9003, Kokomo, IN 46903-9004 (United States); Frank, Juhan; Clayton, Geoffrey C.; Tohline, Joel E. [Louisiana State University, Department of Physics and Astronomy, 202 Nicholson Hall, Baton Rouge, LA 70803-4001 (United States); Staff, Jan [College of Science and Math, University of Virgin Islands, St. Thomas, United States Virgin Islands 00802 (United States); Fryer, Christopher L.; Even, Wesley [Center for Theoretical Astrophysics/CCS-2, Los Alamos National Laboratory, P.O. Box 1663, Los Alamos, NM 87545 (United States); Diehl, Steven, E-mail: pmotl@iuk.edu [TLT-Turbo GmbH, Gleiwitzstrasse 7, 66482 Zweibrücken (Germany)

    2017-04-01

    There is currently a great amount of interest in the outcomes and astrophysical implications of mergers of double degenerate binaries. In a commonly adopted approximation, the components of such binaries are represented by polytropes with an index of n  = 3/2. We present detailed comparisons of stellar mass-transfer and merger simulations of polytropic binaries that have been carried out using two very different numerical algorithms—a finite-volume “grid” code and a smoothed-particle hydrodynamics (SPH) code. We find that there is agreement in both the ultimate outcomes of the evolutions and the intermediate stages if the initial conditions for each code are chosen to match as closely as possible. We find that even with closely matching initial setups, the time it takes to reach a concordant evolution differs between the two codes because the initial depth of contact cannot be matched exactly. There is a general tendency for SPH to yield higher mass transfer rates and faster evolution to the final outcome. We also present comparisons of simulations calculated from two different energy equations: in one series, we assume a polytropic equation of state and in the other series an ideal gas equation of state. In the latter series of simulations, an atmosphere forms around the accretor, which can exchange angular momentum and cause a more rapid loss of orbital angular momentum. In the simulations presented here, the effect of the ideal equation of state is to de-stabilize the binary in both SPH and grid simulations, but the effect is more pronounced in the grid code.

  6. The Coding of Biological Information: From Nucleotide Sequence to Protein Recognition

    Science.gov (United States)

    Štambuk, Nikola

    The paper reviews the classic results of Swanson, Dayhoff, Grantham, Blalock and Root-Bernstein, which link genetic code nucleotide patterns to the protein structure, evolution and molecular recognition. Symbolic representation of the binary addresses defining particular nucleotide and amino acid properties is discussed, with consideration of: structure and metric of the code, direct correspondence between amino acid and nucleotide information, and molecular recognition of the interacting protein motifs coded by the complementary DNA and RNA strands.

  7. Efficient Coding of Information: Huffman Coding -RE ...

    Indian Academy of Sciences (India)

    1. Introduction. Shannon's landmark paper 'A Mathematical Theory of. Communication' [1] laid the foundation for communica- ... coding theory, codes over graphs and iterative techniques, and informa- tion theory. .... An important consequence of independence is that if. {Xb X2 , . Xn} are independent random variables, each.

  8. Turbo Codes Extended with Outer BCH Code

    DEFF Research Database (Denmark)

    Andersen, Jakob Dahl

    1996-01-01

    The "error floor" observed in several simulations with the turbo codes is verified by calculation of an upper bound to the bit error rate for the ensemble of all interleavers. Also an easy way to calculate the weight enumerator used in this bound is presented. An extended coding scheme is proposed...

  9. Optimizing ATLAS code with different profilers

    Science.gov (United States)

    Kama, S.; Seuster, R.; Stewart, G. A.; Vitillo, R. A.

    2014-06-01

    After the current maintenance period, the LHC will provide higher energy collisions with increased luminosity. In order to keep up with these higher rates, ATLAS software needs to speed up substantially. However, ATLAS code is composed of approximately 6M lines, written by many different programmers with different backgrounds, which makes code optimisation a challenge. To help with this effort different profiling tools and techniques are being used. These include well known tools, such as the Valgrind suite and Intel Amplifier; less common tools like Pin, PAPI, and GOoDA; as well as techniques such as library interposing. In this paper we will mainly focus on Pin tools and GOoDA. Pin is a dynamic binary instrumentation tool which can obtain statistics such as call counts, instruction counts and interrogate functions' arguments. It has been used to obtain CLHEP Matrix profiles, operations and vector sizes for linear algebra calculations which has provided the insight necessary to achieve significant performance improvements. Complimenting this, GOoDA, an in-house performance tool built in collaboration with Google, which is based on hardware performance monitoring unit events, is used to identify hot-spots in the code for different types of hardware limitations, such as CPU resources, caches, or memory bandwidth. GOoDA has been used in improvement of the performance of new magnetic field code and identification of potential vectorization targets in several places, such as Runge-Kutta propagation code.

  10. The best bits in an iris code.

    Science.gov (United States)

    Hollingsworth, Karen P; Bowyer, Kevin W; Flynn, Patrick J

    2009-06-01

    Iris biometric systems apply filters to iris images to extract information about iris texture. Daugman's approach maps the filter output to a binary iris code. The fractional Hamming distance between two iris codes is computed and decisions about the identity of a person are based on the computed distance. The fractional Hamming distance weights all bits in an iris code equally. However, not all the bits in an iris code are equally useful. Our research is the first to present experiments documenting that some bits are more consistent than others. Different regions of the iris are compared to evaluate their relative consistency, and contrary to some previous research, we find that the middle bands of the iris are more consistent than the inner bands. The inconsistent-bit phenomenon is evident across genders and different filter types. Possible causes of inconsistencies, such as segmentation, alignment issues, and different filters are investigated. The inconsistencies are largely due to the coarse quantization of the phase response. Masking iris code bits corresponding to complex filter responses near the axes of the complex plane improves the separation between the match and nonmatch Hamming distance distributions.

  11. Methodology for bus layout for topological quantum error correcting codes

    Energy Technology Data Exchange (ETDEWEB)

    Wosnitzka, Martin; Pedrocchi, Fabio L.; DiVincenzo, David P. [RWTH Aachen University, JARA Institute for Quantum Information, Aachen (Germany)

    2016-12-15

    Most quantum computing architectures can be realized as two-dimensional lattices of qubits that interact with each other. We take transmon qubits and transmission line resonators as promising candidates for qubits and couplers; we use them as basic building elements of a quantum code. We then propose a simple framework to determine the optimal experimental layout to realize quantum codes. We show that this engineering optimization problem can be reduced to the solution of standard binary linear programs. While solving such programs is a NP-hard problem, we propose a way to find scalable optimal architectures that require solving the linear program for a restricted number of qubits and couplers. We apply our methods to two celebrated quantum codes, namely the surface code and the Fibonacci code. (orig.)

  12. Performance Analysis of Faulty Gallager-B Decoding of QC-LDPC Codes with Applications

    Directory of Open Access Journals (Sweden)

    O. Al Rasheed

    2014-06-01

    Full Text Available In this paper we evaluate the performance of Gallager-B algorithm, used for decoding low-density parity-check (LDPC codes, under unreliable message computation. Our analysis is restricted to LDPC codes constructed from circular matrices (QC-LDPC codes. Using Monte Carlo simulation we investigate the effects of different code parameters on coding system performance, under a binary symmetric communication channel and independent transient faults model. One possible application of the presented analysis in designing memory architecture with unreliable components is considered.

  13. Analysis and design of Raptor codes using a multi-edge framework

    OpenAIRE

    Jayasooriya, Sachini; Shirvanimoghaddam, Mahyar; Ong, Lawrence; Johnson, Sarah J.

    2017-01-01

    The focus of this paper is on the analysis and design of Raptor codes using a multi-edge framework. In this regard, we first represent the Raptor code as a multi-edge type low-density parity-check (METLDPC) code. This MET representation gives a general framework to analyze and design Raptor codes over a binary input additive white Gaussian noise channel using MET density evolution (MET-DE). We consider a joint decoding scheme based on the belief propagation (BP) decoding for Raptor codes in t...

  14. Rate-adaptive Constellation Shaping for Near-capacity Achieving Turbo Coded BICM

    DEFF Research Database (Denmark)

    Yankov, Metodi Plamenov; Forchhammer, Søren; Larsen, Knud J.

    2014-01-01

    In this paper the problem of constellation shaping is considered. Mapping functions are designed for a many- to-one signal shaping strategy, combined with a turbo coded Bit-interleaved Coded Modulation (BICM), based on symmetric Huffman codes with binary reflected Gray-like properties. An algorithm...... quality estimation. Gains of more than 1dB are observed for high SNR compared to conventional turbo coded BICM, and it is shown that the mapping functions designed here significantly outperform current state of the art Turbo- Trellis Coded Modulation and other existing constellation shaping methods...

  15. Optimizing the ATLAS code with different profilers

    CERN Document Server

    Kama, S; The ATLAS collaboration

    2013-01-01

    After the current maintenance period, the LHC will provide higher energy collisions with increased luminosity. In order to keep up with these higher rates, ATLAS software needs to speed up substantially. However, ATLAS code is composed of approximately 4M lines, written by many different programmers with different backgrounds, which makes code optimisation a challenge. To help with this effort different profiling tools and techniques are being used. These include well known tools, such as the Valgrind suite and Intel Amplifier; less common tools like PIN, PAPI, and GOODA; as well as techniques such as library interposing. In this talk we will mainly focus on PIN tools and GOODA. PIN is a dynamic binary instrumentation tool which can obtain statistics such as call counts, instruction counts and interrogate functions' arguments. It has been used to obtain CLHEP Matrix profiles, operations and vector sizes for linear algebra calculations which has provided the insight necessary to achieve significant performance...

  16. Maximizing entropy of image models for 2-D constrained coding

    DEFF Research Database (Denmark)

    Forchhammer, Søren; Danieli, Matteo; Burini, Nino

    2010-01-01

    This paper considers estimating and maximizing the entropy of two-dimensional (2-D) fields with application to 2-D constrained coding. We consider Markov random fields (MRF), which have a non-causal description, and the special case of Pickard random fields (PRF). The PRF are 2-D causal finite...... context models, which define stationary probability distributions on finite rectangles and thus allow for calculation of the entropy. We consider two binary constraints and revisit the hard square constraint given by forbidding neighboring 1s and provide novel results for the constraint that no uniform 2...... £ 2 squares contains all 0s or all 1s. The maximum values of the entropy for the constraints are estimated and binary PRF satisfying the constraint are characterized and optimized w.r.t. the entropy. The maximum binary PRF entropy is 0.839 bits/symbol for the no uniform squares constraint. The entropy...

  17. Topological and categorical properties of binary trees

    Directory of Open Access Journals (Sweden)

    H. Pajoohesh

    2008-04-01

    Full Text Available Binary trees are very useful tools in computer science for estimating the running time of so-called comparison based algorithms, algorithms in which every action is ultimately based on a prior comparison between two elements. For two given algorithms A and B where the decision tree of A is more balanced than that of B, it is known that the average and worst case times of A will be better than those of B, i.e., ₸A(n ≤₸B(n and TWA (n≤TWB (n. Thus the most balanced and the most imbalanced binary trees play a main role. Here we consider them as semilattices and characterize the most balanced and the most imbalanced binary trees by topological and categorical properties. Also we define the composition of binary trees as a commutative binary operation, *, such that for binary trees A and B, A * B is the binary tree obtained by attaching a copy of B to any leaf of A. We show that (T,* is a commutative po-monoid and investigate its properties.

  18. TIDAL DISRUPTIONS IN CIRCUMBINARY DISKS. I. STAR FORMATION, DYNAMICS, AND BINARY EVOLUTION

    Energy Technology Data Exchange (ETDEWEB)

    Amaro-Seoane, Pau; Brem, Patrick [Max Planck Institut fuer Gravitationsphysik (Albert-Einstein-Institut), D-14476 Potsdam (Germany); Cuadra, Jorge, E-mail: Pau.Amaro-Seoane@aei.mpg.de, E-mail: Patrick.Brem@aei.mpg.de, E-mail: jcuadra@astro.puc.cl [Departamento de Astronomia y Astrofisica, Facultad de Fisica, Pontificia Universidad Catolica de Chile, 782-0436 Santiago (Chile)

    2013-02-10

    In our current interpretation of the hierarchical structure of the universe, it is well established that galaxies collide and merge with each other during their lifetimes. If massive black holes (MBHs) reside in galactic centers, we expect them to form binaries in galactic nuclei surrounded by a circumbinary disk. If cooling is efficient enough, the gas in the disk will clump and trigger stellar formation in situ. In this first paper we address the evolution of the binary under the influence of the newly formed stars, which form individually and also clustered. We use smoothed particle hydrodynamics techniques to evolve the gas in the circumbinary disk and to study the phase of star formation. When the amount of gas in the disk is negligible, we further evolve the system with a high-accurate direct-summation N-body code to follow the evolution of the stars, the innermost binary and tidal disruption events (TDEs). For this, we modify the direct N-body code to include (1) treatment of TDEs and (2) 'gas cloud particles' that mimic the gas, so that the stellar clusters do not dissolve when we follow their infall on to the MBHs. We find that the amount of stars disrupted by either infalling stellar clusters or individual stars is as large as 10{sup -4} yr{sup -1} per binary, higher than expected for typical galaxies.

  19. Binary Black Hole Mergers from Field Triples: Properties, Rates, and the Impact of Stellar Evolution

    Energy Technology Data Exchange (ETDEWEB)

    Antonini, Fabio [Center for Interdisciplinary Exploration and Research in Astrophysics (CIERA) and Department of Physics and Astrophysics, Northwestern University, Evanston, IL 60208 (United States); Toonen, Silvia [Astronomical Institute Anton Pannekoek, University of Amsterdam, P.O. Box 94249, 1090 GE, Amsterdam (Netherlands); Hamers, Adrian S. [Institute for Advanced Study, School of Natural Sciences, Einstein Drive, Princeton, NJ 08540 (United States)

    2017-06-01

    We consider the formation of binary black hole (BH) mergers through the evolution of field massive triple stars. In this scenario, favorable conditions for the inspiral of a BH binary are initiated by its gravitational interaction with a distant companion, rather than by a common-envelope phase invoked in standard binary evolution models. We use a code that follows self-consistently the evolution of massive triple stars, combining the secular triple dynamics (Lidov–Kozai cycles) with stellar evolution. After a BH triple is formed, its dynamical evolution is computed using either the orbit-averaged equations of motion, or a high-precision direct integrator for triples with weaker hierarchies for which the secular perturbation theory breaks down. Most BH mergers in our models are produced in the latter non-secular dynamical regime. We derive the properties of the merging binaries and compute a BH merger rate in the range (0.3–1.3) Gpc{sup −3} yr{sup −1}, or up to ≈2.5 Gpc{sup −3} yr{sup −1} if the BH orbital planes have initially random orientation. Finally, we show that BH mergers from the triple channel have significantly higher eccentricities than those formed through the evolution of massive binaries or in dense star clusters. Measured eccentricities could therefore be used to uniquely identify binary mergers formed through the evolution of triple stars. While our results suggest up to ≈10 detections per year with Advanced-LIGO, the high eccentricities could render the merging binaries harder to detect with planned space based interferometers such as LISA.

  20. The chemical evolution of the solar neighbourhood: the effect of binaries

    Science.gov (United States)

    De Donder, E.; Vanbeveren, D.

    2002-03-01

    In this paper we compute the time evolution of the elements ( 4He, 12C, 14N, 16O, 20Ne, 24Mg, 28Si, 32S, 40Ca and 56Fe) and of the supernova rates in the solar neighbourhood by means of a galactic chemical evolutionary code that includes in detail the evolution of both single and binary stars. Special attention is payed to the formation of black holes. Our main conclusions: in order to predict the galactic time evolution of the different types of supernovae, it is essential to compute in detail the evolution of the binary population, the observed time evolution of carbon is better reproduced by a galactic model where the effect is included of a significant fraction of intermediate mass binaries, massive binary mass exchange provides a possible solution for the production of primary nitrogen during the very early phases of galactic evolution, chemical evolutionary models with binaries or without binaries but with a detailed treatment of the SN Ia progenitors predict very similar age-metallicity relations and very similar G-dwarf distributions whereas the evolution of the yields as function of time of the elements 4He, 16O, 20Ne, 24Mg, 28Si, 32S and 40Ca differ by no more than a factor of two or three, the observed time evolution of oxygen is best reproduced when most of the oxygen produced during core helium burning in ALL massive stars serves to enrich the interstellar medium. This can be used as indirect evidence that (massive) black hole formation in single stars and binary components is always preceded by a supernova explosion.

  1. Binary Black Hole Mergers from Field Triples: Properties, Rates, and the Impact of Stellar Evolution

    International Nuclear Information System (INIS)

    Antonini, Fabio; Toonen, Silvia; Hamers, Adrian S.

    2017-01-01

    We consider the formation of binary black hole (BH) mergers through the evolution of field massive triple stars. In this scenario, favorable conditions for the inspiral of a BH binary are initiated by its gravitational interaction with a distant companion, rather than by a common-envelope phase invoked in standard binary evolution models. We use a code that follows self-consistently the evolution of massive triple stars, combining the secular triple dynamics (Lidov–Kozai cycles) with stellar evolution. After a BH triple is formed, its dynamical evolution is computed using either the orbit-averaged equations of motion, or a high-precision direct integrator for triples with weaker hierarchies for which the secular perturbation theory breaks down. Most BH mergers in our models are produced in the latter non-secular dynamical regime. We derive the properties of the merging binaries and compute a BH merger rate in the range (0.3–1.3) Gpc −3 yr −1 , or up to ≈2.5 Gpc −3 yr −1 if the BH orbital planes have initially random orientation. Finally, we show that BH mergers from the triple channel have significantly higher eccentricities than those formed through the evolution of massive binaries or in dense star clusters. Measured eccentricities could therefore be used to uniquely identify binary mergers formed through the evolution of triple stars. While our results suggest up to ≈10 detections per year with Advanced-LIGO, the high eccentricities could render the merging binaries harder to detect with planned space based interferometers such as LISA.

  2. Instabilities in Interacting Binary Stars

    Science.gov (United States)

    Andronov, I. L.; Andrych, K. D.; Antoniuk, K. A.; Baklanov, A. V.; Beringer, P.; Breus, V. V.; Burwitz, V.; Chinarova, L. L.; Chochol, D.; Cook, L. M.; Cook, M.; Dubovský, P.; Godlowski, W.; Hegedüs, T.; Hoňková, K.; Hric, L.; Jeon, Y.-B.; Juryšek, J.; Kim, C.-H.; Kim, Y.; Kim, Y.-H.; Kolesnikov, S. V.; Kudashkina, L. S.; Kusakin, A. V.; Marsakova, V. I.; Mason, P. A.; Mašek, M.; Mishevskiy, N.; Nelson, R. H.; Oksanen, A.; Parimucha, S.; Park, J.-W.; Petrík, K.; Quiñones, C.; Reinsch, K.; Robertson, J. W.; Sergey, I. M.; Szpanko, M.; Tkachenko, M. G.; Tkachuk, L. G.; Traulsen, I.; Tremko, J.; Tsehmeystrenko, V. S.; Yoon, J.-N.; Zola, S.; Shakhovskoy, N. M.

    2017-07-01

    The types of instability in the interacting binary stars are briefly reviewed. The project “Inter-Longitude Astronomy” is a series of smaller projects on concrete stars or groups of stars. It has no special funds, and is supported from resources and grants of participating organizations, when informal working groups are created. This “ILA” project is in some kind similar and complementary to other projects like WET, CBA, UkrVO, VSOLJ, BRNO, MEDUZA, AstroStatistics, where many of us collaborate. Totally we studied 1900+ variable stars of different types, including newly discovered variables. The characteristic timescale is from seconds to decades and (extrapolating) even more. The monitoring of the first star of our sample AM Her was initiated by Prof. V.P. Tsesevich (1907-1983). Since more than 358 ADS papers were published. In this short review, we present some highlights of our photometric and photo-polarimetric monitoring and mathematical modeling of interacting binary stars of different types: classical (AM Her, QQ Vul, V808 Aur = CSS 081231:071126+440405, FL Cet), asynchronous (BY Cam, V1432 Aql), intermediate (V405 Aql, BG CMi, MU Cam, V1343 Her, FO Aqr, AO Psc, RXJ 2123, 2133, 0636, 0704) polars and magnetic dwarf novae (DO Dra) with 25 timescales corresponding to different physical mechanisms and their combinations (part “Polar”); negative and positive superhumpers in nova-like (TT Ari, MV Lyr, V603 Aql, V795 Her) and many dwarf novae stars (“Superhumper”); eclipsing “non-magnetic” cataclysmic variables(BH Lyn, DW UMa, EM Cyg; PX And); symbiotic systems (“Symbiosis”); super-soft sources (SSS, QR And); spotted (and not spotted) eclipsing variables with (and without) evidence for a current mass transfer (“Eclipser”) with a special emphasis on systems with a direct impact of the stream into the gainer star's atmosphere, which we propose to call “Impactor” (short from “Extreme Direct Impactor”), or V361 Lyr-type stars. Other

  3. Binary neutron star merger simulations

    Energy Technology Data Exchange (ETDEWEB)

    Bruegmann, Bernd [Jena Univ. (Germany)

    2016-11-01

    Our research focuses on the numerical tools necessary to solve Einstein's equations. In recent years we have been particularly interested in spacetimes consisting of two neutron stars in the final stages of their evolution. Because of the emission of gravitational radiation, the objects are driven together to merge; the emitted gravitational wave signal is visualized. This emitted gravitational radiation carries energy and momentum away from the system and contains information about the system. Late last year the Laser Interferometer Gravitational-wave Observatory (LIGO) began searches for these gravitational wave signals at a sensitivity at which detections are expected. Although such systems can radiate a significant amount of their total mass-energy in gravitational waves, the gravitational wave signals one expects to receive on Earth are not strong, since sources of gravitational waves are often many millions of light years away. Therefore one needs accurate templates for the radiation one expects from such systems in order to be able to extract them out of the detector's noise. Although analytical models exist for compact binary systems when the constituents are well separated, we need numerical simulation to investigate the last orbits before merger to obtain accurate templates and validate analytical approximations. Due to the strong nonlinearity of the equations and the large separation of length scales, these simulations are computationally demanding and need to be run on large supercomputers. When matter is present the computational cost as compared to pure black hole (vacuum) simulations increases even more due to the additional matter fields. But also more interesting astrophysical phenomena can happen. In fact, there is the possibility for a strong electromagnetic signal from the merger (e.g., a short gamma-ray burst or lower-energy electromagnetic signatures from the ejecta) and significant neutrino emission. Additionally, we can expect that

  4. SEVERO code - user's manual

    International Nuclear Information System (INIS)

    Sacramento, A.M. do.

    1989-01-01

    This user's manual contains all the necessary information concerning the use of SEVERO code. This computer code is related to the statistics of extremes = extreme winds, extreme precipitation and flooding hazard risk analysis. (A.C.A.S.)

  5. Model and code development

    International Nuclear Information System (INIS)

    Anon.

    1977-01-01

    Progress in model and code development for reactor physics calculations is summarized. The codes included CINDER-10, PHROG, RAFFLE GAPP, DCFMR, RELAP/4, PARET, and KENO. Kinetics models for the PBF were developed

  6. Coding for optical channels

    CERN Document Server

    Djordjevic, Ivan; Vasic, Bane

    2010-01-01

    This unique book provides a coherent and comprehensive introduction to the fundamentals of optical communications, signal processing and coding for optical channels. It is the first to integrate the fundamentals of coding theory and optical communication.

  7. Eliciting Subjective Probabilities with Binary Lotteries

    DEFF Research Database (Denmark)

    Harrison, Glenn W.; Martínez-Correa, Jimmy; Swarthout, J. Todd

    2014-01-01

    We evaluate a binary lottery procedure for inducing risk neutral behavior in a subjective belief elicitation task. Prior research has shown this procedure to robustly induce risk neutrality when subjects are given a single risk task defined over objective probabilities. Drawing a sample from...... the same subject population, we find evidence that the binary lottery procedure also induces linear utility in a subjective probability elicitation task using the Quadratic Scoring Rule. We also show that the binary lottery procedure can induce direct revelation of subjective probabilities in subjects...

  8. Rate adaptive multilevel coded modulation with high coding gain in intensity modulation direct detection optical communication

    Science.gov (United States)

    Xiao, Fei; Liu, Bo; Zhang, Lijia; Xin, Xiangjun; Zhang, Qi; Tian, Qinghua; Tian, Feng; Wang, Yongjun; Rao, Lan; Ullah, Rahat; Zhao, Feng; Li, Deng'ao

    2018-02-01

    A rate-adaptive multilevel coded modulation (RA-MLC) scheme based on fixed code length and a corresponding decoding scheme is proposed. RA-MLC scheme combines the multilevel coded and modulation technology with the binary linear block code at the transmitter. Bits division, coding, optional interleaving, and modulation are carried out by the preset rule, then transmitted through standard single mode fiber span equal to 100 km. The receiver improves the accuracy of decoding by means of soft information passing through different layers, which enhances the performance. Simulations are carried out in an intensity modulation-direct detection optical communication system using MATLAB®. Results show that the RA-MLC scheme can achieve bit error rate of 1E-5 when optical signal-to-noise ratio is 20.7 dB. It also reduced the number of decoders by 72% and realized 22 rate adaptation without significantly increasing the computing time. The coding gain is increased by 7.3 dB at BER=1E-3.

  9. Enhancing QR Code Security

    OpenAIRE

    Zhang, Linfan; Zheng, Shuang

    2015-01-01

    Quick Response code opens possibility to convey data in a unique way yet insufficient prevention and protection might lead into QR code being exploited on behalf of attackers. This thesis starts by presenting a general introduction of background and stating two problems regarding QR code security, which followed by a comprehensive research on both QR code itself and related issues. From the research a solution taking advantages of cloud and cryptography together with an implementation come af...

  10. Stylize Aesthetic QR Code

    OpenAIRE

    Xu, Mingliang; Su, Hao; Li, Yafei; Li, Xi; Liao, Jing; Niu, Jianwei; Lv, Pei; Zhou, Bing

    2018-01-01

    With the continued proliferation of smart mobile devices, Quick Response (QR) code has become one of the most-used types of two-dimensional code in the world. Aiming at beautifying the appearance of QR codes, existing works have developed a series of techniques to make the QR code more visual-pleasant. However, these works still leave much to be desired, such as visual diversity, aesthetic quality, flexibility, universal property, and robustness. To address these issues, in this paper, we pro...

  11. ARC Code TI: CODE Software Framework

    Data.gov (United States)

    National Aeronautics and Space Administration — CODE is a software framework for control and observation in distributed environments. The basic functionality of the framework allows a user to observe a distributed...

  12. ARC Code TI: ROC Curve Code Augmentation

    Data.gov (United States)

    National Aeronautics and Space Administration — ROC (Receiver Operating Characteristic) curve Code Augmentation was written by Rodney Martin and John Stutz at NASA Ames Research Center and is a modification of ROC...

  13. Refactoring test code

    NARCIS (Netherlands)

    A. van Deursen (Arie); L.M.F. Moonen (Leon); A. van den Bergh; G. Kok

    2001-01-01

    textabstractTwo key aspects of extreme programming (XP) are unit testing and merciless refactoring. Given the fact that the ideal test code / production code ratio approaches 1:1, it is not surprising that unit tests are being refactored. We found that refactoring test code is different from

  14. Morse Code Activity Packet.

    Science.gov (United States)

    Clinton, Janeen S.

    This activity packet offers simple directions for setting up a Morse Code system appropriate to interfacing with any of several personal computer systems. Worksheets are also included to facilitate teaching Morse Code to persons with visual or other disabilities including blindness, as it is argued that the code is best learned auditorily. (PB)

  15. Binary black hole initial data from matched asymptotic expansions

    International Nuclear Information System (INIS)

    Yunes, Nicolas; Owen, Benjamin J.; Tichy, Wolfgang; Bruegmann, Bernd

    2006-01-01

    We present an approximate metric for a binary black-hole spacetime to construct initial data for numerical relativity. This metric is obtained by asymptotically matching a post-Newtonian metric for a binary system to a perturbed Schwarzschild metric for each hole. In the inner zone near each hole, the metric is given by the Schwarzschild solution plus a quadrupolar perturbation corresponding to an external tidal gravitational field. In the near zone, well outside each black hole but less than a reduced wavelength from the center of mass of the binary, the metric is given by a post-Newtonian expansion including the lowest-order deviations from flat spacetime. When the near zone overlaps each inner zone in a buffer zone, the post-Newtonian and perturbed Schwarzschild metrics can be asymptotically matched to each other. By demanding matching (over a 4-volume in the buffer zone) rather than patching (choosing a particular 2-surface in the buffer zone), we guarantee that the errors are small in all zones. The resulting piecewise metric is made formally C ∞ with smooth transition functions so as to obtain the finite extrinsic curvature of a 3-slice. In addition to the metric and extrinsic curvature, we present explicit results for the lapse and the shift, which can be used as initial data for numerical simulations. This initial data is not accurate all the way to the asymptotically flat ends inside each hole, and therefore must be used with evolution codes which employ black hole excision rather than puncture methods. This paper lays the foundations of a method that can be straightforwardly iterated to obtain initial data to higher perturbative order

  16. RECORD OF THE BINARY DATA ON SD CARD ARDUINO DUE

    Directory of Open Access Journals (Sweden)

    V. G. Mikhailov

    2016-01-01

    Full Text Available The short review of microcontrollers of family Arduino, their characteristics and application fields is given. Importance of record of parameters of researched object is marked to produce debugging of control systems on microcontrollers Arduino. Unique possibility of registration of parameters in family Arduino is record on SD a card in an alpha mode with usage of functions print (, write (. The problems connected to record of the binary data on SD a card on microcontroller Arduino Due are considered. The analysis of methods of record of the binary data on SD card Arduino Due, originating problems with neo-cleaning of memory from the previous program leading to possibility of duplication of the data on SD to a card, presence of the erratic point of view about restriction of volumes of data record and necessity of usage become outdated SD cards is carried out. Ways of elimination of the marked lacks are considered. The estimation of high-speed performance of various approaches of a data recording on SD a card is led. On the basis of the led researches the approach of multiplexing of the writeable information at the expense of conversion of the binary data is offered is byte-serial in a character array in code ASCI without magnification of their volume and record by units on 240 byte. It allows to use as much as possible standard function possibilities write ( Arduino and specificity of the organization of memory SD of cards and to increase high-speed performance more than in 1100 times in comparison with record in a character type on one byte.It is marked that usage of decisions of an exception of duplication of the data offered at forums does not provide completeness of their elimination. For Arduino Due for storage cleaning it is necessary usages of the special programmator or setting of the new program of loading.

  17. Dixie Valley Bottoming Binary Unit

    Energy Technology Data Exchange (ETDEWEB)

    McDonald, Dale [Terra-Gen Sierra Holdings, LLC, Reno, NV (United States)

    2014-12-21

    This binary plant is the first air cooled, high-output refrigeration based waste heat recovery cycle in the industry. Its working fluid is environmentally friendly and as such, the permits that would be required with a hydrocarbon based cycle are not necessary. The unit is largely modularized, meaning that the unit’s individual skids were assembled in another location and were shipped via truck to the plant site. The Air Cooled Condensers (ACC), equipment piping, and Balance of Plant (BOP) piping were constructed at site. This project further demonstrates the technical feasibility of using low temperature brine for geothermal power utilization. The development of the unit led to the realization of low temperature, high output, and environmentally friendly heat recovery systems through domestic research and engineering. The project generates additional renewable energy, resulting in cleaner air and reduced carbon dioxide emissions. Royalty and tax payments to governmental agencies will increase, resulting in reduced financial pressure on local entities. The major components of the unit were sourced from American companies, resulting in increased economic activity throughout the country.

  18. Spatial distribution of luminous X-ray binaries in spiral galaxies

    OpenAIRE

    Zuo, Zhao-yu; Li, Xiang-dong; Liu, Xi-wei

    2008-01-01

    We have modelled the spatial distribution of luminous X-ray binaries (XRBs) in spiral galaxies that are like the Milky Way using an evolutionary population synthesis code. In agreement with previous theoretical expectations and observations, we find that both high- and low-mass XRBs show clear concentrations towards the galactic plane and bulge.We also compare XRB distributions under the galactic potential with a dark matter halo and the modified Newtonian dynamics potential, and we suggest t...

  19. Software Certification - Coding, Code, and Coders

    Science.gov (United States)

    Havelund, Klaus; Holzmann, Gerard J.

    2011-01-01

    We describe a certification approach for software development that has been adopted at our organization. JPL develops robotic spacecraft for the exploration of the solar system. The flight software that controls these spacecraft is considered to be mission critical. We argue that the goal of a software certification process cannot be the development of "perfect" software, i.e., software that can be formally proven to be correct under all imaginable and unimaginable circumstances. More realistically, the goal is to guarantee a software development process that is conducted by knowledgeable engineers, who follow generally accepted procedures to control known risks, while meeting agreed upon standards of workmanship. We target three specific issues that must be addressed in such a certification procedure: the coding process, the code that is developed, and the skills of the coders. The coding process is driven by standards (e.g., a coding standard) and tools. The code is mechanically checked against the standard with the help of state-of-the-art static source code analyzers. The coders, finally, are certified in on-site training courses that include formal exams.

  20. Mechanics of binary crushable granular assembly through discrete element method

    Directory of Open Access Journals (Sweden)

    Raghuram Karthik Desu

    2016-12-01

    Full Text Available The mechanical response of a granular system is not only influenced by the bulk material properties but also on various factors due to it’s discrete nature. The factors like topology, packing fraction, friction between particles, particle size distribution etc. influence the behavior of granular systems. For a reliable design of such systems like fusion breeder units comprising of pebble beds, it is essential to understand the various factors influencing the response of the system. Mechanical response of a binary assembly consisting of crushable spherical pebbles is studied using Discrete Element Method (DEM which is based on particle–particle interactions. The influence of above mentioned factors on the macroscopic stress–strain response is investigated using an in-house DEM code. Furthermore, the effect of these factors on the damage in the assembly is investigated. This present investigation helps in understanding the macroscopic response and damage in terms of microscopic factors paving way to develop a unified prediction tool for a binary crushable granular assembly.

  1. Black-Hole Binaries, Gravitational Waves, and Numerical Relativity

    Science.gov (United States)

    Kelly, Bernard J.; Centrella, Joan; Baker, John G.; Kelly, Bernard J.; vanMeter, James R.

    2010-01-01

    Understanding the predictions of general relativity for the dynamical interactions of two black holes has been a long-standing unsolved problem in theoretical physics. Black-hole mergers are monumental astrophysical events ' releasing tremendous amounts of energy in the form of gravitational radiation ' and are key sources for both ground- and spacebased gravitational wave detectors. The black-hole merger dynamics and the resulting gravitational waveforms can only he calculated through numerical simulations of Einstein's equations of general relativity. For many years, numerical relativists attempting to model these mergers encountered a host of problems, causing their codes to crash after just a fraction of a binary orbit cnuld be simulated. Recently ' however, a series of dramatic advances in numerical relativity has ' for the first time, allowed stable / robust black hole merger simulations. We chronicle this remarkable progress in the rapidly maturing field of numerical relativity, and the new understanding of black-hole binary dynamics that is emerging. We also discuss important applications of these fundamental physics results to astrophysics, to gravitationalwave astronomy, and in other areas.

  2. Be discs in binary systems - II. Misaligned orbits

    Science.gov (United States)

    Cyr, I. H.; Jones, C. E.; Panoglou, D.; Carciofi, A. C.; Okazaki, A. T.

    2017-10-01

    We use a smoothed particle hydrodynamics (SPH) code to examine the effects of misaligned binary companions on Be star discs. We systematically vary the degree of misalignment between the disc and the binary orbit, as well as the disc viscosity and orbital period to study their effects on the density in the inner and outer parts of the disc. We find that varying the degree of misalignment, the viscosity and the orbital period affects both the truncation radius and the density structure of the outer disc, while the inner disc remains mostly unaffected. We also investigate the tilting of the disc in the innermost part of the disc and find the tilt increases with radius until reaching a maximum around 5 stellar radii. The direction of the line of nodes, with respect to the equator of the central star, is found to be offset compared to the orbital line of nodes, and to vary periodically in time, with a period of half a orbital phase. We also compare the scaleheight of our discs with the analytical scaleheight of an isothermal disc, which increases with radius as r1.5. We find that this formula reproduces the scaleheight well for both aligned and misaligned systems but underestimates the scaleheight in regions of the disc where density enhancements develop.

  3. Binary Black Holes, Gravitational Waves, and Numerical Relativity

    Science.gov (United States)

    Centrella, Joan

    2009-01-01

    The final merger of two black holes releases a tremendous amount of energy and is one of the brightest sources in the gravitational wave sky. Observing these sources with gravitational wave detectors requires that we know the radiation waveforms they emit. Since these mergers take place in regions of very strong gravitational fields, we need to solve Einstein's equations of general relativity on a computer in order to calculate these waveforms. For more than 30 years, scientists have tried to compute these waveforms using the methods of numerical relativity. The resulting computer codes have been plagued by instabilities, causing them to crash well before the black holes in the binary could complete even a single orbit. Recently this situation has changed dramatically, with a series of amazing breakthroughs. This talk will take you on this quest for the holy grail of numerical relativity, showing how a spacetime is constructed on a computer to build a simulation laboratory for binary black hole mergers. We will focus on the recent advances that are revealing these waveforms, and the dramatic new potential for discoveries that arises when these sources will be observed by LIGO and LISA.

  4. Enhanced parametric processes in binary metamaterials

    OpenAIRE

    Gorkunov, Maxim V.; Shadrivov, Ilya V.; Kivshar, Yuri S.

    2005-01-01

    We suggest double-resonant (binary) metamaterials composed of two types of magnetic resonant elements, and demonstrate that in the nonlinear regime such metamaterials provide unique possibilities for phase-matched parametric interaction and enhanced second-harmonic generation.

  5. BINARY MINOR PLANETS V1.0

    Data.gov (United States)

    National Aeronautics and Space Administration — We present a data table giving basic physical and orbital parameters for known binary minor planets in the Solar System (and Pluto/Charon) based on published...

  6. BINARY MINOR PLANETS V6.0

    Data.gov (United States)

    National Aeronautics and Space Administration — The data set lists orbital and physical properties for well-observed or suspected binary/multiple minor planets including the Pluto system, as inspired by Richardson...

  7. BINARY MINOR PLANETS V4.0

    Data.gov (United States)

    National Aeronautics and Space Administration — The data set lists orbital and physical properties for well-observed or suspected binary/multiple minor planets including the Pluto system, as inspired by Richardson...

  8. BINARY MINOR PLANETS V5.0

    Data.gov (United States)

    National Aeronautics and Space Administration — The data set lists orbital and physical properties for well-observed or suspected binary/multiple minor planets including the Pluto system, as inspired by Richardson...

  9. BINARY MINOR PLANETS V8.0

    Data.gov (United States)

    National Aeronautics and Space Administration — The data set lists orbital and physical properties for well-observed or suspected binary/multiple minor planets including the Pluto system, compiled from the...

  10. BINARY MINOR PLANETS V9.0

    Data.gov (United States)

    National Aeronautics and Space Administration — The data set lists orbital and physical properties for well-observed or suspected binary/multiple minor planets including the Pluto system, compiled from the...

  11. BINARY MINOR PLANETS V7.0

    Data.gov (United States)

    National Aeronautics and Space Administration — The data set lists orbital and physical properties for well-observed or suspected binary/multiple minor planets including the Pluto system, compiled from the...

  12. BINARY MINOR PLANETS V2.0

    Data.gov (United States)

    National Aeronautics and Space Administration — We present data tables giving basic orbital and physical parameters for well-observed or suspected binary/multiple minor planets and the Pluto system, based on a...

  13. BINARY MINOR PLANETS V3.0

    Data.gov (United States)

    National Aeronautics and Space Administration — We present data tables giving basic orbital and physical parameters for well-observed or suspected binary/multiple minor planets and the Pluto system, based on a...

  14. A Type System for Certified Binaries

    National Research Council Canada - National Science Library

    Shao, Zhong; Trifonov, Valery; Saha, Bratin; Papaspyrou, Nikolaos

    2004-01-01

    ... (CPS and closure conversion) while preserving proofs represented in the type system. Our work provides a foundation for the process of automatically generating certified binaries in a type-theoretic framework.

  15. ON THE BINARY DIGITS OF ALGEBRAIC NUMBERS

    OpenAIRE

    KANEKO, HAJIME

    2010-01-01

    Borel conjectured that all algebraic irrational numbers are normal in base 2. However, very little is known about this problem. We improve the lower bounds for the number of digit changes in the binary expansions of algebraic irrational numbers.

  16. General simulation algorithm for autocorrelated binary processes

    Science.gov (United States)

    Serinaldi, Francesco; Lombardo, Federico

    2017-02-01

    The apparent ubiquity of binary random processes in physics and many other fields has attracted considerable attention from the modeling community. However, generation of binary sequences with prescribed autocorrelation is a challenging task owing to the discrete nature of the marginal distributions, which makes the application of classical spectral techniques problematic. We show that such methods can effectively be used if we focus on the parent continuous process of beta distributed transition probabilities rather than on the target binary process. This change of paradigm results in a simulation procedure effectively embedding a spectrum-based iterative amplitude-adjusted Fourier transform method devised for continuous processes. The proposed algorithm is fully general, requires minimal assumptions, and can easily simulate binary signals with power-law and exponentially decaying autocorrelation functions corresponding, for instance, to Hurst-Kolmogorov and Markov processes. An application to rainfall intermittency shows that the proposed algorithm can also simulate surrogate data preserving the empirical autocorrelation.

  17. Computer controlled evaluation of binary images

    NARCIS (Netherlands)

    Schouten, Th.E.; van den Broek, Egon

    2010-01-01

    The present invention relates to computer controlled image processing and, in particular, to computer controlled evaluation of two dimensional, 2D, and three dimensional, 3D, binary images including sequences of images using a distance map.

  18. On the Maximum Separation of Visual Binaries

    Indian Academy of Sciences (India)

    2016-01-27

    minimum) angular separation ρmax(ρmin), the corresponding apparent position angles (|ρmax , |ρmin) and the individual masses of visual binary systems. The algorithm uses Reed's formulae (1984) for the masses, and a ...

  19. Red-giant stars in eccentric binaries

    Directory of Open Access Journals (Sweden)

    Beck P. G.

    2015-01-01

    Full Text Available The unparalleled photometric data obtained by NASA’s Kepler Space Telescope has led to improved understanding of red-giant stars and binary stars. We discuss the characterization of known eccentric system, containing a solar-like oscillating red-giant primary component. We also report several new binary systems that are candidates for hosting an oscillating companion. A powerful approach to study binary stars is to combine asteroseimic techniques with light curve fitting. Seismology allows us to deduce the properties of red giants. In addition, by modeling the ellipsoidal modulations we can constrain the parameters of the binary system. An valuable independent source are ground-bases, high-resolution spectrographs.

  20. Observations of new Wolf-Rayet binaries

    International Nuclear Information System (INIS)

    Niemela, V.S.

    1982-01-01

    The author reports here preliminary results of spectrographic observations for three southern WR stars, whose binary nature had not been previously verified: HDE 320102, CD -45 0 4482, HD 62910. The observations were carried out at the Cerro Tololo Inter-American Observatory, Chile, mostly with the Cassegrain spectrograph with IT attached to the 1-m reflector. These spectrograms were secured on Kodak IIIaJ emulsion, and have a dispersion of 45 A/mm. The results suggest that HDE 320102 must be a double-lined 05-7 + WN3 spectroscopic binary, that CD -45 0 4482 appears to be a single-lined spectroscopic binary and that HD 62910 may be a binary. (Auth.)

  1. The network code

    International Nuclear Information System (INIS)

    1997-01-01

    The Network Code defines the rights and responsibilities of all users of the natural gas transportation system in the liberalised gas industry in the United Kingdom. This report describes the operation of the Code, what it means, how it works and its implications for the various participants in the industry. The topics covered are: development of the competitive gas market in the UK; key points in the Code; gas transportation charging; impact of the Code on producers upstream; impact on shippers; gas storage; supply point administration; impact of the Code on end users; the future. (20 tables; 33 figures) (UK)

  2. The materiality of Code

    DEFF Research Database (Denmark)

    Soon, Winnie

    2014-01-01

    , Twitter and Facebook). The focus is not to investigate the functionalities and efficiencies of the code, but to study and interpret the program level of code in order to trace the use of various technological methods such as third-party libraries and platforms’ interfaces. These are important...... to understand the socio-technical side of a changing network environment. Through the study of code, including but not limited to source code, technical specifications and other materials in relation to the artwork production, I would like to explore the materiality of code that goes beyond technical...

  3. Coding for Electronic Mail

    Science.gov (United States)

    Rice, R. F.; Lee, J. J.

    1986-01-01

    Scheme for coding facsimile messages promises to reduce data transmission requirements to one-tenth current level. Coding scheme paves way for true electronic mail in which handwritten, typed, or printed messages or diagrams sent virtually instantaneously - between buildings or between continents. Scheme, called Universal System for Efficient Electronic Mail (USEEM), uses unsupervised character recognition and adaptive noiseless coding of text. Image quality of resulting delivered messages improved over messages transmitted by conventional coding. Coding scheme compatible with direct-entry electronic mail as well as facsimile reproduction. Text transmitted in this scheme automatically translated to word-processor form.

  4. Binary recursive partitioning: background, methods, and application to psychology.

    Science.gov (United States)

    Merkle, Edgar C; Shaffer, Victoria A

    2011-02-01

    Binary recursive partitioning (BRP) is a computationally intensive statistical method that can be used in situations where linear models are often used. Instead of imposing many assumptions to arrive at a tractable statistical model, BRP simply seeks to accurately predict a response variable based on values of predictor variables. The method outputs a decision tree depicting the predictor variables that were related to the response variable, along with the nature of the variables' relationships. No significance tests are involved, and the tree's 'goodness' is judged based on its predictive accuracy. In this paper, we describe BRP methods in a detailed manner and illustrate their use in psychological research. We also provide R code for carrying out the methods.

  5. Diffusion in ordered binary solid systems

    International Nuclear Information System (INIS)

    Stolwijk, N.A.

    1980-01-01

    This thesis contains contributions to the field of diffusion in ordered binary solid systems. An extensive experimental investigation of the self diffusion in CoGa is presented. The results of these diffusion measurements strongly suggest that a substantial part of the atomic migration is caused by a new type of defect. A quantitative description of the atomic displacements via this defect is given. Finally computer simulations are presented of diffusion and ordering in binary solid systems. (Auth.)

  6. Reflection effect in close binary systems

    International Nuclear Information System (INIS)

    Vanlandingham, F.G.

    1974-01-01

    The investigation studies the effects of the irradiation of the hotter component in a close binary system on the atmosphere of the secondary and on the observed flux distribution of the binary system. An existing model atmospheres computer program is modified to include the effects of non-zero incident radiation. Computations reveal that the irradiation can significantly raise the temperature in the upper layers of the atmosphere. (U.S.)

  7. Detecting Black Hole Binaries by Gaia

    OpenAIRE

    Yamaguchi, Masaki S.; Kawanaka, Norita; Bulik, Tomasz; Piran, Tsvi

    2017-01-01

    We study the prospect of the Gaia satellite to identify black hole binary systems by detecting the orbital motion of the companion stars. Taking into account the initial mass function, mass transfer, common envelope phase, interstellar absorption and identifiability of black holes, we estimate the number of black hole binaries detected by Gaia and their distributions with respect to the black hole mass for several models with different parameters. We find that $\\sim 300-6000$ black hole binar...

  8. Search for binary nuclei in planetary nebulae

    International Nuclear Information System (INIS)

    Jasniewicz, G.

    1987-01-01

    Two planetary nebulae with central stars of late spectral type were observed: LT 5 and Abell 35. The variation of the systemic velocity of the G-binary in HD 112313 gives strong support to the idea of a third body in the nucleus of LT 5. In addition, it is concluded that observed photometric variations of BD -22 deg 3467 (the central star of Abell 35) can best be explained by the binary nature of the star. 9 references

  9. Search for binary nuclei in planetary nebulae

    Science.gov (United States)

    Jasniewicz, G.

    Two planetary nebulae with central stars of late spectral type were observed: LT 5 and Abell 35. The variation of the systemic velocity of the G-binary in HD 112313 gives strong support to the idea of a third body in the nucleus of LT 5. In addition, it is concluded that observed photometric variations of BD -22 deg 3467 (the central star of Abell 35) can best be explained by the binary nature of the star.

  10. XSOR codes users manual

    International Nuclear Information System (INIS)

    Jow, Hong-Nian; Murfin, W.B.; Johnson, J.D.

    1993-11-01

    This report describes the source term estimation codes, XSORs. The codes are written for three pressurized water reactors (Surry, Sequoyah, and Zion) and two boiling water reactors (Peach Bottom and Grand Gulf). The ensemble of codes has been named ''XSOR''. The purpose of XSOR codes is to estimate the source terms which would be released to the atmosphere in severe accidents. A source term includes the release fractions of several radionuclide groups, the timing and duration of releases, the rates of energy release, and the elevation of releases. The codes have been developed by Sandia National Laboratories for the US Nuclear Regulatory Commission (NRC) in support of the NUREG-1150 program. The XSOR codes are fast running parametric codes and are used as surrogates for detailed mechanistic codes. The XSOR codes also provide the capability to explore the phenomena and their uncertainty which are not currently modeled by the mechanistic codes. The uncertainty distributions of input parameters may be used by an. XSOR code to estimate the uncertainty of source terms

  11. DLLExternalCode

    Energy Technology Data Exchange (ETDEWEB)

    2014-05-14

    DLLExternalCode is the a general dynamic-link library (DLL) interface for linking GoldSim (www.goldsim.com) with external codes. The overall concept is to use GoldSim as top level modeling software with interfaces to external codes for specific calculations. The DLLExternalCode DLL that performs the linking function is designed to take a list of code inputs from GoldSim, create an input file for the external application, run the external code, and return a list of outputs, read from files created by the external application, back to GoldSim. Instructions for creating the input file, running the external code, and reading the output are contained in an instructions file that is read and interpreted by the DLL.

  12. New algorithms for binary wavefront optimization

    Science.gov (United States)

    Zhang, Xiaolong; Kner, Peter

    2015-03-01

    Binary amplitude modulation promises to allow rapid focusing through strongly scattering media with a large number of segments due to the faster update rates of digital micromirror devices (DMDs) compared to spatial light modulators (SLMs). While binary amplitude modulation has a lower theoretical enhancement than phase modulation, the faster update rate should more than compensate for the difference - a factor of π2 /2. Here we present two new algorithms, a genetic algorithm and a transmission matrix algorithm, for optimizing the focus with binary amplitude modulation that achieve enhancements close to the theoretical maximum. Genetic algorithms have been shown to work well in noisy environments and we show that the genetic algorithm performs better than a stepwise algorithm. Transmission matrix algorithms allow complete characterization and control of the medium but require phase control either at the input or output. Here we introduce a transmission matrix algorithm that works with only binary amplitude control and intensity measurements. We apply these algorithms to binary amplitude modulation using a Texas Instruments Digital Micromirror Device. Here we report an enhancement of 152 with 1536 segments (9.90%×N) using a genetic algorithm with binary amplitude modulation and an enhancement of 136 with 1536 segments (8.9%×N) using an intensity-only transmission matrix algorithm.

  13. Texture classification by texton: statistical versus binary.

    Directory of Open Access Journals (Sweden)

    Zhenhua Guo

    Full Text Available Using statistical textons for texture classification has shown great success recently. The maximal response 8 (Statistical_MR8, image patch (Statistical_Joint and locally invariant fractal (Statistical_Fractal are typical statistical texton algorithms and state-of-the-art texture classification methods. However, there are two limitations when using these methods. First, it needs a training stage to build a texton library, thus the recognition accuracy will be highly depended on the training samples; second, during feature extraction, local feature is assigned to a texton by searching for the nearest texton in the whole library, which is time consuming when the library size is big and the dimension of feature is high. To address the above two issues, in this paper, three binary texton counterpart methods were proposed, Binary_MR8, Binary_Joint, and Binary_Fractal. These methods do not require any training step but encode local feature into binary representation directly. The experimental results on the CUReT, UIUC and KTH-TIPS databases show that binary texton could get sound results with fast feature extraction, especially when the image size is not big and the quality of image is not poor.

  14. MONTE CARLO POPULATION SYNTHESIS OF POST-COMMON-ENVELOPE WHITE DWARF BINARIES AND TYPE Ia SUPERNOVA RATE

    Energy Technology Data Exchange (ETDEWEB)

    Ablimit, Iminhaji [Key Laboratory for Optical Astronomy, National Astronomical Observatories, Chinese Academy of Sciences, Beijing 100012 (China); Maeda, Keiichi [Department of Astronomy, Kyoto University, Kitashirakawa-Oiwake-cho, Sakyo-ku, Kyoto 606-8502 (Japan); Li, Xiang-Dong [Department of Astronomy, Nanjing University, Nanjing 210046 (China)

    2016-07-20

    Binary population synthesis (BPS) studies provide a comprehensive way to understand the evolution of binaries and their end products. Close white dwarf (WD) binaries have crucial characteristics for examining the influence of unresolved physical parameters on binary evolution. In this paper, we perform Monte Carlo BPS simulations, investigating the population of WD/main-sequence (WD/MS) binaries and double WD binaries using a publicly available binary star evolution code under 37 different assumptions for key physical processes and binary initial conditions. We considered different combinations of the binding energy parameter ( λ {sub g}: considering gravitational energy only; λ {sub b}: considering both gravitational energy and internal energy; and λ {sub e}: considering gravitational energy, internal energy, and entropy of the envelope, with values derived from the MESA code), CE efficiency, critical mass ratio, initial primary mass function, and metallicity. We find that a larger number of post-CE WD/MS binaries in tight orbits are formed when the binding energy parameters are set by λ {sub e} than in those cases where other prescriptions are adopted. We also determine the effects of the other input parameters on the orbital periods and mass distributions of post-CE WD/MS binaries. As they contain at least one CO WD, double WD systems that evolved from WD/MS binaries may explode as type Ia supernovae (SNe Ia) via merging. In this work, we also investigate the frequency of two WD mergers and compare it to the SNe Ia rate. The calculated Galactic SNe Ia rate with λ = λ {sub e} is comparable to the observed SNe Ia rate, ∼8.2 × 10{sup 5} yr{sup 1} – ∼4 × 10{sup 3} yr{sup 1} depending on the other BPS parameters, if a DD system does not require a mass ratio higher than ∼0.8 to become an SNe Ia. On the other hand, a violent merger scenario, which requires the combined mass of two CO WDs ≥ 1.6 M {sub ⊙} and a mass ratio >0.8, results in a much lower

  15. Methodology for fast detection of false sharing in threaded scientific codes

    Science.gov (United States)

    Chung, I-Hsin; Cong, Guojing; Murata, Hiroki; Negishi, Yasushi; Wen, Hui-Fang

    2014-11-25

    A profiling tool identifies a code region with a false sharing potential. A static analysis tool classifies variables and arrays in the identified code region. A mapping detection library correlates memory access instructions in the identified code region with variables and arrays in the identified code region while a processor is running the identified code region. The mapping detection library identifies one or more instructions at risk, in the identified code region, which are subject to an analysis by a false sharing detection library. A false sharing detection library performs a run-time analysis of the one or more instructions at risk while the processor is re-running the identified code region. The false sharing detection library determines, based on the performed run-time analysis, whether two different portions of the cache memory line are accessed by the generated binary code.

  16. Full-Diversity Space-Time Error Correcting Codes with Low-Complexity Receivers

    Directory of Open Access Journals (Sweden)

    Hassan MohamadSayed

    2011-01-01

    Full Text Available We propose an explicit construction of full-diversity space-time block codes, under the constraint of an error correction capability. Furthermore, these codes are constructed in order to be suitable for a serial concatenation with an outer linear forward error correcting (FEC code. We apply the binary rank criterion, and we use the threaded layering technique and an inner linear FEC code to define a space-time error-correcting code. When serially concatenated with an outer linear FEC code, a product code can be built at the receiver, and adapted iterative receiver structures can be applied. An optimized hybrid structure mixing MMSE turbo equalization and turbo product code decoding is proposed. It yields reduced complexity and enhanced performance compared to previous existing structures.

  17. Real coded genetic algorithm for fuzzy time series prediction

    Science.gov (United States)

    Jain, Shilpa; Bisht, Dinesh C. S.; Singh, Phool; Mathpal, Prakash C.

    2017-10-01

    Genetic Algorithm (GA) forms a subset of evolutionary computing, rapidly growing area of Artificial Intelligence (A.I.). Some variants of GA are binary GA, real GA, messy GA, micro GA, saw tooth GA, differential evolution GA. This research article presents a real coded GA for predicting enrollments of University of Alabama. Data of Alabama University is a fuzzy time series. Here, fuzzy logic is used to predict enrollments of Alabama University and genetic algorithm optimizes fuzzy intervals. Results are compared to other eminent author works and found satisfactory, and states that real coded GA are fast and accurate.

  18. Efficient Decoding of Turbo Codes with Nonbinary Belief Propagation

    Directory of Open Access Journals (Sweden)

    Thierry Lestable

    2008-05-01

    Full Text Available This paper presents a new approach to decode turbo codes using a nonbinary belief propagation decoder. The proposed approach can be decomposed into two main steps. First, a nonbinary Tanner graph representation of the turbo code is derived by clustering the binary parity-check matrix of the turbo code. Then, a group belief propagation decoder runs several iterations on the obtained nonbinary Tanner graph. We show in particular that it is necessary to add a preprocessing step on the parity-check matrix of the turbo code in order to ensure good topological properties of the Tanner graph and then good iterative decoding performance. Finally, by capitalizing on the diversity which comes from the existence of distinct efficient preprocessings, we propose a new decoding strategy, called decoder diversity, that intends to take benefits from the diversity through collaborative decoding schemes.

  19. Coding and cryptography synergy for a robust communication

    CERN Document Server

    Zivic, Natasa

    2013-01-01

    This book presents the benefits of the synergetic effect of the combination of coding and cryptography. It introduces new directions for the interoperability between the components of a communication system. Coding and cryptography are standard components in today's distributed systems. The integration of cryptography into coding aspects is very interesting, as the usage of cryptography will be common use, even in industrial applications. The book is based on new developments of coding and cryptography, which use real numbers to express reliability values of bits instead of binary values 0 and 1. The presented methods are novel and designed for noisy communication, which doesn´t allow the successful use of cryptography. The rate of successful verifications is improved essentially not only for standard or "hard" verification, but even more after the introduction of "soft" verification. A security analysis shows the impact on the security. Information security and cryptography follow the late developments of c...

  20. Exploring the Birth of Binary Stars

    Science.gov (United States)

    Kohler, Susanna

    2016-08-01

    More than half of all stars are thought to be in binary or multiple star systems. But how do these systems form? The misaligned spins of some binary protostars might provide a clue.Two Formation ModelsIts hard to tell how multiple-star systems form, since these systems are difficult to observe in their early stages. But based on numerical simulations, there are two proposed models for the formation of stellar binaries:Turbulent fragmentationTurbulence within a single core leads to multiple dense clumps. These clumps independently collapse to form stars that orbit each other.Disk fragmentationGravitational instabilities in a massive accretion disk cause the formation of a smaller, secondary disk within the first, resulting in two stars that orbit each other.Log column density for one of the authors simulated binary systems, just after the formation of two protostars. Diamonds indicate the protostar positions. [Adapted from Offner et al. 2016]Outflows as CluesHow can we differentiate between these formation mechanisms? Led by Stella Offner (University of Massachusetts), a team of scientists has suggested that the key isto examine the alignment of the stars protostellar outflows jets that are often emitted from the poles of young, newly forming stars.Naively, wed expect that disk fragmentation would produce binary stars with common angular momentum. As the stars spins would be aligned, they would therefore also launch protostellar jets that were aligned with each other. Turbulent fragmentation, on the other hand, would cause the stars to have independent angular momentum. This would lead to randomly oriented spins, so the protostellar jets would be misaligned.Snapshots from the authors simulations. Left panel of each pair: column density; green arrows giveprotostellar spin directions. Right panel: synthetic observations produced from the simulations; cyan arrows giveprotostellar outflow directions. [Offner et al. 2016]Simulations of FragmentationIn order to better

  1. Use of Gray code in PBIL algorithm for application in recharge of nuclear fuels

    International Nuclear Information System (INIS)

    Nast, Fernando N.; Silva, Patrick V.; Meneses, Anderson A. M.; Schirru, Roberto

    2017-01-01

    The In-Core Fuel Management Optimization (OGCIN) problem, or design optimization of Load Patterns (PCs) are denominations for the optimization problem associated with the refueling operation in a reactor nuclear. The OCGIN is considered a problem of difficult resolution, considering aspects of combinatorial optimization and calculations of analysis and physics of reactors. In order to validate algorithms for the OGCIN solution, we use benchmark problems such as the Travelling Salesman Problem (TSP), because it is considered, like OGCIN, an NP-difficult problem. In the present work, we implemented the Population-Based Incremental Learning (PBIL) algorithm with binary coding and Gray coding and applied them to the optimization of the symmetric PCV Oliver30 and Rykel48 asymmetric PCV and implemented only the Gray coding in the OGCIN application of the cycle 7 of the Angra-1 Nuclear Plant, where we compared its performance with binary coding in. The results on average were 1311 and 1327 ppm of Boron for the binary and Gray codifications respectively, emphasizing that the binary codification obtained a maximum value of 1330 ppm, while the Gray code obtained a value of 1401 ppm, showing superiority, since the Boron concentration is an indicator of the PC cycle extension

  2. The Aesthetics of Coding

    DEFF Research Database (Denmark)

    Andersen, Christian Ulrik

    2007-01-01

    Computer art is often associated with computer-generated expressions (digitally manipulated audio/images in music, video, stage design, media facades, etc.). In recent computer art, however, the code-text itself – not the generated output – has become the artwork (Perl Poetry, ASCII Art, obfuscated...... code, etc.). The presentation relates this artistic fascination of code to a media critique expressed by Florian Cramer, claiming that the graphical interface represents a media separation (of text/code and image) causing alienation to the computer’s materiality. Cramer is thus the voice of a new ‘code...... avant-garde’. In line with Cramer, the artists Alex McLean and Adrian Ward (aka Slub) declare: “art-oriented programming needs to acknowledge the conditions of its own making – its poesis.” By analysing the Live Coding performances of Slub (where they program computer music live), the presentation...

  3. Masses of the components of SB2 binaries observed with Gaia - IV. Accurate SB2 orbits for 14 binaries and masses of three binaries*

    Science.gov (United States)

    Kiefer, F.; Halbwachs, J.-L.; Lebreton, Y.; Soubiran, C.; Arenou, F.; Pourbaix, D.; Famaey, B.; Guillout, P.; Ibata, R.; Mazeh, T.

    2018-02-01

    The orbital motion of non-contact double-lined spectroscopic binaries (SB2s), with periods of a few tens of days to several years, holds unique, accurate information on individual stellar masses, which only long-term monitoring can unlock. The combination of radial velocity measurements from high-resolution spectrographs and astrometric measurements from high-precision interferometers allows the derivation of SB2 component masses down to the percent precision. Since 2010, we have observed a large sample of SB2s with the SOPHIE spectrograph at the Observatoire de Haute-Provence, aiming at the derivation of orbital elements with sufficient accuracy to obtain masses of components with relative errors as low as 1 per cent when the astrometric measurements of the Gaia satellite are taken into account. In this paper, we present the results from 6 yr of observations of 14 SB2 systems with periods ranging from 33 to 4185 days. Using the TODMOR algorithm, we computed radial velocities from the spectra and then derived the orbital elements of these binary systems. The minimum masses of the 28 stellar components are then obtained with an average sample accuracy of 1.0 ± 0.2 per cent. Combining the radial velocities with existing interferometric measurements, we derived the masses of the primary and secondary components of HIP 61100, HIP 95995 and HIP 101382 with relative errors for components (A,B) of, respectively, (2.0, 1.7) per cent, (3.7, 3.7) per cent and (0.2, 0.1) per cent. Using the CESAM2K stellar evolution code, we constrained the initial He abundance, age and metallicity for HIP 61100 and HIP 95995.

  4. The aeroelastic code FLEXLAST

    Energy Technology Data Exchange (ETDEWEB)

    Visser, B. [Stork Product Eng., Amsterdam (Netherlands)

    1996-09-01

    To support the discussion on aeroelastic codes, a description of the code FLEXLAST was given and experiences within benchmarks and measurement programmes were summarized. The code FLEXLAST has been developed since 1982 at Stork Product Engineering (SPE). Since 1992 FLEXLAST has been used by Dutch industries for wind turbine and rotor design. Based on the comparison with measurements, it can be concluded that the main shortcomings of wind turbine modelling lie in the field of aerodynamics, wind field and wake modelling. (au)

  5. Gauge color codes

    DEFF Research Database (Denmark)

    Bombin Palomo, Hector

    2015-01-01

    Color codes are topological stabilizer codes with unusual transversality properties. Here I show that their group of transversal gates is optimal and only depends on the spatial dimension, not the local geometry. I also introduce a generalized, subsystem version of color codes. In 3D they allow t...... the transversal implementation of a universal set of gates by gauge fixing, while error-dectecting measurements involve only four or six qubits....

  6. Doubled Color Codes

    Science.gov (United States)

    Bravyi, Sergey

    Combining protection from noise and computational universality is one of the biggest challenges in the fault-tolerant quantum computing. Topological stabilizer codes such as the 2D surface code can tolerate a high level of noise but implementing logical gates, especially non-Clifford ones, requires a prohibitively large overhead due to the need of state distillation. In this talk I will describe a new family of 2D quantum error correcting codes that enable a transversal implementation of all logical gates required for the universal quantum computing. Transversal logical gates (TLG) are encoded operations that can be realized by applying some single-qubit rotation to each physical qubit. TLG are highly desirable since they introduce no overhead and do not spread errors. It has been known before that a quantum code can have only a finite number of TLGs which rules out computational universality. Our scheme circumvents this no-go result by combining TLGs of two different quantum codes using the gauge-fixing method pioneered by Paetznick and Reichardt. The first code, closely related to the 2D color code, enables a transversal implementation of all single-qubit Clifford gates such as the Hadamard gate and the π / 2 phase shift. The second code that we call a doubled color code provides a transversal T-gate, where T is the π / 4 phase shift. The Clifford+T gate set is known to be computationally universal. The two codes can be laid out on the honeycomb lattice with two qubits per site such that the code conversion requires parity measurements for six-qubit Pauli operators supported on faces of the lattice. I will also describe numerical simulations of logical Clifford+T circuits encoded by the distance-3 doubled color code. Based on a joint work with Andrew Cross.

  7. Phonological coding during reading

    Science.gov (United States)

    Leinenger, Mallorie

    2014-01-01

    The exact role that phonological coding (the recoding of written, orthographic information into a sound based code) plays during silent reading has been extensively studied for more than a century. Despite the large body of research surrounding the topic, varying theories as to the time course and function of this recoding still exist. The present review synthesizes this body of research, addressing the topics of time course and function in tandem. The varying theories surrounding the function of phonological coding (e.g., that phonological codes aid lexical access, that phonological codes aid comprehension and bolster short-term memory, or that phonological codes are largely epiphenomenal in skilled readers) are first outlined, and the time courses that each maps onto (e.g., that phonological codes come online early (pre-lexical) or that phonological codes come online late (post-lexical)) are discussed. Next the research relevant to each of these proposed functions is reviewed, discussing the varying methodologies that have been used to investigate phonological coding (e.g., response time methods, reading while eyetracking or recording EEG and MEG, concurrent articulation) and highlighting the advantages and limitations of each with respect to the study of phonological coding. In response to the view that phonological coding is largely epiphenomenal in skilled readers, research on the use of phonological codes in prelingually, profoundly deaf readers is reviewed. Finally, implications for current models of word identification (activation-verification model (Van Order, 1987), dual-route model (e.g., Coltheart, Rastle, Perry, Langdon, & Ziegler, 2001), parallel distributed processing model (Seidenberg & McClelland, 1989)) are discussed. PMID:25150679

  8. MORSE Monte Carlo code

    Energy Technology Data Exchange (ETDEWEB)

    Cramer, S.N.

    1984-01-01

    The MORSE code is a large general-use multigroup Monte Carlo code system. Although no claims can be made regarding its superiority in either theoretical details or Monte Carlo techniques, MORSE has been, since its inception at ORNL in the late 1960s, the most widely used Monte Carlo radiation transport code. The principal reason for this popularity is that MORSE is relatively easy to use, independent of any installation or distribution center, and it can be easily customized to fit almost any specific need. Features of the MORSE code are described.

  9. Bar Code Labels

    Science.gov (United States)

    1988-01-01

    American Bar Codes, Inc. developed special bar code labels for inventory control of space shuttle parts and other space system components. ABC labels are made in a company-developed anodizing aluminum process and consecutively marketed with bar code symbology and human readable numbers. They offer extreme abrasion resistance and indefinite resistance to ultraviolet radiation, capable of withstanding 700 degree temperatures without deterioration and up to 1400 degrees with special designs. They offer high resistance to salt spray, cleaning fluids and mild acids. ABC is now producing these bar code labels commercially or industrial customers who also need labels to resist harsh environments.

  10. QR codes for dummies

    CERN Document Server

    Waters, Joe

    2012-01-01

    Find out how to effectively create, use, and track QR codes QR (Quick Response) codes are popping up everywhere, and businesses are reaping the rewards. Get in on the action with the no-nonsense advice in this streamlined, portable guide. You'll find out how to get started, plan your strategy, and actually create the codes. Then you'll learn to link codes to mobile-friendly content, track your results, and develop ways to give your customers value that will keep them coming back. It's all presented in the straightforward style you've come to know and love, with a dash of humor thrown

  11. MORSE Monte Carlo code

    International Nuclear Information System (INIS)

    Cramer, S.N.

    1984-01-01

    The MORSE code is a large general-use multigroup Monte Carlo code system. Although no claims can be made regarding its superiority in either theoretical details or Monte Carlo techniques, MORSE has been, since its inception at ORNL in the late 1960s, the most widely used Monte Carlo radiation transport code. The principal reason for this popularity is that MORSE is relatively easy to use, independent of any installation or distribution center, and it can be easily customized to fit almost any specific need. Features of the MORSE code are described

  12. Tokamak Systems Code

    International Nuclear Information System (INIS)

    Reid, R.L.; Barrett, R.J.; Brown, T.G.

    1985-03-01

    The FEDC Tokamak Systems Code calculates tokamak performance, cost, and configuration as a function of plasma engineering parameters. This version of the code models experimental tokamaks. It does not currently consider tokamak configurations that generate electrical power or incorporate breeding blankets. The code has a modular (or subroutine) structure to allow independent modeling for each major tokamak component or system. A primary benefit of modularization is that a component module may be updated without disturbing the remainder of the systems code as long as the imput to or output from the module remains unchanged

  13. ARC Code TI: ACCEPT

    Data.gov (United States)

    National Aeronautics and Space Administration — ACCEPT consists of an overall software infrastructure framework and two main software components. The software infrastructure framework consists of code written to...

  14. Do stellar clusters form fewer binaries? Using moderate separation binaries to distinguish between nature and nurture

    Science.gov (United States)

    Reiter, Megan

    2017-08-01

    Fewer wide-separation binaries are found in dense stellar clusters than in looser stellar associations. It is therefore unclear whether feedback in clusters prevents the formation of multiple systems or dynamical interactions destroy them. Measuring the prevalence of close, bound binary systems provide a key test to distinguish between these possibilities. Systems with separations of 10-50 AU will survive interactions in the cluster environment, and therefore are more representative of the natal population of multiple systems. By fitting a double-star PSF, we will identify visual binaries in the Orion Nebula with separations as small as 0.03. At the distance of Orion, this corresponds to a physical separation of 12 AU, effectively closing the observational gap in the binary separation distribution left between known visual and spectroscopic binaries (>65 AU or PhD thesis.

  15. Effective-one-body waveforms for binary neutron stars using surrogate models

    Science.gov (United States)

    Lackey, Benjamin D.; Bernuzzi, Sebastiano; Galley, Chad R.; Meidam, Jeroen; Van Den Broeck, Chris

    2017-05-01

    Gravitational-wave observations of binary neutron star systems can provide information about the masses, spins, and structure of neutron stars. However, this requires accurate and computationally efficient waveform models that take ≲1 s to evaluate for use in Bayesian parameter estimation codes that perform 1 07- 1 08 waveform evaluations. We present a surrogate model of a nonspinning effective-one-body waveform model with ℓ=2 , 3, and 4 tidal multipole moments that reproduces waveforms of binary neutron star numerical simulations up to merger. The surrogate is built from compact sets of effective-one-body waveform amplitude and phase data that each form a reduced basis. We find that 12 amplitude and 7 phase basis elements are sufficient to reconstruct any binary neutron star waveform with a starting frequency of 10 Hz. The surrogate has maximum errors of 3.8% in amplitude (0.04% excluding the last 100 M before merger) and 0.043 rad in phase. This leads to typical mismatches of 10-5-10-4 for Advanced LIGO depending on the component masses, with a worst case match of 7 ×10-4 when both stars have masses ≥2 M⊙. The version implemented in the LIGO Algorithm Library takes ˜0.07 s to evaluate for a starting frequency of 30 Hz and ˜0.8 s for a starting frequency of 10 Hz, resulting in a speed-up factor of O (1 03) relative to the original matlab code. This allows parameter estimation codes to run in days to weeks rather than years, and we demonstrate this with a nested sampling run that recovers the masses and tidal parameters of a simulated binary neutron star system.

  16. On {\\sigma}-LCD codes

    OpenAIRE

    Carlet, Claude; Mesnager, Sihem; Tang, Chunming; Qi, Yanfeng

    2017-01-01

    Linear complementary pairs (LCP) of codes play an important role in armoring implementations against side-channel attacks and fault injection attacks. One of the most common ways to construct LCP of codes is to use Euclidean linear complementary dual (LCD) codes. In this paper, we first introduce the concept of linear codes with $\\sigma$ complementary dual ($\\sigma$-LCD), which includes known Euclidean LCD codes, Hermitian LCD codes, and Galois LCD codes. As Euclidean LCD codes, $\\sigma$-LCD ...

  17. Satisfiability modulo theory and binary puzzle

    Science.gov (United States)

    Utomo, Putranto

    2017-06-01

    The binary puzzle is a sudoku-like puzzle with values in each cell taken from the set {0, 1}. We look at the mathematical theory behind it. A solved binary puzzle is an n × n binary array where n is even that satisfies the following conditions: (1) No three consecutive ones and no three consecutive zeros in each row and each column, (2) Every row and column is balanced, that is the number of ones and zeros must be equal in each row and in each column, (3) Every two rows and every two columns must be distinct. The binary puzzle had been proven to be an NP-complete problem [5]. Research concerning the satisfiability of formulas with respect to some background theory is called satisfiability modulo theory (SMT). An SMT solver is an extension of a satisfiability (SAT) solver. The notion of SMT can be used for solving various problem in mathematics and industries such as formula verification and operation research [1, 7]. In this paper we apply SMT to solve binary puzzles. In addition, we do an experiment in solving different sizes and different number of blanks. We also made comparison with two other approaches, namely by a SAT solver and exhaustive search.

  18. Star formation history: Modeling of visual binaries

    Science.gov (United States)

    Gebrehiwot, Y. M.; Tessema, S. B.; Malkov, O. Yu.; Kovaleva, D. A.; Sytov, A. Yu.; Tutukov, A. V.

    2018-05-01

    Most stars form in binary or multiple systems. Their evolution is defined by masses of components, orbital separation and eccentricity. In order to understand star formation and evolutionary processes, it is vital to find distributions of physical parameters of binaries. We have carried out Monte Carlo simulations in which we simulate different pairing scenarios: random pairing, primary-constrained pairing, split-core pairing, and total and primary pairing in order to get distributions of binaries over physical parameters at birth. Next, for comparison with observations, we account for stellar evolution and selection effects. Brightness, radius, temperature, and other parameters of components are assigned or calculated according to approximate relations for stars in different evolutionary stages (main-sequence stars, red giants, white dwarfs, relativistic objects). Evolutionary stage is defined as a function of system age and component masses. We compare our results with the observed IMF, binarity rate, and binary mass-ratio distributions for field visual binaries to find initial distributions and pairing scenarios that produce observed distributions.

  19. Stacking Analysis of Binary Systems with HAWC

    Science.gov (United States)

    Brisbois, Chad; HAWC Collaboration

    2017-01-01

    Detecting binary systems at TeV energies is an important problem because only a handful of such systems are currently known. The nature of such systems is typically thought to be composed of a compact object and a massive star. The TeV emission from these systems does not obviously correspond to emission in GeV or X-ray, where many binary systems have previously been found. This study focuses on a stacking method to detect TeV emission from LS 5039, a known TeV binary, to test its efficacy in HAWC data. Stacking is a widely employed method for increasing signal to noise ratio in optical astronomy, but has never been attempted previously with HAWC. HAWC is an ideal instrument to search for TeV binaries, because of its wide field of view and high uptime. Applying this method to the entire sky may allow HAWC to detect binary sources of very short or very long periods not sensitive to current analyses. NSF, DOE, Los Alamos, Michigan Tech, CONACyt, UNAM, BUAP.

  20. Testing stellar evolution models with detached eclipsing binaries

    Science.gov (United States)

    Higl, J.; Weiss, A.

    2017-12-01

    Stellar evolution codes, as all other numerical tools, need to be verified. One of the standard stellar objects that allow stringent tests of stellar evolution theory and models, are detached eclipsing binaries. We have used 19 such objects to test our stellar evolution code, in order to see whether standard methods and assumptions suffice to reproduce the observed global properties. In this paper we concentrate on three effects that contain a specific uncertainty: atomic diffusion as used for standard solar model calculations, overshooting from convective regions, and a simple model for the effect of stellar spots on stellar radius, which is one of the possible solutions for the radius problem of M dwarfs. We find that in general old systems need diffusion to allow for, or at least improve, an acceptable fit, and that systems with convective cores indeed need overshooting. Only one system (AI Phe) requires the absence of it for a successful fit. To match stellar radii for very low-mass stars, the spot model proved to be an effective approach, but depending on model details, requires a high percentage of the surface being covered by spots. We briefly discuss improvements needed to further reduce the freedom in modelling and to allow an even more restrictive test by using these objects.