Optimized reversible binary-coded decimal adders

DEFF Research Database (Denmark)

Thomsen, Michael Kirkedal; Glück, Robert

2008-01-01

Abstract Babu and Chowdhury [H.M.H. Babu, A.R. Chowdhury, Design of a compact reversible binary coded decimal adder circuit, Journal of Systems Architecture 52 (5) (2006) 272-282] recently proposed, in this journal, a reversible adder for binary-coded decimals. This paper corrects and optimizes...... 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....... Keywords: Reversible logic circuit; Full-adder; Half-adder; Parallel adder; Binary-coded decimal; Application of reversible logic synthesis...

Non-binary Hybrid LDPC Codes: Structure, Decoding and Optimization

OpenAIRE

Sassatelli, Lucile; Declercq, David

2007-01-01

In this paper, we propose to study and optimize a very general class of LDPC codes whose variable nodes belong to finite sets with different orders. We named this class of codes Hybrid LDPC codes. Although efficient optimization techniques exist for binary LDPC codes and more recently for non-binary LDPC codes, they both exhibit drawbacks due to different reasons. Our goal is to capitalize on the advantages of both families by building codes with binary (or small finite set order) and non-bin...

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

Performance Analysis of New Binary User Codes for DS-CDMA Communication

Science.gov (United States)

Usha, Kamle; Jaya Sankar, Kottareddygari

2016-03-01

This paper analyzes new binary spreading codes through correlation properties and also presents their performance over additive white Gaussian noise (AWGN) channel. The proposed codes are constructed using gray and inverse gray codes. In this paper, a n-bit gray code appended by its n-bit inverse gray code to construct the 2n-length binary user codes are discussed. Like Walsh codes, these binary user codes are available in sizes of power of two and additionally code sets of length 6 and their even multiples are also available. The simple construction technique and generation of code sets of different sizes are the salient features of the proposed codes. Walsh codes and gold codes are considered for comparison in this paper as these are popularly used for synchronous and asynchronous multi user communications respectively. In the current work the auto and cross correlation properties of the proposed codes are compared with those of Walsh codes and gold codes. Performance of the proposed binary user codes for both synchronous and asynchronous direct sequence CDMA communication over AWGN channel is also discussed in this paper. The proposed binary user codes are found to be suitable for both synchronous and asynchronous DS-CDMA communication.

Weight Distribution for Non-binary Cluster LDPC Code Ensemble

Science.gov (United States)

Nozaki, Takayuki; Maehara, Masaki; Kasai, Kenta; Sakaniwa, Kohichi

In this paper, we derive the average weight distributions for the irregular non-binary cluster low-density parity-check (LDPC) code ensembles. Moreover, we give the exponential growth rate of the average weight distribution in the limit of large code length. We show that there exist $(2,d_c)$-regular non-binary cluster LDPC code ensembles whose normalized typical minimum distances are strictly positive.

A Fast Optimization Method for General Binary Code Learning.

Science.gov (United States)

Shen, Fumin; Zhou, Xiang; Yang, Yang; Song, Jingkuan; Shen, Heng; Tao, Dacheng

2016-09-22

