Pseudo-Random Number Generators
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.
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
Long period pseudo random number sequence generator
Wang, Charles C. (Inventor)
1989-01-01
A circuit for generating a sequence of pseudo random numbers, (A sub K). There is an exponentiator in GF(2 sup m) for the normal basis representation of elements in a finite field GF(2 sup m) each represented by m binary digits and having two inputs and an output from which the sequence (A sub K). Of pseudo random numbers is taken. One of the two inputs is connected to receive the outputs (E sub K) of maximal length shift register of n stages. There is a switch having a pair of inputs and an output. The switch outputs is connected to the other of the two inputs of the exponentiator. One of the switch inputs is connected for initially receiving a primitive element (A sub O) in GF(2 sup m). Finally, there is a delay circuit having an input and an output. The delay circuit output is connected to the other of the switch inputs and the delay circuit input is connected to the output of the exponentiator. Whereby after the exponentiator initially receives the primitive element (A sub O) in GF(2 sup m) through the switch, the switch can be switched to cause the exponentiator to receive as its input a delayed output A(K-1) from the exponentiator thereby generating (A sub K) continuously at the output of the exponentiator. The exponentiator in GF(2 sup m) is novel and comprises a cyclic-shift circuit; a Massey-Omura multiplier; and, a control logic circuit all operably connected together to perform the function U(sub i) = 92(sup i) (for n(sub i) = 1 or 1 (for n(subi) = 0).
Graphical analysis of some pseudo-random number generators
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...
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
A Repetition Test for Pseudo-Random Number Generators
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...
Hardware implementation of a GFSR pseudo-random number generator
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.
Generation of pseudo-random numbers
Howell, L. W.; Rheinfurth, M. H.
1982-01-01
Practical methods for generating acceptable random numbers from a variety of probability distributions which are frequently encountered in engineering applications are described. The speed, accuracy, and guarantee of statistical randomness of the various methods are discussed.
Pseudo-Random Number Generator Based on Coupled Map Lattices
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.
Chaos-based Pseudo-random Number Generation
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
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.
New Trends in Pseudo-Random Number Generation
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.
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
Accelerating Pseudo-Random Number Generator for MCNP on GPU
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.
Pseudo-random number generator for the Sigma 5 computer
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.
Pseudo random number generator based on quantum chaotic map
Akhshani, A.; Akhavan, A.; Mobaraki, A.; Lim, S.-C.; Hassan, Z.
2014-01-01
For many years dissipative quantum maps were widely used as informative models of quantum chaos. In this paper, a new scheme for generating good pseudo-random numbers (PRNG), based on quantum logistic map is proposed. Note that the PRNG merely relies on the equations used in the quantum chaotic map. The algorithm is not complex, which does not impose high requirement on computer hardware and thus computation speed is fast. In order to face the challenge of using the proposed PRNG in quantum cryptography and other practical applications, the proposed PRNG is subjected to statistical tests using well-known test suites such as NIST, DIEHARD, ENT and TestU01. The results of the statistical tests were promising, as the proposed PRNG successfully passed all these tests. Moreover, the degree of non-periodicity of the chaotic sequences of the quantum map is investigated through the Scale index technique. The obtained result shows that, the sequence is more non-periodic. From these results it can be concluded that, the new scheme can generate a high percentage of usable pseudo-random numbers for simulation and other applications in scientific computing.
Primitive polynomials selection method for pseudo-random number generator
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.
Fully Digital Chaotic Oscillators Applied to Pseudo Random Number Generation
Mansingka, Abhinav S.
2012-05-01
adapted for pseudo random number generation by truncating statistically defective bits. Finally, a novel post-processing technique using the Fibonacci series is proposed and implemented with a non-autonomous driven hyperchaotic system to provide pseudo random number generators with high nonlinear complexity and controllable period length that enables full utilization of all branches of the chaotic output as statistically secure pseudo random output.
Quantifiers for randomness of chaotic pseudo-random number generators.
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
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.
Properties making a chaotic system a good Pseudo Random Number Generator
Falcioni, Massimo; Palatella, Luigi; Pigolotti, Simone; Vulpiani, Angelo
2005-01-01
We discuss two properties making a deterministic algorithm suitable to generate a pseudo random sequence of numbers: high value of Kolmogorov-Sinai entropy and high-dimensionality. We propose the multi dimensional Anosov symplectic (cat) map as a Pseudo Random Number Generator. We show what chaotic features of this map are useful for generating Pseudo Random Numbers and investigate numerically which of them survive in the discrete version of the map. Testing and comparisons with other generat...
An empirical test of pseudo random number generators by means of an exponential decaying process
International Nuclear Information System (INIS)
Coronel B, H.F.; Hernandez M, A.R.; Jimenez M, M.A.; Mora F, L.E.
2007-01-01
Empirical tests for pseudo random number generators based on the use of processes or physical models have been successfully used and are considered as complementary to theoretical tests of randomness. In this work a statistical methodology for evaluating the quality of pseudo random number generators is presented. The method is illustrated in the context of the so-called exponential decay process, using some pseudo random number generators commonly used in physics. (Author)
a Pseudo-Random Number Generator Employing Multiple RÉNYI Maps
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.
Pseudo-random number generation using a 3-state cellular automaton
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.
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
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
High-Performance Pseudo-Random Number Generation on Graphics Processing Units
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...
Pseudo-random number generators for Monte Carlo simulations on ATI Graphics Processing Units
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.
A universal algorithm to generate pseudo-random numbers based on uniform mapping as homeomorphism
International Nuclear Information System (INIS)
Fu-Lai, Wang
2010-01-01
A specific uniform map is constructed as a homeomorphism mapping chaotic time series into [0,1] to obtain sequences of standard uniform distribution. With the uniform map, a chaotic orbit and a sequence orbit obtained are topologically equivalent to each other so the map can preserve the most dynamic properties of chaotic systems such as permutation entropy. Based on the uniform map, a universal algorithm to generate pseudo random numbers is proposed and the pseudo random series is tested to follow the standard 0–1 random distribution both theoretically and experimentally. The algorithm is not complex, which does not impose high requirement on computer hard ware and thus computation speed is fast. The method not only extends the parameter spaces but also avoids the drawback of small function space caused by constraints on chaotic maps used to generate pseudo random numbers. The algorithm can be applied to any chaotic system and can produce pseudo random sequence of high quality, thus can be a good universal pseudo random number generator. (general)
A universal algorithm to generate pseudo-random numbers based on uniform mapping as homeomorphism
Wang, Fu-Lai
2010-09-01
A specific uniform map is constructed as a homeomorphism mapping chaotic time series into [0,1] to obtain sequences of standard uniform distribution. With the uniform map, a chaotic orbit and a sequence orbit obtained are topologically equivalent to each other so the map can preserve the most dynamic properties of chaotic systems such as permutation entropy. Based on the uniform map, a universal algorithm to generate pseudo random numbers is proposed and the pseudo random series is tested to follow the standard 0-1 random distribution both theoretically and experimentally. The algorithm is not complex, which does not impose high requirement on computer hard ware and thus computation speed is fast. The method not only extends the parameter spaces but also avoids the drawback of small function space caused by constraints on chaotic maps used to generate pseudo random numbers. The algorithm can be applied to any chaotic system and can produce pseudo random sequence of high quality, thus can be a good universal pseudo random number generator.
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...
Pseudo-random-number generators and the square site percolation threshold.
Lee, Michael J
2008-09-01
Selected pseudo-random-number generators are applied to a Monte Carlo study of the two-dimensional square-lattice site percolation model. A generator suitable for high precision calculations is identified from an application specific test of randomness. After extended computation and analysis, an ostensibly reliable value of p_{c}=0.59274598(4) is obtained for the percolation threshold.
Pseudo-random number generator based on asymptotic deterministic randomness
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
Modular Transformations, Order-Chaos Transitions and Pseudo-Random Number Generation
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).
Distributed Pseudo-Random Number Generation and Its Application to Cloud Database
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...
Pseudo-random number generator based on mixing of three chaotic maps
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.
Efficient pseudo-random number generation for monte-carlo simulations using graphic processors
Mohanty, Siddhant; Mohanty, A. K.; Carminati, F.
2012-06-01
A hybrid approach based on the combination of three Tausworthe generators and one linear congruential generator for pseudo random number generation for GPU programing as suggested in NVIDIA-CUDA library has been used for MONTE-CARLO sampling. On each GPU thread, a random seed is generated on fly in a simple way using the quick and dirty algorithm where mod operation is not performed explicitly due to unsigned integer overflow. Using this hybrid generator, multivariate correlated sampling based on alias technique has been carried out using both CUDA and OpenCL languages.
Efficient pseudo-random number generation for Monte-Carlo simulations using graphic processors
International Nuclear Information System (INIS)
Mohanty, Siddhant; Mohanty, A K; Carminati, F
2012-01-01
A hybrid approach based on the combination of three Tausworthe generators and one linear congruential generator for pseudo random number generation for GPU programing as suggested in NVIDIA-CUDA library has been used for MONTE-CARLO sampling. On each GPU thread, a random seed is generated on fly in a simple way using the quick and dirty algorithm where mod operation is not performed explicitly due to unsigned integer overflow. Using this hybrid generator, multivariate correlated sampling based on alias technique has been carried out using both CUDA and OpenCL languages.
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.
ACORN—A new method for generating sequences of uniformly distributed Pseudo-random Numbers
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.
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.
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.
Security Flaws in an Efficient Pseudo-Random Number Generator for Low-Power Environments
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.
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.
Novel pseudo-random number generator based on quantum random walks
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.
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.
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.
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.
Beliakov, G.; Creighton, D.; Johnstone, M.; Wilkin, T.
2013-08-01
This paper describes an implementation of a Linear Congruential Generator (LCG) based on the binary representation of the normal number α, and of a combined generator based on that LCG. The base LCG with the modulus 333 provides a quality sequence with the period ≈3.7ṡ1015, which passes all but two statistical tests from BigCrush test suite. We improved on the original implementation by adapting Barrett's modular reduction method, which resulted in four-fold increase in efficiency. The combined generator has the period of ≈1023 and passes all tests from BigCrush suite.
International Nuclear Information System (INIS)
Chakraborty, Brahmananda
2009-01-01
Random number plays an important role in any Monte Carlo simulation. The accuracy of the results depends on the quality of the sequence of random numbers employed in the simulation. These include randomness of the random numbers, uniformity of their distribution, absence of correlation and long period. In a typical Monte Carlo simulation of particle transport in a nuclear reactor core, the history of a particle from its birth in a fission event until its death by an absorption or leakage event is tracked. The geometry of the core and the surrounding materials are exactly modeled in the simulation. To track a neutron history one needs random numbers for determining inter collision distance, nature of the collision, the direction of the scattered neutron etc. Neutrons are tracked in batches. In one batch approximately 2000-5000 neutrons are tracked. The statistical accuracy of the results of the simulation depends on the total number of particles (number of particles in one batch multiplied by the number of batches) tracked. The number of histories to be generated is usually large for a typical radiation transport problem. To track a very large number of histories one needs to generate a long sequence of independent random numbers. In other words the cycle length of the random number generator (RNG) should be more than the total number of random numbers required for simulating the given transport problem. The number of bits of the machine generally limits the cycle length. For a binary machine of p bits the maximum cycle length is 2 p . To achieve higher cycle length in the same machine one has to use either register arithmetic or bit manipulation technique
Pseudo-random bit generator based on Chebyshev map
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.
On a direct algorithm for the generation of log-normal pseudo-random numbers
Chamayou, J M F
1976-01-01
The random variable ( Pi /sub i=1//sup n/X/sub i//X/sub i+n/)/sup 1/ square root 2n/ is used to generate standard log normal variables Lambda (0, 1), where the X/sub i/ are independent uniform variables on (0, 1). (8 refs).
Energy Technology Data Exchange (ETDEWEB)
Coronel B, H.F.; Hernandez M, A.R.; Jimenez M, M.A. [Facultad de Fisica e Inteligencia Artificial, Universidad Veracruzana, A.P. 475, Xalapa, Veracruz (Mexico); Mora F, L.E. [CIMAT, A.P. 402, 36000 Guanajuato (Mexico)]. e-mail: hcoronel@uv.mx
2007-07-01
Empirical tests for pseudo random number generators based on the use of processes or physical models have been successfully used and are considered as complementary to theoretical tests of randomness. In this work a statistical methodology for evaluating the quality of pseudo random number generators is presented. The method is illustrated in the context of the so-called exponential decay process, using some pseudo random number generators commonly used in physics. (Author)
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…
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.
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
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
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.
Pseudo-random bit generator based on lag time series
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.
Implementation of a RANLUX Based Pseudo-Random Number Generator in FPGA Using VHDL and Impulse C
Agnieszka Dąbrowska-Boruch; Grzegorz Gancarczyk; Kazimierz Wiatr
2014-01-01
Monte Carlo simulations are widely used e.g. in the field of physics and molecular modelling. The main role played in these is by the high performance random number generators, such as RANLUX or MERSSENE TWISTER. In this paper the authors introduce the world's first implementation of the RANLUX algorithm on an FPGA platform for high performance computing purposes. A significant speed-up of one generator instance over 60 times, compared with a graphic card based solution, can be noticed. Compa...
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%.
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%.
Non-periodic pseudo-random numbers used in Monte Carlo calculations
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
Fully digital 1-D, 2-D and 3-D multiscroll chaos as hardware pseudo random number generators
Mansingka, Abhinav S.
2012-10-07
This paper introduces the first fully digital implementation of 1-D, 2-D and 3-D multiscroll chaos using the sawtooth nonlinearity in a 3rd order ODE with the Euler approximation. Systems indicate chaotic behaviour through phase space boundedness and positive Lyapunov exponent. Low-significance bits form a PRNG and pass all tests in the NIST SP. 800-22 suite without post-processing. Real-time control of the number of scrolls allows distinct output streams with 2-D and 3-D multiscroll chaos enabling greater controllability. The proposed PRNGs are experimentally verified on a Xilinx Virtex 4 FPGA with logic utilization less than 1.25%, throughput up to 5.25 Gbits/s and up to 512 distinct output streams with low cross-correlation.
Directory of Open Access Journals (Sweden)
Lara Ortiz-Martin
2018-01-01
Full Text Available The proliferation of wearable and implantable medical devices has given rise to an interest in developing security schemes suitable for these systems and the environment in which they operate. One area that has received much attention lately is the use of (human biological signals as the basis for biometric authentication, identification and the generation of cryptographic keys. The heart signal (e.g., as recorded in an electrocardiogram has been used by several researchers in the last few years. Specifically, the so-called Inter-Pulse Intervals (IPIs, which is the time between two consecutive heartbeats, have been repeatedly pointed out as a potentially good source of entropy and are at the core of various recent authentication protocols. In this work, we report the results of a large-scale statistical study to determine whether such an assumption is (or not upheld. For this, we have analyzed 19 public datasets of heart signals from the Physionet repository, spanning electrocardiograms from 1353 subjects sampled at different frequencies and with lengths that vary between a few minutes and several hours. We believe this is the largest dataset on this topic analyzed in the literature. We have then applied a standard battery of randomness tests to the extracted IPIs. Under the algorithms described in this paper and after analyzing these 19 public ECG datasets, our results raise doubts about the use of IPI values as a good source of randomness for cryptographic purposes. This has repercussions both in the security of some of the protocols proposed up to now and also in the design of future IPI-based schemes.
About the problem of generating three-dimensional pseudo-random points.
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.
PRIMITIVE MATRICES AND GENERATORS OF PSEUDO RANDOM SEQUENCES OF GALOIS
Directory of Open Access Journals (Sweden)
A. Beletsky
2014-04-01
Full Text Available In theory and practice of information cryptographic protection one of the key problems is the forming a binary pseudo-random sequences (PRS with a maximum length with acceptable statistical characteristics. PRS generators are usually implemented by linear shift register (LSR of maximum period with linear feedback [1]. In this paper we extend the concept of LSR, assuming that each of its rank (memory cell can be in one of the following condition. Let’s call such registers “generalized linear shift register.” The research goal is to develop algorithms for constructing Galois and Fibonacci generalized matrix of n-order over the field , which uniquely determined both the structure of corresponding generalized of n-order LSR maximal period, and formed on their basis Galois PRS generators of maximum length. Thus the article presents the questions of formation the primitive generalized Fibonacci and Galois arbitrary order matrix over the prime field . The synthesis of matrices is based on the use of irreducible polynomials of degree and primitive elements of the extended field generated by polynomial. The constructing methods of Galois and Fibonacci conjugated primitive matrices are suggested. The using possibilities of such matrices in solving the problem of constructing generalized generators of Galois pseudo-random sequences are discussed.
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
Simulation of a directed random-walk model: the effect of pseudo-random-number correlations
Shchur, L. N.; Heringa, J. R.; Blöte, H. W. J.
1996-01-01
We investigate the mechanism that leads to systematic deviations in cluster Monte Carlo simulations when correlated pseudo-random numbers are used. We present a simple model, which enables an analysis of the effects due to correlations in several types of pseudo-random-number sequences. This model provides qualitative understanding of the bias mechanism in a class of cluster Monte Carlo algorithms.
Generation of pseudo-random sequences for spread spectrum systems
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.
Pseudo-Random Sequences Generated by a Class of One-Dimensional Smooth Map
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.
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)
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.
A high-speed on-chip pseudo-random binary sequence generator for multi-tone phase calibration
Gommé, Liesbeth; Vandersteen, Gerd; Rolain, Yves
2011-07-01
An on-chip reference generator is conceived by adopting the technique of decimating a pseudo-random binary sequence (PRBS) signal in parallel sequences. This is of great benefit when high-speed generation of PRBS and PRBS-derived signals is the objective. The design implemented standard CMOS logic is available in commercial libraries to provide the logic functions for the generator. The design allows the user to select the periodicity of the PRBS and the PRBS-derived signals. The characterization of the on-chip generator marks its performance and reveals promising specifications.
A high-speed on-chip pseudo-random binary sequence generator for multi-tone phase calibration
International Nuclear Information System (INIS)
Gommé, Liesbeth; Vandersteen, Gerd; Rolain, Yves
2011-01-01
An on-chip reference generator is conceived by adopting the technique of decimating a pseudo-random binary sequence (PRBS) signal in parallel sequences. This is of great benefit when high-speed generation of PRBS and PRBS-derived signals is the objective. The design implemented standard CMOS logic is available in commercial libraries to provide the logic functions for the generator. The design allows the user to select the periodicity of the PRBS and the PRBS-derived signals. The characterization of the on-chip generator marks its performance and reveals promising specifications
Pseudo-random properties of a linear congruential generator investigated by b-adic diaphony
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.).
Pseudo Random Coins Show More Heads Than Tails
Bauke, Heiko; Mertens, Stephan
2003-01-01
Tossing a coin is the most elementary Monte Carlo experiment. In a computer the coin is replaced by a pseudo random number generator. It can be shown analytically and by exact enumerations that popular random number generators are not capable of imitating a fair coin: pseudo random coins show more heads than tails. This bias explains the empirically observed failure of some random number generators in random walk experiments. It can be traced down to the special role of the value zero in the ...
Pseudo-Random Modulation of a Laser Diode for Generating Ultrasonic Longitudinal Waves
Madaras, Eric I.; Anatasi, Robert F.
2004-01-01
Laser generated ultrasound systems have historically been more complicated and expensive than conventional piezoelectric based systems, and this fact has relegated the acceptance of laser based systems to niche applications for which piezoelectric based systems are less suitable. Lowering system costs, while improving throughput, increasing ultrasound signal levels, and improving signal-to-noise are goals which will help increase the general acceptance of laser based ultrasound. One current limitation with conventional laser generated ultrasound is a material s damage threshold limit. Increasing the optical power to generate more signal eventually damages the material being tested due to rapid, high heating. Generation limitations for laser based ultrasound suggests the use of pulse modulation techniques as an alternate generation method. Pulse modulation techniques can spread the laser energy over time or space, thus reducing laser power densities and minimizing damage. Previous experiments by various organizations using spatial or temporal pulse modulation have been shown to generate detectable surface, plate, and bulk ultrasonic waves with narrow frequency bandwidths . Using narrow frequency bandwidths improved signal detectability, but required the use of expensive and powerful lasers and opto-electronic systems. The use of a laser diode to generate ultrasound is attractive because of its low cost, small size, light weight, simple optics and modulation capability. The use of pulse compression techniques should allow certain types of laser diodes to produce usable ultrasonic signals. The method also does not need to be limited to narrow frequency bandwidths. The method demonstrated here uses a low power laser diode (approximately 150 mW) that is modulated by controlling the diode s drive current and the resulting signal is recovered by cross correlation. A potential application for this system which is briefly demonstrated is in detecting signals in thick
Cryptography, statistics and pseudo-randomness (Part 1)
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
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)
Quantum random number generator
Soubusta, Jan; Haderka, Ondrej; Hendrych, Martin
2001-03-01
Since reflection or transmission of a quantum particle on a beamsplitter is inherently random quantum process, a device built on this principle does not suffer from drawbacks of neither pseudo-random computer generators or classical noise sources. Nevertheless, a number of physical conditions necessary for high quality random numbers generation must be satisfied. Luckily, in quantum optics realization they can be well controlled. We present an easy random number generator based on the division of weak light pulses on a beamsplitter. The randomness of the generated bit stream is supported by passing the data through series of 15 statistical test. The device generates at a rate of 109.7 kbit/s.
Evidence of significant bias in an elementary random number generator
International Nuclear Information System (INIS)
Borgwaldt, H.; Brandl, V.
1981-03-01
An elementary pseudo random number generator for isotropically distributed unit vectors in 3-dimensional space has ben tested for bias. This generator uses the IBM-suplied routine RANDU and a transparent rejection technique. The tests show clearly that non-randomness in the pseudo random numbers generated by the primary IBM generator leads to bias in the order of 1 percent in estimates obtained from the secondary random number generator. FORTRAN listings of 4 variants of the random number generator called by a simple test programme and output listings are included for direct reference. (orig.) [de
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
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.
Pseudo random signal processing theory and application
Zepernick, Hans-Jurgen
2013-01-01
In recent years, pseudo random signal processing has proven to be a critical enabler of modern communication, information, security and measurement systems. The signal's pseudo random, noise-like properties make it vitally important as a tool for protecting against interference, alleviating multipath propagation and allowing the potential of sharing bandwidth with other users. Taking a practical approach to the topic, this text provides a comprehensive and systematic guide to understanding and using pseudo random signals. Covering theoretical principles, design methodologies and applications
The MIXMAX random number generator
Savvidy, Konstantin G.
2015-11-01
In this paper, we study the randomness properties of unimodular matrix random number generators. Under well-known conditions, these discrete-time dynamical systems have the highly desirable K-mixing properties which guarantee high quality random numbers. It is found that some widely used random number generators have poor Kolmogorov entropy and consequently fail in empirical tests of randomness. These tests show that the lowest acceptable value of the Kolmogorov entropy is around 50. Next, we provide a solution to the problem of determining the maximal period of unimodular matrix generators of pseudo-random numbers. We formulate the necessary and sufficient condition to attain the maximum period and present a family of specific generators in the MIXMAX family with superior performance and excellent statistical properties. Finally, we construct three efficient algorithms for operations with the MIXMAX matrix which is a multi-dimensional generalization of the famous cat-map. First, allowing to compute the multiplication by the MIXMAX matrix with O(N) operations. Second, to recursively compute its characteristic polynomial with O(N2) operations, and third, to apply skips of large number of steps S to the sequence in O(N2 log(S)) operations.
Protocols for data hiding in pseudo-random state
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.
Parallel random number generator for inexpensive configurable hardware cells
Ackermann, J.; Tangen, U.; Bödekker, B.; Breyer, J.; Stoll, E.; McCaskill, J. S.
2001-11-01
A new random number generator ( RNG) adapted to parallel processors has been created. This RNG can be implemented with inexpensive hardware cells. The correlation between neighboring cells is suppressed with smart connections. With such connection structures, sequences of pseudo-random numbers are produced. Numerical tests including a self-avoiding random walk test and the simulation of the order parameter and energy of the 2D Ising model give no evidence for correlation in the pseudo-random sequences. Because the new random number generator has suppressed the correlation between neighboring cells which is usually observed in cellular automaton implementations, it is applicable for extended time simulations. It gives an immense speed-up factor if implemented directly in configurable hardware, and has recently been used for long time simulations of spatially resolved molecular evolution.
Fully digital 1-D, 2-D and 3-D multiscroll chaos as hardware pseudo random number generators
Mansingka, Abhinav S.; Radwan, Ahmed Gomaa; Salama, Khaled N.
2012-01-01
This paper introduces the first fully digital implementation of 1-D, 2-D and 3-D multiscroll chaos using the sawtooth nonlinearity in a 3rd order ODE with the Euler approximation. Systems indicate chaotic behaviour through phase space boundedness
An integrable low-cost hardware random number generator
Ranasinghe, Damith C.; Lim, Daihyun; Devadas, Srinivas; Jamali, Behnam; Zhu, Zheng; Cole, Peter H.
2005-02-01
A hardware random number generator is different from a pseudo-random number generator; a pseudo-random number generator approximates the assumed behavior of a real hardware random number generator. Simple pseudo random number generators suffices for most applications, however for demanding situations such as the generation of cryptographic keys, requires an efficient and a cost effective source of random numbers. Arbiter-based Physical Unclonable Functions (PUFs) proposed for physical authentication of ICs exploits statistical delay variation of wires and transistors across integrated circuits, as a result of process variations, to build a secret key unique to each IC. Experimental results and theoretical studies show that a sufficient amount of variation exits across IC"s. This variation enables each IC to be identified securely. It is possible to exploit the unreliability of these PUF responses to build a physical random number generator. There exists measurement noise, which comes from the instability of an arbiter when it is in a racing condition. There exist challenges whose responses are unpredictable. Without environmental variations, the responses of these challenges are random in repeated measurements. Compared to other physical random number generators, the PUF-based random number generators can be a compact and a low-power solution since the generator need only be turned on when required. A 64-stage PUF circuit costs less than 1000 gates and the circuit can be implemented using a standard IC manufacturing processes. In this paper we have presented a fast and an efficient random number generator, and analysed the quality of random numbers produced using an array of tests used by the National Institute of Standards and Technology to evaluate the randomness of random number generators designed for cryptographic applications.
On the Periods of the {ranshi} Random Number Generator
Gutbrod, F.
The stochastic properties of the pseudo-random number generator {ranshi} are discussed, with emphasis on the average period. Within a factor 2 this turns out to be the root of the maximally possible period. The actual set of periods depends on minor details of the algorithm, and the system settles down in one of only a few different cycles. These features are in perfect agreement with absolute random motion in phase space, to the extent allowed by deterministic dynamics.
Stream cipher based on pseudorandom number generation using optical affine transformation
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.
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.
A fast random number generator for the Intel Paragon supercomputer
Gutbrod, F.
1995-06-01
A pseudo-random number generator is presented which makes optimal use of the architecture of the i860-microprocessor and which is expected to have a very long period. It is therefore a good candidate for use on the parallel supercomputer Paragon XP. In the assembler version, it needs 6.4 cycles for a real∗4 random number. There is a FORTRAN routine which yields identical numbers up to rare and minor rounding discrepancies, and it needs 28 cycles. The FORTRAN performance on other microprocessors is somewhat better. Arguments for the quality of the generator and some numerical tests are given.
Improving the pseudo-randomness properties of chaotic maps using deep-zoom
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.
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)
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)
Testing random number generators for Monte Carlo applications
International Nuclear Information System (INIS)
Sim, L.H.
1992-01-01
Central to any system for modelling radiation transport phenomena using Monte Carlo techniques is the method by which pseudo random numbers are generated. This method is commonly referred to as the Random Number Generator (RNG). It is usually a computer implemented mathematical algorithm which produces a series of numbers uniformly distributed on the interval [0,1]. If this series satisfies certain statistical tests for randomness, then for practical purposes the pseudo random numbers in the series can be considered to be random. Tests of this nature are important not only for new RNGs but also to test the implementation of known RNG algorithms in different computer environments. Six RNGs have been tested using six statistical tests and one visual test. The statistical tests are the moments, frequency (digit and number), serial, gap, and poker tests. The visual test is a simple two dimensional ordered pair display. In addition the RNGs have been tested in a specific Monte Carlo application. This type of test is often overlooked, however it is important that in addition to satisfactory performance in statistical tests, the RNG be able to perform effectively in the applications of interest. The RNGs tested here are based on a variety of algorithms, including multiplicative and linear congruential, lagged Fibonacci, and combination arithmetic and lagged Fibonacci. The effect of the Bays-Durham shuffling algorithm on the output of a known bad RNG has also been investigated. 18 refs., 11 tabs., 4 figs. of
Generating random numbers by means of nonlinear dynamic systems
Zang, Jiaqi; Hu, Haojie; Zhong, Juhua; Luo, Duanbin; Fang, Yi
2018-07-01
To introduce the randomness of a physical process to students, a chaotic pendulum experiment was opened in East China University of Science and Technology (ECUST) on the undergraduate level in the physics department. It was shown chaotic motion could be initiated through adjusting the operation of a chaotic pendulum. By using the data of the angular displacements of chaotic motion, random binary numerical arrays can be generated. To check the randomness of generated numerical arrays, the NIST Special Publication 800-20 method was adopted. As a result, it was found that all the random arrays which were generated by the chaotic motion could pass the validity criteria and some of them were even better than the quality of pseudo-random numbers generated by a computer. Through the experiments, it is demonstrated that chaotic pendulum can be used as an efficient mechanical facility in generating random numbers, and can be applied in teaching random motion to the students.
Random number generators tested on quantum Monte Carlo simulations.
Hongo, Kenta; Maezono, Ryo; Miura, Kenichi
2010-08-01
We have tested and compared several (pseudo) random number generators (RNGs) applied to a practical application, ground state energy calculations of molecules using variational and diffusion Monte Carlo metheds. A new multiple recursive generator with 8th-order recursion (MRG8) and the Mersenne twister generator (MT19937) are tested and compared with the RANLUX generator with five luxury levels (RANLUX-[0-4]). Both MRG8 and MT19937 are proven to give the same total energy as that evaluated with RANLUX-4 (highest luxury level) within the statistical error bars with less computational cost to generate the sequence. We also tested the notorious implementation of linear congruential generator (LCG), RANDU, for comparison. (c) 2010 Wiley Periodicals, Inc.
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)
Quantum random number generator
Pooser, Raphael C.
2016-05-10
A quantum random number generator (QRNG) and a photon generator for a QRNG are provided. The photon generator may be operated in a spontaneous mode below a lasing threshold to emit photons. Photons emitted from the photon generator may have at least one random characteristic, which may be monitored by the QRNG to generate a random number. In one embodiment, the photon generator may include a photon emitter and an amplifier coupled to the photon emitter. The amplifier may enable the photon generator to be used in the QRNG without introducing significant bias in the random number and may enable multiplexing of multiple random numbers. The amplifier may also desensitize the photon generator to fluctuations in power supplied thereto while operating in the spontaneous mode. In one embodiment, the photon emitter and amplifier may be a tapered diode amplifier.
Uniform random number generators
Farr, W. R.
1971-01-01
Methods are presented for the generation of random numbers with uniform and normal distributions. Subprogram listings of Fortran generators for the Univac 1108, SDS 930, and CDC 3200 digital computers are also included. The generators are of the mixed multiplicative type, and the mathematical method employed is that of Marsaglia and Bray.
Characterization of electron microscopes with binary pseudo-random multilayer test samples
Yashchuk, Valeriy V.; Conley, Raymond; Anderson, Erik H.; Barber, Samuel K.; Bouet, Nathalie; McKinney, Wayne R.; Takacs, Peter Z.; Voronov, Dmitriy L.
2011-09-01
Verification of the reliability of metrology data from high quality X-ray optics requires that adequate methods for test and calibration of the instruments be developed. For such verification for optical surface profilometers in the spatial frequency domain, a modulation transfer function (MTF) calibration method based on binary pseudo-random (BPR) gratings and arrays has been suggested [1,2] and proven to be an effective calibration method for a number of interferometric microscopes, a phase shifting Fizeau interferometer, and a scatterometer [5]. Here we describe the details of development of binary pseudo-random multilayer (BPRML) test samples suitable for characterization of scanning (SEM) and transmission (TEM) electron microscopes. We discuss the results of TEM measurements with the BPRML test samples fabricated from a WiSi 2/Si multilayer coating with pseudo-randomly distributed layers. In particular, we demonstrate that significant information about the metrological reliability of the TEM measurements can be extracted even when the fundamental frequency of the BPRML sample is smaller than the Nyquist frequency of the measurements. The measurements demonstrate a number of problems related to the interpretation of the SEM and TEM data. Note that similar BPRML test samples can be used to characterize X-ray microscopes. Corresponding work with X-ray microscopes is in progress.
Characterization of electron microscopes with binary pseudo-random multilayer test samples
International Nuclear Information System (INIS)
Yashchuk, Valeriy V.; Conley, Raymond; Anderson, Erik H.; Barber, Samuel K.; Bouet, Nathalie; McKinney, Wayne R.; Takacs, Peter Z.; Voronov, Dmitriy L.
2011-01-01
Verification of the reliability of metrology data from high quality X-ray optics requires that adequate methods for test and calibration of the instruments be developed. For such verification for optical surface profilometers in the spatial frequency domain, a modulation transfer function (MTF) calibration method based on binary pseudo-random (BPR) gratings and arrays has been suggested and proven to be an effective calibration method for a number of interferometric microscopes, a phase shifting Fizeau interferometer, and a scatterometer [5]. Here we describe the details of development of binary pseudo-random multilayer (BPRML) test samples suitable for characterization of scanning (SEM) and transmission (TEM) electron microscopes. We discuss the results of TEM measurements with the BPRML test samples fabricated from a WiSi 2 /Si multilayer coating with pseudo-randomly distributed layers. In particular, we demonstrate that significant information about the metrological reliability of the TEM measurements can be extracted even when the fundamental frequency of the BPRML sample is smaller than the Nyquist frequency of the measurements. The measurements demonstrate a number of problems related to the interpretation of the SEM and TEM data. Note that similar BPRML test samples can be used to characterize X-ray microscopes. Corresponding work with X-ray microscopes is in progress.
Lensless digital holography with diffuse illumination through a pseudo-random phase mask.
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.
International Nuclear Information System (INIS)
Coveyou, R.R.
1974-01-01
The subject of random number generation is currently controversial. Differing opinions on this subject seem to stem from implicit or explicit differences in philosophy; in particular, from differing ideas concerning the role of probability in the real world of physical processes, electronic computers, and Monte Carlo calculations. An attempt is made here to reconcile these views. The role of stochastic ideas in mathematical models is discussed. In illustration of these ideas, a mathematical model of the use of random number generators in Monte Carlo calculations is constructed. This model is used to set up criteria for the comparison and evaluation of random number generators. (U.S.)
International Nuclear Information System (INIS)
Chugunkov, I.V.
2014-01-01
The report contains the description of an approach based on calculation of missing sets quantity, which allows to reduce memory usage needed for implementation of statistical tests. Information about estimation procedure of test statistics derived as a result of using this approach is also provided [ru
Scope of Various Random Number Generators in ant System Approach for TSP
Sen, S. K.; Shaykhian, Gholam Ali
2007-01-01
Experimented on heuristic, based on an ant system approach for traveling salesman problem, are several quasi- and pseudo-random number generators. This experiment is to explore if any particular generator is most desirable. Such an experiment on large samples has the potential to rank the performance of the generators for the foregoing heuristic. This is mainly to seek an answer to the controversial issue "which generator is the best in terms of quality of the result (accuracy) as well as cost of producing the result (time/computational complexity) in a probabilistic/statistical sense."
EPCGen2 Pseudorandom Number Generators: Analysis of J3Gen
Directory of Open Access Journals (Sweden)
Alberto Peinado
2014-04-01
Full Text Available This paper analyzes the cryptographic security of J3Gen, a promising pseudo random number generator for low-cost passive Radio Frequency Identification (RFID tags. Although J3Gen has been shown to fulfill the randomness criteria set by the EPCglobal Gen2 standard and is intended for security applications, we describe here two cryptanalytic attacks that question its security claims: (i a probabilistic attack based on solving linear equation systems; and (ii a deterministic attack based on the decimation of the output sequence. Numerical results, supported by simulations, show that for the specific recommended values of the configurable parameters, a low number of intercepted output bits are enough to break J3Gen. We then make some recommendations that address these issues.
Pseudo-random tool paths for CNC sub-aperture polishing and other applications.
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.
Fast random-number generation using a diode laser's frequency noise characteristic
Takamori, Hiroki; Doi, Kohei; Maehara, Shinya; Kawakami, Kohei; Sato, Takashi; Ohkawa, Masashi; Ohdaira, Yasuo
2012-02-01
Random numbers can be classified as either pseudo- or physical-random, in character. Pseudo-random numbers are generated by definite periodicity, so, their usefulness in cryptographic applications is somewhat limited. On the other hand, naturally-generated physical-random numbers have no calculable periodicity, thereby making them ideal for the task. Diode lasers' considerable wideband noise gives them tremendous capacity for generating physical-random numbers, at a high rate of speed. We measured a diode laser's output with a fast photo detector, and evaluated the binary-numbers from the diode laser's frequency noise characteristics. We then identified and evaluated the binary-number-line's statistical properties. We also investigate the possibility that much faster physical-random number parallel-generation is possible, using separate outputs of different optical-path length and character, which we refer to as "coherence collapse".
Super fast physical-random number generation using laser diode frequency noises
Ushiki, Tetsuro; Doi, Kohei; Maehara, Shinya; Sato, Takashi; Ohkawa, Masashi; Ohdaira, Yasuo
2011-02-01
Random numbers can be classified as either pseudo- or physical-random in character. Pseudo-random numbers' periodicity renders them inappropriate for use in cryptographic applications, but naturally-generated physical-random numbers have no calculable periodicity, thereby making them ideally-suited to the task. The laser diode naturally produces a wideband "noise" signal that is believed to have tremendous capacity and great promise, for the rapid generation of physical-random numbers for use in cryptographic applications. We measured a laser diode's output, at a fast photo detector and generated physical-random numbers from frequency noises. We then identified and evaluated the binary-number-line's statistical properties. The result shows that physical-random number generation, at speeds as high as 40Gbps, is obtainable, using the laser diode's frequency noise characteristic.
A true random number generator based on mouse movement and chaotic cryptography
International Nuclear Information System (INIS)
Hu Yue; Liao Xiaofeng; Wong, Kwok-wo; Zhou Qing
2009-01-01
True random number generators are in general more secure than pseudo random number generators. In this paper, we propose a novel true random number generator which generates a 256-bit random number by computer mouse movement. It is cheap, convenient and universal for personal computers. To eliminate the effect of similar movement patterns generated by the same user, three chaos-based approaches, namely, discretized 2D chaotic map permutation, spatiotemporal chaos and 'MASK' algorithm, are adopted to post-process the captured mouse movements. Random bits generated by three users are tested using NIST statistical tests. Both the spatiotemporal chaos approach and the 'MASK' algorithm pass the tests successfully. However, the latter has a better performance in terms of efficiency and effectiveness and so is more practical for common personal computer applications.
Random Numbers and Quantum Computers
McCartney, Mark; Glass, David
2002-01-01
The topic of random numbers is investigated in such a way as to illustrate links between mathematics, physics and computer science. First, the generation of random numbers by a classical computer using the linear congruential generator and logistic map is considered. It is noted that these procedures yield only pseudo-random numbers since…
Hornfeck, W.; Harbrecht, B.
2009-11-01
An analysis of certain types of multiplicative congruential generators - otherwise known for their application to the sequential generation of pseudo-random numbers - reveals their relation to lattice-sublattice transformations and the coordinate description of crystal structures.
The additive congruential random number generator--A special case of a multiple recursive generator
Wikramaratna, Roy S.
2008-07-01
This paper considers an approach to generating uniformly distributed pseudo-random numbers which works well in serial applications but which also appears particularly well-suited for application on parallel processing systems. Additive Congruential Random Number (ACORN) generators are straightforward to implement for arbitrarily large order and modulus; if implemented using integer arithmetic, it becomes possible to generate identical sequences on any machine. Previously published theoretical analysis has demonstrated that a kth order ACORN sequence approximates to being uniformly distributed in up to k dimensions, for any given k. ACORN generators can be constructed to give period lengths exceeding any given number (for example, with period length in excess of 230p, for any given p). Results of empirical tests have demonstrated that, if p is greater than or equal to 2, then the ACORN generator can be used successfully for generating double precision uniform random variates. This paper demonstrates that an ACORN generator is a particular case of a multiple recursive generator (and, therefore, also a special case of a matrix generator). Both these latter approaches have been widely studied, and it is to be hoped that the results given in the present paper will lead to greater confidence in using the ACORN generators.
Search for a perfect generator of random numbers
International Nuclear Information System (INIS)
Musyck, E.
1977-01-01
Theoretical tests have been carried out by COVEYOU and MAC PHERSON to verify the applications of the LEHMER algorithm. In a similar way, a theoretical method is proposed to evaluate in a rigorous way the random character of numbers generated by a shift register. This theory introduces the concept of ''degree of randomness'' of the elements, taken in a definite order, of a shift register. It permits making the judicious choice of the elements of the shift register which will produce the bits of the random numbers. On the other hand, a calculation method is developed in order to verify the primitive character of any shift register of high complexity. A new test, called ''slice test'', of empirical and theoretical use is also described; it constitutes a significant contribution to the understanding of certain properties of pseudo-random sequences. As a practical example, a random number generator structure formed with 32 bits, built out of a shift register with 61 elements and 60 modulo-2 adder circuits was made. The author is convinced that this generator can be considered to be practically perfect for all empirical applications of random numbers, particularly for the solution of Monte-Carlo problems. (author)
Variate generation for probabilistic fracture mechanics and fitness-for-service studies
International Nuclear Information System (INIS)
Walker, J.R.
1987-01-01
Atomic Energy of Canada Limited is conducting studies in Probabilistic Fracture Mechanics. These studies are being conducted as part of a fitness-for-service programme in support of CANDU reactors. The Monte Carlo analyses, which form part of the Probabilistic Fracture Mechanics studies, require that variates can be sampled from probability density functions. Accurate pseudo-random numbers are necessary for accurate variate generation. This report details the principles of variate generation, and describes the production and testing of pseudo-random numbers. A new algorithm has been produced for the correct performance of the lattice test for the independence of pseudo-random numbers. Two new pseudo-random number generators have been produced. These generators have excellent randomness properties and can be made fully machine-independent. Versions, in FORTRAN, for VAX and CDC computers are given. Accurate and efficient algorithms for the generation of variates from the specialized probability density functions of Probabilistic Fracture Mechanics are given. 38 refs
Ossola, Giovanni; Sokal, Alan D
2004-08-01
We show that linear congruential pseudo-random-number generators can cause systematic errors in Monte Carlo simulations using the Swendsen-Wang algorithm, if the lattice size is a multiple of a very large power of 2 and one random number is used per bond. These systematic errors arise from correlations within a single bond-update half-sweep. The errors can be eliminated (or at least radically reduced) by updating the bonds in a random order or in an aperiodic manner. It also helps to use a generator of large modulus (e.g., 60 or more bits).
Cellular Automata-Based Parallel Random Number Generators Using FPGAs
Directory of Open Access Journals (Sweden)
David H. K. Hoe
2012-01-01
Full Text Available Cellular computing represents a new paradigm for implementing high-speed massively parallel machines. Cellular automata (CA, which consist of an array of locally connected processing elements, are a basic form of a cellular-based architecture. The use of field programmable gate arrays (FPGAs for implementing CA accelerators has shown promising results. This paper investigates the design of CA-based pseudo-random number generators (PRNGs using an FPGA platform. To improve the quality of the random numbers that are generated, the basic CA structure is enhanced in two ways. First, the addition of a superrule to each CA cell is considered. The resulting self-programmable CA (SPCA uses the superrule to determine when to make a dynamic rule change in each CA cell. The superrule takes its inputs from neighboring cells and can be considered itself a second CA working in parallel with the main CA. When implemented on an FPGA, the use of lookup tables in each logic cell removes any restrictions on how the super-rules should be defined. Second, a hybrid configuration is formed by combining a CA with a linear feedback shift register (LFSR. This is advantageous for FPGA designs due to the compactness of the LFSR implementations. A standard software package for statistically evaluating the quality of random number sequences known as Diehard is used to validate the results. Both the SPCA and the hybrid CA/LFSR were found to pass all the Diehard tests.
Random number generators in support of Monte Carlo problems in physics
International Nuclear Information System (INIS)
Dyadkin, I.G.
1993-01-01
The ability to support a modern users' expectations of random number generators to solve problems in physics is analyzed. The capabilities of the newest concepts and the old pseudo-random algorithms are compared. The author is in favor of multiplicative generators. Due to the 64-bit arithmetic of a modern PC, multiplicative generators have a sufficient number of periods (up to 2 62 ) and are quicker to generate and to govern independent sequences for parallel processing. In addition they are able to replicate sub-sequences (without storing their seeds) for each standard trial in any code and to simulate spatial and planar directions and EXP(-x) distributions often needed as ''bricks'' for simulating events in physics. Hundreds of multipliers for multiplicative generators have been tabulated and tested, and the required speeds have been obtained. (author)
Covert Communication in MIMO-OFDM System Using Pseudo Random Location of Fake Subcarriers
Directory of Open Access Journals (Sweden)
Rizky Pratama Hudhajanto
2016-08-01
Full Text Available Multiple-Input Multiple-Output Orthogonal Frequency Division Multiplexing (MIMO-OFDM is the most used wireless transmission scheme in the world. However, its security is the interesting problem to discuss if we want to use this scheme to transmit a sensitive data, such as in the military and commercial communication systems. In this paper, we propose a new method to increase the security of MIMO-OFDM system using the change of location of fake subcarrier. The fake subcarriers’ location is generated per packet of data using Pseudo Random sequence generator. The simulation results show that the proposed scheme does not decrease the performance of conventional MIMO-OFDM. The attacker or eavesdropper gets worse Bit Error Rate (BER than the legal receiver compared to the conventional MIMO-OFDM system.
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.
[Intel random number generator-based true random number generator].
Huang, Feng; Shen, Hong
2004-09-01
To establish a true random number generator on the basis of certain Intel chips. The random numbers were acquired by programming using Microsoft Visual C++ 6.0 via register reading from the random number generator (RNG) unit of an Intel 815 chipset-based computer with Intel Security Driver (ISD). We tested the generator with 500 random numbers in NIST FIPS 140-1 and X(2) R-Squared test, and the result showed that the random number it generated satisfied the demand of independence and uniform distribution. We also compared the random numbers generated by Intel RNG-based true random number generator and those from the random number table statistically, by using the same amount of 7500 random numbers in the same value domain, which showed that the SD, SE and CV of Intel RNG-based random number generator were less than those of the random number table. The result of u test of two CVs revealed no significant difference between the two methods. Intel RNG-based random number generator can produce high-quality random numbers with good independence and uniform distribution, and solves some problems with random number table in acquisition of the random numbers.
A Fast, High Quality, and Reproducible Parallel Lagged-Fibonacci Pseudorandom Number Generator
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.
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.
Theoretical and empirical convergence results for additive congruential random number generators
Wikramaratna, Roy S.
2010-03-01
Additive Congruential Random Number (ACORN) generators represent an approach to generating uniformly distributed pseudo-random numbers that is straightforward to implement efficiently for arbitrarily large order and modulus; if it is implemented using integer arithmetic, it becomes possible to generate identical sequences on any machine. This paper briefly reviews existing results concerning ACORN generators and relevant theory concerning sequences that are well distributed mod 1 in k dimensions. It then demonstrates some new theoretical results for ACORN generators implemented in integer arithmetic with modulus M=2[mu] showing that they are a family of generators that converge (in a sense that is defined in the paper) to being well distributed mod 1 in k dimensions, as [mu]=log2M tends to infinity. By increasing k, it is possible to increase without limit the number of dimensions in which the resulting sequences approximate to well distributed. The paper concludes by applying the standard TestU01 test suite to ACORN generators for selected values of the modulus (between 260 and 2150), the order (between 4 and 30) and various odd seed values. On the basis of these and earlier results, it is recommended that an order of at least 9 be used together with an odd seed and modulus equal to 230p, for a small integer value of p. While a choice of p=2 should be adequate for most typical applications, increasing p to 3 or 4 gives a sequence that will consistently pass all the tests in the TestU01 test suite, giving additional confidence in more demanding applications. The results demonstrate that the ACORN generators are a reliable source of uniformly distributed pseudo-random numbers, and that in practice (as suggested by the theoretical convergence results) the quality of the ACORN sequences increases with increasing modulus and order.
Pseudo-random arranged color filter array for controlling moiré patterns in display.
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.
Matsumoto, Mari; Ohba, Ryuji; Yasuda, Shin-ichi; Uchida, Ken; Tanamoto, Tetsufumi; Fujita, Shinobu
2008-08-01
The demand for random numbers for security applications is increasing. A conventional random number generator using thermal noise can generate unpredictable high-quality random numbers, but the circuit is extremely large because of large amplifier circuit for a small thermal signal. On the other hand, a pseudo-random number generator is small but the quality of randomness is bad. For a small circuit and a high quality of randomness, we purpose a non-stoichiometric SixN metal-oxide-semiconductor field-effect transistor (MOSFET) noise source device. This device generates a very large noise signal without an amplifier circuit. As a result, it is shown that, utilizing a SiN MOSFET, we can attain a compact random number generator with a high generation rate near 1 Mbit/s, which is suitable for almost all security applications.
Digital random-number generator
Brocker, D. H.
1973-01-01
For binary digit array of N bits, use N noise sources to feed N nonlinear operators; each flip-flop in digit array is set by nonlinear operator to reflect whether amplitude of generator which feeds it is above or below mean value of generated noise. Fixed-point uniform distribution random number generation method can also be used to generate random numbers with other than uniform distribution.
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
International Nuclear Information System (INIS)
Procassini, R J; Beck, B R
2004-01-01
It might be assumed that use of a ''high-quality'' random number generator (RNG), producing a sequence of ''pseudo random'' numbers with a ''long'' repetition period, is crucial for producing unbiased results in Monte Carlo particle transport simulations. While several theoretical and empirical tests have been devised to check the quality (randomness and period) of an RNG, for many applications it is not clear what level of RNG quality is required to produce unbiased results. This paper explores the issue of RNG quality in the context of parallel, Monte Carlo transport simulations in order to determine how ''good'' is ''good enough''. This study employs the MERCURY Monte Carlo code, which incorporates the CNPRNG library for the generation of pseudo-random numbers via linear congruential generator (LCG) algorithms. The paper outlines the usage of random numbers during parallel MERCURY simulations, and then describes the source and criticality transport simulations which comprise the empirical basis of this study. A series of calculations for each test problem in which the quality of the RNG (period of the LCG) is varied provides the empirical basis for determining the minimum repetition period which may be employed without producing a bias in the mean integrated results
Microcomputer Unit: Generating Random Numbers.
Haigh, William E.
1986-01-01
Presents an activity, suitable for students in grades 6-12, on generating random numbers. Objectives, equipment needed, list of prerequisite experiences, instructional strategies, and ready-to-copy student worksheets are included. (JN)
Random number generation and creativity.
Bains, William
2008-01-01
A previous paper suggested that humans can generate genuinely random numbers. I tested this hypothesis by repeating the experiment with a larger number of highly numerate subjects, asking them to call out a sequence of digits selected from 0 through 9. The resulting sequences were substantially non-random, with an excess of sequential pairs of numbers and a deficit of repeats of the same number, in line with previous literature. However, the previous literature suggests that humans generate random numbers with substantial conscious effort, and distractions which reduce that effort reduce the randomness of the numbers. I reduced my subjects' concentration by asking them to call out in another language, and with alcohol - neither affected the randomness of their responses. This suggests that the ability to generate random numbers is a 'basic' function of the human mind, even if those numbers are not mathematically 'random'. I hypothesise that there is a 'creativity' mechanism, while not truly random, provides novelty as part of the mind's defence against closed programming loops, and that testing for the effects seen here in people more or less familiar with numbers or with spontaneous creativity could identify more features of this process. It is possible that training to perform better at simple random generation tasks could help to increase creativity, through training people to reduce the conscious mind's suppression of the 'spontaneous', creative response to new questions.
An On-Demand Optical Quantum Random Number Generator with In-Future Action and Ultra-Fast Response.
Stipčević, Mario; Ursin, Rupert
2015-06-09
Random numbers are essential for our modern information based society e.g. in cryptography. Unlike frequently used pseudo-random generators, physical random number generators do not depend on complex algorithms but rather on a physical process to provide true randomness. Quantum random number generators (QRNG) do rely on a process, which can be described by a probabilistic theory only, even in principle. Here we present a conceptually simple implementation, which offers a 100% efficiency of producing a random bit upon a request and simultaneously exhibits an ultra low latency. A careful technical and statistical analysis demonstrates its robustness against imperfections of the actual implemented technology and enables to quickly estimate randomness of very long sequences. Generated random numbers pass standard statistical tests without any post-processing. The setup described, as well as the theory presented here, demonstrate the maturity and overall understanding of the technology.
Generation of photon number states
International Nuclear Information System (INIS)
Waks, Edo; Diamanti, Eleni; Yamamoto, Yoshihisa
2006-01-01
The visible light photon counter (VLPC) has the capability to discriminate photon number states, in contrast to conventional photon counters which can only detect the presence or absence of photons. We use this capability, along with the process of parametric down-conversion, to generate photon number states. We experimentally demonstrate generation of states containing 1, 2, 3 and 4 photons with high fidelity. We then explore the effect the detection efficiency of the VLPC has on the generation rate and fidelity of the created states
Targeted reduction of highly abundant transcripts using pseudo-random primers.
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.
Design of a Handheld Pseudo Random Coded UWB Radar for Human Sensing
Directory of Open Access Journals (Sweden)
Xia Zheng-huan
2015-10-01
Full Text Available This paper presents the design of a handheld pseudo random coded Ultra-WideBand (UWB radar for human sensing. The main tasks of the radar are to track the moving human object and extract the human respiratory frequency. In order to achieve perfect penetrability and good range resolution, m sequence with a carrier of 800 MHz is chosen as the transmitting signal. The modulated m-sequence can be generated directly by the high-speed DAC and FPGA to reduce the size of the radar system, and the mean power of the transmitting signal is 5 dBm. The receiver has two receiving channels based on hybrid sampling, the first receiving channel is to sample the reference signal and the second receiving channel is to obtain the radar echo. The real-time pulse compression is computed in parallel with a group of on-chip DSP48E slices in FPGA to improve the scanning rate of the radar system. Additionally, the algorithms of moving target tracking and life detection are implemented using Intel’s micro-processor, and the detection results are sent to the micro displayer fixed on the helmet. The experimental results show that the moving target located at less than 16 m far away from the wall can be tracked, and the respiratory frequency of the static human at less than 14 m far away from the wall can be extracted.
Least squares deconvolution for leak detection with a pseudo random binary sequence excitation
Nguyen, Si Tran Nguyen; Gong, Jinzhe; Lambert, Martin F.; Zecchin, Aaron C.; Simpson, Angus R.
2018-01-01
Leak detection and localisation is critical for water distribution system pipelines. This paper examines the use of the time-domain impulse response function (IRF) for leak detection and localisation in a pressurised water pipeline with a pseudo random binary sequence (PRBS) signal excitation. Compared to the conventional step wave generated using a single fast operation of a valve closure, a PRBS signal offers advantageous correlation properties, in that the signal has very low autocorrelation for lags different from zero and low cross correlation with other signals including noise and other interference. These properties result in a significant improvement in the IRF signal to noise ratio (SNR), leading to more accurate leak localisation. In this paper, the estimation of the system IRF is formulated as an optimisation problem in which the l2 norm of the IRF is minimised to suppress the impact of noise and interference sources. Both numerical and experimental data are used to verify the proposed technique. The resultant estimated IRF provides not only accurate leak location estimation, but also good sensitivity to small leak sizes due to the improved SNR.
A high speed digital noise generator
Obrien, J.; Gaffney, B.; Liu, B.
In testing of digital signal processing hardware, a high speed pseudo-random noise generator is often required to simulate an input noise source to the hardware. This allows the hardware to be exercised in a manner analogous to actual operating conditions. In certain radar and communication environments, a noise generator operating at speeds in excess of 60 MHz may be required. In this paper, a method of generating high speed pseudo-random numbers from an arbitrarily specified distribution (Gaussian, Log-Normal, etc.) using a transformation from a uniform noise source is described. A noise generator operating at 80 MHz has been constructed. Different distributions can be readily obtained by simply changing the ROM set. The hardware and test results will be described. Using this approach, the generation of pseudo-random sequences with arbitrary distributions at word rates in excess of 200 MHz can be readily achieved.
Interference Suppression Performance of Automotive UWB Radars Using Pseudo Random Sequences
Directory of Open Access Journals (Sweden)
I. Pasya
2015-12-01
Full Text Available Ultra wideband (UWB automotive radars have attracted attention from the viewpoint of reducing traffic accidents. The performance of automotive radars may be degraded by interference from nearby radars using the same frequency. In this study, a scenario where two cars pass each other on a road was considered. Considering the utilization of cross-polarization, the desired-to-undesired signal power ratio (DUR was found to vary approximately from -10 to 30 dB. Different pseudo random sequences were employed for spectrum spreading the different radar signals to mitigate the interference effects. This paper evaluates the interference suppression provided by maximum length sequence (MLS and Gold sequence (GS through numerical simulations of the radar’s performance in terms of probability of false alarm and probability of detection. It was found that MLS and GS yielded nearly the same performance when the DUR is -10 dB (worst case; for example when fixing the probability of false alarm to 0.0001, the probabilities of detection were 0.964 and 0.946 respectively. The GS are more advantageous than MLS due to larger number of different sequences having the same length in GS than in MLS.
Range walk error correction and modeling on Pseudo-random photon counting system
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.
Surface detection performance evaluation of pseudo-random noise continuous wave laser radar
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.
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.
Recommendations and illustrations for the evaluation of photonic random number generators
Hart, Joseph D.; Terashima, Yuta; Uchida, Atsushi; Baumgartner, Gerald B.; Murphy, Thomas E.; Roy, Rajarshi
2017-09-01
The never-ending quest to improve the security of digital information combined with recent improvements in hardware technology has caused the field of random number generation to undergo a fundamental shift from relying solely on pseudo-random algorithms to employing optical entropy sources. Despite these significant advances on the hardware side, commonly used statistical measures and evaluation practices remain ill-suited to understand or quantify the optical entropy that underlies physical random number generation. We review the state of the art in the evaluation of optical random number generation and recommend a new paradigm: quantifying entropy generation and understanding the physical limits of the optical sources of randomness. In order to do this, we advocate for the separation of the physical entropy source from deterministic post-processing in the evaluation of random number generators and for the explicit consideration of the impact of the measurement and digitization process on the rate of entropy production. We present the Cohen-Procaccia estimate of the entropy rate h (𝜖 ,τ ) as one way to do this. In order to provide an illustration of our recommendations, we apply the Cohen-Procaccia estimate as well as the entropy estimates from the new NIST draft standards for physical random number generators to evaluate and compare three common optical entropy sources: single photon time-of-arrival detection, chaotic lasers, and amplified spontaneous emission.
Recommendations and illustrations for the evaluation of photonic random number generators
Directory of Open Access Journals (Sweden)
Joseph D. Hart
2017-09-01
Full Text Available The never-ending quest to improve the security of digital information combined with recent improvements in hardware technology has caused the field of random number generation to undergo a fundamental shift from relying solely on pseudo-random algorithms to employing optical entropy sources. Despite these significant advances on the hardware side, commonly used statistical measures and evaluation practices remain ill-suited to understand or quantify the optical entropy that underlies physical random number generation. We review the state of the art in the evaluation of optical random number generation and recommend a new paradigm: quantifying entropy generation and understanding the physical limits of the optical sources of randomness. In order to do this, we advocate for the separation of the physical entropy source from deterministic post-processing in the evaluation of random number generators and for the explicit consideration of the impact of the measurement and digitization process on the rate of entropy production. We present the Cohen-Procaccia estimate of the entropy rate h(,τ as one way to do this. In order to provide an illustration of our recommendations, we apply the Cohen-Procaccia estimate as well as the entropy estimates from the new NIST draft standards for physical random number generators to evaluate and compare three common optical entropy sources: single photon time-of-arrival detection, chaotic lasers, and amplified spontaneous emission.
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.
Random Generators and Normal Numbers
Bailey, David H.; Crandall, Richard E.
2002-01-01
Pursuant to the authors' previous chaotic-dynamical model for random digits of fundamental constants, we investigate a complementary, statistical picture in which pseudorandom number generators (PRNGs) are central. Some rigorous results are achieved: We establish b-normality for constants of the form $\\sum_i 1/(b^{m_i} c^{n_i})$ for certain sequences $(m_i), (n_i)$ of integers. This work unifies and extends previously known classes of explicit normals. We prove that for coprime $b,c>1$ the...
Fast integration using quasi-random numbers
International Nuclear Information System (INIS)
Bossert, J.; Feindt, M.; Kerzel, U.
2006-01-01
Quasi-random numbers are specially constructed series of numbers optimised to evenly sample a given s-dimensional volume. Using quasi-random numbers in numerical integration converges faster with a higher accuracy compared to the case of pseudo-random numbers. The basic properties of quasi-random numbers are introduced, various generators are discussed and the achieved gain is illustrated by examples
Fast integration using quasi-random numbers
Bossert, J.; Feindt, M.; Kerzel, U.
2006-04-01
Quasi-random numbers are specially constructed series of numbers optimised to evenly sample a given s-dimensional volume. Using quasi-random numbers in numerical integration converges faster with a higher accuracy compared to the case of pseudo-random numbers. The basic properties of quasi-random numbers are introduced, various generators are discussed and the achieved gain is illustrated by examples.
Random Number Generation in Autism.
Williams, Mark A.; Moss, Simon A.; Bradshaw, John L.; Rinehart, Nicole J.
2002-01-01
This study explored the ability of 14 individuals with autism to generate a unique series of digits. Individuals with autism were more likely to repeat previous digits than comparison individuals, suggesting they may exhibit a shortfall in response inhibition. Results support the executive dysfunction theory of autism. (Contains references.)…
International Nuclear Information System (INIS)
Yashchuk, Valeriy V.; McKinney, Wayne R.; Takacs, Peter Z.
2008-01-01
We suggest and describe the use of a binary pseudo-random grating as a standard test surface for calibration of the modulation transfer function of microscopes. Results from calibration of a MicromapTM-570 interferometric microscope are presented.
Koschate, J; Drescher, U; Thieschäfer, L; Heine, O; Baum, K; Hoffmann, U
2016-12-01
This study aims to compare cardiorespiratory kinetics as a response to a standardised work rate protocol with pseudo-random binary sequences between cycling and walking in young healthy subjects. Muscular and pulmonary oxygen uptake (V̇O 2 ) kinetics as well as heart rate kinetics were expected to be similar for walking and cycling. Cardiac data and V̇O 2 of 23 healthy young subjects were measured in response to pseudo-random binary sequences. Kinetics were assessed applying time series analysis. Higher maxima of cross-correlation functions between work rate and the respective parameter indicate faster kinetics responses. Muscular V̇O 2 kinetics were estimated from heart rate and pulmonary V̇O 2 using a circulatory model. Muscular (walking vs. cycling [mean±SD in arbitrary units]: 0.40±0.08 vs. 0.41±0.08) and pulmonary V̇O 2 kinetics (0.35±0.06 vs. 0.35±0.06) were not different, although the time courses of the cross-correlation functions of pulmonary V̇O 2 showed unexpected biphasic responses. Heart rate kinetics (0.50±0.14 vs. 0.40±0.14; P=0.017) was faster for walking. Regarding the biphasic cross-correlation functions of pulmonary V̇O 2 during walking, the assessment of muscular V̇O 2 kinetics via pseudo-random binary sequences requires a circulatory model to account for cardio-dynamic distortions. Faster heart rate kinetics for walking should be considered by comparing results from cycle and treadmill ergometry. © Georg Thieme Verlag KG Stuttgart · New York.
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....
International Nuclear Information System (INIS)
Cornejo Diaz, N.; Vergara Gil, A.; Jurado Vargas, M.
2010-01-01
The Monte Carlo method has become a valuable numerical laboratory framework in which to simulate complex physical systems. It is based on the generation of pseudo-random number sequences by numerical algorithms called random generators. In this work we assessed the suitability of different well-known random number generators for the simulation of gamma-ray spectrometry systems during efficiency calibrations. The assessment was carried out in two stages. The generators considered (Delphi's linear congruential, mersenne twister, XorShift, multiplier with carry, universal virtual array, and non-periodic logistic map based generator) were first evaluated with different statistical empirical tests, including moments, correlations, uniformity, independence of terms and the DIEHARD battery of tests. In a second step, an application-specific test was conducted by implementing the generators in our Monte Carlo program DETEFF and comparing the results obtained with them. The calculations were performed with two different CPUs, for a typical HpGe detector and a water sample in Marinelli geometry, with gamma-rays between 59 and 1800 keV. For the Non-periodic Logistic Map based generator, dependence of the most significant bits was evident. This explains the bias, in excess of 5%, of the efficiency values obtained with this generator. The results of the application-specific assessment and the statistical performance of the other algorithms studied indicate their suitability for the Monte Carlo simulation of gamma-ray spectrometry systems for efficiency calculations.
Díaz, N Cornejo; Gil, A Vergara; Vargas, M Jurado
2010-03-01
The Monte Carlo method has become a valuable numerical laboratory framework in which to simulate complex physical systems. It is based on the generation of pseudo-random number sequences by numerical algorithms called random generators. In this work we assessed the suitability of different well-known random number generators for the simulation of gamma-ray spectrometry systems during efficiency calibrations. The assessment was carried out in two stages. The generators considered (Delphi's linear congruential, mersenne twister, XorShift, multiplier with carry, universal virtual array, and non-periodic logistic map based generator) were first evaluated with different statistical empirical tests, including moments, correlations, uniformity, independence of terms and the DIEHARD battery of tests. In a second step, an application-specific test was conducted by implementing the generators in our Monte Carlo program DETEFF and comparing the results obtained with them. The calculations were performed with two different CPUs, for a typical HpGe detector and a water sample in Marinelli geometry, with gamma-rays between 59 and 1800 keV. For the Non-periodic Logistic Map based generator, dependence of the most significant bits was evident. This explains the bias, in excess of 5%, of the efficiency values obtained with this generator. The results of the application-specific assessment and the statistical performance of the other algorithms studied indicate their suitability for the Monte Carlo simulation of gamma-ray spectrometry systems for efficiency calculations. Copyright 2009 Elsevier Ltd. All rights reserved.
Miszczak, Jarosław Adam
2013-01-01
numbers generated by quantum real number generator. Reasons for new version: Added support for the high-speed on-line quantum random number generator and improved methods for retrieving lists of random numbers. Summary of revisions: The presented version provides two signicant improvements. The first one is the ability to use the on-line Quantum Random Number Generation service developed by PicoQuant GmbH and the Nano-Optics groups at the Department of Physics of Humboldt University. The on-line service supported in the version 2.0 of the TRQS package provides faster access to true randomness sources constructed using the laws of quantum physics. The service is freely available at https://qrng.physik.hu-berlin.de/. The use of this service allows using the presented package with the need of a physical quantum random number generator. The second improvement introduced in this version is the ability to retrieve arrays of random data directly for the used source. This increases the speed of the random number generation, especially in the case of an on-line service, where it reduces the time necessary to establish the connection. Thanks to the speed improvement of the presented version, the package can now be used in simulations requiring larger amounts of random data. Moreover, the functions for generating random numbers provided by the current version of the package more closely follow the pattern of functions for generating pseudo- random numbers provided in Mathematica. Additional comments: Speed comparison: The implementation of the support for the QRNG on-line service provides a noticeable improvement in the speed of random number generation. For the samples of real numbers of size 101; 102,…,107 the times required to generate these samples using Quantis USB device and QRNG service are compared in Fig. 1. The presented results show that the use of the on-line service provides faster access to random numbers. One should note, however, that the speed gain can increase or
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.
Self-correcting random number generator
Humble, Travis S.; Pooser, Raphael C.
2016-09-06
A system and method for generating random numbers. The system may include a random number generator (RNG), such as a quantum random number generator (QRNG) configured to self-correct or adapt in order to substantially achieve randomness from the output of the RNG. By adapting, the RNG may generate a random number that may be considered random regardless of whether the random number itself is tested as such. As an example, the RNG may include components to monitor one or more characteristics of the RNG during operation, and may use the monitored characteristics as a basis for adapting, or self-correcting, to provide a random number according to one or more performance criteria.
Analysis of android random number generator
Sarıtaş, Serkan
2013-01-01
Ankara : The Department of Computer Engineering and the Graduate School of Engineering and Science of Bilkent University, 2013. Thesis (Master's) -- Bilkent University, 2013. Includes bibliographical references leaves 61-65. Randomness is a crucial resource for cryptography, and random number generators are critical building blocks of almost all cryptographic systems. Therefore, random number generation is one of the key parts of secure communication. Random number generatio...
Design of an Ultra-wideband Pseudo Random Coded MIMO Radar Based on Radio Frequency Switches
Directory of Open Access Journals (Sweden)
Su Hai
2017-02-01
Full Text Available A Multiple-Input Multiple-Output (MIMO ultra-wideband radar can detect the range and azimuth information of targets in real time. It is widely used for geological surveys, life rescue, through-wall tracking, and other military or civil fields. This paper presents the design of an ultra-wideband pseudo random coded MIMO radar that is based on Radio Frequency (RF switches and implements a MIMO radar system. RF switches are employed to reduce cost and complexity of the system. As the switch pressure value is limited, the peak power of the transmitting signal is 18 dBm. The ultra-wideband radar echo is obtained by hybrid sampling, and pulse compression is computed by Digital Signal Processors (DSPs embedded in an Field-Programmable Gate Array (FPGA to simplify the signal process. The experiment illustrates that the radar system can detect the range and azimuth information of targets in real time.
International Nuclear Information System (INIS)
Hayashi, Koji; Shimazaki, Junya; Nabeshima, Kunihiko; Ochiai, Masaaki; Shinohara, Yoshikuni; Inoue, Kimihiko.
1995-01-01
In order to investigate dynamics of the reactor plant of the nuclear ship Mutsu, the second reactor noise experiment using pseudo random binary sequences (PRBS) was performed on August 30, 1991 in the third experimental navigation. The experiments using both reactivity and load disturbances were performed at 50% of reactor power and under a quiet sea condition. Each PRBS was applied by manual operation of the control rod or the main steam valve. Various signals of the plant responses and of the acceleration of ship motion were measured. Furthermore, natural reactor noise signals were measured after each PRBS experiment in order to evaluate the effects of the PRBS disturbances. This paper summarizes the planning of the experiment, the instruction for the experiment and logs, the data recording conditions, recorded signal wave forms and the results of power spectral analysis. (author)
International Nuclear Information System (INIS)
Hayashi, Koji; Shimazaki, Junya; Nabeshima, Kunihiko; Ochiai, Masaaki; Shinohara, Yoshikuni; Inoue, Kimihiko.
1995-03-01
In order to investigate dynamics of the reactor plant of the nuclear ship Mutsu, the third reactor noise experiment using pseudo random binary sequences (PRBS) was performed on September 16, 1991 in the third experimental navigation. The experiments using both reactivity and load disturbances were performed at 70% of reactor power and under a normal sea condition. Each PRBS was applied by manual operation of the control rod or the main steam valve. Various signals of the plant responses and of the acceleration of ship motion were measured. Furthermore, natural reactor noise signals were measured after each PRBS experiment in order to evaluate the effects of the PRBS disturbances. This paper summarizes the planning of the experiment, the instruction for the experiment and logs, the data recording conditions, recorded signal wave forms and the results of power spectral analysis. (author)
Biometric National Identification Number Generation for Secure ...
African Journals Online (AJOL)
Biometric National Identification Number Generation for Secure Network Authentication Based Fingerprint. ... Username, Password, Remember me, or Register ... In this paper an authentication based finger print biometric system is proposed ...
All-optical fast random number generator.
Li, Pu; Wang, Yun-Cai; Zhang, Jian-Zhong
2010-09-13
We propose a scheme of all-optical random number generator (RNG), which consists of an ultra-wide bandwidth (UWB) chaotic laser, an all-optical sampler and an all-optical comparator. Free from the electric-device bandwidth, it can generate 10Gbit/s random numbers in our simulation. The high-speed bit sequences can pass standard statistical tests for randomness after all-optical exclusive-or (XOR) operation.
International Nuclear Information System (INIS)
Calvayrac, Florent
2005-01-01
We present known and new applications of pseudo random numbers and of the Metropolis algorithm to phenomena of physical and mechanical interest, such as the search of simple clusters isomers with interactive visualization, or vehicle motion planning. The progression towards complicated problems was used with first-year graduate students who wrote most of the programs presented here. We argue that the use of pseudo random numbers in simulation and extrema research programs in teaching numerical methods in physics allows one to get quick programs and physically meaningful and demonstrative results without recurring to the advanced numerical analysis methods
Multi-kW coherent combining of fiber lasers seeded with pseudo random phase modulated light
Flores, Angel; Ehrehreich, Thomas; Holten, Roger; Anderson, Brian; Dajani, Iyad
2016-03-01
We report efficient coherent beam combining of five kilowatt-class fiber amplifiers with a diffractive optical element (DOE). Based on a master oscillator power amplifier (MOPA) configuration, the amplifiers were seeded with pseudo random phase modulated light. Each non-polarization maintaining fiber amplifier was optically path length matched and provides approximately 1.2 kW of near diffraction-limited output power (measured M2polarization control. A low power sample of the combined beam after the DOE provided an error signal for active phase locking which was performed via Locking of Optical Coherence by Single-Detector Electronic-Frequency Tagging (LOCSET). After phase stabilization, the beams were coherently combined via the 1x5 DOE. A total combined output power of 4.9 kW was achieved with 82% combining efficiency and excellent beam quality (M2splitter loss was 5%. Similarly, losses due in part to non-ideal polarization, ASE content, uncorrelated wavefront errors, and misalignment errors contributed to the efficiency reduction.
Reactor dynamics experiment of N.S. Mutsu using pseudo random signal. 1
International Nuclear Information System (INIS)
Hayashi, Koji; Nabeshima, Kunihiko; Shinohara, Yoshikuni; Shimazaki, Junya; Inoue, Kimihiko; Ochiai, Masaaki.
1993-10-01
In order to investigate dynamics of the reactor plant of the nuclear ship Mutsu, reactor noise experiments using pseudo random binary sequences (PRBS) have been planned, and a preliminary experiment was performed on March 4, 1991 in the first experimental navigation with the aim of checking the experimental procedures and conditions. The experiments using both reactivity and load disturbances were performed at 70 % of reactor power and under a quiet sea condition. Each PRBS was applied by manual operation of the control rod or the main steam valve. Various signals of the plant responses and of the acceleration of ship motion were measured. From the results obtained, we confirmed that (1) the procedures and experimental conditions determined prior to the experiment were suitable for performing the PRBS experiments, (2) when the PRBS disturbances were applied, the plant state remained quite stable, and (3) the quality of the measured data is adequate for the purpose of dynamics analysis. This paper summarizes the planning and preparation of the experiment, the instruction for the experiment and logs, the data recording conditions, recorded signal wave forms and the results of power spectral analysis. (author)
Standard random number generation for MBASIC
Tausworthe, R. C.
1976-01-01
A machine-independent algorithm is presented and analyzed for generating pseudorandom numbers suitable for the standard MBASIC system. The algorithm used is the polynomial congruential or linear recurrence modulo 2 method. Numbers, formed as nonoverlapping adjacent 28-bit words taken from the bit stream produced by the formula a sub m + 532 = a sub m + 37 + a sub m (modulo 2), do not repeat within the projected age of the solar system, show no ensemble correlation, exhibit uniform distribution of adjacent numbers up to 19 dimensions, and do not deviate from random runs-up and runs-down behavior.
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.
Source-Independent Quantum Random Number Generation
Cao, Zhu; Zhou, Hongyi; Yuan, Xiao; Ma, Xiongfeng
2016-01-01
Quantum random number generators can provide genuine randomness by appealing to the fundamental principles of quantum mechanics. In general, a physical generator contains two parts—a randomness source and its readout. The source is essential to the quality of the resulting random numbers; hence, it needs to be carefully calibrated and modeled to achieve information-theoretical provable randomness. However, in practice, the source is a complicated physical system, such as a light source or an atomic ensemble, and any deviations in the real-life implementation from the theoretical model may affect the randomness of the output. To close this gap, we propose a source-independent scheme for quantum random number generation in which output randomness can be certified, even when the source is uncharacterized and untrusted. In our randomness analysis, we make no assumptions about the dimension of the source. For instance, multiphoton emissions are allowed in optical implementations. Our analysis takes into account the finite-key effect with the composable security definition. In the limit of large data size, the length of the input random seed is exponentially small compared to that of the output random bit. In addition, by modifying a quantum key distribution system, we experimentally demonstrate our scheme and achieve a randomness generation rate of over 5 ×103 bit /s .
Source-Independent Quantum Random Number Generation
Directory of Open Access Journals (Sweden)
Zhu Cao
2016-02-01
Full Text Available Quantum random number generators can provide genuine randomness by appealing to the fundamental principles of quantum mechanics. In general, a physical generator contains two parts—a randomness source and its readout. The source is essential to the quality of the resulting random numbers; hence, it needs to be carefully calibrated and modeled to achieve information-theoretical provable randomness. However, in practice, the source is a complicated physical system, such as a light source or an atomic ensemble, and any deviations in the real-life implementation from the theoretical model may affect the randomness of the output. To close this gap, we propose a source-independent scheme for quantum random number generation in which output randomness can be certified, even when the source is uncharacterized and untrusted. In our randomness analysis, we make no assumptions about the dimension of the source. For instance, multiphoton emissions are allowed in optical implementations. Our analysis takes into account the finite-key effect with the composable security definition. In the limit of large data size, the length of the input random seed is exponentially small compared to that of the output random bit. In addition, by modifying a quantum key distribution system, we experimentally demonstrate our scheme and achieve a randomness generation rate of over 5×10^{3} bit/s.
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.
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.
Test Pattern Generator for Mixed Mode BIST
Energy Technology Data Exchange (ETDEWEB)
Kim, Hong Sik; Lee, Hang Kyu; Kang, Sung Ho [Yonsei University (Korea, Republic of)
1998-07-01
As the increasing integrity of VLSI, the BIST (Built-In Self Test) is used as an effective method to test chips. Generally the pseudo-random test pattern generation is used for BIST. But it requires lots of test patterns when there exist random resistant faults. Therefore deterministic testing is an interesting BIST technique due to the minimal number of test patterns and to its high fault coverage. However this is not applicable since the existing deterministic test pattern generators require too much area overhead despite their efficiency. Therefore we propose a mixed test scheme which applies to the circuit under test, a deterministic test sequence followed by a pseudo-random one. This scheme allows the maximum fault coverage detection to be achieved, furthermore the silicon area overhead of the mixed hardware generator can be reduced. The deterministic test generator is made with a finite state machine and a pseudo-random test generator is made with LFSR(linear feedback shift register). The results of ISCAS circuits show that the maximum fault coverage is guaranteed with small number of test set and little hardware overhead. (author). 15 refs., 10 figs., 4 tabs.
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)
International Nuclear Information System (INIS)
Nasserzadeh, V.; Swithenbank, J.; Jones, B.
1995-01-01
The problem of measuring gas-residence time in large incinerators was studied by the pseudo-random binary sequence (PRBS) stimulus tracer response technique at the Sheffield municipal solid-waste incinerator (35 MW plant). The steady-state system was disturbed by the superimposition of small fluctuations in the form of a pseudo-random binary sequence of methane pulses, and the response of the incinerator was determined from the CO 2 concentration in flue gases at the boiler exit, measured with a specially developed optical gas analyser with a high-frequency response. For data acquisition, an on-line PC computer was used together with the LAB Windows software system; the output response was then cross-correlated with the perturbation signal to give the impulse response of the incinerator. There was very good agreement between the gas-residence time for the Sheffield MSW incinerator as calculated by computational fluid dynamics (FLUENT Model) and gas-residence time at the plant as measured by the PRBS tracer technique. The results obtained from this research programme clearly demonstrate that the PRBS stimulus tracer response technique can be successfully and economically used to measure gas-residence times in large incinerator plants. It also suggests that the common commercial practice of characterising the incinerator operation by a single-residence-time parameter may lead to a misrepresentation of the complexities involved in describing the operation of the incineration system. (author)
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...
49 CFR 229.105 - Steam generator number.
2010-10-01
... 49 Transportation 4 2010-10-01 2010-10-01 false Steam generator number. 229.105 Section 229.105..., DEPARTMENT OF TRANSPORTATION RAILROAD LOCOMOTIVE SAFETY STANDARDS Safety Requirements Steam Generators § 229.105 Steam generator number. An identification number shall be marked on the steam generator's...
The generative basis of natural number concepts.
Leslie, Alan M; Gelman, Rochel; Gallistel, C R
2008-06-01
Number concepts must support arithmetic inference. Using this principle, it can be argued that the integer concept of exactly ONE is a necessary part of the psychological foundations of number, as is the notion of the exact equality - that is, perfect substitutability. The inability to support reasoning involving exact equality is a shortcoming in current theories about the development of numerical reasoning. A simple innate basis for the natural number concepts can be proposed that embodies the arithmetic principle, supports exact equality and also enables computational compatibility with real- or rational-valued mental magnitudes.
Application of quasi-random numbers for simulation
International Nuclear Information System (INIS)
Kazachenko, O.N.; Takhtamyshev, G.G.
1985-01-01
Application of the Monte-Carlo method for multidimensional integration is discussed. The main goal is to check the statement that the application of quasi-random numbers instead of regular pseudo-random numbers provides more rapid convergency. The Sobol, Richtmayer and Halton algorithms of quasi-random sequences are described. Over 50 tests to compare these quasi-random numbers as well as pseudo-random numbers were fulfilled. In all cases quasi-random numbers have clearly demonstrated a more rapid convergency as compared with pseudo-random ones. Positive test results on quasi-random trend in Monte-Carlo method seem very promising
Random Number Generation for High Performance Computing
2015-01-01
number streams, a quality metric for the parallel random number streams. * * * * * Atty. Dkt . No.: 5660-14400 Customer No. 35690 Eric B. Meyertons...responsibility to ensure timely payment of maintenance fees when due. Pagel of3 PTOL-85 (Rev. 02/11) Atty. Dkt . No.: 5660-14400 Page 1 Meyertons...with each subtask executed by a separate thread or process (henceforth, process). Each process has Atty. Dkt . No.: 5660-14400 Page 2 Meyertons
Testing, Selection, and Implementation of Random Number Generators
National Research Council Canada - National Science Library
Collins, Joseph C
2008-01-01
An exhaustive evaluation of state-of-the-art random number generators with several well-known suites of tests provides the basis for selection of suitable random number generators for use in stochastic simulations...
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.
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.
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 Method of Erasing Data Using Random Number Generators
井上,正人
2012-01-01
Erasing data is an indispensable step for disposal of computers or external storage media. Except physical destruction, erasing data means writing random information on entire disk drives or media. We propose a method which erases data safely using random number generators. These random number generators create true random numbers based on quantum processes.
Inequalities involving the generating function for the number of ...
African Journals Online (AJOL)
Fibonacci numbers can be expressed in terms of multinomial coefficients as sums over integer partitions into odd parts. We use this fact to introduce a family of double inequalities involving the generating function for the number of partitions into odd parts and the generating function for the number of odd divisors. Keywords: ...
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.
An investigation of the uniform random number generator
Temple, E. C.
1982-01-01
Most random number generators that are in use today are of the congruential form X(i+1) + AX(i) + C mod M where A, C, and M are nonnegative integers. If C=O, the generator is called the multiplicative type and those for which C/O are called mixed congruential generators. It is easy to see that congruential generators will repeat a sequence of numbers after a maximum of M values have been generated. The number of numbers that a procedure generates before restarting the sequence is called the length or the period of the generator. Generally, it is desirable to make the period as long as possible. A detailed discussion of congruential generators is given. Also, several promising procedures that differ from the multiplicative and mixed procedure are discussed.
Number of generations related to coupling constants by confusion
International Nuclear Information System (INIS)
Bennett, D.L.; Nielsen, H.B.
1987-01-01
In the context of random dynamics, the mechanism of confusion is used to obtain a relation between the number of generations and standard model coupling constants. Preliminary results predict the existence of four generations. (orig.)
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.
Generation of Random Numbers and Parallel Random Number Streams for Monte Carlo Simulations
Directory of Open Access Journals (Sweden)
L. Yu. Barash
2012-01-01
Full Text Available Modern methods and libraries for high quality pseudorandom number generation and for generation of parallel random number streams for Monte Carlo simulations are considered. The probability equidistribution property and the parameters when the property holds at dimensions up to logarithm of mesh size are considered for Multiple Recursive Generators.
The intermittency of vector fields and random-number generators
Kalinin, A. O.; Sokoloff, D. D.; Tutubalin, V. N.
2017-09-01
We examine how well natural random-number generators can reproduce the intermittency phenomena that arise in the transfer of vector fields in random media. A generator based on the analysis of financial indices is suggested as the most promising random-number generator. Is it shown that even this generator, however, fails to reproduce the phenomenon long enough to confidently detect intermittency, while the C++ generator successfully solves this problem. We discuss the prospects of using shell models of turbulence as the desired generator.
A Modified Entropy Generation Number for Heat Exchangers
Institute of Scientific and Technical Information of China (English)
无
1996-01-01
This paper demonstrates the difference between the entropy generation number method proposed by Bejian and the method of entropy generation per unit amount of heat transferred in analyzing the ther-modynamic performance of heat exchangers,points out the reason for leading to the above difference.A modified entropy generation number for evaluating the irreversibility of heat exchangers is proposed which is in consistent with the entropy generation per unit amount of heat transferred in entropy generation analysis.The entropy generated by friction is also investigated.Results show that when the entropy generated by friction in heat exchangers in taken into account,there is a minimum total entropy generation number while the NTU and the ratio of heat capacity rates vary.The existence of this minimum is the prerequisite of heat exchanger optimization.
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.
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.
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.
Towards a high-speed quantum random number generator
Stucki, Damien; Burri, Samuel; Charbon, Edoardo; Chunnilall, Christopher; Meneghetti, Alessio; Regazzoni, Francesco
2013-10-01
Randomness is of fundamental importance in various fields, such as cryptography, numerical simulations, or the gaming industry. Quantum physics, which is fundamentally probabilistic, is the best option for a physical random number generator. In this article, we will present the work carried out in various projects in the context of the development of a commercial and certified high speed random number generator.
Microcomputer-Assisted Discoveries: Generate Your Own Random Numbers.
Kimberling, Clark
1984-01-01
Having students try to generate their own random numbers can lead to much discovery learning as one tries to create 'patternlessness' from formulas. Developing an equidistribution test and runs test, plus other ideas for generating random numbers, is discussed, with computer programs given. (MNS)
Extracting random numbers from quantum tunnelling through a single diode.
Bernardo-Gavito, Ramón; Bagci, Ibrahim Ethem; Roberts, Jonathan; Sexton, James; Astbury, Benjamin; Shokeir, Hamzah; McGrath, Thomas; Noori, Yasir J; Woodhead, Christopher S; Missous, Mohamed; Roedig, Utz; Young, Robert J
2017-12-19
Random number generation is crucial in many aspects of everyday life, as online security and privacy depend ultimately on the quality of random numbers. Many current implementations are based on pseudo-random number generators, but information security requires true random numbers for sensitive applications like key generation in banking, defence or even social media. True random number generators are systems whose outputs cannot be determined, even if their internal structure and response history are known. Sources of quantum noise are thus ideal for this application due to their intrinsic uncertainty. In this work, we propose using resonant tunnelling diodes as practical true random number generators based on a quantum mechanical effect. The output of the proposed devices can be directly used as a random stream of bits or can be further distilled using randomness extraction algorithms, depending on the application.
Note on Marsaglia\\'s Xorshift Random Number Generators
Directory of Open Access Journals (Sweden)
Richard P. Brent
2004-08-01
Full Text Available Marsaglia (2003 has described a class of Xorshift random number generators (RNGs with periods 2n - 1 for n = 32, 64, etc. We show that the sequences generated by these RNGs are identical to the sequences generated by certain linear feedback shift register (LFSR generators using "exclusive or" (xor operations on n-bit words, with a recurrence defined by a primitive polynomial of degree n.
Quantum random-number generator based on a photon-number-resolving detector
International Nuclear Information System (INIS)
Ren Min; Wu, E; Liang Yan; Jian Yi; Wu Guang; Zeng Heping
2011-01-01
We demonstrated a high-efficiency quantum random number generator which takes inherent advantage of the photon number distribution randomness of a coherent light source. This scheme was realized by comparing the photon flux of consecutive pulses with a photon number resolving detector. The random bit generation rate could reach 2.4 MHz with a system clock of 6.0 MHz, corresponding to a random bit generation efficiency as high as 40%. The random number files passed all the stringent statistical tests.
Random number generation based on digital differential chaos
Zidan, Mohammed A.; Radwan, Ahmed G.; Salama, Khaled N.
2012-01-01
In this paper, we present a fully digital differential chaos based random number generator. The output of the digital circuit is proved to be chaotic by calculating the output time series maximum Lyapunov exponent. We introduce a new post processing
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)
Quantum random number generation for loophole-free Bell tests
Mitchell, Morgan; Abellan, Carlos; Amaya, Waldimar
2015-05-01
We describe the generation of quantum random numbers at multi-Gbps rates, combined with real-time randomness extraction, to give very high purity random numbers based on quantum events at most tens of ns in the past. The system satisfies the stringent requirements of quantum non-locality tests that aim to close the timing loophole. We describe the generation mechanism using spontaneous-emission-driven phase diffusion in a semiconductor laser, digitization, and extraction by parity calculation using multi-GHz logic chips. We pay special attention to experimental proof of the quality of the random numbers and analysis of the randomness extraction. In contrast to widely-used models of randomness generators in the computer science literature, we argue that randomness generation by spontaneous emission can be extracted from a single source.
Analysis of random number generators in abnormal usage conditions
International Nuclear Information System (INIS)
Soucarros, M.
2012-01-01
Random numbers have been used through the ages for games of chance, more recently for secret codes and today they are necessary to the execution of computer programs. Random number generators have now evolved from simple dices to electronic circuits and algorithms. Accordingly, the ability to distinguish between random and non-random numbers has become more difficult. Furthermore, whereas in the past dices were loaded in order to increase winning chances, it is now possible to influence the outcome of random number generators. In consequence, this subject is still very much an issue and has recently made the headlines. Indeed, there was talks about the PS3 game console which generates constant random numbers and redundant distribution of secret keys on the internet. This thesis presents a study of several generators as well as different means to perturb them. It shows the inherent defects of their conceptions and possible consequences of their failure when they are embedded inside security components. Moreover, this work highlights problems yet to be solved concerning the testing of random numbers and the post-processing eliminating bias in these numbers distribution. (author) [fr
The RANDOM computer program: A linear congruential random number generator
Miles, R. F., Jr.
1986-01-01
The RANDOM Computer Program is a FORTRAN program for generating random number sequences and testing linear congruential random number generators (LCGs). The linear congruential form of random number generator is discussed, and the selection of parameters of an LCG for a microcomputer described. This document describes the following: (1) The RANDOM Computer Program; (2) RANDOM.MOD, the computer code needed to implement an LCG in a FORTRAN program; and (3) The RANCYCLE and the ARITH Computer Programs that provide computational assistance in the selection of parameters for an LCG. The RANDOM, RANCYCLE, and ARITH Computer Programs are written in Microsoft FORTRAN for the IBM PC microcomputer and its compatibles. With only minor modifications, the RANDOM Computer Program and its LCG can be run on most micromputers or mainframe computers.
Unbiased All-Optical Random-Number Generator
Steinle, Tobias; Greiner, Johannes N.; Wrachtrup, Jörg; Giessen, Harald; Gerhardt, Ilja
2017-10-01
The generation of random bits is of enormous importance in modern information science. Cryptographic security is based on random numbers which require a physical process for their generation. This is commonly performed by hardware random-number generators. These often exhibit a number of problems, namely experimental bias, memory in the system, and other technical subtleties, which reduce the reliability in the entropy estimation. Further, the generated outcome has to be postprocessed to "iron out" such spurious effects. Here, we present a purely optical randomness generator, based on the bistable output of an optical parametric oscillator. Detector noise plays no role and postprocessing is reduced to a minimum. Upon entering the bistable regime, initially the resulting output phase depends on vacuum fluctuations. Later, the phase is rigidly locked and can be well determined versus a pulse train, which is derived from the pump laser. This delivers an ambiguity-free output, which is reliably detected and associated with a binary outcome. The resulting random bit stream resembles a perfect coin toss and passes all relevant randomness measures. The random nature of the generated binary outcome is furthermore confirmed by an analysis of resulting conditional entropies.
A hybrid-type quantum random number generator
Hai-Qiang, Ma; Wu, Zhu; Ke-Jin, Wei; Rui-Xue, Li; Hong-Wei, Liu
2016-05-01
This paper proposes a well-performing hybrid-type truly quantum random number generator based on the time interval between two independent single-photon detection signals, which is practical and intuitive, and generates the initial random number sources from a combination of multiple existing random number sources. A time-to-amplitude converter and multichannel analyzer are used for qualitative analysis to demonstrate that each and every step is random. Furthermore, a carefully designed data acquisition system is used to obtain a high-quality random sequence. Our scheme is simple and proves that the random number bit rate can be dramatically increased to satisfy practical requirements. Project supported by the National Natural Science Foundation of China (Grant Nos. 61178010 and 11374042), the Fund of State Key Laboratory of Information Photonics and Optical Communications (Beijing University of Posts and Telecommunications), China, and the Fundamental Research Funds for the Central Universities of China (Grant No. bupt2014TS01).
Superparamagnetic perpendicular magnetic tunnel junctions for true random number generators
Parks, Bradley; Bapna, Mukund; Igbokwe, Julianne; Almasi, Hamid; Wang, Weigang; Majetich, Sara A.
2018-05-01
Superparamagnetic perpendicular magnetic tunnel junctions are fabricated and analyzed for use in random number generators. Time-resolved resistance measurements are used as streams of bits in statistical tests for randomness. Voltage control of the thermal stability enables tuning the average speed of random bit generation up to 70 kHz in a 60 nm diameter device. In its most efficient operating mode, the device generates random bits at an energy cost of 600 fJ/bit. A narrow range of magnetic field tunes the probability of a given state from 0 to 1, offering a means of probabilistic computing.
Random number generation based on digital differential chaos
Zidan, Mohammed A.
2012-07-29
In this paper, we present a fully digital differential chaos based random number generator. The output of the digital circuit is proved to be chaotic by calculating the output time series maximum Lyapunov exponent. We introduce a new post processing technique to improve the distribution and statistical properties of the generated data. The post-processed output passes the NIST Sp. 800-22 statistical tests. The system is written in Verilog VHDL and realized on Xilinx Virtex® FPGA. The generator can fit into a very small area and have a maximum throughput of 2.1 Gb/s.
GASPRNG: GPU accelerated scalable parallel random number generator library
Gao, Shuang; Peterson, Gregory D.
2013-04-01
Graphics processors represent a promising technology for accelerating computational science applications. Many computational science applications require fast and scalable random number generation with good statistical properties, so they use the Scalable Parallel Random Number Generators library (SPRNG). We present the GPU Accelerated SPRNG library (GASPRNG) to accelerate SPRNG in GPU-based high performance computing systems. GASPRNG includes code for a host CPU and CUDA code for execution on NVIDIA graphics processing units (GPUs) along with a programming interface to support various usage models for pseudorandom numbers and computational science applications executing on the CPU, GPU, or both. This paper describes the implementation approach used to produce high performance and also describes how to use the programming interface. The programming interface allows a user to be able to use GASPRNG the same way as SPRNG on traditional serial or parallel computers as well as to develop tightly coupled programs executing primarily on the GPU. We also describe how to install GASPRNG and use it. To help illustrate linking with GASPRNG, various demonstration codes are included for the different usage models. GASPRNG on a single GPU shows up to 280x speedup over SPRNG on a single CPU core and is able to scale for larger systems in the same manner as SPRNG. Because GASPRNG generates identical streams of pseudorandom numbers as SPRNG, users can be confident about the quality of GASPRNG for scalable computational science applications. Catalogue identifier: AEOI_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEOI_v1_0.html Program obtainable from: CPC Program Library, Queen’s University, Belfast, N. Ireland Licensing provisions: UTK license. No. of lines in distributed program, including test data, etc.: 167900 No. of bytes in distributed program, including test data, etc.: 1422058 Distribution format: tar.gz Programming language: C and CUDA. Computer: Any PC or
Brain potentials index executive functions during random number generation.
Joppich, Gregor; Däuper, Jan; Dengler, Reinhard; Johannes, Sönke; Rodriguez-Fornells, Antoni; Münte, Thomas F
2004-06-01
The generation of random sequences is considered to tax different executive functions. To explore the involvement of these functions further, brain potentials were recorded in 16 healthy young adults while either engaging in random number generation (RNG) by pressing the number keys on a computer keyboard in a random sequence or in ordered number generation (ONG) necessitating key presses in the canonical order. Key presses were paced by an external auditory stimulus to yield either fast (1 press/800 ms) or slow (1 press/1300 ms) sequences in separate runs. Attentional demands of random and ordered tasks were assessed by the introduction of a secondary task (key-press to a target tone). The P3 amplitude to the target tone of this secondary task was reduced during RNG, reflecting the greater consumption of attentional resources during RNG. Moreover, RNG led to a left frontal negativity peaking 140 ms after the onset of the pacing stimulus, whenever the subjects produced a true random response. This negativity could be attributed to the left dorsolateral prefrontal cortex and was absent when numbers were repeated. This negativity was interpreted as an index for the inhibition of habitual responses. Finally, in response locked ERPs a negative component was apparent peaking about 50 ms after the key-press that was more prominent during RNG. Source localization suggested a medial frontal source. This effect was tentatively interpreted as a reflection of the greater monitoring demands during random sequence generation.
How random are random numbers generated using photons?
International Nuclear Information System (INIS)
Solis, Aldo; Angulo Martínez, Alí M; Ramírez Alarcón, Roberto; Cruz Ramírez, Hector; U’Ren, Alfred B; Hirsch, Jorge G
2015-01-01
Randomness is fundamental in quantum theory, with many philosophical and practical implications. In this paper we discuss the concept of algorithmic randomness, which provides a quantitative method to assess the Borel normality of a given sequence of numbers, a necessary condition for it to be considered random. We use Borel normality as a tool to investigate the randomness of ten sequences of bits generated from the differences between detection times of photon pairs generated by spontaneous parametric downconversion. These sequences are shown to fulfil the randomness criteria without difficulties. As deviations from Borel normality for photon-generated random number sequences have been reported in previous work, a strategy to understand these diverging findings is outlined. (paper)
The random signal generator of imitated nuclear radiation pulse
International Nuclear Information System (INIS)
Li Dongcang; Yang Lei; Yuan Shulin; Yang Yinghui; Zang Fujia
2007-01-01
Based in pseudo-random uniformity number, it produces random numbers of Gaussian distribution and exponential distribution by arithmetic. The hardware is the single-chip microcomputer of 89C51. Program language makes use of Keil C. The output pulse amplitude is Gaussian distribution, exponential distribution or uniformity distribution. Likewise, it has two mode or upwards two. The time alternation of output pulse is both periodic and exponential distribution. The generator has achieved output control of multi-mode distribution, imitated random characteristic of nuclear pulse in amplitude and in time. (authors)
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.
DNA-based random number generation in security circuitry.
Gearheart, Christy M; Arazi, Benjamin; Rouchka, Eric C
2010-06-01
DNA-based circuit design is an area of research in which traditional silicon-based technologies are replaced by naturally occurring phenomena taken from biochemistry and molecular biology. This research focuses on further developing DNA-based methodologies to mimic digital data manipulation. While exhibiting fundamental principles, this work was done in conjunction with the vision that DNA-based circuitry, when the technology matures, will form the basis for a tamper-proof security module, revolutionizing the meaning and concept of tamper-proofing and possibly preventing it altogether based on accurate scientific observations. A paramount part of such a solution would be self-generation of random numbers. A novel prototype schema employs solid phase synthesis of oligonucleotides for random construction of DNA sequences; temporary storage and retrieval is achieved through plasmid vectors. A discussion of how to evaluate sequence randomness is included, as well as how these techniques are applied to a simulation of the random number generation circuitry. Simulation results show generated sequences successfully pass three selected NIST random number generation tests specified for security applications.
Solution-Processed Carbon Nanotube True Random Number Generator.
Gaviria Rojas, William A; McMorrow, Julian J; Geier, Michael L; Tang, Qianying; Kim, Chris H; Marks, Tobin J; Hersam, Mark C
2017-08-09
With the growing adoption of interconnected electronic devices in consumer and industrial applications, there is an increasing demand for robust security protocols when transmitting and receiving sensitive data. Toward this end, hardware true random number generators (TRNGs), commonly used to create encryption keys, offer significant advantages over software pseudorandom number generators. However, the vast network of devices and sensors envisioned for the "Internet of Things" will require small, low-cost, and mechanically flexible TRNGs with low computational complexity. These rigorous constraints position solution-processed semiconducting single-walled carbon nanotubes (SWCNTs) as leading candidates for next-generation security devices. Here, we demonstrate the first TRNG using static random access memory (SRAM) cells based on solution-processed SWCNTs that digitize thermal noise to generate random bits. This bit generation strategy can be readily implemented in hardware with minimal transistor and computational overhead, resulting in an output stream that passes standardized statistical tests for randomness. By using solution-processed semiconducting SWCNTs in a low-power, complementary architecture to achieve TRNG, we demonstrate a promising approach for improving the security of printable and flexible electronics.
RANDOMNUMBERS, Random Number Sequence Generated from Gas Ionisation Chamber Data
International Nuclear Information System (INIS)
Frigerio, N.A.; Sanathanan, L.P.; Morley, M.; Tyler, S.A.; Clark, N.A.; Wang, J.
1989-01-01
1 - Description of problem or function: RANDOM NUMBERS is a data collection of almost 2.7 million 31-bit random numbers generated by using a high resolution gas ionization detector chamber in conjunction with a 4096-channel multichannel analyzer to record the radioactive decay of alpha particles from a U-235 source. The signals from the decaying alpha particles were fed to the 4096-channel analyzer, and for each channel the frequency of signals registered in a 20,000-microsecond interval was recorded. The parity bits of these frequency counts, 0 for an even count and 1 for and odd count, were then assembled in sequence to form 31-bit random numbers and transcribed onto magnetic tape. This cycle was repeated to obtain the random numbers. 2 - Method of solution: The frequency distribution of counts from the device conforms to the Brockwell-Moyal distribution which takes into account the dead time of the counter. The count data were analyzed and tests for randomness on a sample indicate that the device is a highly reliable source of truly random numbers. 3 - Restrictions on the complexity of the problem: The RANDOM NUMBERS tape contains 2,669,568 31-bit numbers
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)
Anosov C-systems and random number generators
Savvidy, G. K.
2016-08-01
We further develop our previous proposal to use hyperbolic Anosov C-systems to generate pseudorandom numbers and to use them for efficient Monte Carlo calculations in high energy particle physics. All trajectories of hyperbolic dynamical systems are exponentially unstable, and C-systems therefore have mixing of all orders, a countable Lebesgue spectrum, and a positive Kolmogorov entropy. These exceptional ergodic properties follow from the C-condition introduced by Anosov. This condition defines a rich class of dynamical systems forming an open set in the space of all dynamical systems. An important property of C-systems is that they have a countable set of everywhere dense periodic trajectories and their density increases exponentially with entropy. Of special interest are the C-systems defined on higher-dimensional tori. Such C-systems are excellent candidates for generating pseudorandom numbers that can be used in Monte Carlo calculations. An efficient algorithm was recently constructed that allows generating long C-system trajectories very rapidly. These trajectories have good statistical properties and can be used for calculations in quantum chromodynamics and in high energy particle physics.
Analysis of entropy extraction efficiencies in random number generation systems
Wang, Chao; Wang, Shuang; Chen, Wei; Yin, Zhen-Qiang; Han, Zheng-Fu
2016-05-01
Random numbers (RNs) have applications in many areas: lottery games, gambling, computer simulation, and, most importantly, cryptography [N. Gisin et al., Rev. Mod. Phys. 74 (2002) 145]. In cryptography theory, the theoretical security of the system calls for high quality RNs. Therefore, developing methods for producing unpredictable RNs with adequate speed is an attractive topic. Early on, despite the lack of theoretical support, pseudo RNs generated by algorithmic methods performed well and satisfied reasonable statistical requirements. However, as implemented, those pseudorandom sequences were completely determined by mathematical formulas and initial seeds, which cannot introduce extra entropy or information. In these cases, “random” bits are generated that are not at all random. Physical random number generators (RNGs), which, in contrast to algorithmic methods, are based on unpredictable physical random phenomena, have attracted considerable research interest. However, the way that we extract random bits from those physical entropy sources has a large influence on the efficiency and performance of the system. In this manuscript, we will review and discuss several randomness extraction schemes that are based on radiation or photon arrival times. We analyze the robustness, post-processing requirements and, in particular, the extraction efficiency of those methods to aid in the construction of efficient, compact and robust physical RNG systems.
Ultrafast quantum random number generation based on quantum phase fluctuations.
Xu, Feihu; Qi, Bing; Ma, Xiongfeng; Xu, He; Zheng, Haoxuan; Lo, Hoi-Kwong
2012-05-21
A quantum random number generator (QRNG) can generate true randomness by exploiting the fundamental indeterminism of quantum mechanics. Most approaches to QRNG employ single-photon detection technologies and are limited in speed. Here, we experimentally demonstrate an ultrafast QRNG at a rate over 6 Gbits/s based on the quantum phase fluctuations of a laser operating near threshold. Moreover, we consider a potential adversary who has partial knowledge on the raw data and discuss how one can rigorously remove such partial knowledge with postprocessing. We quantify the quantum randomness through min-entropy by modeling our system and employ two randomness extractors--Trevisan's extractor and Toeplitz-hashing--to distill the randomness, which is information-theoretically provable. The simplicity and high-speed of our experimental setup show the feasibility of a robust, low-cost, high-speed QRNG.
Quantum Statistical Testing of a Quantum Random Number Generator
Energy Technology Data Exchange (ETDEWEB)
Humble, Travis S [ORNL
2014-01-01
The unobservable elements in a quantum technology, e.g., the quantum state, complicate system verification against promised behavior. Using model-based system engineering, we present methods for verifying the opera- tion of a prototypical quantum random number generator. We begin with the algorithmic design of the QRNG followed by the synthesis of its physical design requirements. We next discuss how quantum statistical testing can be used to verify device behavior as well as detect device bias. We conclude by highlighting how system design and verification methods must influence effort to certify future quantum technologies.
Quantum random number generator based on quantum tunneling effect
Zhou, Haihan; Li, Junlin; Pan, Dong; Zhang, Weixing; Long, Guilu
2017-01-01
In this paper, we proposed an experimental implementation of quantum random number generator(QRNG) with inherent randomness of quantum tunneling effect of electrons. We exploited InGaAs/InP diodes, whose valance band and conduction band shared a quasi-constant energy barrier. We applied a bias voltage on the InGaAs/InP avalanche diode, which made the diode works under Geiger mode, and triggered the tunneling events with a periodic pulse. Finally, after data collection and post-processing, our...
Problem of uniqueness in the renewal process generated by the uniform distribution
Directory of Open Access Journals (Sweden)
D. Ugrin-parac
1992-01-01
Full Text Available The renewal process generated by the uniform distribution, when interpreted as a transformation of the uniform distribution into a discrete distribution, gives rise to the question of uniqueness of the inverse image. The paper deals with a particular problem from the described domain, that arose in the construction of a complex stochastic test intended to evaluate pseudo-random number generators. The connection of the treated problem with the question of a unique integral representation of Gamma-function is also mentioned.
Origin of inertia at rest and the number of generations
International Nuclear Information System (INIS)
Alonso, J.L.; Azcoiti, V.; Cruz, A.
1982-01-01
A new scenario is suggested for the discussion of the old problem of generations. We shall assume that the rest mass m of a particle described by the Lagrangian L(x) = -m(1-x 2 )/sup 1/2/ has its origin in the momentum p/sub theta/, canonical conjugate of a supplementary dimension of space, beyond the usual four dimensions. More precisely, we shall contemplate the possibility that the different generations, or for definiteness, the charged leptons e,μ,tau,. . . are states, with different p/sub theta/, of a unique physical system, whose free Lagrangian will depend on theta-dot in addition to x: L(x,theta-dot). The requirement that the relativistic relationship between the momentum p/sub x/ and velocity x is maintained in five dimensions leads to the simplest Lagrangian L(x,theta-dot) = -Λ(1-x 2 ) [-theta-dot / (1-x 2 )/sup 1/2/], Λ being a constant with dimension [theta] -1 . With this Lagrangian, the function of p/sub theta/ that plays the role of the mass in the usual relativistic relation between p/sub x/ and x is m(p/sub theta/) = p/sub theta/(1-βlnp/sub theta//Λ). The quantization of momentum p/sub theta/ with periodic conditions leads to a mass spectrum compatible with experimental data only if the number of generations is three. In the present work we consider that the mass differences within each generation should be explained in the context of grand unified theories (GUT's). In the last section, though, the complementary information that GUT's might supply in our context is suggested, and a value for the mass of the top quark and a bound for the mass of the tau neutrino are obtained
Private random numbers produced by entangled ions and certified by Bell's theorem
Hayes, David; Matsukevich, Dzmitry; Maunz, Peter; Monroe, Chris; Olmschenk, Steven
2010-03-01
It has been shown that entangled particles can be used to generate numbers whose privacy and randomness are guaranteed by the violation of a Bell inequality [1,2]. The authenticity of the bit stream produced is guaranteed when the system used can close the detection loophole and when the entangled particles are non-interacting. We report the use of remotely located trapped ions with near perfect state detection efficiency as a private random number generator. By entangling the ions through photon interference and choosing the measurement settings using a pseudo-random number generator, we measure a CHSH correlation function that is more than seven standard deviations above the classical limit. With a total of 3016 events, we are able to certify the generation of 42 new random numbers with 99% confidence. [1] S. Pironio et al.(submitted to Nature, arXiv:0911.3427) [2] Colbeck, R. PhD Dissertation (2007)
Fast physical random bit generation with chaotic semiconductor lasers
Uchida, Atsushi; Amano, Kazuya; Inoue, Masaki; Hirano, Kunihito; Naito, Sunao; Someya, Hiroyuki; Oowada, Isao; Kurashige, Takayuki; Shiki, Masaru; Yoshimori, Shigeru; Yoshimura, Kazuyuki; Davis, Peter
2008-12-01
Random number generators in digital information systems make use of physical entropy sources such as electronic and photonic noise to add unpredictability to deterministically generated pseudo-random sequences. However, there is a large gap between the generation rates achieved with existing physical sources and the high data rates of many computation and communication systems; this is a fundamental weakness of these systems. Here we show that good quality random bit sequences can be generated at very fast bit rates using physical chaos in semiconductor lasers. Streams of bits that pass standard statistical tests for randomness have been generated at rates of up to 1.7 Gbps by sampling the fluctuating optical output of two chaotic lasers. This rate is an order of magnitude faster than that of previously reported devices for physical random bit generators with verified randomness. This means that the performance of random number generators can be greatly improved by using chaotic laser devices as physical entropy sources.
Generative Learning Objects Instantiated with Random Numbers Based Expressions
Directory of Open Access Journals (Sweden)
Ciprian Bogdan Chirila
2015-12-01
Full Text Available The development of interactive e-learning content requires special skills like programming techniques, web integration, graphic design etc. Generally, online educators do not possess such skills and their e-learning products tend to be static like presentation slides and textbooks. In this paper we propose a new interactive model of generative learning objects as a compromise betweenstatic, dull materials and dynamic, complex software e-learning materials developed by specialized teams. We find that random numbers based automatic initialization learning objects increases content diversity, interactivity thus enabling learners’ engagement. The resulted learning object model is at a limited level of complexity related to special e-learning software, intuitive and capable of increasing learners’ interactivity, engagement and motivation through dynamic content. The approach was applied successfully on several computer programing disciplines.
Statistical evaluation of PACSTAT random number generation capabilities
Energy Technology Data Exchange (ETDEWEB)
Piepel, G.F.; Toland, M.R.; Harty, H.; Budden, M.J.; Bartley, C.L.
1988-05-01
This report summarizes the work performed in verifying the general purpose Monte Carlo driver-program PACSTAT. The main objective of the work was to verify the performance of PACSTAT's random number generation capabilities. Secondary objectives were to document (using controlled configuration management procedures) changes made in PACSTAT at Pacific Northwest Laboratory, and to assure that PACSTAT input and output files satisfy quality assurance traceability constraints. Upon receipt of the PRIME version of the PACSTAT code from the Basalt Waste Isolation Project, Pacific Northwest Laboratory staff converted the code to run on Digital Equipment Corporation (DEC) VAXs. The modifications to PACSTAT were implemented using the WITNESS configuration management system, with the modifications themselves intended to make the code as portable as possible. Certain modifications were made to make the PACSTAT input and output files conform to quality assurance traceability constraints. 10 refs., 17 figs., 6 tabs.
Efficient Raman generation in a waveguide: A route to ultrafast quantum random number generation
Energy Technology Data Exchange (ETDEWEB)
England, D. G.; Bustard, P. J.; Moffatt, D. J.; Nunn, J.; Lausten, R.; Sussman, B. J., E-mail: ben.sussman@nrc.ca [National Research Council of Canada, 100 Sussex Drive, Ottawa, Ontario K1A 0R6 (Canada)
2014-02-03
The inherent uncertainty in quantum mechanics offers a source of true randomness which can be used to produce unbreakable cryptographic keys. We discuss the development of a high-speed random number generator based on the quantum phase fluctuations in spontaneously initiated stimulated Raman scattering (SISRS). We utilize the tight confinement and long interaction length available in a Potassium Titanyl Phosphate waveguide to generate highly efficient SISRS using nanojoule pulse energies, reducing the high pump power requirements of the previous approaches. We measure the random phase of the Stokes output using a simple interferometric setup to yield quantum random numbers at 145 Mbps.
Random number generation as an index of controlled processing.
Jahanshahi, Marjan; Saleem, T; Ho, Aileen K; Dirnberger, Georg; Fuller, R
2006-07-01
Random number generation (RNG) is a functionally complex process that is highly controlled and therefore dependent on Baddeley's central executive. This study addresses this issue by investigating whether key predictions from this framework are compatible with empirical data. In Experiment 1, the effect of increasing task demands by increasing the rate of the paced generation was comprehensively examined. As expected, faster rates affected performance negatively because central resources were increasingly depleted. Next, the effects of participants' exposure were manipulated in Experiment 2 by providing increasing amounts of practice on the task. There was no improvement over 10 practice trials, suggesting that the high level of strategic control required by the task was constant and not amenable to any automatization gain with repeated exposure. Together, the results demonstrate that RNG performance is a highly controlled and demanding process sensitive to additional demands on central resources (Experiment 1) and is unaffected by repeated performance or practice (Experiment 2). These features render the easily administered RNG task an ideal and robust index of executive function that is highly suitable for repeated clinical use. ((c) 2006 APA, all rights reserved).
Random Numbers and Monte Carlo Methods
Scherer, Philipp O. J.
Many-body problems often involve the calculation of integrals of very high dimension which cannot be treated by standard methods. For the calculation of thermodynamic averages Monte Carlo methods are very useful which sample the integration volume at randomly chosen points. After summarizing some basic statistics, we discuss algorithms for the generation of pseudo-random numbers with given probability distribution which are essential for all Monte Carlo methods. We show how the efficiency of Monte Carlo integration can be improved by sampling preferentially the important configurations. Finally the famous Metropolis algorithm is applied to classical many-particle systems. Computer experiments visualize the central limit theorem and apply the Metropolis method to the traveling salesman problem.
Generating Small Numbers by Tunneling in Multi-Throat Compactifications
Energy Technology Data Exchange (ETDEWEB)
Silverstein, Eva M
2001-07-25
A generic F-theory compactification containing many D3 branes develops multiple brane throats. The interaction of observers residing inside different throats involves tunneling suppression and, as a result, is very weak. This suggests a new mechanism for generating small numbers in Nature. One application is to the hierarchy problem: large supersymmetry breaking near the unification scale inside a shallow throat causes TeV-scale SUSY-breaking inside the standard-model throat. Another application, inspired by nuclear-decay, is in designing naturally long-lived particles: a cold dark matter particle residing near the standard model brane decays to an approximate CFT-state of a longer throat within a Hubble time. This suggests that most of the mass of the universe today could consist of CFT-matter and may soften structure formation at sub-galactic scales. The tunneling calculation demonstrates that the coupling between two throats is dominated by higher dimensional modes and consequently is much larger than a naive application of holography might suggest.
Random-Number Generator Validity in Simulation Studies: An Investigation of Normality.
Bang, Jung W.; Schumacker, Randall E.; Schlieve, Paul L.
1998-01-01
The normality of number distributions generated by various random-number generators were studied, focusing on when the random-number generator reached a normal distribution and at what sample size. Findings suggest the steps that should be followed when using a random-number generator in a Monte Carlo simulation. (SLD)
Imagining Complex Numbers by Generating, Interpreting and Representing Them
Vozzo, Enzo
2017-01-01
Ever since their serendipitous discovery by Italian mathematicians trying to solve cubic equations in the 16th century, imaginary and complex numbers have been difficult topics to understand. Here the word complex is used to describe something consisting of a number of interconnecting parts. The different parts of a complex number are the…
A measuring generator for testing spectrometric channels
International Nuclear Information System (INIS)
Dinh Sy Hien; Kalinkin, A.I.
1984-01-01
A measuring generator for testing and tuning an amplitude spectrometric channel is described. The device consists of a pseudo random pulse generator, constructed on shifters, a sawtooth wave generator and a shaper of stable amplitude pulses with exponential decay times. The device is made as CAMAC unit width modules and has the following specifications: average pulse repetition rate of pseudo random pulses is 3.1; 25; 50; 100; 200 kHz; peak amplitude of 2 Hz pulse repetition of saw tooth pulses is 6 V; peak amplitude of exponential shape pulses is 5 V. The block-diagram and basic circuits of the device are given
A random number generator for continuous random variables
Guerra, V. M.; Tapia, R. A.; Thompson, J. R.
1972-01-01
A FORTRAN 4 routine is given which may be used to generate random observations of a continuous real valued random variable. Normal distribution of F(x), X, E(akimas), and E(linear) is presented in tabular form.
Nonquadratic Variation of the Blum Blum Shub Pseudorandom Number Generator
2016-09-01
analyzes it for repetition and periodic behavior . Theoretically, in a random sequence , 95 percent of the values will not exceed T , where T is given by the...excursion of random walks within a sequence . A random walk can be defined in terms of a graph. First, this test changes all zeroes within the tested...Technology (NIST) tests. The original BBS is a quadratic generator that generates bits based on the output of squaring terms in a sequence . The first
Generation of sub-Poissonian photon number distribution
DEFF Research Database (Denmark)
Grønbech-Jensen, N.; Ramanujam, P. S.
1990-01-01
An optimization of a nonlinear Mach-Zehnder interferometer to produce sub-Poissonian photon number distribution is proposed. We treat the system quantum mechanically and estimate the mirror parameters, the nonlinearity of the medium in the interferometer, and the input power to obtain minimal...... output uncertainty in the photon number. The power efficiency of the system is shown to be high....
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.
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
Spreading Sequences Generated Using Asymmetrical Integer-Number Maps
Directory of Open Access Journals (Sweden)
V. Sebesta
2007-09-01
Full Text Available Chaotic sequences produced by piecewise linear maps can be transformed to binary sequences. The binary sequences are optimal for the asynchronous DS/CDMA systems in case of certain shapes of the maps. This paper is devoted to the one-to-one integer-number maps derived from the suitable asymmetrical piecewise linear maps. Such maps give periodic integer-number sequences, which can be transformed to the binary sequences. The binary sequences produced via proposed modified integer-number maps are perfectly balanced and embody good autocorrelation and crosscorrelation properties. The number of different binary sequences is sizable. The sequences are suitable as spreading sequences in DS/CDMA systems.
The Multiplicative Group Generated by the Lehmer Numbers
Czech Academy of Sciences Publication Activity Database
Luca, F.; Porubský, Štefan
2003-01-01
Roč. 41, - (2003), s. 122-132 ISSN 0015-0517 Institutional research plan: AV0Z1030915 Keywords : Lehmer numbers * primitive prime divisor * multiplicative subgroup Subject RIV: BA - General Mathematics Impact factor: 0.180, year: 2003
Generating bit reversed numbers for calculating fast fourier transform
Digital Repository Service at National Institute of Oceanography (India)
Suresh, T.
prerequisite of these methods are that data elements be available for shuffling in an array. Thus in a software environment, if the input data values are to be read from a file, reordering can be done only after al1 the values have been read into the array.... Alternately, data values can be read and placed directly at respective bit reversed positions by generating bit reversed addresses. Such a method can help in real-time data acquisition and FFT calculation. Thus, an efficient method of generating sequence...
Repowering analysis: Hanford Generating Project (HGP), Task Order Number 6
International Nuclear Information System (INIS)
1988-12-01
The Hanford Generating Project (HGP), owned by the Washington Public Power Supply System, consists of two low pressure steam turbines, generators, and associated equipment located adjacent to the Department of Energy's (DOE) N-Reactor. HGP has been able to produce approximately 800 MWe with low pressure steam supplied by N-Reactor. DOE has placed N-Reactor in cold standby status for an undetermined length of time. This results in the idling of the HGP since no alternative source of steam is available. Bonneville Power Administration contracted with Fluor Daniel, Inc. to investigate the feasibility and cost of constructing a new source of steam for (repowering) one of the HGP turbines. The steam turbine is currently operated with 135 psia steam. The turbines can be rebuilt to operate with 500 psia steam pressure by adding additional stages, buckets, nozzles, and diaphragms. Because of the low pressure design, this turbine can never achieve the efficiencies possible in new high pressure turbines by the presences of existing equipment reduces the capital cost of a new generating resource. Five repowering options were investigated in this study. Three cases utilizing gas turbine combined cycle steam generation equipment, one case utilizing a gas fired boiler, and a case utilizing a coal fired boiler. This report presents Fluor Daniel's analysis of these repowering options
Exotic dynamically generated baryons with negative charm quantum number
Gamermann, D.; Garcia-Recio, C.; Nieves, J.; Salcedo, L. L.; Tolos, L.
2010-01-01
Following a model based on the SU(8) symmetry that treats heavy pseudoscalars and heavy vector mesons on an equal footing, as required by heavy quark symmetry, we study the interaction of baryons and mesons in coupled channels within an unitary approach that generates dynamically poles in the
On-chip generation of heralded photon-number states
Vergyris, Panagiotis; Meany, Thomas; Lunghi, Tommaso; Sauder, Gregory; Downes, James; Steel, M. J.; Withford, Michael J.; Alibart, Olivier; Tanzilli, Sébastien
2016-10-01
Beyond the use of genuine monolithic integrated optical platforms, we report here a hybrid strategy enabling on-chip generation of configurable heralded two-photon states. More specifically, we combine two different fabrication techniques, i.e., non-linear waveguides on lithium niobate for efficient photon-pair generation and femtosecond-laser-direct-written waveguides on glass for photon manipulation. Through real-time device manipulation capabilities, a variety of path-coded heralded two-photon states can be produced, ranging from product to entangled states. Those states are engineered with high levels of purity, assessed by fidelities of 99.5 ± 8% and 95.0 ± 8%, respectively, obtained via quantum interferometric measurements. Our strategy therefore stands as a milestone for further exploiting entanglement-based protocols, relying on engineered quantum states, and enabled by scalable and compatible photonic circuits.
International Nuclear Information System (INIS)
Bluszcz, Andrzej; Adamiec, Grzegorz; Heer, Aleksandra J.
2015-01-01
The current work focuses on the estimation of equivalent dose and its uncertainty using the single aliquot regenerative protocol in optically stimulated luminescence measurements. The authors show that the count numbers recorded with the use of photomultiplier tubes are well described by negative binomial distributions, different ones for background counts and photon induced counts. This fact is then exploited in pseudo-random count number generation and simulations of D e determination assuming a saturating exponential growth. A least squares fitting procedure is applied using different types of weights to determine whether the obtained D e 's and their error estimates are unbiased and accurate. A weighting procedure is suggested that leads to almost unbiased D e estimates. It is also shown that the assumption of Poisson distribution in D e estimation may lead to severe underestimation of the D e error. - Highlights: • Detailed analysis of statistics of count numbers in luminescence readers. • Generation of realistically scattered pseudo-random numbers of counts in luminescence measurements. • A practical guide for stringent analysis of D e values and errors assessment.
Directory of Open Access Journals (Sweden)
Peifeng Xu
2017-05-01
Full Text Available Dual rotor permanent magnet (DRPM wind power generator using ferrite magnets has the advantages of low cost, high efficiency, and high torque density. How to further improve the performance and reduce the cost of the machine by proper choice of pole number and slot number is an important problem to be solved when performing preliminarily design a DRPM wind generator. This paper presents a comprehensive performance comparison of a DRPM wind generator using ferrite magnets with different slot and pole number combinations. The main winding factors are calculated by means of the star of slots. Under the same machine volume and ferrite consumption, the flux linkage, back-electromotive force (EMF, cogging torque, output torque, torque pulsation, and losses are investigated and compared using finite element analysis (FEA. The results show that the slot and pole number combinations have an important impact on the generator properties.
An X-ray CCD signal generator with true random arrival time
International Nuclear Information System (INIS)
Huo Jia; Xu Yuming; Chen Yong; Cui Weiwei; Li Wei; Zhang Ziliang; Han Dawei; Wang Yusan; Wang Juan
2011-01-01
An FPGA-based true random signal generator with adjustable amplitude and exponential distribution of time interval is presented. Since traditional true random number generators (TRNG) are resource costly and difficult to transplant, we employed a method of random number generation based on jitter and phase noise in ring oscillators formed by gates in an FPGA. In order to improve the random characteristics, a combination of two different pseudo-random processing circuits is used for post processing. The effects of the design parameters, such as sample frequency are discussed. Statistical tests indicate that the generator can well simulate the timing behavior of random signals with Poisson distribution. The X-ray CCD signal generator will be used in debugging the CCD readout system of the Low Energy X-ray Instrument onboard the Hard X-ray Modulation Telescope (HXMT). (authors)
Generation and reception of spread-spectrum signals
Moser, R.
1983-05-01
The term 'spread-spectrum' implies a technique whereby digitized information is added to a pseudo-random number sequence and the resultant bit stream changes some parameter of the carrier frequency in discrete increments. The discrete modulation of the carrier frequency is usually realized either as a multiple level phase shift keyed or frequency shift keyed signal. The resultant PSK-modulated frequency spectrum is referred to as direct sequence spread-spectrum, whereas the FSK-modulated carrier frequency is referred to as a frequency hopped spread spectrum. These can be considered the major subsets of the more general term 'spread-spectrum'. In discussing signal reception, it is pointed out that active correlation methods are used for channel synchronization when the psuedo random sequences are long or when the processing gain is large, whereas the passive methods may be used for either short pseudo-random noise generation codes or to assist in attaining initial synchronization in long sequence spread-spectrum systems.
Persaud, Navindra
2005-01-01
Computer algorithms can only produce seemingly random or pseudorandom numbers whereas certain natural phenomena, such as the decay of radioactive particles, can be utilized to produce truly random numbers. In this study, the ability of humans to generate random numbers was tested in healthy adults. Subjects were simply asked to generate and dictate random numbers. Generated numbers were tested for uniformity, independence and information density. The results suggest that humans can generate random numbers that are uniformly distributed, independent of one another and unpredictable. If humans can generate sequences of random numbers then neural networks or forms of artificial intelligence, which are purported to function in ways essentially the same as the human brain, should also be able to generate sequences of random numbers. Elucidating the precise mechanism by which humans generate random number sequences and the underlying neural substrates may have implications in the cognitive science of decision-making. It is possible that humans use their random-generating neural machinery to make difficult decisions in which all expected outcomes are similar. It is also possible that certain people, perhaps those with neurological or psychiatric impairments, are less able or unable to generate random numbers. If the random-generating neural machinery is employed in decision making its impairment would have profound implications in matters of agency and free will.
25 CFR 547.14 - What are the minimum technical standards for electronic random number generation?
2010-04-01
... random number generation? 547.14 Section 547.14 Indians NATIONAL INDIAN GAMING COMMISSION, DEPARTMENT OF... CLASS II GAMES § 547.14 What are the minimum technical standards for electronic random number generation...) Unpredictability; and (3) Non-repeatability. (b) Statistical Randomness.(1) Numbers produced by an RNG shall be...
Using Computer-Generated Random Numbers to Calculate the Lifetime of a Comet.
Danesh, Iraj
1991-01-01
An educational technique to calculate the lifetime of a comet using software-generated random numbers is introduced to undergraduate physiques and astronomy students. Discussed are the generation and eligibility of the required random numbers, background literature related to the problem, and the solution to the problem using random numbers.…
DEFF Research Database (Denmark)
Kristensen, L. E.; Jakobsen, A. K.; Bartels, E. M.
2011-01-01
To evaluate the number needed to treat (NNT) and the number needed to harm (NNH) of the second-generation biologics abatacept, certolizumab, golimumab, rituximab, and tocilizumab in patients with established rheumatoid arthritis (RA) taking concomitant methotrexate (MTX)....
Directory of Open Access Journals (Sweden)
Romer C. Castillo
2015-11-01
Full Text Available This study established some recurrence relations and exponential generating functions of the sequence of factoriangular numbers. A factoriangular number is defined as a sum of corresponding factorial and triangular number. The proofs utilize algebraic manipulations with some known results from calculus, particularly on power series and Maclaurin’s series. The recurrence relations were found by manipulating the formula defining a factoringular number while the ascertained exponential generating functions were in the closed form.
DEFF Research Database (Denmark)
Kristensen, L E; Jakobsen, A K; Bartels, E M
2011-01-01
To evaluate the number needed to treat (NNT) and the number needed to harm (NNH) of the second-generation biologics abatacept, certolizumab, golimumab, rituximab, and tocilizumab in patients with established rheumatoid arthritis (RA) taking concomitant methotrexate (MTX).......To evaluate the number needed to treat (NNT) and the number needed to harm (NNH) of the second-generation biologics abatacept, certolizumab, golimumab, rituximab, and tocilizumab in patients with established rheumatoid arthritis (RA) taking concomitant methotrexate (MTX)....
True random numbers from amplified quantum vacuum.
Jofre, M; Curty, M; Steinlechner, F; Anzolin, G; Torres, J P; Mitchell, M W; Pruneri, V
2011-10-10
Random numbers are essential for applications ranging from secure communications to numerical simulation and quantitative finance. Algorithms can rapidly produce pseudo-random outcomes, series of numbers that mimic most properties of true random numbers while quantum random number generators (QRNGs) exploit intrinsic quantum randomness to produce true random numbers. Single-photon QRNGs are conceptually simple but produce few random bits per detection. In contrast, vacuum fluctuations are a vast resource for QRNGs: they are broad-band and thus can encode many random bits per second. Direct recording of vacuum fluctuations is possible, but requires shot-noise-limited detectors, at the cost of bandwidth. We demonstrate efficient conversion of vacuum fluctuations to true random bits using optical amplification of vacuum and interferometry. Using commercially-available optical components we demonstrate a QRNG at a bit rate of 1.11 Gbps. The proposed scheme has the potential to be extended to 10 Gbps and even up to 100 Gbps by taking advantage of high speed modulation sources and detectors for optical fiber telecommunication devices.
Planet map generation by tetrahedral subdivision
DEFF Research Database (Denmark)
Mogensen, Torben Ægidius
2010-01-01
We present a method for generating pseudo-random, zoomable planet maps for games and art. The method is based on spatial subdivision using tetrahedrons. This ensures planet maps without discontinuities caused by mapping a flat map onto a sphere. We compare the method to other map...
Problems with the random number generator RANF implemented on the CDC cyber 205
Kalle, Claus; Wansleben, Stephan
1984-10-01
We show that using RANF may lead to wrong results when lattice models are simulated by Monte Carlo methods. We present a shift-register sequence random number generator which generates two random numbers per cycle on a two pipe CDC Cyber 205.
A method for generating skewed random numbers using two overlapping uniform distributions
International Nuclear Information System (INIS)
Ermak, D.L.; Nasstrom, J.S.
1995-02-01
The objective of this work was to implement and evaluate a method for generating skewed random numbers using a combination of uniform random numbers. The method provides a simple and accurate way of generating skewed random numbers from the specified first three moments without an a priori specification of the probability density function. We describe the procedure for generating skewed random numbers from unifon-n random numbers, and show that it accurately produces random numbers with the desired first three moments over a range of skewness values. We also show that in the limit of zero skewness, the distribution of random numbers is an accurate approximation to the Gaussian probability density function. Future work win use this method to provide skewed random numbers for a Langevin equation model for diffusion in skewed turbulence
Noise generator for tinnitus treatment based on look-up tables
Uriz, Alejandro J.; Agüero, Pablo; Tulli, Juan C.; Castiñeira Moreira, Jorge; González, Esteban; Hidalgo, Roberto; Casadei, Manuel
2016-04-01
Treatment of tinnitus by means of masking sounds allows to obtain a significant improve of the quality of life of the individual that suffer that condition. In view of that, it is possible to develop noise synthesizers based on random number generators in digital signal processors (DSP), which are used in almost any digital hearing aid devices. DSP architecture have limitations to implement a pseudo random number generator, due to it, the noise statistics can be not as good as expectations. In this paper, a technique to generate additive white gaussian noise (AWGN) or other types of filtered noise using coefficients stored in program memory of the DSP is proposed. Also, an implementation of the technique is carried out on a dsPIC from Microchip®. Objective experiments and experimental measurements are performed to analyze the proposed technique.
Pseudorandom number generation using chaotic true orbits of the Bernoulli map
Energy Technology Data Exchange (ETDEWEB)
Saito, Asaki, E-mail: saito@fun.ac.jp [Future University Hakodate, 116-2 Kamedanakano-cho, Hakodate, Hokkaido 041-8655 (Japan); Yamaguchi, Akihiro [Fukuoka Institute of Technology, 3-30-1 Wajiro-higashi, Higashi-ku, Fukuoka 811-0295 (Japan)
2016-06-15
We devise a pseudorandom number generator that exactly computes chaotic true orbits of the Bernoulli map on quadratic algebraic integers. Moreover, we describe a way to select the initial points (seeds) for generating multiple pseudorandom binary sequences. This selection method distributes the initial points almost uniformly (equidistantly) in the unit interval, and latter parts of the generated sequences are guaranteed not to coincide. We also demonstrate through statistical testing that the generated sequences possess good randomness properties.
Post-processing Free Quantum Random Number Generator Based on Avalanche Photodiode Array
International Nuclear Information System (INIS)
Li Yang; Liao Sheng-Kai; Liang Fu-Tian; Shen Qi; Liang Hao; Peng Cheng-Zhi
2016-01-01
Quantum random number generators adopting single photon detection have been restricted due to the non-negligible dead time of avalanche photodiodes (APDs). We propose a new approach based on an APD array to improve the generation rate of random numbers significantly. This method compares the detectors' responses to consecutive optical pulses and generates the random sequence. We implement a demonstration experiment to show its simplicity, compactness and scalability. The generated numbers are proved to be unbiased, post-processing free, ready to use, and their randomness is verified by using the national institute of standard technology statistical test suite. The random bit generation efficiency is as high as 32.8% and the potential generation rate adopting the 32 × 32 APD array is up to tens of Gbits/s. (paper)
Levels for Hotline Miami 2: Wrong Number Using Procedural Content Generations
Directory of Open Access Journals (Sweden)
Joseph Alexander Brown
2018-04-01
Full Text Available Procedural Content Generation is the automatic process for generating game content in order to allow for a decrease in developer resources while adding to the replayability of a digital game. It has been found to be highly effective as a method when utilized in rougelike games, of which Hotline Miami 2: Wrong Number shares a number of factors. Search based procedural content, in this case, a genetic algorithm, allows for the creation of levels which meet with a number of designer set requirements. The generator proposed provides for an automatic creation of game content for a commercially available game: the level design, object placement, and enemy placement.
Improved method of generating bit reversed numbers for calculating fast fourier transform
Digital Repository Service at National Institute of Oceanography (India)
Suresh, T.
Fast Fourier Transform (FFT) is an important tool required for signal processing in defence applications. This paper reports an improved method for generating bit reversed numbers needed in calculating FFT using radix-2. The refined algorithm takes...
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.
A Comparison of Three Random Number Generators for Aircraft Dynamic Modeling Applications
Grauer, Jared A.
2017-01-01
Three random number generators, which produce Gaussian white noise sequences, were compared to assess their suitability in aircraft dynamic modeling applications. The first generator considered was the MATLAB (registered) implementation of the Mersenne-Twister algorithm. The second generator was a website called Random.org, which processes atmospheric noise measured using radios to create the random numbers. The third generator was based on synthesis of the Fourier series, where the random number sequences are constructed from prescribed amplitude and phase spectra. A total of 200 sequences, each having 601 random numbers, for each generator were collected and analyzed in terms of the mean, variance, normality, autocorrelation, and power spectral density. These sequences were then applied to two problems in aircraft dynamic modeling, namely estimating stability and control derivatives from simulated onboard sensor data, and simulating flight in atmospheric turbulence. In general, each random number generator had good performance and is well-suited for aircraft dynamic modeling applications. Specific strengths and weaknesses of each generator are discussed. For Monte Carlo simulation, the Fourier synthesis method is recommended because it most accurately and consistently approximated Gaussian white noise and can be implemented with reasonable computational effort.
A portable high-quality random number generator for lattice field theory simulations
International Nuclear Information System (INIS)
Luescher, M.
1993-09-01
The theory underlying a proposed random number generator for numerical simulations in elementary particle physics and statistical mechanics is discussed. The generator is based on an algorithm introduced by Marsaglia and Zaman, with an important added feature leading to demonstrably good statistical properties. It can be implemented exactly on any computer complying with the IEEE-754 standard for single precision floating point arithmetic. (orig.)
Number concentrations of solid particles from the spinning top aerosol generator
International Nuclear Information System (INIS)
Mitchell, J.P.
1983-02-01
A spinning top aerosol generator has been used to generate monodisperse methylene blue particles in the size range from 0.6 to 6 μm. The number concentrations of these aerosols have been determined by means of an optical particle counter and compared with the equivalent measurements obtained by filter collection and microscopy. (author)
Kanter, Ido; Butkovski, Maria; Peleg, Yitzhak; Zigzag, Meital; Aviad, Yaara; Reidler, Igor; Rosenbluh, Michael; Kinzel, Wolfgang
2010-08-16
Random bit generators (RBGs) constitute an important tool in cryptography, stochastic simulations and secure communications. The later in particular has some difficult requirements: high generation rate of unpredictable bit strings and secure key-exchange protocols over public channels. Deterministic algorithms generate pseudo-random number sequences at high rates, however, their unpredictability is limited by the very nature of their deterministic origin. Recently, physical RBGs based on chaotic semiconductor lasers were shown to exceed Gbit/s rates. Whether secure synchronization of two high rate physical RBGs is possible remains an open question. Here we propose a method, whereby two fast RBGs based on mutually coupled chaotic lasers, are synchronized. Using information theoretic analysis we demonstrate security against a powerful computational eavesdropper, capable of noiseless amplification, where all parameters are publicly known. The method is also extended to secure synchronization of a small network of three RBGs.
On random number generators providing convergence more rapid than 1/√N
International Nuclear Information System (INIS)
Belov, V.A.
1982-01-01
To realize the simulation of processes in High Energy Physics a practical test of the efficiency in applying quasirandom numbers to check multiple integration with Monte-Karlo method is presented together with the comparison of the wellknown generators of quasirandom and pseudorandom numbers [ru
Molotkov, S. N.
2017-03-01
Various methods for the clustering of photocounts constituting a sequence of random numbers are considered. It is shown that the clustering of photocounts resulting in the Fermi-Dirac distribution makes it possible to achieve the theoretical limit of the random number generation rate.
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.
Strenge, Hans; Niederberger, Uwe
2008-06-01
The interference effect between Grooved Pegboard task with either hand and the executive task of cued verbal random number generation was investigated. 24 normal right-handed subjects performed each task under separate (single-task) and concurrent (dual-task) conditions. Articulatory suppression was required as an additional secondary task during pegboard performance. Analysis indicated an unambiguous distinction between the two hands. Comparisons of single-task and dual-task conditions showed an asymmetrical pattern of unidirectional interference with no practice effects during pegboard performance. Concurrent performance with nondominant hand but not the dominant hand of random number generation performance became continuously slower. There was no effect of divided attention on pegboard performance. Findings support the idea that the nondominant hand on the pegboard and random number tasks draw from the same processing resources but that for the executive aspect random number generation is more sensitive to changes in allocation of attentional resources.
Fibre bundle varieties and the number of generations of elementary particles
International Nuclear Information System (INIS)
Ross, D.K.
1985-01-01
The idea is presented that the number of generations of elementary particles in a gauge theory characterised by a given Lie algebra is the same as the number of topologically distinct principal fibre bundles with a structure group having the same Lie algebra and R 3 -(0) as base space. Two different generations thus have a different global structure or 'twist' to their fibre bundles. It is found that at most three generations are allowed for groups with the same Lie algebra as E 6 , at most four generations for groups with the same Lie algebra as SOsub(41+2) with 1>=2, and at most n generations for groups with the same Lie algebra as SUsub(n). (author)
A revision of the subtract-with-borrow random number generators
Sibidanov, Alexei
2017-12-01
The most popular and widely used subtract-with-borrow generator, also known as RANLUX, is reimplemented as a linear congruential generator using large integer arithmetic with the modulus size of 576 bits. Modern computers, as well as the specific structure of the modulus inferred from RANLUX, allow for the development of a fast modular multiplication - the core of the procedure. This was previously believed to be slow and have too high cost in terms of computing resources. Our tests show a significant gain in generation speed which is comparable with other fast, high quality random number generators. An additional feature is the fast skipping of generator states leading to a seeding scheme which guarantees the uniqueness of random number sequences. Licensing provisions: GPLv3 Programming language: C++, C, Assembler
A generator for unique quantum random numbers based on vacuum states
DEFF Research Database (Denmark)
Gabriel, C.; Wittmann, C.; Sych, D.
2010-01-01
the purity of a continuous-variable quantum vacuum state to generate unique random numbers. We use the intrinsic randomness in measuring the quadratures of a mode in the lowest energy vacuum state, which cannot be correlated to any other state. The simplicity of our source, combined with its verifiably......Random numbers are a valuable component in diverse applications that range from simulations(1) over gambling to cryptography(2,3). The quest for true randomness in these applications has engendered a large variety of different proposals for producing random numbers based on the foundational...... unpredictability of quantum mechanics(4-11). However, most approaches do not consider that a potential adversary could have knowledge about the generated numbers, so the numbers are not verifiably random and unique(12-15). Here we present a simple experimental setup based on homodyne measurements that uses...
Chaotic generation of PN sequences : a VLSI implementation
Dornbusch, A.; Pineda de Gyvez, J.
1999-01-01
Generation of repeatable pseudo-random sequences with chaotic analog electronics is not feasible using standard circuit topologies. Component variation caused by imperfect fabrication causes the same divergence of output sequences as does varying initial conditions. By quantizing the output of a
Bisadi, Zahra; Acerbi, Fabio; Fontana, Giorgio; Zorzi, Nicola; Piemonte, Claudio; Pucker, Georg; Pavesi, Lorenzo
2018-02-01
A small-sized photonic quantum random number generator, easy to be implemented in small electronic devices for secure data encryption and other applications, is highly demanding nowadays. Here, we propose a compact configuration with Silicon nanocrystals large area light emitting device (LED) coupled to a Silicon photomultiplier to generate random numbers. The random number generation methodology is based on the photon arrival time and is robust against the non-idealities of the detector and the source of quantum entropy. The raw data show high quality of randomness and pass all the statistical tests in national institute of standards and technology tests (NIST) suite without a post-processing algorithm. The highest bit rate is 0.5 Mbps with the efficiency of 4 bits per detected photon.
Directory of Open Access Journals (Sweden)
Zahra Bisadi
2018-02-01
Full Text Available A small-sized photonic quantum random number generator, easy to be implemented in small electronic devices for secure data encryption and other applications, is highly demanding nowadays. Here, we propose a compact configuration with Silicon nanocrystals large area light emitting device (LED coupled to a Silicon photomultiplier to generate random numbers. The random number generation methodology is based on the photon arrival time and is robust against the non-idealities of the detector and the source of quantum entropy. The raw data show high quality of randomness and pass all the statistical tests in national institute of standards and technology tests (NIST suite without a post-processing algorithm. The highest bit rate is 0.5 Mbps with the efficiency of 4 bits per detected photon.
Note: Fully integrated 3.2 Gbps quantum random number generator with real-time extraction
International Nuclear Information System (INIS)
Zhang, Xiao-Guang; Nie, You-Qi; Liang, Hao; Zhang, Jun; Pan, Jian-Wei; Zhou, Hongyi; Ma, Xiongfeng
2016-01-01
We present a real-time and fully integrated quantum random number generator (QRNG) by measuring laser phase fluctuations. The QRNG scheme based on laser phase fluctuations is featured for its capability of generating ultra-high-speed random numbers. However, the speed bottleneck of a practical QRNG lies on the limited speed of randomness extraction. To close the gap between the fast randomness generation and the slow post-processing, we propose a pipeline extraction algorithm based on Toeplitz matrix hashing and implement it in a high-speed field-programmable gate array. Further, all the QRNG components are integrated into a module, including a compact and actively stabilized interferometer, high-speed data acquisition, and real-time data post-processing and transmission. The final generation rate of the QRNG module with real-time extraction can reach 3.2 Gbps.
Note: Fully integrated 3.2 Gbps quantum random number generator with real-time extraction
Energy Technology Data Exchange (ETDEWEB)
Zhang, Xiao-Guang; Nie, You-Qi; Liang, Hao; Zhang, Jun, E-mail: zhangjun@ustc.edu.cn; Pan, Jian-Wei [Hefei National Laboratory for Physical Sciences at the Microscale and Department of Modern Physics, University of Science and Technology of China, Hefei, Anhui 230026 (China); CAS Center for Excellence and Synergetic Innovation Center in Quantum Information and Quantum Physics, University of Science and Technology of China, Hefei, Anhui 230026 (China); Zhou, Hongyi; Ma, Xiongfeng [Center for Quantum Information, Institute for Interdisciplinary Information Sciences, Tsinghua University, Beijing 100084 (China)
2016-07-15
We present a real-time and fully integrated quantum random number generator (QRNG) by measuring laser phase fluctuations. The QRNG scheme based on laser phase fluctuations is featured for its capability of generating ultra-high-speed random numbers. However, the speed bottleneck of a practical QRNG lies on the limited speed of randomness extraction. To close the gap between the fast randomness generation and the slow post-processing, we propose a pipeline extraction algorithm based on Toeplitz matrix hashing and implement it in a high-speed field-programmable gate array. Further, all the QRNG components are integrated into a module, including a compact and actively stabilized interferometer, high-speed data acquisition, and real-time data post-processing and transmission. The final generation rate of the QRNG module with real-time extraction can reach 3.2 Gbps.
An efficient algorithm for generating random number pairs drawn from a bivariate normal distribution
Campbell, C. W.
1983-01-01
An efficient algorithm for generating random number pairs from a bivariate normal distribution was developed. Any desired value of the two means, two standard deviations, and correlation coefficient can be selected. Theoretically the technique is exact and in practice its accuracy is limited only by the quality of the uniform distribution random number generator, inaccuracies in computer function evaluation, and arithmetic. A FORTRAN routine was written to check the algorithm and good accuracy was obtained. Some small errors in the correlation coefficient were observed to vary in a surprisingly regular manner. A simple model was developed which explained the qualities aspects of the errors.
Directory of Open Access Journals (Sweden)
Nicholas J. Sexton
2014-07-01
Full Text Available Random number generation (RNG is a complex cognitive task for human subjects, requiring deliberative control to avoid production of habitual, stereotyped sequences. Under various manipulations (e.g., speeded responding, transcranial magnetic stimulation, or neurological damage the performance of human subjects deteriorates, as reflected in a number of qualitatively distinct, dissociable biases. For example, the intrusion of stereotyped behaviour (e.g., counting increases at faster rates of generation. Theoretical accounts of the task postulate that it requires the integrated operation of multiple, computationally heterogeneous cognitive control ('executive' processes. We present a computational model of RNG, within the framework of a novel, neuropsychologically-inspired cognitive architecture, ESPro. Manipulating the rate of sequence generation in the model reproduced a number of key effects observed in empirical studies, including increasing sequence stereotypy at faster rates. Within the model, this was due to time limitations on the interaction of supervisory control processes, namely, task setting, proposal of responses, monitoring, and response inhibition. The model thus supports the fractionation of executive function into multiple, computationally heterogeneous processes.
High-speed true random number generation based on paired memristors for security electronics
Zhang, Teng; Yin, Minghui; Xu, Changmin; Lu, Xiayan; Sun, Xinhao; Yang, Yuchao; Huang, Ru
2017-11-01
True random number generator (TRNG) is a critical component in hardware security that is increasingly important in the era of mobile computing and internet of things. Here we demonstrate a TRNG using intrinsic variation of memristors as a natural source of entropy that is otherwise undesirable in most applications. The random bits were produced by cyclically switching a pair of tantalum oxide based memristors and comparing their resistance values in the off state, taking advantage of the more pronounced resistance variation compared with that in the on state. Using an alternating read scheme in the designed TRNG circuit, the unbiasedness of the random numbers was significantly improved, and the bitstream passed standard randomness tests. The Pt/TaO x /Ta memristors fabricated in this work have fast programming/erasing speeds of ˜30 ns, suggesting a high random number throughput. The approach proposed here thus holds great promise for physically-implemented random number generation.
On the Generation of Intermediate Number Squeezed State of the Quantized Radiation Field
Baseia, B.; de Lima, A. F.; Bagnato, V. S.
Recently, a new state of the quantized radiation field — the intermediate number squeezed state (INSS) — has been introduced in the literature: it interpolates between the number state |n> and the squeezed state |z, α>=Ŝ(z)|α>, and exhibits interesting nonclassical properties as antibunching, sub-Poissonian statistics and squeezing. Here we introduce a slight modification in the previous definition allowing us a proposal to generate the INSS. Nonclassical properties using a new set of parameters are also studied.
Optimal number of energy generators for biogas utilization in wastewater treatment facility
International Nuclear Information System (INIS)
Tsagarakis, Konstantinos P.
2007-01-01
A technoeconomic analysis has been undertaken considering the optimum number of energy producing generators using biogas coming from anaerobic digestion. Inputs for this analysis originate from available data on the first generator for energy production from biogas, installed in Greece at the wastewater treatment facility of Iraklio city. The data spans a period of 5.5 years of operation. It is concluded that the cost per kWh produced is 0.0876 Euro /kWh if one generator is used covering 15.9% of the facility's needs. If two generators are used, more biogas is utilized contributing 32.6% of the facility's needs at a marginal production cost of 0.0886 Euro /kWh. Similar estimations have been made for scenarios involving up to six generators. In contrast, the marginal cost of conventionally produced energy is 0.1383-0.2483 Euro /kWh
Arbitrary Chern number generation in the three-band model from momentum space
International Nuclear Information System (INIS)
Lee, Soo-Yong; Go, Gyungchoon; Han, Jung Hoon; Park, Jin-Hong
2015-01-01
A simple, general rule for generating a three-band model with arbitrary Chern numbers is given. The rule is based on the idea of monopole charge-changing unitary operations and can be realized by two types of simple unitary operations on the original Hamiltonian. A pair of monopole charges are required to produce desired topological numbers in the three-band model. The set of rules presented here offers a way to produce lattice models of any desired Chern numbers for three-sublattice situations. (author)
The impacts of different bidding segment numbers on bidding strategies of generation companies
International Nuclear Information System (INIS)
Wang, L.; Yu, C.W.; Wen, F.S.
2008-01-01
In a competitive electricity market, generation companies design bidding strategies to maximize their individual profits subject to the constraints imposed by bidding rules. For a generation company, obviously, the optimal bidding strategy and hence the potential of exercising market power may be different if different bidding rules are employed. Hence, a well-designed bidding protocol is vital to the effective and efficient operation of an electricity market. Based on the widely used stepwise bidding rules, the impacts of different numbers of bidding segments on the bidding strategies of generation companies are investigated. This study is focused on a price-taker generation company in an electricity market. A probabilisic model is used to simulate electricity price in the competitive market environment. With a given number of bidding segments, the optimal bidding strategy for a price-taker generation company is then developed. The effects of risk preferences as well as information asymmetry on the optimal bidding strategy are also examined. With particular references to the impacts of different numbers of bidding segments on the optimal bidding strategy, a numerical example is employed to demonstrate the validity of the proposed model and methodology. (author)
Bosch, Holger; Steinkamp, Fiona; Boller, Emil
2006-01-01
Seance-room and other large-scale psychokinetic phenomena have fascinated humankind for decades. Experimental research has reduced these phenomena to attempts to influence (a) the fall of dice and, later, (b) the output of random number generators (RNGs). The meta-analysis combined 380 studies that assessed whether RNG output correlated with human…
A note on number fields having reciprocal integer generators | Zaïmi ...
African Journals Online (AJOL)
We prove that a totally complex algebraic number field K; having a conjugate which is not closed under complex conjugation, can be generated by a reciprocal integer, when the Galois group of its normal closure is contained in the hyperoctahedral group Bdeg(K)/2. Keywords: Reciprocal integers, unit primitive elements, ...
Application of random number generators in genetic algorithms to improve rainfall-runoff modelling
Chlumecký, Martin; Buchtele, Josef; Richta, Karel
2017-10-01
The efficient calibration of rainfall-runoff models is a difficult issue, even for experienced hydrologists. Therefore, fast and high-quality model calibration is a valuable improvement. This paper describes a novel methodology and software for the optimisation of a rainfall-runoff modelling using a genetic algorithm (GA) with a newly prepared concept of a random number generator (HRNG), which is the core of the optimisation. The GA estimates model parameters using evolutionary principles, which requires a quality number generator. The new HRNG generates random numbers based on hydrological information and it provides better numbers compared to pure software generators. The GA enhances the model calibration very well and the goal is to optimise the calibration of the model with a minimum of user interaction. This article focuses on improving the internal structure of the GA, which is shielded from the user. The results that we obtained indicate that the HRNG provides a stable trend in the output quality of the model, despite various configurations of the GA. In contrast to previous research, the HRNG speeds up the calibration of the model and offers an improvement of rainfall-runoff modelling.
Generating log-normally distributed random numbers by using the Ziggurat algorithm
International Nuclear Information System (INIS)
Choi, Jong Soo
2016-01-01
Uncertainty analyses are usually based on the Monte Carlo method. Using an efficient random number generator(RNG) is a key element in success of Monte Carlo simulations. Log-normal distributed variates are very typical in NPP PSAs. This paper proposes an approach to generate log normally distributed variates based on the Ziggurat algorithm and evaluates the efficiency of the proposed Ziggurat RNG. The proposed RNG can be helpful to improve the uncertainty analysis of NPP PSAs. This paper focuses on evaluating the efficiency of the Ziggurat algorithm from a NPP PSA point of view. From this study, we can draw the following conclusions. - The Ziggurat algorithm is one of perfect random number generators to product normal distributed variates. - The Ziggurat algorithm is computationally much faster than the most commonly used method, Marsaglia polar method
True random number generation from mobile telephone photo based on chaotic cryptography
International Nuclear Information System (INIS)
Zhao Liang; Liao Xiaofeng; Xiao Di; Xiang Tao; Zhou Qing; Duan Shukai
2009-01-01
A cheap, convenient and universal TRNG based on mobile telephone photo for producing random bit sequence is proposed. To settle the problem of sequential pixels and comparability, three chaos-based approaches are applied to post-process the generated binary image. The random numbers produced by three users are tested using US NIST RNG statistical test software. The experimental results indicate that the Arnold cat map is the fastest way to generate a random bit sequence and can be accepted on general PC. The 'MASK' algorithm also performs well. Finally, comparing with the TRNG of Hu et al. [Hu Y, Liao X, Wong KW, Zhou Q. A true random number generator based on mouse movement and chaotic cryptography. Chaos, Solitons and Fractals 2007. doi: 10.1016/j.chaos.2007.10.022] which is presented by Hu et al., many merits of the proposed TRNG in this paper has been found.
Robust random number generation using steady-state emission of gain-switched laser diodes
International Nuclear Information System (INIS)
Yuan, Z. L.; Lucamarini, M.; Dynes, J. F.; Fröhlich, B.; Plews, A.; Shields, A. J.
2014-01-01
We demonstrate robust, high-speed random number generation using interference of the steady-state emission of guaranteed random phases, obtained through gain-switching a semiconductor laser diode. Steady-state emission tolerates large temporal pulse misalignments and therefore significantly improves the interference quality. Using an 8-bit digitizer followed by a finite-impulse-response unbiasing algorithm, we achieve random number generation rates of 8 and 20 Gb/s, for laser repetition rates of 1 and 2.5 GHz, respectively, with a ±20% tolerance in the interferometer differential delay. We also report a generation rate of 80 Gb/s using partially phase-correlated short pulses. In relation to the field of quantum key distribution, our results confirm the gain-switched laser diode as a suitable light source, capable of providing phase-randomized coherent pulses at a clock rate of up to 2.5 GHz.
Baryon-number generation in supersymmetric unified models: the effect of supermassive fermions
International Nuclear Information System (INIS)
Kolb, E.W.; Raby, S.
1983-01-01
In supersymmetric unified models, baryon-number-violating reactions may be mediated by supermassive fermions in addition to the usual supermassive bosons. The effective low-energy baryon-number-violating cross section for fermion-mediated reactions is sigma/sub DeltaB/approx.g 4 /m 2 , where g is a coupling constant and m is the supermassive fermion mass, as opposed to sigma/sub DeltaB/approx.g 4 s/m 4 for scalar- or vector-mediated reactions (√s is the center-of-mass energy). Since the fermion-mediated cross section is larger at low energy, it is more effective at damping the baryon number produced in decay of the supermassive particles. In this paper we calculate baryon-number generation in models with fermion-mediated baryon-number-violating reactions, and discuss implications for supersymmetric model building
The generation of 68 Gbps quantum random number by measuring laser phase fluctuations
International Nuclear Information System (INIS)
Nie, You-Qi; Liu, Yang; Zhang, Jun; Pan, Jian-Wei; Huang, Leilei; Payne, Frank
2015-01-01
The speed of a quantum random number generator is essential for practical applications, such as high-speed quantum key distribution systems. Here, we push the speed of a quantum random number generator to 68 Gbps by operating a laser around its threshold level. To achieve the rate, not only high-speed photodetector and high sampling rate are needed but also a very stable interferometer is required. A practical interferometer with active feedback instead of common temperature control is developed to meet the requirement of stability. Phase fluctuations of the laser are measured by the interferometer with a photodetector and then digitalized to raw random numbers with a rate of 80 Gbps. The min-entropy of the raw data is evaluated by modeling the system and is used to quantify the quantum randomness of the raw data. The bias of the raw data caused by other signals, such as classical and detection noises, can be removed by Toeplitz-matrix hashing randomness extraction. The final random numbers can pass through the standard randomness tests. Our demonstration shows that high-speed quantum random number generators are ready for practical usage
International Nuclear Information System (INIS)
Chen, H.T.; Muether, H.; Faessler, A.
1978-01-01
Pairing vibrational and isospin rotational states are described in different approximations based on particle number and isospin projected, proton-proton, neutron-neutron and proton-neutron pairing wave functions and on the generator coordinate method (GCM). The investigations are performed in models for which an exact group theoretical solution exists. It turns out that a particle number and isospin projection is essential to yield a good approximation to the ground state or isospin yrast state energies. For strong pairing correlations (pairing force constant equal to the single-particle level distance) isospin cranking (-ωTsub(x)) yields with particle number projected pairing wave function also good agreement with the exact energies. GCM wave functions generated by particle number and isospin projected BCS functions with different amounts of pairing correlations yield for the lowest T=0 and T=2 states energies which are practically indistinguishable from the exact solutions. But even the second and third lowest energies of charge-symmetric states are still very reliable. Thus it is concluded that also in realistic cases isospin rotational and pairing vibrational states may be described in the framework of the GCM method with isospin and particle number projected generating wave functions. (Auth.)
Koyama, Kento; Hokunan, Hidekazu; Hasegawa, Mayumi; Kawamura, Shuso; Koseki, Shigenobu
2016-12-01
We investigated a bacterial sample preparation procedure for single-cell studies. In the present study, we examined whether single bacterial cells obtained via 10-fold dilution followed a theoretical Poisson distribution. Four serotypes of Salmonella enterica, three serotypes of enterohaemorrhagic Escherichia coli and one serotype of Listeria monocytogenes were used as sample bacteria. An inoculum of each serotype was prepared via a 10-fold dilution series to obtain bacterial cell counts with mean values of one or two. To determine whether the experimentally obtained bacterial cell counts follow a theoretical Poisson distribution, a likelihood ratio test between the experimentally obtained cell counts and Poisson distribution which parameter estimated by maximum likelihood estimation (MLE) was conducted. The bacterial cell counts of each serotype sufficiently followed a Poisson distribution. Furthermore, to examine the validity of the parameters of Poisson distribution from experimentally obtained bacterial cell counts, we compared these with the parameters of a Poisson distribution that were estimated using random number generation via computer simulation. The Poisson distribution parameters experimentally obtained from bacterial cell counts were within the range of the parameters estimated using a computer simulation. These results demonstrate that the bacterial cell counts of each serotype obtained via 10-fold dilution followed a Poisson distribution. The fact that the frequency of bacterial cell counts follows a Poisson distribution at low number would be applied to some single-cell studies with a few bacterial cells. In particular, the procedure presented in this study enables us to develop an inactivation model at the single-cell level that can estimate the variability of survival bacterial numbers during the bacterial death process. Copyright © 2016 Elsevier Ltd. All rights reserved.
Digital-Analog Hybrid Scheme and Its Application to Chaotic Random Number Generators
Yuan, Zeshi; Li, Hongtao; Miao, Yunchi; Hu, Wen; Zhu, Xiaohua
2017-12-01
Practical random number generation (RNG) circuits are typically achieved with analog devices or digital approaches. Digital-based techniques, which use field programmable gate array (FPGA) and graphics processing units (GPU) etc. usually have better performances than analog methods as they are programmable, efficient and robust. However, digital realizations suffer from the effect of finite precision. Accordingly, the generated random numbers (RNs) are actually periodic instead of being real random. To tackle this limitation, in this paper we propose a novel digital-analog hybrid scheme that employs the digital unit as the main body, and minimum analog devices to generate physical RNs. Moreover, the possibility of realizing the proposed scheme with only one memory element is discussed. Without loss of generality, we use the capacitor and the memristor along with FPGA to construct the proposed hybrid system, and a chaotic true random number generator (TRNG) circuit is realized, producing physical RNs at a throughput of Gbit/s scale. These RNs successfully pass all the tests in the NIST SP800-22 package, confirming the significance of the scheme in practical applications. In addition, the use of this new scheme is not restricted to RNGs, and it also provides a strategy to solve the effect of finite precision in other digital systems.
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.
Quantum random number generator based on quantum nature of vacuum fluctuations
Ivanova, A. E.; Chivilikhin, S. A.; Gleim, A. V.
2017-11-01
Quantum random number generator (QRNG) allows obtaining true random bit sequences. In QRNG based on quantum nature of vacuum, optical beam splitter with two inputs and two outputs is normally used. We compare mathematical descriptions of spatial beam splitter and fiber Y-splitter in the quantum model for QRNG, based on homodyne detection. These descriptions were identical, that allows to use fiber Y-splitters in practical QRNG schemes, simplifying the setup. Also we receive relations between the input radiation and the resulting differential current in homodyne detector. We experimentally demonstrate possibility of true random bits generation by using QRNG based on homodyne detection with Y-splitter.
International Nuclear Information System (INIS)
Cecen, Songul; Demirer, R. Murat; Bayrak, Coskun
2009-01-01
We propose a nonlinear congruential pseudorandom number generator consisting of summation of higher order composition of random logistic maps under certain congruential mappings. We change both bifurcation parameters of logistic maps in the interval of U=[3.5599,4) and coefficients of the polynomials in each higher order composition of terms up to degree d. This helped us to obtain a perfect random decorrelated generator which is infinite and aperiodic. It is observed from the simulation results that our new PRNG has good uniformity and power spectrum properties with very flat white noise characteristics. The results are interesting, new and may have applications in cryptography and in Monte Carlo simulations.
Directory of Open Access Journals (Sweden)
Ting Kuo
2015-05-01
Full Text Available We propose a linear time algorithm, called G2DLP, for generating 2D lattice L(n1, n2 paths, equivalent to two-item multiset permutations, with a given number of turns. The usage of turn has three meanings: in the context of multiset permutations, it means that two consecutive elements of a permutation belong to two different items; in lattice path enumerations, it means that the path changes its direction, either from eastward to northward or from northward to eastward; in open shop scheduling, it means that we transfer a job from one type of machine to another. The strategy of G2DLP is divide-and-combine; the division is based on the enumeration results of a previous study and is achieved by aid of an integer partition algorithm and a multiset permutation algorithm; the combination is accomplished by a concatenation algorithm that constructs the paths we require. The advantage of G2DLP is twofold. First, it is optimal in the sense that it directly generates all feasible paths without visiting an infeasible one. Second, it can generate all paths in any specified order of turns, for example, a decreasing order or an increasing order. In practice, two applications, scheduling and cryptography, are discussed.
A robust random number generator based on differential comparison of chaotic laser signals.
Zhang, Jianzhong; Wang, Yuncai; Liu, Ming; Xue, Lugang; Li, Pu; Wang, Anbang; Zhang, Mingjiang
2012-03-26
We experimentally realize a robust real-time random number generator by differentially comparing the signal from a chaotic semiconductor laser and its delayed signal through a 1-bit analog-to-digital converter. The probability density distribution of the output chaotic signal based on the differential comparison method possesses an extremely small coefficient of Pearson's median skewness (1.5 × 10⁻⁶), which can yield a balanced random sequence much easily than the previously reported method that compares the signal from the chaotic laser with a certain threshold value. Moveover, we experimently demonstrate that our method can stably generate good random numbers at rates of 1.44 Gbit/s with excellent immunity from external perturbations while the previously reported method fails.
Experimental study of a quantum random-number generator based on two independent lasers
Sun, Shi-Hai; Xu, Feihu
2017-12-01
A quantum random-number generator (QRNG) can produce true randomness by utilizing the inherent probabilistic nature of quantum mechanics. Recently, the spontaneous-emission quantum phase noise of the laser has been widely deployed for quantum random-number generation, due to its high rate, its low cost, and the feasibility of chip-scale integration. Here, we perform a comprehensive experimental study of a phase-noise-based QRNG with two independent lasers, each of which operates in either continuous-wave (CW) or pulsed mode. We implement the QRNG by operating the two lasers in three configurations, namely, CW + CW, CW + pulsed, and pulsed + pulsed, and demonstrate their trade-offs, strengths, and weaknesses.
DNA copy number, including telomeres and mitochondria, assayed using next-generation sequencing
Directory of Open Access Journals (Sweden)
Jackson Stuart
2010-04-01
Full Text Available Abstract Background DNA copy number variations occur within populations and aberrations can cause disease. We sought to develop an improved lab-automatable, cost-efficient, accurate platform to profile DNA copy number. Results We developed a sequencing-based assay of nuclear, mitochondrial, and telomeric DNA copy number that draws on the unbiased nature of next-generation sequencing and incorporates techniques developed for RNA expression profiling. To demonstrate this platform, we assayed UMC-11 cells using 5 million 33 nt reads and found tremendous copy number variation, including regions of single and homogeneous deletions and amplifications to 29 copies; 5 times more mitochondria and 4 times less telomeric sequence than a pool of non-diseased, blood-derived DNA; and that UMC-11 was derived from a male individual. Conclusion The described assay outputs absolute copy number, outputs an error estimate (p-value, and is more accurate than array-based platforms at high copy number. The platform enables profiling of mitochondrial levels and telomeric length. The assay is lab-automatable and has a genomic resolution and cost that are tunable based on the number of sequence reads.
On the design of henon and logistic map-based random number generator
Magfirawaty; Suryadi, M. T.; Ramli, Kalamullah
2017-10-01
The key sequence is one of the main elements in the cryptosystem. True Random Number Generators (TRNG) method is one of the approaches to generating the key sequence. The randomness source of the TRNG divided into three main groups, i.e. electrical noise based, jitter based and chaos based. The chaos based utilizes a non-linear dynamic system (continuous time or discrete time) as an entropy source. In this study, a new design of TRNG based on discrete time chaotic system is proposed, which is then simulated in LabVIEW. The principle of the design consists of combining 2D and 1D chaotic systems. A mathematical model is implemented for numerical simulations. We used comparator process as a harvester method to obtain the series of random bits. Without any post processing, the proposed design generated random bit sequence with high entropy value and passed all NIST 800.22 statistical tests.
Tlelo-Cuautle, Esteban; de la Fraga, Luis Gerardo
2016-01-01
This book offers readers a clear guide to implementing engineering applications with FPGAs, from the mathematical description to the hardware synthesis, including discussion of VHDL programming and co-simulation issues. Coverage includes FPGA realizations such as: chaos generators that are described from their mathematical models; artificial neural networks (ANNs) to predict chaotic time series, for which a discussion of different ANN topologies is included, with different learning techniques and activation functions; random number generators (RNGs) that are realized using different chaos generators, and discussions of their maximum Lyapunov exponent values and entropies. Finally, optimized chaotic oscillators are synchronized and realized to implement a secure communication system that processes black and white and grey-scale images. In each application, readers will find VHDL programming guidelines and computer arithmetic issues, along with co-simulation examples with Active-HDL and Simulink. Readers will b...
Meshram, S. Gajbhiye; Sharma, S. K.; Tignath, S.
2017-07-01
Watershed is an ideal unit for planning and management of land and water resources (Gajbhiye et al., IEEE international conference on advances in technology and engineering (ICATE), Bombay, vol 1, issue 9, pp 23-25, 2013a; Gajbhiye et al., Appl Water Sci 4(1):51-61, 2014a; Gajbhiye et al., J Geol Soc India (SCI-IF 0.596) 84(2):192-196, 2014b). This study aims to generate the curve number, using remote sensing and geographical information system (GIS) and the effect of slope on curve number values. The study was carried out in Kanhaiya Nala watershed located in Satna district of Madhya Pradesh. Soil map, Land Use/Land cover and slope map were generated in GIS Environment. The CN parameter values corresponding to various soil, land cover, and land management conditions were selected from Natural Resource Conservation Service (NRCS) standard table. Curve number (CN) is an index developed by the NRCS, to represent the potential for storm water runoff within a drainage area. The CN for a drainage basin is estimated using a combination of land use, soil, and antecedent soil moisture condition (AMC). In present study effect of slope on CN values were determined. The result showed that the CN unadjusted value are higher in comparison to CN adjusted with slope. Remote sensing and GIS is very reliable technique for the preparation of most of the input data required by the SCS curve number model.
Direct generation of all-optical random numbers from optical pulse amplitude chaos.
Li, Pu; Wang, Yun-Cai; Wang, An-Bang; Yang, Ling-Zhen; Zhang, Ming-Jiang; Zhang, Jian-Zhong
2012-02-13
We propose and theoretically demonstrate an all-optical method for directly generating all-optical random numbers from pulse amplitude chaos produced by a mode-locked fiber ring laser. Under an appropriate pump intensity, the mode-locked laser can experience a quasi-periodic route to chaos. Such a chaos consists of a stream of pulses with a fixed repetition frequency but random intensities. In this method, we do not require sampling procedure and external triggered clocks but directly quantize the chaotic pulses stream into random number sequence via an all-optical flip-flop. Moreover, our simulation results show that the pulse amplitude chaos has no periodicity and possesses a highly symmetric distribution of amplitude. Thus, in theory, the obtained random number sequence without post-processing has a high-quality randomness verified by industry-standard statistical tests.
Evaluating an Automated Number Series Item Generator Using Linear Logistic Test Models
Directory of Open Access Journals (Sweden)
Bao Sheng Loe
2018-04-01
Full Text Available This study investigates the item properties of a newly developed Automatic Number Series Item Generator (ANSIG. The foundation of the ANSIG is based on five hypothesised cognitive operators. Thirteen item models were developed using the numGen R package and eleven were evaluated in this study. The 16-item ICAR (International Cognitive Ability Resource1 short form ability test was used to evaluate construct validity. The Rasch Model and two Linear Logistic Test Model(s (LLTM were employed to estimate and predict the item parameters. Results indicate that a single factor determines the performance on tests composed of items generated by the ANSIG. Under the LLTM approach, all the cognitive operators were significant predictors of item difficulty. Moderate to high correlations were evident between the number series items and the ICAR test scores, with high correlation found for the ICAR Letter-Numeric-Series type items, suggesting adequate nomothetic span. Extended cognitive research is, nevertheless, essential for the automatic generation of an item pool with predictable psychometric properties.
Boonsathorn, Wasita; Charoen, Danuvasin; Dryver, Arthur L.
2014-01-01
E-Learning brings access to a powerful but often overlooked teaching tool: random number generation. Using random number generation, a practically infinite number of quantitative problem-solution sets can be created. In addition, within the e-learning context, in the spirit of the mastery of learning, it is possible to assign online quantitative…
Galustov, G. G.; Voronin, V. V.
2017-05-01
The sequence generator generates a sequence of pseudorandom binary numbers using a linear-feedback shift register (LFSR). This block implements LFSR using a simple shift register generator (SSRG, or Fibonacci) configuration. In this article we introduce the concept of probabilistic binary element provides requirements, which ensure compliance with the criterion of "uniformity" in the implementation of the basic physical generators uniformly distributed random number sequences. Based on these studies, we obtained an analytic relation between the parameters of the binary sequence and parameters of a numerical sequence with the shift register output. The received analytical dependencies can help in evaluating the statistical characteristics of the processes in solving problems of statistical modeling. It is supposed that the formation of the binary sequence output from the binary probabilistic element is produced using a physical noise process. It is shown that the observed errors in statistical modeling using pseudo-random numbers do not occur if the model examines linear systems with constant parameters, but in case models of nonlinear systems, higher order moments can have a Gaussian distribution.
RANDNA: a random DNA sequence generator.
Piva, Francesco; Principato, Giovanni
2006-01-01
Monte Carlo simulations are useful to verify the significance of data. Genomic regularities, such as the nucleotide correlations or the not uniform distribution of the motifs throughout genomic or mature mRNA sequences, exist and their significance can be checked by means of the Monte Carlo test. The test needs good quality random sequences in order to work, moreover they should have the same nucleotide distribution as the sequences in which the regularities have been found. Random DNA sequences are also useful to estimate the background score of an alignment, that is a threshold below which the resulting score is merely due to chance. We have developed RANDNA, a free software which allows to produce random DNA or RNA sequences setting both their length and the percentage of nucleotide composition. Sequences having the same nucleotide distribution of exonic, intronic or intergenic sequences can be generated. Its graphic interface makes it possible to easily set the parameters that characterize the sequences being produced and saved in a text format file. The pseudo-random number generator function of Borland Delphi 6 is used, since it guarantees a good randomness, a long cycle length and a high speed. We have checked the quality of sequences generated by the software, by means of well-known tests, both by themselves and versus genuine random sequences. We show the good quality of the generated sequences. The software, complete with examples and documentation, is freely available to users from: http://www.introni.it/en/software.
Siraj, A. S.; Oidtman, R. J.; Huber, J. H.; Kraemer, M. U.; Brady, O. J.; Johansson, M. A.; Perkins, T. A.
2017-12-01
Epidemic growth rate, r, provides a more complete description of the potential for epidemics than the more commonly studied basic reproduction number, R0, yet the former has never been described as a function of temperature for dengue virus or other pathogens with temperature-sensitive transmission. The need to understand the drivers of epidemics of these pathogens is acute, with arthropod-borne virus epidemics becoming increasingly problematic. We addressed this need by developing temperature-dependent descriptions of the two components of r—R0 and the generation interval—to obtain a temperature-dependent description of r. Our results show that the generation interval is highly sensitive to temperature, decreasing twofold between 25 and 35 °C and suggesting that dengue virus epidemics may accelerate as temperatures increase, not only because of more infections per generation but also because of faster generations. Under the empirical temperature relationships that we considered, we found that r peaked at a temperature threshold that was robust to uncertainty in model parameters that do not depend on temperature. Although the precise value of this temperature threshold could be refined following future studies of empirical temperature relationships, the framework we present for identifying such temperature thresholds offers a new way to classify regions in which dengue virus epidemic intensity could either increase or decrease under future climate change.
Random number generators for large-scale parallel Monte Carlo simulations on FPGA
Lin, Y.; Wang, F.; Liu, B.
2018-05-01
Through parallelization, field programmable gate array (FPGA) can achieve unprecedented speeds in large-scale parallel Monte Carlo (LPMC) simulations. FPGA presents both new constraints and new opportunities for the implementations of random number generators (RNGs), which are key elements of any Monte Carlo (MC) simulation system. Using empirical and application based tests, this study evaluates all of the four RNGs used in previous FPGA based MC studies and newly proposed FPGA implementations for two well-known high-quality RNGs that are suitable for LPMC studies on FPGA. One of the newly proposed FPGA implementations: a parallel version of additive lagged Fibonacci generator (Parallel ALFG) is found to be the best among the evaluated RNGs in fulfilling the needs of LPMC simulations on FPGA.
High-Speed Device-Independent Quantum Random Number Generation without a Detection Loophole
Liu, Yang; Yuan, Xiao; Li, Ming-Han; Zhang, Weijun; Zhao, Qi; Zhong, Jiaqiang; Cao, Yuan; Li, Yu-Huai; Chen, Luo-Kan; Li, Hao; Peng, Tianyi; Chen, Yu-Ao; Peng, Cheng-Zhi; Shi, Sheng-Cai; Wang, Zhen; You, Lixing; Ma, Xiongfeng; Fan, Jingyun; Zhang, Qiang; Pan, Jian-Wei
2018-01-01
Quantum mechanics provides the means of generating genuine randomness that is impossible with deterministic classical processes. Remarkably, the unpredictability of randomness can be certified in a manner that is independent of implementation devices. Here, we present an experimental study of device-independent quantum random number generation based on a detection-loophole-free Bell test with entangled photons. In the randomness analysis, without the independent identical distribution assumption, we consider the worst case scenario that the adversary launches the most powerful attacks against the quantum adversary. After considering statistical fluctuations and applying an 80 Gb ×45.6 Mb Toeplitz matrix hashing, we achieve a final random bit rate of 114 bits /s , with a failure probability less than 10-5. This marks a critical step towards realistic applications in cryptography and fundamental physics tests.
Thompson, J. R.; Taylor, M. S.
1982-01-01
Let X be a K-dimensional random variable serving as input for a system with output Y (not necessarily of dimension k). given X, an outcome Y or a distribution of outcomes G(Y/X) may be obtained either explicitly or implicity. The situation is considered in which there is a real world data set X sub j sub = 1 (n) and a means of simulating an outcome Y. A method for empirical random number generation based on the sample of observations of the random variable X without estimating the underlying density is discussed.
Experimentally Generated Random Numbers Certified by the Impossibility of Superluminal Signaling
Bierhorst, Peter; Shalm, Lynden K.; Mink, Alan; Jordan, Stephen; Liu, Yi-Kai; Rommal, Andrea; Glancy, Scott; Christensen, Bradley; Nam, Sae Woo; Knill, Emanuel
Random numbers are an important resource for applications such as numerical simulation and secure communication. However, it is difficult to certify whether a physical random number generator is truly unpredictable. Here, we exploit the phenomenon of quantum nonlocality in a loophole-free photonic Bell test experiment to obtain data containing randomness that cannot be predicted by any theory that does not also allow the sending of signals faster than the speed of light. To certify and quantify the randomness, we develop a new protocol that performs well in an experimental regime characterized by low violation of Bell inequalities. Applying an extractor function to our data, we obtain 256 new random bits, uniform to within 10- 3 .
Phase transition and computational complexity in a stochastic prime number generator
Energy Technology Data Exchange (ETDEWEB)
Lacasa, L; Luque, B [Departamento de Matematica Aplicada y EstadIstica, ETSI Aeronauticos, Universidad Politecnica de Madrid, Plaza Cardenal Cisneros 3, Madrid 28040 (Spain); Miramontes, O [Departamento de Sistemas Complejos, Instituto de FIsica, Universidad Nacional Autonoma de Mexico, Mexico 01415 DF (Mexico)], E-mail: lucas@dmae.upm.es
2008-02-15
We introduce a prime number generator in the form of a stochastic algorithm. The character of this algorithm gives rise to a continuous phase transition which distinguishes a phase where the algorithm is able to reduce the whole system of numbers into primes and a phase where the system reaches a frozen state with low prime density. In this paper, we firstly present a broader characterization of this phase transition, both in analytical and numerical terms. Critical exponents are calculated, and data collapse is provided. Further on, we redefine the model as a search problem, fitting it in the hallmark of computational complexity theory. We suggest that the system belongs to the class NP. The computational cost is maximal around the threshold, as is common in many algorithmic phase transitions, revealing the presence of an easy-hard-easy pattern. We finally relate the nature of the phase transition to an average-case classification of the problem.
Chaotic oscillation and random-number generation based on nanoscale optical-energy transfer.
Naruse, Makoto; Kim, Song-Ju; Aono, Masashi; Hori, Hirokazu; Ohtsu, Motoichi
2014-08-12
By using nanoscale energy-transfer dynamics and density matrix formalism, we demonstrate theoretically and numerically that chaotic oscillation and random-number generation occur in a nanoscale system. The physical system consists of a pair of quantum dots (QDs), with one QD smaller than the other, between which energy transfers via optical near-field interactions. When the system is pumped by continuous-wave radiation and incorporates a timing delay between two energy transfers within the system, it emits optical pulses. We refer to such QD pairs as nano-optical pulsers (NOPs). Irradiating an NOP with external periodic optical pulses causes the oscillating frequency of the NOP to synchronize with the external stimulus. We find that chaotic oscillation occurs in the NOP population when they are connected by an external time delay. Moreover, by evaluating the time-domain signals by statistical-test suites, we confirm that the signals are sufficiently random to qualify the system as a random-number generator (RNG). This study reveals that even relatively simple nanodevices that interact locally with each other through optical energy transfer at scales far below the wavelength of irradiating light can exhibit complex oscillatory dynamics. These findings are significant for applications such as ultrasmall RNGs.
Czernik, Pawel
2013-10-01
The hardware random number generator based on the 74121 monostable multivibrators for applications in cryptographically secure distributed measurement and control systems with asymmetric resources was presented. This device was implemented on the basis of the physical electronic vibration generator in which the circuit is composed of two "loop" 74121 monostable multivibrators, D flip-flop and external clock signal source. The clock signal, witch control D flip-flop was generated by a computer on one of the parallel port pins. There was presented programmed the author's acquisition process of random data from the measuring system to a computer. The presented system was designed, builded and thoroughly tested in the term of cryptographic security in our laboratory, what there is the most important part of this publication. Real cryptographic security was tested based on the author's software and the software environment called RDieHarder. The obtained results was here presented and analyzed in detail with particular reference to the specificity of distributed measurement and control systems with asymmetric resources.
Treatments that generate higher number of adverse drug reactions and their symptoms
Directory of Open Access Journals (Sweden)
Lucía Fernández-López
2015-12-01
Full Text Available Objectives: Adverse drug reactions (ADRs are an important cause of morbidity and mortality worldwide and generate high health costs. Therefore, the aims of this study were to determine the treatments which produce more ADRs in general population and the main symptoms they generate. Methods: An observational, cross-sectional study consisting in performing a self-rated questionnaire was carried out. 510 patients were asked about the treatments, illnesses and ADRs, they had suffered from. Results: 26.7% of patients had suffered from some ADR. Classifying patients according to the type of prescribed treatment and studying the number of ADR that they had, we obtained significant differences (p ≤ 0.05 for treatments against arthrosis, anemia and nervous disorders (anxiety, depression, insomnia. Moreover, determining absolute frequencies of these ADRs appearance in each treatment, higher frequencies were again for drugs against arthrosis (22.6% of patients treated for arthrosis suffered some ADR, anemia (14.28%, nerve disorders (13.44% and also asthma (16%. Regarding the symptoms produced by ADRs, the most frequent were gastrointestinal (60% of patients who suffered an ADR, had gastrointestinal symptoms and nervous alterations (dizziness, headache, sleep disturbances etc (24.6%. Conclusion: Therapeutic groups which produce more commonly ADRs are those for arthrosis, anemia, nervous disorders and asthma. In addition, symptoms which are generated more frequently are gastrointestinal and nervous problems. This is in accordance with the usual side effects of mentioned treatments. Health professionals should be informed about it, so that they would be more alert about a possible emergence of an ADR in these treatments. They also could provide enough information to empower patients and thus, they probably could detect ADR events. This would facilitate ADR detection and would avoid serious consequences generated to both patients' health and health economics.
Sheppard, David P; Woods, Steven Paul; Doyle, Katie L; Verduzco, Marizela
2017-02-01
HIV is associated with frontostriatal dysregulation and executive dysfunction. This study evaluated whether HIV-infected individuals evidence deficits in random number generation (RNG), which is a strategic task requiring paced, rule-guided production of digits. In total, 74 HIV+ adults and 54 seronegative comparison participants completed a comprehensive research neuropsychological battery. Participants produced a random digit sequence by avoiding any order and using numbers 1 through 10 for 100 s at a pace of 1 digit/s. Outcomes included intrusions, repetitions, seriation (1-2-3-4), and cycling (median length of gaps between repeating digits). HIV disease was associated with higher levels of seriation and cycling (ps .10). Among HIV+ individuals, higher seriation was associated with neuropsychological performance including poorer auditory attention, verbal learning, and delayed memory, whereas higher cycling scores were associated with poorer delayed memory and verbal fluency (ps random sequences, which showed medium associations with higher order verbal abilities and may contribute to greater declines in everyday functioning outcomes. Future studies might examine RNG's role in health behaviors such as medical decision-making or medication adherence. © The Author 2016. Published by Oxford University Press. All rights reserved. For permissions, please e-mail: journals.permissions@oup.com.
International Nuclear Information System (INIS)
Ferng, Y.-M.; Fan, C.N.; Pei, B.S.; Li, H.-N.
2008-01-01
A steam generator (SG) plays a significant role not only with respect to the primary-to-secondary heat transfer but also as a fission product barrier to prevent the release of radionuclides. Tube plugging is an efficient way to avoid releasing radionuclides when SG tubes are severely degraded. However, this remedial action may cause the decrease of SG heat transfer capability, especially in transient or accident conditions. It is therefore crucial for the plant staff to understand the trend of plugged tubes for the SG operation and maintenance. Statistical methodologies are proposed in this paper to predict this trend. The accumulated numbers of SG plugged tubes versus the operation time are predicted using the Weibull and log-normal distributions, which correspond well with the plant measured data from a selected pressurized water reactor (PWR). With the help of these predictions, the accumulated number of SG plugged tubes can be reasonably extrapolated to the 40-year operation lifetime (or even longer than 40 years) of a PWR. This information can assist the plant policymakers to determine whether or when a SG must be replaced
Yu, Aifang; Chen, Xiangyu; Cui, Haotian; Chen, Libo; Luo, Jianjun; Tang, Wei; Peng, Mingzeng; Zhang, Yang; Zhai, Junyi; Wang, Zhong Lin
2016-12-27
Modern cryptography increasingly employs random numbers generated from physical sources in lieu of conventional software-based pseudorandom numbers, primarily owing to the great demand of unpredictable, indecipherable cryptographic keys from true random numbers for information security. Thus, far, the sole demonstration of true random numbers has been generated through thermal noise and/or quantum effects, which suffers from expensive and complex equipment. In this paper, we demonstrate a method for self-powered creation of true random numbers by using triboelectric technology to collect random signals from nature. This random number generator based on coupled triboelectric and electrostatic induction effects at the liquid-dielectric interface includes an elaborately designed triboelectric generator (TENG) with an irregular grating structure, an electronic-optical device, and an optical-electronic device. The random characteristics of raindrops are harvested through TENG and consequently transformed and converted by electronic-optical device and an optical-electronic device with a nonlinear characteristic. The cooperation of the mechanical, electrical, and optical signals ensures that the generator possesses complex nonlinear input-output behavior and contributes to increased randomness. The random number sequences are deduced from final electrical signals received by an optical-electronic device using a familiar algorithm. These obtained random number sequences exhibit good statistical characteristics, unpredictability, and unrepeatability. Our study supplies a simple, practical, and effective method to generate true random numbers, which can be widely used in cryptographic protocols, digital signatures, authentication, identification, and other information security fields.
40 CFR 761.308 - Sample selection by random number generation on any two-dimensional square grid.
2010-07-01
... 40 Protection of Environment 30 2010-07-01 2010-07-01 false Sample selection by random number... Â§ 761.79(b)(3) § 761.308 Sample selection by random number generation on any two-dimensional square... area created in accordance with paragraph (a) of this section, select two random numbers: one each for...
DNA based random key generation and management for OTP encryption.
Zhang, Yunpeng; Liu, Xin; Sun, Manhui
2017-09-01
One-time pad (OTP) is a principle of key generation applied to the stream ciphering method which offers total privacy. The OTP encryption scheme has proved to be unbreakable in theory, but difficult to realize in practical applications. Because OTP encryption specially requires the absolute randomness of the key, its development has suffered from dense constraints. DNA cryptography is a new and promising technology in the field of information security. DNA chromosomes storing capabilities can be used as one-time pad structures with pseudo-random number generation and indexing in order to encrypt the plaintext messages. In this paper, we present a feasible solution to the OTP symmetric key generation and transmission problem with DNA at the molecular level. Through recombinant DNA technology, by using only sender-receiver known restriction enzymes to combine the secure key represented by DNA sequence and the T vector, we generate the DNA bio-hiding secure key and then place the recombinant plasmid in implanted bacteria for secure key transmission. The designed bio experiments and simulation results show that the security of the transmission of the key is further improved and the environmental requirements of key transmission are reduced. Analysis has demonstrated that the proposed DNA-based random key generation and management solutions are marked by high security and usability. Published by Elsevier B.V.
CRISPR transcript processing: a mechanism for generating a large number of small interfering RNAs
Directory of Open Access Journals (Sweden)
Djordjevic Marko
2012-07-01
Full Text Available Abstract Background CRISPR/Cas (Clustered Regularly Interspaced Short Palindromic Repeats/CRISPR associated sequences is a recently discovered prokaryotic defense system against foreign DNA, including viruses and plasmids. CRISPR cassette is transcribed as a continuous transcript (pre-crRNA, which is processed by Cas proteins into small RNA molecules (crRNAs that are responsible for defense against invading viruses. Experiments in E. coli report that overexpression of cas genes generates a large number of crRNAs, from only few pre-crRNAs. Results We here develop a minimal model of CRISPR processing, which we parameterize based on available experimental data. From the model, we show that the system can generate a large amount of crRNAs, based on only a small decrease in the amount of pre-crRNAs. The relationship between the decrease of pre-crRNAs and the increase of crRNAs corresponds to strong linear amplification. Interestingly, this strong amplification crucially depends on fast non-specific degradation of pre-crRNA by an unidentified nuclease. We show that overexpression of cas genes above a certain level does not result in further increase of crRNA, but that this saturation can be relieved if the rate of CRISPR transcription is increased. We furthermore show that a small increase of CRISPR transcription rate can substantially decrease the extent of cas gene activation necessary to achieve a desired amount of crRNA. Conclusions The simple mathematical model developed here is able to explain existing experimental observations on CRISPR transcript processing in Escherichia coli. The model shows that a competition between specific pre-crRNA processing and non-specific degradation determines the steady-state levels of crRNA and is responsible for strong linear amplification of crRNAs when cas genes are overexpressed. The model further shows how disappearance of only a few pre-crRNA molecules normally present in the cell can lead to a large (two
Pseudo-noise generator using UNMBER SIEVE''. Kazu furui wo mochiita giji ransu seiseiki
Energy Technology Data Exchange (ETDEWEB)
Kyan, S.; Teruya, H. (University of the Ryukyus, Okinawa (Japan). College of Engineering)
1992-09-01
In data communications which require secrecy, the Vernam cipher method is often used because of its simple principle and high security. It is necessary for this method to generate key streams as random numbers. The conventional generating methods using linear feedback shift register (LFSR) or data encryption standard(DES) have some problems in and security and circuit complexity. This paper proposes a pseudo-noise generator of relatively simple structure using number sieve, and describes its structure and security. The pseudo-noise generator consists of the number sieve circuit combined With shift resistors of figures of 8 prime numbers from 2 to 19 and other resisters containing AND in feedback area. The total number of keys that can be selected is 3.8[times]10[sup 25], which is not readable from the aspect of calculation volume. Concerning a model of the number sieve circuit with shift resistors which are reduced to 4, linear complexity, which is part of evaluation standard for the security of pseudo-random numbers for cipher, and hamming distance for different keys are examined. 10 refs., 8 figs., 3 tabs.
A new sentence generator providing material for maximum reading speed measurement.
Perrin, Jean-Luc; Paillé, Damien; Baccino, Thierry
2015-12-01
A new method is proposed to generate text material for assessing maximum reading speed of adult readers. The described procedure allows one to generate a vast number of equivalent short sentences. These sentences can be displayed for different durations in order to determine the reader's maximum speed using a psychophysical threshold algorithm. Each sentence is built so that it is either true or false according to common knowledge. The actual reading is verified by asking the reader to determine the truth value of each sentence. We based our design on the generator described by Crossland et al. and upgraded it. The new generator handles concepts distributed in an ontology, which allows an easy determination of the sentences' truth value and control of lexical and psycholinguistic parameters. In this way many equivalent sentence can be generated and displayed to perform the measurement. Maximum reading speed scores obtained with pseudo-randomly chosen sentences from the generator were strongly correlated with maximum reading speed scores obtained with traditional MNREAD sentences (r = .836). Furthermore, the large number of sentences that can be generated makes it possible to perform repeated measurements, since the possibility of a reader learning individual sentences is eliminated. Researchers interested in within-reader performance variability could use the proposed method for this purpose.
Population clustering based on copy number variations detected from next generation sequencing data.
Duan, Junbo; Zhang, Ji-Gang; Wan, Mingxi; Deng, Hong-Wen; Wang, Yu-Ping
2014-08-01
Copy number variations (CNVs) can be used as significant bio-markers and next generation sequencing (NGS) provides a high resolution detection of these CNVs. But how to extract features from CNVs and further apply them to genomic studies such as population clustering have become a big challenge. In this paper, we propose a novel method for population clustering based on CNVs from NGS. First, CNVs are extracted from each sample to form a feature matrix. Then, this feature matrix is decomposed into the source matrix and weight matrix with non-negative matrix factorization (NMF). The source matrix consists of common CNVs that are shared by all the samples from the same group, and the weight matrix indicates the corresponding level of CNVs from each sample. Therefore, using NMF of CNVs one can differentiate samples from different ethnic groups, i.e. population clustering. To validate the approach, we applied it to the analysis of both simulation data and two real data set from the 1000 Genomes Project. The results on simulation data demonstrate that the proposed method can recover the true common CNVs with high quality. The results on the first real data analysis show that the proposed method can cluster two family trio with different ancestries into two ethnic groups and the results on the second real data analysis show that the proposed method can be applied to the whole-genome with large sample size consisting of multiple groups. Both results demonstrate the potential of the proposed method for population clustering.
Human Y chromosome copy number variation in the next generation sequencing era and beyond.
Massaia, Andrea; Xue, Yali
2017-05-01
The human Y chromosome provides a fertile ground for structural rearrangements owing to its haploidy and high content of repeated sequences. The methodologies used for copy number variation (CNV) studies have developed over the years. Low-throughput techniques based on direct observation of rearrangements were developed early on, and are still used, often to complement array-based or sequencing approaches which have limited power in regions with high repeat content and specifically in the presence of long, identical repeats, such as those found in human sex chromosomes. Some specific rearrangements have been investigated for decades; because of their effects on fertility, or their outstanding evolutionary features, the interest in these has not diminished. However, following the flourishing of large-scale genomics, several studies have investigated CNVs across the whole chromosome. These studies sometimes employ data generated within large genomic projects such as the DDD study or the 1000 Genomes Project, and often survey large samples of healthy individuals without any prior selection. Novel technologies based on sequencing long molecules and combinations of technologies, promise to stimulate the study of Y-CNVs in the immediate future.
Iacocca, Michael A; Wang, Jian; Dron, Jacqueline S; Robinson, John F; McIntyre, Adam D; Cao, Henian; Hegele, Robert A
2017-11-01
Familial hypercholesterolemia (FH) is a heritable condition of severely elevated LDL cholesterol, caused predominantly by autosomal codominant mutations in the LDL receptor gene ( LDLR ). In providing a molecular diagnosis for FH, the current procedure often includes targeted next-generation sequencing (NGS) panels for the detection of small-scale DNA variants, followed by multiplex ligation-dependent probe amplification (MLPA) in LDLR for the detection of whole-exon copy number variants (CNVs). The latter is essential because ∼10% of FH cases are attributed to CNVs in LDLR ; accounting for them decreases false negative findings. Here, we determined the potential of replacing MLPA with bioinformatic analysis applied to NGS data, which uses depth-of-coverage analysis as its principal method to identify whole-exon CNV events. In analysis of 388 FH patient samples, there was 100% concordance in LDLR CNV detection between these two methods: 38 reported CNVs identified by MLPA were also successfully detected by our NGS method, while 350 samples negative for CNVs by MLPA were also negative by NGS. This result suggests that MLPA can be removed from the routine diagnostic screening for FH, significantly reducing associated costs, resources, and analysis time, while promoting more widespread assessment of this important class of mutations across diagnostic laboratories. Copyright © 2017 by the American Society for Biochemistry and Molecular Biology, Inc.
Generalized hardware post-processing technique for chaos-based pseudorandom number generators
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.
International Nuclear Information System (INIS)
Ko, T.H.
2006-01-01
In the present paper, the entropy generation and optimal Reynolds number for developing forced convection in a double sine duct with various wall heat fluxes, which frequently occurs in plate heat exchangers, are studied based on the entropy generation minimization principle by analytical thermodynamic analysis as well as numerical investigation. According to the thermodynamic analysis, a very simple expression for the optimal Reynolds number for the double sine duct as a function of mass flow rate, wall heat flux, working fluid and geometric dimensions is proposed. In the numerical simulations, the investigated Reynolds number (Re) covers the range from 86 to 2000 and the wall heat flux (q'') varies as 160, 320 and 640 W/m 2 . From the numerical simulation of the developing laminar forced convection in the double sine duct, the effect of Reynolds number on entropy generation in the duct has been examined, through which the optimal Reynolds number with minimal entropy generation is detected. The optimal Reynolds number obtained from the analytical thermodynamic analysis is compared with the one from the numerical solutions and is verified to have a similar magnitude of entropy generation as the minimal entropy generation predicted by the numerical simulations. The optimal analysis provided in the present paper gives worthy information for heat exchanger design, since the thermal system could have the least irreversibility and best exergy utilization if the optimal Re can be used according to practical design conditions
Directory of Open Access Journals (Sweden)
M. Varchola
2009-12-01
Full Text Available This paper deals with an evaluation platform for cryptographic True Random Number Generators (TRNGs based on the hardware implementation of statistical tests for FPGAs. It was developed in order to provide an automatic tool that helps to speed up the TRNG design process and can provide new insights on the TRNG behavior as it will be shown on a particular example in the paper. It enables to test sufﬁcient statistical properties of various TRNG designs under various working conditions on the ﬂy. Moreover, the tests are suitable to be embedded into cryptographic hardware products in order to recognize TRNG output of weak quality and thus increase its robustness and reliability. Tests are fully compatible with the FIPS 140 standard and are implemented by the VHDL language as an IP-Core for vendor independent FPGAs. A recent Flash based Actel Fusion FPGA was chosen for preliminary experiments. The Actel version of the tests possesses an interface to the Actel’s CoreMP7 softcore processor that is fully compatible with the industry standard ARM7TDMI. Moreover, identical tests suite was implemented to the Xilinx Virtex 2 and 5 in order to compare the performance of the proposed solution with the performance of already published one based on the same FPGAs. It was achieved 25% and 65% greater clock frequency respectively while consuming almost equal resources of the Xilinx FPGAs. On the top of it, the proposed FIPS 140 architecture is capable of processing one random bit per one clock cycle which results in 311.5 Mbps throughput for Virtex 5 FPGA.
Towards the generation of random bits at terahertz rates based on a chaotic semiconductor laser
International Nuclear Information System (INIS)
Kanter, Ido; Aviad, Yaara; Reidler, Igor; Cohen, Elad; Rosenbluh, Michael
2010-01-01
Random bit generators (RBGs) are important in many aspects of statistical physics and crucial in Monte-Carlo simulations, stochastic modeling and quantum cryptography. The quality of a RBG is measured by the unpredictability of the bit string it produces and the speed at which the truly random bits can be generated. Deterministic algorithms generate pseudo-random numbers at high data rates as they are only limited by electronic hardware speed, but their unpredictability is limited by the very nature of their deterministic origin. It is widely accepted that the core of any true RBG must be an intrinsically non-deterministic physical process, e.g. measuring thermal noise from a resistor. Owing to low signal levels, such systems are highly susceptible to bias, introduced by amplification, and to small nonrandom external perturbations resulting in a limited generation rate, typically less than 100M bit/s. We present a physical random bit generator, based on a chaotic semiconductor laser, having delayed optical feedback, which operates reliably at rates up to 300Gbit/s. The method uses a high derivative of the digitized chaotic laser intensity and generates the random sequence by retaining a number of the least significant bits of the high derivative value. The method is insensitive to laser operational parameters and eliminates the necessity for all external constraints such as incommensurate sampling rates and laser external cavity round trip time. The randomness of long bit strings is verified by standard statistical tests.
Towards the generation of random bits at terahertz rates based on a chaotic semiconductor laser
Kanter, Ido; Aviad, Yaara; Reidler, Igor; Cohen, Elad; Rosenbluh, Michael
2010-06-01
Random bit generators (RBGs) are important in many aspects of statistical physics and crucial in Monte-Carlo simulations, stochastic modeling and quantum cryptography. The quality of a RBG is measured by the unpredictability of the bit string it produces and the speed at which the truly random bits can be generated. Deterministic algorithms generate pseudo-random numbers at high data rates as they are only limited by electronic hardware speed, but their unpredictability is limited by the very nature of their deterministic origin. It is widely accepted that the core of any true RBG must be an intrinsically non-deterministic physical process, e.g. measuring thermal noise from a resistor. Owing to low signal levels, such systems are highly susceptible to bias, introduced by amplification, and to small nonrandom external perturbations resulting in a limited generation rate, typically less than 100M bit/s. We present a physical random bit generator, based on a chaotic semiconductor laser, having delayed optical feedback, which operates reliably at rates up to 300Gbit/s. The method uses a high derivative of the digitized chaotic laser intensity and generates the random sequence by retaining a number of the least significant bits of the high derivative value. The method is insensitive to laser operational parameters and eliminates the necessity for all external constraints such as incommensurate sampling rates and laser external cavity round trip time. The randomness of long bit strings is verified by standard statistical tests.
Jahanshahi, M; Profice, P; Brown, R G; Ridding, M C; Dirnberger, G; Rothwell, J C
1998-08-01
Random number generation is an attention-demanding task that engages working memory and executive processes. Random number generation requires holding information 'on line', suppression of habitual counting, internally driven response generation and monitoring of responses. Evidence from PET studies suggests that the dorsolateral prefrontal cortex (DLPFC) is involved in the generation of random responses. We examined the effects of short trains of transcranial magnetic stimulation (TMS) over the left or right DLPFC or medial frontal cortex on random number generation in healthy normal participants. As in previous evidence, in control trials without stimulation participants performed poorly on the random number generation task, showing repetition avoidance and a tendency to count. Brief disruption of processing with TMS over the left DLPFC changed the balance of the individuals' counting bias, increasing the most habitual counting in ones and reducing the lower probability response of counting in twos. This differential effect of TMS over the left DLPFC on the balance of the subject's counting bias was not obtained with TMS over the right DLPFC or the medial frontal cortex. The results suggest that, with disruption of the left DLPFC with TMS, habitual counting in ones that has previously been suppressed is released from inhibition. From these findings a network modulation model of random number generation is proposed, whereby suppression of habitual responses is achieved through the modulatory influence of the left DLPFC over a number-associative network in the superior temporal cortex. To allow emergence of appropriate random responses, the left DLPFC inhibits the superior temporal cortex to prevent spreading activation and habitual counting in ones.
Mesh Generation and Adaption for High Reynolds Number RANS Computations, Phase I
National Aeronautics and Space Administration — This proposal offers to provide NASA with an automatic mesh generator for the simulation of aerodynamic flows using Reynolds-Averages Navier-Stokes (RANS) models....
Mesh Generation and Adaption for High Reynolds Number RANS Computations, Phase II
National Aeronautics and Space Administration — This proposal offers to provide NASA with an automatic mesh generator for the simulation of aerodynamic flows using Reynolds-Averages Navier-Stokes (RANS) models....
Directory of Open Access Journals (Sweden)
Mathukumalli Srinivasa Rao
Full Text Available The present study features the estimation of number of generations of tobacco caterpillar, Spodoptera litura. Fab. on peanut crop at six locations in India using MarkSim, which provides General Circulation Model (GCM of future data on daily maximum (T.max, minimum (T.min air temperatures from six models viz., BCCR-BCM2.0, CNRM-CM3, CSIRO-Mk3.5, ECHams5, INCM-CM3.0 and MIROC3.2 along with an ensemble of the six from three emission scenarios (A2, A1B and B1. This data was used to predict the future pest scenarios following the growing degree days approach in four different climate periods viz., Baseline-1975, Near future (NF -2020, Distant future (DF-2050 and Very Distant future (VDF-2080. It is predicted that more generations would occur during the three future climate periods with significant variation among scenarios and models. Among the seven models, 1-2 additional generations were predicted during DF and VDF due to higher future temperatures in CNRM-CM3, ECHams5 & CSIRO-Mk3.5 models. The temperature projections of these models indicated that the generation time would decrease by 18-22% over baseline. Analysis of variance (ANOVA was used to partition the variation in the predicted number of generations and generation time of S. litura on peanut during crop season. Geographical location explained 34% of the total variation in number of generations, followed by time period (26%, model (1.74% and scenario (0.74%. The remaining 14% of the variation was explained by interactions. Increased number of generations and reduction of generation time across the six peanut growing locations of India suggest that the incidence of S. litura may increase due to projected increase in temperatures in future climate change periods.
Li, Dongfang; Lu, Zhaojun; Zou, Xuecheng; Liu, Zhenglin
2015-10-16
Random number generators (RNG) play an important role in many sensor network systems and applications, such as those requiring secure and robust communications. In this paper, we develop a high-security and high-throughput hardware true random number generator, called PUFKEY, which consists of two kinds of physical unclonable function (PUF) elements. Combined with a conditioning algorithm, true random seeds are extracted from the noise on the start-up pattern of SRAM memories. These true random seeds contain full entropy. Then, the true random seeds are used as the input for a non-deterministic hardware RNG to generate a stream of true random bits with a throughput as high as 803 Mbps. The experimental results show that the bitstream generated by the proposed PUFKEY can pass all standard national institute of standards and technology (NIST) randomness tests and is resilient to a wide range of security attacks.
Directory of Open Access Journals (Sweden)
Dongfang Li
2015-10-01
Full Text Available Random number generators (RNG play an important role in many sensor network systems and applications, such as those requiring secure and robust communications. In this paper, we develop a high-security and high-throughput hardware true random number generator, called PUFKEY, which consists of two kinds of physical unclonable function (PUF elements. Combined with a conditioning algorithm, true random seeds are extracted from the noise on the start-up pattern of SRAM memories. These true random seeds contain full entropy. Then, the true random seeds are used as the input for a non-deterministic hardware RNG to generate a stream of true random bits with a throughput as high as 803 Mbps. The experimental results show that the bitstream generated by the proposed PUFKEY can pass all standard national institute of standards and technology (NIST randomness tests and is resilient to a wide range of security attacks.
ArcCN-Runoff: An ArcGIS tool for generating curve number and runoff maps
Zhan, X.; Huang, M.-L.
2004-01-01
The development and the application of ArcCN-Runoff tool, an extension of ESRI@ ArcGIS software, are reported. This tool can be applied to determine curve numbers and to calculate runoff or infiltration for a rainfall event in a watershed. Implementation of GIS techniques such as dissolving, intersecting, and a curve-number reference table improve efficiency. Technical processing time may be reduced from days, if not weeks, to hours for producing spatially varied curve number and runoff maps. An application example for a watershed in Lyon County and Osage County, Kansas, USA, is presented. ?? 2004 Elsevier Ltd. All rights reserved.
Ghosh, Amal K.
2010-09-01
The parity generators and the checkers are the most important circuits in communication systems. With the development of multi-valued logic (MVL), the proposed system with parity generators and checkers is the most required using the recently developed optoelectronic technology in the modified trinary number (MTN) system. This system also meets up the tremendous needs of speeds by exploiting the savart plates and spatial light modulators (SLM) in the optical tree architecture (OTA).
Bakar, Suhaili Abu; Hollox, Edward J.; Armour, John A. L.
2009-01-01
β-Defensins are small secreted antimicrobial and signaling peptides involved in the innate immune response of vertebrates. In humans, a cluster of at least 7 of these genes shows extensive copy number variation, with a diploid copy number commonly ranging between 2 and 7. Using a genetic mapping approach, we show that this cluster is at not 1 but 2 distinct genomic loci ≈5 Mb apart on chromosome band 8p23.1, contradicting the most recent genome assembly. We also demonstrate that the predominant mechanism of change in β-defensin copy number is simple allelic recombination occurring in the interval between the 2 distinct genomic loci for these genes. In 416 meiotic transmissions, we observe 3 events creating a haplotype copy number not found in the parent, equivalent to a germ-line rate of copy number change of ≈0.7% per gamete. This places it among the fastest-changing copy number variants currently known. PMID:19131514
[Influence of PCR cycle number on microbial diversity analysis through next generation sequencing].
An, Yunhe; Gao, Lijuan; Li, Junbo; Tian, Yanjie; Wang, Jinlong; Zheng, Xuejuan; Wu, Huijuan
2016-08-25
Using of high throughput sequencing technology to study the microbial diversity in complex samples has become one of the hottest issues in the field of microbial diversity research. In this study, the soil and sheep rumen chyme samples were used to extract DNA, respectively. Then the 25 ng total DNA was used to amplify the 16S rRNA V3 region with 20, 25, 30 PCR cycles, and the final sequencing library was constructed by mixing equal amounts of purified PCR products. Finally, the operational taxonomic unit (OUT) amount, rarefaction curve, microbial number and species were compared through data analysis. It was found that at the same amount of DNA template, the proportion of the community composition was not the best with more numbers of PCR cycle, although the species number was much more. In all, when the PCR cycle number is 25, the number of species and proportion of the community composition were the most optimal both in soil or chyme samples.
A Parametric Study of a Constant-Mach-Number MHD Generator with Nuclear Ionization
International Nuclear Information System (INIS)
Braun, J.
1965-03-01
The influence of electrical and gas dynamical parameters on the length, of a linear constant-Mach-number MHD duct has been investigated. The gas has been assumed to be ionized by neutron irradiation in the expansion nozzle preceding the MHD duct. Inside the duct the electron recombination is assumed to be governed, by volume recombination. It is found that there exists a distinct domain from which the parameters must be chosen, pressure and Mach number being the most critical ones. If power densities in the order of magnitude 100 MW/m 3 are desired, high magnetic fields and Mach numbers in the supersonic range are needed. The influence of the variation of critical parameters on the channel length is given as a product of simple functions, each containing one parameter
A Parametric Study of a Constant-Mach-Number MHD Generator with Nuclear Ionization
Energy Technology Data Exchange (ETDEWEB)
Braun, J
1965-03-15
The influence of electrical and gas dynamical parameters on the length, of a linear constant-Mach-number MHD duct has been investigated. The gas has been assumed to be ionized by neutron irradiation in the expansion nozzle preceding the MHD duct. Inside the duct the electron recombination is assumed to be governed, by volume recombination. It is found that there exists a distinct domain from which the parameters must be chosen, pressure and Mach number being the most critical ones. If power densities in the order of magnitude 100 MW/m{sup 3} are desired, high magnetic fields and Mach numbers in the supersonic range are needed. The influence of the variation of critical parameters on the channel length is given as a product of simple functions, each containing one parameter.
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.
Efficient Sampling of the Structure of Crypto Generators' State Transition Graphs
Keller, Jörg
Cryptographic generators, e.g. stream cipher generators like the A5/1 used in GSM networks or pseudo-random number generators, are widely used in cryptographic network protocols. Basically, they are finite state machines with deterministic transition functions. Their state transition graphs typically cannot be analyzed analytically, nor can they be explored completely because of their size which typically is at least n = 264. Yet, their structure, i.e. number and sizes of weakly connected components, is of interest because a structure deviating significantly from expected values for random graphs may form a distinguishing attack that indicates a weakness or backdoor. By sampling, one randomly chooses k nodes, derives their distribution onto connected components by graph exploration, and extrapolates these results to the complete graph. In known algorithms, the computational cost to determine the component for one randomly chosen node is up to O(√n), which severely restricts the sample size k. We present an algorithm where the computational cost to find the connected component for one randomly chosen node is O(1), so that a much larger sample size k can be analyzed in a given time. We report on the performance of a prototype implementation, and about preliminary analysis for several generators.
Baryon number generation in a flipped SU(5) x U(1) model
International Nuclear Information System (INIS)
Campbell, B.; Hagelin, J.; Nanopoulos, D.V.; Olive, K.A.
1988-01-01
We consider the possibilities for generating a baryon asymmetry in the early universe in a flipped SU(5) x U(1) model inspired by the superstring. Depending on the temperature of the radiation background after inflation we can distinguish between two scenarios for baryogenesis: (1) After reheating the original SU(5) x U(1) symmetry is restored, or there was no inflation at all; (2) reheating after inflation is rather weak and SU(5) x U(1) is broken. In either case the asymmetry is generated by the out-of-equilibrium decays of a massive SU(3) x SU(2) x U(1) singlet field φ m . In the flipped SU(5) x U(1) model, gauge symmetry breaking is triggered by strong coupling phenomena, and is in general accompanied by the production of entropy. We examine constraints on the reheating temperature and the strong coupling scale in each of the scenarios. (orig.)
Generating Random Samples of a Given Size Using Social Security Numbers.
Erickson, Richard C.; Brauchle, Paul E.
1984-01-01
The purposes of this article are (1) to present a method by which social security numbers may be used to draw cluster samples of a predetermined size and (2) to describe procedures used to validate this method of drawing random samples. (JOW)
Optimal sub-Poissonian light generation from twin beams by photon-number resolving detectors
Czech Academy of Sciences Publication Activity Database
Lamperti, M.; Allevi, A.; Bondani, M.; Machulka, R.; Michálek, Václav; Haderka, O.; Peřina Jr., J.
2013-01-01
Roč. 31, č. 1 (2013), s. 20-25 ISSN 0740-3224 R&D Projects: GA ČR GAP205/12/0382 Institutional support: RVO:68378271 Keywords : photon- number resolving * quantum correlation Subject RIV: BH - Optics, Masers, Lasers Impact factor: 1.806, year: 2013
Earnest, Darrell Steven
2012-01-01
This dissertation explores fifth and eighth grade students' interpretations of three kinds of mathematical representations: number lines, the Cartesian plane, and graphs of linear functions. Two studies were conducted. In Study 1, I administered the paper-and-pencil Linear Representations Assessment (LRA) to examine students'…
Directory of Open Access Journals (Sweden)
Marcin Piotr Pawlowski
2015-10-01
Full Text Available Entropy in computer security is associated with the unpredictability of a source of randomness. The random source with high entropy tends to achieve a uniform distribution of random values. Random number generators are one of the most important building blocks of cryptosystems. In constrained devices of the Internet of Things ecosystem, high entropy random number generators are hard to achieve due to hardware limitations. For the purpose of the random number generation in constrained devices, this work proposes a solution based on the least-significant bits concatenation entropy harvesting method. As a potential source of entropy, on-board integrated sensors (i.e., temperature, humidity and two different light sensors have been analyzed. Additionally, the costs (i.e., time and memory consumption of the presented approach have been measured. The results obtained from the proposed method with statistical fine tuning achieved a Shannon entropy of around 7.9 bits per byte of data for temperature and humidity sensors. The results showed that sensor-based random number generators are a valuable source of entropy with very small RAM and Flash memory requirements for constrained devices of the Internet of Things.
Pawlowski, Marcin Piotr; Jara, Antonio; Ogorzalek, Maciej
2015-01-01
Entropy in computer security is associated with the unpredictability of a source of randomness. The random source with high entropy tends to achieve a uniform distribution of random values. Random number generators are one of the most important building blocks of cryptosystems. In constrained devices of the Internet of Things ecosystem, high entropy random number generators are hard to achieve due to hardware limitations. For the purpose of the random number generation in constrained devices, this work proposes a solution based on the least-significant bits concatenation entropy harvesting method. As a potential source of entropy, on-board integrated sensors (i.e., temperature, humidity and two different light sensors) have been analyzed. Additionally, the costs (i.e., time and memory consumption) of the presented approach have been measured. The results obtained from the proposed method with statistical fine tuning achieved a Shannon entropy of around 7.9 bits per byte of data for temperature and humidity sensors. The results showed that sensor-based random number generators are a valuable source of entropy with very small RAM and Flash memory requirements for constrained devices of the Internet of Things. PMID:26506357
Pawlowski, Marcin Piotr; Jara, Antonio; Ogorzalek, Maciej
2015-10-22
Entropy in computer security is associated with the unpredictability of a source of randomness. The random source with high entropy tends to achieve a uniform distribution of random values. Random number generators are one of the most important building blocks of cryptosystems. In constrained devices of the Internet of Things ecosystem, high entropy random number generators are hard to achieve due to hardware limitations. For the purpose of the random number generation in constrained devices, this work proposes a solution based on the least-significant bits concatenation entropy harvesting method. As a potential source of entropy, on-board integrated sensors (i.e., temperature, humidity and two different light sensors) have been analyzed. Additionally, the costs (i.e., time and memory consumption) of the presented approach have been measured. The results obtained from the proposed method with statistical fine tuning achieved a Shannon entropy of around 7.9 bits per byte of data for temperature and humidity sensors. The results showed that sensor-based random number generators are a valuable source of entropy with very small RAM and Flash memory requirements for constrained devices of the Internet of Things.
Raffaelli, Francesco; Ferranti, Giacomo; Mahler, Dylan H.; Sibson, Philip; Kennard, Jake E.; Santamato, Alberto; Sinclair, Gary; Bonneau, Damien; Thompson, Mark G.; Matthews, Jonathan C. F.
2018-04-01
Optical homodyne detection has found use as a characterisation tool in a range of quantum technologies. So far implementations have been limited to bulk optics. Here we present the optical integration of a homodyne detector onto a silicon photonics chip. The resulting device operates at high speed, up 150 MHz, it is compact and it operates with low noise, quantified with 11 dB clearance between shot noise and electronic noise. We perform on-chip quantum tomography of coherent states with the detector and show that it meets the requirements for characterising more general quantum states of light. We also show that the detector is able to produce quantum random numbers at a rate of 1.2 Gbps, by measuring the vacuum state of the electromagnetic field and applying off-line post processing. The produced random numbers pass all the statistical tests provided by the NIST test suite.
Application of random number generators in genetic algorithms to improve rainfall-runoff modelling
Czech Academy of Sciences Publication Activity Database
Chlumecký, M.; Buchtele, Josef; Richta, K.
2017-01-01
Roč. 553, October (2017), s. 350-355 ISSN 0022-1694 Institutional support: RVO:67985874 Keywords : genetic algorithm * optimisation * rainfall-runoff modeling * random generator Subject RIV: DA - Hydrology ; Limnology OBOR OECD: Hydrology Impact factor: 3.483, year: 2016 https://ac.els-cdn.com/S0022169417305516/1-s2.0-S0022169417305516-main.pdf?_tid=fa1bad8a-bd6a-11e7-8567-00000aab0f27&acdnat=1509365462_a1335d3d997e9eab19e23b1eee977705
Generating functional analysis of batch minority games with arbitrary strategy numbers
International Nuclear Information System (INIS)
Shayeghi, N; Coolen, A C C
2006-01-01
Both the phenomenology and the theory of minority games (MG) with more than two strategies per agent are different from those of the conventional and extensively studied case S = 2. MGs with S > 2 exhibit nontrivial statistics of the frequencies with which the agents select from their available decision making strategies, with far-reaching implications. In the few theoretical MG studies with S > 2 published so far, these statistics could not be calculated analytically. This prevented solution even in ergodic stationary states; equations for order parameters could only be closed approximately, using simulation data. Here we carry out a generating functional analysis of fake history batch MGs with arbitrary values of S, and give an analytical solution of the strategy frequency problem. This leads to closed equations for order parameters in the ergodic regime, exact expressions for strategy selection statistics, and phase diagrams. Our results find perfect confirmation in numerical simulations
Meaningful Share Generation for Increased Number of Secrets in Visual Secret-Sharing Scheme
Directory of Open Access Journals (Sweden)
Mustafa Ulutas
2010-01-01
Full Text Available This paper presents a new scheme for hiding two halftone secret images into two meaningful shares created from halftone cover images. Meaningful shares are more desirable than noise-like (meaningless shares in Visual Secret Sharing because they look natural and do not attract eavesdroppers' attention. Previous works in the field focus on either increasing number of secrets or creating meaningful shares for one secret image. The method outlined in this paper both increases the number of secrets and creates meaningful shares at the same time. While the contrast ratio of shares is equal to that of Extended Visual Cryptography, two secrets are encoded into two shares as opposed to one secret in the Extended Visual Cryptography. Any two natural-looking images can be used as cover unlike the Halftone Visual Cryptography method where one cover should be the negative of the other cover image and can only encode one secret. Effectiveness of the proposed method is verified by an experiment.
Directory of Open Access Journals (Sweden)
Taciana Melissa de Azevedo Kuhn
2017-12-01
Full Text Available ABSTRACT: The thermal threshold and thermal requirements of Neopamera bilobata were determined, and the number of generations that this species may produce in the main strawberry-producing regions of Brazil was estimated. In a climate chamber (70±10% RH and 12h photophase at 16, 19, 22, 25, 28, or 30±1°C, the development of 120 eggs was monitored until the adult stage, at each temperature. Nymphs were maintained in individual cages and fed on strawberry fruits of the cultivar Aromas. The mean duration and viability of the egg and nymph stages were calculated by estimating the lower and upper developmental thresholds and the thermal constant, and this information was used to estimate the number of generations per year in different strawberry-producing regions of Brazil. The egg-to-adult duration decreased as temperatures increased, up to 28°C (93.4, 83.2, 43.9, and 31.4 days at 19, 22, 25, and 28°C, respectively. Viability of nymphs was highest between 22 and 28°C. At 30°C, the egg-to-adult duration increased (36 days, while the viability decreased (11.11%. The lower egg-to-adult developmental threshold was 15.2°C and the thermal constant was 418.4 degree-days. Calculating the number of generations indicated that the largest number (5.1 generations yr-1 was obtained for the municipality of Jaboti, Paraná, and the smallest for Caxias do Sul, Rio Grande do Sul (1.9 generations yr-1. Our findings demonstrated that important strawberry-producing regions in Brazil are suitable for the development of N. bilobata.
Enhancement of the Number of Fast Electrons Generated in a Laser Inverse Cone Interaction
International Nuclear Information System (INIS)
Yan-Ling, Ji; Gang, Jiang; Wei-Dong, Wu; Ji-Cheng, Zhang; Yong-Jian, Tang
2010-01-01
Enhancement of the energy-conversion efficiency from laser to target electrons is demonstrated by two-dimensional particle-in-cell simulations in a laser-inverse cone interaction. When an intense short-pulse laser illuminates the inverse cone target, the electrons at the cone end are accelerated by the ponderomotive force. Then these electrons are guided and confined to transport along the inverse cone walls by the induced electromagnetic fields. A device consisting of inverse hollow-cone and multihole array plasma is proposed in order to increase the energy-conversion efficiency from laser to electrons. Particle-in-cell simulations present that the multiholes transpiercing the cone end help to enhance the number of fast electrons and the maximum electron energy significantly. (physics of gases, plasmas, and electric discharges)
Experimental Method for Plotting S-N Curve with a Small Number of Specimens
Directory of Open Access Journals (Sweden)
Strzelecki Przemysław
2016-12-01
Full Text Available The study presents two approaches to plotting an S-N curve based on the experimental results. The first approach is commonly used by researchers and presented in detail in many studies and standard documents. The model uses a linear regression whose parameters are estimated by using the least squares method. A staircase method is used for an unlimited fatigue life criterion. The second model combines the S-N curve defined as a straight line and the record of random occurrence of the fatigue limit. A maximum likelihood method is used to estimate the S-N curve parameters. Fatigue data for C45+C steel obtained in the torsional bending test were used to compare the estimated S-N curves. For pseudo-random numbers generated by using the Mersenne Twister algorithm, the estimated S-N curve for 10 experimental results plotted by using the second model, estimates the fatigue life in the scatter band of the factor 3. The result gives good approximation, especially regarding the time required to plot the S-N curve.
Matzen, Laura E; Benz, Zachary O; Dixon, Kevin R; Posey, Jamie; Kroger, James K; Speed, Ann E
2010-05-01
Raven's Progressive Matrices is a widely used test for assessing intelligence and reasoning ability (Raven, Court, & Raven, 1998). Since the test is nonverbal, it can be applied to many different populations and has been used all over the world (Court & Raven, 1995). However, relatively few matrices are in the sets developed by Raven, which limits their use in experiments requiring large numbers of stimuli. For the present study, we analyzed the types of relations that appear in Raven's original Standard Progressive Matrices (SPMs) and created a software tool that can combine the same types of relations according to parameters chosen by the experimenter, to produce very large numbers of matrix problems with specific properties. We then conducted a norming study in which the matrices we generated were compared with the actual SPMs. This study showed that the generated matrices both covered and expanded on the range of problem difficulties provided by the SPMs.
Directory of Open Access Journals (Sweden)
Roselaine Cristina Pereira
Full Text Available ABSTRACT: Chromosome doubling of Italian ryegrass genotypes ( Lolium multiflorum Lam. adapted to the brazilian edaphoclimatic conditions is an important strategy used by breeders and aims to obtain more vigorous genotypes with better forage quality and disease resistance. The effectiveness of chromosome doubling can be measured by genetic stability and fertility rates of plants over generations. However, a common problem in the polyploidization process is the regeneration of mixoploid plants that have impaired fertility and genetic stability. The objective of this study was to verify if progenies of recently tetraploidized plants remain stable regarding DNA content and chromosome number, over two generations. Progenies of L. multiflorum plants artificially tetraploidized with colchicine treatment were evaluated. Chromosome counting and estimates of the DNA content were used to evaluate the genetic stability. The percentage of tetraploid plants (4X increased over generations (18%, 34% and 91% in cycle 0, 1 and 2, respectively. All progenies identified as tetraploid by flow citometry showed variation in chromosome number (mixoploidy, but produced viable seeds. Results showed that stabilization in chromosome number and DNA content in tetraploidized plant progenies requires time and that the success of this procedure depends on a continuous and accurate screening and selection.
Fakhriza, M
2013-01-01
Kriptografi adalah ilmu untuk menyamarkan pesan agar hanya dikenal baik oleh penyedia dan penerima pesan. Algoritma kunci publik RSA adalah salah satu metode dalam ilmu kriptografi. Dalam algoritma kunci publik RSA, ada kunci privat dan publik, di mana masing-masing kunci menggunakan bilangan acak yang merupakan bilangan prima untuk melakukan enkripsi dan dekripsi.Bilangan acak yang dihasilkan sebenarnya adalah bilangan pseudo-random ('hampir' acak). Linear Congruential Generator (LCG) algor...
Strenge, Hans; Lesmana, Cokorda Bagus Jaya; Suryani, Luh Ketut
2009-08-01
Verbal random number generation is a procedurally simple task to assess executive function and appears ideally suited for the use under diverse settings in cross-cultural research. The objective of this study was to examine ethnic group differences between young adults in Bali (Indonesia) and Kiel (Germany): 50 bilingual healthy students, 30 Balinese and 20 Germans, attempted to generate a random sequence of the digits 1 to 9. In Balinese participants, randomization was done in Balinese (native language L1) and Indonesian (first foreign language L2), in German subjects in the German (L1) and English (L2) languages. 10 of 30 Balinese (33%), but no Germans, were unable to inhibit habitual counting in more than half of the responses. The Balinese produced significantly more nonrandom responses than the Germans with higher rates of counting and significantly less occurrence of the digits 2 and 3 in L1 compared with L2. Repetition and cycling behavior did not differ between the four languages. The findings highlight the importance of taking into account culture-bound psychosocial factors for Balinese individuals when administering and interpreting a random number generation test.
Javed, Tariq; Ahmed, B.; Sajid, M.
2018-04-01
The current study focuses on the numerical investigation of the mixed convective peristaltic mechanism through a vertical tube for non-zero Reynolds and wave number. In the set of constitutional equations, energy equation contains the term representing heat generation parameter. The problem is formulated by dropping the assumption of lubrication theory that turns the model mathematically into a system of the nonlinear partial differential equations. The results of the long wavelength in a creeping flow are deduced from the present analysis. Thus, the current study explores the neglected features of peristaltic heat flow in the mixed convective model by considering moderate values of Reynolds and wave numbers. The finite element based on Galerkin’s weighted residual scheme is applied to solve the governing equations. The computed solution is presented in the form of contours of streamlines and isothermal lines, velocity and temperature profiles for variation of different involved parameters. The investigation shows that the strength of circulation for stream function increases by increasing the wave number and Reynolds number. Symmetric isotherms are reported for small values of time-mean flow. Linear behavior of pressure is noticed by vanishing inertial forces while the increase in pressure is observed by amplifying the Reynolds number.
Maleki, Yusef; Zheltikov, Aleksei M.
2018-01-01
An ensemble of nitrogen-vacancy (NV) centers coupled to a circuit QED device is shown to enable an efficient, high-fidelity generation of high-N00N states. Instead of first creating entanglement and then increasing the number of entangled particles N , our source of high-N00N states first prepares a high-N Fock state in one of the NV ensembles and then entangles it to the rest of the system. With such a strategy, high-N N00N states can be generated in just a few operational steps with an extraordinary fidelity. Once prepared, such a state can be stored over a longer period of time due to the remarkably long coherence time of NV centers.
Energy Technology Data Exchange (ETDEWEB)
Stipčević, Mario, E-mail: mario.stipcevic@irb.hr [Photonics and Quantum Optics Research Unit, Center of Excellence for Advanced Materials and Sensing Devices, Ruđer Bošković Institute, Bijenička 54, 10000 Zagreb (Croatia)
2016-03-15
In this work, a new type of elementary logic circuit, named random flip-flop (RFF), is proposed, experimentally realized, and studied. Unlike conventional Boolean logic circuits whose action is deterministic and highly reproducible, the action of a RFF is intentionally made maximally unpredictable and, in the proposed realization, derived from a fundamentally random process of emission and detection of light quanta. We demonstrate novel applications of RFF in randomness preserving frequency division, random frequency synthesis, and random number generation. Possible usages of these applications in the information and communication technology, cryptographic hardware, and testing equipment are discussed.
Directory of Open Access Journals (Sweden)
Hyun-Kyoung Kim
Full Text Available BACKGROUND: The concept of the utilization of rearranged ends for development of personalized biomarkers has attracted much attention owing to its clinical applicability. Although targeted next-generation sequencing (NGS for recurrent rearrangements has been successful in hematologic malignancies, its application to solid tumors is problematic due to the paucity of recurrent translocations. However, copy-number breakpoints (CNBs, which are abundant in solid tumors, can be utilized for identification of rearranged ends. METHOD: As a proof of concept, we performed targeted next-generation sequencing at copy-number breakpoints (TNGS-CNB in nine colon cancer cases including seven primary cancers and two cell lines, COLO205 and SW620. For deduction of CNBs, we developed a novel competitive single-nucleotide polymorphism (cSNP microarray method entailing CNB-region refinement by competitor DNA. RESULT: Using TNGS-CNB, 19 specific rearrangements out of 91 CNBs (20.9% were identified, and two polymerase chain reaction (PCR-amplifiable rearrangements were obtained in six cases (66.7%. And significantly, TNGS-CNB, with its high positive identification rate (82.6% of PCR-amplifiable rearrangements at candidate sites (19/23, just from filtering of aligned sequences, requires little effort for validation. CONCLUSION: Our results indicate that TNGS-CNB, with its utility for identification of rearrangements in solid tumors, can be successfully applied in the clinical laboratory for cancer-relapse and therapy-response monitoring.
Kim, Hyun-Kyoung; Park, Won Cheol; Lee, Kwang Man; Hwang, Hai-Li; Park, Seong-Yeol; Sorn, Sungbin; Chandra, Vishal; Kim, Kwang Gi; Yoon, Woong-Bae; Bae, Joon Seol; Shin, Hyoung Doo; Shin, Jong-Yeon; Seoh, Ju-Young; Kim, Jong-Il; Hong, Kyeong-Man
2014-01-01
The concept of the utilization of rearranged ends for development of personalized biomarkers has attracted much attention owing to its clinical applicability. Although targeted next-generation sequencing (NGS) for recurrent rearrangements has been successful in hematologic malignancies, its application to solid tumors is problematic due to the paucity of recurrent translocations. However, copy-number breakpoints (CNBs), which are abundant in solid tumors, can be utilized for identification of rearranged ends. As a proof of concept, we performed targeted next-generation sequencing at copy-number breakpoints (TNGS-CNB) in nine colon cancer cases including seven primary cancers and two cell lines, COLO205 and SW620. For deduction of CNBs, we developed a novel competitive single-nucleotide polymorphism (cSNP) microarray method entailing CNB-region refinement by competitor DNA. Using TNGS-CNB, 19 specific rearrangements out of 91 CNBs (20.9%) were identified, and two polymerase chain reaction (PCR)-amplifiable rearrangements were obtained in six cases (66.7%). And significantly, TNGS-CNB, with its high positive identification rate (82.6%) of PCR-amplifiable rearrangements at candidate sites (19/23), just from filtering of aligned sequences, requires little effort for validation. Our results indicate that TNGS-CNB, with its utility for identification of rearrangements in solid tumors, can be successfully applied in the clinical laboratory for cancer-relapse and therapy-response monitoring.
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.
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.
Energy Technology Data Exchange (ETDEWEB)
Wang, Yonggang, E-mail: wangyg@ustc.edu.cn; Hui, Cong; Liu, Chong; Xu, Chao [Department of Modern Physics, University of Science and Technology of China, Hefei 230026 (China)
2016-04-15
The contribution of this paper is proposing a new entropy extraction mechanism based on sampling phase jitter in ring oscillators to make a high throughput true random number generator in a field programmable gate array (FPGA) practical. Starting from experimental observation and analysis of the entropy source in FPGA, a multi-phase sampling method is exploited to harvest the clock jitter with a maximum entropy and fast sampling speed. This parametrized design is implemented in a Xilinx Artix-7 FPGA, where the carry chains in the FPGA are explored to realize the precise phase shifting. The generator circuit is simple and resource-saving, so that multiple generation channels can run in parallel to scale the output throughput for specific applications. The prototype integrates 64 circuit units in the FPGA to provide a total output throughput of 7.68 Gbps, which meets the requirement of current high-speed quantum key distribution systems. The randomness evaluation, as well as its robustness to ambient temperature, confirms that the new method in a purely digital fashion can provide high-speed high-quality random bit sequences for a variety of embedded applications.
International Nuclear Information System (INIS)
Nielsen, H.B.; Bennett, D.L.
1987-12-01
Using a model with a regularized (e.g. latticized) Kaluza-Klein space-time at the fundamental scale with Yang-Mills fields in the compactified dimensions, we examine the β-function for a dimensionless expression for the coupling constants g in D-dimensions. In going from the Planck scale of D > 4 down in energy to the scale where D goes from D > 4 to D = 4, it is argued that couplings are weakened by a factor roughly equal to the number of fundamental string regions that can be accommadated in the volume of the compactification space. Subsequently this factor is claimed to be greater than the number of generations by using an argument reminiscent of that often encountered in string model T.O.E. in which various quark and lepton generations are said to correspond to various zero modes of a Weyl operator in the compactifying space. Finally, it is argued that the inequality, which can be shown to be more saturated the larger the gauge group, is already near saturation for the group factors of the SMG. This fact leads to several conclusions: 1. there is not room for many more than 3 generations; 2. G.U.T. can be accommadated only at scales very close to the fundamental scale; 3. No new blossoms are expected to be found in the desert; 4. the compactifying space should not be 'larger than necessary'; 5. at the fundamental scale, couplings are expected to be close to (but not suspiciousely close to) β crit. . (orig./HSI)
Onsongo, Getiria; Baughn, Linda B; Bower, Matthew; Henzler, Christine; Schomaker, Matthew; Silverstein, Kevin A T; Thyagarajan, Bharat
2016-11-01
Simultaneous detection of small copy number variations (CNVs) (<0.5 kb) and single-nucleotide variants in clinically significant genes is of great interest for clinical laboratories. The analytical variability in next-generation sequencing (NGS) and artifacts in coverage data because of issues with mappability along with lack of robust bioinformatics tools for CNV detection have limited the utility of targeted NGS data to identify CNVs. We describe the development and implementation of a bioinformatics algorithm, copy number variation-random forest (CNV-RF), that incorporates a machine learning component to identify CNVs from targeted NGS data. Using CNV-RF, we identified 12 of 13 deletions in samples with known CNVs, two cases with duplications, and identified novel deletions in 22 additional cases. Furthermore, no CNVs were identified among 60 genes in 14 cases with normal copy number and no CNVs were identified in another 104 patients with clinical suspicion of CNVs. All positive deletions and duplications were confirmed using a quantitative PCR method. CNV-RF also detected heterozygous deletions and duplications with a specificity of 50% across 4813 genes. The ability of CNV-RF to detect clinically relevant CNVs with a high degree of sensitivity along with confirmation using a low-cost quantitative PCR method provides a framework for providing comprehensive NGS-based CNV/single-nucleotide variant detection in a clinical molecular diagnostics laboratory. Copyright © 2016 American Society for Investigative Pathology and the Association for Molecular Pathology. Published by Elsevier Inc. All rights reserved.
International Nuclear Information System (INIS)
Bixler, N.E.; Schaperow, J.H.
1998-06-01
VICTORIA is a mechanistic computer code designed to analyze fission product behavior within a nuclear reactor coolant system (RCS) during a severe accident. It provides detailed predictions of the release of radioactive and nonradioactive materials from the reactor core and transport and deposition of these materials within the RCS. A recently completed independent peer review of VICTORIA, while confirming the overall adequacy of the code, recommended a number of modeling improvements. One of these recommendations, to model three rather than a single condensed phase, is the focus of the work reported here. The recommendation has been implemented as an option so that either a single or three condensed phases can be treated. Both options have been employed in the study of fission product behavior during an induced steam generator tube rupture sequence. Differences in deposition patterns and mechanisms predicted using these two options are discussed
Han, Ya; Liu, Yan-Ge; Huang, Wei; Wang, Zhi; Guo, Jun-Qi; Luo, Ming-Ming
2016-07-25
A refractive index (RI) tunable functional materials infiltrated side-hole ring fiber (SHRF) is proposed to generate 10 LP OAM states with 6 topology numbers. On the basis of perturbation theory, the basis of the SHRF is demonstrated to be the LP modes. After a fixed propagation distance of 0.03 m, 0.009 m and 0.012 m, the phase difference between the odd and even LP11x, LP21x,y, LP31x,y modes in the SHRF accumulate to ± π/2 respectively with na ranging from 1.412 to 1.44. Correspondingly, the output states are OAM ± 1x, OAM ± 2x,y, OAM ± 3x,y with a bandwidth of 380 nm, 100 nm and 80 nm respectively. The proposed fiber is easy to be fabricated with the mature fiber drawing technology and could facilitate the realization of all fiber based OAM system.
Morse, Melvin L; Beem, Lance W
2011-12-01
Reiki therapy is documented for relief of pain and stress. Energetic healing has been documented to alter biologic markers of illness such as hematocrit. True random number generators are reported to be affected by energy healers and spiritually oriented conscious awareness. The patient was a then 54-year-old severely ill man who had hepatitis C types 1 and 2 and who did not improve with conventional therapy. He also suffered from obesity, the metabolic syndrome, asthma, and hypertension. He was treated with experimental high-dose interferon/riboviron therapy with resultant profound anemia and neutropenia. Energetic healing and Reiki therapy was administered initially to enhance the patient's sense of well-being and to relieve anxiety. Possible effects on the patient's absolute neutrophil count and hematocrit were incidentally noted. Reiki therapy was then initiated at times of profound neutropenia to assess its possible effect on the patient's absolute neutrophil count (ANC). Reiki and other energetic healing sessions were monitored with a true random number generator (RNG). Statistically significant relationships were documented between Reiki therapy, a quieting of the electronically created white noise of the RNG during healing sessions, and improvement in the patient's ANC. The immediate clinical result was that the patient could tolerate the high-dose interferon regimen without missing doses because of absolute neutropenia. The patient was initially a late responder to interferon and had been given a 5% chance of clearing the virus. He remains clear of the virus 1 year after treatment. The association between changes in the RNG, Reiki therapy, and a patient's ANC is the first to the authors' knowledge in the medical literature. Future studies assessing the effects of energetic healing on specific biologic markers of disease are anticipated. Concurrent use of a true RNG may prove to correlate with the effectiveness of energetic therapy.
International Nuclear Information System (INIS)
Nondillo, Aline; Redaelli, Luiza R.; Pinent, Silvia M.J.; Gitz, Rogerio
2008-01-01
Frankliniella occidentalis (Pergande) is one of the major strawberry pests in southern Brazil. The insect causes russeting and wither in flowers and fruits reducing commercial value. In this work, the thermal requirements of the eggs, larvae and pupae of F. occidentalis were estimated. Thrips development was studied in folioles of strawberry plants at six constant temperatures (16, 19, 22, 25, 28 and 31 deg C) in controlled conditions (70 +- 10% R.H. and 12:12 L:D). The number of annual generations of F. occidentalis was estimated for six strawberry production regions of Rio Grande do Sul State based on its thermal requirements. Developmental time of each F. occidentalis stages was proportional to the temperature increase. The best development rate was obtained when insects were reared at 25 deg C and 28 deg C. The lower threshold and the thermal requirements for the egg to adult stage were 9.9 deg C and 211.9 degree-days, respectively. Considering the thermal requirements of F. occidentalis, 10.7, 12.6, 13.1, 13.6, 16.5 and 17.9 generations/year were estimated, respectively, for Vacaria, Caxias do Sul, Farroupilha, Pelotas, Porto Alegre and Taquari producing regions located in Rio Grande do Sul State, Brazil. (author)
Directory of Open Access Journals (Sweden)
Kei-ichi Morita
Full Text Available Gorlin syndrome (GS is an autosomal dominant disorder that predisposes affected individuals to developmental defects and tumorigenesis, and caused mainly by heterozygous germline PTCH1 mutations. Despite exhaustive analysis, PTCH1 mutations are often unidentifiable in some patients; the failure to detect mutations is presumably because of mutations occurred in other causative genes or outside of analyzed regions of PTCH1, or copy number alterations (CNAs. In this study, we subjected a cohort of GS-affected individuals from six unrelated families to next-generation sequencing (NGS analysis for the combined screening of causative alterations in Hedgehog signaling pathway-related genes. Specific single nucleotide variations (SNVs of PTCH1 causing inferred amino acid changes were identified in four families (seven affected individuals, whereas CNAs within or around PTCH1 were found in two families in whom possible causative SNVs were not detected. Through a targeted resequencing of all coding exons, as well as simultaneous evaluation of copy number status using the alignment map files obtained via NGS, we found that GS phenotypes could be explained by PTCH1 mutations or deletions in all affected patients. Because it is advisable to evaluate CNAs of candidate causative genes in point mutation-negative cases, NGS methodology appears to be useful for improving molecular diagnosis through the simultaneous detection of both SNVs and CNAs in the targeted genes/regions.
Morita, Kei-ichi; Naruto, Takuya; Tanimoto, Kousuke; Yasukawa, Chisato; Oikawa, Yu; Masuda, Kiyoshi; Imoto, Issei; Inazawa, Johji; Omura, Ken; Harada, Hiroyuki
2015-01-01
Gorlin syndrome (GS) is an autosomal dominant disorder that predisposes affected individuals to developmental defects and tumorigenesis, and caused mainly by heterozygous germline PTCH1 mutations. Despite exhaustive analysis, PTCH1 mutations are often unidentifiable in some patients; the failure to detect mutations is presumably because of mutations occurred in other causative genes or outside of analyzed regions of PTCH1, or copy number alterations (CNAs). In this study, we subjected a cohort of GS-affected individuals from six unrelated families to next-generation sequencing (NGS) analysis for the combined screening of causative alterations in Hedgehog signaling pathway-related genes. Specific single nucleotide variations (SNVs) of PTCH1 causing inferred amino acid changes were identified in four families (seven affected individuals), whereas CNAs within or around PTCH1 were found in two families in whom possible causative SNVs were not detected. Through a targeted resequencing of all coding exons, as well as simultaneous evaluation of copy number status using the alignment map files obtained via NGS, we found that GS phenotypes could be explained by PTCH1 mutations or deletions in all affected patients. Because it is advisable to evaluate CNAs of candidate causative genes in point mutation-negative cases, NGS methodology appears to be useful for improving molecular diagnosis through the simultaneous detection of both SNVs and CNAs in the targeted genes/regions.
Directory of Open Access Journals (Sweden)
V. I. Milykh
2016-12-01
Full Text Available Purpose. The work is dedicated to the presentation of the principle of construction and implementation of an automated synthesis system of the turbo-generator (TG electromagnetic system in the case of its modernization. This is done on the example of changing the number of the stator core slots. Methodology. The basis of the synthesis is a TG basic construction. Its structure includes the mathematical and physical-geometrical models, as well as the calculation model for the FEMM software environment, providing the numerical calculations of the magnetic fields and electromagnetic parameters of TG. The mathematical model links the changing and basic dimensions and parameters of the electromagnetic system, provided that the TG power parameters are ensured. The physical-geometrical model is the geometric mapping of the electromagnetic system with the specified physical properties of its elements. This model converts the TG electromagnetic system in a calculation model for the FEMM program. Results. Testing of the created synthesis system is carried out on the example of the 340 MW TG. The geometric, electromagnetic and power parameters of its basic construction and its new variants at the different numbers of the stator slots are compared. The harmonic analysis of the temporal function of the stator winding EMF is also made for the variants being compared. Originality. The mathematical model, relating the new and base parameters of TG at the changing of the number of the stator slots is created. A Lua script, providing the numerical-field calculations of the TG electromagnetic parameters in the FEMM software environment is worked out. Construction of the constructive and calculation models, the numerical-field calculations and delivery of results are performed by a computer automatically, that ensures high efficiency of the TG design process. Practical value. The considered version of the TG modernization on the example of changing the number of the
Directory of Open Access Journals (Sweden)
Balajee Maram K.
2016-02-01
Full Text Available Data security is a major issue because of rapid evolution of data communication over unsecured internetwork. Here the proposed system is concerned with the problem of randomly generated S-box. The generation of S-box depends on Pseudo-Random-Number-Generators and shared-secret-key. The process of Pseudo-Random-Number-Generator depends on large prime numbers. All Pseudo-Random-Numbers are scrambled according to shared-secret-key. After scrambling, the S-box is generated. In this research, large prime numbers are the inputs to the Pseudo-Random-Number-Generator. The proposed S-box will reduce the complexity of S-box generation. Based on S-box parameters, it experimentally investigates the quality and robustness of the proposed algorithm which was tested. It yields better results with the S-box parameters like Hamming Distance, Balanced Output and Avalanche Effect and can be embedded to popular cryptography algorithms
Choi, Myung-Seok; Aida, Takuzo; Yamazaki, Tomoko; Yamazaki, Iwao
2002-06-17
A series of star- and cone-shaped dendritic multiporphyrin arrays, (nPZn)4PFB and (nPZn)1PFB, respectively, that contain energy-donating dendritic zinc porphyrin (PZn) wedges of different numbers (n = 1, 3, and 7) of the PZn units, attached to an energy-accepting free-base porphyrin (PFB) core, were synthesized by a convergent growth approach. For the cone-shaped series ((nPZn)1PFB), the efficiency of energy transfer (phi ENT) from the photoexcited PZn units to the focal PFB core, as evaluated from the fluorescence lifetimes of the PZn units, considerably decreased as the generation number increased: (1PZn)1PFB (86%), (3PZn)1PFB (66%), and (7PZn)1PFB (19%). In sharp contrast, the star-shaped series ((nPZn)4PFB) all showed high phi ENT values: (1PZn)4PFB (87%), (3PZn)4PFB (80%), and (7PZn)4PFB (71%). Energy transfer efficiencies of (3PZn)4-ester-PFB, (1PZn)4-ester-PFB, and (3PZn)1-ester-PFB, whose dendritic PZn wedges are connected by an ester linkage to the PFB core, were almost comparable to those of the corresponding ether-linked versions. Fluorescence depolarization (P) studies showed much lower P values for star-shaped (7PZn)4PFB and (3PZn)4PFB than cone-shaped (7PZn)1PFB and (3PZn)1PFB, respectively, indicating a highly efficient energy migration among the PZn units in the star-shaped series. Such a morphology-assisted photochemical event is probably responsible for the excellent light-harvesting activity of large (7PZn)4PFB molecules.
Iacocca, Michael A.; Wang, Jian; Dron, Jacqueline S.; Robinson, John F.; McIntyre, Adam D.; Cao, Henian
2017-01-01
Familial hypercholesterolemia (FH) is a heritable condition of severely elevated LDL cholesterol, caused predominantly by autosomal codominant mutations in the LDL receptor gene (LDLR). In providing a molecular diagnosis for FH, the current procedure often includes targeted next-generation sequencing (NGS) panels for the detection of small-scale DNA variants, followed by multiplex ligation-dependent probe amplification (MLPA) in LDLR for the detection of whole-exon copy number variants (CNVs). The latter is essential because ∼10% of FH cases are attributed to CNVs in LDLR; accounting for them decreases false negative findings. Here, we determined the potential of replacing MLPA with bioinformatic analysis applied to NGS data, which uses depth-of-coverage analysis as its principal method to identify whole-exon CNV events. In analysis of 388 FH patient samples, there was 100% concordance in LDLR CNV detection between these two methods: 38 reported CNVs identified by MLPA were also successfully detected by our NGS method, while 350 samples negative for CNVs by MLPA were also negative by NGS. This result suggests that MLPA can be removed from the routine diagnostic screening for FH, significantly reducing associated costs, resources, and analysis time, while promoting more widespread assessment of this important class of mutations across diagnostic laboratories. PMID:28874442
High speed true random number generator with a new structure of coarse-tuning PDL in FPGA
Fang, Hongzhen; Wang, Pengjun; Cheng, Xu; Zhou, Keji
2018-03-01
A metastability-based TRNG (true random number generator) is presented in this paper, and implemented in FPGA. The metastable state of a D flip-flop is tunable through a two-stage PDL (programmable delay line). With the proposed coarse-tuning PDL structure, the TRNG core does not require extra placement and routing to ensure its entropy. Furthermore, the core needs fewer stages of coarse-tuning PDL at higher operating frequency, and thus saves more resources in FPGA. The designed TRNG achieves 25 Mbps @ 100 MHz throughput after proper post-processing, which is several times higher than other previous TRNGs based on FPGA. Moreover, the robustness of the system is enhanced with the adoption of a feedback system. The quality of the designed TRNG is verified by NIST (National Institute of Standards and Technology) and also accepted by class P1 of the AIS-20/31 test suite. Project supported by the S&T Plan of Zhejiang Provincial Science and Technology Department (No. 2016C31078), the National Natural Science Foundation of China (Nos. 61574041, 61474068, 61234002), and the K.C. Wong Magna Fund in Ningbo University, China.
Directory of Open Access Journals (Sweden)
Wouter eOomens
2015-06-01
Full Text Available The concept of executive functions plays a prominent role in contemporary experimental and clinical studies on cognition. One paradigm used in this framework is the random number generation (RNG task, the execution of which demands aspects of executive functioning, specifically inhibition and working memory. Data from the RNG task are best seen as a series of successive events. However, traditional RNG measures that are used to quantify executive functioning are mostly summary statistics referring to deviations from mathematical randomness. In the current study, we explore the utility of recurrence quantification analysis (RQA, a nonlinear method that keeps the entire sequence intact, as a better way to describe executive functioning compared to traditional measures. To this aim, 242 first- and second-year students completed a non-paced RNG task. Principal component analysis of their data showed that traditional and RQA measures convey more or less the same information. However, RQA measures do so more parsimoniously and have a better interpretation.
International Nuclear Information System (INIS)
Olivari, D.
1984-01-01
An attempt is made at identifying the most important factors which introduce difficulties in the analysis of results from tests on pollutant dispersal: the unsteadiness of the phenomenon, the effect of external uncontrollable parameters, and the inherent complexity of the problem itself. The basic models for prediction of dispersion of passive contaminants are discussed, and in particular a Lagrangian approach which seems to provide accurate results. For the analysis of results many problems arise. First the need of computing for the results the statistical quantities which describe them: the mean, the variance and higher order moments are important. It is shown that there is no easy solution if the duration and/or the number of independent ''events'' to be analyzed are too limited. The probability density function provides the most useful information, but is not easy to measure. A family of functions is recalled which predict reasonably well the trend of the pdf. Then the role of intermittency is shown in some detail. Its importance cannot be underestimated and its relationship to pdf and the effects on measurements are shown to be rather complex. Finally, an example is made to show the effects of the variance of external factors
Pulse Compression Techniques for Laser Generated Ultrasound
Anastasi, R. F.; Madaras, E. I.
1999-01-01
Laser generated ultrasound for nondestructive evaluation has an optical power density limit due to rapid high heating that causes material damage. This damage threshold limits the generated ultrasound amplitude, which impacts nondestructive evaluation inspection capability. To increase ultrasound signal levels and improve the ultrasound signal-to-noise ratio without exceeding laser power limitations, it is possible to use pulse compression techniques. The approach illustrated here uses a 150mW laser-diode modulated with a pseudo-random sequence and signal correlation. Results demonstrate the successful generation of ultrasonic bulk waves in aluminum and graphite-epoxy composite materials using a modulated low-power laser diode and illustrate ultrasound bandwidth control.
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.
Booth, E., Jr.; Yu, J. C.
1986-01-01
An experimental investigation of two dimensional blade vortex interaction was held at NASA Langley Research Center. The first phase was a flow visualization study to document the approach process of a two dimensional vortex as it encountered a loaded blade model. To accomplish the flow visualization study, a method for generating two dimensional vortex filaments was required. The numerical study used to define a new vortex generation process and the use of this process in the flow visualization study were documented. Additionally, photographic techniques and data analysis methods used in the flow visualization study are examined.
Solution of Stochastic Nonlinear PDEs Using Automated Wiener-Hermite Expansion
Al-Juhani, Amnah; El-Beltagy, Mohamed
2014-01-01
directly involved in the computations. One does not have to rely on pseudo random number generators, and there is no need to solve the SDEs repeatedly for many realizations. Instead, the deterministic system is solved only once. For previous research
Hardware Realization of Chaos Based Symmetric Image Encryption
Barakat, Mohamed L.
2012-01-01
This thesis presents a novel work on hardware realization of symmetric image encryption utilizing chaos based continuous systems as pseudo random number generators. Digital implementation of chaotic systems results in serious degradations
Hardware Realization of Chaos-based Symmetric Video Encryption
Ibrahim, Mohamad A.
2013-01-01
This thesis reports original work on hardware realization of symmetric video encryption using chaos-based continuous systems as pseudo-random number generators. The thesis also presents some of the serious degradations caused by digitally
Next-Generation Sequencing-Based Detection of Germline Copy Number Variations in BRCA1/BRCA2
DEFF Research Database (Denmark)
Schmidt, Ane Y; Hansen, Thomas V O; Ahlborn, Lise B
2017-01-01
Genetic testing of BRCA1/2 includes screening for single nucleotide variants and small insertions/deletions and for larger copy number variations (CNVs), primarily by Sanger sequencing and multiplex ligation-dependent probe amplification (MLPA). With the advent of next-generation sequencing (NGS)...
Yi, Guoqiang; Qu, Lujiang; Liu, Jianfeng; Yan, Yiyuan; Xu, Guiyun; Yang, Ning
2014-11-07
Copy number variation (CNV) is important and widespread in the genome, and is a major cause of disease and phenotypic diversity. Herein, we performed a genome-wide CNV analysis in 12 diversified chicken genomes based on whole genome sequencing. A total of 8,840 CNV regions (CNVRs) covering 98.2 Mb and representing 9.4% of the chicken genome were identified, ranging in size from 1.1 to 268.8 kb with an average of 11.1 kb. Sequencing-based predictions were confirmed at a high validation rate by two independent approaches, including array comparative genomic hybridization (aCGH) and quantitative PCR (qPCR). The Pearson's correlation coefficients between sequencing and aCGH results ranged from 0.435 to 0.755, and qPCR experiments revealed a positive validation rate of 91.71% and a false negative rate of 22.43%. In total, 2,214 (25.0%) predicted CNVRs span 2,216 (36.4%) RefSeq genes associated with specific biological functions. Besides two previously reported copy number variable genes EDN3 and PRLR, we also found some promising genes with potential in phenotypic variation. Two genes, FZD6 and LIMS1, related to disease susceptibility/resistance are covered by CNVRs. The highly duplicated SOCS2 may lead to higher bone mineral density. Entire or partial duplication of some genes like POPDC3 may have great economic importance in poultry breeding. Our results based on extensive genetic diversity provide a more refined chicken CNV map and genome-wide gene copy number estimates, and warrant future CNV association studies for important traits in chickens.
Pederzani, Jean-Noel; Haj-Hariri, Hossein
2012-11-01
An embedded-boundary (or cut-cell) method for complex geometry with moving boundaries is used to solve the three dimensional Navier-Stokes equation around a self-propelling manta swimming at moderately high Reynolds numbers. The motion of the ray is prescribed using a kinematic model fitted to actual biological data. The dependence of thrust production mechanism on Strouhal and Reynolds numbers is investigated. The vortex core structures are accurately plotted and a correlation between wake structures and propulsive performance is established. This insight is critical in understanding the key flow features that a bio-inspired autonomous vehicle should reproduce in order to swim efficiently. The solution method is implemented, on a block-structured Cartesian grid using a cut-cell approach enabling the code to correctly evaluate the wall shear-stress, a key feature necessary at higher Reynolds. To enhance computational efficiency, a parallel adaptive mesh refinement technique is used. The present method is validated against published experimental results. Supported by ONR MURI.
Directory of Open Access Journals (Sweden)
Marie eKim
2014-11-01
Full Text Available The spleen is a highly compartmentalized lymphoid organ that allows for efficient antigen presentation and activation of immune responses. Additionally, the spleen itself functions to remove senescent red blood cells, filter bacteria, and sequester platelets. Splenectomy, commonly performed after blunt force trauma or splenomegaly, has been shown to increase risk of certain bacterial and parasitic infections years after removal of the spleen. Although previous studies report defects in memory B cells and IgM titers in splenectomized patients, the effect of splenectomy on CD8 T cell responses and memory CD8 T cell function remains ill defined. Using TCR-transgenic P14 cells, we demonstrate that homeostatic proliferation and representation of pathogen-specific memory CD8 T cells in the blood are enhanced in splenectomized compared to sham surgery mice. Surprisingly, despite the enhanced turnover, splenectomized mice displayed no changes in total memory CD8 T cell numbers nor impaired protection against lethal dose challenge with Listeria monocytogenes. Thus, our data suggest that memory CD8 T cell maintenance and function remain intact in the absence of the spleen.
Mohr, Christine; Koutrakis, Nikolaos; Kuhn, Gustav
2015-01-01
Magical ideation and belief in the paranormal is considered to represent a trait-like character; people either believe in it or not. Yet, anecdotes indicate that exposure to an anomalous event can turn skeptics into believers. This transformation is likely to be accompanied by altered cognitive functioning such as impaired judgments of event likelihood. Here, we investigated whether the exposure to an anomalous event changes individuals’ explicit traditional (religious) and non-traditional (e.g., paranormal) beliefs as well as cognitive biases that have previously been associated with non-traditional beliefs, e.g., repetition avoidance when producing random numbers in a mental dice task. In a classroom, 91 students saw a magic demonstration after their psychology lecture. Before the demonstration, half of the students were told that the performance was done respectively by a conjuror (magician group) or a psychic (psychic group). The instruction influenced participants’ explanations of the anomalous event. Participants in the magician, as compared to the psychic group, were more likely to explain the event through conjuring abilities while the reverse was true for psychic abilities. Moreover, these explanations correlated positively with their prior traditional and non-traditional beliefs. Finally, we observed that the psychic group showed more repetition avoidance than the magician group, and this effect remained the same regardless of whether assessed before or after the magic demonstration. We conclude that pre-existing beliefs and contextual suggestions both influence people’s interpretations of anomalous events and associated cognitive biases. Beliefs and associated cognitive biases are likely flexible well into adulthood and change with actual life events. PMID:25653626
Directory of Open Access Journals (Sweden)
Christine eMohr
2015-01-01
Full Text Available Magical ideation and belief in the paranormal is considered to represent a trait-like character; people either believe in it or not. Yet, anecdotes indicate that exposure to an anomalous event can turn sceptics into believers. This transformation is likely to be accompanied by altered cognitive functioning such as impaired judgements of event likelihood. Here, we investigated whether the exposure to an anomalous event changes individuals’ explicit traditional (religious and non-traditional (e.g. paranormal beliefs as well as cognitive biases that have previously been associated with non-traditional beliefs, e.g. repetition avoidance when producing random numbers in a mental dice task. In a classroom, 91 students saw a magic demonstration after their psychology lecture. Before the demonstration, half of the students were told that the performance was done respectively by a conjuror (magician group or a psychic (psychic group. The instruction influenced participants’ explanations of the anomalous event. Participants in the magician, as compared to the psychic group, were more likely to explain the event through conjuring abilities while the reverse was true for psychic abilities. Moreover, these explanations correlated positively with their prior traditional and non-traditional beliefs. Finally, we observed that the psychic group showed more repetition avoidance than the magician group, and this effect remained the same regardless of whether assessed before or after the magic demonstration. We conclude that pre-existing beliefs and contextual suggestions both influence people’s interpretations of anomalous events and associated cognitive biases. Beliefs and associated cognitive biases are likely flexible well into adulthood and change with actual life events.
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.
Araki, Ryoko; Mizutani, Eiji; Hoki, Yuko; Sunayama, Misato; Wakayama, Sayaka; Nagatomo, Hiroaki; Kasama, Yasuji; Nakamura, Miki; Wakayama, Teruhiko; Abe, Masumi
2017-05-01
Induced pluripotent stem cells hold great promise for regenerative medicine but point mutations have been identified in these cells and have raised serious concerns about their safe use. We generated nuclear transfer embryonic stem cells (ntESCs) from both mouse embryonic fibroblasts (MEFs) and tail-tip fibroblasts (TTFs) and by whole genome sequencing found fewer mutations compared with iPSCs generated by retroviral gene transduction. Furthermore, TTF-derived ntESCs showed only a very small number of point mutations, approximately 80% less than the number observed in iPSCs generated using retrovirus. Base substitution profile analysis confirmed this greatly reduced number of point mutations. The point mutations in iPSCs are therefore not a Yamanaka factor-specific phenomenon but are intrinsic to genome reprogramming. Moreover, the dramatic reduction in point mutations in ntESCs suggests that most are not essential for genome reprogramming. Our results suggest that it is feasible to reduce the point mutation frequency in iPSCs by optimizing various genome reprogramming conditions. We conducted whole genome sequencing of ntES cells derived from MEFs or TTFs. We thereby succeeded in establishing TTF-derived ntES cell lines with far fewer point mutations. Base substitution profile analysis of these clones also indicated a reduced point mutation frequency, moving from a transversion-predominance to a transition-predominance. Stem Cells 2017;35:1189-1196. © 2017 AlphaMed Press.
Directory of Open Access Journals (Sweden)
J. Qiang
2014-03-01
Full Text Available In this paper we report on start-to-end simulation of a next generation light source based on a high repetition rate free electron laser (FEL driven by a CW superconducting linac. The simulation integrated the entire system in a seamless start-to-end model, including birth of photoelectrons, transport of electron beam through 600 m of the accelerator beam delivery system, and generation of coherent x-ray radiation in a two-stage self-seeding undulator beam line. The entire simulation used the real number of electrons (∼2 billion electrons/bunch to capture the details of the physical shot noise without resorting to artificial filtering to suppress numerical noise. The simulation results shed light on several issues including the importance of space-charge effects near the laser heater and the reliability of x-ray radiation power predictions when using a smaller number of simulation particles. The results show that the microbunching instability in the linac can be controlled with 15 keV uncorrelated energy spread induced by a laser heater and demonstrate that high brightness and flux 1 nm x-ray radiation (∼10^{12} photons/pulse with fully spatial and temporal coherence is achievable.
Directory of Open Access Journals (Sweden)
Zita Garate
2015-12-01
Full Text Available Pyruvate kinase deficiency (PKD is a rare erythroid metabolic disease caused by mutations in the PKLR gene. Erythrocytes from PKD patients show an energetic imbalance causing chronic non-spherocytic hemolytic anemia, as pyruvate kinase defects impair ATP production in erythrocytes. We generated PKD induced pluripotent stem cells (PKDiPSCs from peripheral blood mononuclear cells (PB-MNCs of PKD patients by non-integrative Sendai viral vectors. PKDiPSCs were gene edited to integrate a partial codon-optimized R-type pyruvate kinase cDNA in the second intron of the PKLR gene by TALEN-mediated homologous recombination (HR. Notably, we found allele specificity of HR led by the presence of a single-nucleotide polymorphism. High numbers of erythroid cells derived from gene-edited PKDiPSCs showed correction of the energetic imbalance, providing an approach to correct metabolic erythroid diseases and demonstrating the practicality of this approach to generate the large cell numbers required for comprehensive biochemical and metabolic erythroid analyses.
AER synthetic generation in hardware for bio-inspired spiking systems
Linares-Barranco, Alejandro; Linares-Barranco, Bernabe; Jimenez-Moreno, Gabriel; Civit-Balcells, Anton
2005-06-01
Address Event Representation (AER) is an emergent neuromorphic interchip communication protocol that allows for real-time virtual massive connectivity between huge number neurons located on different chips. By exploiting high speed digital communication circuits (with nano-seconds timings), synaptic neural connections can be time multiplexed, while neural activity signals (with mili-seconds timings) are sampled at low frequencies. Also, neurons generate 'events' according to their activity levels. More active neurons generate more events per unit time, and access the interchip communication channel more frequently, while neurons with low activity consume less communication bandwidth. When building multi-chip muti-layered AER systems it is absolutely necessary to have a computer interface that allows (a) to read AER interchip traffic into the computer and visualize it on screen, and (b) convert conventional frame-based video stream in the computer into AER and inject it at some point of the AER structure. This is necessary for test and debugging of complex AER systems. This paper addresses the problem of converting, in a computer, a conventional frame-based video stream into the spike event based representation AER. There exist several proposed software methods for synthetic generation of AER for bio-inspired systems. This paper presents a hardware implementation for one method, which is based on Linear-Feedback-Shift-Register (LFSR) pseudo-random number generation. The sequence of events generated by this hardware, which follows a Poisson distribution like a biological neuron, has been reconstructed using two AER integrator cells. The error of reconstruction for a set of images that produces different traffic loads of event in the AER bus is used as evaluation criteria. A VHDL description of the method, that includes the Xilinx PCI Core, has been implemented and tested using a general purpose PCI-AER board. This PCI-AER board has been developed by authors, and uses
Energy Technology Data Exchange (ETDEWEB)
Gottsponer, O.; Mauchle, P.
2003-07-01
This is the tenth and last part of a final report for the Swiss Federal Office of Energy (SFOE) on a project that looked into potential problems relating to the Swiss electricity distribution grid with respect to the increasing number of distributed power generation facilities being put into service. The identification of special conditions for the grid's operation and future development that take increasing decentralised power production into account are discussed. The results of the project activities encompass the analysis and evaluation of various problem areas associated with planning and management of the grid during normal operation and periods of malfunction, as well as required modifications to safety systems and grid configurations. This ninth appendix to the main report presents an overview and details of the literature and internet sources used in the project. Also, similar projects that discuss the problem area dealt with are briefly described. These include the Dispower, EDIson, DEMS, AMOEVES and ELSAD projects.
Klambauer, Günter; Schwarzbauer, Karin; Mayr, Andreas; Clevert, Djork-Arné; Mitterecker, Andreas; Bodenhofer, Ulrich; Hochreiter, Sepp
2012-05-01
Quantitative analyses of next-generation sequencing (NGS) data, such as the detection of copy number variations (CNVs), remain challenging. Current methods detect CNVs as changes in the depth of coverage along chromosomes. Technological or genomic variations in the depth of coverage thus lead to a high false discovery rate (FDR), even upon correction for GC content. In the context of association studies between CNVs and disease, a high FDR means many false CNVs, thereby decreasing the discovery power of the study after correction for multiple testing. We propose 'Copy Number estimation by a Mixture Of PoissonS' (cn.MOPS), a data processing pipeline for CNV detection in NGS data. In contrast to previous approaches, cn.MOPS incorporates modeling of depths of coverage across samples at each genomic position. Therefore, cn.MOPS is not affected by read count variations along chromosomes. Using a Bayesian approach, cn.MOPS decomposes variations in the depth of coverage across samples into integer copy numbers and noise by means of its mixture components and Poisson distributions, respectively. The noise estimate allows for reducing the FDR by filtering out detections having high noise that are likely to be false detections. We compared cn.MOPS with the five most popular methods for CNV detection in NGS data using four benchmark datasets: (i) simulated data, (ii) NGS data from a male HapMap individual with implanted CNVs from the X chromosome, (iii) data from HapMap individuals with known CNVs, (iv) high coverage data from the 1000 Genomes Project. cn.MOPS outperformed its five competitors in terms of precision (1-FDR) and recall for both gains and losses in all benchmark data sets. The software cn.MOPS is publicly available as an R package at http://www.bioinf.jku.at/software/cnmops/ and at Bioconductor.
Energy Technology Data Exchange (ETDEWEB)
Luechinger, P.
2003-07-01
This is the fifth part of a ten-part final report for the Swiss Federal Office of Energy (SFOE) on a project that looked into potential problems relating to the Swiss electricity distribution grid with respect to the increasing number of distributed power generation facilities being put into service. The identification of special conditions for the grid's operation and future development that take increasing decentralised power production into account are discussed. The results of the project activities encompass the analysis and evaluation of various problem areas associated with planning and management of the grid during normal operation and periods of malfunction, as well as required modifications to safety systems and grid configurations. This fourth appendix to the main report describes six ways of storing electricity, including accumulators, super caps, super-conducting magnetic and flywheel energy storage units. The accumulator technologies discussed include lead-acid, nickel-cadmium and sodium-sulphur batteries. Each of these types of power storage technologies is briefly described. The characteristics of these various types of storage are compared.
Energy Technology Data Exchange (ETDEWEB)
Schnyder, G.; Mauchle, P.
2003-07-01
This is the third part of a ten-part final report for the Swiss Federal Office of Energy (SFOE) on a project that looked into potential problems relating to the Swiss electricity distribution grid with respect to the increasing number of distributed power generation facilities being put into service. The identification of special conditions for the grid's operation and future development that take increasing decentralised power production into account are discussed. The results of the project activities encompass the analysis and evaluation of various problem areas associated with planning and management of the grid during normal operation and periods of malfunction, as well as required modifications to safety systems and grid configurations. The first part of this second appendix to the main report examines the electrical conditions and requirements that have to be met by distributed production facilities. These include limits for voltage and frequency, synchronisation aspects, protection, reactive power questions and islanding. Also, recommendations are made on the assessment of grid reactions and on the avoidance of non-permissible effects on the grid's audio-frequency remote control apparatus. A second part examines the situation concerning the connection of distributed power units to the grid and grid topologies. The last chapter lists relevant standards and guidelines.
Kasoju, Vishwa Teja
The smallest flying insects with body lengths under 1 mm, such as thrips and fairyflies, typically show the presence of long bristles on their wings. Thrips have been observed to use wing-wing interaction via 'clap and fling' for flapping flight at low Reynolds number (Re) on the order of 10, where a wing pair comes into close contact at the end of upstroke and fling apart at the beginning of downstroke. We examined the effects of varying the following parameters on force generation and flow structures formed during clap and fling: (1) Re ranging from 5 to 15 for a bristled wing pair (G/D = 17) and a geometrically equivalent solid wing pair; and (2) ratio of spacing between bristles to bristle diameter (G/D) for Re = 10. The G/D ratio in 70 thrips species were quantified from published forewing images. Scaled-up physical models of three bristled wing pairs of varying G/D (5, 11, 17) and a solid wing pair (G/D = 0) were fabricated. A robotic model was used for this study, in which a wing pair was immersed in an aquarium tank filled with glycerin and driven by stepper motors to execute clap and fling kinematics. Dimensionless lift and drag coefficients were determined from strain gauge measurements. Phase-locked particle image velocimetry (PIV) measurements were used to examine flow through the bristles. Chordwise PIV was used to visualize the leading edge vortex (LEV) and trailing edge vortex (TEV) formed over the wings during clap and fling. With increasing G/D, larger reduction was observed in peak drag coefficients as compared to reduction in peak lift coefficients. Net circulation, defined as the difference in circulation (strength) of LEV and TEV, diminished with increasing G/D. Reduction in net circulation resulted in reducing lift generated by bristled wings as compared to solid wings. Leaky, recirculating flow through the bristles provided large drag reduction during fling of a bristled wing pair. If flight efficiency is defined as the ratio of lift to drag
Williams, Isobel Anne; Wilkinson, Leonora; Limousin, Patricia; Jahanshahi, Marjan
2015-01-01
Deep brain stimulation of the subthalamic nucleus (STN DBS) ameliorates the motor symptoms of Parkinson's disease (PD). However, some aspects of executive control are impaired with STN DBS. We tested the prediction that (i) STN DBS interferes with switching from automatic to controlled processing during fast-paced random number generation (RNG) (ii) STN DBS-induced cognitive control changes are load-dependent. Fifteen PD patients with bilateral STN DBS performed paced-RNG, under three levels of cognitive load synchronised with a pacing stimulus presented at 1, 0.5 and 0.33 Hz (faster rates require greater cognitive control), with DBS on or off. Measures of output randomness were calculated. Countscore 1 (CS1) indicates habitual counting in steps of one (CS1). Countscore 2 (CS2) indicates a more controlled strategy of counting in twos. The fastest rate was associated with an increased CS1 score with STN DBS on compared to off. At the slowest rate, patients had higher CS2 scores with DBS off than on, such that the differences between CS1 and CS2 scores disappeared. We provide evidence for a load-dependent effect of STN DBS on paced RNG in PD. Patients could switch to more controlled RNG strategies during conditions of low cognitive load at slower rates only when the STN stimulators were off, but when STN stimulation was on, they engaged in more automatic habitual counting under increased cognitive load. These findings are consistent with the proposal that the STN implements a switch signal from the medial frontal cortex which enables a shift from automatic to controlled processing.
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)
Bennett, Ruth, Ed.; And Others
An introduction to the Hupa number system is provided in this workbook, one in a series of numerous materials developed to promote the use of the Hupa language. The book is written in English with Hupa terms used only for the names of numbers. The opening pages present the numbers from 1-10, giving the numeral, the Hupa word, the English word, and…
Indian Academy of Sciences (India)
Admin
Triangular number, figurate num- ber, rangoli, Brahmagupta–Pell equation, Jacobi triple product identity. Figure 1. The first four triangular numbers. Left: Anuradha S Garge completed her PhD from. Pune University in 2008 under the supervision of Prof. S A Katre. Her research interests include K-theory and number theory.
Directory of Open Access Journals (Sweden)
Schwarzweller Christoph
2015-02-01
Full Text Available In this article we introduce Proth numbers and prove two theorems on such numbers being prime [3]. We also give revised versions of Pocklington’s theorem and of the Legendre symbol. Finally, we prove Pepin’s theorem and that the fifth Fermat number is not prime.
Mendonça, J. Ricardo G.
2012-01-01
We define a new class of numbers based on the first occurrence of certain patterns of zeros and ones in the expansion of irracional numbers in a given basis and call them Sagan numbers, since they were first mentioned, in a special case, by the North-american astronomer Carl E. Sagan in his science-fiction novel "Contact." Sagan numbers hold connections with a wealth of mathematical ideas. We describe some properties of the newly defined numbers and indicate directions for further amusement.
Zhang, Zhongyang; Hao, Ke
2015-11-01
Cancer genomes exhibit profound somatic copy number alterations (SCNAs). Studying tumor SCNAs using massively parallel sequencing provides unprecedented resolution and meanwhile gives rise to new challenges in data analysis, complicated by tumor aneuploidy and heterogeneity as well as normal cell contamination. While the majority of read depth based methods utilize total sequencing depth alone for SCNA inference, the allele specific signals are undervalued. We proposed a joint segmentation and inference approach using both signals to meet some of the challenges. Our method consists of four major steps: 1) extracting read depth supporting reference and alternative alleles at each SNP/Indel locus and comparing the total read depth and alternative allele proportion between tumor and matched normal sample; 2) performing joint segmentation on the two signal dimensions; 3) correcting the copy number baseline from which the SCNA state is determined; 4) calling SCNA state for each segment based on both signal dimensions. The method is applicable to whole exome/genome sequencing (WES/WGS) as well as SNP array data in a tumor-control study. We applied the method to a dataset containing no SCNAs to test the specificity, created by pairing sequencing replicates of a single HapMap sample as normal/tumor pairs, as well as a large-scale WGS dataset consisting of 88 liver tumors along with adjacent normal tissues. Compared with representative methods, our method demonstrated improved accuracy, scalability to large cancer studies, capability in handling both sequencing and SNP array data, and the potential to improve the estimation of tumor ploidy and purity.
Petersen, T Kyle
2015-01-01
This text presents the Eulerian numbers in the context of modern enumerative, algebraic, and geometric combinatorics. The book first studies Eulerian numbers from a purely combinatorial point of view, then embarks on a tour of how these numbers arise in the study of hyperplane arrangements, polytopes, and simplicial complexes. Some topics include a thorough discussion of gamma-nonnegativity and real-rootedness for Eulerian polynomials, as well as the weak order and the shard intersection order of the symmetric group. The book also includes a parallel story of Catalan combinatorics, wherein the Eulerian numbers are replaced with Narayana numbers. Again there is a progression from combinatorics to geometry, including discussion of the associahedron and the lattice of noncrossing partitions. The final chapters discuss how both the Eulerian and Narayana numbers have analogues in any finite Coxeter group, with many of the same enumerative and geometric properties. There are four supplemental chapters throughout, ...
Hentschel, Julia; Tatun, Dana; Parkhomchuk, Dmitri; Kurth, Ingo; Schimmel, Bettina; Heinrich-Weltzien, Roswitha; Bertzbach, Sabine; Peters, Hartmut; Beetz, Christian
2016-09-15
Amelogenesis imperfecta (AI) is a clinically and genetically heterogeneous disorder of tooth development which is due to aberrant deposition or composition of enamel. Both syndromic and isolated forms exist; they may be inherited in an X-linked, autosomal recessive, or autosomal dominant manner. WDR72 is one of ten currently known genes for recessive isolated AI; nine WDR72 mutations affecting single nucleotides have been described to date. Based on whole exome sequencing in a large consanguineous AI pedigree, we obtained evidence for presence of a multi-exonic WDR72 deletion. A home-made multiplex ligation-dependent probe amplification assay was used to confirm the aberration, to narrow its extent, and to identify heterozygous carriers. Our study extends the mutational spectrum for WDR72 to include large deletions, and supports a relevance of the previously proposed loss-of-function mechanism. It also introduces an easy-to-use and highly sensitive tool for detecting WDR72 copy number alterations. Copyright © 2016. Published by Elsevier B.V.
Neutrino number of the universe
International Nuclear Information System (INIS)
Kolb, E.W.
1981-01-01
The influence of grand unified theories on the lepton number of the universe is reviewed. A scenario is presented for the generation of a large (>> 1) lepton number and a small (<< 1) baryon number. 15 references
Digital chaotic sequence generator based on coupled chaotic systems
International Nuclear Information System (INIS)
Shu-Bo, Liu; Jing, Sun; Jin-Shuo, Liu; Zheng-Quan, Xu
2009-01-01
Chaotic systems perform well as a new rich source of cryptography and pseudo-random coding. Unfortunately their digital dynamical properties would degrade due to the finite computing precision. Proposed in this paper is a modified digital chaotic sequence generator based on chaotic logistic systems with a coupling structure where one chaotic subsystem generates perturbation signals to disturb the control parameter of the other one. The numerical simulations show that the length of chaotic orbits, the output distribution of chaotic system, and the security of chaotic sequences have been greatly improved. Moreover the chaotic sequence period can be extended at least by one order of magnitude longer than that of the uncoupled logistic system and the difficulty in decrypting increases 2 128 *2 128 times indicating that the dynamical degradation of digital chaos is effectively improved. A field programmable gate array (FPGA) implementation of an algorithm is given and the corresponding experiment shows that the output speed of the generated chaotic sequences can reach 571.4 Mbps indicating that the designed generator can be applied to the real-time video image encryption. (general)
Indian Academy of Sciences (India)
Transfinite Numbers. What is Infinity? S M Srivastava. In a series of revolutionary articles written during the last quarter of the nineteenth century, the great Ger- man mathematician Georg Cantor removed the age-old mistrust of infinity and created an exceptionally beau- tiful and useful theory of transfinite numbers. This is.
Ji, Caleb; Khovanova, Tanya; Park, Robin; Song, Angela
2015-01-01
In this paper, we consider a game played on a rectangular $m \\times n$ gridded chocolate bar. Each move, a player breaks the bar along a grid line. Each move after that consists of taking any piece of chocolate and breaking it again along existing grid lines, until just $mn$ individual squares remain. This paper enumerates the number of ways to break an $m \\times n$ bar, which we call chocolate numbers, and introduces four new sequences related to these numbers. Using various techniques, we p...
Andrews, George E
1994-01-01
Although mathematics majors are usually conversant with number theory by the time they have completed a course in abstract algebra, other undergraduates, especially those in education and the liberal arts, often need a more basic introduction to the topic.In this book the author solves the problem of maintaining the interest of students at both levels by offering a combinatorial approach to elementary number theory. In studying number theory from such a perspective, mathematics majors are spared repetition and provided with new insights, while other students benefit from the consequent simpl
Rational Approximations of the Inverse Gaussian Function.
Byars, Jackson A.; Roscoe, John T.
There are at least two situations in which the behavioral scientist wishes to transform uniformly distributed data into normally distributed data: (1) In studies of sampling distributions where uniformly distributed pseudo-random numbers are generated by a computer but normally distributed numbers are desired; and (2) In measurement applications…
Barnes, John
2016-01-01
In this intriguing book, John Barnes takes us on a journey through aspects of numbers much as he took us on a geometrical journey in Gems of Geometry. Similarly originating from a series of lectures for adult students at Reading and Oxford University, this book touches a variety of amusing and fascinating topics regarding numbers and their uses both ancient and modern. The author intrigues and challenges his audience with both fundamental number topics such as prime numbers and cryptography, and themes of daily needs and pleasures such as counting one's assets, keeping track of time, and enjoying music. Puzzles and exercises at the end of each lecture offer additional inspiration, and numerous illustrations accompany the reader. Furthermore, a number of appendices provides in-depth insights into diverse topics such as Pascal’s triangle, the Rubik cube, Mersenne’s curious keyboards, and many others. A theme running through is the thought of what is our favourite number. Written in an engaging and witty sty...
Number names and number understanding
DEFF Research Database (Denmark)
Ejersbo, Lisser Rye; Misfeldt, Morten
2014-01-01
This paper concerns the results from the first year of a three-year research project involving the relationship between Danish number names and their corresponding digits in the canonical base 10 system. The project aims to develop a system to help the students’ understanding of the base 10 syste...... the Danish number names are more complicated than in other languages. Keywords: A research project in grade 0 and 1th in a Danish school, Base-10 system, two-digit number names, semiotic, cognitive perspectives....
Directory of Open Access Journals (Sweden)
Theodore M. Porter
2012-12-01
Full Text Available The struggle over cure rate measures in nineteenth-century asylums provides an exemplary instance of how, when used for official assessments of institutions, these numbers become sites of contestation. The evasion of goals and corruption of measures tends to make these numbers “funny” in the sense of becoming dis-honest, while the mismatch between boring, technical appearances and cunning backstage manipulations supplies dark humor. The dangers are evident in recent efforts to decentralize the functions of governments and corporations using incen-tives based on quantified targets.
Murty, M Ram
2014-01-01
This book provides an introduction to the topic of transcendental numbers for upper-level undergraduate and graduate students. The text is constructed to support a full course on the subject, including descriptions of both relevant theorems and their applications. While the first part of the book focuses on introducing key concepts, the second part presents more complex material, including applications of Baker’s theorem, Schanuel’s conjecture, and Schneider’s theorem. These later chapters may be of interest to researchers interested in examining the relationship between transcendence and L-functions. Readers of this text should possess basic knowledge of complex analysis and elementary algebraic number theory.
Random Number Generation: A Practitioner's Overview
CERN. Geneva
2012-01-01
About the speaker Dr. Mascagni is full professor at Florida State University, where he runs a research group consisting of post-doctoral associates, graduate students, and undergraduate workers. The areas they work on are p...
DEFF Research Database (Denmark)
Seabrooke, Leonard
2012-01-01
Sector Assessment Programme (FSAP). While the IMF is typically viewed as an institution that enforces global standards for economic governance through the imposition of quantitative targets (‘numbers’ for this special issue), I suggest that its use of benchmarking in the generation of financial data can...... market actors. This article suggests that we cannot simply view the IMF staff as hostage to their commanders. Rather, the IMF's use of ‘pragmatic numbers’ within FSAPs demonstrates one method by which an institution seeks to foster learning under constraint.......Do international organisations generate benchmarks as tools for policy enforcement or policy learning? This article suggests that the latter is possible even in unlikely scenarios. It does this through a case study on the ‘power of numbers’ in the International Monetary Fund's (IMF) Financial...
Indian Academy of Sciences (India)
this is a characteristic difference between finite and infinite sets and created an immensely useful branch of mathematics based on this idea which had a great impact on the whole of mathe- matics. For example, the question of what is a number (finite or infinite) is almost a philosophical one. However Cantor's work turned it ...
Niederreiter, Harald
2015-01-01
This textbook effectively builds a bridge from basic number theory to recent advances in applied number theory. It presents the first unified account of the four major areas of application where number theory plays a fundamental role, namely cryptography, coding theory, quasi-Monte Carlo methods, and pseudorandom number generation, allowing the authors to delineate the manifold links and interrelations between these areas. Number theory, which Carl-Friedrich Gauss famously dubbed the queen of mathematics, has always been considered a very beautiful field of mathematics, producing lovely results and elegant proofs. While only very few real-life applications were known in the past, today number theory can be found in everyday life: in supermarket bar code scanners, in our cars’ GPS systems, in online banking, etc. Starting with a brief introductory course on number theory in Chapter 1, which makes the book more accessible for undergraduates, the authors describe the four main application areas in Chapters...
Energy Technology Data Exchange (ETDEWEB)
Hoeckel, M.; Luechinger, P.
2003-07-01
This is the seventh part of a ten-part final report for the Swiss Federal Office of Energy (SFOE) on a project that looked into potential problems relating to the Swiss electricity distribution grid with respect to the increasing number of distributed power generation facilities being put into service. The identification of special conditions for the grid's operation and future development that take increasing decentralised power production into account are discussed. The results of the project activities encompass the analysis and evaluation of various problem areas associated with planning and management of the grid during normal operation and periods of malfunction, as well as required modifications to safety systems and grid configurations. This sixth appendix to the main report presents and discusses the results of simulations made on the basis of the real-life 16 kV medium-voltage distribution network operated by the Aargovian electricity utility AEW. This appendix describes the simulation methods used and the basic characteristics of medium-voltage networks and distributed generation facilities. Different types of load profiles, including domestic and industrial loads, are discussed. The results of the simulations are presented in graphical form and provide profiles of voltage and current, active and reactive power and further mains characteristics for varying load conditions. Also, daily profiles for situations with and without distributed generation are presented and short-circuit simulations and grid dynamics are discussed.
Generació de nombres aleatóris mitjançant les fluctuacions del buit quàntic
Abellan Sanchez, Carlos
2013-01-01
[ANGLÈS] Random numbers are extensively used in a broad range of applications. Nevertheless, there are two main markets from a commercial point of view: (i) secure communications and (ii) stochastic simulation. According to the generation rate and quality of the random numbers required, different approaches have been used so far, most of them based on pseudo-random number generation. However, these type of generators have already started showing weakness both in the quality and the generation...
FPGA based fast synchronous serial multi-wire links synchronization
Pozniak, Krzysztof T.
2013-10-01
The paper debates synchronization method of multi-wire, serial link of constant latency, by means of pseudo-random numbers generators. The solution was designed for various families of FPGA circuits. There were debated synchronization algorithm and functional structure of parameterized transmitter and receiver modules. The modules were realized in VHDL language in a behavioral form.
PSO algorithm enhanced with Lozi Chaotic Map - Tuning experiment
Energy Technology Data Exchange (ETDEWEB)
Pluhacek, Michal; Senkerik, Roman; Zelinka, Ivan [Tomas Bata University in Zlín, Faculty of Applied Informatics Department of Informatics and Artificial Intelligence nám. T.G. Masaryka 5555, 760 01 Zlín (Czech Republic)
2015-03-10
In this paper it is investigated the effect of tuning of control parameters of the Lozi Chaotic Map employed as a chaotic pseudo-random number generator for the particle swarm optimization algorithm. Three different benchmark functions are selected from the IEEE CEC 2013 competition benchmark set. The Lozi map is extensively tuned and the performance of PSO is evaluated.
Sharp lower bounds on the extractable randomness from non-uniform sources
Skoric, B.; Obi, C.; Verbitskiy, E.A.; Schoenmakers, B.
2011-01-01
Extraction of uniform randomness from (noisy) non-uniform sources is an important primitive in many security applications, e.g. (pseudo-)random number generators, privacy-preserving biometrics, and key storage based on Physical Unclonable Functions. Generic extraction methods exist, using universal
Locating multiple optima using particle swarm optimization
CSIR Research Space (South Africa)
Brits, R
2007-01-01
Full Text Available in [37]). Faure-sequences are distributed with high uniformity within a n-dimensional unit cube. Other pseudo-random uniform number generators, such as Sobol-sequences [33], may also be used. Main swarm training: In the nbest algorithm, overlapping...
PSO algorithm enhanced with Lozi Chaotic Map - Tuning experiment
International Nuclear Information System (INIS)
Pluhacek, Michal; Senkerik, Roman; Zelinka, Ivan
2015-01-01
In this paper it is investigated the effect of tuning of control parameters of the Lozi Chaotic Map employed as a chaotic pseudo-random number generator for the particle swarm optimization algorithm. Three different benchmark functions are selected from the IEEE CEC 2013 competition benchmark set. The Lozi map is extensively tuned and the performance of PSO is evaluated
Cryptographic pseudo-random sequences from the chaotic Hénon ...
Indian Academy of Sciences (India)
dimensional discrete-time Hénon map is proposed. Properties of the proposed sequences pertaining to linear complexity, linear complexity proﬁle, correlation and auto-correlation are investigated. All these properties of the sequences suggest a ...
Energy Technology Data Exchange (ETDEWEB)
Nondillo, Aline; Redaelli, Luiza R.; Pinent, Silvia M.J.; Gitz, Rogerio [Universidade Federal do Rio Grande do Sul (UFRGS), Porto Alegre, RS (Brazil). Programa de Pos-Graduacao em Fitotecnica. Dept. de Fitossanidade]. E-mails: RS; alinondillo@yahoo.com.br, luredael@ufrgs.br; silviapi@portoweb.com.br; rogitz29@yahoo.com.br; Botton, Marcos [Embrapa Uva e Vinho, Bento Goncalves, RS (Brazil)]. E-mail: marcos@cnpuv.embrapa.br
2008-11-15
Frankliniella occidentalis (Pergande) is one of the major strawberry pests in southern Brazil. The insect causes russeting and wither in flowers and fruits reducing commercial value. In this work, the thermal requirements of the eggs, larvae and pupae of F. occidentalis were estimated. Thrips development was studied in folioles of strawberry plants at six constant temperatures (16, 19, 22, 25, 28 and 31 deg C) in controlled conditions (70 +- 10% R.H. and 12:12 L:D). The number of annual generations of F. occidentalis was estimated for six strawberry production regions of Rio Grande do Sul State based on its thermal requirements. Developmental time of each F. occidentalis stages was proportional to the temperature increase. The best development rate was obtained when insects were reared at 25 deg C and 28 deg C. The lower threshold and the thermal requirements for the egg to adult stage were 9.9 deg C and 211.9 degree-days, respectively. Considering the thermal requirements of F. occidentalis, 10.7, 12.6, 13.1, 13.6, 16.5 and 17.9 generations/year were estimated, respectively, for Vacaria, Caxias do Sul, Farroupilha, Pelotas, Porto Alegre and Taquari producing regions located in Rio Grande do Sul State, Brazil. (author)
Energy Technology Data Exchange (ETDEWEB)
Hoeckel, M.; Luechinger, P.
2003-07-01
This is the sixth part of a ten-part final report for the Swiss Federal Office of Energy (SFOE) on a project that looked into potential problems relating to the Swiss electricity distribution grid with respect to the increasing number of distributed power generation facilities being put into service. The identification of special conditions for the grid's operation and future development that take increasing decentralised power production into account are discussed. The results of the project activities encompass the analysis and evaluation of various problem areas associated with planning and management of the grid during normal operation and periods of malfunction, as well as required modifications to safety systems and grid configurations. This fifth appendix to the main report presents and discusses the results of simulations made on the basis of the real-life 400 V low-voltage distribution network operated by the public utilities of the City of Zurich, Switzerland. This comprehensive appendix describes the simulation methods used and the basic characteristics of low-voltage networks and distributed generation facilities. The 6 simulation variants used are also described. The results of the simulations are presented in graphical form and provide profiles of voltage and current, active and reactive power and further mains characteristics for varying load conditions. Also, short-circuit simulations and harmonics analysis are discussed.
BKP and projective Hurwitz numbers
Natanzon, Sergey M.; Orlov, Aleksandr Yu.
2017-06-01
We consider d-fold branched coverings of the projective plane RP^2 and show that the hypergeometric tau function of the BKP hierarchy of Kac and van de Leur is the generating function for weighted sums of the related Hurwitz numbers. In particular, we get the RP^2 analogues of the CP^1 generating functions proposed by Okounkov and by Goulden and Jackson. Other examples are Hurwitz numbers weighted by the Hall-Littlewood and by the Macdonald polynomials. We also consider integrals of tau functions which generate Hurwitz numbers related to base surfaces with arbitrary Euler characteristics sc {e}, in particular projective Hurwitz numbers sc {e}=1.
DEFF Research Database (Denmark)
Korsby, Trine Mygind
2017-01-01
Taking a point of departure in negotiations for access to a phone number for a brothel abroad, the article demonstrates how a group of pimps in Eastern Romania attempt to extend their local business into the rest of the EU. The article shows how the phone number works as a micro-infrastructure in......Taking a point of departure in negotiations for access to a phone number for a brothel abroad, the article demonstrates how a group of pimps in Eastern Romania attempt to extend their local business into the rest of the EU. The article shows how the phone number works as a micro...... in turn cultivate and maximize uncertainty about themselves in others. When making the move to go abroad into unknown terrains, accessing the infrastructure generated by the phone number can provide certainty and consolidate one’s position within criminal networks abroad. However, at the same time......, mishandling the phone number can be dangerous and in that sense produce new doubts and uncertainties....
DEFF Research Database (Denmark)
Wanscher, Jørgen Bundgaard; Sørensen, Majken Vildrik
2006-01-01
Random numbers are used for a great variety of applications in almost any field of computer and economic sciences today. Examples ranges from stock market forecasting in economics, through stochastic traffic modelling in operations research to photon and ray tracing in graphics. The construction...... distributions into others with most of the required characteristics. In essence, a uniform sequence which is transformed into a new sequence with the required distribution. The subject of this article is to consider the well known highly uniform Halton sequence and modifications to it. The intent is to generate...
Dynamic Virtual Credit Card Numbers
Molloy, Ian; Li, Jiangtao; Li, Ninghui
Theft of stored credit card information is an increasing threat to e-commerce. We propose a dynamic virtual credit card number scheme that reduces the damage caused by stolen credit card numbers. A user can use an existing credit card account to generate multiple virtual credit card numbers that are either usable for a single transaction or are tied with a particular merchant. We call the scheme dynamic because the virtual credit card numbers can be generated without online contact with the credit card issuers. These numbers can be processed without changing any of the infrastructure currently in place; the only changes will be at the end points, namely, the card users and the card issuers. We analyze the security requirements for dynamic virtual credit card numbers, discuss the design space, propose a scheme using HMAC, and prove its security under the assumption the underlying function is a PRF.
A quick and easy improvement of Monte Carlo codes for simulation
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.
Number Sense on the Number Line
Woods, Dawn Marie; Ketterlin Geller, Leanne; Basaraba, Deni
2018-01-01
A strong foundation in early number concepts is critical for students' future success in mathematics. Research suggests that visual representations, like a number line, support students' development of number sense by helping them create a mental representation of the order and magnitude of numbers. In addition, explicitly sequencing instruction…
Richardson, Thomas M.
2014-01-01
We introduce the super Patalan numbers, a generalization of the super Catalan numbers in the sense of Gessel, and prove a number of properties analagous to those of the super Catalan numbers. The super Patalan numbers generalize the super Catalan numbers similarly to how the Patalan numbers generalize the Catalan numbers.
An Ultra-light PRNG Passing Strict Randomness Tests and Suitable for Low Cost Tags
Directory of Open Access Journals (Sweden)
OZCANHAN, M. H.
2016-08-01
Full Text Available A pseudo-random number generator for low-cost RFID tags is presented. The scheme is simple, sequential and secure, yet has a high performance. Despite its lowest hardware complexity, our proposal represents a better alternative than previous proposals for low-cost tags. The scheme is based on the well-founded pseudo random number generator, Mersenne Twister. The proposed generator takes low-entropy seeds extracted from a physical characteristic of the tag and produces outputs that pass popular randomness tests. Contrarily, previous proposal tests are based on random number inputs from a popular online source, which are simply unavailable to tags. The high performance and satisfactory randomness of present work are supported by extensive test results and compared with similar previous works. Comparison using proven estimation formulae indicates that our proposal has the best hardware complexity, power consumption, and the least cost.
A light weight secure image encryption scheme based on chaos & DNA computing
Directory of Open Access Journals (Sweden)
Bhaskar Mondal
2017-10-01
Full Text Available This paper proposed a new light weight secure cryptographic scheme for secure image communication. In this scheme the plain image is permuted first using a sequence of pseudo random number (PRN and encrypted by DeoxyriboNucleic Acid (DNA computation. Two PRN sequences are generated by a Pseudo Random Number Generator (PRNG based on cross coupled chaotic logistic map using two sets of keys. The first PRN sequence is used for permuting the plain image whereas the second PRN sequence is used for generating random DNA sequence. The number of rounds of permutation and encryption may be variable to increase security. The scheme is proposed for gray label images but the scheme may be extended for color images and text data. Simulation results exhibit that the proposed scheme can defy any kind of attack.
Digital circuit for the introduction and later removal of dither from an analog signal
Borgen, Gary S.
1994-05-01
An electronics circuit is presented for accurately digitizing an analog audio or like data signal into a digital equivalent signal by introducing dither into the analog signal and then subsequently removing the dither from the digitized signal prior to its conversion to an analog signal which is a substantial replica of the incoming analog audio or like data signal. The electronics circuit of the present invention is characterized by a first pseudo-random number generator which generates digital random noise signals or dither for addition to the digital equivalent signal and a second pseudo-random number generator which generates subtractive digital random noise signals for the subsequent removal of dither from the digital equivalent signal prior its conversion to the analog replica signal.
Some inequalities for the Bell numbers
Indian Academy of Sciences (India)
Feng Qi
2017-08-19
Aug 19, 2017 ... Bell number determinant; product; inequality; generating function; derivative; absolutely monotonic function; completely monotonic func- tion; logarithmically absolutely monotonic function; logarithmically completely monotonic function; Stirling number of the second kind; induction; Faà di Bruno formula;.
Random numbers from vacuum fluctuations
International Nuclear Information System (INIS)
Shi, Yicheng; Kurtsiefer, Christian; Chng, Brenda
2016-01-01
We implement a quantum random number generator based on a balanced homodyne measurement of vacuum fluctuations of the electromagnetic field. The digitized signal is directly processed with a fast randomness extraction scheme based on a linear feedback shift register. The random bit stream is continuously read in a computer at a rate of about 480 Mbit/s and passes an extended test suite for random numbers.
Random numbers from vacuum fluctuations
Energy Technology Data Exchange (ETDEWEB)
Shi, Yicheng; Kurtsiefer, Christian, E-mail: christian.kurtsiefer@gmail.com [Department of Physics, National University of Singapore, 2 Science Drive 3, Singapore 117542 (Singapore); Center for Quantum Technologies, National University of Singapore, 3 Science Drive 2, Singapore 117543 (Singapore); Chng, Brenda [Center for Quantum Technologies, National University of Singapore, 3 Science Drive 2, Singapore 117543 (Singapore)
2016-07-25
We implement a quantum random number generator based on a balanced homodyne measurement of vacuum fluctuations of the electromagnetic field. The digitized signal is directly processed with a fast randomness extraction scheme based on a linear feedback shift register. The random bit stream is continuously read in a computer at a rate of about 480 Mbit/s and passes an extended test suite for random numbers.
MCMCpack: Markov Chain Monte Carlo in R
Directory of Open Access Journals (Sweden)
Andrew D. Martin
2011-08-01
Full Text Available We introduce MCMCpack, an R package that contains functions to perform Bayesian inference using posterior simulation for a number of statistical models. In addition to code that can be used to fit commonly used models, MCMCpack also contains some useful utility functions, including some additional density functions and pseudo-random number generators for statistical distributions, a general purpose Metropolis sampling algorithm, and tools for visualization.
Fundamental number theory with applications
Mollin, Richard A
2008-01-01
An update of the most accessible introductory number theory text available, Fundamental Number Theory with Applications, Second Edition presents a mathematically rigorous yet easy-to-follow treatment of the fundamentals and applications of the subject. The substantial amount of reorganizing makes this edition clearer and more elementary in its coverage. New to the Second Edition Removal of all advanced material to be even more accessible in scope New fundamental material, including partition theory, generating functions, and combinatorial number theory Expa
A fast image encryption system based on chaotic maps with finite precision representation
International Nuclear Information System (INIS)
Kwok, H.S.; Tang, Wallace K.S.
2007-01-01
In this paper, a fast chaos-based image encryption system with stream cipher structure is proposed. In order to achieve a fast throughput and facilitate hardware realization, 32-bit precision representation with fixed point arithmetic is assumed. The major core of the encryption system is a pseudo-random keystream generator based on a cascade of chaotic maps, serving the purpose of sequence generation and random mixing. Unlike the other existing chaos-based pseudo-random number generators, the proposed keystream generator not only achieves a very fast throughput, but also passes the statistical tests of up-to-date test suite even under quantization. The overall design of the image encryption system is to be explained while detail cryptanalysis is given and compared with some existing schemes
International Nuclear Information System (INIS)
Fred R. Mynatt; Andy Kadak; Marc Berte; Larry Miller; Lawrence Townsend; Martin Williamson; Rupy Sawhney; Jacob Fife
2002-01-01
The objectives of this project are to develop and evaluate nuclear power plant designs and layout concepts to maximize the benefits of compact modular Generation IV reactor concepts including factory fabrication and packaging for optimal transportation and siting. This report covers the ninth quarter of the project. The three reactor concept teams have completed initial plant concept development, evaluation and layout. A significant design effort has proceeded with substantial change and evolution from original ideas. The concepts have been reviewed by the industry participants and improvements have been implemented. The third phase, industrial engineering simulation of reactor fabrication has begun
Consolidated nuclear steam generator
International Nuclear Information System (INIS)
Jabsen, F.S.; Schluderberg, D.C.; Paulson, A.E.
1978-01-01
An improved system of providing power has a unique generating means for nuclear reactors with a number of steam generators in the form of replaceable modular units of the expendable type to attain the optimum in effective and efficient vaporization of fluid during the generating power. The system is most adaptable to undrground power plants and marine usage
Number words and number symbols a cultural history of numbers
Menninger, Karl
1992-01-01
Classic study discusses number sequence and language and explores written numerals and computations in many cultures. "The historian of mathematics will find much to interest him here both in the contents and viewpoint, while the casual reader is likely to be intrigued by the author's superior narrative ability.
Vowel Generation for Children with Cerebral Palsy using Myocontrol of a Speech Synthesizer
Directory of Open Access Journals (Sweden)
Chuanxin M Niu
2015-01-01
Full Text Available For children with severe cerebral palsy (CP, social and emotional interactions can be significantly limited due to impaired speech motor function. However, if it is possible to extract continuous voluntary control signals from the electromyograph (EMG of limb muscles, then EMG may be used to drive the synthesis of intelligible speech with controllable speed, intonation and articulation. We report an important first step: the feasibility of controlling a vowel synthesizer using non-speech muscles. A classic formant-based speech synthesizer is adapted to allow the lowest two formants to be controlled by surface EMG from skeletal muscles. EMG signals are filtered using a non-linear Bayesian filtering algorithm that provides the high bandwidth and accuracy required for speech tasks. The frequencies of the first two formants determine points in a 2D plane, and vowels are targets on this plane. We focus on testing the overall feasibility of producing intelligible English vowels with myocontrol using two straightforward EMG-formant mappings. More mappings can be tested in the future to optimize the intelligibility. Vowel generation was tested on 10 healthy adults and 4 patients with dyskinetic CP. Five English vowels were generated by subjects in pseudo-random order, after only 10 minutes of device familiarization. The fraction of vowels correctly identified by 4 naive listeners exceeded 80% for the vowels generated by healthy adults and 57% for vowels generated by patients with CP. Our goal is a continuous virtual voice with personalized intonation and articulation that will restore not only the intellectual content but also the social and emotional content of speech for children and adults with severe movement disorders.
Directory of Open Access Journals (Sweden)
T. Pathinathan
2015-01-01
Full Text Available In this paper we define diamond fuzzy number with the help of triangular fuzzy number. We include basic arithmetic operations like addition, subtraction of diamond fuzzy numbers with examples. We define diamond fuzzy matrix with some matrix properties. We have defined Nested diamond fuzzy number and Linked diamond fuzzy number. We have further classified Right Linked Diamond Fuzzy number and Left Linked Diamond Fuzzy number. Finally we have verified the arithmetic operations for the above mentioned types of Diamond Fuzzy Numbers.
Koninck, Jean-Marie De
2009-01-01
Who would have thought that listing the positive integers along with their most remarkable properties could end up being such an engaging and stimulating adventure? The author uses this approach to explore elementary and advanced topics in classical number theory. A large variety of numbers are contemplated: Fermat numbers, Mersenne primes, powerful numbers, sublime numbers, Wieferich primes, insolite numbers, Sastry numbers, voracious numbers, to name only a few. The author also presents short proofs of miscellaneous results and constantly challenges the reader with a variety of old and new n
Analysis of a Scenario for Chaotic Quantal Slowing Down of Inspiration
2013-01-01
On exposure to opiates, preparations from rat brain stems have been observed to continue to produce regular expiratory signals, but to fail to produce some inspiratory signals. The numbers of expirations between two successive inspirations form an apparently random sequence. Here, we propose an explanation based on the qualitative theory of dynamical systems. A relatively simple scenario for the dynamics of interaction between the generators of expiratory and inspiratory signals produces pseudo-random behaviour of the type observed. PMID:24040967
Burkhart, Jerry
2009-01-01
Prime numbers are often described as the "building blocks" of natural numbers. This article shows how the author and his students took this idea literally by using prime factorizations to build numbers with blocks. In this activity, students explore many concepts of number theory, including the relationship between greatest common factors and…
Vazzana, Anthony; Garth, David
2007-01-01
One of the oldest branches of mathematics, number theory is a vast field devoted to studying the properties of whole numbers. Offering a flexible format for a one- or two-semester course, Introduction to Number Theory uses worked examples, numerous exercises, and two popular software packages to describe a diverse array of number theory topics.
On the number of special numbers
Indian Academy of Sciences (India)
without loss of any generality to be the first k primes), then the equation a + b = c has .... This is an elementary exercise in partial summation (see [12]). Thus ... This is easily done by inserting a stronger form of the prime number theorem into the.
Directory of Open Access Journals (Sweden)
Amer C. Hamdan
2004-03-01
Full Text Available OBJECTIVE: To evaluate the performance of adult young subjects in a Random Number Generation (RNG task by controlling the response speed (RS. METHOD: Sixty-nine university students of both sexes took part in the experiment (25.05 ± 6.71 year-old. Participants were alloted into 3 groups which differed in RS rates to generate numbers: 1, 2 and 4 seconds to generate each number. A digital metronomer was used to control RS. Participants were asked to generate 100 numbers. The responses were mensured through Evans's RNG Index. RESULTS: There were statistically significant differences among the groups [F (3, 68 = 7.120; p OBJETIVO: Avaliar o desempenho de sujeitos adultos na Geração Aleatória de Números (RNG, em função da velocidade da resposta (VR. MÉTODO: Participaram do experimento 69 universitários, de ambos os sexos. A média de idade dos participantes foi 25,05±6,71 anos. Os participantes foram divididos aleatoriamente em 3 grupos que diferiram quanto à VR para gerar cada número; 1, 2 e 4 segundos. As respostas foram avaliadas através do índice RNG de Evans. RESULTADOS: A análise dos resultados evidenciou diferença estatisticamente significante entre os 3 grupos [F (3, 68 = 7,120; p < 0,05], com diferenças entre as VR de 1 e 2 segundos (p = 0,004 e de 1 e 4 segundos (p = 0,006. Não foram observadas diferenças entre as VR de 2 e 4 segundos (p = 0,985. CONCLUSÃO: Os resultados mostraram que a velocidade da resposta na produção dos números aleatórios influencia o desempenho da tarefa de Geração Aleatória de Números.
Siegel, Z.; Siegel, Edward Carl-Ludwig
2011-03-01
RANDOMNESS of Numbers cognitive-semantics DEFINITION VIA Cognition QUERY: WHAT???, NOT HOW?) VS. computer-``science" mindLESS number-crunching (Harrel-Sipser-...) algorithmics Goldreich "PSEUDO-randomness"[Not.AMS(02)] mea-culpa is ONLY via MAXWELL-BOLTZMANN CLASSICAL-STATISTICS(NOT FDQS!!!) "hot-plasma" REPULSION VERSUS Newcomb(1881)-Weyl(1914;1916)-Benford(1938) "NeWBe" logarithmic-law digit-CLUMPING/ CLUSTERING NON-Randomness simple Siegel[AMS Joint.Mtg.(02)-Abs. # 973-60-124] algebraic-inversion to THE QUANTUM and ONLY BEQS preferentially SEQUENTIALLY lower-DIGITS CLUMPING/CLUSTERING with d = 0 BEC, is ONLY VIA Siegel-Baez FUZZYICS=CATEGORYICS (SON OF TRIZ)/"Category-Semantics"(C-S), latter intersection/union of Lawvere(1964)-Siegel(1964)] category-theory (matrix: MORPHISMS V FUNCTORS) "+" cognitive-semantics'' (matrix: ANTONYMS V SYNONYMS) yields Siegel-Baez FUZZYICS=CATEGORYICS/C-S tabular list-format matrix truth-table analytics: MBCS RANDOMNESS TRUTH/EMET!!!
International Nuclear Information System (INIS)
Duquesne, Henry; Schmitt, Andre; Poussot, Rene; Pelicier, Henri.
1976-05-01
The classical experiments of neutron time-of-flight spectrometry on bulk multiplying media are using recurrent neutron bursts from a linear accelerator. The adaptation of the ion beam issued from the Cadarache Van de Graaff accelerator is described with the test experiments which were effected. Both methods are compared with respect to the accuracy obtained, the energy resolution and the time consumed [fr
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)
Grešak, Rozalija
2015-01-01
The field of real numbers is usually constructed using Dedekind cuts. In these thesis we focus on the construction of the field of real numbers using metric completion of rational numbers using Cauchy sequences. In a similar manner we construct the field of p-adic numbers, describe some of their basic and topological properties. We follow by a construction of complex p-adic numbers and we compare them with the ordinary complex numbers. We conclude the thesis by giving a motivation for the int...
IMPLEMENTATION OF NEURAL - CRYPTOGRAPHIC SYSTEM USING FPGA
Directory of Open Access Journals (Sweden)
KARAM M. Z. OTHMAN
2011-08-01
Full Text Available Modern cryptography techniques are virtually unbreakable. As the Internet and other forms of electronic communication become more prevalent, electronic security is becoming increasingly important. Cryptography is used to protect e-mail messages, credit card information, and corporate data. The design of the cryptography system is a conventional cryptography that uses one key for encryption and decryption process. The chosen cryptography algorithm is stream cipher algorithm that encrypt one bit at a time. The central problem in the stream-cipher cryptography is the difficulty of generating a long unpredictable sequence of binary signals from short and random key. Pseudo random number generators (PRNG have been widely used to construct this key sequence. The pseudo random number generator was designed using the Artificial Neural Networks (ANN. The Artificial Neural Networks (ANN providing the required nonlinearity properties that increases the randomness statistical properties of the pseudo random generator. The learning algorithm of this neural network is backpropagation learning algorithm. The learning process was done by software program in Matlab (software implementation to get the efficient weights. Then, the learned neural network was implemented using field programmable gate array (FPGA.
On the number of special numbers
Indian Academy of Sciences (India)
We now apply the theory of the Thue equation to obtain an effective bound on m. Indeed, by Lemma 3.2, we can write m2 = ba3 and m2 − 4 = cd3 with b, c cubefree. By the above, both b, c are bounded since they are cubefree and all their prime factors are less than e63727. Now we have a finite number of. Thue equations:.
International Nuclear Information System (INIS)
Kaneko, K.
1987-01-01
A relationship between the number projection and the shell model methods is investigated in the case of a single-j shell. We can find a one-to-one correspondence between the number projected and the shell model states
Gallistel, C R
2017-12-01
The representation of discrete and continuous quantities appears to be ancient and pervasive in animal brains. Because numbers are the natural carriers of these representations, we may discover that in brains, it's numbers all the way down.
International Nuclear Information System (INIS)
Yamada, Takahiro; Maezawa, Masaaki; Urano, Chiharu
2015-01-01
Highlights: • We demonstrated RSFQ digital components of a new quantum voltage noise source. • A pseudo-random number generator and variable pulse number multiplier are designed. • Fabrication process is based on four Nb wiring layers and Nb/AlOx/Nb junctions. • The circuits successfully operated with wide dc bias current margins, 80–120%. - Abstract: We present design and testing of a pseudo-random number generator (PRNG) and a variable pulse number multiplier (VPNM) which are digital circuit subsystems in an integrated quantum voltage noise source for Jonson noise thermometry. Well-defined, calculable pseudo-random patterns of single flux quantum pulses are synthesized with the PRNG and multiplied digitally with the VPNM. The circuit implementation on rapid single flux quantum technology required practical circuit scales and bias currents, 279 junctions and 33 mA for the PRNG, and 1677 junctions and 218 mA for the VPNM. We confirmed the circuit operation with sufficiently wide margins, 80–120%, with respect to the designed bias currents.
Energy Technology Data Exchange (ETDEWEB)
Yamada, Takahiro, E-mail: yamada-takahiro@aist.go.jp [Nanoelectronics Research Institute, National Institute of Advanced Industrial Science and Technology, Central 2, Umezono 1-1-1, Tsukuba, Ibaraki 305-8568 (Japan); Maezawa, Masaaki [Nanoelectronics Research Institute, National Institute of Advanced Industrial Science and Technology, Central 2, Umezono 1-1-1, Tsukuba, Ibaraki 305-8568 (Japan); Urano, Chiharu [National Metrology Institute of Japan, National Institute of Advanced Industrial Science and Technology, Central 3, Umezono 1-1-1, Tsukuba, Ibaraki 305-8563 (Japan)
2015-11-15
Highlights: • We demonstrated RSFQ digital components of a new quantum voltage noise source. • A pseudo-random number generator and variable pulse number multiplier are designed. • Fabrication process is based on four Nb wiring layers and Nb/AlOx/Nb junctions. • The circuits successfully operated with wide dc bias current margins, 80–120%. - Abstract: We present design and testing of a pseudo-random number generator (PRNG) and a variable pulse number multiplier (VPNM) which are digital circuit subsystems in an integrated quantum voltage noise source for Jonson noise thermometry. Well-defined, calculable pseudo-random patterns of single flux quantum pulses are synthesized with the PRNG and multiplied digitally with the VPNM. The circuit implementation on rapid single flux quantum technology required practical circuit scales and bias currents, 279 junctions and 33 mA for the PRNG, and 1677 junctions and 218 mA for the VPNM. We confirmed the circuit operation with sufficiently wide margins, 80–120%, with respect to the designed bias currents.
DEFF Research Database (Denmark)
Andersen, Torben
2014-01-01
had a marked singular and an unmarked plural. Synchronically, however, the singular is arguably the basic member of the number category as revealed by the use of the two numbers. In addition, some nouns have a collective form, which is grammatically singular. Number also plays a role...
DEFF Research Database (Denmark)
Elvik, Rune; Bjørnskau, Torkel
2017-01-01
Highlights •26 studies of the safety-in-numbers effect are reviewed. •The existence of a safety-in-numbers effect is confirmed. •Results are consistent. •Causes of the safety-in-numbers effect are incompletely known....
de Mestre, Neville
2008-01-01
Prime numbers are important as the building blocks for the set of all natural numbers, because prime factorisation is an important and useful property of all natural numbers. Students can discover them by using the method known as the Sieve of Eratosthenes, named after the Greek geographer and astronomer who lived from c. 276-194 BC. Eratosthenes…
Efficient sampling algorithms for Monte Carlo based treatment planning
International Nuclear Information System (INIS)
DeMarco, J.J.; Solberg, T.D.; Chetty, I.; Smathers, J.B.
1998-01-01
Efficient sampling algorithms are necessary for producing a fast Monte Carlo based treatment planning code. This study evaluates several aspects of a photon-based tracking scheme and the effect of optimal sampling algorithms on the efficiency of the code. Four areas were tested: pseudo-random number generation, generalized sampling of a discrete distribution, sampling from the exponential distribution, and delta scattering as applied to photon transport through a heterogeneous simulation geometry. Generalized sampling of a discrete distribution using the cutpoint method can produce speedup gains of one order of magnitude versus conventional sequential sampling. Photon transport modifications based upon the delta scattering method were implemented and compared with a conventional boundary and collision checking algorithm. The delta scattering algorithm is faster by a factor of six versus the conventional algorithm for a boundary size of 5 mm within a heterogeneous geometry. A comparison of portable pseudo-random number algorithms and exponential sampling techniques is also discussed
Yamada, Takahiro; Maezawa, Masaaki; Urano, Chiharu
2015-11-01
We present design and testing of a pseudo-random number generator (PRNG) and a variable pulse number multiplier (VPNM) which are digital circuit subsystems in an integrated quantum voltage noise source for Jonson noise thermometry. Well-defined, calculable pseudo-random patterns of single flux quantum pulses are synthesized with the PRNG and multiplied digitally with the VPNM. The circuit implementation on rapid single flux quantum technology required practical circuit scales and bias currents, 279 junctions and 33 mA for the PRNG, and 1677 junctions and 218 mA for the VPNM. We confirmed the circuit operation with sufficiently wide margins, 80-120%, with respect to the designed bias currents.