Hashing or binary code learning has been recognized to accomplish efficient near neighbor search, and has thus attracted broad interests in recent retrieval, vision and learning studies. One main challenge of learning to hash arises from the involvement of discrete variables in binary code optimization. While the widely-used continuous relaxation may achieve high learning efficiency, the pursued codes are typically less effective due to accumulated quantization error. In this work, we propose a novel binary code optimization method, dubbed Discrete Proximal Linearized Minimization (DPLM), which directly handles the discrete constraints during the learning process. Specifically, the discrete (thus nonsmooth nonconvex) problem is reformulated as minimizing the sum of a smooth loss term with a nonsmooth indicator function. The obtained problem is then efficiently solved by an iterative procedure with each iteration admitting an analytical discrete solution, which is thus shown to converge very fast. In addition, the proposed method supports a large family of empirical loss functions, which is particularly instantiated in this work by both a supervised and an unsupervised hashing losses, together with the bits uncorrelation and balance constraints. In particular, the proposed DPLM with a supervised `2 loss encodes the whole NUS-WIDE database into 64-bit binary codes within 10 seconds on a standard desktop computer. The proposed approach is extensively evaluated on several large-scale datasets and the generated binary codes are shown to achieve very promising results on both retrieval and classification tasks.

A primer on pseudorandom generators

CERN Document Server

Goldreich, Oded

2010-01-01

A fresh look at the question of randomness was taken in the theory of computing: A distribution is pseudorandom if it cannot be distinguished from the uniform distribution by any efficient procedure. This paradigm, originally associating efficient procedures with polynomial-time algorithms, has been applied with respect to a variety of natural classes of distinguishing procedures. The resulting theory of pseudorandomness is relevant to science at large and is closely related to central areas of computer science, such as algorithmic design, complexity theory, and cryptography. This primer surveys the theory of pseudorandomness, starting with the general paradigm, and discussing various incarnations while emphasizing the case of general-purpose pseudorandom generators (withstanding any polynomial-time distinguisher). Additional topics include the "derandomization" of arbitrary probabilistic polynomial-time algorithms, pseudorandom generators withstanding space-bounded distinguishers, and several natural notions...

Analysis of Non-binary Hybrid LDPC Codes

OpenAIRE

Sassatelli, Lucile; Declercq, David

2008-01-01

In this paper, we analyse asymptotically a new class of LDPC codes called Non-binary Hybrid LDPC codes, which has been recently introduced. We use density evolution techniques to derive a stability condition for hybrid LDPC codes, and prove their threshold behavior. We study this stability condition to conclude on asymptotic advantages of hybrid LDPC codes compared to their non-hybrid counterparts.

Time development of cascades by the binary collision approximation code

International Nuclear Information System (INIS)

Fukumura, A.; Ishino, S.; Sekimura, N.

1991-01-01

To link a molecular dynamic calculation to binary collision approximation codes to explore high energy cascade damage, time between consecutive collisions is introduced into the binary collision MARLOWE code. Calculated results for gold by the modified code show formation of sub-cascades and their spatial and time overlapping, which can affect formation of defect clusters. (orig.)

Min-Max decoding for non binary LDPC codes

OpenAIRE

Savin, Valentin

2008-01-01

Iterative decoding of non-binary LDPC codes is currently performed using either the Sum-Product or the Min-Sum algorithms or slightly different versions of them. In this paper, several low-complexity quasi-optimal iterative algorithms are proposed for decoding non-binary codes. The Min-Max algorithm is one of them and it has the benefit of two possible LLR domain implementations: a standard implementation, whose complexity scales as the square of the Galois field's cardinality and a reduced c...

Cryptographic pseudo-random sequence from the spatial chaotic map

International Nuclear Information System (INIS)

Sun Fuyan; Liu Shutang

2009-01-01

A scheme for pseudo-random binary sequence generation based on the spatial chaotic map is proposed. In order to face the challenge of using the proposed PRBS in cryptography, the proposed PRBS is subjected to statistical tests which are the well-known FIPS-140-1 in the area of cryptography, and correlation properties of the proposed sequences are investigated. The proposed PRBS successfully passes all these tests. Results of statistical testing of the sequences are found encouraging. The results of statistical tests suggest strong candidature for cryptographic applications.

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.

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.

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.

New extremal binary self-dual codes of lengths 64 and 66 from bicubic planar graphs

OpenAIRE

Kaya, Abidin

2016-01-01

In this work, connected cubic planar bipartite graphs and related binary self-dual codes are studied. Binary self-dual codes of length 16 are obtained by face-vertex incidence matrices of these graphs. By considering their lifts to the ring R_2 new extremal binary self-dual codes of lengths 64 are constructed as Gray images. More precisely, we construct 15 new codes of length 64. Moreover, 10 new codes of length 66 were obtained by applying a building-up construction to the binary codes. Code...

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

New binary linear codes which are dual transforms of good codes

NARCIS (Netherlands)

Jaffe, D.B.; Simonis, J.

1999-01-01

If C is a binary linear code, one may choose a subset S of C, and form a new code CST which is the row space of the matrix having the elements of S as its columns. One way of picking S is to choose a subgroup H of Aut(C) and let S be some H-stable subset of C. Using (primarily) this method for

Design of Long Period Pseudo-Random Sequences from the Addition of -Sequences over

Directory of Open Access Journals (Sweden)

Ren Jian

2004-01-01

Full Text Available Pseudo-random sequence with good correlation property and large linear span is widely used in code division multiple access (CDMA communication systems and cryptology for reliable and secure information transmission. In this paper, sequences with long period, large complexity, balance statistics, and low cross-correlation property are constructed from the addition of -sequences with pairwise-prime linear spans (AMPLS. Using -sequences as building blocks, the proposed method proved to be an efficient and flexible approach to construct long period pseudo-random sequences with desirable properties from short period sequences. Applying the proposed method to , a signal set is constructed.

PopCORN: Hunting down the differences between binary population synthesis codes

Science.gov (United States)

Toonen, S.; Claeys, J. S. W.; Mennekens, N.; Ruiter, A. J.

2014-02-01

Context. Binary population synthesis (BPS) modelling is a very effective tool to study the evolution and properties of various types of close binary systems. The uncertainty in the parameters of the model and their effect on a population can be tested in a statistical way, which then leads to a deeper understanding of the underlying (sometimes poorly understood) physical processes involved. Several BPS codes exist that have been developed with different philosophies and aims. Although BPS has been very successful for studies of many populations of binary stars, in the particular case of the study of the progenitors of supernovae Type Ia, the predicted rates and ZAMS progenitors vary substantially between different BPS codes. Aims: To understand the predictive power of BPS codes, we study the similarities and differences in the predictions of four different BPS codes for low- and intermediate-mass binaries. We investigate the differences in the characteristics of the predicted populations, and whether they are caused by different assumptions made in the BPS codes or by numerical effects, e.g. a lack of accuracy in BPS codes. Methods: We compare a large number of evolutionary sequences for binary stars, starting with the same initial conditions following the evolution until the first (and when applicable, the second) white dwarf (WD) is formed. To simplify the complex problem of comparing BPS codes that are based on many (often different) assumptions, we equalise the assumptions as much as possible to examine the inherent differences of the four BPS codes. Results: We find that the simulated populations are similar between the codes. Regarding the population of binaries with one WD, there is very good agreement between the physical characteristics, the evolutionary channels that lead to the birth of these systems, and their birthrates. Regarding the double WD population, there is a good agreement on which evolutionary channels exist to create double WDs and a rough

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)

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.

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

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)

Binary Systematic Network Coding for Progressive Packet Decoding

OpenAIRE

Jones, Andrew L.; Chatzigeorgiou, Ioannis; Tassi, Andrea

2015-01-01

We consider binary systematic network codes and investigate their capability of decoding a source message either in full or in part. We carry out a probability analysis, derive closed-form expressions for the decoding probability and show that systematic network coding outperforms conventional net- work coding. We also develop an algorithm based on Gaussian elimination that allows progressive decoding of source packets. Simulation results show that the proposed decoding algorithm can achieve ...

Analysis of heart rate and oxygen uptake kinetics studied by two different pseudo-random binary sequence work rate amplitudes.

Science.gov (United States)

Drescher, U; Koschate, J; Schiffer, T; Schneider, S; Hoffmann, U

2017-06-01

The aim of the study was to compare the kinetics responses of heart rate (HR), pulmonary (V˙O 2 pulm) and predicted muscular (V˙O 2 musc) oxygen uptake between two different pseudo-random binary sequence (PRBS) work rate (WR) amplitudes both below anaerobic threshold. Eight healthy individuals performed two PRBS WR protocols implying changes between 30W and 80W and between 30W and 110W. HR and V˙O 2 pulm were measured beat-to-beat and breath-by-breath, respectively. V˙O 2 musc was estimated applying the approach of Hoffmann et al. (Eur J Appl Physiol 113: 1745-1754, 2013) considering a circulatory model for venous return and cross-correlation functions (CCF) for the kinetics analysis. HR and V˙O 2 musc kinetics seem to be independent of WR intensity (p>0.05). V˙O 2 pulm kinetics show prominent differences in the lag of the CCF maximum (39±9s; 31±4s; p<0.05). A mean difference of 14W between the PRBS WR amplitudes impacts venous return significantly, while HR and V˙O 2 musc kinetics remain unchanged. Copyright © 2017 Elsevier B.V. All rights reserved.

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

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)

Adaptable recursive binary entropy coding technique

Science.gov (United States)

Kiely, Aaron B.; Klimesh, Matthew A.

2002-07-01

We present a novel data compression technique, called recursive interleaved entropy coding, that is based on recursive interleaving of variable-to variable length binary source codes. A compression module implementing this technique has the same functionality as arithmetic coding and can be used as the engine in various data compression algorithms. The encoder compresses a bit sequence by recursively encoding groups of bits that have similar estimated statistics, ordering the output in a way that is suited to the decoder. As a result, the decoder has low complexity. The encoding process for our technique is adaptable in that each bit to be encoded has an associated probability-of-zero estimate that may depend on previously encoded bits; this adaptability allows more effective compression. Recursive interleaved entropy coding may have advantages over arithmetic coding, including most notably the admission of a simple and fast decoder. Much variation is possible in the choice of component codes and in the interleaving structure, yielding coder designs of varying complexity and compression efficiency; coder designs that achieve arbitrarily small redundancy can be produced. We discuss coder design and performance estimation methods. We present practical encoding and decoding algorithms, as well as measured performance results.

The linear programming bound for binary linear codes

NARCIS (Netherlands)

Brouwer, A.E.

1993-01-01

Combining Delsarte's (1973) linear programming bound with the information that certain weights cannot occur, new upper bounds for dmin (n,k), the maximum possible minimum distance of a binary linear code with given word length n and dimension k, are derived.

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.

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.

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...... used) encryption modes as CBC mode and counter (CTR) mode, but is provably secure against chosen-plaintext attack (CPA) already if the underlying symmetric cipher is secure against known-plaintext attack (KPA). We prove that CBC, CTR and Jutla’s integrity aware modes do not have this property....... In particular, we prove that when using a KPA secure block cipher, then: CBC mode is KPA secure, but need not be CPA secure, Jutla’s modes need not be CPA secure, and CTR mode need not be even KPA secure. The analysis is done in a concrete security framework....

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.

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....... Tested on individual images of binary shapes and binary layers of digital maps the algorithm outperforms PWC, JBIG and MPEG-4 CAE. On the binary shapes the code lengths are reduced by 21%, 25%, and 42%, respectively. On the maps the reductions are 34%, 32%, and 59%, respectively. The algorithm is also...

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

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.

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...... codes. As a counterpart to quick-look-in (QLI) codes which are not "transparent," we introduce rateR = 1/2easy-look-in-transparent (ELIT) codes with a feedforward inverse(1 + D,D). In general, ELIT codes haved_{infty}superior to that of QLI codes....

Binary pseudo-random patterned structures for modulation transfer function calibration and resolution characterization of a full-field transmission soft x-ray microscope

Energy Technology Data Exchange (ETDEWEB)

Yashchuk, V. V., E-mail: VVYashchuk@lbl.gov; Chan, E. R.; Lacey, I. [Advanced Light Source, Lawrence Berkeley National Laboratory, Berkeley, California 94720 (United States); Fischer, P. J. [Center for X-Ray Optics, Lawrence Berkeley National Laboratory, Berkeley, California 94720 (United States); Physics Department, University of California Santa Cruz, Santa Cruz, California 94056 (United States); Conley, R. [Advance Photon Source, Argonne National Laboratory, Argonne, Illinois 60439 (United States); National Synchrotron Light Source II, Brookhaven National Laboratory, Upton, New York 11973 (United States); McKinney, W. R. [Diablo Valley College, 321 Golf Club Road, Pleasant Hill, California 94523 (United States); Artemiev, N. A. [KLA-Tencor Corp., 1 Technology Drive, Milpitas, California 95035 (United States); Bouet, N. [National Synchrotron Light Source II, Brookhaven National Laboratory, Upton, New York 11973 (United States); Cabrini, S. [Molecular Foundry, Lawrence Berkeley National Laboratory, Berkeley, California 94720 (United States); Calafiore, G.; Peroz, C.; Babin, S. [aBeam Technologies, Inc., Hayward, California 94541 (United States)

2015-12-15

We present a modulation transfer function (MTF) calibration method based on binary pseudo-random (BPR) one-dimensional sequences and two-dimensional arrays as an effective method for spectral characterization in the spatial frequency domain of a broad variety of metrology instrumentation, including interferometric microscopes, scatterometers, phase shifting Fizeau interferometers, scanning and transmission electron microscopes, and at this time, x-ray microscopes. The inherent power spectral density of BPR gratings and arrays, which has a deterministic white-noise-like character, allows a direct determination of the MTF with a uniform sensitivity over the entire spatial frequency range and field of view of an instrument. We demonstrate the MTF calibration and resolution characterization over the full field of a transmission soft x-ray microscope using a BPR multilayer (ML) test sample with 2.8 nm fundamental layer thickness. We show that beyond providing a direct measurement of the microscope’s MTF, tests with the BPRML sample can be used to fine tune the instrument’s focal distance. Our results confirm the universality 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.

Binary pseudo-random patterned structures for modulation transfer function calibration and resolution characterization of a full-field transmission soft x-ray microscope

International Nuclear Information System (INIS)

Yashchuk, V. V.; Chan, E. R.; Lacey, I.; Fischer, P. J.; Conley, R.; McKinney, W. R.; Artemiev, N. A.; Bouet, N.; Cabrini, S.; Calafiore, G.; Peroz, C.; Babin, S.

2015-01-01

We present a modulation transfer function (MTF) calibration method based on binary pseudo-random (BPR) one-dimensional sequences and two-dimensional arrays as an effective method for spectral characterization in the spatial frequency domain of a broad variety of metrology instrumentation, including interferometric microscopes, scatterometers, phase shifting Fizeau interferometers, scanning and transmission electron microscopes, and at this time, x-ray microscopes. The inherent power spectral density of BPR gratings and arrays, which has a deterministic white-noise-like character, allows a direct determination of the MTF with a uniform sensitivity over the entire spatial frequency range and field of view of an instrument. We demonstrate the MTF calibration and resolution characterization over the full field of a transmission soft x-ray microscope using a BPR multilayer (ML) test sample with 2.8 nm fundamental layer thickness. We show that beyond providing a direct measurement of the microscope’s MTF, tests with the BPRML sample can be used to fine tune the instrument’s focal distance. Our results confirm the universality 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

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.

Simulation and verification of the EBR-II automatic control rod drive system with continuous system modeling codes

International Nuclear Information System (INIS)

Larson, H.A.; Dean, E.M.

1985-01-01

The two computer programs are successful in modeling the EBR-II ACRDS. In fact, this is very convenient for a presampling of the consequences of a desired power movement. The ACRDS is to be modified so that the error signal is a comparison between demand position and measured position. Purpose of this change is to permit pseudo-random binary types of reactivity transfer function experiments at EBR-II. Questions asked about the computer software and hardware to accommodate this change can be quickly answered with either of the verified codes discussed here

Identification of some cross flow heat exchanger dynamic responses by measurement with low level binary pseudo-random input signals

International Nuclear Information System (INIS)

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

1964-02-01

An experiment was performed to assess the usefulness of the binary cross-correlation method in the context of the identification problem. An auxiliary burner was excited with a discrete interval binary code and the response to the perturbation of the input heat was observed by recording the variations of the primary inlet, primary outlet and secondary outlet temperatures. The observations were analysed to yield cross-correlation functions and frequency responses were subsequently determined between primary inlet and primary outlet temperatures and also between primary inlet and secondary outlet temperatures. The analysis verified (1) that these dynamic responses of this cross flow heat exchanger may be predicted theoretically, (2) in so far as this heat exchanger is representative of the generality of plant, that the binary cross-correlation method provides adequate identification of plant dynamics for control purposes in environments where small input variations and low signal to noise ratio are obligatory. (author)

The Technique of Binary Code Decompilation and Its Application in Information Security Sphere

Directory of Open Access Journals (Sweden)

M. O. Shudrak

2012-12-01

Full Text Available The authors describes a new technique of binary code decompilation and its application possibility in information security such as software protection against reverse engineering and code obfuscation analyze in malware.

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.

Pseudo-random bit generator based on lag time series

Science.gov (United States)

García-Martínez, M.; Campos-Cantón, E.

2014-12-01

In this paper, we present a pseudo-random bit generator (PRBG) based on two lag time series of the logistic map using positive and negative values in the bifurcation parameter. In order to hidden the map used to build the pseudo-random series we have used a delay in the generation of time series. These new series when they are mapped xn against xn+1 present a cloud of points unrelated to the logistic map. Finally, the pseudo-random sequences have been tested with the suite of NIST giving satisfactory results for use in stream ciphers.

u-Constacyclic codes over F_p+u{F}_p and their applications of constructing new non-binary quantum codes

Science.gov (United States)

Gao, Jian; Wang, Yongkang

2018-01-01

Structural properties of u-constacyclic codes over the ring F_p+u{F}_p are given, where p is an odd prime and u^2=1. Under a special Gray map from F_p+u{F}_p to F_p^2, some new non-binary quantum codes are obtained by this class of constacyclic codes.

Design of Long Period Pseudo-Random Sequences from the Addition of m -Sequences over 𝔽 p

Directory of Open Access Journals (Sweden)

Ren Jian

2004-01-01

Full Text Available Pseudo-random sequence with good correlation property and large linear span is widely used in code division multiple access (CDMA communication systems and cryptology for reliable and secure information transmission. In this paper, sequences with long period, large complexity, balance statistics, and low cross-correlation property are constructed from the addition of m -sequences with pairwise-prime linear spans (AMPLS. Using m -sequences as building blocks, the proposed method proved to be an efficient and flexible approach to construct long period pseudo-random sequences with desirable properties from short period sequences. Applying the proposed method to 𝔽 2 , a signal set ( ( 2 n − 1 ( 2 m − 1 , ( 2 n + 1 ( 2 m + 1 , ( 2 ( n + 1 / 2 + 1 ( 2 ( m + 1 / 2 + 1 is constructed.

Binary codes storage and data encryption in substrates with single proton beam writing technology

International Nuclear Information System (INIS)

Zhang Jun; Zhan Furu; Hu Zhiwen; Chen Lianyun; Yu Zengliang

2006-01-01

It has been demonstrated that characters can be written by proton beams in various materials. In contributing to the rapid development of proton beam writing technology, we introduce a new method for binary code storage and data encryption by writing binary codes of characters (BCC) in substrates with single proton beam writing technology. In this study, two kinds of BCC (ASCII BCC and long bit encrypted BCC) were written in CR-39 by a 2.6 MeV single proton beam. Our results show that in comparison to directly writing character shapes, writing ASCII BCC turned out to be about six times faster and required about one fourth the area in substrates. The approach of writing long bit encrypted BCC by single proton beams supports preserving confidential information in substrates. Additionally, binary codes fabricated by MeV single proton beams in substrates are more robust than those formed by lasers, since MeV single proton beams can make much deeper pits in the substrates

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.

Pseudorandom Recursions: Small and Fast Pseudorandom Number Generators for Embedded Applications

Directory of Open Access Journals (Sweden)

Petruska Gyorgy

2007-01-01

Full Text Available Many new small and fast pseudorandom number generators are presented, which pass the most common randomness tests. They perform only a few, nonmultiplicative operations for each generated number, use very little memory, therefore, they are ideal for embedded applications. We present general methods to ensure very long cycles and show, how to create super fast, very small ciphers and hash functions from them.

Pseudorandom Recursions: Small and Fast Pseudorandom Number Generators for Embedded Applications

Directory of Open Access Journals (Sweden)

Gyorgy Petruska

2007-02-01

Full Text Available Many new small and fast pseudorandom number generators are presented, which pass the most common randomness tests. They perform only a few, nonmultiplicative operations for each generated number, use very little memory, therefore, they are ideal for embedded applications. We present general methods to ensure very long cycles and show, how to create super fast, very small ciphers and hash functions from them.

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.

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.

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)

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

to predict the chance of completion and accuracy score. Results: No specific pseudorandom sequence showed superior accuracy on the group basis. When isolating the individual performances with the highest accuracy, time consumption per identification was not significantly increased. The Accuracy Score aids...... is a laborious process. Aims: This study aimed to suggest an efficient method for choosing the optimal stimulus sequence based on a fast test and simple measures to increase the performance and minimize the time consumption for research trials. Methods: A total of 21 healthy subjects were included in an online...... wheelchair control task and completed the same task using stimuli based on the m-code, the gold-code, and the Barker-code. Correct/incorrect identification and time consumption were obtained for each identification. Subject-specific templates were characterized and used in a forward-step first-order model...

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

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

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.

Polarization-multiplexed rate-adaptive non-binary-quasi-cyclic-LDPC-coded multilevel modulation with coherent detection for optical transport networks.

Science.gov (United States)

Arabaci, Murat; Djordjevic, Ivan B; Saunders, Ross; Marcoccia, Roberto M

2010-02-01

In order to achieve high-speed transmission over optical transport networks (OTNs) and maximize its throughput, we propose using a rate-adaptive polarization-multiplexed coded multilevel modulation with coherent detection based on component non-binary quasi-cyclic (QC) LDPC codes. Compared to prior-art bit-interleaved LDPC-coded modulation (BI-LDPC-CM) scheme, the proposed non-binary LDPC-coded modulation (NB-LDPC-CM) scheme not only reduces latency due to symbol- instead of bit-level processing but also provides either impressive reduction in computational complexity or striking improvements in coding gain depending on the constellation size. As the paper presents, compared to its prior-art binary counterpart, the proposed NB-LDPC-CM scheme addresses the needs of future OTNs, which are achieving the target BER performance and providing maximum possible throughput both over the entire lifetime of the OTN, better.

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.

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.

Coding Local and Global Binary Visual Features Extracted From Video Sequences

Science.gov (United States)

Baroffio, Luca; Canclini, Antonio; Cesana, Matteo; Redondi, Alessandro; Tagliasacchi, Marco; Tubaro, Stefano

2015-11-01

Binary local features represent an effective alternative to real-valued descriptors, leading to comparable results for many visual analysis tasks, while being characterized by significantly lower computational complexity and memory requirements. When dealing with large collections, a more compact representation based on global features is often preferred, which can be obtained from local features by means of, e.g., the Bag-of-Visual-Word (BoVW) model. Several applications, including for example visual sensor networks and mobile augmented reality, require visual features to be transmitted over a bandwidth-limited network, thus calling for coding techniques that aim at reducing the required bit budget, while attaining a target level of efficiency. In this paper we investigate a coding scheme tailored to both local and global binary features, which aims at exploiting both spatial and temporal redundancy by means of intra- and inter-frame coding. In this respect, the proposed coding scheme can be conveniently adopted to support the Analyze-Then-Compress (ATC) paradigm. That is, visual features are extracted from the acquired content, encoded at remote nodes, and finally transmitted to a central controller that performs visual analysis. This is in contrast with the traditional approach, in which visual content is acquired at a node, compressed and then sent to a central unit for further processing, according to the Compress-Then-Analyze (CTA) paradigm. In this paper we experimentally compare ATC and CTA by means of rate-efficiency curves in the context of two different visual analysis tasks: homography estimation and content-based retrieval. Our results show that the novel ATC paradigm based on the proposed coding primitives can be competitive with CTA, especially in bandwidth limited scenarios.

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

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.

Chaos-based Pseudo-random Number Generation

KAUST Repository

Barakat, Mohamed L.; Mansingka, Abhinav S.; Radwan, Ahmed Gomaa Ahmed; Salama, Khaled N.

2014-01-01

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.

Discussion on LDPC Codes and Uplink Coding

Science.gov (United States)

Andrews, Ken; Divsalar, Dariush; Dolinar, Sam; Moision, Bruce; Hamkins, Jon; Pollara, Fabrizio

2007-01-01

This slide presentation reviews the progress that the workgroup on Low-Density Parity-Check (LDPC) for space link coding. The workgroup is tasked with developing and recommending new error correcting codes for near-Earth, Lunar, and deep space applications. Included in the presentation is a summary of the technical progress of the workgroup. Charts that show the LDPC decoder sensitivity to symbol scaling errors are reviewed, as well as a chart showing the performance of several frame synchronizer algorithms compared to that of some good codes and LDPC decoder tests at ESTL. Also reviewed is a study on Coding, Modulation, and Link Protocol (CMLP), and the recommended codes. A design for the Pseudo-Randomizer with LDPC Decoder and CRC is also reviewed. A chart that summarizes the three proposed coding systems is also presented.

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

A symbolic dynamics approach for the complexity analysis of chaotic pseudo-random sequences

International Nuclear Information System (INIS)

Xiao Fanghong

2004-01-01

By considering a chaotic pseudo-random sequence as a symbolic sequence, authors present a symbolic dynamics approach for the complexity analysis of chaotic pseudo-random sequences. The method is applied to the cases of Logistic map and one-way coupled map lattice to demonstrate how it works, and a comparison is made between it and the approximate entropy method. The results show that this method is applicable to distinguish the complexities of different chaotic pseudo-random sequences, and it is superior to the approximate entropy method

Zone memories and pseudorandom addressing

International Nuclear Information System (INIS)

Marino, D.; Mirizzi, N.; Stella, R.; Visaggio, G.

1975-01-01

A quantitative comparison between zone memories, pseudorandom addressed memories and an alternative special purpose memory (spread zone memory) in which the distance between any two transformed descriptors, at first adjacent, is independent of the descriptors pair and results the maximum one is presented. This memory has not been particularly considered at present in spite of its efficiency and its simple implementation

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.

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

Coding Local and Global Binary Visual Features Extracted From Video Sequences.

Science.gov (United States)

Baroffio, Luca; Canclini, Antonio; Cesana, Matteo; Redondi, Alessandro; Tagliasacchi, Marco; Tubaro, Stefano

2015-11-01

Binary local features represent an effective alternative to real-valued descriptors, leading to comparable results for many visual analysis tasks while being characterized by significantly lower computational complexity and memory requirements. When dealing with large collections, a more compact representation based on global features is often preferred, which can be obtained from local features by means of, e.g., the bag-of-visual word model. Several applications, including, for example, visual sensor networks and mobile augmented reality, require visual features to be transmitted over a bandwidth-limited network, thus calling for coding techniques that aim at reducing the required bit budget while attaining a target level of efficiency. In this paper, we investigate a coding scheme tailored to both local and global binary features, which aims at exploiting both spatial and temporal redundancy by means of intra- and inter-frame coding. In this respect, the proposed coding scheme can conveniently be adopted to support the analyze-then-compress (ATC) paradigm. That is, visual features are extracted from the acquired content, encoded at remote nodes, and finally transmitted to a central controller that performs the visual analysis. This is in contrast with the traditional approach, in which visual content is acquired at a node, compressed and then sent to a central unit for further processing, according to the compress-then-analyze (CTA) paradigm. In this paper, we experimentally compare the ATC and the CTA by means of rate-efficiency curves in the context of two different visual analysis tasks: 1) homography estimation and 2) content-based retrieval. Our results show that the novel ATC paradigm based on the proposed coding primitives can be competitive with the CTA, especially in bandwidth limited scenarios.

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.

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.

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

ICAROG: a computer code that converts a WIMSD/4 format library of BCD code to binary and vice versa

International Nuclear Information System (INIS)

Caldeira, A.D.

1991-09-01

A program called ICAROG, developed for the CYBER 170/750 system, that converts from BCD to binary code and vice versa a nuclear data library in WIMSD/4 program format is presented. ICAROG has also the capability of separating from the library isotopes specified by the user. (author)

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.

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.

Joint beam design and user selection over non-binary coded MIMO interference channel

Science.gov (United States)

Li, Haitao; Yuan, Haiying

2013-03-01

In this paper, we discuss the problem of sum rate improvement for coded MIMO interference system, and propose joint beam design and user selection over interference channel. Firstly, we have formulated non-binary LDPC coded MIMO interference networks model. Then, the least square beam design for MIMO interference system is derived, and the low complexity user selection is presented. Simulation results confirm that the sum rate can be improved by the joint user selection and beam design comparing with single interference aligning beamformer.

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

DEFF Research Database (Denmark)

Paaske, Erik

1974-01-01

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

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

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.

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

An efficient parallel pseudorandom bit generator based

Indian Academy of Sciences (India)

In this paper, an asymmetric coupled map lattice (CML) combining sawtooth map as a local map is presented and its chaotic behaviours are analysed. Based on this asymmetric CML, a pseudorandom bit generator (PRBG) is proposed. The specific parameters of the system that make complicated floating-point computation ...

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

BHDD: Primordial black hole binaries code

Science.gov (United States)

Kavanagh, Bradley J.; Gaggero, Daniele; Bertone, Gianfranco

2018-06-01

BHDD (BlackHolesDarkDress) simulates primordial black hole (PBH) binaries that are clothed in dark matter (DM) halos. The software uses N-body simulations and analytical estimates to follow the evolution of PBH binaries formed in the early Universe.

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

An upper bound for codes for the noisy two-access binary adder channel

NARCIS (Netherlands)

Tilborg, van H.C.A.

1986-01-01

Using earlier methods a combinatorial upper bound is derived for|C|. cdot |D|, where(C,D)is adelta-decodable code pair for the noisy two-access binary adder channel. Asymptotically, this bound reduces toR_{1}=R_{2} leq frac{3}{2} + elog_{2} e - (frac{1}{2} + e) log_{2} (1 + 2e)= frac{1}{2} - e +

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.

Efficient pseudorandom generators based on the DDH assumption

NARCIS (Netherlands)

Rezaeian Farashahi, R.; Schoenmakers, B.; Sidorenko, A.; Okamoto, T.; Wang, X.

2007-01-01

A family of pseudorandom generators based on the decisional Diffie-Hellman assumption is proposed. The new construction is a modified and generalized version of the Dual Elliptic Curve generator proposed by Barker and Kelsey. Although the original Dual Elliptic Curve generator is shown to be

Pseudorandom Testing – A Study of the Effect of the Generator Type

Directory of Open Access Journals (Sweden)

P. Fišer

2005-01-01

Full Text Available The test pattern generator produces test vectors that are applied to the tested circuit during pseudo-random testing of combinational circuits. The nature of the generator thus directly influences the fault coverage achieved. In this paper we discuss the influence of the type of pseudo-random pattern generator on stuck-at fault coverage. Linear feedback shift registers (LFSRs are mostly used as test pattern generators, and the generating polynomial is primitive to ensure the maximum period. We have shown that it is not necessary to use primitive polynomials, and moreover that their using is even undesirable in most cases. This fact is documented by statistical graphs. The necessity of the proper choice of a generating polynomial and an LFSR seed is shown here, by designing a mixed-mode BIST for the ISCAS benchmarks.An alternative to LFSRs are cellular automata (CA. We study the effectiveness of CA when used as pseudo-random pattern generators. The observations are documented by statistical results. 

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.

Development of Ultrasonic Pulse Compression Using Golay Codes

International Nuclear Information System (INIS)

Kim, Young H.; Kim, Young Gil; Jeong, Peter

1994-01-01

Conventional ultrasonic flaw detection system uses a large amplitude narrow pulse to excite a transducer. However, these systems are limited in pulse energy. An excessively large amplitude causes a dielectric breakage of the transducer, and an excessively long pulse causes decrease of the resolution. Using the pulse compression, a long pulse of pseudorandom signal can be used without sacrificing resolution by signal correlation. In the present work, the pulse compression technique was implemented into an ultrasonic system. Golay code was used as a pseudorandom signal in this system, since pair sum of autocorrelations has no sidelobe. The equivalent input pulse of the Golay code was derived to analyze the pulse compression system. Throughout the experiment, the pulse compression technique has demonstrated for its improved SNR(signal to noise ratio) by reducing the system's white noise. And the experimental data also indicated that the SNR enhancement was proportional to the square root of the code length used. The technique seems to perform particularly well with highly energy-absorbent materials such as polymers, plastics and rubbers

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.

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.

Constacyclic codes over the ring F_q+v{F}_q+v2F_q and their applications of constructing new non-binary quantum codes

Science.gov (United States)

Ma, Fanghui; Gao, Jian; Fu, Fang-Wei

2018-06-01

Let R={F}_q+v{F}_q+v2{F}_q be a finite non-chain ring, where q is an odd prime power and v^3=v. In this paper, we propose two methods of constructing quantum codes from (α +β v+γ v2)-constacyclic codes over R. The first one is obtained via the Gray map and the Calderbank-Shor-Steane construction from Euclidean dual-containing (α +β v+γ v2)-constacyclic codes over R. The second one is obtained via the Gray map and the Hermitian construction from Hermitian dual-containing (α +β v+γ v2)-constacyclic codes over R. As an application, some new non-binary quantum codes are obtained.

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

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

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. ... map. Consider the bit-stream Bx formed by choosing every Pth bit of Sx, ... Similarly, the probability of the linear complexity C assuming the value c(c < N) when.

Code-modulated visual evoked potentials using fast stimulus presentation and spatiotemporal beamformer decoding.

Science.gov (United States)

Wittevrongel, Benjamin; Van Wolputte, Elia; Van Hulle, Marc M

2017-11-08

When encoding visual targets using various lagged versions of a pseudorandom binary sequence of luminance changes, the EEG signal recorded over the viewer's occipital pole exhibits so-called code-modulated visual evoked potentials (cVEPs), the phase lags of which can be tied to these targets. The cVEP paradigm has enjoyed interest in the brain-computer interfacing (BCI) community for the reported high information transfer rates (ITR, in bits/min). In this study, we introduce a novel decoding algorithm based on spatiotemporal beamforming, and show that this algorithm is able to accurately identify the gazed target. Especially for a small number of repetitions of the coding sequence, our beamforming approach significantly outperforms an optimised support vector machine (SVM)-based classifier, which is considered state-of-the-art in cVEP-based BCI. In addition to the traditional 60 Hz stimulus presentation rate for the coding sequence, we also explore the 120 Hz rate, and show that the latter enables faster communication, with a maximal median ITR of 172.87 bits/min. Finally, we also report on a transition effect in the EEG signal following the onset of the stimulus sequence, and recommend to exclude the first 150 ms of the trials from decoding when relying on a single presentation of the stimulus sequence.

Improved Iterative Hard- and Soft-Reliability Based Majority-Logic Decoding Algorithms for Non-Binary Low-Density Parity-Check Codes

Science.gov (United States)

Xiong, Chenrong; Yan, Zhiyuan

2014-10-01

Non-binary low-density parity-check (LDPC) codes have some advantages over their binary counterparts, but unfortunately their decoding complexity is a significant challenge. The iterative hard- and soft-reliability based majority-logic decoding algorithms are attractive for non-binary LDPC codes, since they involve only finite field additions and multiplications as well as integer operations and hence have significantly lower complexity than other algorithms. In this paper, we propose two improvements to the majority-logic decoding algorithms. Instead of the accumulation of reliability information in the existing majority-logic decoding algorithms, our first improvement is a new reliability information update. The new update not only results in better error performance and fewer iterations on average, but also further reduces computational complexity. Since existing majority-logic decoding algorithms tend to have a high error floor for codes whose parity check matrices have low column weights, our second improvement is a re-selection scheme, which leads to much lower error floors, at the expense of more finite field operations and integer operations, by identifying periodic points, re-selecting intermediate hard decisions, and changing reliability information.

On pseudorandom generators in NC⁰

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

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.

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.

FBC: a flat binary code scheme for fast Manhattan hash retrieval

Science.gov (United States)

Kong, Yan; Wu, Fuzhang; Gao, Lifa; Wu, Yanjun

2018-04-01

Hash coding is a widely used technique in approximate nearest neighbor (ANN) search, especially in document search and multimedia (such as image and video) retrieval. Based on the difference of distance measurement, hash methods are generally classified into two categories: Hamming hashing and Manhattan hashing. Benefitting from better neighborhood structure preservation, Manhattan hashing methods outperform earlier methods in search effectiveness. However, due to using decimal arithmetic operations instead of bit operations, Manhattan hashing becomes a more time-consuming process, which significantly decreases the whole search efficiency. To solve this problem, we present an intuitive hash scheme which uses Flat Binary Code (FBC) to encode the data points. As a result, the decimal arithmetic used in previous Manhattan hashing can be replaced by more efficient XOR operator. The final experiments show that with a reasonable memory space growth, our FBC speeds up more than 80% averagely without any search accuracy loss when comparing to the state-of-art Manhattan hashing methods.

Optimal codes as Tanner codes with cyclic component codes

DEFF Research Database (Denmark)

Høholdt, Tom; Pinero, Fernando; Zeng, Peng

2014-01-01

In this article we study a class of graph codes with cyclic code component codes as affine variety codes. Within this class of Tanner codes we find some optimal binary codes. We use a particular subgraph of the point-line incidence plane of A(2,q) as the Tanner graph, and we are able to describe ...

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.

Measuring long impulse responses with pseudorandom sequences and sweep signals

DEFF Research Database (Denmark)

Torras Rosell, Antoni; Jacobsen, Finn

2010-01-01

In architectural acoustics, background noise, loudspeaker nonlinearities, and time variances are the most common disturbances that can compromise a measurement. The effects of such disturbances on measurement of long impulse responses with pseudorandom sequences (maximum-length sequences (MLS) an...

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.

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

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

Development of Pseudorandom Binary Arrays for Calibration of Surface Profile Metrology Tools

International Nuclear Information System (INIS)

Barber, S.K.; Takacs, P.; Soldate, P.; Anderson, E.H.; Cambie, R.; McKinney, W.R.; Voronov, D.L.; Yashchuk, V.V.

2009-01-01

measured and simulated PSD distributions gives the MTF of the instrument. The applicability of the MTF concept to phase map measurements with optical interferometric microscopes needs to be experimentally verified as the optical tool and algorithms may introduce nonlinear artifacts into the process. In previous work [V. V. Yashchuk et al., Proc. SPIE 6704, 670408 (2007); Valeriy V. Yashchuk et al., Opt. Eng. (Bellingham) 47, 073602 (2008)] the instrumental MTF of a surface profiler was precisely measured using reference test surfaces based on binary pseudorandom (BPR) gratings. Here, the authors present results of fabricating and using two-dimensional (2D) BPR arrays that allow for a direct 2D calibration of the instrumental MTF. BPR sequences are widely used in engineering and communication applications such as global position systems and wireless communication protocols. The ideal BPR pattern has a flat 'white noise' response over the entire range of spatial frequencies of interest. The BPR array used here is based on the uniformly redundant array (URA) prescription [E. E. Fenimore and T. M. Cannon, Appl. Opt. 17, 337 (1978)] initially used for x-ray and gamma ray astronomy applications. The URA's superior imaging capability originates from the fact that its cyclical autocorrelation function very closely approximates a delta function, which produces a flat PSD. Three different size BPR array patterns were fabricated by electron beam lithography and induction coupled plasma etching of silicon. The basic size units were 200, 400, and 600 nm. Two different etch processes were used, CF 4 /Ar and HBr, which resulted in undercut and vertical sidewall profiles, respectively. The 2D BPR arrays were used as standard test surfaces for MTF calibration of the MicroMap(trademark)-570 interferometric microscope using all available objectives. The MicroMap(trademark)-570 interferometric microscope uses incoherent illumination from a tungsten filament source and common path modulated

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.

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

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.

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.

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

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

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

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)

A binary mixed integer coded genetic algorithm for multi-objective optimization of nuclear research reactor fuel reloading

Energy Technology Data Exchange (ETDEWEB)

Binh, Do Quang [University of Technical Education Ho Chi Minh City (Viet Nam); Huy, Ngo Quang [University of Industry Ho Chi Minh City (Viet Nam); Hai, Nguyen Hoang [Centre for Research and Development of Radiation Technology, Ho Chi Minh City (Viet Nam)

2014-12-15

This paper presents a new approach based on a binary mixed integer coded genetic algorithm in conjunction with the weighted sum method for multi-objective optimization of fuel loading patterns for nuclear research reactors. The proposed genetic algorithm works with two types of chromosomes: binary and integer chromosomes, and consists of two types of genetic operators: one working on binary chromosomes and the other working on integer chromosomes. The algorithm automatically searches for the most suitable weighting factors of the weighting function and the optimal fuel loading patterns in the search process. Illustrative calculations are implemented for a research reactor type TRIGA MARK II loaded with the Russian VVR-M2 fuels. Results show that the proposed genetic algorithm can successfully search for both the best weighting factors and a set of approximate optimal loading patterns that maximize the effective multiplication factor and minimize the power peaking factor while satisfying operational and safety constraints for the research reactor.

A binary mixed integer coded genetic algorithm for multi-objective optimization of nuclear research reactor fuel reloading

International Nuclear Information System (INIS)

Binh, Do Quang; Huy, Ngo Quang; Hai, Nguyen Hoang

2014-01-01

This paper presents a new approach based on a binary mixed integer coded genetic algorithm in conjunction with the weighted sum method for multi-objective optimization of fuel loading patterns for nuclear research reactors. The proposed genetic algorithm works with two types of chromosomes: binary and integer chromosomes, and consists of two types of genetic operators: one working on binary chromosomes and the other working on integer chromosomes. The algorithm automatically searches for the most suitable weighting factors of the weighting function and the optimal fuel loading patterns in the search process. Illustrative calculations are implemented for a research reactor type TRIGA MARK II loaded with the Russian VVR-M2 fuels. Results show that the proposed genetic algorithm can successfully search for both the best weighting factors and a set of approximate optimal loading patterns that maximize the effective multiplication factor and minimize the power peaking factor while satisfying operational and safety constraints for the research reactor.

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.

Frequency response testing at Experimental Breeder Reactor II using discrete-level periodic signals

International Nuclear Information System (INIS)

Rhodes, W.D.; Larson, H.A.

1990-01-01

The Experimental Breeder Reactor 2 (EBR-2) reactivity-to-power frequency-response function was measured with pseudo-random, discrete-level, periodic signals. The reactor power deviation was small with insignificant perturbation of normal operation and in-place irradiation experiments. Comparison of results with measured rod oscillator data and with theoretical predictions show good agreement. Moreover, measures of input signal quality (autocorrelation function and energy spectra) confirm the ability to enable this type of frequency response determination at EBR-2. Measurements were made with the pseudo-random binary sequence, quadratic residue binary sequence, pseudo-random ternary sequence, and the multifrequency binary sequence. 10 refs., 7 figs., 3 tabs

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.

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.

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.

Short-term hydro generation scheduling of Xiluodu and Xiangjiaba cascade hydropower stations using improved binary-real coded bee colony optimization algorithm

International Nuclear Information System (INIS)

Lu, Peng; Zhou, Jianzhong; Wang, Chao; Qiao, Qi; Mo, Li

2015-01-01

Highlights: • STHGS problem is decomposed into two parallel sub-problems of UC and ELD. • Binary coded BCO is used to solve UC sub-problem with 0–1 discrete variables. • Real coded BCO is used to solve ELD sub-problem with continuous variables. • Some heuristic repairing strategies are designed to handle various constraints. • The STHGS of Xiluodu and Xiangjiaba cascade stations is solved by IB-RBCO. - Abstract: Short-term hydro generation scheduling (STHGS) of cascade hydropower stations is a typical nonlinear mixed integer optimization problem to minimize the total water consumption while simultaneously meeting the grid requirements and other hydraulic and electrical constraints. In this paper, STHGS problem is decomposed into two parallel sub-problems of unit commitment (UC) and economic load dispatch (ELD), and the methodology of improved binary-real coded bee colony optimization (IB-RBCO) algorithm is proposed to solve them. Firstly, the improved binary coded BCO is used to solve the UC sub-problem with 0–1 discrete variables, and the heuristic repairing strategy for unit state constrains is applied to generate the feasible unit commitment schedule. Then, the improved real coded BCO is used to solve the ELD sub-problem with continuous variables, and an effective method is introduced to handle various unit operation constraints. Especially, the new updating strategy of DE/best/2/bin method with dynamic parameter control mechanism is applied to real coded BCO to improve the search ability of IB-RBCO. Finally, to verify the feasibility and effectiveness of the proposed IB-RBCO method, it is applied to solve the STHGS problem of Xiluodu and Xiangjiaba cascaded hydropower stations, and the simulating results are compared with other intelligence algorithms. The simulation results demonstrate that the proposed IB-RBCO method can get higher-quality solutions with less water consumption and shorter calculating time when facing the complex STHGS problem

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)

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.

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.

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.

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

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.

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.

Syndrome-source-coding and its universal generalization. [error correcting codes for data compression

Science.gov (United States)

Ancheta, T. C., Jr.

1976-01-01

A method of using error-correcting codes to obtain data compression, called syndrome-source-coding, is described in which the source sequence is treated as an error pattern whose syndrome forms the compressed data. It is shown that syndrome-source-coding can achieve arbitrarily small distortion with the number of compressed digits per source digit arbitrarily close to the entropy of a binary memoryless source. A 'universal' generalization of syndrome-source-coding is formulated which provides robustly effective distortionless coding of source ensembles. Two examples are given, comparing the performance of noiseless universal syndrome-source-coding to (1) run-length coding and (2) Lynch-Davisson-Schalkwijk-Cover universal coding for an ensemble of binary memoryless sources.

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.

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.

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.

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.

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.

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.

Comparison of rate one-half, equivalent constraint length 24, binary convolutional codes for use with sequential decoding on the deep-space channel

Science.gov (United States)

Massey, J. L.

1976-01-01

Virtually all previously-suggested rate 1/2 binary convolutional codes with KE = 24 are compared. Their distance properties are given; and their performance, both in computation and in error probability, with sequential decoding on the deep-space channel is determined by simulation. Recommendations are made both for the choice of a specific KE = 24 code as well as for codes to be included in future coding standards for the deep-space channel. A new result given in this report is a method for determining the statistical significance of error probability data when the error probability is so small that it is not feasible to perform enough decoding simulations to obtain more than a very small number of decoding errors.

Determination of recombination radius in Si for binary collision approximation codes

International Nuclear Information System (INIS)

Vizkelethy, Gyorgy; Foiles, Stephen M.

2016-01-01

Displacement damage caused by ions or neutrons in microelectronic devices can have significant effect on the performance of these devices. Therefore, it is important to predict not only the displacement damage profile, but also its magnitude precisely. Analytical methods and binary collision approximation codes working with amorphous targets use the concept of displacement energy, the energy that a lattice atom has to receive to create a permanent replacement. It was found that this “displacement energy” is direction dependent; it can range from 12 to 32 eV in silicon. Obviously, this model fails in BCA codes that work with crystalline targets, such as Marlowe. Marlowe does not use displacement energy; instead, it uses lattice binding energy only and then pairs the interstitial atoms with vacancies. Then based on the configuration of the Frenkel pairs it classifies them as close, near, or distant pairs, and considers the distant pairs the permanent replacements. Unfortunately, this separation is an ad hoc assumption, and the results do not agree with molecular dynamics calculations. After irradiation, there is a prompt recombination of interstitials and vacancies if they are nearby, within a recombination radius. In order to implement this recombination radius in Marlowe, we used the comparison of MD and Marlowe calculation in a range of ion energies in single crystal silicon target. The calculations showed that a single recombination radius of ∼7.4 Å in Marlowe for a range of ion energies gives an excellent agreement with MD.

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.

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.

Spike Code Flow in Cultured Neuronal Networks.

Science.gov (United States)

Tamura, Shinichi; Nishitani, Yoshi; Hosokawa, Chie; Miyoshi, Tomomitsu; Sawai, Hajime; Kamimura, Takuya; Yagi, Yasushi; Mizuno-Matsumoto, Yuko; Chen, Yen-Wei

2016-01-01

We observed spike trains produced by one-shot electrical stimulation with 8 × 8 multielectrodes in cultured neuronal networks. Each electrode accepted spikes from several neurons. We extracted the short codes from spike trains and obtained a code spectrum with a nominal time accuracy of 1%. We then constructed code flow maps as movies of the electrode array to observe the code flow of "1101" and "1011," which are typical pseudorandom sequence such as that we often encountered in a literature and our experiments. They seemed to flow from one electrode to the neighboring one and maintained their shape to some extent. To quantify the flow, we calculated the "maximum cross-correlations" among neighboring electrodes, to find the direction of maximum flow of the codes with lengths less than 8. Normalized maximum cross-correlations were almost constant irrespective of code. Furthermore, if the spike trains were shuffled in interval orders or in electrodes, they became significantly small. Thus, the analysis suggested that local codes of approximately constant shape propagated and conveyed information across the network. Hence, the codes can serve as visible and trackable marks of propagating spike waves as well as evaluating information flow in the neuronal network.

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.

LDGM Codes for Channel Coding and Joint Source-Channel Coding of Correlated Sources

Directory of Open Access Journals (Sweden)

Javier Garcia-Frias

2005-05-01

Full Text Available We propose a coding scheme based on the use of systematic linear codes with low-density generator matrix (LDGM codes for channel coding and joint source-channel coding of multiterminal correlated binary sources. In both cases, the structures of the LDGM encoder and decoder are shown, and a concatenated scheme aimed at reducing the error floor is proposed. Several decoding possibilities are investigated, compared, and evaluated. For different types of noisy channels and correlation models, the resulting performance is very close to the theoretical limits.

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.

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.

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.

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.

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

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

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...... 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.......For any nonzero elementcof a general finite fieldGF(q), it is shown that the polynomials(x - c)^i, i = 0,1,2,cdots, have the "weight-retaining" property that any linear combination of these polynomials with coefficients inGF(q)has Hamming weight at least as great as that of the minimum degree...

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

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...... be extended to channels with larger output alphabets. By increasing the output alphabet from hard decisions to four symbols, a gain of more than 1.0 dB is achieved using optimized codes. For this code optimization, the mixing property of EXIT functions has to be modified to the case of binary message......-passing decoders....

On Sequence Lengths of Some Special External Exclusive OR Type LFSR Structures – Study and Analysis

Directory of Open Access Journals (Sweden)

A Ahmad

2014-12-01

Full Text Available The study of the length of pseudo-random binary sequences generated by Linear- Feedback Shift Registers (LFSRs plays an important role in the design approaches of built-in selftest, cryptosystems, and other applications. However, certain LFSR structures might not be appropriate in some situations. Given that determining the length of generated pseudo-random binary sequence is a complex task, therefore, before using an LFSR structure, it is essential to investigate the length and the properties of the sequence. This paper investigates some conditions and LFSR’s structures, which restrict the pseudo-random binary sequences’ generation to a certain fixed length. The outcomes of this paper are presented in the form of theorems, simulations, and analyses. We believe that these outcomes are of great importance to the designers of built-in self-test equipment, cryptosystems, and other applications such as radar, CDMA, error correction, and Monte Carlo simulation.

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

Spike Code Flow in Cultured Neuronal Networks

Directory of Open Access Journals (Sweden)

Shinichi Tamura

2016-01-01

Full Text Available We observed spike trains produced by one-shot electrical stimulation with 8 × 8 multielectrodes in cultured neuronal networks. Each electrode accepted spikes from several neurons. We extracted the short codes from spike trains and obtained a code spectrum with a nominal time accuracy of 1%. We then constructed code flow maps as movies of the electrode array to observe the code flow of “1101” and “1011,” which are typical pseudorandom sequence such as that we often encountered in a literature and our experiments. They seemed to flow from one electrode to the neighboring one and maintained their shape to some extent. To quantify the flow, we calculated the “maximum cross-correlations” among neighboring electrodes, to find the direction of maximum flow of the codes with lengths less than 8. Normalized maximum cross-correlations were almost constant irrespective of code. Furthermore, if the spike trains were shuffled in interval orders or in electrodes, they became significantly small. Thus, the analysis suggested that local codes of approximately constant shape propagated and conveyed information across the network. Hence, the codes can serve as visible and trackable marks of propagating spike waves as well as evaluating information flow in the neuronal network.

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.

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.

MONTE CARLO SIMULATIONS OF GLOBULAR CLUSTER EVOLUTION. V. BINARY STELLAR EVOLUTION

International Nuclear Information System (INIS)

Chatterjee, Sourav; Umbreit, Stefan; Rasio, Frederic A.; Fregeau, John M.

2010-01-01

We study the dynamical evolution of globular clusters containing primordial binaries, including full single and binary stellar evolution using our Monte Carlo cluster evolution code updated with an adaptation of the single and binary stellar evolution codes SSE and BSE from Hurley et al. We describe the modifications that we have made to the code. We present several test calculations and comparisons with existing studies to illustrate the validity of the code. We show that our code finds very good agreement with direct N-body simulations including primordial binaries and stellar evolution. We find significant differences in the evolution of the global properties of the simulated clusters using stellar evolution compared with simulations without any stellar evolution. In particular, we find that the mass loss from the stellar evolution acts as a significant energy production channel simply by reducing the total gravitational binding energy and can significantly prolong the initial core contraction phase before reaching the binary-burning quasi-steady state of the cluster evolution. We simulate a large grid of models varying the initial cluster mass, binary fraction, and concentration parameter, and we compare properties of the simulated clusters with those of the observed Galactic globular clusters (GGCs). We find that simply including stellar evolution in our simulations and assuming the typical initial cluster half-mass radius is approximately a few pc independent of mass, our simulated cluster properties agree well with the observed GGC properties such as the core radius and the ratio of the core radius to the half-mass radius. We explore in some detail qualitatively different clusters in different phases of their evolution and construct synthetic Hertzsprung-Russell diagrams for these clusters.

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.

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.

DSIbin : Identifying dynamic data structures in C/C++ binaries

NARCIS (Netherlands)

Rupprecht, Thomas; Chen, Xi; White, David H.; Boockmann, Jan H.; Luttgen, Gerald; Bos, Herbert

2017-01-01

Reverse engineering binary code is notoriously difficult and, especially, understanding a binary's dynamic data structures. Existing data structure analyzers are limited wrt. program comprehension: they do not detect complex structures such as skip lists, or lists running through nodes of different

Protograph LDPC Codes Over Burst Erasure Channels

Science.gov (United States)

Divsalar, Dariush; Dolinar, Sam; Jones, Christopher

2006-01-01

In this paper we design high rate protograph based LDPC codes suitable for binary erasure channels. To simplify the encoder and decoder implementation for high data rate transmission, the structure of codes are based on protographs and circulants. These LDPC codes can improve data link and network layer protocols in support of communication networks. Two classes of codes were designed. One class is designed for large block sizes with an iterative decoding threshold that approaches capacity of binary erasure channels. The other class is designed for short block sizes based on maximizing minimum stopping set size. For high code rates and short blocks the second class outperforms the first class.

Computer simulation of displacement cascade damages in metals using binary collision approximation code 'MARLOWE'

International Nuclear Information System (INIS)

Watanabe, Nishio; Shimomura, Yoshiharu

1985-01-01

The derivation of basic equations of the computer simulation code 'MARLOWE' was examined in detail, which was treated by the binary collision approximation developed by Robinson and Torrens. The 'MARLOWE' program was used for the simulation of the three dimensional structure of displacement cascade damages of Au, Cu and Al, which were generated by primary knock-on atoms (PKA) of 1 keV to 40 keV. Results were seriously affected by the selection of parameter of Frenkel defect formation E disp and ion movement E quit with the close Frenkel defect recombination criteria and E disp = E quit , it was found that E disp of 11 eV, 5 eV, 5 eV are reasonable for the simulation calculation for Au, Cu, and Al, respectively. Cascade seems to have subcascade structures even for 40 keV PKA. (author)

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 10³. 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.

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.

Entropy Coding in HEVC

OpenAIRE

Sze, Vivienne; Marpe, Detlev

2014-01-01

Context-Based Adaptive Binary Arithmetic Coding (CABAC) is a method of entropy coding first introduced in H.264/AVC and now used in the latest High Efficiency Video Coding (HEVC) standard. While it provides high coding efficiency, the data dependencies in H.264/AVC CABAC make it challenging to parallelize and thus limit its throughput. Accordingly, during the standardization of entropy coding for HEVC, both aspects of coding efficiency and throughput were considered. This chapter describes th...

Non-binary unitary error bases and quantum codes

Energy Technology Data Exchange (ETDEWEB)

Knill, E.

1996-06-01

Error operator bases for systems of any dimension are defined and natural generalizations of the bit-flip/ sign-change error basis for qubits are given. These bases allow generalizing the construction of quantum codes based on eigenspaces of Abelian groups. As a consequence, quantum codes can be constructed form linear codes over {ital Z}{sub {ital n}} for any {ital n}. The generalization of the punctured code construction leads to many codes which permit transversal (i.e. fault tolerant) implementations of certain operations compatible with the error basis.

Lensless digital holography with diffuse illumination through a pseudo-random phase mask.

Science.gov (United States)

Bernet, Stefan; Harm, Walter; Jesacher, Alexander; Ritsch-Marte, Monika

2011-12-05

Microscopic imaging with a setup consisting of a pseudo-random phase mask, and an open CMOS camera, without an imaging objective, is demonstrated. The pseudo random phase mask acts as a diffuser for an incoming laser beam, scattering a speckle pattern to a CMOS chip, which is recorded once as a reference. A sample which is afterwards inserted somewhere in the optical beam path changes the speckle pattern. A single (non-iterative) image processing step, comparing the modified speckle pattern with the previously recorded one, generates a sharp image of the sample. After a first calibration the method works in real-time and allows quantitative imaging of complex (amplitude and phase) samples in an extended three-dimensional volume. Since no lenses are used, the method is free from lens abberations. Compared to standard inline holography the diffuse sample illumination improves the axial sectioning capability by increasing the effective numerical aperture in the illumination path, and it suppresses the undesired so-called twin images. For demonstration, a high resolution spatial light modulator (SLM) is programmed to act as the pseudo-random phase mask. We show experimental results, imaging microscopic biological samples, e.g. insects, within an extended volume at a distance of 15 cm with a transverse and longitudinal resolution of about 60 μm and 400 μm, respectively.

The Jeans Condition and Collapsing Molecular Cloud Cores: Filaments or Binaries?

International Nuclear Information System (INIS)

Boss, Alan P.; Fisher, Robert T.; Klein, Richard I.; McKee, Christopher F.

2000-01-01

The 1997 and 1998 studies by Truelove and colleagues introduced the Jeans condition as a necessary condition for avoiding artificial fragmentation during protostellar collapse calculations. They found that when the Jeans condition was properly satisfied with their adaptive mesh refinement (AMR) code, an isothermal cloud with an initial Gaussian density profile collapsed to form a thin filament rather than the binary or quadruple protostar systems found in previous calculations. Using a completely different self-gravitational hydrodynamics code introduced by Boss and Myhill in 1992 (B and M), we present here calculations that reproduce the filamentary solution first obtained by Truelove et al. in 1997. The filamentary solution only emerged with very high spatial resolution with the B and M code, with effectively 12,500 radial grid points (R12500). Reproducing the filamentary collapse solution appears to be an excellent means for testing the reliability of self-gravitational hydrodynamics codes, whether grid-based or particle-based. We then show that in the more physically realistic case of an identical initial cloud with nonisothermal heating (calculated in the Eddington approximation with code B and M), thermal retardation of the collapse permits the Gaussian cloud to fragment into a binary protostar system at the same maximum density where the isothermal collapse yields a thin filament. However, the binary clumps soon thereafter evolve into a central clump surrounded by spiral arms containing two more clumps. A roughly similar evolution is obtained using the AMR code with a barotropic equation of state--formation of a transient binary, followed by decay of the binary to form a central object surrounded by spiral arms, though in this case the spiral arms do not form clumps. When the same barotropic equation of state is used with the B and M code, the agreement with the initial phases of the AMR calculation is quite good, showing that these two codes yield mutually

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

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...... strategies for improving the reliability of the decoded result are analyzed, and methods for estimating the performance are proposed. In the analysis, noiseless feedback and noiseless communication are assumed. Simulation results show that rate-adaptive BCH codes achieve better performance than low...... 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...

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.

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

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.

Network Coding Over The 232

DEFF Research Database (Denmark)

Pedersen, Morten Videbæk; Heide, Janus; Vingelmann, Peter

2013-01-01

Creating efficient finite field implementations has been an active research topic for several decades. Many appli- cations in areas such as cryptography, signal processing, erasure coding and now also network coding depend on this research to deliver satisfactory performance. In this paper we...... from a benchmark application written in C++. These results are finally compared to different binary and binary extension field implementations. The results show that the prime field implementation offers a large field size while maintaining a very good performance. We believe that using prime fields...

Hiding a Covert Digital Image by Assembling the RSA Encryption Method and the Binary Encoding Method

Directory of Open Access Journals (Sweden)

Kuang Tsan Lin

2014-01-01

Full Text Available The Rivest-Shamir-Adleman (RSA encryption method and the binary encoding method are assembled to form a hybrid hiding method to hide a covert digital image into a dot-matrix holographic image. First, the RSA encryption method is used to transform the covert image to form a RSA encryption data string. Then, all the elements of the RSA encryption data string are transferred into binary data. Finally, the binary data are encoded into the dot-matrix holographic image. The pixels of the dot-matrix holographic image contain seven groups of codes used for reconstructing the covert image. The seven groups of codes are identification codes, covert-image dimension codes, covert-image graylevel codes, pre-RSA bit number codes, RSA key codes, post-RSA bit number codes, and information codes. The reconstructed covert image derived from the dot-matrix holographic image and the original covert image are exactly the same.

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,…

Cognitive Architecture for Direction of Attention Founded on Subliminal Memory Searches, Pseudorandom and Nonstop

OpenAIRE

Burger, J. R.

2008-01-01

By way of explaining how a brain works logically, human associative memory is modeled with logical and memory neurons, corresponding to standard digital circuits. The resulting cognitive architecture incorporates basic psychological elements such as short term and long term memory. Novel to the architecture are memory searches using cues chosen pseudorandomly from short term memory. Recalls alternated with sensory images, many tens per second, are analyzed subliminally as an ongoing process, ...

Optimized Min-Sum Decoding Algorithm for Low Density Parity Check Codes

OpenAIRE

Mohammad Rakibul Islam; Dewan Siam Shafiullah; Muhammad Mostafa Amir Faisal; Imran Rahman

2011-01-01

Low Density Parity Check (LDPC) code approaches Shannon–limit performance for binary field and long code lengths. However, performance of binary LDPC code is degraded when the code word length is small. An optimized min-sum algorithm for LDPC code is proposed in this paper. In this algorithm unlike other decoding methods, an optimization factor has been introduced in both check node and bit node of the Min-sum algorithm. The optimization factor is obtained before decoding program, and the sam...

Rapid Acquisition of Choice and Timing and the Provenance of the Terminal-Link Effect

Science.gov (United States)

Kyonka, Elizabeth G. E.; Grace, Randolph C.

2010-01-01

Eight pigeons responded in a concurrent-chains procedure in which terminal-link schedules changed pseudorandomly across sessions. Pairs of terminal-link delays either summed to 15 s or to 45 s. Across sessions, the location of the shorter terminal link changed according to a pseudorandom binary sequence. On some terminal links, food was withheld…

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.

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...... message-passing decoders. Finally, it is shown that errors on cycles consisting only of degree two and three variable nodes cannot be corrected and a necessary and sufficient condition for the existence of a cycle-free subgraph is derived....... in the well-know Gallager B algorithm, and increasing the output alphabet from hard decisions to two bits yields a gain of more than 1.0 dB in the required signal to noise ratio when using optimized codes. The code optimization requires adapting the mixing property of EXIT functions to the case of binary...

Z₂-double cyclic codes

OpenAIRE

Borges, J.

2014-01-01

A binary linear code C is a Z2-double cyclic code if the set of coordinates can be partitioned into two subsets such that any cyclic shift of the coordinates of both subsets leaves invariant the code. These codes can be identified as submodules of the Z2[x]-module Z2[x]/(x^r − 1) × Z2[x]/(x^s − 1). We determine the structure of Z2-double cyclic codes giving the generator polynomials of these codes. The related polynomial representation of Z2-double cyclic codes and its duals, and the relation...

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.

Constructing binary black hole initial data with high mass ratios and spins

Science.gov (United States)

Ossokine, Serguei; Foucart, Francois; Pfeiffer, Harald; Szilagyi, Bela; Simulating Extreme Spacetimes Collaboration

2015-04-01

Binary black hole systems have now been successfully modelled in full numerical relativity by many groups. In order to explore high-mass-ratio (larger than 1:10), high-spin systems (above 0.9 of the maximal BH spin), we revisit the initial-data problem for binary black holes. The initial-data solver in the Spectral Einstein Code (SpEC) was not able to solve for such initial data reliably and robustly. I will present recent improvements to this solver, among them adaptive mesh refinement and control of motion of the center of mass of the binary, and will discuss the much larger region of parameter space this code can now address.

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.

Essential idempotents and simplex codes

Directory of Open Access Journals (Sweden)

Gladys Chalom

2017-01-01

Full Text Available We define essential idempotents in group algebras and use them to prove that every mininmal abelian non-cyclic code is a repetition code. Also we use them to prove that every minimal abelian code is equivalent to a minimal cyclic code of the same length. Finally, we show that a binary cyclic code is simplex if and only if is of length of the form $n=2^k-1$ and is generated by an essential idempotent.

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

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.

High-speed architecture for the decoding of trellis-coded modulation

Science.gov (United States)

Osborne, William P.

1992-01-01

Since 1971, when the Viterbi Algorithm was introduced as the optimal method of decoding convolutional codes, improvements in circuit technology, especially VLSI, have steadily increased its speed and practicality. Trellis-Coded Modulation (TCM) combines convolutional coding with higher level modulation (non-binary source alphabet) to provide forward error correction and spectral efficiency. For binary codes, the current stare-of-the-art is a 64-state Viterbi decoder on a single CMOS chip, operating at a data rate of 25 Mbps. Recently, there has been an interest in increasing the speed of the Viterbi Algorithm by improving the decoder architecture, or by reducing the algorithm itself. Designs employing new architectural techniques are now in existence, however these techniques are currently applied to simpler binary codes, not to TCM. The purpose of this report is to discuss TCM architectural considerations in general, and to present the design, at the logic gate level, or a specific TCM decoder which applies these considerations to achieve high-speed decoding.

Typical performance of regular low-density parity-check codes over general symmetric channels

Energy Technology Data Exchange (ETDEWEB)

Tanaka, Toshiyuki [Department of Electronics and Information Engineering, Tokyo Metropolitan University, 1-1 Minami-Osawa, Hachioji-shi, Tokyo 192-0397 (Japan); Saad, David [Neural Computing Research Group, Aston University, Aston Triangle, Birmingham B4 7ET (United Kingdom)

2003-10-31

Typical performance of low-density parity-check (LDPC) codes over a general binary-input output-symmetric memoryless channel is investigated using methods of statistical mechanics. Relationship between the free energy in statistical-mechanics approach and the mutual information used in the information-theory literature is established within a general framework; Gallager and MacKay-Neal codes are studied as specific examples of LDPC codes. It is shown that basic properties of these codes known for particular channels, including their potential to saturate Shannon's bound, hold for general symmetric channels. The binary-input additive-white-Gaussian-noise channel and the binary-input Laplace channel are considered as specific channel models.

Typical performance of regular low-density parity-check codes over general symmetric channels

International Nuclear Information System (INIS)

Tanaka, Toshiyuki; Saad, David

2003-01-01

Typical performance of low-density parity-check (LDPC) codes over a general binary-input output-symmetric memoryless channel is investigated using methods of statistical mechanics. Relationship between the free energy in statistical-mechanics approach and the mutual information used in the information-theory literature is established within a general framework; Gallager and MacKay-Neal codes are studied as specific examples of LDPC codes. It is shown that basic properties of these codes known for particular channels, including their potential to saturate Shannon's bound, hold for general symmetric channels. The binary-input additive-white-Gaussian-noise channel and the binary-input Laplace channel are considered as specific channel models

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.

Rate-adaptive BCH coding for Slepian-Wolf coding of highly correlated sources

DEFF Research Database (Denmark)

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

2012-01-01

This paper considers using BCH codes for distributed source coding using feedback. The focus is on coding using short block lengths for a binary source, X, having a high correlation between each symbol to be coded and a side information, Y, such that the marginal probability of each symbol, Xi in X......, given Y is highly skewed. In the analysis, noiseless feedback and noiseless communication are assumed. A rate-adaptive BCH code is presented and applied to distributed source coding. Simulation results for a fixed error probability show that rate-adaptive BCH achieves better performance than LDPCA (Low......-Density Parity-Check Accumulate) codes for high correlation between source symbols and the side information....

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.

Low power laser generated ultrasound: Signal processing for time domain data acquisition

International Nuclear Information System (INIS)

Cleary, A; Thursby, G; McKee, C; Armstrong, I; Culshaw, B; Veres, I; Pierce, S G

2011-01-01

The use of low power modulated laser diode systems has previously been established as a suitable method for non-destructive laser generation of ultrasound. Using a quasi-continuous optical excitation amplified by an erbium-doped fibre amplifier (EDFA) allows flexible generation of ultrasonic waves, offering control of further parameters such as the frequency content or signal shape. In addition, pseudo-random binary sequences (PRBS) can be used to improve the detected impulse response. Here we compare two sequences, the m-sequence and the Golay code, and discuss the advantages and practical limits of their application with laser diode based optical excitation of ultrasound.

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.

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

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

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)

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.

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.

Thermal-hydraulic study of fixed bed nuclear reactor (FBNR), in FCC, BCC and pseudo-random configurations of the core through CFD method

International Nuclear Information System (INIS)

Luna, M.; Chavez, I.; Cajas, D.; Santos, R.

2015-01-01

The study of thermal-hydraulic performance of a fixed bed nuclear reactor (FBNR) core and the effect of the porosity was studied by the CFD method with 'SolidWorks' software. The representative sections of three different packed beds arrangements were analyzed: face-centered cubic (FCC), body-centered cubic (BCC), and a pseudo-random, with values of porosity of 0.28, 0.33 and 0.53 respectively. The minimum coolant flow required to avoid the phase change for each one of the configurations was determined. The results show that the heat transfer rate increases when the porosity value decreases, and consequently the minimum coolant flow in each configuration. The results of minimum coolant flow were: 728.51 kg/s for the FCC structure, 372.72 kg/s for the BCC, and 304.96 kg/s for the pseudo-random. Meanwhile, the heat transfer coefficients in each packed bed were 6480 W/m 2 *K, 3718 W/m 2 *K and 3042 W/m 2 *K respectively. Finally the pressure drop was calculated, and the results were 0.588 MPa for FCC configuration, 0.033 MPa for BCC and 0.017 MPa for the pseudo-random one. This means that with a higher porosity, the fluid can circulate easier because there are fewer obstacles to cross, so there are fewer energy losses. (authors)

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.

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.

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.

Ripple Design of LT Codes for BIAWGN Channels

DEFF Research Database (Denmark)

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

2014-01-01

This paper presents a novel framework, which enables a design of rateless codes for binary input additive white Gaussian noise (BIAWGN) channels, using the ripple-based approach known from the works for the binary erasure channel (BEC). We reveal that several aspects of the analytical results from...

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.

COSMIC probes into compact binary formation and evolution

Science.gov (United States)

Breivik, Katelyn

2018-01-01

The population of compact binaries in the galaxy represents the final state of all binaries that have lived up to the present epoch. Compact binaries present a unique opportunity to probe binary evolution since many of the interactions binaries experience can be imprinted on the compact binary population. By combining binary evolution simulations with catalogs of observable compact binary systems, we can distill the dominant physical processes that govern binary star evolution, as well as predict the abundance and variety of their end products.The next decades herald a previously unseen opportunity to study compact binaries. Multi-messenger observations from telescopes across all wavelengths and gravitational-wave observatories spanning several decades of frequency will give an unprecedented view into the structure of these systems and the composition of their components. Observations will not always be coincident and in some cases may be separated by several years, providing an avenue for simulations to better constrain binary evolution models in preparation for future observations.I will present the results of three population synthesis studies of compact binary populations carried out with the Compact Object Synthesis and Monte Carlo Investigation Code (COSMIC). I will first show how binary-black-hole formation channels can be understood with LISA observations. I will then show how the population of double white dwarfs observed with LISA and Gaia could provide a detailed view of mass transfer and accretion. Finally, I will show that Gaia could discover thousands black holes in the Milky Way through astrometric observations, yielding view into black-hole astrophysics that is complementary to and independent from both X-ray and gravitational-wave astronomy.

Comparison of many bodied and binary collision cascade models up to 1 keV

International Nuclear Information System (INIS)

Schwartz, D.M.; Schiffgens, J.D.; Doran, D.G.; Odette, G.R.; Ariyasu, R.G.

1976-01-01

A quasi-dynamical code ADDES has been developed to model displacement cascades in copper for primary knockon atom energies up to several keV. ADDES is like a dynamical code in that it employs a many body treatment, yet similar to a binary collision code in that it incorporates the basic assumption that energy transfers below several eV can be ignored in describing cascade evolution. This paper is primarily concerned with (1) a continuing effort to validate the assumptions and specific parameters in the code by the comparison of ADDES results with experiment and with results from a dynamical code, and (2) comparisons of ADDES results with those from a binary collision code. The directional dependence of the displacement threshold is in reasonable agreement with the measurements of Jung et al. The behavior of focused replacement sequences is very similar to that obtained with the dynamical codes GRAPE and COMENT. Qualitative agreement was found between ADDES and COMENT for a higher energy (500 eV) defocused event while differences, still under study, are apparent in a 250 eV high index event. Comparisons of ADDES with the binary collision code MARLOWE show surprisingly good agreement in the 250 to 1000 eV range for both number and separation of Frenkel pairs. A preliminary observation, perhaps significant to displacement calculations utilizing the concept of a mean displacement energy, is the dissipation of 300 to 400 eV in a replacement sequence producing a single interstitial

Huffman coding in advanced audio coding standard

Science.gov (United States)

Brzuchalski, Grzegorz

2012-05-01

This article presents several hardware architectures of Advanced Audio Coding (AAC) Huffman noiseless encoder, its optimisations and working implementation. Much attention has been paid to optimise the demand of hardware resources especially memory size. The aim of design was to get as short binary stream as possible in this standard. The Huffman encoder with whole audio-video system has been implemented in FPGA devices.

Theory of epigenetic coding.

Science.gov (United States)

Elder, D

1984-06-07

The logic of genetic control of development may be based on a binary epigenetic code. This paper revises the author's previous scheme dealing with the numerology of annelid metamerism in these terms. Certain features of the code had been deduced to be combinatorial, others not. This paradoxical contrast is resolved here by the interpretation that these features relate to different operations of the code; the combinatiorial to coding identity of units, the non-combinatorial to coding production of units. Consideration of a second paradox in the theory of epigenetic coding leads to a new solution which further provides a basis for epimorphic regeneration, and may in particular throw light on the "regeneration-duplication" phenomenon. A possible test of the model is also put forward.

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.

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

DNA Barcoding through Quaternary LDPC Codes.

Science.gov (United States)

Tapia, Elizabeth; Spetale, Flavio; Krsticevic, Flavia; Angelone, Laura; Bulacio, Pilar

2015-01-01

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

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.

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.

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.

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.

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)

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.

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.

Context quantization by minimum adaptive code length

DEFF Research Database (Denmark)

Forchhammer, Søren; Wu, Xiaolin

2007-01-01

Context quantization is a technique to deal with the issue of context dilution in high-order conditional entropy coding. We investigate the problem of context quantizer design under the criterion of minimum adaptive code length. A property of such context quantizers is derived for binary symbols....

Syntactic Parameters and a Coding Theory Perspective on Entropy and Complexity of Language Families

Directory of Open Access Journals (Sweden)

Matilde Marcolli

2016-04-01

Full Text Available We present a simple computational approach to assigning a measure of complexity and information/entropy to families of natural languages, based on syntactic parameters and the theory of error correcting codes. We associate to each language a binary string of syntactic parameters and to a language family a binary code, with code words the binary string associated to each language. We then evaluate the code parameters (rate and relative minimum distance and the position of the parameters with respect to the asymptotic bound of error correcting codes and the Gilbert–Varshamov bound. These bounds are, respectively, related to the Kolmogorov complexity and the Shannon entropy of the code and this gives us a computationally simple way to obtain estimates on the complexity and information, not of individual languages but of language families. This notion of complexity is related, from the linguistic point of view to the degree of variability of syntactic parameter across languages belonging to the same (historical family.

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…

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

Golay sequences coded coherent optical OFDM for long-haul transmission

Science.gov (United States)

Qin, Cui; Ma, Xiangrong; Hua, Tao; Zhao, Jing; Yu, Huilong; Zhang, Jian

2017-09-01

We propose to use binary Golay sequences in coherent optical orthogonal frequency division multiplexing (CO-OFDM) to improve the long-haul transmission performance. The Golay sequences are generated by binary Reed-Muller codes, which have low peak-to-average power ratio and certain error correction capability. A low-complexity decoding algorithm for the Golay sequences is then proposed to recover the signal. Under same spectral efficiency, the QPSK modulated OFDM with binary Golay sequences coding with and without discrete Fourier transform (DFT) spreading (DFTS-QPSK-GOFDM and QPSK-GOFDM) are compared with the normal BPSK modulated OFDM with and without DFT spreading (DFTS-BPSK-OFDM and BPSK-OFDM) after long-haul transmission. At a 7% forward error correction code threshold (Q2 factor of 8.5 dB), it is shown that DFTS-QPSK-GOFDM outperforms DFTS-BPSK-OFDM by extending the transmission distance by 29% and 18%, in non-dispersion managed and dispersion managed links, respectively.

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)

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

Relativistic (3+1) dimensional hydrodynamic simulations of compact interacting binary systems

International Nuclear Information System (INIS)

Mathews, G.J.; Evans, C.R.; Wilson, J.R.

1986-09-01

We discuss the development of a relativistic hydrodynamic code for describing the evolution of astrophysical systems in three spatial dimensions. The application of this code to several test problems is presented. Preliminary results from the simulation of the dynamics of accreting binary white dwarf and neutron star systems are discussed. 14 refs., 4 figs

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.

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-06-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 BPASS (Binary Population and Spectral Synthesis) 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 Wolf-Rayet 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.

Finger Vein Recognition Based on Local Directional Code

Science.gov (United States)

Meng, Xianjing; Yang, Gongping; Yin, Yilong; Xiao, Rongyang

2012-01-01

Finger vein patterns are considered as one of the most promising biometric authentication methods for its security and convenience. Most of the current available finger vein recognition methods utilize features from a segmented blood vessel network. As an improperly segmented network may degrade the recognition accuracy, binary pattern based methods are proposed, such as Local Binary Pattern (LBP), Local Derivative Pattern (LDP) and Local Line Binary Pattern (LLBP). However, the rich directional information hidden in the finger vein pattern has not been fully exploited by the existing local patterns. Inspired by the Webber Local Descriptor (WLD), this paper represents a new direction based local descriptor called Local Directional Code (LDC) and applies it to finger vein recognition. In LDC, the local gradient orientation information is coded as an octonary decimal number. Experimental results show that the proposed method using LDC achieves better performance than methods using LLBP. PMID:23202194

Finger Vein Recognition Based on Local Directional Code

Directory of Open Access Journals (Sweden)

Rongyang Xiao

2012-11-01

Full Text Available Finger vein patterns are considered as one of the most promising biometric authentication methods for its security and convenience. Most of the current available finger vein recognition methods utilize features from a segmented blood vessel network. As an improperly segmented network may degrade the recognition accuracy, binary pattern based methods are proposed, such as Local Binary Pattern (LBP, Local Derivative Pattern (LDP and Local Line Binary Pattern (LLBP. However, the rich directional information hidden in the finger vein pattern has not been fully exploited by the existing local patterns. Inspired by the Webber Local Descriptor (WLD, this paper represents a new direction based local descriptor called Local Directional Code (LDC and applies it to finger vein recognition. In LDC, the local gradient orientation information is coded as an octonary decimal number. Experimental results show that the proposed method using LDC achieves better performance than methods using LLBP.

Context-based coding of bilevel images enhanced by digital straight line analysis

DEFF Research Database (Denmark)

Aghito, Shankar Manuel; Forchhammer, Søren

2006-01-01

, or segmentation maps are also encoded efficiently. The algorithm is not targeted at document images with text, which can be coded efficiently with dictionary-based techniques as in JBIG2. 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. Tested on individual images of standard TV resolution binary shapes and the binary layers of a digital map, the proposed algorithm outperforms PWC, JBIG, JBIG2, and MPEG-4 CAE. On the binary shapes, the code lengths are reduced by 21%, 27 %, 28 %, and 41...

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

Quantum steganography with a large payload based on dense coding and entanglement swapping of Greenberger—Horne—Zeilinger states

International Nuclear Information System (INIS)

Ye Tian-Yu; Jiang Li-Zhen

2013-01-01

A quantum steganography protocol with a large payload is proposed based on the dense coding and the entanglement swapping of the Greenberger—Horne—Zeilinger (GHZ) states. Its super quantum channel is formed by building up a hidden channel within the original quantum secure direct communication (QSDC) scheme. Based on the original QSDC, secret messages are transmitted by integrating the dense coding and the entanglement swapping of the GHZ states. The capacity of the super quantum channel achieves six bits per round covert communication, much higher than the previous quantum steganography protocols. Its imperceptibility is good, since the information and the secret messages can be regarded to be random or pseudo-random. Moreover, its security is proved to be reliable. (general)

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

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

KAUST Repository

Radwan, Ahmed Gomaa; Mansingka, Abhinav S.; Salama, Khaled N.; Zidan, Mohammed A.

2014-01-01

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

Decoding Codes on Graphs

Indian Academy of Sciences (India)

having a probability Pi of being equal to a 1. Let us assume ... equal to a 0/1 has no bearing on the probability of the. It is often ... bits (call this set S) whose individual bits add up to zero ... In the context of binary error-correct~ng codes, specifi-.

Topology of black hole binary-single interactions

Science.gov (United States)

Samsing, Johan; Ilan, Teva

2018-05-01

We present a study on how the outcomes of binary-single interactions involving three black holes (BHs) distribute as a function of the initial conditions; a distribution we refer to as the topology. Using a N-body code that includes BH finite sizes and gravitational wave (GW) emission in the equation of motion (EOM), we perform more than a million binary-single interactions to explore the topology of both the Newtonian limit and the limit at which general relativistic (GR) effects start to become important. From these interactions, we are able to describe exactly under which conditions BH collisions and eccentric GW capture mergers form, as well as how GR in general modifies the Newtonian topology. This study is performed on both large- and microtopological scales. We further describe how the inclusion of GW emission in the EOM naturally leads to scenarios where the binary-single system undergoes two successive GW mergers.

A cubic map chaos criterion theorem with applications in generalized synchronization based pseudorandom number generator and image encryption.

Science.gov (United States)

Yang, Xiuping; Min, Lequan; Wang, Xue

2015-05-01

This paper sets up a chaos criterion theorem on a kind of cubic polynomial discrete maps. Using this theorem, Zhou-Song's chaos criterion theorem on quadratic polynomial discrete maps and generalized synchronization (GS) theorem construct an eight-dimensional chaotic GS system. Numerical simulations have been carried out to verify the effectiveness of theoretical results. The chaotic GS system is used to design a chaos-based pseudorandom number generator (CPRNG). Using FIPS 140-2 test suit/Generalized FIPS 140-2, test suit tests the randomness of two 1000 key streams consisting of 20 000 bits generated by the CPRNG, respectively. The results show that there are 99.9%/98.5% key streams to have passed the FIPS 140-2 test suit/Generalized FIPS 140-2 test. Numerical simulations show that the different keystreams have an average 50.001% same codes. The key space of the CPRNG is larger than 2(1345). As an application of the CPRNG, this study gives an image encryption example. Experimental results show that the linear coefficients between the plaintext and the ciphertext and the decrypted ciphertexts via the 100 key streams with perturbed keys are less than 0.00428. The result suggests that the decrypted texts via the keystreams generated via perturbed keys of the CPRNG are almost completely independent on the original image text, and brute attacks are needed to break the cryptographic system.

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

Code compression for VLIW embedded processors

Science.gov (United States)

Piccinelli, Emiliano; Sannino, Roberto

2004-04-01

The implementation of processors for embedded systems implies various issues: main constraints are cost, power dissipation and die area. On the other side, new terminals perform functions that require more computational flexibility and effort. Long code streams must be loaded into memories, which are expensive and power consuming, to run on DSPs or CPUs. To overcome this issue, the "SlimCode" proprietary algorithm presented in this paper (patent pending technology) can reduce the dimensions of the program memory. It can run offline and work directly on the binary code the compiler generates, by compressing it and creating a new binary file, about 40% smaller than the original one, to be loaded into the program memory of the processor. The decompression unit will be a small ASIC, placed between the Memory Controller and the System bus of the processor, keeping unchanged the internal CPU architecture: this implies that the methodology is completely transparent to the core. We present comparisons versus the state-of-the-art IBM Codepack algorithm, along with its architectural implementation into the ST200 VLIW family core.

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.

An Efficient Platform for the Automatic Extraction of Patterns in Native Code

Directory of Open Access Journals (Sweden)

Javier Escalada

2017-01-01

Full Text Available Different software tools, such as decompilers, code quality analyzers, recognizers of packed executable files, authorship analyzers, and malware detectors, search for patterns in binary code. The use of machine learning algorithms, trained with programs taken from the huge number of applications in the existing open source code repositories, allows finding patterns not detected with the manual approach. To this end, we have created a versatile platform for the automatic extraction of patterns from native code, capable of processing big binary files. Its implementation has been parallelized, providing important runtime performance benefits for multicore architectures. Compared to the single-processor execution, the average performance improvement obtained with the best configuration is 3.5 factors over the maximum theoretical gain of 4 factors.

Memory Vulnerability Diagnosis for Binary Program

Directory of Open Access Journals (Sweden)

Tang Feng-Yi

2016-01-01

Full Text Available Vulnerability diagnosis is important for program security analysis. It is a further step to understand the vulnerability after it is detected, as well as a preparatory step for vulnerability repair or exploitation. This paper mainly analyses the inner theories of major memory vulnerabilities and the threats of them. And then suggests some methods to diagnose several types of memory vulnerabilities for the binary programs, which is a difficult task due to the lack of source code. The diagnosis methods target at buffer overflow, use after free (UAF and format string vulnerabilities. We carried out some tests on the Linux platform to validate the effectiveness of the diagnosis methods. It is proved that the methods can judge the type of the vulnerability given a binary program.

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

International Nuclear Information System (INIS)

Li, Yang; Chen, Xingfan; Liu, Cheng

2015-01-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. (paper)

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.

LDPC coded OFDM over the atmospheric turbulence channel.

Science.gov (United States)

Djordjevic, Ivan B; Vasic, Bane; Neifeld, Mark A

2007-05-14

Low-density parity-check (LDPC) coded optical orthogonal frequency division multiplexing (OFDM) is shown to significantly outperform LDPC coded on-off keying (OOK) over the atmospheric turbulence channel in terms of both coding gain and spectral efficiency. In the regime of strong turbulence at a bit-error rate of 10(-5), the coding gain improvement of the LDPC coded single-side band unclipped-OFDM system with 64 sub-carriers is larger than the coding gain of the LDPC coded OOK system by 20.2 dB for quadrature-phase-shift keying (QPSK) and by 23.4 dB for binary-phase-shift keying (BPSK).

Specialized Binary Analysis for Vetting Android APPS Using GUI Logic

Science.gov (United States)

2016-04-01

user expectation of what the app is doing. These techniques enable security analysts to quickly vet any given Android app even if the source code is...Malware Detection for Android applications, Binary Analysis 16. SECURITY CLASSIFICATION OF: 17. LIMITATION OF ABSTRACT SAR 18. NUMBER OF PAGES 19a...of what the app is doing. These techniques enable security analysts to quickly vet any given Android app even if the source code is unavailable. These

Coding/modulation trade-offs for Shuttle wideband data links

Science.gov (United States)

Batson, B. H.; Huth, G. K.; Trumpis, B. D.

1974-01-01

This paper describes various modulation and coding schemes which are potentially applicable to the Shuttle wideband data relay communications link. This link will be capable of accommodating up to 50 Mbps of scientific data and will be subject to a power constraint which forces the use of channel coding. Although convolutionally encoded coherent binary PSK is the tentative signal design choice for the wideband data relay link, FM techniques are of interest because of the associated hardware simplicity and because an FM system is already planned to be available for transmission of television via relay satellite to the ground. Binary and M-ary FSK are considered as candidate modulation techniques, and both coherent and noncoherent ground station detection schemes are examined. The potential use of convolutional coding is considered in conjunction with each of the candidate modulation techniques.

Interacting binaries

International Nuclear Information System (INIS)

Eggleton, P.P.; Pringle, J.E.

1985-01-01

This volume contains 15 review articles in the field of binary stars. The subjects reviewed span considerably, from the shortest period of interacting binaries to the longest, symbiotic stars. Also included are articles on Algols, X-ray binaries and Wolf-Rayet stars (single and binary). Contents: Preface. List of Participants. Activity of Contact Binary Systems. Wolf-Rayet Stars and Binarity. Symbiotic Stars. Massive X-ray Binaries. Stars that go Hump in the Night: The SU UMa Stars. Interacting Binaries - Summing Up

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.

Accuracy of Binary Black Hole Waveform Models for Advanced LIGO

Science.gov (United States)

Kumar, Prayush; Fong, Heather; Barkett, Kevin; Bhagwat, Swetha; Afshari, Nousha; Chu, Tony; Brown, Duncan; Lovelace, Geoffrey; Pfeiffer, Harald; Scheel, Mark; Szilagyi, Bela; Simulating Extreme Spacetimes (SXS) Team

2016-03-01

Coalescing binaries of compact objects, such as black holes and neutron stars, are the primary targets for gravitational-wave (GW) detection with Advanced LIGO. Accurate modeling of the emitted GWs is required to extract information about the binary source. The most accurate solution to the general relativistic two-body problem is available in numerical relativity (NR), which is however limited in application due to computational cost. Current searches use semi-analytic models that are based in post-Newtonian (PN) theory and calibrated to NR. In this talk, I will present comparisons between contemporary models and high-accuracy numerical simulations performed using the Spectral Einstein Code (SpEC), focusing at the questions: (i) How well do models capture binary's late-inspiral where they lack a-priori accurate information from PN or NR, and (ii) How accurately do they model binaries with parameters outside their range of calibration. These results guide the choice of templates for future GW searches, and motivate future modeling efforts.

The True Ultracool Binary Fraction Using Spectral Binaries

Science.gov (United States)

Bardalez Gagliuffi, Daniella; Burgasser, Adam J.; Schmidt, Sarah J.; Gagné, Jonathan; Faherty, Jacqueline K.; Cruz, Kelle; Gelino, Chris

2018-01-01

Brown dwarfs bridge the gap between stars and giant planets. While the essential mechanisms governing their formation are not well constrained, binary statistics are a direct outcome of the formation process, and thus provide a means to test formation theories. Observational constraints on the brown dwarf binary fraction place it at 10 ‑ 20%, dominated by imaging studies (85% of systems) with the most common separation at 4 AU. This coincides with the resolution limit of state-of-the-art imaging techniques, suggesting that the binary fraction is underestimated. We have developed a separation-independent method to identify and characterize tightly-separated (dwarfs as spectral binaries by identifying traces of methane in the spectra of late-M and early-L dwarfs. Imaging follow-up of 17 spectral binaries yielded 3 (18%) resolved systems, corroborating the observed binary fraction, but 5 (29%) known binaries were missed, reinforcing the hypothesis that the short-separation systems are undercounted. In order to find the true binary fraction of brown dwarfs, we have compiled a volume-limited, spectroscopic sample of M7-L5 dwarfs and searched for T dwarf companions. In the 25 pc volume, 4 candidates were found, three of which are already confirmed, leading to a spectral binary fraction of 0.95 ± 0.50%, albeit for a specific combination of spectral types. To extract the true binary fraction and determine the biases of the spectral binary method, we have produced a binary population simulation based on different assumptions of the mass function, age distribution, evolutionary models and mass ratio distribution. Applying the correction fraction resulting from this method to the observed spectral binary fraction yields a true binary fraction of 27 ± 4%, which is roughly within 1σ of the binary fraction obtained from high resolution imaging studies, radial velocity and astrometric monitoring. This method can be extended to identify giant planet companions to young brown

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

Corrections for frequency domain transformations of Winfrith binary cross correlator responses

International Nuclear Information System (INIS)

Cummins, J.D.

1968-04-01

This report considers the corrections for frequency domain transformations of Winfrith binary cross correlator responses; (i) for the finite bandwidth of the equivalent input signal; (2) for the finite time required for the actuator to move between the two positions appropriate to the two levels of the periodic binary chain code input and (3) for the averaging of experimental determinations of the system frequency response and calculations of the standard deviations of the modulus and phase of the frequency responses determined from the cross correlator responses. (author)

Efficient Coding of Shape and Transparency for Video Objects

DEFF Research Database (Denmark)

Aghito, Shankar Manuel; Forchhammer, Søren

2007-01-01

A novel scheme for coding gray-level alpha planes in object-based video is presented. Gray-level alpha planes convey the shape and the transparency information, which are required for smooth composition of video objects. The algorithm proposed is based on the segmentation of the alpha plane...... in three layers: binary shape layer, opaque layer, and intermediate layer. Thus, the latter two layers replace the single transparency layer of MPEG-4 Part 2. Different encoding schemes are specifically designed for each layer, utilizing cross-layer correlations to reduce the bit rate. First, the binary...... demonstrating that the proposed techniques provide substantial bit rate savings coding shape and transparency when compared to the tools adopted in MPEG-4 Part 2....

Accuracy of inference on the physics of binary evolution from gravitational-wave observations

Science.gov (United States)

Barrett, Jim W.; Gaebel, Sebastian M.; Neijssel, Coenraad J.; Vigna-Gómez, Alejandro; Stevenson, Simon; Berry, Christopher P. L.; Farr, Will M.; Mandel, Ilya

2018-04-01

The properties of the population of merging binary black holes encode some of the uncertain physics underlying the evolution of massive stars in binaries. The binary black hole merger rate and chirp-mass distribution are being measured by ground-based gravitational-wave detectors. We consider isolated binary evolution, and explore how accurately the physical model can be constrained with such observations by applying the Fisher information matrix to the merging black hole population simulated with the rapid binary-population synthesis code COMPAS. We investigate variations in four COMPAS parameters: common-envelope efficiency, kick-velocity dispersion, and mass-loss rates during the luminous blue variable and Wolf-Rayet stellar-evolutionary phases. We find that ˜1000 observations would constrain these model parameters to a fractional accuracy of a few per cent. Given the empirically determined binary black hole merger rate, we can expect gravitational-wave observations alone to place strong constraints on the physics of stellar and binary evolution within a few years. Our approach can be extended to use other observational data sets; combining observations at different evolutionary stages will lead to a better understanding of stellar and binary physics.

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.

A cubic map chaos criterion theorem with applications in generalized synchronization based pseudorandom number generator and image encryption

Energy Technology Data Exchange (ETDEWEB)

Yang, Xiuping, E-mail: yangxiuping-1990@163.com; Min, Lequan, E-mail: minlequan@sina.com; Wang, Xue, E-mail: wangxue-20130818@163.com [Schools of Mathematics and Physics, University of Science and Technology Beijing, Beijing 100083 (China)

2015-05-15

This paper sets up a chaos criterion theorem on a kind of cubic polynomial discrete maps. Using this theorem, Zhou-Song's chaos criterion theorem on quadratic polynomial discrete maps and generalized synchronization (GS) theorem construct an eight-dimensional chaotic GS system. Numerical simulations have been carried out to verify the effectiveness of theoretical results. The chaotic GS system is used to design a chaos-based pseudorandom number generator (CPRNG). Using FIPS 140-2 test suit/Generalized FIPS 140-2, test suit tests the randomness of two 1000 key streams consisting of 20 000 bits generated by the CPRNG, respectively. The results show that there are 99.9%/98.5% key streams to have passed the FIPS 140-2 test suit/Generalized FIPS 140-2 test. Numerical simulations show that the different keystreams have an average 50.001% same codes. The key space of the CPRNG is larger than 2{sup 1345}. As an application of the CPRNG, this study gives an image encryption example. Experimental results show that the linear coefficients between the plaintext and the ciphertext and the decrypted ciphertexts via the 100 key streams with perturbed keys are less than 0.00428. The result suggests that the decrypted texts via the keystreams generated via perturbed keys of the CPRNG are almost completely independent on the original image text, and brute attacks are needed to break the cryptographic system.

Learning to assign binary weights to binary descriptor

Science.gov (United States)

Huang, Zhoudi; Wei, Zhenzhong; Zhang, Guangjun

2016-10-01

Constructing robust binary local feature descriptors are receiving increasing interest due to their binary nature, which can enable fast processing while requiring significantly less memory than their floating-point competitors. To bridge the performance gap between the binary and floating-point descriptors without increasing the computational cost of computing and matching, optimal binary weights are learning to assign to binary descriptor for considering each bit might contribute differently to the distinctiveness and robustness. Technically, a large-scale regularized optimization method is applied to learn float weights for each bit of the binary descriptor. Furthermore, binary approximation for the float weights is performed by utilizing an efficient alternatively greedy strategy, which can significantly improve the discriminative power while preserve fast matching advantage. Extensive experimental results on two challenging datasets (Brown dataset and Oxford dataset) demonstrate the effectiveness and efficiency of the proposed method.

Achievable Information Rates for Coded Modulation With Hard Decision Decoding for Coherent Fiber-Optic Systems

Science.gov (United States)

Sheikh, Alireza; Amat, Alexandre Graell i.; Liva, Gianluigi

2017-12-01

We analyze the achievable information rates (AIRs) for coded modulation schemes with QAM constellations with both bit-wise and symbol-wise decoders, corresponding to the case where a binary code is used in combination with a higher-order modulation using the bit-interleaved coded modulation (BICM) paradigm and to the case where a nonbinary code over a field matched to the constellation size is used, respectively. In particular, we consider hard decision decoding, which is the preferable option for fiber-optic communication systems where decoding complexity is a concern. Recently, Liga \\emph{et al.} analyzed the AIRs for bit-wise and symbol-wise decoders considering what the authors called \\emph{hard decision decoder} which, however, exploits \\emph{soft information} of the transition probabilities of discrete-input discrete-output channel resulting from the hard detection. As such, the complexity of the decoder is essentially the same as the complexity of a soft decision decoder. In this paper, we analyze instead the AIRs for the standard hard decision decoder, commonly used in practice, where the decoding is based on the Hamming distance metric. We show that if standard hard decision decoding is used, bit-wise decoders yield significantly higher AIRs than symbol-wise decoders. As a result, contrary to the conclusion by Liga \\emph{et al.}, binary decoders together with the BICM paradigm are preferable for spectrally-efficient fiber-optic systems. We also design binary and nonbinary staircase codes and show that, in agreement with the AIRs, binary codes yield better performance.

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

SETI-EC: SETI Encryption Code

Science.gov (United States)

Heller, René

2018-03-01

The SETI Encryption code, written in Python, creates a message for use in testing the decryptability of a simulated incoming interstellar message. The code uses images in a portable bit map (PBM) format, then writes the corresponding bits into the message, and finally returns both a PBM image and a text (TXT) file of the entire message. The natural constants (c, G, h) and the wavelength of the message are defined in the first few lines of the code, followed by the reading of the input files and their conversion into 757 strings of 359 bits to give one page. Each header of a page, i.e. the little-endian binary code translation of the tempo-spatial yardstick, is calculated and written on-the-fly for each page.

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

List Decoding of Algebraic Codes

DEFF Research Database (Denmark)

Nielsen, Johan Sebastian Rosenkilde

We investigate three paradigms for polynomial-time decoding of Reed–Solomon codes beyond half the minimum distance: the Guruswami–Sudan algorithm, Power decoding and the Wu algorithm. The main results concern shaping the computational core of all three methods to a problem solvable by module...... Hermitian codes using Guruswami–Sudan or Power decoding faster than previously known, and we show how to Wu list decode binary Goppa codes....... to solve such using module minimisation, or using our new Demand–Driven algorithm which is also based on module minimisation. The decoding paradigms are all derived and analysed in a self-contained manner, often in new ways or examined in greater depth than previously. Among a number of new results, we...

The Classification of Complementary Information Set Codes of Lengths 14 and 16

OpenAIRE

Freibert, Finley

2012-01-01

In the paper "A new class of codes for Boolean masking of cryptographic computations," Carlet, Gaborit, Kim, and Sol\\'{e} defined a new class of rate one-half binary codes called \\emph{complementary information set} (or CIS) codes. The authors then classified all CIS codes of length less than or equal to 12. CIS codes have relations to classical Coding Theory as they are a generalization of self-dual codes. As stated in the paper, CIS codes also have important practical applications as they m...

The Methods of Implementation of the Three-dimensional Pseudorandom Number Generator DOZEN for Heterogeneous CPU/GPU /FPGA High-performance Systems

Directory of Open Access Journals (Sweden)

Nikolay Petrovich Vasilyev

2015-03-01

Full Text Available The paper describes the scope of information security protocols based on PRN G in industrial systems. A method for implementing three-dimensional pseudorandom number generator D O Z E N in hybrid systems is provided. The description and results of studies parallel CUDA-version of the algorithm for use in hybrid data centers and high-performance FPGA-version for use in hardware solutions in controlled facilities of SCADA-systems are given.

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.

Multi-Messenger Astronomy: White Dwarf Binaries, LISA and GAIA

Science.gov (United States)

Bueno, Michael; Breivik, Katelyn; Larson, Shane L.

2017-01-01

The discovery of gravitational waves has ushered in a new era in astronomy. The low-frequency band covered by the future LISA detector provides unprecedented opportunities for multi-messenger astronomy. With the Global Astrometric Interferometer for Astrophysics (GAIA) mission, we expect to discover about 1,000 eclipsing binary systems composed of a WD and a main sequence star - a sizeable increase from the approximately 34 currently known binaries of this type. In advance of the first GAIA data release and the launch of LISA within the next decade, we used the Binary Stellar Evolution (BSE) code simulate the evolution of White Dwarf Binaries (WDB) in a fixed galaxy population of about 196,000 sources. Our goal is to assess the detectability of a WDB by LISA and GAIA using the parameters from our population synthesis, we calculate GW strength h, and apparent GAIA magnitude G. We can then use a scale factor to make a prediction of how many multi- messenger sources we expect to be detectable by both LISA and GAIA in a galaxy the size of the Milky Way. We create binaries 10 times to ensure randomness in distance assignment and average our results. We then determined whether or not astronomical chirp is the difference between the total chirp and the GW chirp. With Astronomical chirp and simulations of mass transfer and tides, we can gather more information about the internal astrophysics of stars in ultra-compact binary systems.

Random digital encryption secure communication system

Science.gov (United States)

Doland, G. D. (Inventor)

1982-01-01

The design of a secure communication system is described. A product code, formed from two pseudorandom sequences of digital bits, is used to encipher or scramble data prior to transmission. The two pseudorandom sequences are periodically changed at intervals before they have had time to repeat. One of the two sequences is transmitted continuously with the scrambled data for synchronization. In the receiver portion of the system, the incoming signal is compared with one of two locally generated pseudorandom sequences until correspondence between the sequences is obtained. At this time, the two locally generated sequences are formed into a product code which deciphers the data from the incoming signal. Provision is made to ensure synchronization of the transmitting and receiving portions of the system.

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.

Coding efficiency of AVS 2.0 for CBAC and CABAC engines

Science.gov (United States)

Cui, Jing; Choi, Youngkyu; Chae, Soo-Ik

2015-12-01

In this paper we compare the coding efficiency of AVS 2.0[1] for engines of the Context-based Binary Arithmetic Coding (CBAC)[2] in the AVS 2.0 and the Context-Adaptive Binary Arithmetic Coder (CABAC)[3] in the HEVC[4]. For fair comparison, the CABAC is embedded in the reference code RD10.1 because the CBAC is in the HEVC in our previous work[5]. The rate estimation table is employed only for RDOQ in the RD code. To reduce the computation complexity of the video encoder, therefore we modified the RD code so that the rate estimation table is employed for all RDO decision. Furthermore, we also simplify the complexity of rate estimation table by reducing the bit depth of its fractional part to 2 from 8. The simulation result shows that the CABAC has the BD-rate loss of about 0.7% compared to the CBAC. It seems that the CBAC is a little more efficient than that the CABAC in the AVS 2.0.

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.

Binary effectivity rules

DEFF Research Database (Denmark)

Keiding, Hans; Peleg, Bezalel

2006-01-01

is binary if it is rationalized by an acyclic binary relation. The foregoing result motivates our definition of a binary effectivity rule as the effectivity rule of some binary SCR. A binary SCR is regular if it satisfies unanimity, monotonicity, and independence of infeasible alternatives. A binary...

The magnetosphere of the close accreting PMS binary V4046 Sgr

Directory of Open Access Journals (Sweden)

Gregory S. G.

2014-01-01

Full Text Available V4046 Sagittarii AB is a close short-period classical T Tauri binary. It is a circularised and synchronised system accreting from a circumbinary disk. In 2009 it was observed as part of a coordinated program involving near-simultaneous spectropolarimetric observations with ESPaDOnS at the Canada-France-Hawai’i Telescope and high-resolution X-ray observations with XMM-Newton. Magnetic maps of each star were derived from Zeeman-Doppler imaging. After briefly highlighting the most significant observational findings, we present a preliminary 3D model of the binary magnetosphere constructed from the magnetic maps using a newly developed binary magnetic field extrapolation code. The large-scale fields (the dipole components of both stars are highly tilted with respect to their rotation axes, and their magnetic fields are linked.

Roche-Lobe overflow in X-ray binaries, ch. 2

International Nuclear Information System (INIS)

Savonije, G.J.

1977-01-01

It is examined whether Roche-lobe overflow can be the main mechanism of mass transfer that powers the low-mass as well as the massive X-ray binaries. Detailed numerical computations of the initial phase of Roche-lobe overflow were performed in order to determine the precise time development of the mass transfer from normal stars with masses ranging from 1.5 M(sun) up to 20 M(sun) to compact companions with masses of 1 and 1.5 M(sun). The binary code includes a simplified hydrodynamical treatment of Roche-lobe overflow. For massive primaries this hydrodynamical treatment appears to result in much longer X-ray lifetimes than obtained in previous investigations. The calculations also include effects of slow, non-synchronous rotation of the contact star and loss of mass and angular momentum from the binary system. For Her X-1 and Cen X-3 X-ray lifetimes of the order of 10 5 and 10 4 yrs are predicted, respectively

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

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.

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.

Introducing adapted Nelder & Mead's downhill simplex method to a fully automated analysis of eclipsing binaries

OpenAIRE

Prsa, A.; Zwitter, T.

2004-01-01

Eclipsing binaries are extremely attractive objects because absolute physical parameters (masses, luminosities, radii) of both components may be determined from observations. Since most efforts to extract these parameters were based on dedicated observing programs, existing modeling code is based on interactivity. Gaia will make a revolutionary advance in shear number of observed eclipsing binaries and new methods for automatic handling must be introduced and thoroughly tested. This paper foc...

Experimental demonstration of nonbinary LDPC convolutional codes for DP-64QAM/256QAM

NARCIS (Netherlands)

Koike-Akino, T.; Sugihara, K.; Millar, D.S.; Pajovic, M.; Matsumoto, W.; Alvarado, A.; Maher, R.; Lavery, D.; Paskov, M.; Kojima, K.; Parsons, K.; Thomsen, B.C.; Savory, S.J.; Bayvel, P.

2016-01-01

We show the great potential of nonbinary LDPC convolutional codes (NB-LDPC-CC) with low-latency windowed decoding. It is experimentally demonstrated that NB-LDPC-CC can offer a performance improvement of up to 5 dB compared with binary coding.

Gallager error-correcting codes for binary asymmetric channels

International Nuclear Information System (INIS)

Neri, I; Skantzos, N S; Bollé, D

2008-01-01

We derive critical noise levels for Gallager codes on asymmetric channels as a function of the input bias and the temperature. Using a statistical mechanics approach we study the space of codewords and the entropy in the various decoding regimes. We further discuss the relation of the convergence of the message passing algorithm with the endogenous property and complexity, characterizing solutions of recursive equations of distributions for cavity fields

Boolean logic and character state identity: pitfalls of character coding in metazoan cladistics

NARCIS (Netherlands)

Jenner, Ronald A.

2002-01-01

A critical study of the morphological data sets used for the most recent analyses of metazoan cladistics exposes a rather cavalier attitude towards character coding. Binary absence/presence coding is ubiquitous, but without any explicit justification. This uncompromising application of Boolean logic

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.

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

Science.gov (United States)

Yang, Yu-Guang; Zhao, Qian-Qian

2016-02-04

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.

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

We derive the Wu list-decoding algorithm for generalized Reed–Solomon (GRS) codes by using Gröbner bases over modules and the Euclidean algorithm as the initial algorithm instead of the Berlekamp–Massey algorithm. We present a novel method for constructing the interpolation polynomial fast. We gi...... and a duality in the choice of parameters needed for decoding, both in the case of GRS codes and in the case of Goppa codes....

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

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.

The fidelity of Kepler eclipsing binary parameters inferred by the neural network

Science.gov (United States)

Holanda, N.; da Silva, J. R. P.

2018-04-01

This work aims to test the fidelity and efficiency of obtaining automatic orbital elements of eclipsing binary systems, from light curves using neural network models. We selected a random sample with 78 systems, from over 1400 eclipsing binary detached obtained from the Kepler Eclipsing Binaries Catalog, processed using the neural network approach. The orbital parameters of the sample systems were measured applying the traditional method of light curve adjustment with uncertainties calculated by the bootstrap method, employing the JKTEBOP code. These estimated parameters were compared with those obtained by the neural network approach for the same systems. The results reveal a good agreement between techniques for the sum of the fractional radii and moderate agreement for e cos ω and e sin ω, but orbital inclination is clearly underestimated in neural network tests.

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

Common Envelope Light Curves. I. Grid-code Module Calibration

Energy Technology Data Exchange (ETDEWEB)

Galaviz, Pablo; Marco, Orsola De; Staff, Jan E.; Iaconi, Roberto [Department of Physics and Astronomy, Macquarie University, Sydney, NSW (Australia); Passy, Jean-Claude, E-mail: Pablo.Galaviz@me.com [Argelander-Institut für Astronomie, Auf dem Hügel 71, D-53121 Bonn (Germany)

2017-04-01

The common envelope (CE) binary interaction occurs when a star transfers mass onto a companion that cannot fully accrete it. The interaction can lead to a merger of the two objects or to a close binary. The CE interaction is the gateway of all evolved compact binaries, all stellar mergers, and likely many of the stellar transients witnessed to date. CE simulations are needed to understand this interaction and to interpret stars and binaries thought to be the byproduct of this stage. At this time, simulations are unable to reproduce the few observational data available and several ideas have been put forward to address their shortcomings. The need for more definitive simulation validation is pressing and is already being fulfilled by observations from time-domain surveys. In this article, we present an initial method and its implementation for post-processing grid-based CE simulations to produce the light curve so as to compare simulations with upcoming observations. Here we implemented a zeroth order method to calculate the light emitted from CE hydrodynamic simulations carried out with the 3D hydrodynamic code Enzo used in unigrid mode. The code implements an approach for the computation of luminosity in both optically thick and optically thin regimes and is tested using the first 135 days of the CE simulation of Passy et al., where a 0.8  M {sub ⊙} red giant branch star interacts with a 0.6  M {sub ⊙} companion. This code is used to highlight two large obstacles that need to be overcome before realistic light curves can be calculated. We explain the nature of these problems and the attempted solutions and approximations in full detail to enable the next step to be identified and implemented. We also discuss our simulation in relation to recent data of transients identified as CE interactions.

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

KAUST Repository

Lin, Sian Jheng; Al-Naffouri, Tareq Y.; Han, Yunghsiang S.

2016-01-01

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

Partial Encryption of Entropy-Coded Video Compression Using Coupled Chaotic Maps

Directory of Open Access Journals (Sweden)

Fadi Almasalha

2014-10-01

Full Text Available Due to pervasive communication infrastructures, a plethora of enabling technologies is being developed over mobile and wired networks. Among these, video streaming services over IP are the most challenging in terms of quality, real-time requirements and security. In this paper, we propose a novel scheme to efficiently secure variable length coded (VLC multimedia bit streams, such as H.264. It is based on code word error diffusion and variable size segment shuffling. The codeword diffusion and the shuffling mechanisms are based on random operations from a secure and computationally efficient chaos-based pseudo-random number generator. The proposed scheme is ubiquitous to the end users and can be deployed at any node in the network. It provides different levels of security, with encrypted data volume fluctuating between 5.5–17%. It works on the compressed bit stream without requiring any decoding. It provides excellent encryption speeds on different platforms, including mobile devices. It is 200% faster and 150% more power efficient when compared with AES software-based full encryption schemes. Regarding security, the scheme is robust to well-known attacks in the literature, such as brute force and known/chosen plain text attacks.

Samurai project: Verifying the consistency of black-hole-binary waveforms for gravitational-wave detection

OpenAIRE

Hannam, Mark; Husa, Sascha; Baker, John G.; Boyle, Michael; Brügmann, Bernd; Chu, Tony; Dorband, Nils; Herrmann, Frank; Hinder, Ian; Kelly, Bernard J.; Kidder, Lawrence E.; Laguna, Pablo; Matthews, Keith D.; van-Meter, James R.; Pfeiffer, Harald P.

2009-01-01

We quantify the consistency of numerical-relativity black-hole-binary waveforms for use in gravitational-wave (GW) searches with current and planned ground-based detectors. We compare previously published results for the (center dot=2,vertical bar m vertical bar=2) mode of the gravitational waves from an equal-mass nonspinning binary, calculated by five numerical codes. We focus on the 1000M (about six orbits, or 12 GW cycles) before the peak of the GW amplitude and the subsequent ringdown. W...

On quadratic residue codes and hyperelliptic curves

Directory of Open Access Journals (Sweden)

David Joyner

2008-01-01

Full Text Available For an odd prime p and each non-empty subset S⊂GF(p, consider the hyperelliptic curve X S defined by y 2 =f S (x, where f S (x = ∏ a∈S (x-a. Using a connection between binary quadratic residue codes and hyperelliptic curves over GF(p, this paper investigates how coding theory bounds give rise to bounds such as the following example: for all sufficiently large primes p there exists a subset S⊂GF(p for which the bound |X S (GF(p| > 1.39p holds. We also use the quasi-quadratic residue codes defined below to construct an example of a formally self-dual optimal code whose zeta function does not satisfy the ``Riemann hypothesis.''

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.

UBVRc Ic ANALYSIS OF THE RECENTLY DISCOVERED TOTALLY ECLIPSING EXTREME MASS RATIO BINARY V1853 ORIONIS, AND A STATISTICAL LOOK AT 25 OTHER EXTREME MASS RATIO SOLAR-TYPE CONTACT BINARIES

International Nuclear Information System (INIS)

Samec, R. G.; Labadorf, C. M.; Hawkins, N. C.; Faulkner, D. R.; Van Hamme, W.

2011-01-01

We present precision CCD light curves, a period study, photometrically derived standard magnitudes, and a five-color simultaneous Wilson code solution of the totally eclipsing, yet shallow amplitude (A v ∼ 0.4 mag) eclipsing, binary V1853 Orionis. It is determined to be an extreme mass ratio, q = 0.20, W-type W UMa overcontact binary. From our standard star observations, we find that the variable is a late-type F spectral-type dwarf, with a secondary component of about 0.24 solar masses (stellar type M5V). Its long eclipse duration (41 minutes) as compared to its period, 0.383 days, attests to the small relative size of the secondary. Furthermore, it has reached a Roche lobe fill-out of ∼50% of its outer critical lobe as it approaches its final stages of binary star evolution, that of a fast spinning single star. Finally, a summary of about 25 extreme mass ratio solar-type binaries is given.

Real/binary co-operative and co-evolving swarms based multivariable PID controller design of ball mill pulverizing system

International Nuclear Information System (INIS)

Menhas, Muhammad Ilyas; Fei Minrui; Wang Ling; Qian Lin

2012-01-01

Highlights: ► We extend the concept of co-operation and co-evolution in some PSO variants. ► We use developed co-operative PSOs in multivariable PID controller design/tuning. ► We find that co-operative PSOs converge faster and give high quality solutions. ► Dividing the search space among swarms improves search efficiency. ► The proposed methods allow the practitioner for heterogeneous problem formulation. - Abstract: In this paper, multivariable PID controller design based on cooperative and coevolving multiple swarms is demonstrated. A simplified multi-variable MIMO process model of a ball mill pulverizing system with steady state decoupler is considered. In order to formulate computational models of cooperative and coevolving multiple swarms three different algorithms like real coded PSO, discrete binary PSO (DBPSO) and probability based discrete binary PSO (PBPSO) are employed. Simulations are carried out on three composite functions simultaneously considering multiple objectives. The cooperative and coevolving multiple swarms based results are compared with the results obtained through single swarm based methods like real coded particle swarm optimization (PSO), discrete binary PSO (DBPSO), and probability based discrete binary PSO (PBPSO) algorithms. The cooperative and coevolving swarms based techniques outperform the real coded PSO, PBPSO, and the standard discrete binary PSO (DBPSO) algorithm in escaping from local optima. Furthermore, statistical analysis of the simulation results is performed to calculate the comparative reliability of various techniques. All of the techniques employed are suitable for controller tuning, however, the multiple cooperative and coevolving swarms based results are considerably better in terms of mean fitness, variance of fitness, and success rate in finding a feasible solution in comparison to those obtained using single swarm based methods.

Probabilistic evaluations for CANTUP computer code analysis improvement

International Nuclear Information System (INIS)

Florea, S.; Pavelescu, M.

2004-01-01

Structural analysis with finite element method is today an usual way to evaluate and predict the behavior of structural assemblies subject to hard conditions in order to ensure their safety and reliability during their operation. A CANDU 600 fuel channel is an example of an assembly working in hard conditions, in which, except the corrosive and thermal aggression, long time irradiation, with implicit consequences on material properties evolution, interferes. That leads inevitably to material time-dependent properties scattering, their dynamic evolution being subject to a great degree of uncertainness. These are the reasons for developing, in association with deterministic evaluations with computer codes, the probabilistic and statistical methods in order to predict the structural component response. This work initiates the possibility to extend the deterministic thermomechanical evaluation on fuel channel components to probabilistic structural mechanics approach starting with deterministic analysis performed with CANTUP computer code which is a code developed to predict the long term mechanical behavior of the pressure tube - calandria tube assembly. To this purpose the structure of deterministic calculus CANTUP computer code has been reviewed. The code has been adapted from LAHEY 77 platform to Microsoft Developer Studio - Fortran Power Station platform. In order to perform probabilistic evaluations, it was added a part to the deterministic code which, using a subroutine from IMSL library from Microsoft Developer Studio - Fortran Power Station platform, generates pseudo-random values of a specified value. It was simulated a normal distribution around the deterministic value and 5% standard deviation for Young modulus material property in order to verify the statistical calculus of the creep behavior. The tube deflection and effective stresses were the properties subject to probabilistic evaluation. All the values of these properties obtained for all the values for

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.

Samurai project: Verifying the consistency of black-hole-binary waveforms for gravitational-wave detection

International Nuclear Information System (INIS)

Hannam, Mark; Husa, Sascha; Baker, John G.; Kelly, Bernard J.; Boyle, Michael; Bruegmann, Bernd; Chu, Tony; Matthews, Keith D.; Pfeiffer, Harald P.; Scheel, Mark A.; Dorband, Nils; Pollney, Denis; Reisswig, Christian; Herrmann, Frank; Hinder, Ian; Kidder, Lawrence E.; Laguna, Pablo; Shoemaker, Deirdre

2009-01-01

We quantify the consistency of numerical-relativity black-hole-binary waveforms for use in gravitational-wave (GW) searches with current and planned ground-based detectors. We compare previously published results for the (l=2,|m|=2) mode of the gravitational waves from an equal-mass nonspinning binary, calculated by five numerical codes. We focus on the 1000M (about six orbits, or 12 GW cycles) before the peak of the GW amplitude and the subsequent ringdown. We find that the phase and amplitude agree within each code's uncertainty estimates. The mismatch between the (l=2,|m|=2) modes is better than 10 -3 for binary masses above 60M · with respect to the Enhanced LIGO detector noise curve, and for masses above 180M · with respect to Advanced LIGO, Virgo, and Advanced Virgo. Between the waveforms with the best agreement, the mismatch is below 2x10 -4 . We find that the waveforms would be indistinguishable in all ground-based detectors (and for the masses we consider) if detected with a signal-to-noise ratio of less than ≅14, or less than ≅25 in the best cases.

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.

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.

Schroedinger’s Code: A Preliminary Study on Research Source Code Availability and Link Persistence in Astrophysics

Science.gov (United States)

Allen, Alice; Teuben, Peter J.; Ryan, P. Wesley

2018-05-01

We examined software usage in a sample set of astrophysics research articles published in 2015 and searched for the source codes for the software mentioned in these research papers. We categorized the software to indicate whether the source code is available for download and whether there are restrictions to accessing it, and if the source code is not available, whether some other form of the software, such as a binary, is. We also extracted hyperlinks from one journal’s 2015 research articles, as links in articles can serve as an acknowledgment of software use and lead to the data used in the research, and tested them to determine which of these URLs are still accessible. For our sample of 715 software instances in the 166 articles we examined, we were able to categorize 418 records as according to whether source code was available and found that 285 unique codes were used, 58% of which offered the source code for download. Of the 2558 hyperlinks extracted from 1669 research articles, at best, 90% of them were available over our testing period.

Spatial-phase code-division multiple-access system with multiplexed Fourier holography switching for reconfigurable optical interconnection

Science.gov (United States)

Takasago, Kazuya; Takekawa, Makoto; Shirakawa, Atsushi; Kannari, Fumihiko

2000-05-01

A new, to our knowledge, space-variant optical interconnection system based on a spatial-phase code-division multiple-access technique with multiplexed Fourier holography is described. In this technique a signal beam is spread over wide spatial frequencies by an M -sequence pseudorandom phase code. At a receiver side a selected signal beam is properly decoded, and at the same time its spatial pattern is shaped with a Fourier hologram, which is recorded by light that is encoded with the same M -sequence phase mask as the desired signal beam and by light whose spatial beam pattern is shaped to a signal routing pattern. Using the multiplexed holography, we can simultaneously route multisignal flows into individually specified receiver elements. The routing pattern can also be varied by means of switching the encoding phase code or replacing the hologram. We demonstrated a proof-of-principle experiment with a doubly multiplexed hologram that enables simultaneous routing of two signal beams. Using a numerical model, we showed that the proposed scheme can manage more than 250 routing patterns for one signal flow with one multiplexed hologram at a signal-to-noise ratio of 5.

Towers of generalized divisible quantum codes

Science.gov (United States)

Haah, Jeongwan

2018-04-01

A divisible binary classical code is one in which every code word has weight divisible by a fixed integer. If the divisor is 2ν for a positive integer ν , then one can construct a Calderbank-Shor-Steane (CSS) code, where X -stabilizer space is the divisible classical code, that admits a transversal gate in the ν th level of Clifford hierarchy. We consider a generalization of the divisibility by allowing a coefficient vector of odd integers with which every code word has zero dot product modulo the divisor. In this generalized sense, we construct a CSS code with divisor 2ν +1 and code distance d from any CSS code of code distance d and divisor 2ν where the transversal X is a nontrivial logical operator. The encoding rate of the new code is approximately d times smaller than that of the old code. In particular, for large d and ν ≥2 , our construction yields a CSS code of parameters [[O (dν -1) ,Ω (d ) ,d ] ] admitting a transversal gate at the ν th level of Clifford hierarchy. For our construction we introduce a conversion from magic state distillation protocols based on Clifford measurements to those based on codes with transversal T gates. Our tower contains, as a subclass, generalized triply even CSS codes that have appeared in so-called gauge fixing or code switching methods.

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

Polarity Correspondence: A General Principle for Performance of Speeded Binary Classification Tasks

Science.gov (United States)

Proctor, Robert W.; Cho, Yang Seok

2006-01-01

Differences in performance with various stimulus-response mappings are among the most prevalent findings for binary choice reaction tasks. The authors show that perceptual or conceptual similarity is not necessary to obtain mapping effects; a type of structural similarity is sufficient. Specifically, stimulus and response alternatives are coded as…

Soft decoding a self-dual (48, 24; 12) code

Science.gov (United States)

Solomon, G.

1993-01-01

A self-dual (48,24;12) code comes from restricting a binary cyclic (63,18;36) code to a 6 x 7 matrix, adding an eighth all-zero column, and then adjoining six dimensions to this extended 6 x 8 matrix. These six dimensions are generated by linear combinations of row permutations of a 6 x 8 matrix of weight 12, whose sums of rows and columns add to one. A soft decoding using these properties and approximating maximum likelihood is presented here. This is preliminary to a possible soft decoding of the box (72,36;15) code that promises a 7.7-dB theoretical coding under maximum likelihood.

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.

Non-linear M -sequences Generation Method

Directory of Open Access Journals (Sweden)

Z. R. Garifullina

2011-06-01

Full Text Available The article deals with a new method for modeling a pseudorandom number generator based on R-blocks. The gist of the method is the replacement of a multi digit XOR element by a stochastic adder in a parallel binary linear feedback shift register scheme.

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

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.

Binary star formation: gravitational fragmentation followed by capture

Science.gov (United States)

Turner, J. A.; Chapman, S. J.; Bhattal, A. S.; Disney, M. J.; Pongracic, H.; Whitworth, A. P.

1995-11-01

intervene, provided the binary components are well matched (i.e. of comparable mass) and the third body is not too massive, such interventions will - more often than not - harden the orbit further. In two appendices we describe the code used in the simulations presented in this and the companion paper, and the tests performed to demonstrate the code's ability to handle the physical processes involved.

Block diagonalization for algebra's associated with block codes

NARCIS (Netherlands)

D. Gijswijt (Dion)

2009-01-01

htmlabstractFor a matrix *-algebra B, consider the matrix *-algebra A consisting of the symmetric tensors in the n-fold tensor product of B. Examples of such algebras in coding theory include the Bose-Mesner algebra and Terwilliger algebra of the (non)binary Hamming cube, and algebras arising in

Ripple design of LT codes for AWGN channel

DEFF Research Database (Denmark)

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

2012-01-01

In this paper, we present an analytical framework for designing LT codes in additive white Gaussian noise (AWGN) channels. We show that some of analytical results from binary erasure channels (BEC) also hold in AWGN channels with slight modifications. This enables us to apply a ripple-based design...

Ffuzz: Towards full system high coverage fuzz testing on binary executables.

Directory of Open Access Journals (Sweden)

Bin Zhang

Full Text Available Bugs and vulnerabilities in binary executables threaten cyber security. Current discovery methods, like fuzz testing, symbolic execution and manual analysis, both have advantages and disadvantages when exercising the deeper code area in binary executables to find more bugs. In this paper, we designed and implemented a hybrid automatic bug finding tool-Ffuzz-on top of fuzz testing and selective symbolic execution. It targets full system software stack testing including both the user space and kernel space. Combining these two mainstream techniques enables us to achieve higher coverage and avoid getting stuck both in fuzz testing and symbolic execution. We also proposed two key optimizations to improve the efficiency of full system testing. We evaluated the efficiency and effectiveness of our method on real-world binary software and 844 memory corruption vulnerable programs in the Juliet test suite. The results show that Ffuzz can discover software bugs in the full system software stack effectively and efficiently.

Ffuzz: Towards full system high coverage fuzz testing on binary executables.

Science.gov (United States)

Zhang, Bin; Ye, Jiaxi; Bi, Xing; Feng, Chao; Tang, Chaojing

2018-01-01

Bugs and vulnerabilities in binary executables threaten cyber security. Current discovery methods, like fuzz testing, symbolic execution and manual analysis, both have advantages and disadvantages when exercising the deeper code area in binary executables to find more bugs. In this paper, we designed and implemented a hybrid automatic bug finding tool-Ffuzz-on top of fuzz testing and selective symbolic execution. It targets full system software stack testing including both the user space and kernel space. Combining these two mainstream techniques enables us to achieve higher coverage and avoid getting stuck both in fuzz testing and symbolic execution. We also proposed two key optimizations to improve the efficiency of full system testing. We evaluated the efficiency and effectiveness of our method on real-world binary software and 844 memory corruption vulnerable programs in the Juliet test suite. The results show that Ffuzz can discover software bugs in the full system software stack effectively and efficiently.

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.

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.

Flexible digital modulation and coding synthesis for satellite communications

Science.gov (United States)

Vanderaar, Mark; Budinger, James; Hoerig, Craig; Tague, John

1991-01-01

An architecture and a hardware prototype of a flexible trellis modem/codec (FTMC) transmitter are presented. The theory of operation is built upon a pragmatic approach to trellis-coded modulation that emphasizes power and spectral efficiency. The system incorporates programmable modulation formats, variations of trellis-coding, digital baseband pulse-shaping, and digital channel precompensation. The modulation formats examined include (uncoded and coded) binary phase shift keying (BPSK), quatenary phase shift keying (QPSK), octal phase shift keying (8PSK), 16-ary quadrature amplitude modulation (16-QAM), and quadrature quadrature phase shift keying (Q squared PSK) at programmable rates up to 20 megabits per second (Mbps). The FTMC is part of the developing test bed to quantify modulation and coding concepts.

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.

A Loader for Executing Multi-Binary Applications on the Thinking Machines CM-5: It's Not Just for SPMD Anymore

Science.gov (United States)

Becker, Jeffrey C.

1995-01-01

The Thinking Machines CM-5 platform was designed to run single program, multiple data (SPMD) applications, i.e., to run a single binary across all nodes of a partition, with each node possibly operating on different data. Certain classes of applications, such as multi-disciplinary computational fluid dynamics codes, are facilitated by the ability to have subsets of the partition nodes running different binaries. In order to extend the CM-5 system software to permit such applications, a multi-program loader was developed. This system is based on the dld loader which was originally developed for workstations. This paper provides a high level description of dld, and describes how it was ported to the CM-5 to provide support for multi-binary applications. Finally, it elaborates how the loader has been used to implement the CM-5 version of MPIRUN, a portable facility for running multi-disciplinary/multi-zonal MPI (Message-Passing Interface Standard) codes.

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.

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.

Numerical Simulations of Wind Accretion in Symbiotic Binaries

Science.gov (United States)

de Val-Borro, M.; Karovska, M.; Sasselov, D.

2009-08-01

About half of the binary systems are close enough to each other for mass to be exchanged between them at some point in their evolution, yet the accretion mechanism in wind accreting binaries is not well understood. We study the dynamical effects of gravitational focusing by a binary companion on winds from late-type stars. In particular, we investigate the mass transfer and formation of accretion disks around the secondary in detached systems consisting of an asymptotic giant branch (AGB) mass-losing star and an accreting companion. The presence of mass outflows is studied as a function of mass-loss rate, wind temperature, and binary orbital parameters. A two-dimensional hydrodynamical model is used to study the stability of mass transfer in wind accreting symbiotic binary systems. In our simulations we use an adiabatic equation of state and a modified version of the isothermal approximation, where the temperature depends on the distance from the mass losing star and its companion. The code uses a block-structured adaptive mesh refinement method that allows us to have high resolution at the position of the secondary and resolve the formation of bow shocks and accretion disks. We explore the accretion flow between the components and formation of accretion disks for a range of orbital separations and wind parameters. Our results show the formation of stream flow between the stars and accretion disks of various sizes for certain orbital configurations. For a typical slow and massive wind from an AGB star the flow pattern is similar to a Roche lobe overflow with accretion rates of 10% of the mass loss from the primary. Stable disks with exponentially decreasing density profiles and masses of the order 10-4 solar masses are formed when wind acceleration occurs at several stellar radii. The disks are geometrically thin with eccentric streamlines and close to Keplerian velocity profiles. The formation of tidal streams and accretion disks is found to be weakly dependent on

NUMERICAL SIMULATIONS OF WIND ACCRETION IN SYMBIOTIC BINARIES

International Nuclear Information System (INIS)

De Val-Borro, M.; Karovska, M.; Sasselov, D.

2009-01-01

About half of the binary systems are close enough to each other for mass to be exchanged between them at some point in their evolution, yet the accretion mechanism in wind accreting binaries is not well understood. We study the dynamical effects of gravitational focusing by a binary companion on winds from late-type stars. In particular, we investigate the mass transfer and formation of accretion disks around the secondary in detached systems consisting of an asymptotic giant branch (AGB) mass-losing star and an accreting companion. The presence of mass outflows is studied as a function of mass-loss rate, wind temperature, and binary orbital parameters. A two-dimensional hydrodynamical model is used to study the stability of mass transfer in wind accreting symbiotic binary systems. In our simulations we use an adiabatic equation of state and a modified version of the isothermal approximation, where the temperature depends on the distance from the mass losing star and its companion. The code uses a block-structured adaptive mesh refinement method that allows us to have high resolution at the position of the secondary and resolve the formation of bow shocks and accretion disks. We explore the accretion flow between the components and formation of accretion disks for a range of orbital separations and wind parameters. Our results show the formation of stream flow between the stars and accretion disks of various sizes for certain orbital configurations. For a typical slow and massive wind from an AGB star the flow pattern is similar to a Roche lobe overflow with accretion rates of 10% of the mass loss from the primary. Stable disks with exponentially decreasing density profiles and masses of the order 10 -4 solar masses are formed when wind acceleration occurs at several stellar radii. The disks are geometrically thin with eccentric streamlines and close to Keplerian velocity profiles. The formation of tidal streams and accretion disks is found to be weakly dependent

Pulsars in binary systems: probing binary stellar evolution and general relativity.

Science.gov (United States)

Stairs, Ingrid H

2004-04-23

Radio pulsars in binary orbits often have short millisecond spin periods as a result of mass transfer from their companion stars. They therefore act as very precise, stable, moving clocks that allow us to investigate a large set of otherwise inaccessible astrophysical problems. The orbital parameters derived from high-precision binary pulsar timing provide constraints on binary evolution, characteristics of the binary pulsar population, and the masses of neutron stars with different mass-transfer histories. These binary systems also test gravitational theories, setting strong limits on deviations from general relativity. Surveys for new pulsars yield new binary systems that increase our understanding of all these fields and may open up whole new areas of physics, as most spectacularly evidenced by the recent discovery of an extremely relativistic double-pulsar system.

Implementation of Layered Decoding Architecture for LDPC Code using Layered Min-Sum Algorithm

OpenAIRE

Sandeep Kakde; Atish Khobragade; Shrikant Ambatkar; Pranay Nandanwar

2017-01-01

For binary field and long code lengths, Low Density Parity Check (LDPC) code approaches Shannon limit performance. LDPC codes provide remarkable error correction performance and therefore enlarge the design space for communication systems.In this paper, we have compare different digital modulation techniques and found that BPSK modulation technique is better than other modulation techniques in terms of BER. It also gives error performance of LDPC decoder over AWGN channel using Min-Sum algori...

Method for coding low entrophy data

Science.gov (United States)

Yeh, Pen-Shu (Inventor)

1995-01-01

A method of lossless data compression for efficient coding of an electronic signal of information sources of very low information rate is disclosed. In this method, S represents a non-negative source symbol set, (s(sub 0), s(sub 1), s(sub 2), ..., s(sub N-1)) of N symbols with s(sub i) = i. The difference between binary digital data is mapped into symbol set S. Consecutive symbols in symbol set S are then paired into a new symbol set Gamma which defines a non-negative symbol set containing the symbols (gamma(sub m)) obtained as the extension of the original symbol set S. These pairs are then mapped into a comma code which is defined as a coding scheme in which every codeword is terminated with the same comma pattern, such as a 1. This allows a direct coding and decoding of the n-bit positive integer digital data differences without the use of codebooks.

Trojan Binaries

Science.gov (United States)

Noll, K. S.

2017-12-01

The Jupiter Trojans, in the context of giant planet migration models, can be thought of as an extension of the small body populations found beyond Neptune in the Kuiper Belt. Binaries are a distinctive feature of small body populations in the Kuiper Belt with an especially high fraction apparent among the brightest Cold Classicals. The binary fraction, relative sizes, and separations in the dynamically excited populations (Scattered, Resonant) reflects processes that may have eroded a more abundant initial population. This trend continues in the Centaurs and Trojans where few binaries have been found. We review new evidence including a third resolved Trojan binary and lightcurve studies to understand how the Trojans are related to the small body populations that originated in the outer protoplanetary disk.

Symmetries in Genetic Systems and the Concept of Geno-Logical Coding

Directory of Open Access Journals (Sweden)

Sergey V. Petoukhov

2016-12-01

Full Text Available The genetic code of amino acid sequences in proteins does not allow understanding and modeling of inherited processes such as inborn coordinated motions of living bodies, innate principles of sensory information processing, quasi-holographic properties, etc. To be able to model these phenomena, the concept of geno-logical coding, which is connected with logical functions and Boolean algebra, is put forward. The article describes basic pieces of evidence in favor of the existence of the geno-logical code, which exists in p­arallel with the known genetic code of amino acid sequences but which serves for transferring inherited processes along chains of generations. These pieces of evidence have been received due to the analysis of symmetries in structures of molecular-genetic systems. The analysis has revealed a close connection of the genetic system with dyadic groups of binary numbers and with other mathematical objects, which are related with dyadic groups: Walsh functions (which are algebraic characters of dyadic groups, bit-reversal permutations, logical holography, etc. These results provide a new approach for mathematical modeling of genetic structures, which uses known mathematical formalisms from technological fields of noise-immunity coding of information, binary analysis, logical holography, and digital devices of artificial intellect. Some opportunities for a development of algebraic-logical biology are opened.

A modified non-binary LDPC scheme based on watermark symbols in high speed optical transmission systems

Science.gov (United States)

Wang, Liming; Qiao, Yaojun; Yu, Qian; Zhang, Wenbo

2016-04-01

We introduce a watermark non-binary low-density parity check code (NB-LDPC) scheme, which can estimate the time-varying noise variance by using prior information of watermark symbols, to improve the performance of NB-LDPC codes. And compared with the prior-art counterpart, the watermark scheme can bring about 0.25 dB improvement in net coding gain (NCG) at bit error rate (BER) of 1e-6 and 36.8-81% reduction of the iteration numbers. Obviously, the proposed scheme shows great potential in terms of error correction performance and decoding efficiency.

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.

On the decoding process in ternary error-correcting output codes.

Science.gov (United States)

Escalera, Sergio; Pujol, Oriol; Radeva, Petia

2010-01-01

A common way to model multiclass classification problems is to design a set of binary classifiers and to combine them. Error-Correcting Output Codes (ECOC) represent a successful framework to deal with these type of problems. Recent works in the ECOC framework showed significant performance improvements by means of new problem-dependent designs based on the ternary ECOC framework. The ternary framework contains a larger set of binary problems because of the use of a "do not care" symbol that allows us to ignore some classes by a given classifier. However, there are no proper studies that analyze the effect of the new symbol at the decoding step. In this paper, we present a taxonomy that embeds all binary and ternary ECOC decoding strategies into four groups. We show that the zero symbol introduces two kinds of biases that require redefinition of the decoding design. A new type of decoding measure is proposed, and two novel decoding strategies are defined. We evaluate the state-of-the-art coding and decoding strategies over a set of UCI Machine Learning Repository data sets and into a real traffic sign categorization problem. The experimental results show that, following the new decoding strategies, the performance of the ECOC design is significantly improved.

Testing the Binary Black Hole Nature of a Compact Binary Coalescence.

Science.gov (United States)

Krishnendu, N V; Arun, K G; Mishra, Chandra Kant

2017-09-01

We propose a novel method to test the binary black hole nature of compact binaries detectable by gravitational wave (GW) interferometers and, hence, constrain the parameter space of other exotic compact objects. The spirit of the test lies in the "no-hair" conjecture for black holes where all properties of a Kerr black hole are characterized by its mass and spin. The method relies on observationally measuring the quadrupole moments of the compact binary constituents induced due to their spins. If the compact object is a Kerr black hole (BH), its quadrupole moment is expressible solely in terms of its mass and spin. Otherwise, the quadrupole moment can depend on additional parameters (such as the equation of state of the object). The higher order spin effects in phase and amplitude of a gravitational waveform, which explicitly contains the spin-induced quadrupole moments of compact objects, hence, uniquely encode the nature of the compact binary. Thus, we argue that an independent measurement of the spin-induced quadrupole moment of the compact binaries from GW observations can provide a unique way to distinguish binary BH systems from binaries consisting of exotic compact objects.

Accuracy requirements for the calculation of gravitational waveforms from coalescing compact binaries in numerical relativity

International Nuclear Information System (INIS)

Miller, Mark

2005-01-01

I discuss the accuracy requirements on numerical relativity calculations of inspiraling compact object binaries whose extracted gravitational waveforms are to be used as templates for matched filtering signal extraction and physical parameter estimation in modern interferometric gravitational wave detectors. Using a post-Newtonian point particle model for the premerger phase of the binary inspiral, I calculate the maximum allowable errors for the mass and relative velocity and positions of the binary during numerical simulations of the binary inspiral. These maximum allowable errors are compared to the errors of state-of-the-art numerical simulations of multiple-orbit binary neutron star calculations in full general relativity, and are found to be smaller by several orders of magnitude. A post-Newtonian model for the error of these numerical simulations suggests that adaptive mesh refinement coupled with second-order accurate finite difference codes will not be able to robustly obtain the accuracy required for reliable gravitational wave extraction on Terabyte-scale computers. I conclude that higher-order methods (higher-order finite difference methods and/or spectral methods) combined with adaptive mesh refinement and/or multipatch technology will be needed for robustly accurate gravitational wave extraction from numerical relativity calculations of binary coalescence scenarios

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

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

Production of a pseudo-random square wave using a shift register with binary feedbacks; Generation d'un creneau pseudo-aleatoire par un registre a decalage a contre-reaction binaire

Energy Technology Data Exchange (ETDEWEB)

Stern, T E; Cazemajou, J; Macherez, B; Valat, J; Vignon, A

1964-07-01

We summarize here the theoretical basis for the production of square wave having the values '1' or '0', the switching times being 'pseudo-random'. More precisely, the square-wave may or may not change value at regular time intervals of length {delta}, with probability approximately. 5 for each alternative. The wave-form is obtained by means of a shift-register having modulo-2 feedback. If the interval {delta} and the feedback connections are well chosen, it is possible to produce a waveform whose autocorrelation function is very close to a Dirac delta function. The square-wave therefore behaves like a quantized white noise, which has very interesting properties in cross-correlation techniques. (authors) [French] On resume ici les bases theoriques permettant d'obtenir un creneau prenant les valeurs '1' ou '0', les instants de commutation etant pseudo-aleatoires. Plus exactement, le creneau a la possibilite de changer (ou de ne pas changer) d'etat a intervalles de temps reguliers, separes par intervalle elementaire {delta}, chacune des deux possibilites possedant une probabilite d'apparition tres voisine de 0,5. Le creneau est obtenu par un registre a decalage (shift register) a contre-reactions logiques modulo-2. Si l'intervalle {delta} et les contre-reactions sont judicieusement choisis, il est possible d'obtenir pour le creneau une fonction d'autocorrelation triangulaire tres voisine d'une impulsion de Dirac. Par suite le creneau se comporte comme un bruit blanc quantifie possedant de tres interessantes proprietes pour les techniques statistiques d'intercorrelation. (auteurs)

A New Algorithm of Shape Boundaries Based on Chain Coding

Directory of Open Access Journals (Sweden)

Zhao Xin

2017-01-01

Full Text Available A new method to obtain connected component in binary images is presented. The method uses DFA automaton to obtain chain code and label the component boundary. It is theoretically proved that the algorithm improves the image encoding efficiency closer to the lowest time consumption.

QCA Gray Code Converter Circuits Using LTEx Methodology

Science.gov (United States)

Mukherjee, Chiradeep; Panda, Saradindu; Mukhopadhyay, Asish Kumar; Maji, Bansibadan

2018-04-01

The Quantum-dot Cellular Automata (QCA) is the prominent paradigm of nanotechnology considered to continue the computation at deep sub-micron regime. The QCA realizations of several multilevel circuit of arithmetic logic unit have been introduced in the recent years. However, as high fan-in Binary to Gray (B2G) and Gray to Binary (G2B) Converters exist in the processor based architecture, no attention has been paid towards the QCA instantiation of the Gray Code Converters which are anticipated to be used in 8-bit, 16-bit, 32-bit or even more bit addressable machines of Gray Code Addressing schemes. In this work the two-input Layered T module is presented to exploit the operation of an Exclusive-OR Gate (namely LTEx module) as an elemental block. The "defect-tolerant analysis" of the two-input LTEx module has been analyzed to establish the scalability and reproducibility of the LTEx module in the complex circuits. The novel formulations exploiting the operability of the LTEx module have been proposed to instantiate area-delay efficient B2G and G2B Converters which can be exclusively used in Gray Code Addressing schemes. Moreover this work formulates the QCA design metrics such as O-Cost, Effective area, Delay and Cost α for the n-bit converter layouts.

Accuracy of Binary Black Hole waveforms for Advanced LIGO searches

Science.gov (United States)

Kumar, Prayush; Barkett, Kevin; Bhagwat, Swetha; Chu, Tony; Fong, Heather; Brown, Duncan; Pfeiffer, Harald; Scheel, Mark; Szilagyi, Bela

2015-04-01

Coalescing binaries of compact objects are flagship sources for the first direct detection of gravitational waves with LIGO-Virgo observatories. Matched-filtering based detection searches aimed at binaries of black holes will use aligned spin waveforms as filters, and their efficiency hinges on the accuracy of the underlying waveform models. A number of gravitational waveform models are available in literature, e.g. the Effective-One-Body, Phenomenological, and traditional post-Newtonian ones. While Numerical Relativity (NR) simulations provide for the most accurate modeling of gravitational radiation from compact binaries, their computational cost limits their application in large scale searches. In this talk we assess the accuracy of waveform models in two regions of parameter space, which have only been explored cursorily in the past: the high mass-ratio regime as well as the comparable mass-ratio + high spin regime.s Using the SpEC code, six q = 7 simulations with aligned-spins and lasting 60 orbits, and tens of q ∈ [1,3] simulations with high black hole spins were performed. We use them to study the accuracy and intrinsic parameter biases of different waveform families, and assess their viability for Advanced LIGO searches.

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

Generalized hypercube graph $\\Q_n(S$, graph products and self-orthogonal codes

Directory of Open Access Journals (Sweden)

Pani Seneviratne

2016-01-01

Full Text Available A generalized hypercube graph $\\Q_n(S$ has $\\F_{2}^{n}=\\{0,1\\}^n$ as the vertex set and two vertices being adjacent whenever their mutual Hamming distance belongs to $S$, where $n \\ge 1$ and $S\\subseteq \\{1,2,\\ldots, n\\}$. The graph $\\Q_n(\\{1\\}$ is the $n$-cube, usually denoted by $\\Q_n$.We study graph boolean products $G_1 = \\Q_n(S\\times \\Q_1, G_2 = \\Q_{n}(S\\wedge \\Q_1$, $G_3 = \\Q_{n}(S[\\Q_1]$ and show that binary codes from neighborhood designs of $G_1, G_2$ and $G_3$ are self-orthogonal for all choices of $n$ and $S$. More over, we show that the class of codes $C_1$ are self-dual. Further we find subgroups of the automorphism group of these graphs and use these subgroups to obtain PD-sets for permutation decoding. As an example we find a full error-correcting PD set for the binary $[32, 16, 8]$ extremal self-dual code.

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

Massive Binary Black Holes in the Cosmic Landscape

Science.gov (United States)

Colpi, Monica; Dotti, Massimo

2011-02-01

Binary black holes occupy a special place in our quest for understanding the evolution of galaxies along cosmic history. If massive black holes grow at the center of (pre-)galactic structures that experience a sequence of merger episodes, then dual black holes form as inescapable outcome of galaxy assembly, and can in principle be detected as powerful dual quasars. But, if the black holes reach coalescence, during their inspiral inside the galaxy remnant, then they become the loudest sources of gravitational waves ever in the universe. The Laser Interferometer Space Antenna is being developed to reveal these waves that carry information on the mass and spin of these binary black holes out to very large look-back times. Nature seems to provide a pathway for the formation of these exotic binaries, and a number of key questions need to be addressed: How do massive black holes pair in a merger? Depending on the properties of the underlying galaxies, do black holes always form a close Keplerian binary? If a binary forms, does hardening proceed down to the domain controlled by gravitational wave back reaction? What is the role played by gas and/or stars in braking the black holes, and on which timescale does coalescence occur? Can the black holes accrete on flight and shine during their pathway to coalescence? After outlining key observational facts on dual/binary black holes, we review the progress made in tracing their dynamics in the habitat of a gas-rich merger down to the smallest scales ever probed with the help of powerful numerical simulations. N-Body/hydrodynamical codes have proven to be vital tools for studying their evolution, and progress in this field is expected to grow rapidly in the effort to describe, in full realism, the physics of stars and gas around the black holes, starting from the cosmological large scale of a merger. If detected in the new window provided by the upcoming gravitational wave experiments, binary black holes will provide a deep view

Full Ionisation In Binary-Binary Encounters With Small Positive Energies

Science.gov (United States)

Sweatman, W. L.

2006-08-01

Interactions between binary stars and single stars and binary stars and other binary stars play a key role in the dynamics of a dense stellar system. Energy can be transferred between the internal dynamics of a binary and the larger scale dynamics of the interacting objects. Binaries can be destroyed and created by the interaction. In a binary-binary encounter, full ionisation occurs when both of the binary stars are destroyed in the interaction to create four single stars. This is only possible when the total energy of the system is positive. For very small energies the probability of this occurring is very low and it tends towards zero as the total energy tends towards zero. Here the case is considered for which all the stars have equal masses. An asymptotic power law is predicted relating the probability of full ionisation with the total energy when this latter quantity is small. The exponent, which is approximately 2.31, is compared with the results from numerical scattering experiments. The theoretical approach taken is similar to one used previously in the three-body problem. It makes use of the fact that the most dramatic changes in scale and energies of a few-body system occur when its components pass near to a central configuration. The position, and number, of these configurations is not known for the general four-body problem, however, with equal masses there are known to be exactly five different cases. Separate consideration and comparison of the properties of orbits close to each of these five central configurations enables the prediction of the form of the cross-section for full ionisation for the case of small positive total energy. This is the relation between total energy and the probability of total ionisation described above.

CALCULATING THE HABITABLE ZONE OF BINARY STAR SYSTEMS. I. S-TYPE BINARIES

Energy Technology Data Exchange (ETDEWEB)

Kaltenegger, Lisa [MPIA, Koenigstuhl 17, D-69117 Heidelberg (Germany); Haghighipour, Nader, E-mail: kaltenegger@mpia.de [Institute for Astronomy and NASA Astrobiology Institute, University of Hawaii-Manoa, Honolulu, HI 96822 (United States)

2013-11-10

We have developed a comprehensive methodology for calculating the boundaries of the habitable zone (HZ) of planet-hosting S-type binary star systems. Our approach is general and takes into account the contribution of both stars to the location and extent of the binary HZ with different stellar spectral types. We have studied how the binary eccentricity and stellar energy distribution affect the extent of the HZ. Results indicate that in binaries where the combination of mass-ratio and orbital eccentricity allows planet formation around a star of the system to proceed successfully, the effect of a less luminous secondary on the location of the primary's HZ is generally negligible. However, when the secondary is more luminous, it can influence the extent of the HZ. We present the details of the derivations of our methodology and discuss its application to the binary HZ around the primary and secondary main-sequence stars of an FF, MM, and FM binary, as well as two known planet-hosting binaries α Cen AB and HD 196886.

CALCULATING THE HABITABLE ZONE OF BINARY STAR SYSTEMS. I. S-TYPE BINARIES

International Nuclear Information System (INIS)

Kaltenegger, Lisa; Haghighipour, Nader

2013-01-01

We have developed a comprehensive methodology for calculating the boundaries of the habitable zone (HZ) of planet-hosting S-type binary star systems. Our approach is general and takes into account the contribution of both stars to the location and extent of the binary HZ with different stellar spectral types. We have studied how the binary eccentricity and stellar energy distribution affect the extent of the HZ. Results indicate that in binaries where the combination of mass-ratio and orbital eccentricity allows planet formation around a star of the system to proceed successfully, the effect of a less luminous secondary on the location of the primary's HZ is generally negligible. However, when the secondary is more luminous, it can influence the extent of the HZ. We present the details of the derivations of our methodology and discuss its application to the binary HZ around the primary and secondary main-sequence stars of an FF, MM, and FM binary, as well as two known planet-hosting binaries α Cen AB and HD 196886

LDPC-coded orbital angular momentum (OAM) modulation for free-space optical communication.

Science.gov (United States)

Djordjevic, Ivan B; Arabaci, Murat

2010-11-22

An orbital angular momentum (OAM) based LDPC-coded modulation scheme suitable for use in FSO communication is proposed. We demonstrate that the proposed scheme can operate under strong atmospheric turbulence regime and enable 100 Gb/s optical transmission while employing 10 Gb/s components. Both binary and nonbinary LDPC-coded OAM modulations are studied. In addition to providing better BER performance, the nonbinary LDPC-coded modulation reduces overall decoder complexity and latency. The nonbinary LDPC-coded OAM modulation provides a net coding gain of 9.3 dB at the BER of 10(-8). The maximum-ratio combining scheme outperforms the corresponding equal-gain combining scheme by almost 2.5 dB.

The Effects of Single and Close Binary Evolution on the Stellar Mass Function

Science.gov (United States)

Schneider, R. N. F.; Izzard, G. R.; de Mink, S.; Langer, N., Stolte, A., de Koter, A.; Gvaramadze, V. V.; Hussmann, B.; Liermann, A.; Sana, H.

2013-06-01

Massive stars are almost exclusively born in star clusters, where stars in a cluster are expected to be born quasi-simultaneously and with the same chemical composition. The distribution of their birth masses favors lower over higher stellar masses, such that the most massive stars are rare, and the existence of an stellar upper mass limit is still debated. The majority of massive stars are born as members of close binary systems and most of them will exchange mass with a close companion during their lifetime. We explore the influence of single and binary star evolution on the high mass end of the stellar mass function using a rapid binary evolution code. We apply our results to two massive Galactic star clusters and show how the shape of their mass functions can be used to determine cluster ages and comment on the stellar upper mass limit in view of our new findings.

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.

Real-time minimal-bit-error probability decoding of convolutional codes

Science.gov (United States)

Lee, L.-N.

1974-01-01

A recursive procedure is derived for decoding of rate R = 1/n binary convolutional codes which minimizes the probability of the individual decoding decisions for each information bit, subject to the constraint that the decoding delay be limited to Delta branches. This new decoding algorithm is similar to, but somewhat more complex than, the Viterbi decoding algorithm. A real-time, i.e., fixed decoding delay, version of the Viterbi algorithm is also developed and used for comparison to the new algorithm on simulated channels. It is shown that the new algorithm offers advantages over Viterbi decoding in soft-decision applications, such as in the inner coding system for concatenated coding.

Real-time minimal bit error probability decoding of convolutional codes

Science.gov (United States)

Lee, L. N.

1973-01-01

A recursive procedure is derived for decoding of rate R=1/n binary convolutional codes which minimizes the probability of the individual decoding decisions for each information bit subject to the constraint that the decoding delay be limited to Delta branches. This new decoding algorithm is similar to, but somewhat more complex than, the Viterbi decoding algorithm. A real-time, i.e. fixed decoding delay, version of the Viterbi algorithm is also developed and used for comparison to the new algorithm on simulated channels. It is shown that the new algorithm offers advantages over Viterbi decoding in soft-decision applications such as in the inner coding system for concatenated coding.

Structured Low-Density Parity-Check Codes with Bandwidth Efficient Modulation

Science.gov (United States)

Cheng, Michael K.; Divsalar, Dariush; Duy, Stephanie

2009-01-01

In this work, we study the performance of structured Low-Density Parity-Check (LDPC) Codes together with bandwidth efficient modulations. We consider protograph-based LDPC codes that facilitate high-speed hardware implementations and have minimum distances that grow linearly with block sizes. We cover various higher- order modulations such as 8-PSK, 16-APSK, and 16-QAM. During demodulation, a demapper transforms the received in-phase and quadrature samples into reliability information that feeds the binary LDPC decoder. We will compare various low-complexity demappers and provide simulation results for assorted coded-modulation combinations on the additive white Gaussian noise and independent Rayleigh fading channels.

MESA models of the evolutionary state of the interacting binary epsilon Aurigae

Science.gov (United States)

Gibson, Justus L.; Stencel, Robert E.

2018-06-01

Using MESA code (Modules for Experiments in Stellar Astrophysics, version 9575), an evaluation was made of the evolutionary state of the epsilon Aurigae binary system (HD 31964, F0Iap + disc). We sought to satisfy several observational constraints: (1) requiring evolutionary tracks to pass close to the current temperature and luminosity of the primary star; (2) obtaining a period near the observed value of 27.1 years; (3) matching a mass function of 3.0; (4) concurrent Roche lobe overflow and mass transfer; (5) an isotopic ratio 12C/13C = 5 and, (6) matching the interferometrically determined angular diameter. A MESA model starting with binary masses of 9.85 + 4.5 M⊙, with a 100 d initial period, produces a 1.2 + 10.6 M⊙ result having a 547 d period, and a single digit 12C/13C ratio. These values were reached near an age of 20 Myr, when the donor star comes close to the observed luminosity and temperature for epsilon Aurigae A, as a post-RGB/pre-AGB star. Contemporaneously, the accretor then appears as an upper main-sequence, early B-type star. This benchmark model can provide a basis for further exploration of this interacting binary, and other long-period binary stars.

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

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

CALCULATING THE HABITABLE ZONE OF BINARY STAR SYSTEMS. II. P-TYPE BINARIES

International Nuclear Information System (INIS)

Haghighipour, Nader; Kaltenegger, Lisa

2013-01-01

We have developed a comprehensive methodology for calculating the circumbinary habitable zone (HZ) in planet-hosting P-type binary star systems. We present a general formalism for determining the contribution of each star of the binary to the total flux received at the top of the atmosphere of an Earth-like planet and use the Sun's HZ to calculate the inner and outer boundaries of the HZ around a binary star system. We apply our calculations to the Kepler's currently known circumbinary planetary systems and show the combined stellar flux that determines the boundaries of their HZs. We also show that the HZ in P-type systems is dynamic and, depending on the luminosity of the binary stars, their spectral types, and the binary eccentricity, its boundaries vary as the stars of the binary undergo their orbital motion. We present the details of our calculations and discuss the implications of the results

CALCULATING THE HABITABLE ZONE OF BINARY STAR SYSTEMS. II. P-TYPE BINARIES

Energy Technology Data Exchange (ETDEWEB)

Haghighipour, Nader [Institute for Astronomy and NASA Astrobiology Institute, University of Hawaii-Manoa, Honolulu, HI 96822 (United States); Kaltenegger, Lisa [MPIA, Koenigstuhl 17, Heidelberg, D-69117 (Germany)

2013-11-10

We have developed a comprehensive methodology for calculating the circumbinary habitable zone (HZ) in planet-hosting P-type binary star systems. We present a general formalism for determining the contribution of each star of the binary to the total flux received at the top of the atmosphere of an Earth-like planet and use the Sun's HZ to calculate the inner and outer boundaries of the HZ around a binary star system. We apply our calculations to the Kepler's currently known circumbinary planetary systems and show the combined stellar flux that determines the boundaries of their HZs. We also show that the HZ in P-type systems is dynamic and, depending on the luminosity of the binary stars, their spectral types, and the binary eccentricity, its boundaries vary as the stars of the binary undergo their orbital motion. We present the details of our calculations and discuss the implications of the results.

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.

Coded Cooperation for Multiway Relaying in Wireless Sensor Networks.

Science.gov (United States)

Si, Zhongwei; Ma, Junyang; Thobaben, Ragnar

2015-06-29

Wireless sensor networks have been considered as an enabling technology for constructing smart cities. One important feature of wireless sensor networks is that the sensor nodes collaborate in some manner for communications. In this manuscript, we focus on the model of multiway relaying with full data exchange where each user wants to transmit and receive data to and from all other users in the network. We derive the capacity region for this specific model and propose a coding strategy through coset encoding. To obtain good performance with practical codes, we choose spatially-coupled LDPC (SC-LDPC) codes for the coded cooperation. In particular, for the message broadcasting from the relay, we construct multi-edge-type (MET) SC-LDPC codes by repeatedly applying coset encoding. Due to the capacity-achieving property of the SC-LDPC codes, we prove that the capacity region can theoretically be achieved by the proposed MET SC-LDPC codes. Numerical results with finite node degrees are provided, which show that the achievable rates approach the boundary of the capacity region in both binary erasure channels and additive white Gaussian channels.

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

Reinvestigation of moving punctured black holes with a new code

International Nuclear Information System (INIS)

Cao Zhoujian; Yo Hweijang; Yu Juiping

2008-01-01

We report on our code, in which the moving puncture method is applied and an adaptive/fixed mesh refinement is implemented, and on its preliminary performance on black hole simulations. Based on the Baumgarte-Sharpiro-Shibata-Nakamura (BSSN) formulation, up-to-date gauge conditions and the modifications of the formulation are also implemented and tested. In this work, we present our primary results about the simulation of a single static black hole, of a moving single black hole, and of the head-on collision of a binary black hole system. For the static punctured black hole simulations, different modifications of the BSSN formulation are applied. It is demonstrated that both the currently used sets of modifications lead to a stable evolution. For cases of a moving punctured black hole with or without spin, we search for viable gauge conditions and study the effect of spin on the black hole evolution. Our results confirm previous results obtained by other research groups. In addition, we find a new gauge condition, which has not yet been adopted by any other researchers, which can also give stable and accurate black hole evolution calculations. We examine the performance of the code for the head-on collision of a binary black hole system, and the agreement of the gravitational waveform it produces with that obtained in other works. In order to understand qualitatively the influence of matter on the binary black hole collisions, we also investigate the same head-on collision scenarios but perturbed by a scalar field. The numerical simulations performed with this code not only give stable and accurate results that are consistent with the works by other numerical relativity groups, but also lead to the discovery of a new viable gauge condition, as well as clarify some ambiguities in the modification of the BSSN formulation. These results demonstrate that this code is reliable and ready to be used in the study of more realistic astrophysical scenarios and of numerical

Joint nonbinary low-density parity-check codes and modulation diversity over fading channels

Science.gov (United States)

Shi, Zhiping; Li, Tiffany Jing; Zhang, Zhongpei

2010-09-01

A joint exploitation of coding and diversity techniques to achieve efficient, reliable wireless transmission is considered. The system comprises a powerful non-binary low-density parity-check (LDPC) code that will be soft-decoded to supply strong error protection, a quadratic amplitude modulator (QAM) that directly takes in the non-binary LDPC symbols and a modulation diversity operator that will provide power- and bandwidth-efficient diversity gain. By relaxing the rate of the modulation diversity rotation matrices to below 1, we show that a better rate allocation can be arranged between the LDPC codes and the modulation diversity, which brings significant performance gain over previous systems. To facilitate the design and evaluation of the relaxed modulation diversity rotation matrices, based on a set of criteria, three practical design methods are given and their point pairwise error rate are analyzed. With EXIT chart, we investigate the convergence between demodulator and decoder.A rate match method is presented based on EXIT analysis. Through analysis and simulations, we show that our strategies are very effective in combating random fading and strong noise on fading channels.

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.

GPU-accelerated 3D phase-field simulations of dendrite competitive growth during directional solidification of binary alloy

International Nuclear Information System (INIS)

Sakane, S; Takaki, T; Ohno, M; Shimokawabe, T; Aoki, T

2015-01-01

Phase-field method has emerged as the most powerful numerical scheme to simulate dendrite growth. However, most phase-field simulations of dendrite growth performed so far are limited to two-dimension or single dendrite in three-dimension because of the large computational cost involved. To express actual solidification microstructures, multiple dendrites with different preferred growth directions should be computed at the same time. In this study, in order to enable large-scale phase-field dendrite growth simulations, we developed a phase-field code using multiple graphics processing units in which a quantitative phase-field method for binary alloy solidification and moving frame algorithm for directional solidification were employed. First, we performed strong and weak scaling tests for the developed parallel code. Then, dendrite competitive growth simulations in three-dimensional binary alloy bicrystal were performed and the dendrite interactions in three-dimensional space were investigated. (paper)

Fast and Accurate Prediction of Numerical Relativity Waveforms from Binary Black Hole Coalescences Using Surrogate Models.

Science.gov (United States)

Blackman, Jonathan; Field, Scott E; Galley, Chad R; Szilágyi, Béla; Scheel, Mark A; Tiglio, Manuel; Hemberger, Daniel A

2015-09-18

Simulating a binary black hole coalescence by solving Einstein's equations is computationally expensive, requiring days to months of supercomputing time. Using reduced order modeling techniques, we construct an accurate surrogate model, which is evaluated in a millisecond to a second, for numerical relativity (NR) waveforms from nonspinning binary black hole coalescences with mass ratios in [1, 10] and durations corresponding to about 15 orbits before merger. We assess the model's uncertainty and show that our modeling strategy predicts NR waveforms not used for the surrogate's training with errors nearly as small as the numerical error of the NR code. Our model includes all spherical-harmonic _{-2}Y_{ℓm} waveform modes resolved by the NR code up to ℓ=8. We compare our surrogate model to effective one body waveforms from 50M_{⊙} to 300M_{⊙} for advanced LIGO detectors and find that the surrogate is always more faithful (by at least an order of magnitude in most cases).

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…

Kinetic parameters evaluation of PWRs using static cell and core calculation codes

International Nuclear Information System (INIS)

Jahanbin, Ali; Malmir, Hessam

2012-01-01

Highlights: ► In this study, we have calculated effective delayed neutron fraction and prompt neutron lifetime in PWRs. ► New software has been developed to link the WIMS, BORGES and CITATION codes in Visual C computer programming language. ► This software is used for calculation of the kinetic parameters in a typical VVER-1000 and NOK Beznau reactor. ► The ratios ((β eff ) i )/((β eff ) core ) , which are the important input data for the reactivity accident analysis, are also calculated. - Abstract: In this paper, evaluation of the kinetic parameters (effective delayed neutron fraction and prompt neutron lifetime) in PWRs, using static cell and core calculation codes, is reported. A new software has been developed to link the WIMS, BORGES and CITATION codes in Visual C computer programming language. Using the WIMS cell calculation code, multigroup microscopic cross-sections and number densities of different materials can be generated in a binary file. By the use of BORGES code, these binary-form cross-sections and number densities are converted to a format readable by the CITATION core calculation code, by which the kinetic parameters can be finally obtained. This software is used for calculation of the kinetic parameters in a typical VVER-1000 and NOK Beznau reactor. The ratios ((β eff ) i )/((β eff ) core ) , which are the important input data for the reactivity accident analysis, are also calculated. Benchmarking of the results against the final safety analysis report (FSAR) of the aforementioned reactors shows very good agreements with these published documents.

Local equivalence, surface-code states, and matroids

International Nuclear Information System (INIS)

Sarvepalli, Pradeep; Raussendorf, Robert

2010-01-01

Recently, Ji et al. disproved the local-unitary-local Clifford (LU-LC) conjecture and showed that the local unitary (LU) and local Clifford (LC) equivalence classes of the stabilizer states are not always the same. Despite the fact that this settles the LU-LC conjecture, a sufficient condition for stabilizer states that violate the LU-LC conjecture is not known. In this paper, we investigate further the properties of stabilizer states with respect to local equivalence. Our first result shows that there exist infinitely many stabilizer states that violate the LU-LC conjecture. In particular, we show that for all numbers of qubits n≥28, there exist distance-two stabilizer states which are counterexamples to the LU-LC conjecture. We prove that, for all odd n≥195, there exist stabilizer states with distance greater than two that are LU equivalent but not LC equivalent. Two important classes of stabilizer states that are of great interest in quantum computation are the cluster states and stabilizer states of the surface codes. We show that, under some minimal restrictions, both these classes of states preclude any counterexamples. In this context, we also show that the associated surface codes do not have any encoded non-Clifford transversal gates. We characterize the Calderbank-Shor-Steane (CSS) surface-code states in terms of a class of minor closed binary matroids. In addition to making a connection to an important open problem in binary matroid theory, this characterization does in some cases provide an efficient test for CSS states that are not counterexamples.

Constructing a two bands optical code-division multiple-access network of bipolar optical access codecs using Walsh-coded liquid crystal modulators

Science.gov (United States)

Yen, Chih-Ta; Huang, Jen-Fa; Chih, Ping-En

2014-08-01

We propose and experimentally demonstrated the two bands optical code-division multiple-access (OCDMA) network over bipolar Walsh-coded liquid-crystal modulators (LCMs) and driven by green light and red light lasers. Achieving system performance depends on the construction of a decoder that implements a true bipolar correlation using only unipolar signals and intensity detection for each band. We took advantage of the phase delay characteristics of LCMs to construct a prototype optical coder/decoder (codec). Matched and unmatched Walsh signature codes were evaluated to detect correlations among multiuser data in the access network. By using LCMs, a red and green laser light source was spectrally encoded and the summed light dots were complementary decoded. Favorable contrast on auto- and cross-correlations indicates that binary information symbols can be properly recovered using a balanced photodetector.

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 M₁ = 1.22 Msun,

Fast-neutron, coded-aperture imager

Science.gov (United States)

Woolf, Richard S.; Phlips, Bernard F.; Hutcheson, Anthony L.; Wulf, Eric A.

2015-06-01

This work discusses a large-scale, coded-aperture imager for fast neutrons, building off a proof-of concept instrument developed at the U.S. Naval Research Laboratory (NRL). The Space Science Division at the NRL has a heritage of developing large-scale, mobile systems, using coded-aperture imaging, for long-range γ-ray detection and localization. The fast-neutron, coded-aperture imaging instrument, designed for a mobile unit (20 ft. ISO container), consists of a 32-element array of 15 cm×15 cm×15 cm liquid scintillation detectors (EJ-309) mounted behind a 12×12 pseudorandom coded aperture. The elements of the aperture are composed of 15 cm×15 cm×10 cm blocks of high-density polyethylene (HDPE). The arrangement of the aperture elements produces a shadow pattern on the detector array behind the mask. By measuring of the number of neutron counts per masked and unmasked detector, and with knowledge of the mask pattern, a source image can be deconvolved to obtain a 2-d location. The number of neutrons per detector was obtained by processing the fast signal from each PMT in flash digitizing electronics. Digital pulse shape discrimination (PSD) was performed to filter out the fast-neutron signal from the γ background. The prototype instrument was tested at an indoor facility at the NRL with a 1.8-μCi and 13-μCi 252Cf neutron/γ source at three standoff distances of 9, 15 and 26 m (maximum allowed in the facility) over a 15-min integration time. The imaging and detection capabilities of the instrument were tested by moving the source in half- and one-pixel increments across the image plane. We show a representative sample of the results obtained at one-pixel increments for a standoff distance of 9 m. The 1.8-μCi source was not detected at the 26-m standoff. In order to increase the sensitivity of the instrument, we reduced the fastneutron background by shielding the top, sides and back of the detector array with 10-cm-thick HDPE. This shielding configuration led

Photometric studies of two solar type marginal contact binaries in the Small Magellanic Cloud

Science.gov (United States)

Shanti Priya, Devarapalli; Rukmini, Jagirdar

2018-04-01

Using the Optical Gravitational Lensing Experiment catalogue, two contact binaries were studied using data in the V and I bands. The photometric solutions for the V and I bands are presented for two contact binaries OGLE 003835.24-735413.2 (V1) and OGLE 004619.65-725056.2 (V2) in Small Maglellanic Cloud. The presented light curves are analyzed using the Wilson-Devinney code. The results show that the variables are in good thermal and marginal geometrical contact with features like the O’Connell effect in V1. The absolute dimensions are estimated and its dynamical evolution is inferred. They tend to be solar type marginal contact binaries. The 3.6-m Devasthal Optical Telescope and the 4.0-m International Liquid Mirror Telescope of the Aryabhatta Research Institute of Observational Sciences (ARIES, Nainithal) can facilitate the continuous monitoring of such kind of objects which will help in finding the reasons behind their period changes and their impact on the evolution of the clusters.

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

Protocol vulnerability detection based on network traffic analysis and binary reverse engineering.

Science.gov (United States)

Wen, Shameng; Meng, Qingkun; Feng, Chao; Tang, Chaojing

2017-01-01

Network protocol vulnerability detection plays an important role in many domains, including protocol security analysis, application security, and network intrusion detection. In this study, by analyzing the general fuzzing method of network protocols, we propose a novel approach that combines network traffic analysis with the binary reverse engineering method. For network traffic analysis, the block-based protocol description language is introduced to construct test scripts, while the binary reverse engineering method employs the genetic algorithm with a fitness function designed to focus on code coverage. This combination leads to a substantial improvement in fuzz testing for network protocols. We build a prototype system and use it to test several real-world network protocol implementations. The experimental results show that the proposed approach detects vulnerabilities more efficiently and effectively than general fuzzing methods such as SPIKE.

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.

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

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.

A method for generating subgroup parameters from resonance tables and the SPART code

International Nuclear Information System (INIS)

Devan, K.; Mohanakrishnan, P.

1995-01-01

A method for generating subgroup or band parameters from resonance tables is described. A computer code SPART was written using this method. This code generates the subgroup parameters for any number of bands within the specified broad groups at different temperatures by reading the required input data from the binary cross section library in the Cadarache format. The results obtained with SPART code for two bands were compared with that obtained from GROUPIE code and a good agreement was obtained. Results of the generation of subgroup parameters in four bands for sample case of 239 Pu from resonance tables of Cadarache Ver.2 library is also presented. 6 refs, 2 tabs

SimCommSys: taking the errors out of error-correcting code simulations

Directory of Open Access Journals (Sweden)

Johann A. Briffa

2014-06-01

Full Text Available In this study, we present SimCommSys, a simulator of communication systems that we are releasing under an open source license. The core of the project is a set of C + + libraries defining communication system components and a distributed Monte Carlo simulator. Of principal interest is the error-control coding component, where various kinds of binary and non-binary codes are implemented, including turbo, LDPC, repeat-accumulate and Reed–Solomon. The project also contains a number of ready-to-build binaries implementing various stages of the communication system (such as the encoder and decoder, a complete simulator and a system benchmark. Finally, SimCommSys also provides a number of shell and python scripts to encapsulate routine use cases. As long as the required components are already available in SimCommSys, the user may simulate complete communication systems of their own design without any additional programming. The strict separation of development (needed only to implement new components and use (to simulate specific constructions encourages reproducibility of experimental work and reduces the likelihood of error. Following an overview of the framework, we provide some examples of how to use the framework, including the implementation of a simple codec, the specification of communication systems and their simulation.

EVOLUTION OF CATACLYSMIC VARIABLES AND RELATED BINARIES CONTAINING A WHITE DWARF

International Nuclear Information System (INIS)

Kalomeni, B.; Rappaport, S.; Molnar, M.; Nelson, L.; Quintin, J.; Yakut, K.

2016-01-01

We present a binary evolution study of cataclysmic variables (CVs) and related systems with white dwarf (WD) accretors, including for example, AM CVn systems, classical novae, supersoft X-ray sources (SXSs), and systems with giant donor stars. Our approach intentionally avoids the complications associated with population synthesis algorithms, thereby allowing us to present the first truly comprehensive exploration of all of the subsequent binary evolution pathways that zero-age CVs might follow (assuming fully non-conservative, Roche-lobe overflow onto an accreting WD) using the sophisticated binary stellar evolution code MESA. The grid consists of 56,000 initial models, including 14 WD accretor masses, 43 donor-star masses (0.1–4.7 M ⊙ ), and 100 orbital periods. We explore evolution tracks in the orbital period and donor-mass ( P orb – M don ) plane in terms of evolution dwell times, masses of the WD accretor, accretion rate, and chemical composition of the center and surface of the donor star. We report on the differences among the standard CV tracks, those with giant donor stars, and ultrashort period systems. We show where in parameter space one can expect to find SXSs, present a diagnostic to distinguish among different evolutionary paths to forming AM CVn binaries, quantify how the minimum orbital period in CVs depends on the chemical composition of the donor star, and update the P orb ( M wd ) relation for binaries containing WDs whose progenitors lost their envelopes via stable Roche-lobe overflow. Finally, we indicate where in the P orb – M don the accretion disks will tend to be stable against the thermal-viscous instability, and where gravitational radiation signatures may be found with LISA.

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

I2D: code for conversion of ISOTXS structured data to DTF and ANISN structured tables

International Nuclear Information System (INIS)

Resnik, W.M. II.

1977-06-01

The I2D code converts neutron cross-section data written in the standard interface file format called ISOTXS to a matrix structured format commonly called DTF tables. Several BCD and binary output options are available including FIDO (ANISN) format. The I2D code adheres to the guidelines established by the Committee on Computer Code Coordination for standardized code development. Since some machine dependency is inherent regardless of the degree of standardization, provisions have been made in the I2D code for easy implementation on either short-word machines (IBM) or on long-word machines (CDC). 3 figures, 5 tables

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.

The fate of close encounters between binary stars and binary supermassive black holes

Science.gov (United States)

Wang, Yi-Han; Leigh, Nathan; Yuan, Ye-Fei; Perna, Rosalba

2018-04-01

The evolution of main-sequence binaries that reside in the Galactic Centre can be heavily influenced by the central supermassive black hole (SMBH). Due to these perturbative effects, the stellar binaries in dense environments are likely to experience mergers, collisions, or ejections through secular and/or non-secular interactions. More direct interactions with the central SMBH are thought to produce hypervelocity stars (HVSs) and tidal disruption events (TDEs). In this paper, we use N-body simulations to study the dynamics of stellar binaries orbiting a central SMBH primary with an outer SMBH secondary orbiting this inner triple. The effects of the secondary SMBH on the event rates of HVSs, TDEs, and stellar mergers are investigated, as a function of the SMBH-SMBH binary mass ratio. Our numerical experiments reveal that, relative to the isolated SMBH case, the TDE and HVS rates are enhanced for, respectively, the smallest and largest mass ratio SMBH-SMBH binaries. This suggests that the observed event rates of TDEs and HVSs have the potential to serve as a diagnostic of the mass ratio of a central SMBH-SMBH binary. The presence of a secondary SMBH also allows for the creation of hypervelocity binaries. Observations of these systems could thus constrain the presence of a secondary SMBH in the Galactic Centre.

Solving a binary puzzle

NARCIS (Netherlands)

Utomo, P.H.; Makarim, R.H.

2017-01-01

A Binary puzzle is a Sudoku-like puzzle with values in each cell taken from the set {0,1} {0,1}. Let n≥4 be an even integer, a solved binary puzzle is an n×n binary array that satisfies the following conditions: (1) no three consecutive ones and no three consecutive zeros in each row and each

Test surfaces useful for calibration of surface profilometers

Science.gov (United States)

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

2013-12-31

The present invention provides for test surfaces and methods for calibration of surface profilometers, including interferometric and atomic force microscopes. Calibration is performed using a specially designed test surface, or the Binary Pseudo-random (BPR) grating (array). Utilizing the BPR grating (array) to measure the power spectral density (PSD) spectrum, the profilometer is calibrated by determining the instrumental modulation transfer.

On the calculation of the minimax-converse of the channel coding problem

OpenAIRE

Elkayam, Nir; Feder, Meir

2015-01-01

A minimax-converse has been suggested for the general channel coding problem by Polyanskiy etal. This converse comes in two flavors. The first flavor is generally used for the analysis of the coding problem with non-vanishing error probability and provides an upper bound on the rate given the error probability. The second flavor fixes the rate and provides a lower bound on the error probability. Both converses are given as a min-max optimization problem of an appropriate binary hypothesis tes...

New coding technique for computer generated holograms.

Science.gov (United States)

Haskell, R. E.; Culver, B. C.

1972-01-01

A coding technique is developed for recording computer generated holograms on a computer controlled CRT in which each resolution cell contains two beam spots of equal size and equal intensity. This provides a binary hologram in which only the position of the two dots is varied from cell to cell. The amplitude associated with each resolution cell is controlled by selectively diffracting unwanted light into a higher diffraction order. The recording of the holograms is fast and simple.

Coding Military Command as a Promiscuous Practice

DEFF Research Database (Denmark)

Ashcraft, Karen Lee; Muhr, Sara Louise

2018-01-01

by translating the vague promise of queering leadership into a tangible method distinguished by specific habits. The article formulates this analytical practice out of empirical provocations encountered by the authors: namely, a striking mismatch between their experiences in military fields and the dominant......Despite abundant scholarship addressed to gender equity in leadership, much leadership literature remains invested in gender binaries. Metaphors of leadership are especially dependent on gender oppositions, and this article treats the scholarly practice of coding leadership through gendered...... metaphor as a consequential practice of leadership unto itself. Drawing on queer theory, the article develops a mode of analysis, called ‘promiscuous coding’, conducive to disrupting the gender divisions that currently anchor most leadership metaphors. Promiscuous coding can assist leadership scholars...

Coded Cooperation for Multiway Relaying in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Zhongwei Si

2015-06-01

Full Text Available Wireless sensor networks have been considered as an enabling technology for constructing smart cities. One important feature of wireless sensor networks is that the sensor nodes collaborate in some manner for communications. In this manuscript, we focus on the model of multiway relaying with full data exchange where each user wants to transmit and receive data to and from all other users in the network. We derive the capacity region for this specific model and propose a coding strategy through coset encoding. To obtain good performance with practical codes, we choose spatially-coupled LDPC (SC-LDPC codes for the coded cooperation. In particular, for the message broadcasting from the relay, we construct multi-edge-type (MET SC-LDPC codes by repeatedly applying coset encoding. Due to the capacity-achieving property of the SC-LDPC codes, we prove that the capacity region can theoretically be achieved by the proposed MET SC-LDPC codes. Numerical results with finite node degrees are provided, which show that the achievable rates approach the boundary of the capacity region in both binary erasure channels and additive white Gaussian channels.

Protocol vulnerability detection based on network traffic analysis and binary reverse engineering.

Directory of Open Access Journals (Sweden)

Shameng Wen

Full Text Available Network protocol vulnerability detection plays an important role in many domains, including protocol security analysis, application security, and network intrusion detection. In this study, by analyzing the general fuzzing method of network protocols, we propose a novel approach that combines network traffic analysis with the binary reverse engineering method. For network traffic analysis, the block-based protocol description language is introduced to construct test scripts, while the binary reverse engineering method employs the genetic algorithm with a fitness function designed to focus on code coverage. This combination leads to a substantial improvement in fuzz testing for network protocols. We build a prototype system and use it to test several real-world network protocol implementations. The experimental results show that the proposed approach detects vulnerabilities more efficiently and effectively than general fuzzing methods such as SPIKE.

Practical low-cost visual communication using binary images for deaf sign language.

Science.gov (United States)

Manoranjan, M D; Robinson, J A

2000-03-01

Deaf sign language transmitted by video requires a temporal resolution of 8 to 10 frames/s for effective communication. Conventional videoconferencing applications, when operated over low bandwidth telephone lines, provide very low temporal resolution of pictures, of the order of less than a frame per second, resulting in jerky movement of objects. This paper presents a practical solution for sign language communication, offering adequate temporal resolution of images using moving binary sketches or cartoons, implemented on standard personal computer hardware with low-cost cameras and communicating over telephone lines. To extract cartoon points an efficient feature extraction algorithm adaptive to the global statistics of the image is proposed. To improve the subjective quality of the binary images, irreversible preprocessing techniques, such as isolated point removal and predictive filtering, are used. A simple, efficient and fast recursive temporal prefiltering scheme, using histograms of successive frames, reduces the additive and multiplicative noise from low-cost cameras. An efficient three-dimensional (3-D) compression scheme codes the binary sketches. Subjective tests performed on the system confirm that it can be used for sign language communication over telephone lines.

SGV: a code to evaluate plasma reaction rates to a specified accuracy

Energy Technology Data Exchange (ETDEWEB)

Devoto, R.S.; Hanson, J.D.

1978-09-22

A FORTRAN code to evaluate binary reaction rates (sigmav) for a plasma to a specified accuracy is described. Distribution functions permitted are (1) two Maxwellian species at different temperatures, (2) beam-Maxwellian, (3) cold gas with Maxwellian, and (4) beam-plasma with mirror distribution of the form f(v) varies as f(v) M (cos theta). Several functional forms are permitted for f(v) and M(cos theta). Cross-section subroutines for a number of interactions involving hydrogen, helium, and electrons are included, as is a routine allowing input of numerical data. The code is written as a subroutine to allow ready incorporation into larger plasma codes.

Physical Properties of the LMC Eclipsing Binary Stars

Science.gov (United States)

Prsa, Andrej; Devinney, E. J.; Guinan, E. F.; Engle, S. G.; DeGeorge, M.

2009-01-01

To date, three independent studies have devised an automatic procedure to analyse and extract the principal parameters of 2581 detached eclipsing binary stars from the OGLE photometric survey of the Large Magellanic Cloud (LMC): Devor (2005), Tamuz et al. (2006), and Prsa et al. (2008). For time efficiency, Devor used a simple model of two spherical, limb-darkened stars without tidal or reflection physics. Tamuz et al.'s approach employs a more realistic EBOP model, which is still limited in handling proximity physics. Our study used a back-propagating neural network that was trained on the light curves computed by a modern Wilson-Devinney code. The three approaches are confronted and correlations in the results are sought that indicate the degree of reliability of the obtained results. A database of solutions consistent across all three studies is presented. We assess the suitability of each method for other morphology types (i.e. semi-detached and overcontact binaries) and we overview the practical limitations of these methods for the upcoming survey data. This research is supported by NFS/RUI Grant No. AST-05-07542, which we gratefully acknowledge.

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.

EVOLUTION OF CATACLYSMIC VARIABLES AND RELATED BINARIES CONTAINING A WHITE DWARF

Energy Technology Data Exchange (ETDEWEB)

Kalomeni, B.; Rappaport, S.; Molnar, M. [Department of Physics, and Kavli Institute for Astrophysics and Space Research, Massachusetts Institute of Technology, Cambridge, MA 02139 (United States); Nelson, L. [Department of Physics, Bishop’s University, 2600 College St., Sherbrooke, Quebec, QC J1M 1Z7 (Canada); Quintin, J. [Department of Physics, McGill University, Montréal, QC H3A 2T8 (Canada); Yakut, K., E-mail: kalomeni@mit.edu, E-mail: sar@mit.edu, E-mail: momchil.molnar@gmail.com, E-mail: belinda.kalomeni@ege.edu.tr, E-mail: kadri.yakut@ege.edu.tr, E-mail: lnelson@ubishops.ca, E-mail: jquintin@physics.mcgill.ca [Department of Astronomy and Space Sciences, Ege University, 35100, İzmir (Turkey)

2016-12-10

We present a binary evolution study of cataclysmic variables (CVs) and related systems with white dwarf (WD) accretors, including for example, AM CVn systems, classical novae, supersoft X-ray sources (SXSs), and systems with giant donor stars. Our approach intentionally avoids the complications associated with population synthesis algorithms, thereby allowing us to present the first truly comprehensive exploration of all of the subsequent binary evolution pathways that zero-age CVs might follow (assuming fully non-conservative, Roche-lobe overflow onto an accreting WD) using the sophisticated binary stellar evolution code MESA. The grid consists of 56,000 initial models, including 14 WD accretor masses, 43 donor-star masses (0.1–4.7 M {sub ⊙}), and 100 orbital periods. We explore evolution tracks in the orbital period and donor-mass ( P {sub orb}– M {sub don}) plane in terms of evolution dwell times, masses of the WD accretor, accretion rate, and chemical composition of the center and surface of the donor star. We report on the differences among the standard CV tracks, those with giant donor stars, and ultrashort period systems. We show where in parameter space one can expect to find SXSs, present a diagnostic to distinguish among different evolutionary paths to forming AM CVn binaries, quantify how the minimum orbital period in CVs depends on the chemical composition of the donor star, and update the P {sub orb}( M {sub wd}) relation for binaries containing WDs whose progenitors lost their envelopes via stable Roche-lobe overflow. Finally, we indicate where in the P {sub orb}– M {sub don} the accretion disks will tend to be stable against the thermal-viscous instability, and where gravitational radiation signatures may be found with LISA.

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.

Error detecting capabilities of the shortened Hamming codes adopted for error detection in IEEE Standard 802.3

Science.gov (United States)

Fujiwara, Toru; Kasami, Tadao; Lin, Shu

1989-09-01

The error-detecting capabilities of the shortened Hamming codes adopted for error detection in IEEE Standard 802.3 are investigated. These codes are also used for error detection in the data link layer of the Ethernet, a local area network. The weight distributions for various code lengths are calculated to obtain the probability of undetectable error and that of detectable error for a binary symmetric channel with bit-error rate between 0.00001 and 1/2.

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.

Quantum-capacity-approaching codes for the detected-jump channel

International Nuclear Information System (INIS)

Grassl, Markus; Wei Zhaohui; Ji Zhengfeng; Zeng Bei

2010-01-01

The quantum-channel capacity gives the ultimate limit for the rate at which quantum data can be reliably transmitted through a noisy quantum channel. Degradable quantum channels are among the few channels whose quantum capacities are known. Given the quantum capacity of a degradable channel, it remains challenging to find a practical coding scheme which approaches capacity. Here we discuss code designs for the detected-jump channel, a degradable channel with practical relevance describing the physics of spontaneous decay of atoms with detected photon emission. We show that this channel can be used to simulate a binary classical channel with both erasures and bit flips. The capacity of the simulated classical channel gives a lower bound on the quantum capacity of the detected-jump channel. When the jump probability is small, it almost equals the quantum capacity. Hence using a classical capacity-approaching code for the simulated classical channel yields a quantum code which approaches the quantum capacity of the detected-jump channel.

Application of ART to time-coded emission tomography

International Nuclear Information System (INIS)

Koral, K.F.; Rogers, W.L.

1979-01-01

Devices for single-photon emission tomography currently take projections either in a plane over a full angular range (0-360 0 ) or in a volume with a limited angular range. The planar, pseudo-random, time-coded aperture, in conjunction with an Anger camera, is a device of the limited angular range type. It employs multiple pinholes whose transmission varies as a function of time. Previously, image reconstruction was accomplished by simple back-projection of coefficients obtained by time-correlating pinhole transmission with detector-element count rate, resulting in a low-contrast image. Using the Algebraic Reconstruction Technique (ART) a method is introduced for division of the correlation coefficients into subsets allowing the three-dimensional reconstruction to be accomplished on a minicomputer. Results from simulations and experimental phantom data show that ART improves depth resolution compared to back-projection, that under-relaxation produces better images in the case of noisy data, and that the division of the correlation coefficients into subsets has no effect on quality. The images depict the expected resolution degradation in the direction normal to the detector plane due to the limited angular range of projections but yield quantitative results whose relative values are good, even though attenuation is neglected. (author)

Information hiding technology and application analysis based on decimal expansion of irrational numbers

Science.gov (United States)

Liu, Xiaoyong; Lu, Pei; Shao, Jianxin; Cao, Haibin; Zhu, Zhenmin

2017-10-01

In this paper, an information hiding method using decimal expansion of irrational numbers to generate random phase mask is proposed. Firstly, the decimal expansion parts of irrational numbers generate pseudo-random sequences using a new coding schemed, the irrational number and start and end bit numbers were used as keys in image information hiding. Secondly, we apply the coding schemed to the double phase encoding system, the pseudo-random sequences are taken to generate random phase masks. The mean square error is used to calculate the quality of the recovered image information. Finally, two tests had been carried out to verify the security of our method; the experimental results demonstrate that the cipher image has such features, strong robustness, key sensitivity, and resistance to brute force attack.

Time variability of X-ray binaries: observations with INTEGRAL. Modeling

International Nuclear Information System (INIS)

Cabanac, Clement

2007-01-01

The exact origin of the observed X and Gamma ray variability in X-ray binaries is still an open debate in high energy astrophysics. Among others, these objects are showing aperiodic and quasi-periodic luminosity variations on timescales as small as the millisecond. This erratic behavior must put constraints on the proposed emission processes occurring in the vicinity of the neutrons star or the stellar mass black-hole held by these objects. We propose here to study their behavior following 3 different ways: first we examine the evolution of a particular X-ray source discovered by INTEGRAL, IGR J19140+0951. Using timing and spectral data given by different instruments, we show that the source type is plausibly consistent with a High Mass X-ray Binary hosting a neutrons star. Subsequently, we propose a new method dedicated to the study of timing data coming from coded mask aperture instruments. Using it on INTEGRAL/ISGRI real data, we detect the presence of periodic and quasi-periodic features in some pulsars and micro-quasars at energies as high as a hundred keV. Finally, we suggest a model designed to describe the low frequency variability of X-ray binaries in their hardest state. This model is based on thermal comptonization of soft photons by a warm corona in which a pressure wave is propagating in cylindrical geometry. By computing both numerical simulations and analytical solution, we show that this model should be suitable to describe some of the typical features observed in X-ray binaries power spectra in their hard state and their evolution such as aperiodic noise and low frequency quasi-periodic oscillations. (author) [fr

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

Preliminary study of the thermo-hydraulic behaviour of the binary breeder reactor

International Nuclear Information System (INIS)

Silveira Luz, M. da; Ferreira, W.J.

1984-06-01

Continuing the development of the Binary Breeder Reactor, its physical configuration and the advantages of differents types of spacers are analysed. In order to simulate the thermo-hydraulic behaviour and obtain data for a preliminary evaluation of the core geometry, the COBRA III C code was used to study the effects of the lenght and diameter of the fuel element, the coolant inlet temperature, the system pressure, helicoidal pitch and the pitch to diameter ratio. (Author) [pt

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.

Binary optics: Trends and limitations

Science.gov (United States)

Farn, Michael W.; Veldkamp, Wilfrid B.

1993-01-01

We describe the current state of binary optics, addressing both the technology and the industry (i.e., marketplace). With respect to the technology, the two dominant aspects are optical design methods and fabrication capabilities, with the optical design problem being limited by human innovation in the search for new applications and the fabrication issue being limited by the availability of resources required to improve fabrication capabilities. With respect to the industry, the current marketplace does not favor binary optics as a separate product line and so we expect that companies whose primary purpose is the production of binary optics will not represent the bulk of binary optics production. Rather, binary optics' more natural role is as an enabling technology - a technology which will directly result in a competitive advantage in a company's other business areas - and so we expect that the majority of binary optics will be produced for internal use.

On entanglement-assisted quantum codes achieving the entanglement-assisted Griesmer bound

Science.gov (United States)

Li, Ruihu; Li, Xueliang; Guo, Luobin

2015-12-01

The theory of entanglement-assisted quantum error-correcting codes (EAQECCs) is a generalization of the standard stabilizer formalism. Any quaternary (or binary) linear code can be used to construct EAQECCs under the entanglement-assisted (EA) formalism. We derive an EA-Griesmer bound for linear EAQECCs, which is a quantum analog of the Griesmer bound for classical codes. This EA-Griesmer bound is tighter than known bounds for EAQECCs in the literature. For a given quaternary linear code {C}, we show that the parameters of the EAQECC that EA-stabilized by the dual of {C} can be determined by a zero radical quaternary code induced from {C}, and a necessary condition under which a linear EAQECC may achieve the EA-Griesmer bound is also presented. We construct four families of optimal EAQECCs and then show the necessary condition for existence of EAQECCs is also sufficient for some low-dimensional linear EAQECCs. The four families of optimal EAQECCs are degenerate codes and go beyond earlier constructions. What is more, except four codes, our [[n,k,d_{ea};c

Monocrystal sputtering by the computer simulation code ACOCT

International Nuclear Information System (INIS)

Yamamura, Yasunori; Takeuchi, Wataru.

1987-09-01

A new computer code ACOCT has been developed in order to simulate the atomic collisions in the crystalline target within the binary collision approximation. The present code is more convenient as compared with the MARLOWE code, and takes the higher-order simultaneous collisions into account. To cheke the validity of the ACOCT program, we have calculated sputtering yields for various ion-target combinations and compared with the MARLOWE results. It is found that the calculated yields by the ACOCT program are in good agreements with those by the MARLOWE code. The ejection patterns of sputtered atoms were also calculated for the major surfaces of fcc, bcc, diamond and hcp structures, and we have got reasonable agreements with experimental results. In order to know the effects of the simultaneous collision in the slowing down process the sputtering yields and the projected ranges are calculated, changeing the parameter of the criterion for the simultaneous collision, and the effect of the simultaneous collision is found to depend on the crystal orientation. (author)

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

Fast-neutron, coded-aperture imager

International Nuclear Information System (INIS)

Woolf, Richard S.; Phlips, Bernard F.; Hutcheson, Anthony L.; Wulf, Eric A.

2015-01-01

This work discusses a large-scale, coded-aperture imager for fast neutrons, building off a proof-of concept instrument developed at the U.S. Naval Research Laboratory (NRL). The Space Science Division at the NRL has a heritage of developing large-scale, mobile systems, using coded-aperture imaging, for long-range γ-ray detection and localization. The fast-neutron, coded-aperture imaging instrument, designed for a mobile unit (20 ft. ISO container), consists of a 32-element array of 15 cm×15 cm×15 cm liquid scintillation detectors (EJ-309) mounted behind a 12×12 pseudorandom coded aperture. The elements of the aperture are composed of 15 cm×15 cm×10 cm blocks of high-density polyethylene (HDPE). The arrangement of the aperture elements produces a shadow pattern on the detector array behind the mask. By measuring of the number of neutron counts per masked and unmasked detector, and with knowledge of the mask pattern, a source image can be deconvolved to obtain a 2-d location. The number of neutrons per detector was obtained by processing the fast signal from each PMT in flash digitizing electronics. Digital pulse shape discrimination (PSD) was performed to filter out the fast-neutron signal from the γ background. The prototype instrument was tested at an indoor facility at the NRL with a 1.8-μCi and 13-μCi 252Cf neutron/γ source at three standoff distances of 9, 15 and 26 m (maximum allowed in the facility) over a 15-min integration time. The imaging and detection capabilities of the instrument were tested by moving the source in half- and one-pixel increments across the image plane. We show a representative sample of the results obtained at one-pixel increments for a standoff distance of 9 m. The 1.8-μCi source was not detected at the 26-m standoff. In order to increase the sensitivity of the instrument, we reduced the fastneutron background by shielding the top, sides and back of the detector array with 10-cm-thick HDPE. This shielding configuration led

Fast-neutron, coded-aperture imager

Energy Technology Data Exchange (ETDEWEB)

Woolf, Richard S., E-mail: richard.woolf@nrl.navy.mil; Phlips, Bernard F., E-mail: bernard.phlips@nrl.navy.mil; Hutcheson, Anthony L., E-mail: anthony.hutcheson@nrl.navy.mil; Wulf, Eric A., E-mail: eric.wulf@nrl.navy.mil

2015-06-01

This work discusses a large-scale, coded-aperture imager for fast neutrons, building off a proof-of concept instrument developed at the U.S. Naval Research Laboratory (NRL). The Space Science Division at the NRL has a heritage of developing large-scale, mobile systems, using coded-aperture imaging, for long-range γ-ray detection and localization. The fast-neutron, coded-aperture imaging instrument, designed for a mobile unit (20 ft. ISO container), consists of a 32-element array of 15 cm×15 cm×15 cm liquid scintillation detectors (EJ-309) mounted behind a 12×12 pseudorandom coded aperture. The elements of the aperture are composed of 15 cm×15 cm×10 cm blocks of high-density polyethylene (HDPE). The arrangement of the aperture elements produces a shadow pattern on the detector array behind the mask. By measuring of the number of neutron counts per masked and unmasked detector, and with knowledge of the mask pattern, a source image can be deconvolved to obtain a 2-d location. The number of neutrons per detector was obtained by processing the fast signal from each PMT in flash digitizing electronics. Digital pulse shape discrimination (PSD) was performed to filter out the fast-neutron signal from the γ background. The prototype instrument was tested at an indoor facility at the NRL with a 1.8-μCi and 13-μCi 252Cf neutron/γ source at three standoff distances of 9, 15 and 26 m (maximum allowed in the facility) over a 15-min integration time. The imaging and detection capabilities of the instrument were tested by moving the source in half- and one-pixel increments across the image plane. We show a representative sample of the results obtained at one-pixel increments for a standoff distance of 9 m. The 1.8-μCi source was not detected at the 26-m standoff. In order to increase the sensitivity of the instrument, we reduced the fastneutron background by shielding the top, sides and back of the detector array with 10-cm-thick HDPE. This shielding configuration led

Coevolution of Binaries and Circumbinary Gaseous Disks

Science.gov (United States)

Fleming, David; Quinn, Thomas R.

2018-04-01

The recent discoveries of circumbinary planets by Kepler raise questions for contemporary planet formation models. Understanding how these planets form requires characterizing their formation environment, the circumbinary protoplanetary disk, and how the disk and binary interact. The central binary excites resonances in the surrounding protoplanetary disk that drive evolution in both the binary orbital elements and in the disk. To probe how these interactions impact both binary eccentricity and disk structure evolution, we ran N-body smooth particle hydrodynamics (SPH) simulations of gaseous protoplanetary disks surrounding binaries based on Kepler 38 for 10^4 binary orbital periods for several initial binary eccentricities. We find that nearly circular binaries weakly couple to the disk via a parametric instability and excite disk eccentricity growth. Eccentric binaries strongly couple to the disk causing eccentricity growth for both the disk and binary. Disks around sufficiently eccentric binaries strongly couple to the disk and develop an m = 1 spiral wave launched from the 1:3 eccentric outer Lindblad resonance (EOLR). This wave corresponds to an alignment of gas particle longitude of periastrons. We find that in all simulations, the binary semi-major axis decays due to dissipation from the viscous disk.

BINARY CEPHEIDS: SEPARATIONS AND MASS RATIOS IN 5 M ☉ BINARIES

International Nuclear Information System (INIS)

Evans, Nancy Remage; Karovska, Margarita; Tingle, Evan; Bond, Howard E.; Schaefer, Gail H.; Mason, Brian D.

2013-01-01

Deriving the distribution of binary parameters for a particular class of stars over the full range of orbital separations usually requires the combination of results from many different observing techniques (radial velocities, interferometry, astrometry, photometry, direct imaging), each with selection biases. However, Cepheids—cool, evolved stars of ∼5 M ☉ —are a special case because ultraviolet (UV) spectra will immediately reveal any companion star hotter than early type A, regardless of the orbital separation. We have used International Ultraviolet Explorer UV spectra of a complete sample of all 76 Cepheids brighter than V = 8 to create a list of all 18 Cepheids with companions more massive than 2.0 M ☉ . Orbital periods of many of these binaries are available from radial-velocity studies, or can be estimated for longer-period systems from detected velocity variability. In an imaging survey with the Hubble Space Telescope Wide Field Camera 3, we resolved three of the companions (those of η Aql, S Nor, and V659 Cen), allowing us to make estimates of the periods out to the long-period end of the distribution. Combining these separations with orbital data in the literature, we derive an unbiased distribution of binary separations, orbital periods, and mass ratios. The distribution of orbital periods shows that the 5 M ☉ binaries have systematically shorter periods than do 1 M ☉ stars. Our data also suggest that the distribution of mass ratios depends on both binary separation and system multiplicity. The distribution of mass ratios as a function of orbital separation, however, does not depend on whether a system is a binary or a triple

Vectorial Resilient PC(l) of Order k Boolean Functions from AG-Codes

Institute of Scientific and Technical Information of China (English)

Hao CHEN; Liang MA; Jianhua LI

2011-01-01

Propagation criteria and resiliency of vectorial Boolean functions are important for cryptographic purpose (see [1- 4, 7, 8, 10, 11, 16]). Kurosawa, Stoh [8] and Carlet [1]gave a construction of Boolean functions satisfying PC(l) of order k from binary linear or nonlinear codes. In this paper, the algebraic-geometric codes over GF(2m) are used to modify the Carlet and Kurosawa-Satoh's construction for giving vectorial resilient Boolean functions satisfying PC(l) of order k criterion. This new construction is compared with previously known results.

Coded Cooperation for Multiway Relaying in Wireless Sensor Networks †

Science.gov (United States)

Si, Zhongwei; Ma, Junyang; Thobaben, Ragnar

2015-01-01

Wireless sensor networks have been considered as an enabling technology for constructing smart cities. One important feature of wireless sensor networks is that the sensor nodes collaborate in some manner for communications. In this manuscript, we focus on the model of multiway relaying with full data exchange where each user wants to transmit and receive data to and from all other users in the network. We derive the capacity region for this specific model and propose a coding strategy through coset encoding. To obtain good performance with practical codes, we choose spatially-coupled LDPC (SC-LDPC) codes for the coded cooperation. In particular, for the message broadcasting from the relay, we construct multi-edge-type (MET) SC-LDPC codes by repeatedly applying coset encoding. Due to the capacity-achieving property of the SC-LDPC codes, we prove that the capacity region can theoretically be achieved by the proposed MET SC-LDPC codes. Numerical results with finite node degrees are provided, which show that the achievable rates approach the boundary of the capacity region in both binary erasure channels and additive white Gaussian channels. PMID:26131675

CLASSIFYING X-RAY BINARIES: A PROBABILISTIC APPROACH

International Nuclear Information System (INIS)

Gopalan, Giri; Bornn, Luke; Vrtilek, Saeqa Dil

2015-01-01

In X-ray binary star systems consisting of a compact object that accretes material from an orbiting secondary star, there is no straightforward means to decide whether the compact object is a black hole or a neutron star. To assist in this process, we develop a Bayesian statistical model that makes use of the fact that X-ray binary systems appear to cluster based on their compact object type when viewed from a three-dimensional coordinate system derived from X-ray spectral data where the first coordinate is the ratio of counts in the mid- to low-energy band (color 1), the second coordinate is the ratio of counts in the high- to low-energy band (color 2), and the third coordinate is the sum of counts in all three bands. We use this model to estimate the probabilities of an X-ray binary system containing a black hole, non-pulsing neutron star, or pulsing neutron star. In particular, we utilize a latent variable model in which the latent variables follow a Gaussian process prior distribution, and hence we are able to induce the spatial correlation which we believe exists between systems of the same type. The utility of this approach is demonstrated by the accurate prediction of system types using Rossi X-ray Timing Explorer All Sky Monitor data, but it is not flawless. In particular, non-pulsing neutron systems containing “bursters” that are close to the boundary demarcating systems containing black holes tend to be classified as black hole systems. As a byproduct of our analyses, we provide the astronomer with the public R code which can be used to predict the compact object type of XRBs given training data

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.

Neptune: An astrophysical smooth particle hydrodynamics code for massively parallel computer architectures

Science.gov (United States)

Sandalski, Stou

Smooth particle hydrodynamics is an efficient method for modeling the dynamics of fluids. It is commonly used to simulate astrophysical processes such as binary mergers. We present a newly developed GPU accelerated smooth particle hydrodynamics code for astrophysical simulations. The code is named neptune after the Roman god of water. It is written in OpenMP parallelized C++ and OpenCL and includes octree based hydrodynamic and gravitational acceleration. The design relies on object-oriented methodologies in order to provide a flexible and modular framework that can be easily extended and modified by the user. Several pre-built scenarios for simulating collisions of polytropes and black-hole accretion are provided. The code is released under the MIT Open Source license and publicly available at http://code.google.com/p/neptune-sph/.

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.

Real-Coded Quantum-Inspired Genetic Algorithm-Based BP Neural Network Algorithm

Directory of Open Access Journals (Sweden)

Jianyong Liu

2015-01-01

Full Text Available The method that the real-coded quantum-inspired genetic algorithm (RQGA used to optimize the weights and threshold of BP neural network is proposed to overcome the defect that the gradient descent method makes the algorithm easily fall into local optimal value in the learning process. Quantum genetic algorithm (QGA is with good directional global optimization ability, but the conventional QGA is based on binary coding; the speed of calculation is reduced by the coding and decoding processes. So, RQGA is introduced to explore the search space, and the improved varied learning rate is adopted to train the BP neural network. Simulation test shows that the proposed algorithm is effective to rapidly converge to the solution conformed to constraint conditions.

Coding and decoding in a point-to-point communication using the polarization of the light beam.

Science.gov (United States)

Kavehvash, Z; Massoumian, F

2008-05-10

A new technique for coding and decoding of optical signals through the use of polarization is described. In this technique the concept of coding is translated to polarization. In other words, coding is done in such a way that each code represents a unique polarization. This is done by implementing a binary pattern on a spatial light modulator in such a way that the reflected light has the required polarization. Decoding is done by the detection of the received beam's polarization. By linking the concept of coding to polarization we can use each of these concepts in measuring the other one, attaining some gains. In this paper the construction of a simple point-to-point communication where coding and decoding is done through polarization will be discussed.

Binary Cepheids: Separations and Mass Ratios in 5 M ⊙ Binaries

Science.gov (United States)

Evans, Nancy Evans; Bond, Howard E.; Schaefer, Gail H.; Mason, Brian D.; Karovska, Margarita; Tingle, Evan

2013-10-01

Deriving the distribution of binary parameters for a particular class of stars over the full range of orbital separations usually requires the combination of results from many different observing techniques (radial velocities, interferometry, astrometry, photometry, direct imaging), each with selection biases. However, Cepheids—cool, evolved stars of ~5 M ⊙—are a special case because ultraviolet (UV) spectra will immediately reveal any companion star hotter than early type A, regardless of the orbital separation. We have used International Ultraviolet Explorer UV spectra of a complete sample of all 76 Cepheids brighter than V = 8 to create a list of all 18 Cepheids with companions more massive than 2.0 M ⊙. Orbital periods of many of these binaries are available from radial-velocity studies, or can be estimated for longer-period systems from detected velocity variability. In an imaging survey with the Hubble Space Telescope Wide Field Camera 3, we resolved three of the companions (those of η Aql, S Nor, and V659 Cen), allowing us to make estimates of the periods out to the long-period end of the distribution. Combining these separations with orbital data in the literature, we derive an unbiased distribution of binary separations, orbital periods, and mass ratios. The distribution of orbital periods shows that the 5 M ⊙ binaries have systematically shorter periods than do 1 M ⊙ stars. Our data also suggest that the distribution of mass ratios depends on both binary separation and system multiplicity. The distribution of mass ratios as a function of orbital separation, however, does not depend on whether a system is a binary or a triple. Based in part on observations made with the NASA/ESA Hubble Space Telescope, obtained by the Space Telescope Science Institute. STScI is operated by the Association of Universities for Research in Astronomy, Inc., under NASA contract NAS5-26555.

Massive black-hole binary inspirals: results from the LISA parameter estimation taskforce

International Nuclear Information System (INIS)

Arun, K G; Babak, Stas; Porter, Edward K; Sintes, Alicia M; Berti, Emanuele; Cutler, Curt; Cornish, Neil; Gair, Jonathan; Hughes, Scott A; Lang, Ryan N; Iyer, Bala R; Sinha, Siddhartha; Mandel, Ilya; Sathyaprakash, Bangalore S; Van Den Broeck, Chris; Trias, Miquel; Volonteri, Marta

2009-01-01

The LISA Parameter Estimation Taskforce was formed in September 2007 to provide the LISA Project with vetted codes, source distribution models and results related to parameter estimation. The Taskforce's goal is to be able to quickly calculate the impact of any mission design changes on LISA's science capabilities, based on reasonable estimates of the distribution of astrophysical sources in the universe. This paper describes our Taskforce's work on massive black-hole binaries (MBHBs). Given present uncertainties in the formation history of MBHBs, we adopt four different population models, based on (i) whether the initial black-hole seeds are small or large and (ii) whether accretion is efficient or inefficient at spinning up the holes. We compare four largely independent codes for calculating LISA's parameter-estimation capabilities. All codes are based on the Fisher-matrix approximation, but in the past they used somewhat different signal models, source parametrizations and noise curves. We show that once these differences are removed, the four codes give results in extremely close agreement with each other. Using a code that includes both spin precession and higher harmonics in the gravitational-wave signal, we carry out Monte Carlo simulations and determine the number of events that can be detected and accurately localized in our four population models.

The formation of eccentric compact binary inspirals and the role of gravitational wave emission in binary-single stellar encounters

International Nuclear Information System (INIS)

Samsing, Johan; MacLeod, Morgan; Ramirez-Ruiz, Enrico

2014-01-01

The inspiral and merger of eccentric binaries leads to gravitational waveforms distinct from those generated by circularly merging binaries. Dynamical environments can assemble binaries with high eccentricity and peak frequencies within the LIGO band. In this paper, we study binary-single stellar scatterings occurring in dense stellar systems as a source of eccentrically inspiraling binaries. Many interactions between compact binaries and single objects are characterized by chaotic resonances in which the binary-single system undergoes many exchanges before reaching a final state. During these chaotic resonances, a pair of objects has a non-negligible probability of experiencing a very close passage. Significant orbital energy and angular momentum are carried away from the system by gravitational wave (GW) radiation in these close passages, and in some cases this implies an inspiral time shorter than the orbital period of the bound third body. We derive the cross section for such dynamical inspiral outcomes through analytical arguments and through numerical scattering experiments including GW losses. We show that the cross section for dynamical inspirals grows with increasing target binary semi-major axis a and that for equal-mass binaries it scales as a 2/7 . Thus, we expect wide target binaries to predominantly contribute to the production of these relativistic outcomes. We estimate that eccentric inspirals account for approximately 1% of dynamically assembled non-eccentric merging binaries. While these events are rare, we show that binary-single scatterings are a more effective formation channel than single-single captures for the production of eccentrically inspiraling binaries, even given modest binary fractions.

An explicit harmonic code for black-hole evolution using excision

International Nuclear Information System (INIS)

Szilagyi, Bela; Pollney, Denis; Rezzolla, Luciano; Thornburg, Jonathan; Winicour, Jeffrey

2007-01-01

We describe an explicit in time, finite-difference code designed to simulate black holes by using the excision method. The code is based upon the harmonic formulation of the Einstein equations and incorporates several features regarding the well-posedness and numerical stability of the initial-boundary problem for the quasilinear wave equation. After a discussion of the equations solved and of the techniques employed, we present a series of testbeds carried out to validate the code. Such tests range from the evolution of isolated black holes to the head-on collision of two black holes and then to a binary black hole inspiral and merger. Besides assessing the accuracy of the code, the inspiral and merger test has revealed that the marginally trapped surfaces contained within the common apparent horizon of the merged black hole can touch and even intersect. This novel feature in the dynamics of the marginally trapped surfaces is unexpected but consistent with theorems on the properties of these surfaces

An explicit harmonic code for black-hole evolution using excision

Energy Technology Data Exchange (ETDEWEB)

Szilagyi, Bela [Max-Planck-Institut fuer Gravitationsphysik, Albert-Einstein-Institut, Golm (Germany); Pollney, Denis [Max-Planck-Institut fuer Gravitationsphysik, Albert-Einstein-Institut, Golm (Germany); Rezzolla, Luciano [Max-Planck-Institut fuer Gravitationsphysik, Albert-Einstein-Institut, Golm (Germany); Thornburg, Jonathan [Max-Planck-Institut fuer Gravitationsphysik, Albert-Einstein-Institut, Golm (Germany); Winicour, Jeffrey [Max-Planck-Institut fuer Gravitationsphysik, Albert-Einstein-Institut, Golm (Germany)

2007-06-21

We describe an explicit in time, finite-difference code designed to simulate black holes by using the excision method. The code is based upon the harmonic formulation of the Einstein equations and incorporates several features regarding the well-posedness and numerical stability of the initial-boundary problem for the quasilinear wave equation. After a discussion of the equations solved and of the techniques employed, we present a series of testbeds carried out to validate the code. Such tests range from the evolution of isolated black holes to the head-on collision of two black holes and then to a binary black hole inspiral and merger. Besides assessing the accuracy of the code, the inspiral and merger test has revealed that the marginally trapped surfaces contained within the common apparent horizon of the merged black hole can touch and even intersect. This novel feature in the dynamics of the marginally trapped surfaces is unexpected but consistent with theorems on the properties of these surfaces.

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.

Some properties of spectral binary stars

International Nuclear Information System (INIS)

Krajcheva, Z.T.; Popova, E.I.; Tutukov, A.V.; Yungel'son, L.R.; AN SSSR, Moscow. Astronomicheskij Sovet)

1978-01-01

Statistical investigations of spectra binary stars are carried out. Binary systems consisting of main sequence stars are considered. For 826 binary stars masses of components, ratios of component masses, semiaxes of orbits and orbital angular momenta are calculated. The distributions of these parameters and their correlations are analyzed. The dependences of statistical properties of spectral binary stars on their origin and evolution are discussed

Use of Gray code in PBIL algorithm for application in recharge of nuclear fuels; Utilização do código Gray no algoritmo PBIL para aplicação na recarga de combustíveis nucleares

Energy Technology Data Exchange (ETDEWEB)

Nast, Fernando N.; Silva, Patrick V.; Meneses, Anderson A. M., E-mail: anderson.meneses@pq.cnpq.br [Universidade Federal do Oeste do Para (UNIOESTE), Santarem, PA (Brazil). Lab. de Inteligencia Computacional; Schirru, Roberto, E-mail: schirru@lmp.ufrj.br [Coordenacao de Pos-Graduacao e Pesquisa de Engenharia (COPPE/UFRJ), Rio de Janeiro, RJ (Brazil). Lab. de Monitoracao de Processos

2017-07-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.

The in-core fuel management code system for VVER reactors

International Nuclear Information System (INIS)

Cada, R.; Krysl, V.; Mikolas, P.; Sustek, J.; Svarny, J.

2004-01-01

The structure and methodology of a fuel management system for NPP VVER 1000 (NPP Temelin) and VVER 440 (NPP Dukovany) is described. It is under development in SKODA JS a.s. and is followed by practical applications. The general objectives of the system are maximization of end of cycle reactivity, the minimization of fresh fuel inventory for the minimization of fed enrichment and minimization of burnable poisons (BPs) inventory. They are also safety related constraints in witch minimization of power peaking plays a dominant role. General structure of the system consists in preparation of input data for macrocode calculation, algorithms (codes) for optimization of fuel loading, calculation of fuel enrichment and BPs assignment. At present core loading can be calculated (optimized) by Tabu search algorithm (code ATHENA), genetic algorithm (code Gen1) and hybrid algorithm - simplex procedure with application of Tabu search algorithm on binary shuffling (code OPAL B ). Enrichment search is realized by the application of simplex algorithm (OPAL B code) and BPs assignment by module BPASS and simplex algorithm in OPAL B code. Calculations of the real core loadings are presented and a comparison of different optimization methods is provided. (author)

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.

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 classifier Classification system 7 class 1 class 2 new sample For 5-nearest neighbour classification: assign new sample to class 1. RU SASA 2010 ? Given learning task {(x1,t1),(x 2,t2),?,(x p,tp)} (xi ? Rn feature vectors, ti ? {?1,?, ?c...). 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...

Microlensing Binaries Discovered through High-magnification Channel

DEFF Research Database (Denmark)

Shin, I.-G.; Choi, J.-Y.; Park, S.-Y.

2012-01-01

Microlensing can provide a useful tool to probe binary distributions down to low-mass limits of binary companions. In this paper, we analyze the light curves of eight binary-lensing events detected through the channel of high-magnification events during the seasons from 2007 to 2010. The perturba......Microlensing can provide a useful tool to probe binary distributions down to low-mass limits of binary companions. In this paper, we analyze the light curves of eight binary-lensing events detected through the channel of high-magnification events during the seasons from 2007 to 2010...

Variable-Length Coding with Stop-Feedback for the Common-Message Broadcast Channel

DEFF Research Database (Denmark)

Trillingsgaard, Kasper Fløe; Yang, Wei; Durisi, Giuseppe

2016-01-01

This paper investigates the maximum coding rate over a K-user discrete memoryless broadcast channel for the scenario where a common message is transmitted using variable-length stop-feedback codes. Specifically, upon decoding the common message, each decoder sends a stop signal to the encoder...... of these bounds reveal that---contrary to the point-to-point case---the second-order term in the asymptotic expansion of the maximum coding rate decays inversely proportional to the square root of the average blocklength. This holds for certain nontrivial common-message broadcast channels, such as the binary......, which transmits continuously until it receives all K stop signals. We present nonasymptotic achievability and converse bounds for the maximum coding rate, which strengthen and generalize the bounds previously reported in Trillingsgaard et al. (2015) for the two-user case. An asymptotic analysis...

Performance analysis and binary working fluid selection of combined flash-binary geothermal cycle

International Nuclear Information System (INIS)

Zeyghami, Mehdi

2015-01-01

Performance of the combined flash-binary geothermal power cycle for geofluid temperatures between 150 and 250 °C is studied. A thermodynamic model is developed, and the suitable binary working fluids for different geofluid temperatures are identified from a list of thirty working fluid candidates, consisting environmental friendly refrigerants and hydrocarbons. The overall system exergy destruction and Vapor Expansion Ratio across the binary cycle turbine are selected as key performance indicators. The results show that for low-temperature heat sources using refrigerants as binary working fluids result in higher overall cycle efficiency and for medium and high-temperature resources, hydrocarbons are more suitable. For combined flash-binary cycle, secondary working fluids; R-152a, Butane and Cis-butane show the best performances at geofluid temperatures 150, 200 and 250 °C respectively. The overall second law efficiency is calculated as high as 0.48, 0.55 and 0.58 for geofluid temperatures equal 150, 200 and 250 °C respectively. The flash separator pressure found to has important effects on cycle operation and performance. Separator pressure dictates the work production share of steam and binary parts of the system. And there is an optimal separator pressure at which overall exergy destruction of the cycle achieves its minimum value. - Highlights: • Performance of the combined flash-binary geothermal cycle is investigated. • Thirty different fluids are screened to find the most suitable ORC working fluid. • Optimum cycle operation conditions presented for geofluids between 150 °C and 250 °C. • Refrigerants are more suitable for the ORC at geothermal sources temperature ≤200 °C. • Hydrocarbons are more suitable for the ORC at geothermal sources temperature >200 °C

BINARY CEPHEIDS: SEPARATIONS AND MASS RATIOS IN 5 M {sub ☉} BINARIES

Energy Technology Data Exchange (ETDEWEB)

Evans, Nancy Remage; Karovska, Margarita; Tingle, Evan [Smithsonian Astrophysical Observatory, MS 4, 60 Garden Street, Cambridge, MA 02138 (United States); Bond, Howard E. [Department of Astronomy and Astrophysics, Pennsylvania State University, University Park, PA 16802 (United States); Schaefer, Gail H. [The CHARA Array, Georgia State University, P.O. Box 3965, Atlanta, GA 30302-3965 (United States); Mason, Brian D., E-mail: nevans@cfa.harvard.edu, E-mail: heb11@psu.edu, E-mail: schaefer@chara-array.org [US Naval Observatory, 3450 Massachusetts Avenue, NW, Washington, DC 20392-5420 (United States)

2013-10-01

Deriving the distribution of binary parameters for a particular class of stars over the full range of orbital separations usually requires the combination of results from many different observing techniques (radial velocities, interferometry, astrometry, photometry, direct imaging), each with selection biases. However, Cepheids—cool, evolved stars of ∼5 M {sub ☉}—are a special case because ultraviolet (UV) spectra will immediately reveal any companion star hotter than early type A, regardless of the orbital separation. We have used International Ultraviolet Explorer UV spectra of a complete sample of all 76 Cepheids brighter than V = 8 to create a list of all 18 Cepheids with companions more massive than 2.0 M {sub ☉}. Orbital periods of many of these binaries are available from radial-velocity studies, or can be estimated for longer-period systems from detected velocity variability. In an imaging survey with the Hubble Space Telescope Wide Field Camera 3, we resolved three of the companions (those of η Aql, S Nor, and V659 Cen), allowing us to make estimates of the periods out to the long-period end of the distribution. Combining these separations with orbital data in the literature, we derive an unbiased distribution of binary separations, orbital periods, and mass ratios. The distribution of orbital periods shows that the 5 M {sub ☉} binaries have systematically shorter periods than do 1 M {sub ☉} stars. Our data also suggest that the distribution of mass ratios depends on both binary separation and system multiplicity. The distribution of mass ratios as a function of orbital separation, however, does not depend on whether a system is a binary or a triple.

Facial Expression Recognition via Non-Negative Least-Squares Sparse Coding

Directory of Open Access Journals (Sweden)

Ying Chen

2014-05-01

Full Text Available Sparse coding is an active research subject in signal processing, computer vision, and pattern recognition. A novel method of facial expression recognition via non-negative least squares (NNLS sparse coding is presented in this paper. The NNLS sparse coding is used to form a facial expression classifier. To testify the performance of the presented method, local binary patterns (LBP and the raw pixels are extracted for facial feature representation. Facial expression recognition experiments are conducted on the Japanese Female Facial Expression (JAFFE database. Compared with other widely used methods such as linear support vector machines (SVM, sparse representation-based classifier (SRC, nearest subspace classifier (NSC, K-nearest neighbor (KNN and radial basis function neural networks (RBFNN, the experiment results indicate that the presented NNLS method performs better than other used methods on facial expression recognition tasks.

Dissipative binary collisions

International Nuclear Information System (INIS)

Aboufirassi, M; Angelique, J.C.; Bizard, G.; Bougault, R.; Brou, R.; Buta, A.; Colin, J.; Cussol, D.; Durand, D.; Genoux-Lubain, A.; Horn, D.; Kerambrun, A.; Laville, J.L.; Le Brun, C.; Lecolley, J.F.; Lefebvres, F.; Lopez, O.; Louvel, M.; Meslin, C.; Metivier, V.; Nakagawa, T.; Peter, J.; Popescu, R.; Regimbart, R.; Steckmeyer, J.C.; Tamain, B.; Vient, E.; Wieloch, A.; Yuasa-Nakagawa, K.

1998-01-01

The binary character of the heavy ion collisions at intermediate energies in the exit channel has been observed under 30 MeV/n in medium and heavy systems. Measurements in light systems at energies approaching ∼ 100 MeV/nucleon as well as in very heavy systems have allowed to extend considerably the investigations of this binary process. Thus, the study of the Pb + Au system showed that the complete charge events indicated two distinct sources: the quasi-projectile and the quasi-target. The characteristics of these two sources are rather well reproduced by a trajectory computation which takes into account the Coulomb and nuclear forces and the friction appearing from the projectile-target interaction. The Wilczynski diagram is used to probe the correlation between the kinetic energy quenching and the deflecting angle. In case of the system Pb + Au at 29 MeV/nucleon the diagram indicate dissipative binary collisions typical for low energies. This binary aspect was also detected in the systems Xe + Ag at 44 MeV/nucleon, 36 Ar + 27 Al and 64 Zn + nat Ti. Thus, it was possible to reconstruct the quasi-projectile and to study its mass and excitation energy evolution as a function of the impact parameter. The dissipative binary collisions represent for the systems and energies under considerations the main contribution to the cross section. This does not implies that there are not other processes; particularly, the more or less complete fusion is also observed but with a low cross section which decreases with the increase of bombardment energy. More exclusive measurements with the INDRA detector on quasi-symmetric systems as Ar + KCl and Xe + Sn seem to confirm the importance of the binary collisions. The two source reconstruction of the Xe + Sn data at 50 MeV/nucleon reproduces the same behaviour as that observed in the system Pb + Au at 29 MeV/nucleon

Simulations of linear and Hamming codes using SageMath

Science.gov (United States)

Timur, Tahta D.; Adzkiya, Dieky; Soleha

2018-03-01

Digital data transmission over a noisy channel could distort the message being transmitted. The goal of coding theory is to ensure data integrity, that is, to find out if and where this noise has distorted the message and what the original message was. Data transmission consists of three stages: encoding, transmission, and decoding. Linear and Hamming codes are codes that we discussed in this work, where encoding algorithms are parity check and generator matrix, and decoding algorithms are nearest neighbor and syndrome. We aim to show that we can simulate these processes using SageMath software, which has built-in class of coding theory in general and linear codes in particular. First we consider the message as a binary vector of size k. This message then will be encoded to a vector with size n using given algorithms. And then a noisy channel with particular value of error probability will be created where the transmission will took place. The last task would be decoding, which will correct and revert the received message back to the original message whenever possible, that is, if the number of error occurred is smaller or equal to the correcting radius of the code. In this paper we will use two types of data for simulations, namely vector and text data.

Contact Binaries on Their Way Towards Merging

Science.gov (United States)

Gazeas, K.

2015-07-01

Contact binaries are the most frequently observed type of eclipsing star system. They are small, cool, low-mass binaries belonging to a relatively old stellar population. They follow certain empirical relationships that closely connect a number of physical parameters with each other, largely because of constraints coming from the Roche geometry. As a result, contact binaries provide an excellent test of stellar evolution, specifically for stellar merger scenarios. Observing campaigns by many authors have led to the cataloging of thousands of contact binaries and enabled statistical studies of many of their properties. A large number of contact binaries have been found to exhibit extraordinary behavior, requiring follow-up observations to study their peculiarities in detail. For example, a doubly-eclipsing quadruple system consisting of a contact binary and a detached binary is a highly constrained system offering an excellent laboratory to test evolutionary theories for binaries. A new observing project was initiated at the University of Athens in 2012 in order to investigate the possible lower limit for the orbital period of binary systems before coalescence, prior to merging.

An adjoint-based framework for maximizing mixing in binary fluids

Science.gov (United States)

Eggl, Maximilian; Schmid, Peter

2017-11-01

Mixing in the inertial, but laminar parameter regime is a common application in a wide range of industries. Enhancing the efficiency of mixing processes thus has a fundamental effect on product quality, material homogeneity and, last but not least, production costs. In this project, we address mixing efficiency in the above mentioned regime (Reynolds number Re = 1000 , Peclet number Pe = 1000) by developing and demonstrating an algorithm based on nonlinear adjoint looping that minimizes the variance of a passive scalar field which models our binary Newtonian fluids. The numerical method is based on the FLUSI code (Engels et al. 2016), a Fourier pseudo-spectral code, which we modified and augmented by scalar transport and adjoint equations. Mixing is accomplished by moving stirrers which are numerically modeled using a penalization approach. In our two-dimensional simulations we consider rotating circular and elliptic stirrers and extract optimal mixing strategies from the iterative scheme. The case of optimizing shape and rotational speed of the stirrers will be demonstrated.

Samurai project: Verifying the consistency of black-hole-binary waveforms for gravitational-wave detection

Science.gov (United States)

Hannam, Mark; Husa, Sascha; Baker, John G.; Boyle, Michael; Brügmann, Bernd; Chu, Tony; Dorband, Nils; Herrmann, Frank; Hinder, Ian; Kelly, Bernard J.; Kidder, Lawrence E.; Laguna, Pablo; Matthews, Keith D.; van Meter, James R.; Pfeiffer, Harald P.; Pollney, Denis; Reisswig, Christian; Scheel, Mark A.; Shoemaker, Deirdre

2009-04-01

We quantify the consistency of numerical-relativity black-hole-binary waveforms for use in gravitational-wave (GW) searches with current and planned ground-based detectors. We compare previously published results for the (ℓ=2,|m|=2) mode of the gravitational waves from an equal-mass nonspinning binary, calculated by five numerical codes. We focus on the 1000M (about six orbits, or 12 GW cycles) before the peak of the GW amplitude and the subsequent ringdown. We find that the phase and amplitude agree within each code’s uncertainty estimates. The mismatch between the (ℓ=2,|m|=2) modes is better than 10-3 for binary masses above 60M⊙ with respect to the Enhanced LIGO detector noise curve, and for masses above 180M⊙ with respect to Advanced LIGO, Virgo, and Advanced Virgo. Between the waveforms with the best agreement, the mismatch is below 2×10-4. We find that the waveforms would be indistinguishable in all ground-based detectors (and for the masses we consider) if detected with a signal-to-noise ratio of less than ≈14, or less than ≈25 in the best cases.

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.

Performance optimization of PM-16QAM transmission system enabled by real-time self-adaptive coding.

Science.gov (United States)

Qu, Zhen; Li, Yao; Mo, Weiyang; Yang, Mingwei; Zhu, Shengxiang; Kilper, Daniel C; Djordjevic, Ivan B

2017-10-15

We experimentally demonstrate self-adaptive coded 5×100  Gb/s WDM polarization multiplexed 16 quadrature amplitude modulation transmission over a 100 km fiber link, which is enabled by a real-time control plane. The real-time optical signal-to-noise ratio (OSNR) is measured using an optical performance monitoring device. The OSNR measurement is processed and fed back using control plane logic and messaging to the transmitter side for code adaptation, where the binary data are adaptively encoded with three types of low-density parity-check (LDPC) codes with code rates of 0.8, 0.75, and 0.7 of large girth. The total code-adaptation latency is measured to be 2273 ms. Compared with transmission without adaptation, average net capacity improvements of 102%, 36%, and 7.5% are obtained, respectively, by adaptive LDPC coding.