A Pseudo-Random Number Generator Based on Normal Numbers
Energy Technology Data Exchange (ETDEWEB)
Bailey, David H.
2004-12-31
In a recent paper, Richard Crandall and the present author established that each of a certain class of explicitly given real constants, uncountably infinite in number, is b-normal, for an integer that appears in the formula defining the constant. A b-normal constant is one where every string of m digits appears in the base-b expansion of the constant with limiting frequency b{sup -m}. This paper shows how this result can be used to fashion an efficient and effective pseudo-random number generator, which generates successive strings of binary digits from one of the constants in this class. The resulting generator, which tests slightly faster than a conventional linear congruential generator, avoids difficulties with large power-of-two data access strides that may occur when using conventional generators. It is also well suited for parallel processing--each processor can quickly and independently compute its starting value, with the collective sequence generated by all processors being the same as that generated by a single processor.
Fast normal random number generators on vector processors
Brent, Richard P.
2010-01-01
We consider pseudo-random number generators suitable for vector processors. In particular, we describe vectorised implementations of the Box-Muller and Polar methods, and show that they give good performance on the Fujitsu VP2200. We also consider some other popular methods, e.g. the Ratio method of Kinderman and Monahan (1977) (as improved by Leva (1992)), and the method of Von Neumann and Forsythe, and show why they are unlikely to be competitive with the Polar method on vector processors.
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.
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.
Quantum Random Number Generators
Herrero-Collantes, Miguel; Garcia-Escartin, Juan Carlos
2016-01-01
Random numbers are a fundamental resource in science and engineering with important applications in simulation and cryptography. The inherent randomness at the core of quantum mechanics makes quantum systems a perfect source of entropy. Quantum random number generation is one of the most mature quantum technologies with many alternative generation methods. We discuss the different technologies in quantum random number generation from the early devices based on radioactive decay to the multipl...
Quantum random number generation
Ma, Xiongfeng; Yuan, Xiao; Cao, Zhu; Qi, Bing; Zhang, Zhen
2016-06-01
Quantum physics can be exploited to generate true random numbers, which have important roles in many applications, especially in cryptography. Genuine randomness from the measurement of a quantum system reveals the inherent nature of quantumness—coherence, an important feature that differentiates quantum mechanics from classical physics. The generation of genuine randomness is generally considered impossible with only classical means. On the basis of the degree of trustworthiness on devices, quantum random number generators (QRNGs) can be grouped into three categories. The first category, practical QRNG, is built on fully trusted and calibrated devices and typically can generate randomness at a high speed by properly modelling the devices. The second category is self-testing QRNG, in which verifiable randomness can be generated without trusting the actual implementation. The third category, semi-self-testing QRNG, is an intermediate category that provides a tradeoff between the trustworthiness on the device and the random number generation speed.
Quantum random number generators
Herrero-Collantes, Miguel; Garcia-Escartin, Juan Carlos
2017-01-01
Random numbers are a fundamental resource in science and engineering with important applications in simulation and cryptography. The inherent randomness at the core of quantum mechanics makes quantum systems a perfect source of entropy. Quantum random number generation is one of the most mature quantum technologies with many alternative generation methods. This review discusses the different technologies in quantum random number generation from the early devices based on radioactive decay to the multiple ways to use the quantum states of light to gather entropy from a quantum origin. Randomness extraction and amplification and the notable possibility of generating trusted random numbers even with untrusted hardware using device-independent generation protocols are also discussed.
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.
Quantum random number generator
Stipcevic, M
2006-01-01
We report upon a novel principle for realization of a fast nondeterministic random number generator whose randomness relies on intrinsic randomness of the quantum physical processes of photonic emission in semiconductors and subsequent detection by the photoelectric effect. Timing information of detected photons is used to generate binary random digits-bits. The bit extraction method based on restartable clock theoretically eliminates both bias and autocorrelation while reaching efficiency of almost 0.5 bits per random event. A prototype has been built and statistically tested.
DEFF Research Database (Denmark)
Wanscher, Jørgen Bundgaard; Sørensen, Majken Vildrik
2006-01-01
highly uniform multidimensional draws, which are highly relevant for todays traffic models. This paper shows among others combined shuffling and scrambling seems needless, that scrambling gives the lowest correlation and that there are detectable differences between random numbers, dependent...
[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.
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…
Investigating the Randomness of Numbers
Pendleton, Kenn L.
2009-01-01
The use of random numbers is pervasive in today's world. Random numbers have practical applications in such far-flung arenas as computer simulations, cryptography, gambling, the legal system, statistical sampling, and even the war on terrorism. Evaluating the randomness of extremely large samples is a complex, intricate process. However, the…
Investigating the Randomness of Numbers
Pendleton, Kenn L.
2009-01-01
The use of random numbers is pervasive in today's world. Random numbers have practical applications in such far-flung arenas as computer simulations, cryptography, gambling, the legal system, statistical sampling, and even the war on terrorism. Evaluating the randomness of extremely large samples is a complex, intricate process. However, the…
Random numbers from vacuum fluctuations
Shi, Yicheng; Chng, Brenda; Kurtsiefer, Christian
2016-07-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.
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.
Random number generators and causality
Energy Technology Data Exchange (ETDEWEB)
Larrondo, H.A. [Facultad de Ingenieria, Universidad Nacional de Mar del Plata, Juan B. Justo 4302, 7600 Mar del Plata (Argentina)]. E-mail: larrondo@fi.mdp.edu.ar; Martin, M.T. [Instituto de Fisica (IFLP), Facultad de Ciencias Exactas, Universidad Nacional de La Plata and Argentina' s National Council (CONICET), C.C. 727, 1900 La Plata (Argentina)]. E-mail: mtmartin@venus.unlp.edu.ar; Gonzalez, C.M. [Facultad de Ingenieria, Universidad Nacional de Mar del Plata, Juan B. Justo 4302, 7600 Mar del Plata (Argentina)]. E-mail: cmgonzal@fi.mdp.edu.ar; Plastino, A. [Instituto de Fisica (IFLP), Facultad de Ciencias Exactas, Universidad Nacional de La Plata and Argentina' s National Council (CONICET), C.C. 727, 1900 La Plata (Argentina)]. E-mail: plastino@venus.unlp.edu.ar; Rosso, O.A. [Chaos and Biology Group, Instituto de Calculo, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires, Pabellon II, Ciudad Universitaria, 1428 Ciudad de Buenos Aires (Argentina)]. E-mail: oarosso@fibertel.com.ar
2006-04-03
We advance a prescription to randomize physical or algorithmic Random Number Generators (RNG's) that do not pass Marsaglia's DIEHARD test suite and discuss a special physical quantifier, based on an intensive statistical complexity measure, that is able to adequately assess the improvements produced thereby. Eight RNG's are evaluated and the associated results are compared to those obtained by recourse to Marsaglia's DIEHARD test suite. Our quantifier, which is evaluated using causality arguments, can forecast whether a given RNG will pass the above mentioned test.
Random number generators and causality
Larrondo, H. A.; Martín, M. T.; González, C. M.; Plastino, A.; Rosso, O. A.
2006-04-01
We advance a prescription to randomize physical or algorithmic Random Number Generators (RNG's) that do not pass Marsaglia's DIEHARD test suite and discuss a special physical quantifier, based on an intensive statistical complexity measure, that is able to adequately assess the improvements produced thereby. Eight RNG's are evaluated and the associated results are compared to those obtained by recourse to Marsaglia's DIEHARD test suite. Our quantifier, which is evaluated using causality arguments, can forecast whether a given RNG will pass the above mentioned test.
Brody, T. A.
1984-11-01
A new class of random-number generators is described, based on a combination of the logical exclusive-or operation and the McLaren-Marsaglia mechanism. It is suitable for any word length, requires no multiple-precision arithmetic, and contains no hard-to-determine constants. Though no theory is available, numerical tests have shown it to be very satisfactory. Execution time is less than twice that of standard congruential generators.
Ben-Ari, Morechai
2004-01-01
The term "random" is frequently used in discussion of the theory of evolution, even though the mathematical concept of randomness is problematic and of little relevance in the theory. Therefore, since the core concept of the theory of evolution is the non-random process of natural selection, the term random should not be used in teaching the…
The MIXMAX random number generator
Savvidy, Konstantin G
2014-01-01
In this note, we give a practical solution to the problem of determining the maximal period of matrix generators of pseudo-random numbers which are based on an integer-valued unimodular matrix of size NxN known as MIXMAX and arithmetic defined on a Galois field GF[p] with large prime modulus p. The existing theory of Galois finite fields is adapted to the present case, and necessary and sufficient condition to attain the maximum period is formulated. Three efficient algorithms are presented. First, allowing to compute the multiplication by the MIXMAX matrix with O(N) operations. Second, to recursively compute the characteristic polynomial with O(N^2) operations, and third, to apply skips of large number of steps S to the sequence in O(N^2 log(S)) operations. It is demonstrated that the dynamical properties of this generator dramatically improve with the size of the matrix N, as compared to the classes of generators based on sparse matrices and/or sparse characteristic polynomials. Finally, we present the impl...
Percon8 Algorithm for Random Number Generation
Directory of Open Access Journals (Sweden)
Dr. Mrs. Saylee Gharge
2014-05-01
Full Text Available In today’s technology savvy world, computer security holds a prime importance. Most computer security algorithms require some amount of random data for generating public and private keys, session keys or for other purposes. Random numbers are those numbers that occur in a sequence such that the future value of the sequence cannot be predicted based on present or past values. Random numbers find application in statistical analysis and probability theory. The many applications of randomness have led to the development of random number generating algorithms. These algorithms generate a sequence of random numbers either computationally or physically. In our proposed technique, we have implemented a random number generation algorithm combining two existing random number generation techniques viz. Mid square method and Linear Congruential Generator
True random numbers from amplified quantum vacuum
Jofre, M; Steinlechner, F; Anzolin, G; Torres, J P; Mitchell, M W; Pruneri, V; 10.1364/OE.19.020665
2011-01-01
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 t...
Self-correcting random number generator
Energy Technology Data Exchange (ETDEWEB)
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.
Can brains generate random numbers?
Chvátal, V.; Goldsmith, M.
2013-01-01
Motivated by EEG recordings of normal brain activity, we construct arbitrarily large McCulloch-Pitts neural networks that, without any external input, make every subset of their neurons fire in some iteration (and therefore in infinitely many iterations).
Quantum random number generator using photon-number path entanglement
Kwon, Osung; Cho, Young-Wook; Kim, Yoon-Ho
2010-08-01
We report an experimental implementation of quantum random number generator based on the photon-number-path entangled state. The photon-number-path entangled state is prepared by means of two-photon Hong-Ou-Mandel quantum interference at a beam splitter. The randomness in our scheme is of truly quantum mechanical origin as it comes from the projection measurement of the entangled two-photon state. The generated bit sequences satisfy the standard randomness test.
High speed optical quantum random number generation.
Fürst, Martin; Weier, Henning; Nauerth, Sebastian; Marangon, Davide G; Kurtsiefer, Christian; Weinfurter, Harald
2010-06-07
We present a fully integrated, ready-for-use quantum random number generator (QRNG) whose stochastic model is based on the randomness of detecting single photons in attenuated light. We show that often annoying deadtime effects associated with photomultiplier tubes (PMT) can be utilized to avoid postprocessing for bias or correlations. The random numbers directly delivered to a PC, generated at a rate of up to 50 Mbit/s, clearly pass all tests relevant for (physical) random number generators.
Ultra-fast Quantum Random Number Generator
Yicheng, Shi
We describe a series of Randomness Extractors for removing bias and residual correlations in random numbers generated from measurements on noisy physical systems. The structures of the randomness extractors are based on Linear Feedback Shift Registers (LFSR). This leads to a significant simplification in the implementation of randomness extractors.
Physical tests for random numbers in simulations
Vattulainen, I.; Ala-Nissila, T.; Kankaala, K.
1994-11-01
We propose three physical tests to measure correlations in random numbers used in Monte Carlo simulations. The first test uses autocorrelation times of certain physical quantities when the Ising model is simulated with the Wolff algorithm. The second test is based on random walks, and the third on blocks of n successive numbers. We apply the tests to show that recent errors in high precision Ising simulations using generalized feedback shift register algorithms are due to short range correlations in random number sequences.
Motzkin numbers out of Random Domino Automaton
Białecki, Mariusz
2011-01-01
Motzkin numbers are derived from a special case of Random Domino Automaton - recently proposed toy model of earthquakes. An exact solution of the set of equations describing stationary state of Random Domino Automaton in "inverse-power" case is presented. A link with Motzkin numbers allows to present explicit form of asymptotic behaviour of the automaton.
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.
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 .
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.
Physical tests for random numbers in simulations
Energy Technology Data Exchange (ETDEWEB)
Vattulainen, I.; Ala-Nissila, T.; Kankaala, K. (Research Institute for Theoretical Physics, P.O. Box 9 (Siltavuorenpenger 20 C), FIN-00014 University of Helsinki (Finland) Department of Electrical Engineering, Tampere University of Technology, P.O. Box 692, FIN-3310, Tampere (Finland) Center for Scientific Computing, P.O. Box 405, FIN-02101 Espoo (Finland))
1994-11-07
We propose three physical tests to measure correlations in random numbers used in Monte Carlo simulations. The first test uses autocorrelation times of certain physical quantities when the Ising model is simulated with the Wolff algorithm. The second test is based on random walks, and the third on blocks of [ital n] successive numbers. We apply the tests to show that recent errors in high precision Ising simulations using generalized feedback shift register algorithms are due to short range correlations in random number sequences.
Random Numbers Certified by Bell's Theorem
Pironio, S; Massar, S; de la Giroday, A Boyer; Matsukevich, D N; Maunz, P; Olmschenk, S; Hayes, D; Luo, L; Manning, T A; Monroe, C
2009-01-01
Randomness is difficult to characterize mathematically, and its generation must rely on an unpredictable physical process. Inaccuracies in the theoretical modelling of such processes or failures of the devices, possibly due to adversarial attacks, limit the reliability of random number generators in ways that are difficult to control and detect. Here, we show that the nonlocal correlations of entangled quantum particles can be used to design a new type of cryptographically secure random number generator without the need for any assumptions on the internal working of the devices. This strong form of randomness generation is impossible classically and possible in quantum systems only if certified by a Bell inequality violation. We demonstrate this proposal in a system of two entangled atoms separated by approximately 1 meter. The observed Bell inequality violation, featuring near-perfect detection efficiency, guarantees that 42 new random numbers are generated with 99% confidence. Our results lay the groundwork...
Random numbers certified by Bell's theorem.
Pironio, S; Acín, A; Massar, S; de la Giroday, A Boyer; Matsukevich, D N; Maunz, P; Olmschenk, S; Hayes, D; Luo, L; Manning, T A; Monroe, C
2010-04-15
Randomness is a fundamental feature of nature and a valuable resource for applications ranging from cryptography and gambling to numerical simulation of physical and biological systems. Random numbers, however, are difficult to characterize mathematically, and their generation must rely on an unpredictable physical process. Inaccuracies in the theoretical modelling of such processes or failures of the devices, possibly due to adversarial attacks, limit the reliability of random number generators in ways that are difficult to control and detect. Here, inspired by earlier work on non-locality-based and device-independent quantum information processing, we show that the non-local correlations of entangled quantum particles can be used to certify the presence of genuine randomness. It is thereby possible to design a cryptographically secure random number generator that does not require any assumption about the internal working of the device. Such a strong form of randomness generation is impossible classically and possible in quantum systems only if certified by a Bell inequality violation. We carry out a proof-of-concept demonstration of this proposal in a system of two entangled atoms separated by approximately one metre. The observed Bell inequality violation, featuring near perfect detection efficiency, guarantees that 42 new random numbers are generated with 99 per cent confidence. Our results lay the groundwork for future device-independent quantum information experiments and for addressing fundamental issues raised by the intrinsic randomness of quantum theory.
Self-Testing Quantum Random Number Generator
Lunghi, Tommaso; Brask, Jonatan Bohr; Lim, Charles Ci Wen; Lavigne, Quentin; Bowles, Joseph; Martin, Anthony; Zbinden, Hugo; Brunner, Nicolas
2015-04-01
The generation of random numbers is a task of paramount importance in modern science. A central problem for both classical and quantum randomness generation is to estimate the entropy of the data generated by a given device. Here we present a protocol for self-testing quantum random number generation, in which the user can monitor the entropy in real time. Based on a few general assumptions, our protocol guarantees continuous generation of high quality randomness, without the need for a detailed characterization of the devices. Using a fully optical setup, we implement our protocol and illustrate its self-testing capacity. Our work thus provides a practical approach to quantum randomness generation in a scenario of trusted but error-prone devices.
On contact numbers in random rod packings
Wouterse, A.; Luding, Stefan; Philipse, A.P.
2009-01-01
Random packings of non-spherical granular particles are simulated by combining mechanical contraction and molecular dynamics, to determine contact numbers as a function of density. Particle shapes are varied from spheres to thin rods. The observed contact numbers (and packing densities) agree well
Random Numbers from a Delay Equation
Self, Julian; Mackey, Michael C.
2016-10-01
Delay differential equations can have "chaotic" solutions that can be used to mimic Brownian motion. Since a Brownian motion is random in its velocity, it is reasonable to think that a random number generator might be constructed from such a model. In this preliminary study, we consider one specific example of this and show that it satisfies criteria commonly employed in the testing of random number generators (from TestU01's very stringent "Big Crush" battery of tests). A technique termed digit discarding, commonly used in both this generator and physical RNGs using laser feedback systems, is discussed with regard to the maximal Lyapunov exponent. Also, we benchmark the generator to a contemporary common method: the multiple recursive generator, MRG32k3a. Although our method is about 7 times slower than MRG32k3a, there is in principle no apparent limit on the number of possible values that can be generated from the scheme we present here.
Hardware Random number Generator for cryptography
Soorat, Ram; Vudayagiri, Ashok
2015-01-01
One of the key requirement of many schemes is that of random numbers. Sequence of random numbers are used at several stages of a standard cryptographic protocol. A simple example is of a Vernam cipher, where a string of random numbers is added to massage string to generate the encrypted code. It is represented as $C=M \\oplus K $ where $M$ is the message, $K$ is the key and $C$ is the ciphertext. It has been mathematically shown that this simple scheme is unbreakable is key K as long as M and is used only once. For a good cryptosystem, the security of the cryptosystem is not be based on keeping the algorithm secret but solely on keeping the key secret. The quality and unpredictability of secret data is critical to securing communication by modern cryptographic techniques. Generation of such data for cryptographic purposes typically requires an unpredictable physical source of random data. In this manuscript, we present studies of three different methods for producing random number. We have tested them by study...
A note on the normal approximation error for randomly weighted self-normalized sums
Hoermann, Siegfried
2011-01-01
Let $\\bX=\\{X_n\\}_{n\\geq 1}$ and $\\bY=\\{Y_n\\}_{n\\geq 1}$ be two independent random sequences. We obtain rates of convergence to the normal law of randomly weighted self-normalized sums $$ \\psi_n(\\bX,\\bY)=\\sum_{i=1}^nX_iY_i/V_n,\\quad V_n=\\sqrt{Y_1^2+...+Y_n^2}. $$ These rates are seen to hold for the convergence of a number of important statistics, such as for instance Student's $t$-statistic or the empirical correlation coefficient.
Analysis of Additive Random Number Generators.
1977-03-01
linear congruential generators yn*\\* ayn+bmo,iPa- The simplest example of a sequence satisfying (1.1) with *> I is the Fibonacci sequence with p - 2...However, the Fibonacci sequence is not a suitable random number generator because successive triples are very poorly distributed in three...number generator should have small discrepancy. Definition 2.1 can be extended naturally to define discrepancy for sequences of points yn lying in
Random Number Generation for High Performance Computing
2015-01-01
TOTAL: PERCENT_SUPPORTEDNAME FTE Equivalent: Total Number: Discipline Robin Schulze 0.43 0.43 1 Names of Post Doctorates Names of Faculty Supported...Agent, or Firm- Meyertons, Hood , Kivlin, Kowert & Goetze!, P.C.; Eric B. Meyertons (57) ABSTRACT A method of assessing parallel random number...Meyertons, Hood , Kivlin, Kowert & Goetzel, P.C. P.O. Box 398 Austin, TX 78767-0398 Ph: (512) 853-8800 PATENT 5660-14400
Operational conditions for random-number generation
Compagner, A.
1995-11-01
Ensemble theory is used to describe arbitrary sequences of integers, whether formed by the decimals of π or produced by a roulette or by any other means. Correlation coefficients of any range and order are defined as Fourier transforms of the ensemble weights. Competing definitions of random sequences are considered. Special attention is given to sequences of random numbers needed for Monte Carlo calculations. Different recipes for those sequences lead to correlations that vary in range and order, but the total amount of correlation is the same for all sequences of a given length (without internal periodicities). For maximum-length sequences produced by linear algorithms, most correlation coefficients are zero, but the remaining ones are of absolute value 1. In well-tempered sequences, these complete correlations are of high order or of very long range. General conditions to be obeyed by random-number generators are discussed and a qualitative method for comparing different recipes is given.
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.
On winning sets and non-normal numbers
Mance, Bill
2010-01-01
In \\cite{SchmidtGames}, W. Schmidt proved that the set of non-normal numbers in base $b$ is a {\\it winning set}. We generalize this result by proving that many sets of non-normal numbers with respect to the Cantor series expansion are winning sets. As an immediate consequence, these sets will be shown to have full Hausdorff dimension.
On winning sets and non-normal numbers
Mance, Bill
2010-01-01
In \\cite{SchmidtGames}, W. Schmidt proved that the set of non-normal numbers in base $b$ is a {\\it winning set}. We generalize this result by proving that the set of non-normal numbers with respect to the $\\beta$-expansion, where $\\beta$ is a Pisot-Vijayaraghavan number, is a winning set. Additionally, we show that several sets of non-normal numbers with respect to the Cantor series expansion are winning sets. As an immediate consequence, all of these sets will be shown to have full Hausdorff dimension.
Computer routines for probability distributions, random numbers, and related functions
Kirby, W.H.
1980-01-01
Use of previously codes and tested subroutines simplifies and speeds up program development and testing. This report presents routines that can be used to calculate various probability distributions and other functions of importance in statistical hydrology. The routines are designed as general-purpose Fortran subroutines and functions to be called from user-written main programs. The probability distributions provided include the beta, chisquare, gamma, Gaussian (normal), Pearson Type III (tables and approximation), and Weibull. Also provided are the distributions of the Grubbs-Beck outlier test, Kolmogorov 's and Smirnov 's D, Student 's t, noncentral t (approximate), and Snedecor F tests. Other mathematical functions include the Bessel function I (subzero), gamma and log-gamma functions, error functions and exponential integral. Auxiliary services include sorting and printer plotting. Random number generators for uniform and normal numbers are provided and may be used with some of the above routines to generate numbers from other distributions. (USGS)
Framework for testing random numbers in parallel calculations
DEFF Research Database (Denmark)
Vattulainen, Ilpo Tapio
1999-01-01
We propose a framework for testing the quality of random numbers in parallel calculations. The key idea. is to study cross-correlations between distinct sequences of random numbers via correlations between various diffusing random walkers, each of which is governed by a distinct random number seq...
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.
Experimental realization of quantum random number generator
Soubusta, Jan; Haderka, Ondrej; Hendrych, Martin; Pavlicek, Pavel
2003-11-01
We present our experimental realization of a quantum random number generator (RNG) based on the quantum random process of division of light pulse on a fiber coupler. Our prototype consists of fiber optics elements: a pigtailcd laser diode, two mechanical attenuators, a fiber coupler, and two single photon detectors. The RNG contains all necessary electronics for the generation of light pulses, synchronized reading of detectors' states, processing of these results, and transfer of data to a host computer. The connection to the computer is done via a 25-pin parallel port, that makes our device easy to use with any personal computer (PC). The RNG can be operated in four different modes, that arc selected by the PC. The zeroth mode is just for the device control, the first mode serves for appropriate setting of generation efficiency, the second mode is designed for raw data sequence generation at a rate of 114 kByte/s, and the last mode provides balanced data sequence at a rate of 28 kByte/s utilizing von Ncumann's extraction procedure. This procedure is used to gain a properly balanced ratio between '0's and '1's. The balanced data sequence generated by the RNG in the third mode passes all kinds of tests we arc using [for example 15 tests proposed by G. Marsaglia, WWW: http://stat.fsu.edu/ geo/diehard.html 1. The raw data sequence can be used for purposes that do not need properly balanced data, because raw data passes tests that arc not inspecting the sequence balance.
Normality and Finite-state Dimension of Liouville numbers
Nandakumar, Satyadev
2012-01-01
Liouville numbers were the first class of real numbers which were proven to be transcendental. It is easy to construct non-normal Liouville numbers. Kano and Bugeaud have proved, using analytic techniques, that there are normal Liouville numbers. Here, for a given base k >= 2, we give two simple constructions of a Liouville number which is normal to the base k. The first construction is combinatorial, and is based on de Bruijn sequences. A real number in the unit interval is normal if and only if its finite-state dimension is 1. We generalize our construction to prove that for any rational r in the closed unit interval, there is a Liouville number with finite state dimension r. This refines Staiger's result that the set of Liouville numbers has constructive Hausdorff dimension zero, showing a new quantitative classification of Liouville numbers can be attained using finite-state dimension. In the second number-theoretic construction, we use an arithmetic property of numbers - the existence of primitive roots ...
Asymptotic normality of randomly truncated stochastic algorithms
Lelong, Jérôme
2010-01-01
We study the convergence rate of randomly truncated stochastic algorithms, which consist in the truncation of the standard Robbins-Monro procedure on an increasing sequence of compact sets. Such a truncation is often required in practice to ensure convergence when standard algorithms fail because the expected-value function grows too fast. In this work, we give a self contained proof of a central limit theorem for this algorithm under local assumptions on the expected-value function, which are fairly easy to check in practice.
Asymptotic normality of randomly truncated stochastic algorithms
Lelong, Jérôme
2010-01-01
We study the convergence rate of randomly truncated stochastic algorithms, which consist in the truncation of the standard Robbins-Monro procedure on an increasing sequence of compact sets. Such a truncation is often required in practice to ensure convergence when standard algorithms fail because the expected-value function grows too fast. In this work, we give a self contained proof of a central limit theorem for this algorithm under local assumptions on the expected-value function, which are fairly easy to check in practice.
An experimental investigation of the normality of irrational algebraic numbers
DEFF Research Database (Denmark)
Nielsen, Johan Sejr Brinch; Simonsen, Jakob Grue
2013-01-01
We investigate the distribution of digits of large prefixes of the expansion of irrational algebraic numbers to different bases. We compute 2.318 bits of the binary expansions (corresponding to 2.33.108 decimals) of the 39 least Pisot-Vijayaraghavan numbers, the 47 least known Salem numbers...... blocks for each number to bases 2, 3, 5, 7 and 10, as well as the maximum relative frequency deviation from perfect equidistribution. We use the two statistics to perform tests at significance level α = 0.05, respectively, maximum deviation threshold α = 0.05. Our results suggest that if Borel......'s conjecture-that all irrational algebraic numbers are normal-is true, then it may have an empirical base: The distribution of digits in algebraic numbers appears close to equidistribution for large prefixes of their expansion. Of the 121 algebraic numbers studied, all numbers passed the maximum relative...
Random Numbers Generated from Audio and Video Sources
Directory of Open Access Journals (Sweden)
I-Te Chen
2013-01-01
Full Text Available Random numbers are very useful in simulation, chaos theory, game theory, information theory, pattern recognition, probability theory, quantum mechanics, statistics, and statistical mechanics. The random numbers are especially helpful in cryptography. In this work, the proposed random number generators come from white noise of audio and video (A/V sources which are extracted from high-resolution IPCAM, WEBCAM, and MPEG-1 video files. The proposed generator applied on video sources from IPCAM and WEBCAM with microphone would be the true random number generator and the pseudorandom number generator when applied on video sources from MPEG-1 video file. In addition, when applying NIST SP 800-22 Rev.1a 15 statistics tests on the random numbers generated from the proposed generator, around 98% random numbers can pass 15 statistical tests. Furthermore, the audio and video sources can be found easily; hence, the proposed generator is a qualified, convenient, and efficient random number generator.
Postprocessing for quantum random number generators: entropy evaluation and randomness extraction
Ma, Xiongfeng; Xu, Feihu; Xu, He; Tan, Xiaoqing; Qi, Bing; Lo, Hoi-Kwong
2012-01-01
Quantum random-number generators (QRNGs) can offer a means to generate information-theoretically provable random numbers, in principle. In practice, unfortunately, the quantum randomness is inevitably mixed with classical randomness due to classical noises. To distill this quantum randomness, one needs to quantify the randomness of the source and apply a randomness extractor. Here, we propose a generic framework for evaluating quantum randomness of real-life QRNGs by min-entropy, and apply it...
Generation of physical random numbers by using homodyne detection
Hirakawa, Kodai; Oya, Shota; Oguri, Yusuke; Ichikawa, Tsubasa; Eto, Yujiro; Hirano, Takuya; Tsurumaru, Toyohiro
2016-10-01
Physical random numbers generated by quantum measurements are, in principle, impossible to predict. We have demonstrated the generation of physical random numbers by using a high-speed balanced photodetector to measure the quadrature amplitudes of vacuum states. Using this method, random numbers were generated at 500 Mbps, which is more than one order of magnitude faster than previously [Gabriel et al:, Nature Photonics 4, 711-715 (2010)]. The Crush test battery of the TestU01 suite consists of 31 tests in 144 variations, and we used them to statistically analyze these numbers. The generated random numbers passed 14 of the 31 tests. To improve the randomness, we performed a hash operation, in which each random number was multiplied by a random Toeplitz matrix; the resulting numbers passed all of the tests in the TestU01 Crush battery.
Random Number Generator Using Seven Segment Display In Labview
Directory of Open Access Journals (Sweden)
D. Bhavana
2015-04-01
Full Text Available Random number generator [RNG] is use to generate random numbers between any given limit, RNG's are two kinds 1.True random number and 2.pseudom numbers. True random numbers are not predictable by any mathematical formula because they are mainly depends on the atmospheric noise, coming to the pseudo numbers are mainly used in most of computers, this randomness can be predictable by using mathematical formula and it is fine many purposes, but it may not be random in the way you expect if you are used to dice rolls and lottery drawings. In this mini project we are doing RNG [pseudo numbers] by using NI labview software and generating random numbers by pressing push button and coming output we are displaying on seven segment display. In the labview it easy to generate a random number by using different block‟s and main advantage of the labview is there is no need of any programming languages like[c,c++,java,matlab].Main function of this project is used for gaming and priority number generation and etc. A sequence of uniform random numbers, which is generated within the computer in a deterministic manner, is often referred to as a pseudo-random number sequence.[1
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.
Two-bit quantum random number generator based on photon-number-resolving detection
Jian, Yi; Ren, Min; Wu, E.; Wu, Guang; Zeng, Heping
2011-07-01
Here we present a new fast two-bit quantum random number generator based on the intrinsic randomness of the quantum physical phenomenon of photon statistics of coherent light source. Two-bit random numbers were generated according to the number of detected photons in each light pulse by a photon-number-resolving detector. Poissonian photon statistics of the coherent light source guaranteed the complete randomness of the bit sequences. Multi-bit true random numbers were generated for the first time based on the multi-photon events from a coherent light source.
Mast cell numbers in normal and glaucomatous canine eyes.
Louden, C; Render, J A; Carlton, W W
1990-05-01
Numbers of mast cells in the cornea, sclera, choroid, ciliary body, iris, and retina of sections of globes from 35 clinically normal dogs and 34 dogs with secondary glaucoma was determined. Fixed globes were trimmed along a vertical midsagittal plane and embedded in paraffin. Tissue sections, approximately 6 microns thick, were stained with toluidine blue for identification of mast cells. In normal globes, most of the mast cells were observed in the anterior portion of the uvea, and fewer mast cells were seen in the choroid and sclera. Mast cells were not observed in the retina and were seldom observed in the cornea of dogs with or without glaucoma. In sections of glaucomatous globes, mast cells were distributed evenly in the uvea and sclera, and fewer mast cells were present than in normal globes, regardless of the cause of glaucoma.
Estimating the Number of Clusters via Normalized Cluster Instability
Haslbeck, Jonas M. B.; Wulff, Dirk U.
2016-01-01
We improve existing instability-based methods for the selection of the number of clusters $k$ in cluster analysis by normalizing instability. In contrast to existing instability methods which only perform well for bounded sequences of small $k$, our method performs well across the whole sequence of possible $k$. In addition, we compare for the first time model-based and model-free variants of $k$ selection via cluster instability and find that their performance is similar. We make our method ...
Humans cannot consciously generate random numbers sequences: Polemic study.
Figurska, Małgorzata; Stańczyk, Maciej; Kulesza, Kamil
2008-01-01
It is widely believed, that randomness exists in Nature. In fact such an assumption underlies many scientific theories and is embedded in the foundations of quantum mechanics. Assuming that this hypothesis is valid one can use natural phenomena, like radioactive decay, to generate random numbers. Today, computers are capable of generating the so-called pseudorandom numbers. Such series of numbers are only seemingly random (bias in the randomness quality can be observed). Question whether people can produce random numbers, has been investigated by many scientists in the recent years. The paper "Humans can consciously generate random numbers sequences..." published recently in Medical Hypotheses made claims that were in many ways contrary to state of art; it also stated far-reaching hypotheses. So, we decided to repeat the experiments reported, with special care being taken of proper laboratory procedures. Here, we present the results and discuss possible implications in computer and other sciences.
Miszczak, J A
2012-01-01
We present a new version of TRQS package for Mathematica computing system. The package allows harnessing quantum random number generators (QRNG) for investigating the statistical properties of quantum states. It implements a number of functions for generating random states. The new version of the package adds the ability to use the on-line quantum random number generator service and implements new functions for retrieving lists of random numbers. Thanks to the introduced improvements, the new version provides faster access to high-quality sources of random numbers and can be used in simulations requiring large amount of random data.
Random number datasets generated from statistical analysis of randomly sampled GSM recharge cards.
Okagbue, Hilary I; Opanuga, Abiodun A; Oguntunde, Pelumi E; Ugwoke, Paulinus O
2017-02-01
In this article, a random number of datasets was generated from random samples of used GSM (Global Systems for Mobile Communications) recharge cards. Statistical analyses were performed to refine the raw data to random number datasets arranged in table. A detailed description of the method and relevant tests of randomness were also discussed.
MicroRNA array normalization: an evaluation using a randomized dataset as the benchmark.
Qin, Li-Xuan; Zhou, Qin
2014-01-01
MicroRNA arrays possess a number of unique data features that challenge the assumption key to many normalization methods. We assessed the performance of existing normalization methods using two microRNA array datasets derived from the same set of tumor samples: one dataset was generated using a blocked randomization design when assigning arrays to samples and hence was free of confounding array effects; the second dataset was generated without blocking or randomization and exhibited array effects. The randomized dataset was assessed for differential expression between two tumor groups and treated as the benchmark. The non-randomized dataset was assessed for differential expression after normalization and compared against the benchmark. Normalization improved the true positive rate significantly in the non-randomized data but still possessed a false discovery rate as high as 50%. Adding a batch adjustment step before normalization further reduced the number of false positive markers while maintaining a similar number of true positive markers, which resulted in a false discovery rate of 32% to 48%, depending on the specific normalization method. We concluded the paper with some insights on possible causes of false discoveries to shed light on how to improve normalization for microRNA arrays.
Quantum random-number generator based on a photon-number-resolving detector
Ren, Min; Wu, E.; Liang, Yan; Jian, Yi; Wu, Guang; Zeng, Heping
2011-02-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.
Period of the d-Sequence Based Random Number Generator
Thippireddy, Suresh; Chalasani, Sandeep
2007-01-01
This paper presents an expression to compute the exact period of a recursive random number generator based on d-sequences. Using the multi-recursive version of this generator we can produce large number of pseudorandom sequences.
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.
Miszczak, J. A.
2012-01-01
We present a new version of TRQS package for Mathematica computing system. The package allows harnessing quantum random number generators (QRNG) for investigating the statistical properties of quantum states. It implements a number of functions for generating random states. The new version of the package adds the ability to use the on-line quantum random number generator service and implements new functions for retrieving lists of random numbers. Thanks to the introduced improvements, the new...
Quantum Random Number Generation Using a Quanta Image Sensor
Directory of Open Access Journals (Sweden)
Emna Amri
2016-06-01
Full Text Available A new quantum random number generation method is proposed. The method is based on the randomness of the photon emission process and the single photon counting capability of the Quanta Image Sensor (QIS. It has the potential to generate high-quality random numbers with remarkable data output rate. In this paper, the principle of photon statistics and theory of entropy are discussed. Sample data were collected with QIS jot device, and its randomness quality was analyzed. The randomness assessment method and results are discussed.
Quantum Random Number Generation Using a Quanta Image Sensor
Amri, Emna; Felk, Yacine; Stucki, Damien; Ma, Jiaju; Fossum, Eric R.
2016-01-01
A new quantum random number generation method is proposed. The method is based on the randomness of the photon emission process and the single photon counting capability of the Quanta Image Sensor (QIS). It has the potential to generate high-quality random numbers with remarkable data output rate. In this paper, the principle of photon statistics and theory of entropy are discussed. Sample data were collected with QIS jot device, and its randomness quality was analyzed. The randomness assessment method and results are discussed. PMID:27367698
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.
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.
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).
Experimental Certification of Random Numbers via Quantum Contextuality
Um, Mark; Zhang, Xiang; Zhang, Junhua; Wang, Ye; Yangchao, Shen; Deng, D.-L.; Duan, Lu-Ming; Kim, Kihwan
2013-04-01
The intrinsic unpredictability of measurements in quantum mechanics can be used to produce genuine randomness. Here, we demonstrate a random number generator where the randomness is certified by quantum contextuality in connection with the Kochen-Specker theorem. In particular, we generate random numbers from measurements on a single trapped ion with three internal levels, and certify the generated randomness by showing a bound on the minimum entropy through observation of violation of the Klyachko-Can-Binicioglu-Shumovsky (KCBS) inequality. Concerning the test of the KCBS inequality, we close the detection efficiency loophole for the first time and make it relatively immune to the compatibility loophole. In our experiment, we generate 1 × 105 random numbers that are guaranteed to have 5.2 × 104 bits of minimum entropy with a 99% confidence level.
Benchmarking the True Random Number Generator of TPM Chips
Suciu, Alin
2010-01-01
A TPM (trusted platform module) is a chip present mostly on newer motherboards, and its primary function is to create, store and work with cryptographic keys. This dedicated chip can serve to authenticate other devices or to protect encryption keys used by various software applications. Among other features, it comes with a True Random Number Generator (TRNG) that can be used for cryptographic purposes. This random number generator consists of a state machine that mixes unpredictable data with the output of a one way hash function. According the specification it can be a good source of unpredictable random numbers even without having to require a genuine source of hardware entropy. However the specification recommends collecting entropy from any internal sources available such as clock jitter or thermal noise in the chip itself, a feature that was implemented by most manufacturers. This paper will benchmark the random number generator of several TPM chips from two perspectives: the quality of the random bit s...
Postprocessing for quantum random-number generators: Entropy evaluation and randomness extraction
Ma, Xiongfeng; Xu, Feihu; Xu, He; Tan, Xiaoqing; Qi, Bing; Lo, Hoi-Kwong
2013-06-01
Quantum random-number generators (QRNGs) can offer a means to generate information-theoretically provable random numbers, in principle. In practice, unfortunately, the quantum randomness is inevitably mixed with classical randomness due to classical noises. To distill this quantum randomness, one needs to quantify the randomness of the source and apply a randomness extractor. Here, we propose a generic framework for evaluating quantum randomness of real-life QRNGs by min-entropy, and apply it to two different existing quantum random-number systems in the literature. Moreover, we provide a guideline of QRNG data postprocessing for which we implement two information-theoretically provable randomness extractors: Toeplitz-hashing extractor and Trevisan's extractor.
Quantum Random Number Generation on a Mobile Phone
Sanguinetti, Bruno; Martin, Anthony; Zbinden, Hugo; Gisin, Nicolas
2014-07-01
Quantum random number generators (QRNGs) can significantly improve the security of cryptographic protocols by ensuring that generated keys cannot be predicted. However, the cost, size, and power requirements of current Quantum random number generators have prevented them from becoming widespread. In the meantime, the quality of the cameras integrated in mobile telephones has improved significantly so that now they are sensitive to light at the few-photon level. We demonstrate how these can be used to generate random numbers of a quantum origin.
Enhanced security for multi-detector Quantum Random Number Generators
Marangon, Davide G.; Vallone, Giuseppe; Zanforlin, Ugo; Villoresi, Paolo
2016-01-01
Quantum random number generators (QRNG) represent an advanced solution for randomness generation, essential in every cryptographic applications. In this context, integrated arrays of single photon detectors have promising applications as QRNGs based on the spatial detection of photons. For the employment of QRNGs in Cryptography, it is necessary to have efficient methods to evaluate the so called quantum min-entropy that corresponds to the amount of the true extractable quantum randomness fro...
Laws of large numbers for ratios of uniform random variables
Directory of Open Access Journals (Sweden)
Adler André
2015-09-01
Full Text Available Let {Xnn n ≥ 1} and {Yn, n ≥ 1} be two sequences of uniform random variables. We obtain various strong and weak laws of large numbers for the ratio of these two sequences. Even though these are uniform and naturally bounded random variables the ratios are not bounded and have an unusual behaviour creating Exact Strong Laws.
Monte Carlo simulations: Hidden errors from ``good'' random number generators
Ferrenberg, Alan M.; Landau, D. P.; Wong, Y. Joanna
1992-12-01
The Wolff algorithm is now accepted as the best cluster-flipping Monte Carlo algorithm for beating ``critical slowing down.'' We show how this method can yield incorrect answers due to subtle correlations in ``high quality'' random number generators.
Thermal Noise Random Number Generator Based on LFSR
Institute of Scientific and Technical Information of China (English)
WANG Yu-hua; NIU Li-ping; SONG Li-xin; ZHU Fu-bao
2006-01-01
With the rapid development of cryptography, the strength of security protocols and encryption algorithms consumedly relies on the quality of random number. In many cryptography applications, higher speed is one of the references required. A new security random number generator architecture is presented. Its philosophy architecture is implemented with FPGA, based on the thermal noise and linear feedback shift register(LFSR). The thermal noise initializes LFSRs and is used as the disturbed source of the system to ensure the unpredictability of the produced random number and improve the security strength of the system. Parallel LFSRs can produce the pseudo-random numbers with long period and higher speed. The proposed architecture can meet the requirements of high quality and high speed in cryptography.
A Robust Quantum Random Number Generator Based on Bosonic Stimulation
H, Akshata Shenoy; Srikanth, R; Srinivas, T
2011-01-01
We propose a method to realize a robust quantum random number generator based on bosonic stimulation. A particular implementation that employs weak coherent pulses and conventional avalanche photo-diode detectors (APDs) is discussed.
Quantum Random Number Generation on a Mobile Phone
Sanguinetti, Bruno; Martin, Anthony; Zbinden, Hugo; Gisin, Nicolas
2014-01-01
Quantum random number generators (QRNGs) can significantly improve the security of cryptographic protocols by ensuring that generated keys cannot be predicted. However, the cost, size, and power requirements of current Quantum random number generators have prevented them from becoming widespread. In the meantime, the quality of the cameras integrated in mobile telephones has improved significantly so that now they are sensitive to light at the few-photon level. We demonstrate how these can be...
Recoverable Random Numbers in an Internet of Things Operating System
Directory of Open Access Journals (Sweden)
Taeill Yoo
2017-03-01
Full Text Available Over the past decade, several security issues with Linux Random Number Generator (LRNG on PCs and Androids have emerged. The main problem involves the process of entropy harvesting, particularly at boot time. An entropy source in the input pool of LRNG is not transferred into the non-blocking output pool if the entropy counter of the input pool is less than 192 bits out of 4098 bits. Because the entropy estimation of LRNG is highly conservative, the process may require more than one minute for starting the transfer. Furthermore, the design principle of the estimation algorithm is not only heuristic but also unclear. Recently, Google released an Internet of Things (IoT operating system called Brillo based on the Linux kernel. We analyze the behavior of the random number generator in Brillo, which inherits that of LRNG. In the results, we identify two features that enable recovery of random numbers. With these features, we demonstrate that random numbers of 700 bytes at boot time can be recovered with the success probability of 90% by using time complexity for 5.20 × 2 40 trials. Therefore, the entropy of random numbers of 700 bytes is merely about 43 bits. Since the initial random numbers are supposed to be used for sensitive security parameters, such as stack canary and key derivation, our observation can be applied to practical attacks against cryptosystem.
Fast quantum-optical random-number generators
Durt, Thomas; Belmonte, Carlos; Lamoureux, Louis-Philippe; Panajotov, Krassimir; Van den Berghe, Frederik; Thienpont, Hugo
2013-02-01
In this paper we study experimentally the properties of three types of quantum -optical random-number generators and characterize them using the available National Institute for Standards and Technology statistical tests, as well as four alternate tests. The generators are characterized by a trade-off between, on one hand, the rate of generation of random bits and, on the other hand, the degree of randomness of the series which they deliver. We describe various techniques aimed at maximizing this rate without diminishing the quality (degree of randomness) of the series generated by it.
Ternary jitter-based true random number generator
Latypov, Rustam; Stolov, Evgeni
2017-01-01
In this paper a novel family of generators producing true uniform random numbers in ternary logic is presented. The generator consists of a number of identical ternary logic combinational units connected into a ring. All the units are provided to have a random delay time, and this time is supposed to be distributed in accordance with an exponential distribution. All delays are supposed to be independent events. The theory of the generator is based on Erlang equations. The generator can be used for test production in various systems. Features of multidimensional random vectors, produced by the generator, are discussed.
Quantum random number generators and their use in cryptography
Stipcevic, Mario
2011-01-01
Random number generators (RNG) are an important resource in many areas: cryptography (both quantum and classical), probabilistic computation (Monte Carlo methods), numerical simulations, industrial testing and labeling, hazard games, scientific research, etc. Because today's computers are deterministic, they can not create random numbers unless complemented with a RNG. Randomness of a RNG can be precisely, scientifically characterized and measured. Especially valuable is the information-theoretic provable RNG (True RNG - TRNG) which, at state of the art, seem to be possible only by use of physical randomness inherent to certain (simple) quantum systems. On the other hand, current industry standard dictates use of RNG's based on free running oscillators (FRO) whose randomness is derived from electronics noise present in logic circuits and which cannot be strictly proven. This approach is currently used in 3-rd and 4-th generation FPGA and ASIC hardware, unsuitable for realization of quantum TRNG. We compare we...
Saturation of number variance in embedded random-matrix ensembles.
Prakash, Ravi; Pandey, Akhilesh
2016-05-01
We study fluctuation properties of embedded random matrix ensembles of noninteracting particles. For ensemble of two noninteracting particle systems, we find that unlike the spectra of classical random matrices, correlation functions are nonstationary. In the locally stationary region of spectra, we study the number variance and the spacing distributions. The spacing distributions follow the Poisson statistics, which is a key behavior of uncorrelated spectra. The number variance varies linearly as in the Poisson case for short correlation lengths but a kind of regularization occurs for large correlation lengths, and the number variance approaches saturation values. These results are known in the study of integrable systems but are being demonstrated for the first time in random matrix theory. We conjecture that the interacting particle cases, which exhibit the characteristics of classical random matrices for short correlation lengths, will also show saturation effects for large correlation lengths.
Saturation of number variance in embedded random-matrix ensembles
Prakash, Ravi; Pandey, Akhilesh
2016-05-01
We study fluctuation properties of embedded random matrix ensembles of noninteracting particles. For ensemble of two noninteracting particle systems, we find that unlike the spectra of classical random matrices, correlation functions are nonstationary. In the locally stationary region of spectra, we study the number variance and the spacing distributions. The spacing distributions follow the Poisson statistics, which is a key behavior of uncorrelated spectra. The number variance varies linearly as in the Poisson case for short correlation lengths but a kind of regularization occurs for large correlation lengths, and the number variance approaches saturation values. These results are known in the study of integrable systems but are being demonstrated for the first time in random matrix theory. We conjecture that the interacting particle cases, which exhibit the characteristics of classical random matrices for short correlation lengths, will also show saturation effects for large correlation lengths.
Social Noise: Generating Random Numbers from Twitter Streams
Fernández, Norberto; Quintas, Fernando; Sánchez, Luis; Arias, Jesús
2015-12-01
Due to the multiple applications of random numbers in computer systems (cryptography, online gambling, computer simulation, etc.) it is important to have mechanisms to generate these numbers. True Random Number Generators (TRNGs) are commonly used for this purpose. TRNGs rely on non-deterministic sources to generate randomness. Physical processes (like noise in semiconductors, quantum phenomenon, etc.) play this role in state of the art TRNGs. In this paper, we depart from previous work and explore the possibility of defining social TRNGs using the stream of public messages of the microblogging service Twitter as randomness source. Thus, we define two TRNGs based on Twitter stream information and evaluate them using the National Institute of Standards and Technology (NIST) statistical test suite. The results of the evaluation confirm the feasibility of the proposed approach.
On the number of spanning trees in random regular graphs
DEFF Research Database (Denmark)
Greenhill, Catherine; Kwan, Matthew; Wind, David Kofoed
2014-01-01
Let d >= 3 be a fixed integer. We give an asympotic formula for the expected number of spanning trees in a uniformly random d-regular graph with n vertices. (The asymptotics are as n -> infinity, restricted to even n if d is odd.) We also obtain the asymptotic distribution of the number of spanni...
Random number generators for massively parallel simulations on GPU
Manssen, Markus; Hartmann, Alexander K
2012-01-01
High-performance streams of (pseudo) random numbers are crucial for the efficient implementation for countless stochastic algorithms, most importantly, Monte Carlo simulations and molecular dynamics simulations with stochastic thermostats. A number of implementations of random number generators has been discussed for GPU platforms before and some generators are even included in the CUDA supporting libraries. Nevertheless, not all of these generators are well suited for highly parallel applications where each thread requires its own generator instance. For this specific situation encountered, for instance, in simulations of lattice models, most of the high-quality generators with large states such as Mersenne twister cannot be used efficiently without substantial changes. We provide a broad review of existing CUDA variants of random-number generators and present the CUDA implementation of a new massively parallel high-quality, high-performance generator with a small memory load overhead.
Experimental measurement-device-independent quantum random-number generation
Nie, You-Qi; Guan, Jian-Yu; Zhou, Hongyi; Zhang, Qiang; Ma, Xiongfeng; Zhang, Jun; Pan, Jian-Wei
2016-12-01
The randomness from a quantum random-number generator (QRNG) relies on the accurate characterization of its devices. However, device imperfections and inaccurate characterizations can result in wrong entropy estimation and bias in practice, which highly affects the genuine randomness generation and may even induce the disappearance of quantum randomness in an extreme case. Here we experimentally demonstrate a measurement-device-independent (MDI) QRNG based on time-bin encoding to achieve certified quantum randomness even when the measurement devices are uncharacterized and untrusted. The MDI-QRNG is randomly switched between the regular randomness generation mode and a test mode, in which four quantum states are randomly prepared to perform measurement tomography in real time. With a clock rate of 25 MHz, the MDI-QRNG generates a final random bit rate of 5.7 kbps. Such implementation with an all-fiber setup provides an approach to construct a fully integrated MDI-QRNG with trusted but error-prone devices in practice.
Law of large numbers for non-elliptic random walks in dynamic random environments
Hollander, Frank den; Sidoravicius, Vladas
2011-01-01
We prove a law of large numbers for a class of $\\Z^d$-valued random walks in dynamic random environments, including \\emph{non-elliptic} examples. We assume that the random environment has a mixing property called \\emph{conditional cone-mixing} and that the random walk tends to stay inside space-time cones. The proof is based on a generalization of the regeneration scheme developed by Comets and Zeitouni for static random environments, which was adapted by Avena, den Hollander and Redig to dynamic random environments. We exhibit some one-dimensional examples to which our result applies. In some cases, the sign of the speed can be determined.
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
A Random Number Generator Based on Quantum Entangled Photon Pairs
Institute of Scientific and Technical Information of China (English)
MA Hai-Qiang; WANG Su-Mei; ZHANG Da; CHANG Jun-Tao; JI Ling-Ling; HOU Yan-Xue; WU Ling-An
2004-01-01
A new scheme for a random number generator based on quantum entangled photon pairs is demonstrated.Signal photons produced by optical parametric down-conversion are detected at two single-photon detectors after transmission or reflection at a 50/50% beamsplitter, to form a truly random binary sequence. Their arrival is signalled by their twin idler photons, so that a cw laser source may be used instead of attenuated laser pulses.Coincidence measurement is employed to obtain the bit sequences, which are shown to fully satisfy the standard tests for randomness.
Source-Device-Independent Ultrafast Quantum Random Number Generation
Marangon, Davide G.; Vallone, Giuseppe; Villoresi, Paolo
2017-02-01
Secure random numbers are a fundamental element of many applications in science, statistics, cryptography and more in general in security protocols. We present a method that enables the generation of high-speed unpredictable random numbers from the quadratures of an electromagnetic field without any assumption on the input state. The method allows us to eliminate the numbers that can be predicted due to the presence of classical and quantum side information. In particular, we introduce a procedure to estimate a bound on the conditional min-entropy based on the entropic uncertainty principle for position and momentum observables of infinite dimensional quantum systems. By the above method, we experimentally demonstrated the generation of secure true random bits at a rate greater than 1.7 Gbit /s .
Classical probabilistic realization of “Random Numbers Certified by Bell's Theorem”
Khrennikov, Andrei
2015-07-01
We question the commonly accepted statement that random numbers certified by Bell's theorem carry some special sort of randomness, so to say, quantum randomness or intrinsic randomness. We show that such numbers can be easily generated by classical random generators.
Pseudo Random Number Generator Based on Back Propagation Neural Network
Institute of Scientific and Technical Information of China (English)
WANG Bang-ju; WANG Yu-hua; NIU Li-ping; ZHANG Huan-guo
2007-01-01
Random numbers play an increasingly important role in secure wire and wireless communication.Thus the design quality of random number generator(RNG) is significant in information security.A novel pseudo RNG is proposed for improving the security of network communication.The back propagation neural network(BPNN) is nonlinear,which can be used to improve the traditional RNG.The novel pseudo RNG is based on BPNN techniques.The result of test suites standardized by the U.S shows that the RNG can satisfy the security of communication.
Physical Unclonable Function (PUF) Based Random Number Generator
Sadr, Ali
2012-01-01
Physical Unclonable Functions (PUFs) are widely used to generate random Numbers. In this paper we propose a new architecture in which an Arbiter Based PUF has been employed as a nonlinear function in Nonlinear Feedback Shift Register (NFSR) to generate true random numbers. The rate of producing the output bit streams is 10 million bits per second. The proposed RNG is able to pass all NIST tests and the entropy of the output stream is 7.999837 bits per byte. The proposed circuit has very low resource usage of 193 Slices that makes it suitable for lightweight applications.
Pseudorandom Number Generators for Mobile Devices: An Examination and Attempt to Improve Randomness
2013-09-01
the positions but how the m- sequences (shaded) are equal. Also note how in the Fibonacci LSFR the sequences at the different positions are the...improve the random properties of the output m- sequence of linear feedback shift registers. A couple of possible attacks on pseudorandom number generators...generator normally used to improve the random properties of the output m- sequence of linear feedback shift registers. A couple of possible attacks on
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.
Quantum random number generators and their applications in cryptography
Stipcevic, Mario
2012-06-01
Random number generators (RNG) are an important resource in many areas: cryptography (both quantum and classical), probabilistic computation (Monte Carlo methods), numerical simulations, industrial testing and labeling, hazard games, scientific research etc. Because today's computers are deterministic, they can not create random numbers unless complemented with a physical RNG. Randomness of a RNG can be defined and scientifically characterized and measured. Especially valuable is the information-theoretic provable RNG which, at state of the art, seem to be possible only by harvest of randomness inherent to certain (simple) quantum systems and such a generator we call Quantum RNG (QRNG). On the other hand, current industry standards dictate use of RNGs based on free running oscillators (FRO) whose randomness is derived from electronics noise present in logic circuits and which, although quantum in nature, cannot be strictly proven. This approach is currently used in FPGA and ASIC chips. We compare weak and strong aspects of the two approaches for use in cryptography and in general. We also give an alternative definition of randomness, discuss usage of single photon detectors in realization of QRNGs and give several examples where QRNG can significantly improve security of a cryptographic system.
Quantum Random Numbers Guaranteed by Kochen-Specker Theorem
Um, Mark; Zhang, Xiang; Zhang, Junhua; Wang, Ye; Shen, Yang-Chao; Deng, Dong-Ling; Duan, Lu-Ming; Kim, Kihwan; CQI Team
2013-05-01
We present a random number generator certified by Kochen-Specker (KS) theorem with a trapped ion system. Outcomes of quantum theory are intrinsically random and can be used to produce genuine randomness. In real implementation, however, the true randomness is inevitably mingled with classical noise or control imperfection and cannot be decisively certified. The KS inequality differentiates the results of quantum mechanics from those of classical theory, non-contextual in nature. We demonstrate the experimental violations of the KS inequality, in particular, the Klyachko-Can-Binicioglu-Shumovsky (KCBS) inequality without the detection loophole and reasonably without the compatibility loophole. The violations are used to certify the randomness of a generated string. As a proof of principle, we produce 1 × 105 random numbers that contain 5.2 × 104 bits of minimum entropy. This work was supported by the National Basic Research Program of China Grant 2011CBA00300, 2011CBA00301, 2011CBA00302, the National Natural Science Foundation of China Grant 61073174, 61033001, 61061130540. KK acknowledges the support of the Thousand Young Talents plan.
Security of Semi-Device-Independent Random Number Expansion Protocols
Li, Dan-Dan; Wen, Qiao-Yan; Wang, Yu-Kun; Zhou, Yu-Qian; Gao, Fei
2015-01-01
Semi-device-independent random number expansion (SDI-RNE) protocols require some truly random numbers to generate fresh ones, with making no assumptions on the internal working of quantum devices except for the dimension of the Hilbert space. The generated randomness is certified by non-classical correlation in the prepare-and-measure test. Until now, the analytical relations between the amount of the generated randomness and the degree of non-classical correlation, which are crucial for evaluating the security of SDI-RNE protocols, are not clear under both the ideal condition and the practical one. In the paper, first, we give the analytical relation between the above two factors under the ideal condition. As well, we derive the analytical relation under the practical conditions, where devices’ behavior is not independent and identical in each round and there exists deviation in estimating the non-classical behavior of devices. Furthermore, we choose a different randomness extractor (i.e., two-universal random function) and give the security proof. PMID:26503335
Von Neumann Normalisation of a Quantum Random Number Generator
Abbott, Alastair A
2011-01-01
In this paper we study von Neumann un-biasing normalisation for ideal and real quantum random number generators, operating on finite strings or infinite bit sequences. In the ideal cases one can obtain the desired un-biasing. This relies critically on the independence of the source, a notion we rigorously define for our model. In real cases, affected by imperfections in measurement and hardware, one cannot achieve a true un-biasing, but, if the bias "drifts sufficiently slowly", the result can be arbitrarily close to un-biasing. For infinite sequences, normalisation can both increase or decrease the (algorithmic) randomness of the generated sequences. A successful application of von Neumann normalisation-in fact, any un-biasing transformation-does exactly what it promises, un-biasing, one (among infinitely many) symptoms of randomness; it will not produce "true" randomness.
Fault tolerant quantum random number generator certified by Majorana fermions
Deng, Dong-Ling; Duan, Lu-Ming
2013-03-01
Braiding of Majorana fermions gives accurate topological quantum operations that are intrinsically robust to noise and imperfection, providing a natural method to realize fault-tolerant quantum information processing. Unfortunately, it is known that braiding of Majorana fermions is not sufficient for implementation of universal quantum computation. Here we show that topological manipulation of Majorana fermions provides the full set of operations required to generate random numbers by way of quantum mechanics and to certify its genuine randomness through violation of a multipartite Bell inequality. The result opens a new perspective to apply Majorana fermions for robust generation of certified random numbers, which has important applications in cryptography and other related areas. This work was supported by the NBRPC (973 Program) 2011CBA00300 (2011CBA00302), the IARPA MUSIQC program, the ARO and the AFOSR MURI program.
Enhanced security for multi-detector quantum random number generators
Marangon, Davide G.; Vallone, Giuseppe; Zanforlin, Ugo; Villoresi, Paolo
2016-11-01
Quantum random number generators (QRNG) represent an advanced solution for randomness generation, which is essential in every cryptographic application. In this context, integrated arrays of single-photon detectors have promising applications as QRNGs based on the spatial detection of photons. For the employment of QRNGs in cryptography, it is necessary to have efficient methods to evaluate the so-called quantum min-entropy that corresponds to the amount of the true extractable quantum randomness from the QRNG. Here, we present an efficient method that allows the estimation of the quantum min-entropy for a multi-detector QRNG. In particular, we consider a scenario in which an attacker can control the efficiency of the detectors and knows the emitted number of photons. Eventually, we apply the method to a QRNG with 103 detectors.
Robust Quantum Random Number Generator Based on Avalanche Photodiodes
Wang, Fang-Xiang; Wang, Chao; Chen, Wei; Wang, Shuang; Lv, Fu-Sheng; He, De-Yong; Yin, Zhen-Qiang; Li, Hong-Wei; Guo, Guang-Can; Han, Zheng-Fu
2015-08-01
We propose and demonstrate a scheme to realize a high-efficiency truly quantum random number generator (RNG) at room temperature (RT). Using an effective extractor with simple time bin encoding method, the avalanche pulses of avalanche photodiode (APD) are converted into high-quality random numbers (RNs) that are robust to slow varying noise such as fluctuations of pulse intensity and temperature. A light source is compatible but not necessary in this scheme. Therefor the robustness of the system is effective enhanced. The random bits generation rate of this proof-of-principle system is 0.69 Mbps with double APDs and 0.34 Mbps with single APD. The results indicate that a high-speed RNG chip based on the scheme is potentially available with an integrable APD array.
Random number generation in native and foreign languages.
Strenge, Hans; Bohm, Jessica
2004-06-01
The effects of different levels of language proficiency on random number generation were examined in this study. 16 healthy right-handed students (7 women, 9 men; aged 22 to 25 years, M=23.8, SD=.83) attempted to generate a random sequence of the digits 1 to 9 at pacing frequencies of 1, 1.5, and 2 Hz. Randomization was done in German (native language L1), English (first foreign language L2), and French (second foreign language L3). There was a pattern of redundancy and seriation tendencies, increasing with speed of generation for all languages (L1-L3). While using L2 and L3, responses slowed and the number of errors committed increased. Further, there was a peculiar pattern of dissociation in nonrandom performance with an increase of habitual counting in ones and a strong reduction of counting in twos. All effects were most pronounced when subjects used L3 and 2-Hz pacing rates. Slowing and nonrandomness was not correlated with self-assessment parameters regarding language proficiency. We suggest that in a task involving number activation in a nonnative language, lack of proficiency will interfere with random number generation, leading to interruptions and rule breaking, at least when reaching the limits of attentional capacity at higher pacing rates.
The strong law of large numbers for random quadratic forms
Mikosch, T
1996-01-01
The paper establishes strong laws of large numbers for the quadratic forms [GRAPHICS] and the bilinear forms [GRAPHICS] where X = (X(n)) is a sequence of independent random variables and Y = (Y-n) is an independent copy of it. In the case of independent identically distributed symmetric p-stable ran
The strong law of large numbers for random quadratic forms
Mikosch, T
1996-01-01
The paper establishes strong laws of large numbers for the quadratic forms [GRAPHICS] and the bilinear forms [GRAPHICS] where X = (X(n)) is a sequence of independent random variables and Y = (Y-n) is an independent copy of it. In the case of independent identically distributed symmetric p-stable
Relationships between nonlinear normal modes and response to random inputs
Schoneman, Joseph D.; Allen, Matthew S.; Kuether, Robert J.
2017-02-01
The ability to model nonlinear structures subject to random excitation is of key importance in designing hypersonic aircraft and other advanced aerospace vehicles. When a structure is linear, superposition can be used to construct its response to a known spectrum in terms of its linear modes. Superposition does not hold for a nonlinear system, but several works have shown that a system's dynamics can still be understood qualitatively in terms of its nonlinear normal modes (NNMs). This work investigates the connection between a structure's undamped nonlinear normal modes and the spectrum of its response to high amplitude random forcing. Two examples are investigated: a spring-mass system and a clamped-clamped beam modeled within a geometrically nonlinear finite element package. In both cases, an intimate connection is observed between the smeared peaks in the response spectrum and the frequency-energy dependence of the nonlinear normal modes. In order to understand the role of coupling between the underlying linear modes, reduced order models with and without modal coupling terms are used to separate the effect of each NNM's backbone from the nonlinear couplings that give rise to internal resonances. In the cases shown here, uncoupled, single-degree-of-freedom nonlinear models are found to predict major features in the response with reasonable accuracy; a highly inexpensive approximation such as this could be useful in design and optimization studies. More importantly, the results show that a reduced order model can be expected to give accurate results only if it is also capable of accurately predicting the frequency-energy dependence of the nonlinear modes that are excited.
Number of distinct sites visited by a subdiffusive random walker.
Yuste, Santos Bravo; Klafter, J; Lindenberg, Katja
2008-03-01
The asymptotic mean number of distinct sites visited by a subdiffusive continuous-time random walker in two dimensions seems not to have been explicitly calculated anywhere in the literature. This number has been calculated for other dimensions for only one specific asymptotic behavior of the waiting time distribution between steps. We present an explicit derivation for two cases in all integer dimensions so as to formally complete a tableau of results. In this tableau we include the dominant as well as subdominant contributions in all integer dimensions. Other quantities that can be calculated from the mean number of distinct sites visited are also discussed.
On the number of connected components of random algebraic hypersurfaces
Fyodorov, Yan V.; Lerario, Antonio; Lundberg, Erik
2015-09-01
We study the expectation of the number of components b0(X) of a random algebraic hypersurface X defined by the zero set in projective space RPn of a random homogeneous polynomial f of degree d. Specifically, we consider invariant ensembles, that is Gaussian ensembles of polynomials that are invariant under an orthogonal change of variables. Fixing n, under some rescaling assumptions on the family of ensembles (as d → ∞), we prove that Eb0(X) has the same order of growth as [ Eb0(X ∩ RP1) ] n. This relates the average number of components of X to the classical problem of M. Kac (1943) on the number of zeros of the random univariate polynomial f|RP1. The proof requires an upper bound for Eb0(X), which we obtain by counting extrema using Random Matrix Theory methods from Fyodorov (2013), and it also requires a lower bound, which we obtain by a modification of the barrier method from Lerario and Lundberg (2015) and Nazarov and Sodin (2009). We also provide quantitative upper bounds on implied constants; for the real Fubini-Study model these estimates provide super-exponential decay (as n → ∞) of the leading coefficient (in d) of Eb0(X) .
Directory of Open Access Journals (Sweden)
Pavel Etingof
2007-03-01
Full Text Available Following the works by Wiegmann-Zabrodin, Elbau-Felder, Hedenmalm-Makarov, and others, we consider the normal matrix model with an arbitrary potential function, and explain how the problem of finding the support domain for the asymptotic eigenvalue density of such matrices (when the size of the matrices goes to infinity is related to the problem of Hele-Shaw flows on curved surfaces, considered by Entov and the first author in 1990-s. In the case when the potential function is the sum of a rotationally invariant function and the real part of a polynomial of the complex coordinate, we use this relation and the conformal mapping method developed by Entov and the first author to find the shape of the support domain explicitly (up to finitely many undetermined parameters, which are to be found from a finite system of equations. In the case when the rotationally invariant function is βz^2, this is done by Wiegmann-Zabrodin and Elbau-Felder. We apply our results to the generalized normal matrix model, which deals with random block matrices that give rise to *-representations of the deformed preprojective algebra of the affine quiver of type Â_{m-1}. We show that this model is equivalent to the usual normal matrix model in the large N limit. Thus the conformal mapping method can be applied to find explicitly the support domain for the generalized normal matrix model.
Miszczak, Jarosław Adam
2013-01-01
The presented package for the Mathematica computing system allows the harnessing of quantum random number generators (QRNG) for investigating the statistical properties of quantum states. The described package implements a number of functions for generating random states. The new version of the package adds the ability to use the on-line quantum random number generator service and implements new functions for retrieving lists of random numbers. Thanks to the introduced improvements, the new version provides faster access to high-quality sources of random numbers and can be used in simulations requiring large amount of random data. New version program summaryProgram title: TRQS Catalogue identifier: AEKA_v2_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEKA_v2_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 18 134 No. of bytes in distributed program, including test data, etc.: 2 520 49 Distribution format: tar.gz Programming language: Mathematica, C. Computer: Any supporting Mathematica in version 7 or higher. Operating system: Any platform supporting Mathematica; tested with GNU/Linux (32 and 64 bit). RAM: Case-dependent Supplementary material: Fig. 1 mentioned below can be downloaded. Classification: 4.15. External routines: Quantis software library (http://www.idquantique.com/support/quantis-trng.html) Catalogue identifier of previous version: AEKA_v1_0 Journal reference of previous version: Comput. Phys. Comm. 183(2012)118 Does the new version supersede the previous version?: Yes Nature of problem: Generation of random density matrices and utilization of high-quality random numbers for the purpose of computer simulation. Solution method: Use of a physical quantum random number generator and an on-line service providing access to the source of true random
Maximization of Extractable Randomness in a Quantum Random-Number Generator
Haw, J. Y.; Assad, S. M.; Lance, A. M.; Ng, N. H. Y.; Sharma, V.; Lam, P. K.; Symul, T.
2015-05-01
The generation of random numbers via quantum processes is an efficient and reliable method to obtain true indeterministic random numbers that are of vital importance to cryptographic communication and large-scale computer modeling. However, in realistic scenarios, the raw output of a quantum random-number generator is inevitably tainted by classical technical noise. The integrity of the device can be compromised if this noise is tampered with or even controlled by some malicious party. To safeguard against this, we propose and experimentally demonstrate an approach that produces side-information-independent randomness that is quantified by min-entropy conditioned on this classical noise. We present a method for maximizing the conditional min entropy of the number sequence generated from a given quantum-to-classical-noise ratio. The detected photocurrent in our experiment is shown to have a real-time random-number generation rate of 14 (Mb i t /s )/MHz . The spectral response of the detection system shows the potential to deliver more than 70 Gbit /s of random numbers in our experimental setup.
A Quantum Random Number Generator Certified by Value Indefiniteness
Abbott, Alastair A; Svozil, Karl
2010-01-01
In this paper we propose a quantum random number generator (QRNG) which utilizes an entangled photon pair in a Bell singlet state, and is certified explicitly by value indefiniteness. While "true randomness" is a mathematical impossibility, the certification by value indefiniteness ensures the quantum random bits are incomputable in the strongest sense. This is the first QRNG setup in which a physical principle (Kochen-Specker value indefiniteness) guarantees that no single quantum bit produced can be classically computed (reproduced and validated), the mathematical form of bitwise physical unpredictability. The effects of various experimental imperfections are discussed in detail, particularly those related to detector efficiencies, context alignment and temporal correlations between bits. The analysis is to a large extent relevant for the construction of any QRNG based on beam-splitters. By measuring the two entangled photons in maximally misaligned contexts and utilizing the fact that two rather than one b...
Cieśla, Michał
2016-11-01
The properties of the number of iterations in random sequential adsorption protocol needed to generate finite saturated random packing of spherically symmetric shapes were studied. Numerical results obtained for one, two, and three dimensional packings were supported by analytical calculations valid for any dimension d. It has been shown that the number of iterations needed to generate finite saturated packing is subject to Pareto distribution with exponent -1-1/d and the median of this distribution scales with packing size according to the power-law characterized by exponent d. Obtained results can be used in designing effective random sequential adsorption simulations.
The average crossing number of equilateral random polygons
Diao, Y.; Dobay, A.; Kusner, R. B.; Millett, K.; Stasiak, A.
2003-11-01
In this paper, we study the average crossing number of equilateral random walks and polygons. We show that the mean average crossing number ACN of all equilateral random walks of length n is of the form \\frac{3}{16} n \\ln n +O(n) . A similar result holds for equilateral random polygons. These results are confirmed by our numerical studies. Furthermore, our numerical studies indicate that when random polygons of length n are divided into individual knot types, the \\langle ACN({\\cal K})\\rangle for each knot type \\cal K can be described by a function of the form \\langle ACN({\\cal K})\\rangle=a (n-n_0) \\ln (n-n_0)+b (n-n_0)+c where a, b and c are constants depending on \\cal K and n0 is the minimal number of segments required to form \\cal K . The \\langle ACN({\\cal K})\\rangle profiles diverge from each other, with more complex knots showing higher \\langle ACN({\\cal K})\\rangle than less complex knots. Moreover, the \\langle ACN({\\cal K})\\rangle profiles intersect with the langACNrang profile of all closed walks. These points of intersection define the equilibrium length of \\cal K , i.e., the chain length n_e({\\cal K}) at which a statistical ensemble of configurations with given knot type \\cal K —upon cutting, equilibration and reclosure to a new knot type \\cal K^\\prime —does not show a tendency to increase or decrease \\langle ACN({\\cal K^\\prime)}\\rangle . This concept of equilibrium length seems to be universal, and applies also to other length-dependent observables for random knots, such as the mean radius of gyration langRgrang.
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.
A Realizable Modified Tent Map for True Random Number Generation
Nejati, Hamid; Beirami, Ahmad; Massoud, Yehia
2012-01-01
Tent map is a discrete-time piecewise-affine I/O characteristic curve, which is used for chaos-based applications, such as true random number generation. However, tent map suffers from the inability to maintain the output state confined to the input range under noise and process variations. In this paper, we propose a modified tent map, which is interchangeable with the tent map for practical applications. In the proposed modified tent map, the confinement problem is solved while maintaining ...
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.
Note on Marsaglia\\'s Xorshift Random Number Generators
Brent, Richard P.
2004-01-01
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.
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.
Efficient and robust quantum random number generation by photon number detection
Applegate, M. J.; Thomas, O.; Dynes, J. F.; Yuan, Z. L.; Ritchie, D. A.; Shields, A. J.
2015-08-01
We present an efficient and robust quantum random number generator based upon high-rate room temperature photon number detection. We employ an electric field-modulated silicon avalanche photodiode, a type of device particularly suited to high-rate photon number detection with excellent photon number resolution to detect, without an applied dead-time, up to 4 photons from the optical pulses emitted by a laser. By both measuring and modeling the response of the detector to the incident photons, we are able to determine the illumination conditions that achieve an optimal bit rate that we show is robust against variation in the photon flux. We extract random bits from the detected photon numbers with an efficiency of 99% corresponding to 1.97 bits per detected photon number yielding a bit rate of 143 Mbit/s, and verify that the extracted bits pass stringent statistical tests for randomness. Our scheme is highly scalable and has the potential of multi-Gbit/s bit rates.
The random walk of a low-Reynolds-number swimmer
Rafaï, Salima; Garcia, Michaël; Berti, Stefano; Peyla, Philippe
2010-11-01
Swimming at a micrometer scale demands particular strategies. Indeed when inertia is negligible as compared to viscous forces (i.e. Reynolds number Re is lower than unity), hydrodynamics equations are reversible in time. To achieve propulsion a low Reynolds number, swimmers must then deform in a way that is not invariant under time reversal. Here we investigate the dispersal properties of self propelled organisms by means of microscopy and cell tracking. Our system of interest is the microalga Chlamydomonas Reinhardtii, a motile single celled green alga about 10 micrometers in diameter that swims with two flagellae. In the case of dilute suspensions, we show that tracked trajectories are well modelled by a correlated random walk. This process is based on short time correlations in the direction of movement called persistence. At longer times, correlations are lost and a standard random walk caracterizes the trajectories. Moreover, high speed imaging enables us to show how speed fluctuations at very short times affect the statistical description of the dynamics. Finally we show how drag forces modify the characteristics of this particular random walk.
On the game chromatic number of sparse random graphs
Frieze, Alan; Lavrov, Mikhail
2012-01-01
Given a graph G and an integer k, two players take turns coloring the vertices of G one by one using k colors so that neighboring vertices get different colors. The first player wins iff at the end of the game all the vertices of $G$ are colored. The game chromatic number \\chi_g(G) is the minimum k for which the first player has a winning strategy. The paper \\cite{BFS} began the analysis of the asymptotic behavior of this parameter for a random graph G_{n,p}. This paper provides some further analysis for graphs with constant average degree i.e. np=O(1) and for random regular graphs.
Semi-device independent random number expansion protocol with n to 1 quantum random access codes
Li, Hong-Wei; Yin, Zhen-Qiang; Guo, Guang-Can; Han, Zheng-Fu
2011-01-01
We study random number expansion protocols based on the n to 1 quantum random access codes (QRACs). We consider them in the semi-device independent scenario where the inner workings of the devices are unknown to us but we can certify the dimensions of the systems being communicated. This approach does not require the use of the entanglement and makes the physical realization of these protocols much easier than in the standard device independent scenario. We calculate the dependence of the effectiveness of the randomness generation on $n$ and find it optimal for n=3. We provide the explanation for this fact.
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.
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 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 statistical testing of a quantum random number generator
Humble, Travis S.
2014-10-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 operation 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.
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.
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.
Theory, Methods and Tools for Statistical Testing of Pseudo and Quantum Random Number Generators
Jakobsson, Krister Sune
2014-01-01
Statistical random number testing is a well studied field focusing on pseudo-random number generators, that is to say algorithms that produce random-looking sequences of numbers. These generators tend to have certain kinds of flaws, which have been exploited through rigorous testing. Such testing has led to advancements, and today pseudo random number generators are both very high-speed and produce seemingly random numbers. Recent advancements in quantum physics have opened up new doors, wher...
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.
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.
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.
DEFF Research Database (Denmark)
Christensen, Martin Gram; Adler-Nissen, Jens
2015-01-01
This paper presents a normalization of the Biot number, which enables the Fourier exponents to be fitted with a simple 3rd order polynomial (R2 > 0.9999). The method is validated for Biot numbers ranging from 0.02 to 8, and presented graphically for both the Fourier exponents and the lag factors...
Sample size in orthodontic randomized controlled trials: are numbers justified?
Koletsi, Despina; Pandis, Nikolaos; Fleming, Padhraig S
2014-02-01
Sample size calculations are advocated by the Consolidated Standards of Reporting Trials (CONSORT) group to justify sample sizes in randomized controlled trials (RCTs). This study aimed to analyse the reporting of sample size calculations in trials published as RCTs in orthodontic speciality journals. The performance of sample size calculations was assessed and calculations verified where possible. Related aspects, including number of authors; parallel, split-mouth, or other design; single- or multi-centre study; region of publication; type of data analysis (intention-to-treat or per-protocol basis); and number of participants recruited and lost to follow-up, were considered. Of 139 RCTs identified, complete sample size calculations were reported in 41 studies (29.5 per cent). Parallel designs were typically adopted (n = 113; 81 per cent), with 80 per cent (n = 111) involving two arms and 16 per cent having three arms. Data analysis was conducted on an intention-to-treat (ITT) basis in a small minority of studies (n = 18; 13 per cent). According to the calculations presented, overall, a median of 46 participants were required to demonstrate sufficient power to highlight meaningful differences (typically at a power of 80 per cent). The median number of participants recruited was 60, with a median of 4 participants being lost to follow-up. Our finding indicates good agreement between projected numbers required and those verified (median discrepancy: 5.3 per cent), although only a minority of trials (29.5 per cent) could be examined. Although sample size calculations are often reported in trials published as RCTs in orthodontic speciality journals, presentation is suboptimal and in need of significant improvement.
High-resolution copy number arrays in cancer and the problem of normal genome copy number variation.
Gorringe, Kylie L; Campbell, Ian G
2008-11-01
High-resolution techniques for analysis of genome copy number (CN) enable the analysis of complex cancer somatic genetics. However, the analysis of these data is difficult, and failure to consider a number of issues in depth may result in false leads or unnecessary rejection of true positives. First, segmental duplications may falsely generate CN breakpoints in aneuploid samples. Second, even when tumor data were each normalized to matching lymphocyte DNA, we still observed copy number polymorphisms masquerading as somatic alterations due to allelic imbalance. We investigated a number of different solutions and determined that evaluating matching normal DNA, or at least using locally derived normal baseline data, were preferable to relying on current online databases because of poor cross-platform compatibility and the likelihood of excluding genuine small somatic alterations.
Using Daphnia bio-sensor for random number generation
Directory of Open Access Journals (Sweden)
Đorđević Đorđe
2013-01-01
Full Text Available One of the most used bioassays for toxicity screening of chemicals and for toxicity monitoring of effluents and contaminated waters is the acute toxicity test performed with Daphnia Magna. Standard methods have been developed and gradually improved by national and international organizations dealing with toxicity testing procedure, in view of its application within a regulatory framework. As for all toxicity tests, the organisms used for the acute Daphnia magna assay have to be obtained from live stocks which are cultured in the laboratory on live food (micro-algae. The technical and biological problems inherent in year-round culturing and the culturing/maintenance costs of live stocks restricts its application to a limited number of highly specialized laboratories. This bottleneck in toxicity testing triggered investigations forward the concept of "microbiotests" or "small-scale" toxicity tests. This paper deals with the measurement of changes in the behavior of Daphniae using device BIOTOXINOMER, awarded by Ministry for Science and Technological Development of Republic Serbia with Diploma for best Innovation idea in year 2010 in category Medicine, Health, and Ecology. Actually, the main topic is digitalization of bio-monitoring results and random number generating on the base of Daphniae movement (distance. The on-line monitoring is available on site www.dundjer.co.rs/Daphniae and open-source software support is available on the same site. [Projekat Ministarstva nauke Republike Srbije, br. III44006 i br. TR37003
Directory of Open Access Journals (Sweden)
W.J. Hurley
2007-09-01
Full Text Available The normal approximation for a sum of geometric random variables has been examined. Thisapproximation is relevant to the determination of direct-fire ammunition stockpile levels in adefence setting. Among the methodologies available for this assessment, one is a target-orientedmethodology. This approach calculates the number of rounds necessary to destroy a givenfraction of the enemy force and infrastructure. The difficulty is that the number of rounds requiredcannot be determined analytically. An obvious numeric approach is Monte Carlo simulation.Another is the approximation approach which has several advantages like it is easy to implement.and is accurate even in the case where the number of targets is low.
A New Distribution-Random Limit Normal Distribution
Gong, Xiaolin; Yang, Shuzhen
2013-01-01
This paper introduces a new distribution to improve tail risk modeling. Based on the classical normal distribution, we define a new distribution by a series of heat equations. Then, we use market data to verify our model.
On the Hausdorff dimension of countable intersections of certain sets of normal numbers
Mance, Bill
2013-01-01
We show that the set of numbers that are $Q$-distribution normal but not simply $Q$-ratio normal has full Hausdorff dimension. It is further shown under some conditions that countable intersections of sets of this form still have full Hausdorff dimension even though they are not winning sets (in the sense of W. Schmidt). As a consequence of this, we construct many explicit examples of numbers that are simultaneously distribution normal but not simply ratio normal with respect to certain count...
Construction of normal numbers with respect to the $Q$-Cantor series expansion for certain $Q$
Mance, Bill
2009-01-01
A. Renyi \\cite{Renyi} made a definition that gives one generalization of simple normality in the context of $Q$-Cantor series. Similarly, in this paper we give a definition which generalizes the notion of normality in the context of $Q$-Cantor series. We will prove a theorem that allows us to concatenate sequences of digits that have a special property to give us the digits of a $Q$-normal number for certain $Q$. We will then use this theorem to construct a Q and a real number $x$ that is $Q$-normal.
Asymptotic normality of the size of the giant component in a random hypergraph
Bollobas, Bela
2011-01-01
Recently, we adapted random walk arguments based on work of Nachmias and Peres, Martin-L\\"of, Karp and Aldous to give a simple proof of the asymptotic normality of the size of the giant component in the random graph $G(n,p)$ above the phase transition. Here we show that the same method applies to the analogous model of random $k$-uniform hypergraphs, establishing asymptotic normality throughout the (sparse) supercritical regime. Previously, asymptotic normality was known only towards the two ends of this regime.
A generator for unique quantum random numbers based on vacuum states
Gabriel, Christian; Wittmann, Christoffer; Sych, Denis; Dong, Ruifang; Mauerer, Wolfgang; Andersen, Ulrik L.; Marquardt, Christoph; Leuchs, Gerd
2010-10-01
Random numbers are a valuable component in diverse applications that range from simulations over gambling to cryptography. 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. 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. Here we present a simple experimental setup based on homodyne measurements that uses 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 unique randomness, are important attributes for achieving high-reliability, high-speed and low-cost quantum random number generators.
Li, Yanbin; Mulani, Sameer B.; Kapania, Rakesh K.; Fei, Qingguo; Wu, Shaoqing
2017-07-01
An algorithm that integrates Karhunen-Loeve expansion (KLE) and the finite element method (FEM) is proposed to perform non-stationary random vibration analysis of structures under excitations, represented by multiple random processes that are correlated in both time and spatial domains. In KLE, the auto-covariance functions of random excitations are discretized using orthogonal basis functions. The KLE for multiple correlated random excitations relies on expansions in terms of correlated sets of random variables reflecting the cross-covariance of the random processes. During the response calculations, the eigenfunctions of KLE used to represent excitations are applied as forcing functions to the structure. The proposed algorithm is applied to a 2DOF system, a 2D cantilever beam and a 3D aircraft wing under both stationary and non-stationary correlated random excitations. Two methods are adopted to obtain the structural responses: a) the modal method and b) the direct method. Both the methods provide the statistics of the dynamic response with sufficient accuracy. The structural responses under the same type of correlated random excitations are bounded by the response obtained by perfectly correlated and uncorrelated random excitations. The structural response increases with a decrease in the correlation length and with an increase in the correlation magnitude. The proposed methodology can be applied for the analysis of any complex structure under any type of random excitation.
Resolution tests revisited: The power of random numbers
Trampert, J.; Fichtner, A.; Ritsema, J.
2013-01-01
We propose a simple method where the inversion of synthetic data, corresponding to a zeromean random input vector, is used to infer the average horizontal and vertical resolution lengths of tomographic models. The method works well if the resolution operator has a diagonally dominant structure. This
Multi-bit quantum random number generation by measuring positions of arrival photons
Yan, Qiurong; Zhao, Baosheng; Liao, Qinghong; Zhou, Nanrun
2014-10-01
We report upon the realization of a novel multi-bit optical quantum random number generator by continuously measuring the arrival positions of photon emitted from a LED using MCP-based WSA photon counting imaging detector. A spatial encoding method is proposed to extract multi-bits random number from the position coordinates of each detected photon. The randomness of bits sequence relies on the intrinsic randomness of the quantum physical processes of photonic emission and subsequent photoelectric conversion. A prototype has been built and the random bit generation rate could reach 8 Mbit/s, with random bit generation efficiency of 16 bits per detected photon. FPGA implementation of Huffman coding is proposed to reduce the bias of raw extracted random bits. The random numbers passed all tests for physical random number generator.
Combinatorial approach to generalized Bell and Stirling numbers and boson normal ordering problem
Mendez, M A; Penson, K A
2005-01-01
We consider the numbers arising in the problem of normal ordering of expressions in canonical boson creation and annihilation operators. We treat a general form of a boson string which is shown to be associated with generalizations of Stirling and Bell numbers. The recurrence relations and closed-form expressions (Dobiski-type formulas) are obtained for these quantities by both algebraic and combinatorial methods. By extensive use of methods of combinatorial analysis we prove the equivalence of the aforementioned problem to the enumeration of special families of graphs. This link provides a combinatorial interpretation of the numbers arising in this normal ordering problem.
New Design of Crypto-Based Pseudo random number generator (CBPRNG using BLOW FISH cipher
Directory of Open Access Journals (Sweden)
T.Chalama Reddy
2013-06-01
Full Text Available Random Number Generators (RNGs are an important building block for algorithms and protocols in cryptography. Random number generation is used in a wide variety of cryptographic operations, such as key generation and challenge/response protocols. A random number generator outputs a sequence of 0s and 1s such that at any position, the next bit cannot be expected on the previous bits. However, true random number produces non- deterministic output since if the same random generator is run twice, identical results are not received. Thus we go for pseudo random number generator that is deterministic device because if this random number generator is run twice or more, it gives same results. Our paper presents new crypto based pseudorandom number generator. It uses BLOW FISH ciphers and the Cipher-Block chaining (CBC mode that uses three stages of the block chaining. The plain text for each stage comes from the output of the first BLOW FISH, which uses the 64-Bit date and time as the plain text. CBPRNG creates three 64-bit random numbers, the first and the second are concatenated to create a 128-random number and the third is used as next initial vector (IV for CBPRNG. Our Crypto-Based Pseudo-random Number Generator produces a sequence of bits that has arandom looking distribution. This new generator helps to develop huge range cryptographic applications to increase the system security. A number of applications such as financial security applications and Pretty Good Privacy (PGP use this technique.
Typicality of normal numbers with respect to the Cantor series expansion
Mance, Bill
2010-01-01
A sequence of integer $Q=\\{q_n\\}_{n=1}^\\infty$ is a {\\it basic sequence} if $q_n$ is greater than or equal to $2$ for all $n$. In this paper, we improve upon results by J. Galambos and F. Schweiger showing that almost every (in the sense of Lebesgue measure) real number in $[0,1)$ is $Q$-normal with respect to the $Q$-Cantor series expansion for basic sequences $Q$ that satisfy a certain condition. We also provide asymptotics describing the number occurrences of blocks of digits in the $Q$-Cantor series expansion of a typical number. The notion of strong $Q$-normality, that satisfies a similar typicality result, is introduced. Both of these notions are equivalent for the $b$-ary expansion, but strong normality is stronger than normality for the Cantor series expansion. In order to show this, we provide an explicit construction of a basic sequence $Q$ and a real number that is $Q$-normal, but not strongly $Q$-normal. We use the results in this paper to show that under a mild condition on the basic sequence $Q$...
Directory of Open Access Journals (Sweden)
H. Soltanghoraiee
2004-10-01
Full Text Available Breast cancer is common and is considered second cause of cancer related mortality in females. Regarding importance of breast cancer, more investigation in this field is recommended. For many years investigators believed that neoplasms were not innervated but new findings have proved otherwise. This descriptive study was carried out to compare number of nerve fibers in benign, malignant and normal breast tissue. Of each group several slides were reviewed and 3608.50 mm2 of malignant tumors (ductal carcinoma, 3641 mm2 of benign tumors (fibroadenoma and 2331.25 mm2 of normal breast tissue (mammoplasty were assessed. Numbers of nerve fibers were compared and a significant increase in nerve fibers was found in malignant tumors compared with benign tumors and normal breast tissue. Accuracy of hematoxylin and eosin method were examined by immunohistochemistry staining (neurofilament method and affirmed. These results reveal that malignant tumors of breast have more nerve fibers than normal breast tissue or benign tumors.
High-Quality Random Number Generation Software for High-Performance Computing Project
National Aeronautics and Space Administration — Random number (RN) generation is the key software component that permits random sampling. Software for parallel RN generation (RNG) should be based on RNGs that are...
Cantor series constructions of fractal sets of normal numbers with arbitrary Hausdorff dimension
Mance, Bill
2010-01-01
Let $Q=\\{q_n\\}_{n=1}^{\\infty}$ be a sequence of integers greater than or equal to $2$. We say that a real number $x$ in $[0,1)$ is {\\it $Q$-distribution normal} if the sequence $\\{q_1q_2 \\... q_n x\\}_{n=1}^{\\infty}$ is uniformly distributed mod $1$. In \\cite{Laffer}, P. Laffer asked for a construction of a $Q$-distribution normal number for an arbitrary $Q$. Under a mild condition on $Q$, we construct a set $\\Theta_Q$ of $Q$-distribution normal numbers. This set is perfect and nowhere dense. Additionally, given any $\\alpha$ in $[0,1]$, we provide an explicit example of a sequence $Q$ such that the Hausdorff dimension of $\\Theta_Q$ is equal to $\\alpha$. Under a certain growth condition on $q_n$, we provide a discrepancy estimate that holds for every $x$ in $\\Theta_Q$.
van der Goot, Rob
2016-01-01
In this work, we adapt the traditional framework for spelling correction to the more novel task of normalization of social media content. To generate possible normalization candidates, we complement the traditional approach with a word embeddings model. To rank the candidates we will use a random fo
van der Goot, Rob
2016-01-01
In this work, we adapt the traditional framework for spelling correction to the more novel task of normalization of social media content. To generate possible normalization candidates, we complement the traditional approach with a word embeddings model. To rank the candidates we will use a random
Wang, Xin-Fan; Wang, Jian-Qiang; Deng, Sheng-Yue
2013-01-01
We investigate the dynamic stochastic multicriteria decision making (SMCDM) problems, in which the criterion values take the form of log-normally distributed random variables, and the argument information is collected from different periods. We propose two new geometric aggregation operators, such as the log-normal distribution weighted geometric (LNDWG) operator and the dynamic log-normal distribution weighted geometric (DLNDWG) operator, and develop a method for dynamic SMCDM with log-normally distributed random variables. This method uses the DLNDWG operator and the LNDWG operator to aggregate the log-normally distributed criterion values, utilizes the entropy model of Shannon to generate the time weight vector, and utilizes the expectation values and variances of log-normal distributions to rank the alternatives and select the best one. Finally, an example is given to illustrate the feasibility and effectiveness of this developed method.
Directory of Open Access Journals (Sweden)
Xin-Fan Wang
2013-01-01
Full Text Available We investigate the dynamic stochastic multicriteria decision making (SMCDM problems, in which the criterion values take the form of log-normally distributed random variables, and the argument information is collected from different periods. We propose two new geometric aggregation operators, such as the log-normal distribution weighted geometric (LNDWG operator and the dynamic log-normal distribution weighted geometric (DLNDWG operator, and develop a method for dynamic SMCDM with log-normally distributed random variables. This method uses the DLNDWG operator and the LNDWG operator to aggregate the log-normally distributed criterion values, utilizes the entropy model of Shannon to generate the time weight vector, and utilizes the expectation values and variances of log-normal distributions to rank the alternatives and select the best one. Finally, an example is given to illustrate the feasibility and effectiveness of this developed method.
54 Gbps real time quantum random number generator with simple implementation
Yang, Jie; Liu, Jinlu; Su, Qi; Li, Zhengyu; Fan, Fan; Xu, Bingjie; Guo, Hong
2016-11-01
We present a random number generation scheme based on measuring the phase fluctuations of a laser with a simple and compact experimental setup. A simple model is established to analyze the randomness and the simulation result based on this model fits well with the experiment data. After the analog to digital sampling and suitable randomness extraction integrated in the field programmable gate array, the final random bits are delivered to a PC, realizing a 5.4 Gbps real time quantum random number generation. The final random bit sequences have passed all the NIST and DIEHARD tests.
Fast random number generation with spontaneous emission noise of a single-mode semiconductor laser
Zhang, Jianzhong; Zhang, Mingjiang; Liu, Yi; Li, Pu; Yi, Xiaogang; Zhang, Mingtao; Wang, Yuncai
2016-11-01
We experimentally demonstrate a 12.5 Gb s-1 random number generator based on measuring the spontaneous emission noise of a single-mode semiconductor laser. The spontaneous emission of light is quantum mechanical in nature and is an inborn physical entropy source of true randomness. By combining a high-speed analog-to-digital converter and off-line processing, random numbers are extracted from the spontaneous emission with the verified randomness. The generator is simple, robust, and with no need of accurately tuning the comparison threshold. The use of semiconductor lasers makes it particularly compatible with the delivery of random numbers in optical networks.
Some Efficient Random Number Generators for Micro Computers.
1983-09-01
bytt:bytel; CONST 1IKLT z 1221; ( other good values are: 2937, 393, 4199, 4293,) b5in ( 9237,14789,15125,17245) seed.int : MULT I sed.int +; Rlyte...Ili](B) Z ..X ....... X ........ x ........ S A * *-------- Figure I: Relationship betueen bits in a Tausuorthe sequence. Here B) is defined as a...Ii]c )R od@ -----------------------------I *here li] = the i-th number produced by the generator. Ii+I] the (i41)-th number produced by the geerator
Average Number of Coherent Modes for Pulse Random Fields
Lazaruk, A M; Lazaruk, Alexander M.; Karelin, Nikolay V.
1997-01-01
Some consequences of spatio-temporal symmetry for the deterministic decomposition of complex light fields into factorized components are considered. This enables to reveal interrelations between spatial and temporal coherence properties of wave. An estimation of average number of the decomposition terms is obtained in the case of statistical ensemble of light pulses.
Law of large numbers for a class of random walks in dynamic random environments
Avena, L; Redig, F
2009-01-01
In this paper we consider a class of one-dimensional interacting particle systems in equilibrium, constituting a dynamic random environment, together with a nearest-neighbor random walk that on occupied/vacant sites has a local drift to the right/left. We adapt a regeneration-time argument originally developed by Comets and Zeitouni for static random environments to prove that, under a space-time mixing property for the dynamic random environment called cone-mixing, the random walk has an a.s. constant global speed. In addition, we show that if the dynamic random environment is exponentially mixing in space-time and the local drifts are small, then the global speed can be written as a power series in the size of the local drifts. From the first term in this series the sign of the global speed can be read off. The results can be easily extended to higher dimensions.
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.
Mathematical conversations multicolor problems, problems in the theory of numbers, and random walks
Dynkin, E B
2006-01-01
Comprises Multicolor Problems, dealing with map-coloring problems; Problems in the Theory of Numbers, an elementary introduction to algebraic number theory; Random Walks, addressing basic problems in probability theory. 1963 edition.
Towse, John N; Loetscher, Tobias; Brugger, Peter
2014-01-01
We investigate the number preferences of children and adults when generating random digit sequences. Previous research has shown convincingly that adults prefer smaller numbers when randomly choosing between responses 1-6. We analyze randomization choices made by both children and adults, considering a range of experimental studies and task configurations. Children - most of whom are between 8 and 11~years - show a preference for relatively large numbers when choosing numbers 1-10. Adults show a preference for small numbers with the same response set. We report a modest association between children's age and numerical bias. However, children also exhibit a small number bias with a smaller response set available, and they show a preference specifically for the numbers 1-3 across many datasets. We argue that number space demonstrates both continuities (numbers 1-3 have a distinct status) and change (a developmentally emerging bias toward the left side of representational space or lower numbers).
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.
Real time demonstration of high bitrate quantum random number generation with coherent laser light
Symul, T; Lam, P K; 10.1063/1.3597793
2011-01-01
We present a random number generation scheme that uses broadband measurements of the vacuum field contained in the radio-frequency sidebands of a single-mode laser. Even though the measurements may contain technical noise, we show that suitable algorithms can transform the digitized photocurrents into a string of random numbers that can be made arbitrarily correlated with a subset of the quantum fluctuations (high quantum correlation regime) or arbitrarily immune to environmental fluctuations (high environmental immunity). We demonstrate up to 2 Gbps of real time random number generation that were verified using standard randomness tests.
25 CFR 547.14 - What are the minimum technical standards for electronic random number generation?
2010-04-01
....All RNGs shall produce output having the following properties: (1) Statistical randomness; (2) Unpredictability; and (3) Non-repeatability. (b) Statistical Randomness.(1) Numbers produced by an RNG shall be... winning of this prize is defined to be the five numbers or other designations are matched in the...
RANDOM: A Computer Program for Evaluating Pseudo-Uniform RANDOM Number Generators.
1982-08-01
correlation employed in RANDOM is taken from Wald and Wolfowitz (1943) and is performed using both the circular and noncircular definitions. The theory behind...Addison-Wesley, 1962). Wald , A. and J. Wolfowitz , "An Exact Test for Randomness in the Non-Parametric Case Based on Serial Correlation," Annals of...measures the interdependence between these two variables. If p = q, the covariance between R and Rq is equivalent to the variance of Rp. Wolfowitz (1944
Random numbers from the tails of probability distributions using the transformation method
Fulger, Daniel; Germano, Guido
2009-01-01
The speed of many one-line transformation methods for the production of, for example, Levy alpha-stable random numbers, which generalize Gaussian ones, and Mittag-Leffler random numbers, which generalize exponential ones, is very high and satisfactory for most purposes. However, for the class of decreasing probability densities fast rejection implementations like the Ziggurat by Marsaglia and Tsang promise a significant speed-up if it is possible to complement them with a method that samples the tails of the infinite support. This requires the fast generation of random numbers greater or smaller than a certain value. We present a method to achieve this, and also to generate random numbers within any arbitrary interval. We demonstrate the method showing the properties of the transform maps of the above mentioned distributions as examples of stable and geometric stable random numbers used for the stochastic solution of the space-time fractional diffusion equation.
Geometric random walk of finite number of agents under constant variance
Yano, Ryosuke
2017-05-01
The characteristics of the 1D geometric random walk of a finite number of agents are investigated by assuming constant variance. Firstly, the characteristics of the steady state solution of the distribution function, which is obtained using the extended geometric Brownian motion (EGBM), are investigated in the framework of the 1D Fokker-Planck type equation. The uniqueness and existence of the steady state solution of the distribution function requires the number of particles to be finite. To avoid the divergence of the steady state solution of the distribution function at the mean value in the 1D Fokker-Planck type equation, the hybrid model, which is a combination of EGBM and normal BM, is proposed. Next, the steady state solution of the distribution function, which is obtained using the geometric Lévy flight, is investigated under constant variance in the framework of the space fractional 1D Fokker-Planck type equation. Additionally, we confirm that the solution of the distribution function obtained using the super-elastic and inelastic (SI-) Boltzmann equation under constant variance approaches the Cauchy distribution, when the power law number of the relative velocity increases. Finally, dissipation processes of the pressure deviator and heat flux are numerically investigated using the 2D space fractional Fokker-Planck type equations for Lévy flight and SI-Boltzmann equation by assuming their linear response relations.
Model-integrated estimation of normal tissue contamination for cancer SNP allelic copy number data.
Stjernqvist, Susann; Rydén, Tobias; Greenman, Chris D
2011-01-01
SNP allelic copy number data provides intensity measurements for the two different alleles separately. We present a method that estimates the number of copies of each allele at each SNP position, using a continuous-index hidden Markov model. The method is especially suited for cancer data, since it includes the fraction of normal tissue contamination, often present when studying data from cancer tumors, into the model. The continuous-index structure takes into account the distances between the SNPs, and is thereby appropriate also when SNPs are unequally spaced. In a simulation study we show that the method performs favorably compared to previous methods even with as much as 70% normal contamination. We also provide results from applications to clinical data produced using the Affymetrix genome-wide SNP 6.0 platform.
CODEX: a normalization and copy number variation detection method for whole exome sequencing.
Jiang, Yuchao; Oldridge, Derek A; Diskin, Sharon J; Zhang, Nancy R
2015-03-31
High-throughput sequencing of DNA coding regions has become a common way of assaying genomic variation in the study of human diseases. Copy number variation (CNV) is an important type of genomic variation, but detecting and characterizing CNV from exome sequencing is challenging due to the high level of biases and artifacts. We propose CODEX, a normalization and CNV calling procedure for whole exome sequencing data. The Poisson latent factor model in CODEX includes terms that specifically remove biases due to GC content, exon capture and amplification efficiency, and latent systemic artifacts. CODEX also includes a Poisson likelihood-based recursive segmentation procedure that explicitly models the count-based exome sequencing data. CODEX is compared to existing methods on a population analysis of HapMap samples from the 1000 Genomes Project, and shown to be more accurate on three microarray-based validation data sets. We further evaluate performance on 222 neuroblastoma samples with matched normals and focus on a well-studied rare somatic CNV within the ATRX gene. We show that the cross-sample normalization procedure of CODEX removes more noise than normalizing the tumor against the matched normal and that the segmentation procedure performs well in detecting CNVs with nested structures.
High-speed quantum-random number generation by continuous measurement of arrival time of photons
Yan, Qiurong; Zhao, Baosheng; Hua, Zhang; Liao, Qinghong; Yang, Hao
2015-07-01
We demonstrate a novel high speed and multi-bit optical quantum random number generator by continuously measuring arrival time of photons with a common starting point. To obtain the unbiased and post-processing free random bits, the measured photon arrival time is converted into the sum of integral multiple of a fixed period and a phase time. Theoretical and experimental results show that the phase time is an independent and uniform random variable. A random bit extraction method by encoding the phase time is proposed. An experimental setup has been built and the unbiased random bit generation rate could reach 128 Mb/s, with random bit generation efficiency of 8 bits per detected photon. The random numbers passed all tests in the statistical test suite.
The linking number and the writhe of uniform random walks and polygons in confined spaces
Panagiotou, E.; Millett, K. C.; Lambropoulou, S.
2010-01-01
Random walks and polygons are used to model polymers. In this paper we consider the extension of the writhe, self-linking number and linking number to open chains. We then study the average writhe, self-linking and linking number of random walks and polygons over the space of configurations as a function of their length. We show that the mean squared linking number, the mean squared writhe and the mean squared self-linking number of oriented uniform random walks or polygons of length n, in a convex confined space, are of the form O(n2). Moreover, for a fixed simple closed curve in a convex confined space, we prove that the mean absolute value of the linking number between this curve and a uniform random walk or polygon of n edges is of the form O(\\sqrt{n}) . Our numerical studies confirm those results. They also indicate that the mean absolute linking number between any two oriented uniform random walks or polygons, of n edges each, is of the form O(n). Equilateral random walks and polygons are used to model polymers in θ-conditions. We use numerical simulations to investigate how the self-linking and linking number of equilateral random walks scale with their length.
A generator for unique quantum random numbers based on vacuum states
DEFF Research Database (Denmark)
Gabriel, C.; Wittmann, C.; Sych, D.
2010-01-01
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...... 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...... unique randomness, are important attributes for achieving high-reliability, high-speed and low-cost quantum random number generators....
Efficient Raman generation in a waveguide: A route to ultrafast quantum random number generation
England, D. G.; Bustard, P. J.; Moffatt, D. J.; Nunn, J.; Lausten, R.; Sussman, B. J.
2014-02-01
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.
DEFF Research Database (Denmark)
Nielsen, J B; Sjöstrand, U H; Henneberg, S W
1991-01-01
A randomized study of 6 ventilatory modes was made in 7 piglets with normal lungs. Using a Servo HFV 970 (prototype system) and a Servo ventilator 900 C the ventilatory modes examined were as follows: SV-20V, i.e. volume-controlled intermittent positive-pressure ventilation (IPPV); SV-20VIosc, i...
An FPGA Implementation of a Parallelized MT19937 Uniform Random Number Generator
Directory of Open Access Journals (Sweden)
Sriram Vinay
2009-01-01
Full Text Available Recent times have witnessed an increase in use of high-performance reconfigurable computing for accelerating large-scale simulations. A characteristic of such simulations, like infrared (IR scene simulation, is the use of large quantities of uncorrelated random numbers. It is therefore of interest to have a fast uniform random number generator implemented in reconfigurable hardware. While there have been previous attempts to accelerate the MT19937 pseudouniform random number generator using FPGAs we believe that we can substantially improve the previous implementations to develop a higher throughput and more area-time efficient design. Due to the potential for parallel implementation of random numbers generators, designs that have both a small area footprint and high throughput are to be preferred to ones that have the high throughput but with significant extra area requirements. In this paper, we first present a single port design and then present an enhanced 624 port hardware implementation of the MT19937 algorithm. The 624 port hardware implementation when implemented on a Xilinx XC2VP70-6 FPGA chip has a throughput of 32 bit random numbers per second which is more than 17x that of the previously best published uniform random number generator. Furthermore it has the lowest area time metric of all the currently published FPGA-based pseudouniform random number generators.
Energy Technology Data Exchange (ETDEWEB)
Nie, You-Qi; 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); Synergetic Innovation Center of Quantum Information and Quantum Physics, University of Science and Technology of China, Hefei, Anhui 230026 (China); Zhang, Hong-Fei; Wang, Jian [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); Zhang, Zhen; Ma, Xiongfeng [Center for Quantum Information, Institute for Interdisciplinary Information Sciences, Tsinghua University, Beijing 100084 (China)
2014-02-03
We present a practical high-speed quantum random number generator, where the timing of single-photon detection relative to an external time reference is measured as the raw data. The bias of the raw data can be substantially reduced compared with the previous realizations. The raw random bit rate of our generator can reach 109 Mbps. We develop a model for the generator and evaluate the min-entropy of the raw data. Toeplitz matrix hashing is applied for randomness extraction, after which the final random bits are able to pass the standard randomness tests.
Nie, You-Qi; Zhang, Hong-Fei; Zhang, Zhen; Wang, Jian; Ma, Xiongfeng; Zhang, Jun; Pan, Jian-Wei
2014-02-01
We present a practical high-speed quantum random number generator, where the timing of single-photon detection relative to an external time reference is measured as the raw data. The bias of the raw data can be substantially reduced compared with the previous realizations. The raw random bit rate of our generator can reach 109 Mbps. We develop a model for the generator and evaluate the min-entropy of the raw data. Toeplitz matrix hashing is applied for randomness extraction, after which the final random bits are able to pass the standard randomness tests.
The generation of 68 Gbps quantum random number by measuring laser phase fluctuations
Energy Technology Data Exchange (ETDEWEB)
Nie, You-Qi; Liu, Yang; 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); Huang, Leilei; Payne, Frank [Department of Engineering Science, University of Oxford, Parks Road, Oxford OX1 3PJ (United Kingdom)
2015-06-15
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.
The generation of 68 Gbps quantum random number by measuring laser phase fluctuations
Nie, You-Qi; Huang, Leilei; Liu, Yang; Payne, Frank; Zhang, Jun; Pan, Jian-Wei
2015-06-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.
Loss-tolerant measurement-device-independent quantum random number generation
Cao, Zhu; Zhou, Hongyi; Ma, Xiongfeng
2015-12-01
Quantum random number generators (QRNGs) output genuine random numbers based upon the uncertainty principle. A QRNG contains two parts in general—a randomness source and a readout detector. How to remove detector imperfections has been one of the most important questions in practical randomness generation. We propose a simple solution, measurement-device-independent QRNG, which not only removes all detector side channels but is robust against losses. In contrast to previous fully device-independent QRNGs, our scheme does not require high detector efficiency or nonlocality tests. Simulations show that our protocol can be implemented efficiently with a practical coherent state laser and other standard optical components. The security analysis of our QRNG consists mainly of two parts: measurement tomography and randomness quantification, where several new techniques are developed to characterize the randomness associated with a positive-operator valued measure.
Strong Laws of Large Numbers for Arrays of Rowwise NA and LNQD Random Variables
Directory of Open Access Journals (Sweden)
Jiangfeng Wang
2011-01-01
Full Text Available Some strong laws of large numbers and strong convergence properties for arrays of rowwise negatively associated and linearly negative quadrant dependent random variables are obtained. The results obtained not only generalize the result of Hu and Taylor to negatively associated and linearly negative quadrant dependent random variables, but also improve it.
Raw and Central Moments of Binomial Random Variables via Stirling Numbers
Griffiths, Martin
2013-01-01
We consider here the problem of calculating the moments of binomial random variables. It is shown how formulae for both the raw and the central moments of such random variables may be obtained in a recursive manner utilizing Stirling numbers of the first kind. Suggestions are also provided as to how students might be encouraged to explore this…
Using random matrix theory to determine the number of endmembers in a hyperspectral image
CSIR Research Space (South Africa)
Cawse, K
2010-06-01
Full Text Available discuss a new method for determining the number of endmembers, using recent advances in Random Matrix Theory. This method is entirely unsupervised and is computationally cheaper than other existing methods. We apply our method to synthetic images...
A strong law of large numbers for harmonizable isotropic random fields
Directory of Open Access Journals (Sweden)
Randall J. Swift
1997-01-01
Full Text Available The class of harmonizable fields is a natural extension of the class of stationary fields. This paper considers a strong law of large numbers for the spherical average of a harmonizable isotropic random field.
Note: A 10 Gbps real-time post-processing free physical random number generator chip
Qian, Yi; Liang, Futian; Wang, Xinzhe; Li, Feng; Chen, Lian; Jin, Ge
2017-09-01
A random number generator with high data rate, small size, and low power consumption is essential for a certain quantum key distribution (QKD) system. We designed a 10 Gbps random number generator ASIC, TRNG2016, for the QKD system. With a 6 mm × 6 mm QFN48 package, TRNG2016 has 10 independent physical random number generation channels, and each channel can work at a fixed frequency up to 1 Gbps. The random number generated by TRNG2016 can pass the NIST statistical tests without any post-processing. With 3.3 V IO power supply and 1.2 V core power supply, the typical power consumption of TRNG2016 is 773 mW with 10 channels on and running at 1 Gbps data rate.
On the Strong Law of Large Numbers for Non-Independent B-Valued Random Variables
Institute of Scientific and Technical Information of China (English)
Gan Shi-xin
2004-01-01
This paper investigates some conditions which imply the strong laws of large numbers for Banach space valued random variable sequences. Some generalizations of the Marcinkiewicz-Zygmund theorem and the Hoffmann-Jφrgensen and Pisier theorem are obtained.
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.
The average inter-crossing number of equilateral random walks and polygons
Diao, Y.; Dobay, A.; Stasiak, A.
2005-09-01
In this paper, we study the average inter-crossing number between two random walks and two random polygons in the three-dimensional space. The random walks and polygons in this paper are the so-called equilateral random walks and polygons in which each segment of the walk or polygon is of unit length. We show that the mean average inter-crossing number ICN between two equilateral random walks of the same length n is approximately linear in terms of n and we were able to determine the prefactor of the linear term, which is a=\\frac{3\\ln 2}{8}\\approx 0.2599 . In the case of two random polygons of length n, the mean average inter-crossing number ICN is also linear, but the prefactor of the linear term is different from that of the random walks. These approximations apply when the starting points of the random walks and polygons are of a distance ρ apart and ρ is small compared to n. We propose a fitting model that would capture the theoretical asymptotic behaviour of the mean average ICN for large values of ρ. Our simulation result shows that the model in fact works very well for the entire range of ρ. We also study the mean ICN between two equilateral random walks and polygons of different lengths. An interesting result is that even if one random walk (polygon) has a fixed length, the mean average ICN between the two random walks (polygons) would still approach infinity if the length of the other random walk (polygon) approached infinity. The data provided by our simulations match our theoretical predictions very well.
A novel quantum random number generation algorithm used by smartphone camera
Wu, Nan; Wang, Kun; Hu, Haixing; Song, Fangmin; Li, Xiangdong
2015-05-01
We study an efficient algorithm to extract quantum random numbers (QRN) from the raw data obtained by charge-coupled device (CCD) or complementary metal-oxide semiconductor (CMOS) based sensors, like a camera used in a commercial smartphone. Based on NIST statistical test for random number generators, the proposed algorithm has a high QRN generation rate and high statistical randomness. This algorithm provides a kind of simple, low-priced and reliable devices as a QRN generator for quantum key distribution (QKD) or other cryptographic applications.
Fault-tolerant quantum random-number generator certified by Majorana fermions
Deng, Dong-Ling; Duan, Lu-Ming
2013-07-01
Braiding of Majorana fermions gives accurate topological quantum operations that are intrinsically robust to noise and imperfection, providing a natural method to realize fault-tolerant quantum information processing. Unfortunately, it is known that braiding of Majorana fermions is not sufficient for the implementation of universal quantum computation. Here we show that topological manipulation of Majorana fermions provides the full set of operations required to generate random numbers by way of quantum mechanics and to certify its genuine randomness through violation of a multipartite Bell inequality. The result opens a perspective to apply Majorana fermions for the robust generation of certified random numbers, which has important applications in cryptography and other related areas.
Device- and semi-device-independent random numbers based on noninequality paradox
Li, Hong-Wei; Pawłowski, Marcin; Rahaman, Ramij; Guo, Guang-Can; Han, Zheng-Fu
2015-08-01
In this work, we propose device-independent true random number expansion protocols based on noninequality paradoxes such as Hardy's and Cabello's nonlocality arguments, thus highlighting the noninequality paradox as an important resource for device-independent quantum-information processing, in particular for generating true randomness. As a byproduct, we find that the nonlocal bound of the Cabello argument with arbitrary dimension is the same as the one achieved in the qubits system. More interestingly, we propose a dimension witness paradox based on the Cabello argument which can be used for constructing a semi-device-independent true random number expansion protocol.
Quantum random number generation using an on-chip plasmonic beamsplitter
Francis, Jason; Özdemir, Şahin K; Tame, Mark
2016-01-01
We report an experimental realisation of a quantum random number generator using a plasmonic beamsplitter. Free-space single photons are converted into propagating single surface plasmon polaritons on a gold stripe waveguide via a grating. The surface plasmons are then guided to a region where they are scattered into one of two possible outputs. The presence of a plasmonic excitation in a given output determines the value of a random bit generated from the quantum scattering process. Using a stream of single surface plasmons injected into the beamsplitter we achieve a quantum random number generation rate of 2.37 Mbits/s even in the presence of loss. We characterise the quality of the random number sequence generated, finding it to be comparable to sequences from other quantum photonic-based devices. The compact nature of our nanophotonic device makes it suitable for tight integration in on-chip applications, such as in quantum computing and communication schemes.
Quantum random number generation using an on-chip plasmonic beamsplitter
Francis, Jason T.; Zhang, Xia; Özdemir, Şahin K.; Tame, Mark
2017-09-01
We report an experimental realisation of a quantum random number generator using a plasmonic beamsplitter. Free-space single photons are converted into propagating single surface plasmon polaritons on a gold stripe waveguide via a grating. The surface plasmons are then guided to a region where they are scattered into one of two possible outputs. The presence of a plasmonic excitation in a given output determines the value of a random bit generated from the quantum scattering process. Using a stream of single surface plasmons injected into the beamsplitter we achieve a quantum random number generation rate of 2.37 Mbits s-1 even in the presence of loss. We characterise the quality of the random number sequence generated, finding it to be comparable to sequences from other quantum photonic-based devices. The compact nature of our nanophotonic device makes it suitable for tight integration in on-chip applications, such as in quantum computing and communication schemes.
Practical quantum random number generator based on measuring the shot noise of vacuum states
Shen, Yong; Tian, Liang; Zou, Hongxin
2010-06-01
The shot noise of vacuum states is a kind of quantum noise and is totally random. In this paper a nondeterministic random number generation scheme based on measuring the shot noise of vacuum states is presented and experimentally demonstrated. We use a homodyne detector to measure the shot noise of vacuum states. Considering that the frequency bandwidth of our detector is limited, we derive the optimal sampling rate so that sampling points have the least correlation with each other. We also choose a method to extract random numbers from sampling values, and prove that the influence of classical noise can be avoided with this method so that the detector does not have to be shot-noise limited. The random numbers generated with this scheme have passed ent and diehard tests.
A robust approach to the generation of high-quality random numbers
Bisadi, Zahra; Fontana, Giorgio; Moser, Enrico; Pucker, Georg; Pavesi, Lorenzo
2016-10-01
A random number generation approach comprising a silicon nanocrystals LED (Si-NCs LED), silicon single photon avalanche photodiode (Si SPAD) and a field-programmable gate array (FPGA) is introduced. The Si-NCs LED is the source of entropy with photon emission in the visible range detectable by silicon detectors allowing the fabrication of an all-silicon-based device. The proposed quantum random number generator (QRNG) is robust against variations of the internal and external parameters such as aging of the components, changing temperature, the ambient interferences and the silicon detector artifacts. The raw data show high quality of randomness and passed all the statistical tests in National Institute of Standards and Technology (NIST) tests suite without the application of a post-processing algorithm. The efficiency of random number generation is 4-bits per detected photon.
Using Layer Recurrent Neural Network to Generate Pseudo Random Number Sequences
Directory of Open Access Journals (Sweden)
Veena Desai
2012-03-01
Full Text Available Pseudo Random Numbers (PRNs are required for many cryptographic applications. This paper proposes a new method for generating PRNs using Layer Recurrent Neural Network (LRNN. The proposed technique generates PRNs from the weight matrix obtained from the layer weights of the LRNN. The LRNN random number generator (RNG uses a short keyword as a seed and generates a long sequence as a pseudo PRN sequence. The number of bits generated in the PRN sequence depends on the number of neurons in the input layer of the LRNN. The generated PRN sequence changes, with a change in the training function of the LRNN .The sequences generated are a function of the keyword, initial state of network and the training function. In our implementation the PRN sequences have been generated using 3 training functions: 1Scaled Gradient Descent 2Levenberg-Marquartz (TRAINLM and 3 TRAINBGF. The generated sequences are tested for randomness using ENT and NIST test suites. The ENT test can be applied for sequences of small size. NIST has 16 tests to test random numbers. The LRNN generated PRNs pass in 11 tests, show no observations for 4 tests, and fail in 1 test when subjected to NIST .This paper presents the test results for random number sequence ranging from 25 bits to 1000 bits, generated using LRNN.
Random Number Hardware Generator Using Geiger-Mode Avalanche Photo Detector
Beznosko, D; Duspayev, A; Tailakov, A; Yessenov, M
2015-01-01
This paper presents the physical concept and test results of sample data of the high-speed hardware true random number generator design based on typically used for High Energy Physics hardware. Main features of this concept are the high speed of the true random numbers generation (tens of Mbt/s), miniature size and estimated lower production cost. This allows the use of such a device not only in large companies and government offices but for the end-user data cryptography, in classrooms, in scientific Monte-Carlo simulations, computer games and any other place where large number of true random numbers is required. The physics of the operations principle of using a Geiger-mode avalanche photo detector is discussed and the high quality of the data collected is demonstrated.
Energy Technology Data Exchange (ETDEWEB)
Ando, K., E-mail: ando-koji@aist.go.jp; Yuasa, S. [National Institute of Advanced Industrial Science and Technology (AIST), Tsukuba 305-8568 (Japan); Fujita, S.; Ito, J.; Yoda, H. [Toshiba Corporation, Kawasaki 212-8582 (Japan); Suzuki, Y. [Graduate School of Engineering Science, Osaka University, Toyonaka 560-8531 (Japan); Nakatani, Y. [Department of Communication Engineering and Informatics, University of Electro-Communication, Chofu 182-8585 (Japan); Miyazaki, T. [WPI-AIMR, Tohoku University, Sendai 980-8577 (Japan)
2014-05-07
Most parts of present computer systems are made of volatile devices, and the power to supply them to avoid information loss causes huge energy losses. We can eliminate this meaningless energy loss by utilizing the non-volatile function of advanced spin-transfer torque magnetoresistive random-access memory (STT-MRAM) technology and create a new type of computer, i.e., normally off computers. Critical tasks to achieve normally off computers are implementations of STT-MRAM technologies in the main memory and low-level cache memories. STT-MRAM technology for applications to the main memory has been successfully developed by using perpendicular STT-MRAMs, and faster STT-MRAM technologies for applications to the cache memory are now being developed. The present status of STT-MRAMs and challenges that remain for normally off computers are discussed.
Efficient pseudo-random number generators for biomolecular simulations on graphics processors
Zhmurov, A; Kholodov, Y; Barsegov, V
2010-01-01
Langevin Dynamics, Monte Carlo, and all-atom Molecular Dynamics simulations in implicit solvent, widely used to access the microscopic transitions in biomolecules, require a reliable source of random numbers. Here we present the two main approaches for implementation of random number generators (RNGs) on a GPU, which enable one to generate random numbers on the fly. In the one-RNG-per-thread approach, inherent in CPU-based calculations, one RNG produces a stream of random numbers in each thread of execution, whereas the one-RNG-for-all-threads approach builds on the ability of different threads to communicate, thus, sharing random seeds across the entire GPU device. We exemplify the use of these approaches through the development of Ran2, Hybrid Taus, and Lagged Fibonacci algorithms fully implemented on the GPU. As an application-based test of randomness, we carry out LD simulations of N independent harmonic oscillators coupled to a stochastic thermostat. This model allows us to assess statistical quality of ...
Hauswirth, Alexander W; Almeida, Julia; Nieto, Wendy G; Teodosio, Cristina; Rodriguez-Caballero, Arancha; Romero, Alfonso; López, Antonio; Fernandez-Navarro, Paulino; Vega, Tomas; Perez-Andres, Martin; Valent, Peter; Jäger, Ulrich; Orfao, Alberto
2012-07-01
Monoclonal B-cell lymphocytosis (MBL) with normal lymphocyte counts is associated with decreased numbers of normal circulating B-cell subsets.Little is known about the distribution of normal lymphoid cells and their subsets in the peripheral blood (PB) of subjects with monoclonal B-cell lymphocytosis (MBL). In our study, we compared the absolute number of PB lymphoid cells and their subpopulations in 95 MBL cases with normal lymphocyte counts vs. 617 age-/sex-matched non-MBL healthy subjects (controls), using highly sensitive flow cytometry. MBL cases showed significantly reduced numbers of normal circulating B-cells, at the expense of immature and naive B-cells; in addition, CD4+CD8+ double-positive T-cells and CD8+ T-cells were significantly lower and higher vs. controls, respectively. Moreover, most normal B-cell subsets were significantly decreased in PB at >1% MBL-counts, vs. "low-count" MBL cases, and lower amounts of immature/naive B-cells were detected in biclonal (particularly in cases with coexisting CLL-like- and non-CLL-like B-cell clones) vs. monoclonal MBL subjects. In summary, our results show imbalanced (reduced) absolute numbers of recently produced normal circulating B-cells (e.g., immature and naıve B-cells) in MBL, which becomes more pronounced as the MBL cell count increases.
An On-Demand Optical Quantum Random Number Generator with In-Future Action and Ultra-Fast Response
Mario Stipčević; Rupert Ursin
2015-01-01
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 p...
The Stochastic Galerkin Method for Darcy Flow Problem with Log-Normal Random Field Coefficients
Directory of Open Access Journals (Sweden)
Michal Beres
2017-01-01
Full Text Available This article presents a study of the Stochastic Galerkin Method (SGM applied to the Darcy flow problem with a log-normally distributed random material field given by a mean value and an autocovariance function. We divide the solution of the problem into two parts. The first one is the decomposition of a random field into a sum of products of a random vector and a function of spatial coordinates; this can be achieved using the Karhunen-Loeve expansion. The second part is the solution of the problem using SGM. SGM is a simple extension of the Galerkin method in which the random variables represent additional problem dimensions. For the discretization of the problem, we use a finite element basis for spatial variables and a polynomial chaos discretization for random variables. The results of SGM can be utilised for the analysis of the problem, such as the examination of the average flow, or as a tool for the Bayesian approach to inverse problems.
The intersection numbers of the p-spin curves from random matrix theory
Brezin, E
2012-01-01
The intersection numbers of p-spin curves are computed through correlation functions of Gaussian ensembles of random matrices in an external matrix source. The p-dependence of intersection numbers is determined as polynomial in p; the large p behavior is also considered. The analytic continuation of intersection numbers to negative values of p is discussed in relation to SL(2,R)/U(1) black hole sigma model.
The intersection numbers of the p-spin curves from random matrix theory
Brézin, E.; Hikami, S.
2013-02-01
The intersection numbers of p-spin curves are computed through correlation functions of Gaussian ensembles of random matrices in an external matrix source. The p-dependence of intersection numbers is determined as polynomial in p; the large p behavior is also considered. The analytic continuation of intersection numbers to negative values of p is discussed in relation to SL(2,R)/U(1) black hole sigma model.
Note: Fully integrated 3.2 Gbps quantum random number generator with real-time extraction
Zhang, Xiao-Guang; Nie, You-Qi; Zhou, Hongyi; Liang, Hao; Ma, Xiongfeng; Zhang, Jun; Pan, Jian-Wei
2016-07-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.
Limitations of a True Random Number Generator in a Field Programmable Gate Array
2007-12-01
more hardware than addition. The first two numbers for a sequence from a Fibonacci generator must be supplied and generally m is usually chosen as...congruential generator with a lagged Fibonacci generator. The two generators should produce a good random sequence and tested to make sure the resulting...9 Figure 3 Von Neumann and Xor Corrector for Unbiasing Random Sequences ............. 10 Figure 4 Four Bit Linear
Geisseler, Olivia; Pflugshaupt, Tobias; Buchmann, Andreas; Bezzola, Ladina; Reuter, Katja; Schuknecht, Bernhard; Weller, David; Linnebank, Michael; Brugger, Peter
2016-09-01
Human subjects typically deviate systematically from randomness when attempting to produce a sequence of random numbers. Despite an increasing number of behavioral and functional neuroimaging studies on random number generation (RNG), its structural correlates have never been investigated. We set out to fill this gap in 44 patients with multiple sclerosis (MS), a disease whose impact on RNG has never been studied. The RNG task required the paced (1 Hz) generation of the numbers from 1 to 6 in a sequence as random as possible. The same task was administered in 39 matched healthy controls. To assess neuroanatomical correlates such as cortical thickness, lesion load and third ventricle width, all subjects underwent high-resolution structural MRI. Compared to controls, MS patients exhibited an enhanced tendency to arrange consecutive numbers in an ascending order ("forward counting"). Furthermore, patients showed a higher susceptibility to rule breaks (producing out-of-category digits like 7) and to skip beats of the metronome. Clinico-anatomical correlation analyses revealed two main findings: First, increased counting in MS patients was associated with higher cortical lesion load. Second, increased number of skipped beats was related to widespread cortical thinning. In conclusion, our test results illustrate a loss of behavioral complexity in the course of MS, while the imaging results suggest an association between this loss and cortical pathology.
A quantum entropy source on an InP photonic integrated circuit for random number generation
Abellan, Carlos; Domenech, David; Muñoz, Pascual; Capmany, Jose; Longhi, Stefano; Mitchell, Morgan W; Pruneri, Valerio
2016-01-01
Random number generators are essential to ensure performance in information technologies, including cryptography, stochastic simulations and massive data processing. The quality of random numbers ultimately determines the security and privacy that can be achieved, while the speed at which they can be generated poses limits to the utilisation of the available resources. In this work we propose and demonstrate a quantum entropy source for random number generation on an indium phosphide photonic integrated circuit made possible by a new design using two-laser interference and heterodyne detection. The resulting device offers high-speed operation with unprecedented security guarantees and reduced form factor. It is also compatible with complementary metal-oxide semiconductor technology, opening the path to its integration in computation and communication electronic cards, which is particularly relevant for the intensive migration of information processing and storage tasks from local premises to cloud data centre...
Keeping the noise down: common random numbers for disease simulation modeling.
Stout, Natasha K; Goldie, Sue J
2008-12-01
Disease simulation models are used to conduct decision analyses of the comparative benefits and risks associated with preventive and treatment strategies. To address increasing model complexity and computational intensity, modelers use variance reduction techniques to reduce stochastic noise and improve computational efficiency. One technique, common random numbers, further allows modelers to conduct counterfactual-like analyses with direct computation of statistics at the individual level. This technique uses synchronized random numbers across model runs to induce correlation in model output thereby making differences easier to distinguish as well as simulating identical individuals across model runs. We provide a tutorial introduction and demonstrate the application of common random numbers in an individual-level simulation model of the epidemiology of breast cancer.
Coupled vibrations of rectangular buildings subjected to normally-incident random wind loads
Safak, E.; Foutch, D.A.
1987-01-01
A method for analyzing the three-directional coupled dynamic response of wind-excited buildings is presented. The method is based on a random vibration concept and is parallel to those currently used for analyzing alongwind response. Only the buildings with rectangular cross-section and normally-incident wind are considered. The alongwind pressures and their correlations are represented by the well-known expressions that are available in the literature. The acrosswind forces are assumed to be mainly due to vortex shedding. The torque acting on the building is taken as the sum of the torque due to random alongwind forces plus the torque due to asymmetric acrosswind forces. The study shows the following: (1) amplitude of acrosswind vibrations can be several times greater than that of alongwind vibrations; (2) torsional vibrations are significant if the building has large frontal width, and/or it is asymmetric, and/or its torsional natural frequency is low; (3) even a perfectly symmetric structure with normally incident wind can experience significant torsional vibrations due to the randomness of wind pressures. ?? 1987.
Directory of Open Access Journals (Sweden)
Edward Nuhfer
2016-01-01
Full Text Available Self-assessment measures of competency are blends of an authentic self-assessment signal that researchers seek to measure and random disorder or "noise" that accompanies that signal. In this study, we use random number simulations to explore how random noise affects critical aspects of self-assessment investigations: reliability, correlation, critical sample size, and the graphical representations of self-assessment data. We show that graphical conventions common in the self-assessment literature introduce artifacts that invite misinterpretation. Troublesome conventions include: (y minus x vs. (x scatterplots; (y minus x vs. (x column graphs aggregated as quantiles; line charts that display data aggregated as quantiles; and some histograms. Graphical conventions that generate minimal artifacts include scatterplots with a best-fit line that depict (y vs. (x measures (self-assessed competence vs. measured competence plotted by individual participant scores, and (y vs. (x scatterplots of collective average measures of all participants plotted item-by-item. This last graphic convention attenuates noise and improves the definition of the signal. To provide relevant comparisons across varied graphical conventions, we use a single dataset derived from paired measures of 1154 participants' self-assessed competence and demonstrated competence in science literacy. Our results show that different numerical approaches employed in investigating and describing self-assessment accuracy are not equally valid. By modeling this dataset with random numbers, we show how recognizing the varied expressions of randomness in self-assessment data can improve the validity of numeracy-based descriptions of self-assessment.
On the Selection of Random Numbers in the ElGamal Algorithm
Institute of Scientific and Technical Information of China (English)
无
2006-01-01
The ElGamal algorithm, which can be used for both signature and encryption, is of importance in public-key cryptosystems. However, there has arisen an issue that different criteria of selecting a random number are used for the same algorithm. In the aspects of the sufficiency, necessity, security and computational overhead of parameter selection, this paper analyzes these criteria in a comparative manner and points out the insecurities in some textbook cryptographic schemes. Meanwhile, in order to enhance security a novel generalization of the ElGamal signature scheme is made by expanding the range of selecting random numbers at an acceptable cost of additional computation, and its feasibility is demonstrated.
Inferences in Linear Mixed Models with Skew-normal Random Eff ects
Institute of Scientific and Technical Information of China (English)
Ren Dao YE; Tong Hui WANG
2015-01-01
For the linear mixed model with skew-normal random eff ects, this paper gives the density function, moment generating function and independence conditions. The noncentral skew chi-square distribution is defined and its density function is shown. The necessary and suﬃ cient conditions under which a quadratic form is distributed as noncentral skew chi-square distribution are obtained. Also, a version of Cochran’s theorem is given, which modifies the result of Wang et al. (2009) and is used to set up exact tests for fixed eff ects and variance components of the proposed model. For illustration, our main results are applied to a real data problem.
Directory of Open Access Journals (Sweden)
Juliusson Gunnar
2008-10-01
Full Text Available Abstract Background Illumina Infinium whole genome genotyping (WGG arrays are increasingly being applied in cancer genomics to study gene copy number alterations and allele-specific aberrations such as loss-of-heterozygosity (LOH. Methods developed for normalization of WGG arrays have mostly focused on diploid, normal samples. However, for cancer samples genomic aberrations may confound normalization and data interpretation. Therefore, we examined the effects of the conventionally used normalization method for Illumina Infinium arrays when applied to cancer samples. Results We demonstrate an asymmetry in the detection of the two alleles for each SNP, which deleteriously influences both allelic proportions and copy number estimates. The asymmetry is caused by a remaining bias between the two dyes used in the Infinium II assay after using the normalization method in Illumina's proprietary software (BeadStudio. We propose a quantile normalization strategy for correction of this dye bias. We tested the normalization strategy using 535 individual hybridizations from 10 data sets from the analysis of cancer genomes and normal blood samples generated on Illumina Infinium II 300 k version 1 and 2, 370 k and 550 k BeadChips. We show that the proposed normalization strategy successfully removes asymmetry in estimates of both allelic proportions and copy numbers. Additionally, the normalization strategy reduces the technical variation for copy number estimates while retaining the response to copy number alterations. Conclusion The proposed normalization strategy represents a valuable tool that improves the quality of data obtained from Illumina Infinium arrays, in particular when used for LOH and copy number variation studies.
Some long-period random number generators using shifts and xors
Brent, Richard P.
2010-01-01
Marsaglia recently introduced a class of xorshift random number generators (RNGs) with periods 2n-1 for n = 32, 64, etc. Here we give a generalisation of Marsaglia's xorshift generators in order to obtain fast and high-quality RNGs with extremely long periods. RNGs based on primitive trinomials may be unsatisfactory because a trinomial has very small weight. In contrast, our generators can be chosen so that their minimal polynomials have large weight (number of nonzero terms). A computer sear...
640-Gbit/s fast physical random number generation using a broadband chaotic semiconductor laser
Zhang, Limeng; Pan, Biwei; Chen, Guangcan; Guo, Lu; Lu, Dan; Zhao, Lingjuan; Wang, Wei
2017-01-01
An ultra-fast physical random number generator is demonstrated utilizing a photonic integrated device based broadband chaotic source with a simple post data processing method. The compact chaotic source is implemented by using a monolithic integrated dual-mode amplified feedback laser (AFL) with self-injection, where a robust chaotic signal with RF frequency coverage of above 50 GHz and flatness of ±3.6 dB is generated. By using 4-least significant bits (LSBs) retaining from the 8-bit digitization of the chaotic waveform, random sequences with a bit-rate up to 640 Gbit/s (160 GS/s × 4 bits) are realized. The generated random bits have passed each of the fifteen NIST statistics tests (NIST SP800-22), indicating its randomness for practical applications. PMID:28374860
Minimalist design of a robust real-time quantum random number generator
Kravtsov, K. S.; Radchenko, I. V.; Kulik, S. P.; Molotkov, S. N.
2015-08-01
We present a simple and robust construction of a real-time quantum random number generator (QRNG). Our minimalist approach ensures stable operation of the device as well as its simple and straightforward hardware implementation as a stand-alone module. As a source of randomness the device uses measurements of time intervals between clicks of a single-photon detector. The obtained raw sequence is then filtered and processed by a deterministic randomness extractor, which is realized as a look-up table. This enables high speed on-the-fly processing without the need of extensive computations. The overall performance of the device is around 1 random bit per detector click, resulting in 1.2 Mbit/s generation rate in our implementation.
An ultrafast quantum random number generator based on quantum phase fluctuations
Xu, Feihu; Ma, Xiongfeng; Xu, He; Zheng, Haoxuan; Lo, Hoi-Kwong
2012-01-01
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 propose and experimentally demonstrate an ultrafast QRNG at a rate over 6 Gb/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 post-processing. We quantify the quantum randomness through min-entropy by modeling our system, and employ two 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.
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...
Random Numbers Demonstrate the Frequency of Type I Errors: Three Spreadsheets for Class Instruction
Duffy, Sean
2010-01-01
This paper describes three spreadsheet exercises demonstrating the nature and frequency of type I errors using random number generation. The exercises are designed specifically to address issues related to testing multiple relations using correlation (Demonstration I), t tests varying in sample size (Demonstration II) and multiple comparisons…
Laws of Large Numbers of Negatively Correlated Random Variables for Capacities
Institute of Scientific and Technical Information of China (English)
Wen-juan LI; Zeng-jing CHEN
2011-01-01
Our aim is to present some limit theorems for capacities.We consider a sequence of pairwise negatively correlated random variables.We obtain laws of large numbers for upper probabilities and 2-aiternating capacities,using some results in the classical probability theory and a non-additive version of Chebyshev's inequality and Borai-Contelli lemma for capacities.
Best Spatiotemporal Performance Sustained by Optimal Number of Random Shortcuts on Complex Networks
Institute of Scientific and Technical Information of China (English)
WANG Mao-Sheng; HOU Zhong-Huai; XIN Hou-Wen
2006-01-01
@@ The spatial synchronization and temporal coherence of FitzHugh-Nagumo (FHN) neurons on complex networks are numerically investigated. When an optimal number of random shortcuts are added to a regular neural chain,the system can reach a state which is nearly periodic in time and almost synchronized in space.
A portable high-quality random number generator for lattice field theory simulations
Lüscher, Martin
1994-01-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.
A Portable High-Quality Random Number Generator for Lattice Field Theory Simulations
Luescher, Martin
1993-01-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.
Weak laws of large numbers for arrays of rowwise negatively dependent random variables
Directory of Open Access Journals (Sweden)
R. L. Taylor
2001-01-01
Full Text Available Weak laws of large numbers for arrays of rowwise negatively dependent random variables are obtained in this paper. The more general hypothesis of negative dependence relaxes the usual assumption of independence. The moment conditions are similar to previous results, and the stochastic bounded condition also provides a generalization of the usual distributional assumptions.
Klempíř, Jiří; Zidovská, Jana; Stochl, Jan; Ing, Věra Kebrdlová; Uhrová, Tereza; Roth, Jan
2011-01-01
Huntington's disease (HD) is caused by the expansion of the number of CAG repeats on the chromosome 4p16.3, which results in elongated glutamine tract of huntingtin. The purpose of this work was to examine the interaction between the normal and mutant alleles of this gene and their effect on the clinical onset of HD. We hypothesized that in patients with identical number of CAG repeats within the mutant allele, the age of onset of HD is influenced by the number of CAG repeats within the normal allele. We analyzed the relations between the number of CAG repeats within the normal and mutant alleles, the age at HD onset, and the character of initial symptoms in 468 patients with clinically expressed HD. Although the Cox regression coefficient of 0.15 was significant (P CAG repeats within normal allele. Within the groups of patients with the same number of CAG repeats of the mutant allele, number of CAG repeats of the normal allele was found uncorrelated to the age at onset. Furthermore, when analyzing subgroups of patients with the same allelic composition on both alleles, we failed to observe any correlation with the age at the onset. Our analysis gives no corroboration to the idea of a normal allele having a share in the modification of the age at HD onset. We believe that with the current state of knowledge it is not possible to devise a mathematical model for HD onset prediction because too many entirely unknown modifying factors are still involved.
Reznik, A. L.; Tuzikov, A. V.; Solov'ev, A. A.; Torgov, A. V.
2016-11-01
Original codes and combinatorial-geometrical computational schemes are presented, which are developed and applied for finding exact analytical formulas that describe the probability of errorless readout of random point images recorded by a scanning aperture with a limited number of threshold levels. Combinatorial problems encountered in the course of the study and associated with the new generalization of Catalan numbers are formulated and solved. An attempt is made to find the explicit analytical form of these numbers, which is, on the one hand, a necessary stage of solving the basic research problem and, on the other hand, an independent self-consistent problem.
Effective number of samples and pseudo-random nonlinear distortions in digital OFDM coded signal
Rudziński, Adam
2013-01-01
This paper concerns theoretical modeling of degradation of signal with OFDM coding caused by pseudo-random nonlinear distortions introduced by an analog-to-digital or digital-to-analog converter. A new quantity, effective number of samples, is defined and used for derivation of accurate expressions for autocorrelation function and the total power of the distortions. The derivation is based on probabilistic model of the signal and its transition probability. It is shown, that for digital (discrete and quantized) signals the effective number of samples replaces the total number of samples and is the proper quantity defining their properties.
Numerical analysis of ultrafast physical random number generator using dual-channel optical chaos
Elsonbaty, Amr; Hegazy, Salem F.; Obayya, Salah S. A.
2016-09-01
Fast physical random number generators (PRNGs) are essential elements in the development of many modern applications. We numerically demonstrate an extraction scheme to establish an ultrafast PRNG using dual-channel optical-chaos source. Simultaneous suppression of time-delay signature in all observables of the output is verified using autocorrelation-function method. The proposed technique compares the level of the chaotic signal at time t with M levels of its delayed version. The comparators [1-bit analog-to-digital converters (ADCs)] are triggered using a clock subject to an incremental delay. All the delays of the chaotic signal before the ADCs and the relative delays of the clock are mutually incommensurable. The outputs of the ADCs are then combined using parity-check logic to produce physically true random numbers. The randomness quality of the generated random bits is evaluated by the statistical tests of National Institute of Standards and Technology Special Publication 800-22. The results verify that all tests are passed from M=1 to M=39 at sampling rate up to 34.5 GHz, which indicates that the maximum generation rate of random bits is 2.691 Tb/s without employing any preprocessing techniques. This rate, to the best of our knowledge, is higher than any previously reported PRNG.
Perfect random number generator is unnecessary for secure quantum key distribution
Wang, X B
2004-01-01
Game G: Clare passes a string s which is either from perfect random number generator R0 or from good imperfect number generator R1, with equal probability. Alice's information about whether it is from R0 or R1 is bounded by small value h. Alice use s as the input random numbers for QKD protocol with Bob. Suppose Eve may have very small information about the final key if s is from R0 and Eve has large information if s is from R1, then after the protocol, Alice announce the final key, Eve's information about whether s is from R0 or R1 is unreasonablly large, i.e., breaks the known bound, h. Explicit formulas are given in the article.
Phase shifting interferometry from two normalized interferograms with random tilt phase-shift.
Liu, Fengwei; Wu, Yongqian; Wu, Fan
2015-07-27
We propose a novel phase shifting interferometry from two normalized interferograms with random tilt phase-shift. The determination of tilt phase-shift is performed by extracting the tilted phase-shift plane from the phase difference of two normalized interferograms, and with the calculated tilt phase-shift value the phase distribution can be retrieved from the two normalized frames. By analyzing the distribution of phase difference and utilizing special points fitting method, the tilted phase-shift plane is extracted in three different cases, which relate to different magnitudes of tilts. Proposed method has been applied to simulations and experiments successfully and the satisfactory results manifest that proposed method is of high accuracy and high speed compared with the three step iterative method. Additionally, both open and closed fringe can be analyzed with proposed method. What's more, it cannot only eliminate the small tilt-shift error caused by slight vibration in phase-shifting interferometry, but also detect the large tilt phase-shift in phase-tilting interferometry. Thus, it will relaxes the requirements on the accuracy of phase shifter, and the costly phase shifter may even be useless by applying proposed method in high amplitude vibrated circumstance to achieve high-precision analysis.
Exponential inequalities for associated random variables and strong laws of large numbers
Institute of Scientific and Technical Information of China (English)
2007-01-01
Some exponential inequalities for partial sums of associated random variables are established. These inequalities improve the corresponding results obtained by Ioannides and Roussas (1999), and Oliveira (2005). As application, some strong laws of large numbers are given. For the case of geometrically decreasing covariances, we obtain the rate of convergence n-1/2(log log n)1/2(logn) which is close to the optimal achievable convergence rate for independent random variables under an iterated logarithm, while Ioannides and Roussas (1999), and Oliveira (2005) only got n-1/3(logn)2/3 and n-1/3(logn)5/3, separately.
Exponential inequalities for associated random variables and strong laws of large numbers
Institute of Scientific and Technical Information of China (English)
Shan-chao YANG; Min CHEN
2007-01-01
Some exponential inequalities for partial sums of associated random variables are established. These inequalities improve the corresponding results obtained by Ioannides and Roussas (1999), and Oliveira (2005). As application, some strong laws of large numbers are given. For the case of geometrically decreasing covariances, we obtain the rate of convergence n-1/2(log log n)1/2(log n) which is close to the optimal achievable convergence rate for independent random variables under an iterated logarithm, while Ioannides and Roussas (1999), and Oliveira (2005) only got n-1/3 (log n)2/3 and n-1/3 (log n)5/3, separately.
FINITE VARIANCE OF THE NUMBER OF STATIONARY POINTS OF A GAUSSIAN RANDOM FIELD
Estrade, Anne; Fournier, Julie
2015-01-01
Let X be a real-valued stationary Gaussian random field defined on $R^d$ (d ≥ 1), with almost every realization of class $C^2$. This paper is concerned with the random variable giving the number of points in $T$ (a compact set of $R^d$) where the gradient $X'$ takes a fixed value $v\\in R^d$, $N_{X'}(T, v) = \\{t \\in T : X'(t) = v\\}$. More precisely, it deals with the finiteness of the variance of $N_{X'} (T, v)$, under some non-degeneracy hypothesis on $X$. For d = 1, the so-called " Geman con...
A note on strong law of large numbers of random variables
Institute of Scientific and Technical Information of China (English)
LIN Zheng-yan; SHEN Xin-mei
2006-01-01
In this paper, the Chung's strong law of large numbers is generalized to the random variables which do not need the condition of independence, while the sequence of Borel functions verifies some conditions weaker than that in Chung's theorem.Some convergence theorems for martingale difference sequence such as Lp martingale difference sequence are the particular cases of results achieved in this paper. Finally, the convergence theorem for A-summability of sequence of random variables is proved,where A is a suitable real infinite matrix.
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.
All-optical random number generation using highly nonlinear fibers by numerical simulation
Wang, Juanfen; Liang, Junqiang; Li, Pu; Yang, Lingzhen; Wang, Yuncai
2014-06-01
A new scheme of all-optical random number generation based on the nonlinear effects in highly nonlinear fibers (HNLF) is proposed. The scheme is comprised of ultra-wide band chaotic entropy source, all-optical sampler, all-optical comparator and all-optical exclusive-or (XOR), which are mainly realized by four-wave mixing (FWM) and cross-phase modulation (XPM) in highly nonlinear fibers. And we achieve 10 Gbit/s random numbers through numerically simulating all the processes. The entire operations are completed in the all-optical domain, which may overcome the bottleneck problem of electronic devices, and apply directly in high-speed all-optical communication network.
Recurrence and Polya Number of General One-Dimensional Random Walks
Institute of Scientific and Technical Information of China (English)
张晓琨; 万晶; 陆静菊; 徐新平
2011-01-01
The recurrence properties of random walks can be characterized by P61ya number, i.e., the probability that the walker has returned to the origin at least once. In this paper, we consider recurrence properties for a general 1D random walk on a line, in which at each time step the walker can move to the left or right with probabilities l and r, or remain at the same position with probability o （l ＋ r ＋ o = 1）. We calculate Polya number P of this model and find a simple expression for P as, P = 1 - △, where △ is the absolute difference of l and r （△= ｜l - r｜）. We prove this rigorous expression by the method of creative telescoping, and our result suggests that the walk is recurrent if and only if the left-moving probability l equals to the right-moving probability r.
DEFF Research Database (Denmark)
Dimitrov, Ivaylo; Jankova Atanasova, Katja; Hvilsted, Søren
2010-01-01
Pairs of polystyrene-based random copolymers with balanced number of pendant basic or acidic groups were synthesized utilizing the template strategy. The same poly[(4-hydroxystyrene)-ran-styrene] was used as a template backbone for modification. Two different synthetic approaches for the function......Pairs of polystyrene-based random copolymers with balanced number of pendant basic or acidic groups were synthesized utilizing the template strategy. The same poly[(4-hydroxystyrene)-ran-styrene] was used as a template backbone for modification. Two different synthetic approaches...... by copper-catalyzed 1,3 cycloaddition of aliphatic sulfonate- or amine-contaning azides. Both synthetic approaches proved to be highly efficient as evidenced by H-1-NMR analyses. The thermal properties were evaluated by differential scanning calorimetry and thermal gravimetric analyses and were influenced...
Effective Normalization for Copy Number Variation Detection from Whole Genome Sequencing
Janevski, A.; Varadan, V.; Kamalakaran, S.; Banerjee, N.; Dimitrova, D.
2012-01-01
Background Whole genome sequencing enables a high resolution view ofthe human genome and provides unique insights into genome structureat an unprecedented scale. There have been a number of tools to infer copy number variation in the genome. These tools while validatedalso include a number of parame
Oracle inequalities for SVMs that are based on random entropy numbers
Energy Technology Data Exchange (ETDEWEB)
Steinwart, Ingo [Los Alamos National Laboratory
2009-01-01
In this paper we present a new technique for bounding local Rademacher averages of function classes induced by a loss function and a reproducing kernel Hilbert space (RKHS). At the heart of this technique lies the observation that certain expectations of random entropy numbers can be bounded by the eigenvalues of the integral operator associated to the RKHS. We then work out the details of the new technique by establishing two new oracle inequalities for SVMs, which complement and generalize orevious results.
A Pseudo Random Numbers Generator Based on Chaotic Iterations. Application to Watermarking
Guyeux, Christophe; Bahi, Jacques M
2010-01-01
In this paper, a new chaotic pseudo-random number generator (PRNG) is proposed. It combines the well-known ISAAC and XORshift generators with chaotic iterations. This PRNG possesses important properties of topological chaos and can successfully pass NIST and TestU01 batteries of tests. This makes our generator suitable for information security applications like cryptography. As an illustrative example, an application in the field of watermarking is presented.
On the number of common sites visited by N random walkers
Turban, L
2016-01-01
Majumdar and Tamm [Phys. Rev. E 86 021135 (2012), arXiv:1206.6184] recently obtained analytical expressions for the mean number of common sites W_N(t) visited up to time t by N independent random walkers starting from the origin of a d-dimensional lattice. In this short note I show how the different regimes and the corresponding asymptotic power laws can be retrieved using the notion of fractal intersection.
On the Number of Fireproof Vertices of a Tree in a Random Forest
Yury L. Pavlov; Elena V. Khvorostyanskaya
2013-01-01
We consider the set Fn,N of all possible forests, consisting of N≥2 ordered non-root trees and labeled vertices. We specify the uniform distribution on Fn,N. When N1/3(n/N−2)→∞ there is obtained the limit theorem for the number of fireproof vertices of one tree in a forest fire model on a random forest taken from Fn,N.
A portable high-quality random number generator for lattice field theory simulations
Lüscher, Martin
1994-02-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.
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…
Some long-period random number generators using shifts and xors
Brent, Richard P
2010-01-01
Marsaglia recently introduced a class of xorshift random number generators (RNGs) with periods 2n-1 for n = 32, 64, etc. Here we give a generalisation of Marsaglia's xorshift generators in order to obtain fast and high-quality RNGs with extremely long periods. RNGs based on primitive trinomials may be unsatisfactory because a trinomial has very small weight. In contrast, our generators can be chosen so that their minimal polynomials have large weight (number of nonzero terms). A computer search using Magma has found good generators for n a power of two up to 4096. These have been implemented in a free software package xorgens.
Attack on a Chaos-Based Random Number Generator Using Anticipating Synchronization
Yeniçeri, Ramazan; Kilinç, Selçuk; Yalçin, Müştak E.
Chaotic systems have been used in random number generation, owing to the property of sensitive dependence on initial conditions and hence the possibility to produce unpredictable signals. Within the types of chaotic systems, those which are defined by only one delay-differential equation are attractive due to their simple model. On the other hand, it is possible to synchronize to the future states of a time-delay chaotic system by anticipating synchronization. Therefore, random number generator (RNG), which employs such a system, might not be immune to the attacks. In this paper, attack on a chaos-based random number generator using anticipating synchronization is investigated. The considered time-delay chaotic system produces binary signals, which can directly be used as a source of RNG. Anticipating synchronization is obtained by incorporating other systems appropriately coupled to the original one. Quantification of synchronization is given by the bit error between the streams produced by the original and coupled systems. It is shown that the bit streams generated by the original system can be anticipated by the coupled systems beforehand.
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-01
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.
Chaotic oscillation and random-number generation based on nanoscale optical-energy transfer
Naruse, Makoto; Aono, Masashi; Hori, Hirokazu; Ohtsu, Motoichi
2014-01-01
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 (R...
Gustavsson, K
2013-01-01
We calculate the Lyapunov exponents describing spatial clustering of particles advected in one- and two-dimensional random velocity fields at finite Kubo number Ku (a dimensionless parameter characterising the correlation time of the velocity field). In one dimension we obtain accurate results up to Ku ~ 1 by resummation of a perturbation expansion in Ku. At large Kubo numbers we compute the Lyapunov exponent by taking into account the fact that the particles follow the minima of the potential function corresponding to the velocity field. In two dimensions we compute the first four non-vanishing terms in the small-Ku expansion of the Lyapunov exponents. For large Kubo numbers we estimate the Lyapunov exponents by assuming that the particles sample stagnation points of the velocity field with det A > 0 and Tr A < 0 where A is the matrix of flow-velocity gradients.
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.
Ellison, Matthew; Grose, Brian; Howell, Stephen; Wilson, Colin; Lenz, Jackson; Driver, Richard
2016-01-01
Prolonged paralysis due to a quantitative or qualitative deficiency of pseudocholinesterase activity is an uncommon but known side effect of succinylcholine. We describe a patient who experienced prolonged paralysis following administration of succinylcholine for general anesthesia and endotracheal intubation for an emergent cesarean section despite laboratory evidence of normal enzyme function. The patient required mechanical ventilation in the intensive care unit for several hours following surgery. The patient was extubated following return of full muscle strength and had a good outcome. The enzyme responsible for the metabolism of succinylcholine, pseudocholinesterase, was determined to be low in quantity in this patient but was functionally normal. This low level, by itself, was unlikely to be solely responsible for the prolonged paralysis. The patient likely had an abnormal pseudocholinesterase enzyme variant that is undetectable by standard laboratory tests.
Testing of PLL-based True Random Number Generator in Changing Working Conditions
Directory of Open Access Journals (Sweden)
M. Simka
2011-04-01
Full Text Available Security of cryptographic systems depends significantly on security of secret keys. Unpredictability of the keys is achieved by their generation by True Random Number Generators (TRNGs. In the paper we analyze behavior of the Phase-Locked Loop (PLL based TRNG in changing working environment. The frequency of signals synthesized by PLL may be naturally influenced by chip temperature. We show what impact the temperature has on the quality of generated random sequence of the PLL-based TRNG. Thank to analysis of internal signals of the generator we are able to prove dependencies between the PLL parameters, statistical parameters of the generated sequence and temperature. Considering the measured results of experiments we form a new requirement in order to improve the robustness of the designed TRNG.
High-Density Physical Random Number Generator Using Spin Signals in Multidomain Ferromagnetic Layer
Directory of Open Access Journals (Sweden)
Sungwoo Chun
2015-01-01
Full Text Available A high-density random number generator (RNG based on spin signals in a multidomain ferromagnetic layer in a magnetic tunnel junction (MTJ is proposed and fabricated. Unlike conventional spin-based RNGs, the proposed method does not require one to control an applied current, leading to a time delay in the system. RNG demonstrations are performed at room temperature. The randomness of the bit sequences generated by the proposed RNG is verified using the FIPS 140-2 statistical test suite provided by the NIST. The test results validate the effectiveness of the proposed RNGs. Our results suggest that we can obtain high-density, ultrafast RNGs if we can achieve high integration on the chip.
Number of trees in random forest%随机森林中树的数量
Institute of Scientific and Technical Information of China (English)
刘敏; 郎荣玲; 曹永斌
2015-01-01
随机森林是一种集成分类器，对影响随机森林性能的参数进行了分析，结果表明随机森林中树的数量对随机森林的性能影响至关重要。对树的数量的确定方法以及随机森林性能指标的评价方法进行了研究与总结。以分类精度为评价方法，利用UCI数据集对随机森林中决策树的数量与数据集的关系进行了实验分析，实验结果表明对于多数数据集，当树的数量为100时，就可以使分类精度达到要求。将随机森林和分类性能优越的支持向量机在精度方面进行了对比，实验结果表明随机森林的分类性能可以与支持向量机相媲美。%Random Forest(RF)is a kind of ensemble classifier. This paper analyses the parameters influencing the per-formance of RF, and the result shows that the number of trees in random forest has significant effect on its performance. This paper carries on a research and summary on the method of determining the number of trees and evaluating the perfor-mance index of RF, with the classification accuracy used as the evaluation method, utilizing UCI data sets, an experimental analysis on the relationship between the number of decision trees in random forest and the data sets has been done. The experimental result shows that for the majority of data sets, when the number of trees is 100, the classification accuracy can meet the requirement. This paper compares RF with support vector machine having superior classification perfor-mance in the aspect of accuracy, and the result shows that the classification performance of random forest is similar to that of support vector machine.
Improving Random Number Generators in the Monte Carlo simulations via twisting and combining
Deng, Lih-Yuan; Guo, Rui; Lin, Dennis K. J.; Bai, Fengshan
2008-03-01
Problems for various random number generators accompanying the Wolff algorithm [U. Wolff, Phys. Rev. Lett. 62 (1989) 361; U. Wolff, Phys. Lett. B 228 (1989) 379] are discussed, including the hidden errors first reported in [A.M. Ferrenberg, D.P. Landau, Y.J. Wong, Phys. Rev. Lett. 69 (1992) 3382]. A general (though simple) method of twisting and combining for improving the performance of these generators is proposed. Some recent generators motivated by such a twisting and combining method with extremely long period are discussed. The proposed method provides a novel and simple way to improve RNGs in its performance.
A Hardware Efficient Random Number Generator for Nonuniform Distributions with Arbitrary Precision
Directory of Open Access Journals (Sweden)
Christian de Schryver
2012-01-01
number generators is a very active research field. However, most state-of-the-art architectures are either tailored to specific distributions or use up a lot of hardware resources. At ReConFig 2010, we have presented a new design that saves up to 48% of area compared to state-of-the-art inversion-based implementation, usable for arbitrary distributions and precision. In this paper, we introduce a more flexible version together with a refined segmentation scheme that allows to further reduce the approximation error significantly. We provide a free software tool allowing users to implement their own distributions easily, and we have tested our random number generator thoroughly by statistic analysis and two application tests.
The exact distribution of the condition number of complex random matrices.
Shi, Lin; Gan, Taibin; Zhu, Hong; Gu, Xianming
2013-01-01
Let G(m×n) (m ≥ n) be a complex random matrix and W = G(m×n)(H)G(m×n) which is the complex Wishart matrix. Let λ1 > λ2 > …>λn > 0 and σ1 > σ2 > …>σn > 0 denote the eigenvalues of the W and singular values of G(m×n), respectively. The 2-norm condition number of G(m×n) is k2(G(m×n)) = √(λ1/λn) =σ1/σn. In this paper, the exact distribution of the condition number of the complex Wishart matrices is derived. The distribution is expressed in terms of complex zonal polynomials.
The Exact Distribution of the Condition Number of Complex Random Matrices
Directory of Open Access Journals (Sweden)
Lin Shi
2013-01-01
Full Text Available Let Gm×n (m≥n be a complex random matrix and W=Gm×nHGm×n which is the complex Wishart matrix. Let λ1>λ2>…>λn>0 and σ1>σ2>…>σn>0 denote the eigenvalues of the W and singular values of Gm×n, respectively. The 2-norm condition number of Gm×n is κ2Gm×n=λ1/λn=σ1/σn. In this paper, the exact distribution of the condition number of the complex Wishart matrices is derived. The distribution is expressed in terms of complex zonal polynomials.
Roberts, D.E.; Killiany, R.J.; Rosene, D.L.
2014-01-01
Normal aging is accompanied by changes in hypothalamic functions including autonomic and endocrine functions and circadian rhythms. The rhesus monkey provides an excellent model of normal aging without the potential confounds of incipient Alzheimer's disease inherent in human populations. This study examined the hypothalamus of 51 rhesus monkeys (23 male, 18 female, 6.5–31 years old) using design-based stereology to obtain unbiased estimates of neuron and glia numbers and the Cavalieri method to estimate volumes for eight reference spaces: total unilateral hypothalamus, suprachiasmatic nucleus (SCN), supraoptic nucleus (SON), paraventricular nucleus (PVN), dorsomedial nucleus (DM), ventromedial nucleus (VM), medial mammillary nucleus (MMN), and lateral hypothalamic area (LHA). The results demonstrated no age-related difference in neuron number, glia number, or volume in any area in either sex except the PVN of male monkeys, which showed a significant increase in both neuron and glia numbers with age. Comparison of males and females for sexual dimorphisms revealed no significant differences in neuron number. However, males had more glia overall as well as in the SCN, DM, and LHA and had a larger hypothalamic volume overall and in the SCN, SON, VM, DM, and MMN. These results demonstrate that hypothalamic neuron loss cannot account for age-related deficits in hypothalamic function and provides further evidence of the absence of neurode-generation and cell death in the normal aging rhesus monkey. PMID:21935936
Deke, John
2016-10-25
Cluster randomized controlled trials (CRCTs) often require a large number of clusters in order to detect small effects with high probability. However, there are contexts where it may be possible to design a CRCT with a much smaller number of clusters (10 or fewer) and still detect meaningful effects. The objective is to offer recommendations for best practices in design and analysis for small CRCTs. I use simulations to examine alternative design and analysis approaches. Specifically, I examine (1) which analytic approaches control Type I errors at the desired rate, (2) which design and analytic approaches yield the most power, (3) what is the design effect of spurious correlations, and (4) examples of specific scenarios under which impacts of different sizes can be detected with high probability. I find that (1) mixed effects modeling and using Ordinary Least Squares (OLS) on data aggregated to the cluster level both control the Type I error rate, (2) randomization within blocks is always recommended, but how best to account for blocking through covariate adjustment depends on whether the precision gains offset the degrees of freedom loss, (3) power calculations can be accurate when design effects from small sample, spurious correlations are taken into account, and (4) it is very difficult to detect small effects with just four clusters, but with six or more clusters, there are realistic circumstances under which small effects can be detected with high probability. © The Author(s) 2016.
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.
Comparison of numbers of interneurons in three thalamic nuclei of normal and epileptic rats.
Cavdar, Safiye; Bay, Hüsniye Hacioğlu; Yildiz, Sercan D; Akakin, Dilek; Sirvanci, Serap; Onat, Filiz
2014-06-01
The inhibitory sources in the thalamic nuclei are local interneurons and neurons of the thalamic reticular nucleus. Studies of models of absence epilepsy have shown that the seizures are associated with an excess of inhibitory neurotransmission in the thalamus. In the present study, we used light-microscopic gamma-aminobutyric acid (GABA) immunocytochemistry to quantify the interneurons in the lateral geniculate (LGN), ventral posteromedial (VPM), and ventral posterolateral (VPL) thalamic nuclei, and compared the values from normal Wistar rats and genetic absence epilepsy rats from Strasbourg (GAERS). We found that in both Wistar rats and GAERS, the proportion of interneurons was significantly higher in the LGN than in the VPM and VPL. In the LGN of Wistar rats, 16.4% of the neurons were interneurons and in the GAERS, the value was 15.1%. In the VPM, the proportion of interneurons was 4.2% in Wistar and 14.9% in GAERS; in the VPL the values were 3.7% for Wistar and 11.1% for the GAERS. There was no significant difference between Wistar rats and the GAERS regarding the counts of interneurons in the LGN, whereas the VPM and VPL showed significantly higher counts in GAERS. Comparison of the mean areas of both relay cells and interneuronal profiles showed no significant differences between Wistar rats and GAERS. These findings show that in the VPL and the VPM there are relatively more GABAergic interneurons in GAERS than in Wistar rats. This may represent a compensatory response of the thalamocortical circuitry to the absence seizures or may be related to the production of absence seizures.
Conjectures on the normal covering number of finite symmetric and alternating groups
Directory of Open Access Journals (Sweden)
Daniela Bubboloni
2014-06-01
Full Text Available Let gamma(Sn be the minimum number of proper subgroups Hi, i = 1,...,ell, of the symmetric group Sn such that each element in Sn lies in some conjugate of one of the Hi. In this paper we conjecture that gamma(Sn =(n/2(1-1/p_1 (1-1/p_2 + 2, where p1, p2 are the two smallest primes in the factorization of n and n is neither a prime power nor a product of two primes. Support for the conjecture is given by a previous result for the case where n has at most two distinct prime divisors. We give further evidence by confirming the conjecture for certain integers of the form n = 15q, for an infinite set of primes q, and by reporting on a Magma computation. We make a similar conjecture for gamma(An, when n is even, and provide a similar amount of evidence.
Oomens, Wouter; Maes, Joseph H. R.; Hasselman, Fred; Egger, Jos I. M.
2015-01-01
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 non-linear 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. PMID:26097449
Marino, Ricardo; Majumdar, Satya N.; Schehr, Grégory; Vivo, Pierpaolo
2016-09-01
Let Pβ(V )(NI) be the probability that a N ×N β -ensemble of random matrices with confining potential V (x ) has NI eigenvalues inside an interval I =[a ,b ] on the real line. We introduce a general formalism, based on the Coulomb gas technique and the resolvent method, to compute analytically Pβ(V )(NI) for large N . We show that this probability scales for large N as Pβ(V )(NI) ≈exp[-β N2ψ(V )(NI/N ) ] , where β is the Dyson index of the ensemble. The rate function ψ(V )(kI) , independent of β , is computed in terms of single integrals that can be easily evaluated numerically. The general formalism is then applied to the classical β -Gaussian (I =[-L ,L ] ), β -Wishart (I =[1 ,L ] ), and β -Cauchy (I =[-L ,L ] ) ensembles. Expanding the rate function around its minimum, we find that generically the number variance v a r (NI) exhibits a nonmonotonic behavior as a function of the size of the interval, with a maximum that can be precisely characterized. These analytical results, corroborated by numerical simulations, provide the full counting statistics of many systems where random matrix models apply. In particular, we present results for the full counting statistics of zero-temperature one-dimensional spinless fermions in a harmonic trap.
An Encryption Technique based upon Encoded Multiplier with Controlled Generation of Random Numbers
Directory of Open Access Journals (Sweden)
Sanjay Kumar Pal
2015-09-01
Full Text Available This paper presents an encryption technique based on independent random number generation for every individual message sent based upon a pass key which depends upon a secured telephonic conversation and the starting time of the conversation. . A multiplier technique is then applied on the plain text in order to generate the cipher text. The world runs on ciphers today and the generation of secure keys for producing a cipher asks for more simplicity yet requires much more effective cryptosystems which could generate a cipher with the most minimal complexity. Vedic Mathematics in itself offers a wide variety of techniques for encrypting a text which even involves concepts of elliptical curves, Vedic multiplier and so on. The Vedic Multiplier system is used for encoding and decoding and here we have used it to encrypt plain texts and generate a certain kind of cipher based on some random sequence of character equivalents and partial products. The objective of this paper will always resound for the development of a unique system which will ensure secrecy and authenticity for the private communication between two entities. The proposed idea can be implemented for inter-office message communication.
Baugher, Benjamin
2008-01-01
We prove the main conjecture from [M. R. Douglas, B. Shiffman and S. Zelditch, Critical points and supersymmetric vacua, II: Asymptotics and extremal metrics. J. Differential Geom. 72 (2006), no. 3, 381-427] concerning the metric dependence and asymptotic minimization of the expected number \\mathcal{N}^{crit}_{N,h} of critical points of random holomorphic sections of the Nth tensor power of a positive line bundle. The first non-topological term in the asymptotic expansion of \\mathcal{N}^{crit}_{N,h} is the the Calabi functional multiplied by the constant \\be_2(m) which depends only on the dimension of the manifold. We prove that \\be_2(m) is strictly positive in all dimensions, showing that the expansion is non-topological for all m, and that the Calabi extremal metric, when it exists, asymptotically minimizes \\mathcal{N}^{crit}_{N,h}.
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...
Directory of Open Access Journals (Sweden)
Paul eMiller
2013-05-01
Full Text Available Randomly connected recurrent networks of excitatory groups of neurons can possess a multitude of attractor states. When the internal excitatory synapses of these networks are depressing, the attractor states can be destabilized with increasing input. This leads to an itinerancy, where with either repeated transient stimuli, or increasing duration of a single stimulus, the network activity advances through sequences of attractor states. We find that the resulting network state, which persists beyond stimulus offset, can encode the number of stimuli presented via a distributed representation of neural activity with non-monotonic tuning curves for most neurons. Increased duration of a single stimulus is encoded via different distributed representations, so unlike an integrator, the network distinguishes separate successive presentations of a short stimulus from a single presentation of a longer stimulus with equal total duration. Moreover, different amplitudes of stimulus cause new, distinct activity patterns, such that changes in stimulus number, duration and amplitude can be distinguished from each other. These properties of the network depend on dynamic depressing synapses, as they disappear if synapses are static. Thus short-term synaptic depression allows a network to store separately the different dynamic properties of a spatially constant stimulus.
Institute of Scientific and Technical Information of China (English)
Nozha Chakroun-Feki; Patrice Therond; Martine Couturier; Florence Eustache; Gerard Limea; Alain Legrand; Pierre Jouannet; Jacques Auger
2009-01-01
The aim of this study was to investigate whether a relationship exists between the presence of low number of leukocytes in normal ovulatory cervical mucus and sperm quality and lipid content after migration. The percentages of live, motile and morphologically normal spermatozoa, movement parameters assessed by computer-aided sperm analysis (CASA), and ionophore-induced acrosome reaction measured by flow cytometry were determined before and after migration. High-performance liquid chromatography with ultraviolet detection was used to measure the sperm lipid content, including the various diacyl subspecies. The number of leukocytes found in solubilized mucus samples was counted using a haemocytometric method. Overall, the presence of leukocytes in the cervical mucus samples did not significantly influence sperm motility and morphology, sperm kinematic parameters, or the sperm content in sphingomyelin or cholesterol. In contrast, after migration, the decrease in various sperm diacyls and the level of induced acrosome reaction was significantly less pronounced in mucus samples containing ≥ 104 leukocytes than in mucus samples with no or rare leukocytes whereas the level of induced acrosome reaction was higher. The present data suggest that the low level of leukocytes found in normal ovulatory cervical mucus could influence the process of sperm lipid remodelling/capacitation.
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.
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-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.
Law of large numbers for a transient random walk driven by a symmetric exclusion process
Avena, Luca; Völlering, Florian
2011-01-01
We consider a one-dimensional simple symmetric exclusion process in equilibrium, constituting a dynamic random environment for a nearest-neighbor random walk that on occupied/vacant sites has two different local drifts to the right. We prove that the random walk has an a.s. positive constant global speed by using a regeneration-time argument. This result is part of an ongoing project aiming to analyze the behavior of random walks in slowly mixing dynamic random environments. A brief discussion on this topic is presented.
Mironowicz, Piotr; Tavakoli, Armin; Hameedi, Alley; Marques, Breno; Pawłowski, Marcin; Bourennane, Mohamed
2016-06-01
Quantum communication with systems of dimension larger than two provides advantages in information processing tasks. Examples include higher rates of key distribution and random number generation. The main disadvantage of using such multi-dimensional quantum systems is the increased complexity of the experimental setup. Here, we analyze a not-so-obvious problem: the relation between randomness certification and computational requirements of the post-processing of experimental data. In particular, we consider semi-device independent randomness certification from an experiment using a four dimensional quantum system to violate the classical bound of a random access code. Using state-of-the-art techniques, a smaller quantum violation requires more computational power to demonstrate randomness, which at some point becomes impossible with today’s computers although the randomness is (probably) still there. We show that by dedicating more input settings of the experiment to randomness certification, then by more computational postprocessing of the experimental data which corresponds to a quantum violation, one may increase the amount of certified randomness. Furthermore, we introduce a method that significantly lowers the computational complexity of randomness certification. Our results show how more randomness can be generated without altering the hardware and indicate a path for future semi-device independent protocols to follow.
Aging effect on Executive Control in the Random Number Generation Test
Directory of Open Access Journals (Sweden)
Amer Cavalheiro Hamdan
2006-12-01
Full Text Available The decline of abilities related to Executive Control –EC with aging has been related with the Pre-Frontal System neurobiological aging. This study compared the score obtained in the Random Number Generation Test (RNG by two groups: 30 college students (older than 18 and 36 elderly (older than 60. This last group was divided according to the criteria of schooling in up to 8 years of schooling and over 8 years of schooling. The results show that the younger participants scored 0,344 ± 0,04 in the RNG test; the elderly with up to 8 years of schooling punctuated 0,432 ± 0,10 and that those who studied for 9 years or more reached a mean of 0,393 ± 0,05. The statistical analysis of these data suggest that the elderly performance in the RNG test (0,420 ± 0,09 was significantly worse when compared to the performance of the younger participants (t (64 = -3,9927; p = 0,0001, which confirms that the manipulation and inhibitory control abilities of information are decreased in older people, probably due to the natural aging process of the Frontal Cortex. Keywords: neuropsychology; aging; executive functions.
Using common random numbers in health care cost-effectiveness simulation modeling.
Murphy, Daniel R; Klein, Robert W; Smolen, Lee J; Klein, Timothy M; Roberts, Stephen D
2013-08-01
To identify the problem of separating statistical noise from treatment effects in health outcomes modeling and analysis. To demonstrate the implementation of one technique, common random numbers (CRNs), and to illustrate the value of CRNs to assess costs and outcomes under uncertainty. A microsimulation model was designed to evaluate osteoporosis treatment, estimating cost and utility measures for patient cohorts at high risk of osteoporosis-related fractures. Incremental cost-effectiveness ratios (ICERs) were estimated using a full implementation of CRNs, a partial implementation of CRNs, and no CRNs. A modification to traditional probabilistic sensitivity analysis (PSA) was used to determine how variance reduction can impact a decision maker's view of treatment efficacy and costs. The full use of CRNs provided a 93.6 percent reduction in variance compared to simulations not using the technique. The use of partial CRNs provided a 5.6 percent reduction. The PSA results using full CRNs demonstrated a substantially tighter range of cost-benefit outcomes for teriparatide usage than the cost-benefits generated without the technique. CRNs provide substantial variance reduction for cost-effectiveness studies. By reducing variability not associated with the treatment being evaluated, CRNs provide a better understanding of treatment effects and risks. © Health Research and Educational Trust.
Institute of Scientific and Technical Information of China (English)
无
2006-01-01
The generalized linear model(GLM) based on the observed data with incomplete information in the case of random censorship is defined. Under the given conditions, the existence and uniqueness of the solution on the likelihood equations with respect to the parameter vector β of the model are discussed, and the consistency and asymptotic normality of the maximum likelihood estimator(MLE) ^βn are proved.
Liu, Fu-Dong; Pan, Zi-Qiang; Liu, Sen-Lin; Chen, Ling; Chen, Lu; Wang, Chun-Hong
2017-04-28
Due to the improvement of production technology and the adjustment of energy structure, as well as the town-ownership and private-ownership coal mines (TPCM) were closed or merged by national policy, the number of underground miner has changed comparing with 2004 in China, so collective dose and normalization collective dose in different type of coal mine should be changed at the same time. In this paper, according to radiation exposure by different ventilation condition and the annual output, the coal mines in China are divided into three types, which are named as national key coal mines (NKCM), station-owned local coal mines (SLCM) and TPCM. The number of underground coal miner, collective dose and normalization collective dose are estimated at present base on surveying annual output and production efficiency of raw coal in 2005-2014. The typical total value of the underground coal miners recommended in China is 5.1 million in 2005-2009, and in which there are respectively included 1 million, 0.9 million and 3.2 million for NKCM, SLCM and TPCM. There are total of 4.7 million underground coal miner in 2010-2014, and the respectively number for NKCM, SLCM and TPCM are 1.4 million, 1.2 million and 2.1 million. The collective dose in 2005-2009 is 11 335 man·Sv·y-1, and in which there are respectively included 280, 495 and 10 560 man·Sv·y-1 for NKCM, SLCM and TPCM. As far as 2010-2014, there are total of 7982 man·Sv·y-1, and 392, 660 and 6930 man·Sv·y-1 for each type of coal mines. Therefore, the main contributor of collective dose is from TPCM. The normalization collective dose in 2005-2009 is 0.0025, 0.015 and 0.117 man·Sv per 10 kt for NKCM, SLCM and TPCM, respectively. As far as 2010-2014, there are 0.0018, 0.010 and 0.107 man·Sv per 10 kt for each type of coal mines. The trend of normalization collective dose is decreased year by year. © The Author 2016. Published by Oxford University Press. All rights reserved. For Permissions, please
Aleixo, A. N. F.; Balantekin, A. B.
2015-12-01
We resolve the normal ordering problem for symmetric ( D ˆ + D ˆ - ) n and asymmetric ( Dˆ + r D ˆ - ) n strings of the nonlinear deformed ladder operators D ˆ ± for supersymmetric and shape-invariant potential systems, where r and n are positive integers. We provide exact and explicit expressions for their normal forms N { ( D ˆ + D ˆ - ) n } and N { ( Dˆ + r D ˆ - ) n } , where in N { . . . } all D ˆ - are at the right side. We find that the solutions involve sequence of expansion coefficients which, for r, n > 1, corresponds to the f-deformed generalization of the classical Stirling and Bell numbers of the second kind. We apply the general formalism for the translational shape-invariant potential systems as well as for the particular case of the harmonic oscillator potential system. We show that these numbers are obtained for families of polynomial expressions generated with the deformations parameters and the parameters related to the forms of the supersymmetric partner potentials.
Fujita, Naoto; Ono, Miharu; Tomioka, Tomoka; Deie, Masataka
2014-01-01
Use of mild hyperbaric oxygen less than 2 atmospheres absolute (2026.54 hPa) with normal air is emerging as a common complementary treatment for severe muscle injury. Although hyperbaric oxygen at over 2 atmospheres absolute with 100% O2 promotes healing of skeletal muscle injury, it is not clear whether mild hyperbaric oxygen is equally effective. The purpose of the present study was to investigate the impact of hyperbaric oxygen at 1.25 atmospheres absolute (1266.59 hPa) with normal air on muscle regeneration. The tibialis anterior muscle of male Wistar rats was injured by injection of bupivacaine hydrochloride, and rats were randomly assigned to a hyperbaric oxygen experimental group or to a non-hyperbaric oxygen control group. Immediately after the injection, rats were exposed to hyperbaric oxygen, and the treatment was continued for 28 days. The cross-sectional area of centrally nucleated muscle fibers was significantly larger in rats exposed to hyperbaric oxygen than in controls 5 and 7 days after injury. The number of CD68- or CD68- and CD206-positive cells was significantly higher in rats exposed to hyperbaric oxygen than in controls 24 h after injury. Additionally, tumor necrosis factor-α and interleukin-10 mRNA expression levels were significantly higher in rats exposed to hyperbaric oxygen than in controls 24 h after injury. The number of Pax7- and MyoD- or MyoD- and myogenin-positive nuclei per mm2 and the expression levels of these proteins were significantly higher in rats exposed to hyperbaric oxygen than in controls 5 days after injury. These results suggest that mild hyperbaric oxygen promotes skeletal muscle regeneration in the early phase after injury, possibly due to reduced hypoxic conditions leading to accelerated macrophage infiltration and phenotype transition. In conclusion, mild hyperbaric oxygen less than 2 atmospheres absolute with normal air is an appropriate support therapy for severe muscle injuries.
Energy Technology Data Exchange (ETDEWEB)
Yang, C; Liu, F; Tai, A; Gore, E; Johnstone, C; Li, X [Medical College of Wisconsin Milwaukee WI (United States)
2014-06-01
Purpose: To measure CT number (CTN) changes in tumor and normal lung as a function of radiation therapy (RT) dose during the course of RT delivery for lung cancer using daily IGRT CT images and single respiration phase CT images. Methods: 4D CT acquired during planning simulation and daily 3D CT acquired during daily IGRT for 10 lung cancer cases randomly selected in terms of age, caner type and stage, were analyzed using an in-house developed software tool. All patients were treated in 2 Gy fractions to primary tumors and involved nodal regions. Regions enclosed by a series of isodose surfaces in normal lung were delineated. The obtained contours along with target contours (GTVs) were populated to each singlephase planning CT and daily CT. CTN in term of Hounsfield Unit (HU) of each voxel in these delineated regions were collectively analyzed using histogram, mean, mode and linear correlation. Results: Respiration induced normal lung CTN change, as analyzed from single-phase planning CTs, ranged from 9 to 23 (±2) HU for the patients studied. Normal lung CTN change was as large as 50 (±12) HU over the entire treatment course, was dose and patient dependent and was measurable with dose changes as low as 1.5 Gy. For patients with obvious tumor volume regression, CTN within the GTV drops monotonically as much as 10 (±1) HU during the early fractions with a total dose of 20 Gy delivered. The GTV and CTN reductions are significantly correlated with correlation coefficient >0.95. Conclusion: Significant RT dose induced CTN changes in lung tissue and tumor region can be observed during even the early phase of RT delivery, and may potentially be used for early prediction of radiation response. Single respiration phase CT images have dramatically reduced statistical noise in ROIs, making daily dose response evaluation possible.
Local asymptotic normality and asymptotical minimax efficiency of the MLE under random censorship
Institute of Scientific and Technical Information of China (English)
王启华; 荆炳义
2000-01-01
Here we study the problems of local asymptotic normality of the parametric family of distri-butions and asymptotic minimax efficient estimators when the observations are subject to right censor-ing. Local asymptotic normality will be established under some mild regularity conditions. A lower bound for local asymptotic minimax risk is given with respect to a bowl-shaped loss function, and fur-thermore a necessary and sufficient condition is given in order to achieve this lower bound. Finally, we show that this lower bound can be attained by the maximum likelihood estimator in the censored case and hence it is local asymptotic minimax efficient.
Local asymptotic normality and asymptotical minimax efficiency of the MLE under random censorship
Institute of Scientific and Technical Information of China (English)
无
2000-01-01
Here we study the problems of local asymptotic normality of the parametric family of distributions and asymptotic minimax efficient estimators when the observations are subject to right censoring. Local asymptotic normality will be established under some mild regularity conditions. A lower bound for local asymptotic minimax risk is given with respect to a bowl-shaped loss function, and furthermore a necessary and sufficient condition is given in order to achieve this lower bound. Finally, we show that this lower bound can be attained by the maximum likelihood estimator in the censored case and hence it is local asymptotic minimax efficient.
On the Distribution of Norm of Vector Projection and Rejection of Two Complex Normal Random Vectors
Directory of Open Access Journals (Sweden)
Mehdi Maleki
2015-01-01
Full Text Available Vector projection and vector rejection are highly common and useful operations in mathematics, information theory, and signal processing. In this paper, we find the distribution of the norm of projection and rejection vectors when the original vectors are standard complex normally distributed.
The asymptotic distribution of a cluster-index for i.i.d. normal random variables
Yatracos, Yannis G.
2009-01-01
In a sample variance decomposition, with components functions of the sample's spacings, the largest component $\\tilde{I}_n$ is used in cluster detection. It is shown for normal samples that the asymptotic distribution of $\\tilde{I}_n$ is the Gumbel distribution.
Indian Academy of Sciences (India)
Ali Reza Ashrafi; Geetha Venkataraman
2004-08-01
Let be a finite group and be a normal subgroup of . We denote by $ncc(A)$ the number of -conjugacy classes of and is called -decomposable, if $ncc(A)=n$. Set $\\mathcal{K}_G=\\{ncc(A)|A\\vartriangleleft G\\}$. Let be a non-empty subset of positive integers. A group is called -decomposable, if $\\mathcal{K}_G=X$. Ashrafi and his co-authors [1–5] have characterized the -decomposable non-perfect finite groups for $X=\\{1,n\\}$ and ≤ 10. In this paper, we continue this problem and investigate the structure of -decomposable non-perfect finite groups, for $X=\\{1, 2, 3\\}$. We prove that such a group is isomorphic to $Z_6, D_8, Q_8, S_4$, Small Group (20,3), Small Group (24,3), where Small Group (, ) denotes the $m^{\\mathrm{th}}$ group of order in the small group library of GAP [11].
Efficient generation of correlated random numbers using Chebyshev-optimal magnitude-only IIR filters
Rodríguez, A; Johnson, Steven G.; Rodriguez, Alejandro
2007-01-01
We compare several methods for the efficient generation of correlated random sequences (colored noise) by filtering white noise to achieve a desired correlation spectrum. We argue that a class of IIR filter-design techniques developed in the 1970s, which obtain the global Chebyshev-optimum minimum-phase filter with a desired magnitude and arbitrary phase, are uniquely suited for this problem but have seldom been used. The short filters that result from such techniques are crucial for applications of colored noise in physical simulations involving random processes, for which many long random sequences must be generated and computational time and memory are at a premium.
Exact simulation of Brown-Resnick random fields at a finite number of locations
DEFF Research Database (Denmark)
Dieker, Ton; Mikosch, Thomas Valentin
2015-01-01
We propose an exact simulation method for Brown-Resnick random fields, building on new representations for these stationary max-stable fields. The main idea is to apply suitable changes of measure.......We propose an exact simulation method for Brown-Resnick random fields, building on new representations for these stationary max-stable fields. The main idea is to apply suitable changes of measure....
National Research Council Canada - National Science Library
Liu, Xuejiao; Shao, Chen; Wei, Lilong; Duan, Jindan; Wu, Shuzhen; Li, Xuewang; Li, Mingxi; Sun, Wei
2012-01-01
The urinary proteome has been widely used for biomarker discovery. A urinary proteome database from normal humans can provide a background for discovery proteomics and candidate proteins/peptides for targeted proteomics...
DEFF Research Database (Denmark)
Nielsen, J B; Sjöstrand, U H; Henneberg, S W
1991-01-01
-controlled intermittent positive-pressure ventilation; and SV-20P denotes pressure-controlled intermittent positive-pressure ventilation. With all modes of ventilation a PEEP of 7.5 cm H2O was used. In the abbreviations used, the number denotes the ventilatory frequency in breaths per minute (bpm). HFV indicates that all...
A Novel True Random Number Generator Based on Mouse Movement and a One-Dimensional Chaotic Map
Directory of Open Access Journals (Sweden)
Wang Xingyuan
2012-01-01
Full Text Available We propose a novel true random number generator using mouse movement and a one-dimensional chaotic map. We utilize the x-coordinate of the mouse movement to be the length of an iteration segment of our TRNs and the y-coordinate to be the initial value of this iteration segment. And, when it iterates, we perturb the parameter with the real value produced by the TRNG itself. And we find that the TRNG we proposed conquers several flaws of some former mouse-based TRNGs. At last we take experiments and test the randomness of our algorithm with the NIST statistical test suite; results illustrate that our TRNG is suitable to produce true random numbers (TRNs on universal personal computers (PCs.
Directory of Open Access Journals (Sweden)
Mortaza Jamshidian
2014-01-01
Full Text Available Researchers are often faced with analyzing data sets that are not complete. To prop- erly analyze such data sets requires the knowledge of the missing data mechanism. If data are missing completely at random (MCAR, then many missing data analysis techniques lead to valid inference. Thus, tests of MCAR are desirable. The package MissMech implements two tests developed by Jamshidian and Jalal (2010 for this purpose. These tests can be run using a function called TestMCARNormality. One of the tests is valid if data are normally distributed, and another test does not require any distributional assumptions for the data. In addition to testing MCAR, in some special cases, the function TestMCARNormality is also able to test whether data have a multivariate normal distribution. As a bonus, the functions in MissMech can also be used for the following additional tasks: (i test of homoscedasticity for several groups when data are completely observed, (ii perform the k-sample test of Anderson-Darling to determine whether k groups of univariate data come from the same distribution, (iii impute incomplete data sets using two methods, one where normality is assumed and one where no specific distributional assumptions are made, (iv obtain normal-theory maximum likelihood estimates for mean and covariance matrix when data are incomplete, along with their standard errors, and finally (v perform the Neymans test of uniformity. All of these features are explained in the paper, including examples.
Saddlepoint approximation based structural reliability analysis with non-normal random variables
Institute of Scientific and Technical Information of China (English)
无
2010-01-01
The saddlepoint approximation (SA) can directly estimate the probability distribution of linear performance function in non-normal variables space. Based on the property of SA, three SA based methods are developed for the structural system reliability analysis. The first method is SA based reliability bounds theory (RBT), in which SA is employed to estimate failure probability and equivalent normal reliability index for each failure mode firstly, and then RBT is employed to obtain the upper and the lower bounds of system failure probability. The second method is SA based Nataf approximation, in which SA is used to estimate the probability density function (PDF) and cumulative distribution function (CDF) for the approximately linearized performance function of each failure mode. After the PDF of each failure mode and the correlation coefficients among approximately linearized performance functions are estimated, Nataf distribution is employed to approximate the joint PDF of multiple structural system performance functions, and then the system failure probability can be estimated directly by numerical simulation using the joint PDF. The third method is SA based line sampling (LS). The standardization transformation is needed to eliminate the dimensions of variables firstly in this case. Then LS method can express the system failure probability as an arithmetic average of a set of failure probabilities of the linear performance functions, and the probabilities of the linear performance functions can be estimated by the SA in the non-normal variables space. By comparing basic concepts, implementations and results of illustrations, the following conclusions can be drawn: (1) The first method can only obtain the bounds of system failure probability and it is only acceptable for the linear limit state function; (2) the second method can give the estimation of system failure probability, and its error mostly results from the approximation of Nataf distribution for the
Random walk of a swimmer in a low-Reynolds-number medium
Garcia, Michaël; Berti, Stefano; Peyla, Philippe; Rafaï, Salima
2011-03-01
Swimming at a micrometer scale demands particular strategies. When inertia is negligible compared to viscous forces, hydrodynamics equations are reversible in time. To achieve propulsion, microswimmers must therefore deform in a way that is not invariant under time reversal. Here, we investigate dispersal properties of the microalga Chlamydomonas reinhardtii by means of microscopy and cell tracking. We show that tracked trajectories are well modeled by a correlated random walk. This process is based on short time correlations in the direction of movement called persistence. At longer times, correlation is lost and a standard random walk characterizes the trajectories. Moreover, high-speed imaging enables us to show how the back-and-forth motion of flagella at very short times affects the statistical description of the dynamics. Finally, we show how drag forces modify the characteristics of this particular random walk.
Scalable parallel physical random number generator based on a superluminescent LED
Li, Xiaowen; Murphy, Thomas E; Roy, Rajarshi
2011-01-01
We describe an optoelectronic system for simultaneously generating parallel, independent streams of random bits using spectrally separated noise signals obtained from a single optical source. Using a pair of non-overlapping spectral filters and a fiber-coupled superluminescent light-emitting diode (SLED), we produced two independent 10 Gb/s random bit streams, for a cumulative generation rate of 20 Gb/s. The system relies principally on chip-based optoelectronic components that could be integrated in a compact, economical package.
2007-11-02
specification of one of the tests coming from the DIEHARD 69 [1] battery of tests. It is based on the result of Kovalenko (1972) and also formulated in Marsaglia ...References for Test [1] George Marsaglia , DIEHARD: a battery of tests of randomness. http://stat.fsu.edu/˜geo/diehard.html. [2] I. N. Kovalenko (1972...Distribution of the linear rank of a random ma- trix,” Theory of Probability and its Applications. 17, pp. 342-346. [3] G. Marsaglia and L. H. Tsay
Three criteria for quantum random number generators based on beam splitters
Svozil, Karl
2009-01-01
We propose three criteria for the generation of random digital strings from quantum beam splitters: (i) three or more mutually exclusive outcomes corresponding to the invocation of three- and higher dimensional Hilbert spaces; (ii) the mandatory use of pure states in conjugated bases for preparation and detection; and (iii) the use of entangled singlet (unique) states for elimination of bias.
Asymptotic normality of the size of the giant component via a random walk
Bollobas, Bela
2010-01-01
In this paper we give a simple new proof of a result of Pittel and Wormald concerning the asymptotic value and (suitably rescaled) limiting distribution of the number of vertices in the giant component of $G(n,p)$ above the scaling window of the phase transition. Nachmias and Peres used martingale arguments to study Karp's exploration process, obtaining a simple proof of a weak form of this result. Here we use slightly different martingale arguments to obtain the full result of Pittel and Wormald with little extra work.
Fischbach, K. F.; Heisenberg, M.
1981-01-01
KS58, one out of six known alleles of the small optic lobes (sol) gene in Drosophila melanogaster, reduces the cell number in the medulla cortex by degeneration of ganglion cells in the pupae to about 50%. Also, about half the volume of the medulla and lobula complex neuropils is missing. Many Golgistained cells in the mutant optic lobes resemble their homologues in wild type. However, special classes of transmedullary columnar neurons projecting to the lobula or to both lobula and lobula plate are not seen in the mutant. Some neurons linking the lobula complex to the central brain send branches to the medulla (the branches do not exist in wild type); some other types seem to be missing. The fate mapping of the KS58 focus reveals a location ventral to the head bristles and in sine oculis (so) flies the mutation further reduces the rudiments of the optic lobes normally seen. Therefore the sol phenotype is not induced by mutant eyes and the primary gene action seems to be on nervous tissue. The structural alterations of the small optic lobes are reflected in visual orientation behavior. The optomotor yaw response, however, is almost quantitatively preserved. The respective neural network should still be present in the mutant optic lobes. Images PMID:16592962
Qi, Bing; Lo, Hoi-Kwong; Qian, Li
2009-01-01
In this paper, we present a high speed random number generation scheme based on measuring the quantum phase noise of a single mode diode laser operating at a low intensity level near the lasing threshold. A delayed self-heterodyning system has been developed to measure the random phase fluctuation. We experimentally investigate this random number generation scheme under two different operating conditions: with or without active phase stabilization of the fiber interferometer in the self-heterodyning system. The achieved random number generation rates are 500Mbit/s and 50Mbit/s, respectively. The generated random numbers have passed all the DIEHARD tests.
Expected number of distinct sites visited by N random walks in the presence of an absorbing boundary
Energy Technology Data Exchange (ETDEWEB)
Larralde, Hernan [Centro de Ciencias Fisicas, UNAM, Av. Universidad s/n Col. Chamilpa 62210, Cuernavaca Mor. (Mexico); Weiss, George H [Center for Information Technology, National Institutes of Health, Bethesda, MD 20892 (United States)
2003-08-08
In earlier work we have studied the expected number of distinct sites (ENDS) visited by N random walkers in time t on a translationally invariant lattice. Optical applications suggest the interest in analysing the same problem for a semi-infinite lattice in three dimensions bounded by a plane of absorbing sites. We here study this problem, showing a multiplicity of time regimes, and at the longest times showing that the ENDS is proportional to N{radical}t where t is the time. In the absence of a boundary the comparable result is proportional to Nt. Thus, the boundary effect eliminates approximately {radical}t random walks.
Typical kernel size and number of sparse random matrices over GF(q) - a statistical physics approach
Alamino, Roberto C.; Saad, David
2008-01-01
Using methods of statistical physics, we study the average number and kernel size of general sparse random matrices over GF(q), with a given connectivity profile, in the thermodynamical limit of large matrices. We introduce a mapping of $GF(q)$ matrices onto spin systems using the representation of the cyclic group of order q as the q-th complex roots of unity. This representation facilitates the derivation of the average kernel size of random matrices using the replica approach, under the re...
CONVERGENCE RATES IN THE LAW OF LARGE NUMBERS FOR B-VALUED RANDOM ELEMENTS
Institute of Scientific and Technical Information of China (English)
梁汉营; 王丽
2001-01-01
The author discusses necessary and sufficient conditions of the complete convergence for sums of B-valued independent but not necessarily identically distributed r.v.'s in Banach space of type p, and obtains characterization of Banach space of type p in terms of the complete convergence. A series of classical results on iid real valued r.v.'s are extended. As application authors give the analogous results for randomly indexed sums.
Effects of submaximal steady -state aerobic exercise and fitness in random number generation test
Directory of Open Access Journals (Sweden)
ANTONIOS K. TRAVLOS
2009-01-01
Full Text Available The aim of this study was two-fold. Firstly we wanted to quantify the relationship of isokinetic muscle strength (IMS and long jump performance (LJP in young jumpers, and secondly to compare males and females in IMS. Our measurements in 7 males and 7 females showed that the LJP was correlated with the normalized peak joint moment of the concentric knee extensions and the concentric ankle plantar flexions. A low correlation was observed between the LJP and the eccentric knee extensions. The t-test showed significant gender differences in joint peak moment of concentric knee extensions and in normalized peak joint moment of concentric plantar flexions and eccentric plantar flexions at120 deg/sec. Although, our findings suggest that IMS is a major contributor to LJP, it is suggested that training intervention should not be based exclusively on isokinetic tests because of the differences in musculoskeletal function between the two movements.
Sabourin, Jeanelle N; Van Thournout, Rhonda; Jain, Venu; Demianczuk, Nestor; Flood, Cathy
2014-07-01
Objectif : Comparer la confiance des étudiants de médecine en stage clinique, pour ce qui est de l’exécution d’une simulation d’accouchement vaginal normal (AVN), à la suite de leur participation à une session de formation en simulation au moyen de deux modèles différents. Méthodes : Des étudiants de médecine ont été affectés, au hasard, à une session de simulation d’AVN faisant appel à un mannequin obstétrical ou à une session de simulation faisant appel à un modèle de bassin simulant l’accouchement. Des questionnaires ont été utilisés pour évaluer la confiance et la simulation avant et immédiatement après la session, ainsi qu’au cours de la dernière journée de la rotation en obstétrique. Résultats : Cent dix étudiants ont été affectés au hasard à l’un ou l’autre des groupes de simulation. Au début du stage clinique, les deux groupes présentaient des niveaux de confiance et d’exposition à la pratique obstétricale semblables. Seulement 15 étudiants (13,9 %) étaient d’avis qu’ils étaient prêts à tenter un AVN de façon indépendante ou sous une supervision minimale. Cette proportion a connu une hausse considérable en passant à 43 étudiants (39,4 %) immédiatement après la session de simulation. À la fin du stage clinique, 79 des 81 étudiants répondants (97,5 %) étaient confiants de pouvoir tenter un AVN de façon indépendante ou sous une supervision minimale. Aucune différence significative n’a été constatée entre les groupes de simulation à quelque moment que ce soit. Les sessions ont été évaluées comme étant tout aussi utiles et réalistes les unes que les autres; cette constatation est demeurée la même à la fin du stage clinique. Conclusion : La formation faisant appel à la simulation d’un AVN au moyen d’un mannequin obstétrical ou d’un modèle de bassin simulant l’accouchement offre aux étudiants en stage clinique une expérience positive et accroît imm
Wahl, Michael; Leifgen, Matthias; Berlin, Michael; Röhlicke, Tino; Rahn, Hans-Jürgen; Benson, Oliver
2011-04-01
We report the implementation of a quantum random number generator based on photon arrival times. Due to fast and high resolution timing we are able to generate the highest bitrate of any current generator based on photon arrival times. Bias in the raw data due to the exponential distribution of the arrival times is removed by postprocessing which is directly integrated in the field programmable logic of the timing electronics.
基于光量子的真随机源%TRUE RANDOM NUMBER GENERATOR BASED ON A PHOTON BEAMSPLITTER
Institute of Scientific and Technical Information of China (English)
廖静; 梁创; 魏亚军; 吴令安; 潘少华; 姚德成
2001-01-01
A quantum optical true random number generator based on splitting a beam of photons at a 50/50 beamsplitter has been demonstrated.A continuous stream of random numbers at a rate of 200 kbit/s can be generated.A mathematical method (Huffman coding and data compressing) is used to improve the ratio of 0 and 1 bits in the original random number arrays.%介绍基于单光子的量子随机性产生二元真随机序列的实验以及所采用的数学处理方法。实验利用单光子探测器，较高速的信号处理电路和计算机数据采集系统，接收记录随机选择反射或折射路径通过50/50分束器的光子，从而获得原始的二元随机序列。用Huffman编码方法把原始数据压缩为符合密码学要求的真随机序列。随机序列采集的速率理论上可达200 kbit/s.
Tomita, Toshihiro; Miyaji, Kousuke
2016-04-01
The dependence of random telegraph noise (RTN) amplitude distribution on the number of traps and trap depth position is investigated using three-dimensional Monte Carlo device simulation including random dopant fluctuation (RDF) in a 30 nm NAND multi level flash memory. The ΔV th tail distribution becomes broad at fixed double traps, indicating that the number of traps greatly affects the worst RTN characteristics. It is also found that for both fixed single and fixed double traps, the ΔV th distribution in the lowest cell threshold voltage (V th) state shows the broadest distribution among all cell V th states. This is because the drain current flows at the channel surface in the lowest cell V th state, while at a high cell V th, it flows at the deeper position owing to the fringing coupling between the control gate (CG) and the channel. In this work, the ΔV th distribution with the number of traps following the Poisson distribution is also considered to cope with the variations in trap number. As a result, it is found that the number of traps is an important factor for understanding RTN characteristics. In addition, considering trap position in the tunnel oxide thickness direction is also an important factor.
Raghukumar, Kaustubha; Colosi, John A
2015-05-01
In an earlier article, the statistical properties of mode propagation were studied at a frequency of 1 kHz in a shallow water environment with random sound-speed perturbations from linear internal waves, using a hybrid transport theory and Monte Carlo numerical simulations. Here, the analysis is extended to include the effects of random linear surface waves, in isolation and in combination with internal waves. Mode coupling rates for both surface and internal waves are found to be significant, but strongly dependent on mode number. Mode phase randomization by surface waves is found to be dominated by coupling effects, and therefore a full transport theory treatment of the range evolution of the cross mode coherence matrix is needed. The second-moment of mode amplitudes is calculated using transport theory, thereby providing the mean intensity while the fourth-moment is calculated using Monte Carlo simulations, which provides the scintillation index. The transport theory results for second-moment statistics are shown to closely reproduce Monte Carlo simulations. Both surface waves and internal waves strongly influence the acoustic field fluctuations.
DEFF Research Database (Denmark)
Feng, Ju; Shen, Wen Zhong; Xu, Chang
2016-01-01
A new algorithm for multi-objective wind farm layout optimization is presented. It formulates the wind turbine locations as continuous variables and is capable of optimizing the number of turbines and their locations in the wind farm simultaneously. Two objectives are considered. One is to maximi...
Trident, a new pseudo random number generator based on coupled chaotic maps
Orue, A B; Guerra, A; Pastor, G; Romera, M; Montoya, F
2010-01-01
This article describes a new family of cryptographically secure pseudorandom number generators, based on coupled chaotic maps, that will serve as keystream in a stream cipher. The maps are a modification of a piecewise linear map, by dynamic changing of the coefficient values and perturbing its lesser significant bits.
Kalayeh, H. M.; Landgrebe, D. A.
1983-01-01
A criterion which measures the quality of the estimate of the covariance matrix of a multivariate normal distribution is developed. Based on this criterion, the necessary number of training samples is predicted. Experimental results which are used as a guide for determining the number of training samples are included. Previously announced in STAR as N82-28109
Directory of Open Access Journals (Sweden)
H. Mussavi
2005-08-01
Full Text Available Background:Acute bronchiolitis is the most common form of lower respiratory tract infection in infancy.There are numerous contradictory reports regarding the efficacy of nebulized bronchodilators in the management of infants with acute bronchiolitis. This study was designed to compare the efficacy of nebulized epinephrine with salbutamol for treatment of the disease.Methods:In a randomized clinical trial, 72 infants with moderately severe bronchiolitis were enrolled in three equal groups. Three doses of epinephrine, salbutamol, and normal saline as a placebo nebulized with oxygen were given at 20 minute intervals. Oxygen saturation, respiratory rate and distress were recorded before intervention and I0 minutes after each dose of the drugs. Results: At the end of the study, pre- and post-treatment mean oxygen saturation values, clinical scores and respiratory rates showed significant differences between the epinephrine and salbutamol groups in comparison with the placebo group. The results were more significant in the epinephrine group than other groups. After the treatment course 66%, 50%, and 25% of patients in epinephrine, salbutamol, and placebo groups respectively showed significant improvement at a degree that they could be sent home. No serious side effects were observed.Conclusion: Both nebulized epinephrine and salbutamol improved oxygenation and decreased respiratory distress better than normal saline. L-epinephrim was more effective in relieving respiratory distress and improving oxygen saturation as well as the need for hospitalization than nebulized salbutamol.
Orsag, Alesa; Ponikvar, Rafael; Buturovic-Ponikvar, Jadranka
2016-01-01
Background Regional citrate anticoagulation (RCA) during hemodialysis interferes with calcium homeostasis. Optimal ionized calcium (iCa) target range during RCA and consequent calcium balance are unknown. Methods In a randomized controlled trial (ACTRN12613001029785) 30 chronic hemodialysis patients were assigned to normal (1.1–1.2 mmol/) or low (0.95–1.05 mmol/l) iCa target range during a single hemodialysis with RCA. The primary outcome was calcium mass balance during the procedure, using a partial spent dialysate collection method; magnesium mass balance was also measured. Intact parathormone (iPTH), total calcium (tCa) and magnesium were measured before and after procedures. Results Mean iCa during procedures was significantly different in the two groups (1.12±0.06 in normal and 1.06±0.07 mmol/l in low iCa group, p <0.001), resulting in different tCa (2.18±0.22 vs. 1.95±0.17, p = 0.003) after the procedure. Mean delivered calcium during the procedure was 58.3±4.8 mmol in the normal and 51.5±8.2 mmol in the low iCa group (p = 0.010), which resulted in a significantly higher mean positive calcium mass balance of 14.6±8.3 mmol (584±333 mg) per procedure in normal as compared to 7.2±8.5 mmol (290±341 mg) in low iCa group (p = 0.024). Linear mixed effects model showed a significant interaction effect of time and iCa target range group on iPTH, i.e. a significant increase in iPTH in the low as compared to normal iCa target group (p = 0.008). Magnesium mass balance was mildly negative and comparable in both groups. Conclusions Low iCa target range resulted in a significantly less positive calcium mass balance, but in a significant increase in iPTH. To achieve a more neutral calcium balance, we recommend allowing a mild hypocalcemia during hemodialysis with RCA, especially when it is used for prolonged periods. PMID:28030601
A new technique for ultra-fast physical random number generation using optical chaos
Elsonbaty, Amr; Obayyaa, Salah S A
2016-01-01
In this paper, we numerically demonstrate a new extraction scheme for generating ultra-fast physically random sequence of bits. For this purpose, we utilize a dual-channel optical chaos source with suppressed time delayed (TD) signature in both the intensity and the phase of its two channels. The proposed technique uses M 1-bit analog-to-digital converters (ADCs) to compare the level of the chaotic intensity signal at time t with its levels after incommensurable delay-interval Tm, where m = {1,2,...,M}. The binary output of each 1-bit ADC is then sampled by a positive-edge-triggered D flip-flop. The clock sequence applied to the flip-flops is relatively delayed such that the rising edge of the clock triggering the m flip-flop precedes the rising edge of the clock of a subsequent m+1 flip-flop by a fixed period. The outputs of all flip-flops are then combined by means of a parity-check logic. Numerical simulations are carried out using values of parameters at which TD signature is suppressed for chosen values ...
Feng, Ju; Shen, Wen Zhong; Xu, Chang
2016-09-01
A new algorithm for multi-objective wind farm layout optimization is presented. It formulates the wind turbine locations as continuous variables and is capable of optimizing the number of turbines and their locations in the wind farm simultaneously. Two objectives are considered. One is to maximize the total power production, which is calculated by considering the wake effects using the Jensen wake model combined with the local wind distribution. The other is to minimize the total electrical cable length. This length is assumed to be the total length of the minimal spanning tree that connects all turbines and is calculated by using Prim's algorithm. Constraints on wind farm boundary and wind turbine proximity are also considered. An ideal test case shows the proposed algorithm largely outperforms a famous multi-objective genetic algorithm (NSGA-II). In the real test case based on the Horn Rev 1 wind farm, the algorithm also obtains useful Pareto frontiers and provides a wide range of Pareto optimal layouts with different numbers of turbines for a real-life wind farm developer.
Directory of Open Access Journals (Sweden)
Rochman Mujayanto
2017-03-01
Full Text Available Background: Therapy for chronic ulcer in diabetic patient is by modifying local inflammation response using drugs that acts as immunomodulator, neuromodulator and growth factors stimulator. Topical zinc is one of drug that can modifiy local inflammation response, immunostimulation or immunosuppresion. Purpose: This study was to prove about the number of macrophage in oral ulcer between normal and diabetes microscopically and the difference if treated by 1% ZnSO4 gel topically. Method: Ulcer in lower labial mucosa was made in normal and diabetic Wistar rats (induced by STZ, then applied 1% ZnSO4 gel and CMC-Na gel as control. They were decapitated in third and fifth day and specimen was made by processing lower labial mucosa Result: Microscopically, the result showed the number of macrophages in oral ulcer in diabetic condition was significantly higher than normal and the application of 1% ZnSO4 increased the number of macrophages in fifth day. Conclusion: The number of macrophages was higher in diabetic than normal condition, and was proven that topical application of 1% ZnSO4 increased the number macrophages of oral ulcer diabetic and normal condition.
Stephen, Shine; Agnihotri, Meenakshi; Kaur, Sukhpal
2016-06-01
Insulin has been used in wound healing to increase wound collagen, granulation tissue, wound tensile strength, and local production of insulin-like growth factors by fibroblasts. Saline is a widely used irrigating and wound dressing solution. Patients admitted to an acute care facility who had a Grade 2 or Grade 3 pressure ulcer were recruited to participate in a randomized, controlled trial to compare the effect of normal saline-impregnated gauze and insulin dressing in pressure ulcer healing. Persons with immunodeficiency, diabetes mellitus, pregnancy, osteomyelitis, and peripheral vascular illness were not eligible for the study. Study participants were randomized to receive either normal saline dressing gauze or insulin dressing twice daily for 7 days. At baseline, patient demographic data and ulcer history were recorded. Baseline and follow-up ulcer assessments (days 4 and day 7) included ulcer measurement (length and width) and completion of the Pressure Ulcer Scale for Healing (PUSH version 3.0) tool. Patients in the control group received dressings of sterile gauze soaked with normal saline; patients in the intervention group received topical insulin (1 U/cm2 wound area). The insulin was sprayed over the wound surface with an insulin syringe, allowed to dry for 15 minutes, and then covered with sterile gauze. To ascertain the safety of study participants, blood glucose levels were measured with a glucometer 10 minutes before and 1 hour after the topical insulin application in the intervention group. Treatment efficacy was deter- mined by assessing the reduction in wound area and PUSH scores at follow-up. Statistical analysis was performed; data are expressed as mean ± SD and percentage for continuous and categorical variables respectively. The differences in PUSH score and ulcer sizes between the 2 groups were analyzed using independent t-test, and within-group differences were analyzed using ANOVA with repeated measures; Greenhouse-Geisser correction was
A CLASS OF RANDOM NUMBER GENERATORS BASED ON WEYL SEQUENCE%一类基于Weyl序列的随机数发生器
Institute of Scientific and Technical Information of China (English)
梁恒; 刘庆华; 白峰杉
2005-01-01
The generation of good pseudo-random numbers is the base of many important fields in scientific computing, such as randomized algorithms and numerical solution of stochastic differential equations.In this paper, a class of random number generators (RNGs) based on Weyl sequence is proposed.The uniformity of those RNGs is proved theoretically.Statistical and numerical computations show the efficiency of the methods.
Directory of Open Access Journals (Sweden)
Songul CINAROGLU
2015-10-01
Full Text Available Objective: Random Forest (RF is one of machine learning techniques which is used for classification and regression with generating number of trees. There is a debate in the literature about how generating different number of trees reflects classification performance of this method. For this reason the aim of this study is to observe RF performance results by generating different number of trees and changing ''k'' parameter in cross validation while classifying OECD countries according to health expenditures. Material and Methods: In this dataset k-fold cross validation was implemented and Mann Whitney U test was used whether there is a difference in RF performance results using AUC when ''k'' parameter was high (k≥13 or low (k˂13 and while generating different number of trees (50, 100, 150, 200, 250. Results: Results of this study shows that generating different number of trees in RF not makes any significant changes (p˃0.05 in performance results. It was seen that perceived health status was a variable which has more information gain for predicting health expenditures. Conclusion: It is advisable for future studies related with this subject to examine performance results of different datasets which are in different types and sizes.
Wang, Yonggang; Hui, Cong; Liu, Chong; Xu, Chao
2016-04-01
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.
Wang, Yonggang; Hui, Cong; Liu, Chong; Xu, Chao
2016-04-01
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.
Olsen Nanna; Buch-Andersen Tine; Händel Mina; Østergaard Louise; Pedersen Jeanett; Seeger Charlotte; Stougaard Maria; Trærup Maria; Livemore Kate; Mortensen Erik; Holst Claus; Heitmann Berit
2012-01-01
Abstract Background Research shows that obesity prevention has to start early. Targeting interventions towards subgroups of individuals who are predisposed, but yet normal weight, may prove more effective in preventing overweight than interventions towards unselected normal weight subsets. Finally, interventions focused on other factors than diet and activity are lacking. The objectives were to perform a randomized, controlled intervention aiming at preventing overweight in children aged 2–6 ...
Energy Technology Data Exchange (ETDEWEB)
Hossain, S; Hildebrand, K; Ahmad, S [University of Oklahoma Health Science Center, Oklahoma City, OK (United States); Larson, D; Ma, L [University of California San Francisco, San Francisco, CA (United States); Sahgal, A [University of Toronto, Toronto, Ontario (Canada)
2014-06-01
Purpose: Intensity modulated arc beams have been newly reported for treating multiple brain metastases. The purpose of this study was to determine the variations in the normal brain doses with increasing number of arc beams for multiple brain metastases treatments via the TrueBeam Rapidarc system (Varian Oncology, Palo Alto, CA). Methods: A patient case with 12 metastatic brain lesions previously treated on the Leksell Gamma Knife Perfexion (GK) was used for the study. All lesions and organs at risk were contoured by a senior radiation oncologist and treatment plans for a subset of 3, 6, 9 and all 12 targets were developed for the TrueBeam Rapidarc system via 3 to 7 intensity modulated arc-beams with each target covered by at least 99% of the prescribed dose of 20 Gy. The peripheral normal brain isodose volumes as well as the total beam-on time were analyzed with increasing number of arc beams for these targets. Results: All intensisty modulated arc-beam plans produced efficient treatment delivery with the beam-on time averaging 0.6–1.5 min per lesion at an output of 1200 MU/min. With increasing number of arc beams, the peripheral normal brain isodose volumes such as the 12-Gy isodose line enclosed normal brain tissue volumes were on average decreased by 6%, 11%, 18%, and 28% for the 3-, 6-, 9-, 12-target treatment plans respectively. The lowest normal brain isodose volumes were consistently found for the 7-arc treatment plans for all the cases. Conclusion: With nearly identical beam-on times, the peripheral normal brain dose was notably decreased when the total number of intensity modulated arc beams was increased when treating multiple brain metastases. Dr Sahgal and Dr Ma are currently serving on the board of international society of stereotactic radiosurgery.
DEFF Research Database (Denmark)
Ohm-Laursen, Line; Nielsen, Christian; Fisker, Niels
2008-01-01
and the patient had eosinophilia. These presentations are consistent with atypical severe combined immunodeficiency (SCID)/Omenn Syndrome and the diagnosis was confirmed by demonstration of homozygosity for the R841W mutation in the catalytic core of RAG1. Comparison of the patient's immunoglobulin heavy chain...... chromosome 14. CONCLUSION: We hypothesize that the R841W mutation causes a malfunction of RAG1 that has differential outcome on V(D)J recombination in B and T cells, as the patient had normal B cell numbers but suffered severe alpha-beta T-cell immunodeficiency.......INTRODUCTION: A 2.5-month old boy presented with recurrent wheezing, protracted diarrhea, erythrodermia, and failure to thrive. METHODS AND RESULTS: Laboratory analysis showed lymphocytopenia with severely reduced T-cell numbers but normal numbers of B and NK cells. Serum IgE was increased...
Records for the number of distinct sites visited by a random walk on the fully-connected lattice
Turban, L
2016-01-01
We consider a random walk on the fully-connected lattice with $N$ sites and study the time evolution of the number of distinct sites $s$ visited by the walker on a subset with $n$ sites. A record value $v$ is obtained for $s$ at a record time $t$ when the walker visits a site of the subset for the first time. The record time $t$ is a partial covering time when $v
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.
Dyadkin, Iosif G.; Hamilton, Kenneth G.
1997-12-01
Over two hundred congruential pseudorandom number generators, each with a different multiplier, are built into a single assembler routine that returns 32-bit integer and floating-point values. This gives a Monte Carlo user the opportunity of selecting a combination of sequences, so as to provide a greater appearance of chaos. The software makes use of extended 64-bit arithmetic on Intel 386/387 (or higher) chips, thus attaining a period of 2 62 for each of the individual generators. The routine also features entry points that more directly support certain applications, such as well logging in nuclear geophysics. In addition to the customary uniform (0,1) "white noise" generator, the package provides values distributed according to the exponential and Gaussian distributions, random unit vectors in two and three dimensions, as well as Klein-Nishina and neutron scattering distributions.
Energy Technology Data Exchange (ETDEWEB)
Greenhaw, G.A.; Stone, C.; Milewicz, D. [Univ. of Texas Health Science Center, Houston, TX (United States)
1994-09-01
Lujan syndrome is an X-linked condition that includes mild-to-moderate mental retardation, poor social integration, normal secondary sexual development with normal testicular size, generalized hypotonia, hypernasal voice and dolichostenomelia. Major cardiac complications and lens dislocation have not been reported although severe myopia may occur. All reported cases have had negative cytogenetic screening for fra(X) syndrome but establishing this constellation of findings as a distinctive entity has been difficult. We report 4 males in two sibships with clinical findings consistent with Lujan syndrome, normal karyotypes, negative cytogenetic screening for fra(X) syndrome and a normal number of CGG repeats in the FMR-1 gene. Dermal fibroblasts explanted from one of the affected males were used to study fibrillin synthesis secretion and extracellular matrix incorporation into microfibrils. Cells from the affected individual showed normal synthesis and secretion of fibrillin when compared to control cells, but the fibrillin was not incorporated into the extracellular matrix. These results suggest the presence of a gene on the X chromosome which may play a role in microfibril assembly and when deficient may disrupt the incorporation of fibrillin into microfibrils. This may be important not only in normal body morphogenesis but also in the development/function of the brain. More affected individuals are needed to investigate these findings further.
Energy Technology Data Exchange (ETDEWEB)
Yamamoto, Yoshinobu, E-mail: yamamotoy@yamanashi.ac.jp [Division of Mechanical Engineering, University of Yamanashi, 4-3-11 Takeda, Kofu 400-8511 (Japan); Kunugi, Tomoaki, E-mail: kunugi@nucleng.kyoto-u.ac.jp [Department of Nuclear Engineering, Kyoto University, C3-d2S06, Kyoto-Daigaku Katsura, Nishikyo-Ku 615-8540, Kyoto (Japan)
2016-11-01
Highlights: • We show the applicability to predict the heat transfer imposed on a uniform wall-normal magnetic field by means of the zero-equation heat transfer model. • Quasi-theoretical turbulent Prandtl numbers with various molecular Prandtl number fluids were obtained. • Improvements of the prediction accuracy in turbulent kinetic energy and turbulent dissipation rate under the magnetic fields were accomplished. - Abstract: Zero-equation heat transfer models based on the constant turbulent Prandtl number are evaluated using direct numerical simulation (DNS) data for fully developed channel flows imposed on a uniform wall-normal magnetic field. Quasi-theoretical turbulent Prandtl numbers are estimated by DNS data of various molecular Prandtl number fluids. From the viewpoint of highly-accurate magneto-hydrodynamic (MHD) heat transfer prediction, the parameters of the turbulent eddy viscosity of the k–É› model are optimized under the magnetic fields. Consequently, we use the zero-equation model based on a constant turbulent Prandtl number to demonstrate MHD heat transfer, and show the applicability of using this model to predict the heat transfer.
Balakotaiah, V.
1996-01-01
We examined the effect of the gas flow on the liquid film when the gas flows in the countercurrent direction in a vertical pipe at normal gravity conditions. The most dramatic effect of the simultaneous flow of gas and liquid in pipes is the greatly increased transport rates of heat, mass, and momentum. In practical situations this enhancement can be a benefit or it can result in serious operational problems. For example, gas-liquid flow always results in substantially higher pressure drop and this is usually undesirable. However, much higher heat transfer coefficients can be expected and this can obviously be of benefit for purposes of design. Unfortunately, designers know so little of the behavior of such two phase systems and as a result these advantages are not utilized. Due to the complexity of the second order boundary model as well as the fact that the pressure variation across the film is small compared to the imposed gas phase pressure, the countercurrent gas flow affect was studied for the standard boundary layer model. A different stream function that can compensate the shear stress affect was developed and this stream function also can predict periodic solutions. The discretized model equations were transformed to a traveling wave coordinate system. A stability analysis of these sets of equations showed the presence of a Hopf bifurcation for certain values of the traveling wave velocity and the shear stress. The Hopf celerity was increased due to the countercurrent shear. For low flow rate the increases of celerity are more than for the high flow rate, which was also observed in experiments. Numerical integration of a traveling wave simplification of the model also predicts the existence of chaotic large amplitude, nonperiodic waves as observed in the experiments. The film thickness was increased by the shear.
Directory of Open Access Journals (Sweden)
Deshpande Sudheer
2008-01-01
Full Text Available Objective : To study the efficacy of yoga on Guna (yogic personality measure and general health in normal adults. Methods : Of the 1228 persons who attended introductory lectures, 226 subjects aged 18-71 years, of both sexes, who satisfied the inclusion and exclusion criteria and who consented to participate in the study were randomly allocated into two groups. The Yoga(Y group practised an integrated yoga module that included asanas , pranayama , meditation, notional correction and devotional sessions. The control group practised mild to moderate physical exercises (PE. Both groups had supervised practice sessions (by trained experts for one hour daily, six days a week for eight weeks. Guna (yogic personality was assessed before and after eight weeks using the self-administered Vedic Personality Inventory (VPI which assesses Sattva (gentle and controlled, Rajas (violent and uncontrolled and Tamas (dull and uncontrolled. The general health status (total health, which includes four domains namely somatic symptoms (SS, anxiety and insomnia (AI, social dysfunction (SF and severe depression (SP, was assessed using a General Health Questionnaire (GHQ. Results : Baseline scores for all the domains for both the groups did not differ significantly ( P > 0.05, independent samples t test. Sattva showed a significant difference within the groups and the effect size was more in the Y than in the PE group. Rajas showed a significant decrease within and between the groups with a higher effect size in the PE group. Tamas showed significant reduction within the PE group only. The GHQ revealed that there was significant decrease in SS, AI, SF and SP in both Y and PE groups (Wilcoxcon Singed Rank t test. SS showed a significant difference between the groups (Mann Whitney U Test. Conclusions : There was an improvement in Sattva in both the Yoga and control groups with a trend of higher effect size in Yoga; Rajas reduced in both but significantly better in PE than
Directory of Open Access Journals (Sweden)
Deshpande Sudheer
2008-01-01
Full Text Available Objective: To study the efficacy of yoga on Guna (yogic personality measure and general health in normal adults. Methods: Of the 1228 persons who attended introductory lectures, 226 subjects aged 18-71 years, of both sexes, who satisfied the inclusion and exclusion criteria and who consented to participate in the study were randomly allocated into two groups. The Yoga(Y group practised an integrated yoga module that included asanas , pranayama , meditation, notional correction and devotional sessions. The control group practised mild to moderate physical exercises (PE. Both groups had supervised practice sessions (by trained experts for one hour daily, six days a week for eight weeks. Guna (yogic personality was assessed before and after eight weeks using the self-administered Vedic Personality Inventory (VPI which assesses Sattva (gentle and controlled, Rajas (violent and uncontrolled and Tamas (dull and uncontrolled. The general health status (total health, which includes four domains namely somatic symptoms (SS, anxiety and insomnia (AI, social dysfunction (SF and severe depression (SP, was assessed using a General Health Questionnaire (GHQ. Results: Baseline scores for all the domains for both the groups did not differ significantly ( P > 0.05, independent samples t test. Sattva showed a significant difference within the groups and the effect size was more in the Y than in the PE group. Rajas showed a significant decrease within and between the groups with a higher effect size in the PE group. Tamas showed significant reduction within the PE group only. The GHQ revealed that there was significant decrease in SS, AI, SF and SP in both Y and PE groups (Wilcoxcon Singed Rank t test. SS showed a significant difference between the groups (Mann Whitney U Test. Conclusions: There was an improvement in Sattva in both the Yoga and control groups with a trend of higher effect size in Yoga; Rajas reduced in both but significantly better in PE than in
Directory of Open Access Journals (Sweden)
ALTINOZ, O. T.
2014-08-01
Full Text Available Nature-inspired optimization algorithms can obtain the optima by updating the position of each member in the population. At the beginning of the algorithm, the particles of the population are spread into the search space. The initial distribution of particles corresponds to the beginning points of the search process. Hence, the aim is to alter the position for each particle beginning with this initial position until the optimum solution will be found with respect to the pre-determined conditions like maximum iteration, and specific error value for the fitness function. Therefore, initial positions of the population have a direct effect on both accuracy of the optima and the computational cost. If any member in the population is close enough to the optima, this eases the achievement of the exact solution. On the contrary, individuals grouped far away from the optima might yield pointless efforts. In this study, low-discrepancy quasi-random number sequence is preferred for the localization of the population at the initialization phase. By this way, the population is distributed into the search space in a more uniform manner at the initialization phase. The technique is applied to the Gravitational Search Algorithm and compared via the performance on benchmark function solutions.
Directory of Open Access Journals (Sweden)
Sheikholeslami-Vatani
2016-03-01
Full Text Available Background Exercise order affects repetition performance and acute hormonal responses to resistance training (RT programs. Objectives The purpose of this study was to compare the acute effects of two different resistance exercise orders (REO on number of repetitions and serum Insulin-like Growth Factor-1 (IGF-1, testosterone and cortisol levels in normal-weight and obese men. Materials and Methods 25 untrained college-aged men were assigned to either obese (n = 11 or normal-weight (n = 15 groups. Subjects performed two REO protocols in 2 exercise groups. In the first group subjects began with large-muscle group and progressed to small-muscle group (Protocol A, while in the other group subjects performed the same exercise but in reverse sequence (Protocol B. Each activity was performed in 3 consecutive sets of 10 repetitions maximum to near fatigue. Results REOs did not affect number of repetitions in none of the groups. The average rating of perceived exertion was higher for protocol B in both groups. IGF-1 and testosterone increased immediately post exercise for both protocols and in both groups, however immediately post exercise increase in IGF-1 and testosterone were lower in obese group. Cortisol response to REO was weaker in obese group. Conclusions Performing large muscle group exercises first in RE training and progressing to small muscle group produced greater anabolic hormonal response relative to reverse sequence in normal-weight young adult men. Anabolic hormonal response to REOs was blunted in the obese group.
Indian Academy of Sciences (India)
K Madhukar; P V Kumar; T R Ramamohan; I S Shivakumara
2010-12-01
The problem of determining the force acting on a particle in a ﬂuid where the motion of the ﬂuid and the particle is given has been considered in some detail in the literature. In this work, we propose an example of a new class of problems where, the ﬂuid is quiescent and the effect of an external periodic force on the motion of the particle is determined at low non-zero Reynolds numbers. We present an analysis of the dynamics of dilute suspensions of periodically forced prolate spheroids in a quiescent Newtonian ﬂuid at low Reynolds numbers including the effects of both convective and unsteady inertia. The inclusion of both forms of inertia leads to a nonlinear integro – differential equation which is solved numerically for the velocity and displacement of the individual particle. We show that a ‘normal stress’ like parameter can be evaluated using standard techniques of Batchelor. Hence this system allows for an experimentally accessible measurable macroscopic parameter, analogous to the ‘normal stress’, which can be related to the dynamics of individual particles. We note that this ‘normal stress’ arises from the internal ﬂuctuations induced by the periodic force. In addition, a preliminary analysis leading to a possible application of separating particles by shape is presented. We feel that our results show possibilities of being technologically important since the ‘normal stress’ depends strongly on the controllable parameters and our results may lead to insights in the development of active dampeners and smart ﬂuids. Since we see complex behaviour even in this simple system, it is expected that the macroscopic behaviour of such suspensions may be much more complex in more complex ﬂows.
Saxena, Nitesh
2009-01-01
Random number generation is a fundamental security primitive for RFID devices. However, even this relatively simple requirement is beyond the capacity of today's average RFID tag. A recently proposed solution, Fingerprint Extraction and Random Number Generation in SRAM (FERNS) [14, 15], involves the use of onboard RAM as the source of "true" randomness. Unfortunately, practical considerations prevent this approach from reaching its full potential. First, this method must compete with other system functionalities for use of memory. Thus, the amount of uninitialized RAM available for utilization as a randomness generator may be severely restricted. Second, RAM is subject to data remanence; there is a time period after losing power during which stored data remains intact in memory. This means that after a portion of memory has been used for entropy collection once it will require a relatively extended period of time without power before it can be reused. In a usable RFID based security application, which require...
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)
Cheng H Lee
Full Text Available Despite recent large-scale profiling efforts, the best prognostic predictor of glioblastoma multiforme (GBM remains the patient's age at diagnosis. We describe a global pattern of tumor-exclusive co-occurring copy-number alterations (CNAs that is correlated, possibly coordinated with GBM patients' survival and response to chemotherapy. The pattern is revealed by GSVD comparison of patient-matched but probe-independent GBM and normal aCGH datasets from The Cancer Genome Atlas (TCGA. We find that, first, the GSVD, formulated as a framework for comparatively modeling two composite datasets, removes from the pattern copy-number variations (CNVs that occur in the normal human genome (e.g., female-specific X chromosome amplification and experimental variations (e.g., in tissue batch, genomic center, hybridization date and scanner, without a-priori knowledge of these variations. Second, the pattern includes most known GBM-associated changes in chromosome numbers and focal CNAs, as well as several previously unreported CNAs in >3% of the patients. These include the biochemically putative drug target, cell cycle-regulated serine/threonine kinase-encoding TLK2, the cyclin E1-encoding CCNE1, and the Rb-binding histone demethylase-encoding KDM5A. Third, the pattern provides a better prognostic predictor than the chromosome numbers or any one focal CNA that it identifies, suggesting that the GBM survival phenotype is an outcome of its global genotype. The pattern is independent of age, and combined with age, makes a better predictor than age alone. GSVD comparison of matched profiles of a larger set of TCGA patients, inclusive of the initial set, confirms the global pattern. GSVD classification of the GBM profiles of an independent set of patients validates the prognostic contribution of the pattern.
Kalantari, Mina; Garcia-Carranca, Alejandro; Morales-Vazquez, Claudia Dalia; Zuna, Rosemary; Montiel, Delia Perez; Calleja-Macias, Itzel E.; Johansson, Bo; Andersson, Sonia; Bernard, Hans-Ulrich
2009-01-01
Research on the pathogenicity of human papillomaviruses (HPVs) during cervical carcinogenesis often relies on the study of homogenized tissue or cultured cells. This approach does not detect molecular heterogeneities within the infected tissue. It is desirable to understand molecular properties in specific histological contexts. We asked whether Laser Capture Microdissection (LCM) of archival cervical tumors in combination with real-time polymerase chain reaction and bisulfite sequencing permits (i) sensitive DNA diagnosis of small clusters of formalin fixed cells, (ii) quantification of HPV DNA in neoplastic and normal cells, and (iii) analysis of HPV DNA methylation, a marker of tumor progression. We analyzed 26 tumors containing HPV-16 or 18. We prepared DNA from LCM dissected thin sections of 100 to 2000 cells, and analyzed aliquots corresponding to between nine and 70 cells. We detected nine to 630 HPV-16 genome copies and one to 111 HPV-18 genome copies per tumor cell, respectively. In 17 of the 26 samples, HPV DNA existed in histologically normal cells distant from the margins of the tumors, but at much lower concentrations than in the tumor, suggesting that HPVs can infect at low levels without pathogenic changes. Methylation of HPV DNA, a biomarker of integration of the virus into cellular DNA, could be measured only in few samples due to limited sensitivity, and indicated heterogeneous methylation patterns in small clusters of cancerous and normal cells. LCM is powerful to study molecular parameters of cervical HPV infections like copy number, latency and epigenetics. PMID:19497607
Bull, Rebecca; Marshark, Marc; Nordmann, Emily; Sapere, Patricia; Skene, Wendy A
2017-08-29
Many children with hearing loss (CHL) show a delay in mathematical achievement compared to children with normal hearing (CNH). This study examined whether there are differences in acuity of the approximate number system (ANS) between CHL and CNH, and whether ANS acuity is related to math achievement. Working memory (WM), short-term memory (STM), and inhibition were considered as mediators of any relationship between ANS acuity and math achievement. Seventy-five CHL were compared with 75 age- and gender-matched CNH. ANS acuity, mathematical reasoning, WM, and STM of CHL were significantly poorer compared to CNH. Group differences in math ability were no longer significant when ANS acuity, WM, or STM was controlled. For CNH, WM and STM fully mediated the relationship of ANS acuity to math ability; for CHL, WM and STM only partially mediated this relationship. ANS acuity, WM, and STM are significant contributors to hearing status differences in math achievement, and to individual differences within the group of CHL. Statement of contribution What is already known on this subject? Children with hearing loss often perform poorly on measures of math achievement, although there have been few studies focusing on basic numerical cognition in these children. In typically developing children, the approximate number system predicts math skills concurrently and longitudinally, although there have been some contradictory findings. Recent studies suggest that domain-general skills, such as inhibition, may account for the relationship found between the approximate number system and math achievement. What does this study adds? This is the first robust examination of the approximate number system in children with hearing loss, and the findings suggest poorer acuity of the approximate number system in these children compared to hearing children. The study addresses recent issues regarding the contradictory findings of the relationship of the approximate number system to math ability
Todorov, Todor
2011-01-01
Given a chain complex with the only modi?cation that each cell of the complex has a probability distribution assigned. We will call this complex - a random complex and what should be understood in practice, is that we have a classical chain complex whose cells appear and disappear according to some probability distributions. In this paper, we will try to fi?nd the stochastic homology of random complex, whose simplices have independent discrete distributions.
Raghukumar, Kaustubha; Colosi, John A
2014-07-01
Using transport theory and Monte Carlo numerical simulation, the statistical properties of mode propagation at a frequency of 1 kHz are studied in a shallow water environment with random sound-speed perturbations from linear internal waves. The environment is typical of summer conditions in the mid-Atlantic bight during the Shallow Water 2006 experiment. Observables of interest include the second and fourth moments of the mode amplitudes, which are relevant to full-field mean intensity and scintillation index. It is found that mode phase randomization has a strong adiabatic component while at the same time mode coupling rates are significant. As a consequence, a computationally efficient transport theory is presented, which models cross-mode correlation adiabatically, but accounts for mode coupling using the mode energy equations of Creamer [(1996). J. Acoust. Soc. Am. 99, 2825-2838]. The theory also has closed-form expressions for the internal wave scattering matrix and a correction for an edge effect. The hybrid transport theory is shown to accurately reproduce many statistical quantities from the Monte Carlo simulations.
Yang, Yu-Guang; Xu, Peng; Yang, Rui; Zhou, Yi-Hua; Shi, Wei-Min
2016-01-29
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.
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
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…
1977-06-01
produced on the runs test and the serial test for triples. Shuffling has been proposed by Marsaglia and Bray (6J and has been implemented in several...15, 1944. [6] G. Marsaglia and T. A. Bray, "One-line random number gener- ators and their use in combinations," CACM, Vol. 11, 1968. [7] W. H. Payne
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)
一般形式下斜正态随机向量的矩%Moments of the Skew Normal Random Vectors in the General Case
Institute of Scientific and Technical Information of China (English)
方碧琪
2008-01-01
In this paper,we derived the moments of the random vectors with the skew normal distributions and their quadratic forms in the general case.As an application,the measures of multivariate skewness and kurtosm are calculated.%本文给出一般形式下斜正态随机向量及其平方型的矩公式.作为应用,计算出了斜正态随机向量的多元偏度和峰度.
Energy Technology Data Exchange (ETDEWEB)
Rogers, M.V.; McLaren, D.J.
1987-08-01
Guinea-pigs immunized with equivalent numbers of normal or radiation-attenuated cercariae of Schistosoma mansoni develop close to complete resistance to reinfection at weeks 12 and 4.5 respectively. We here analyse and compare the immune responses induced by the two populations of cercariae. Both radiation-attenuated and normal parasites of S. mansoni elicited an extensive germinal centre response in guinea-pigs by week 4.5 post-immunization. The anti-parasite antibody titre and cytotoxic activity of serum from 4.5-week-vaccinated, or 4.5-week-infected guinea-pigs were approximately equal, but sera from 12-week-infected individuals had high titres of anti-parasite antibody, which promoted significant larvicidal activity in vitro. In all cases, larvicidal activity was mediated by the IgG/sub 2/ fraction of the immune serum. Lymphocyte transformation tests conducted on splenic lymphocytes from 4.5-week vaccinated guinea-pigs revealed maximal stimulation against cercarial, 2-week and 3-week worm antigens, whereas spleen cells from 4.5-week-infected guinea-pigs were maximally stimulated by cercarial and 6-week worm antigens. The splenic lymphocyte responses of 12-week infected animals were dramatic against antigens prepared from all life-stages of the parasite.
Horsch, Antje; Wobmann, Marion; Kriemler, Susi; Munsch, Simone; Borloz, Sylvie; Balz, Alexandra; Marques-Vidal, Pedro; Borghini, Ayala; Puder, Jardena J
2015-02-19
Psychological stress negatively influences food intake and food choices, thereby contributing to the development of childhood obesity. Physical activity can also moderate eating behavior and influence calorie intake. However, it is unknown if acute physical activity influences food intake and overall energy balance after acute stress exposure in children. We therefore investigated the impact of acute physical activity on overall energy balance (food intake minus energy expenditure), food intake, and choice in the setting of acute social stress in normal weight (NW) and overweight/obese (OW/OB) children as well as the impact of psychological risk factors. After receiving written consent from their parents, 26 NW (BMI children were randomly allocated using computer-generated numbers (1:1, after stratification for weight status) to acute moderate physical or to sedentary activity for 30 min. Afterwards, all children were exposed to an acute social stressor. Children and their parents completed self-report questionnaires. At the end of the stressor, children were allowed to eat freely from a range of 12 different foods (6 sweet/6 salty; each of low/high caloric density). Energy balance, food intake/choice and obesity-related psychological risk factors were assessed. Lower overall energy balance (p = 0.019) and a decreased choice of low density salty foods (p children compared with OW/OB children was found after acute moderate physical activity but not sedentary activity. Independent of their allocation, OW/OB children ate more high density salty foods (104 kcal (34 to 173), p = 0.004) following stress. They scored higher on impulsive behavior (p = 0.005), restrained eating (p physical activity can address energy balance in children, a benefit which is especially pronounced in the OW/OB. Positive parenting may act as a protective factor preventing stress-induced eating of comfort food. clinicaltrials.gov NCT01693926 The study was a pilot study of a project funded by the
Ahn, Chul; Hu, Fan; Skinner, Celette Sugg; Ahn, Daniel
2009-07-01
In some cluster randomization trials, the number of clusters cannot exceed a specified maximum value due to cost constraints or other practical reasons. Donner and Klar [Donner A, and Klar N. Design and analysis of cluster randomization trials in health research. Oxford University Press 2000] provided the sample size formula for the number of subjects required per cluster when the number of clusters cannot exceed a specified maximum value. The sample size formula of Donner and Klar assumes that the number of subjects is the same in each cluster. In practical situations, the number of subjects may be different among clusters. We conducted simulation studies to investigate the effect of the cluster size variability (kappa) and the intracluster correlation coefficient (rho) on the power of the study in which the number of available clusters is fixed in advance. For the balanced case (kappa=1.0), i.e., equal cluster size among clusters, the sample size formula yielded empirical powers close to the nominal level even when the number of available clusters per group (k*) is as small as 10. The sample size formula yielded empirical powers close to the nominal level when the number of available clusters per group (k*) is at least 20 and the imbalance parameter (kappa) is at least 0.8. Empirical powers were close to the nominal level when (rho or =0.8, and k*=10) or (rho< or =0.02, kappa=0.8, and k*=20).
Yi, Huiyue
2014-01-01
Estimating the number of signals is a fundamental problem in many scientific and engineering fields. As a well-known estimator based on random matrix theory (RMT), the RMT estimator estimates the number of signals via sequentially testing the likelihood of an eigenvalue as arising from a signal or from noise. However, the RMT estimator tends to down-estimate the number of signals as some signals will be buried in the interaction term among eigenvalues. In order to overcome this problem, we fo...
Institute of Scientific and Technical Information of China (English)
鄢秋荣; 赵宝升; 刘永安; 盛立志
2012-01-01
提出了一种基于单光子脉冲时间随机性的光量子随机源.利用衰减成单光子态的光强恒定光源和一个单光子探测器产生单光子随机脉冲,通过连续比较单光子随机脉冲序列中相邻两个脉冲的时间间隔来提取随机位.通过设计高速响应的微通道板单光子探测器和基于现场可编程门阵列(FPGA)的随机位提取电路,获得了超过10 M bit/s的随机位产生速率.通过采用恒比定时和对计数时钟倍频的方法提高时间间隔的测量精度,从而减小随机位序列的相关系数.当光量子随机源的随机位产生速率在10 k bit/s以下时,所获得的二进制随机位序列的相关系数小于0.001.运用随机性测试程序ENT和DIEHARD对所获的随机位序列进行测试,测试结果表明序列的随机性非常好且不需要后续处理,完全满足真随机数的标准.%An optical quantum random number generator based on the time randomness of single-photon pulse is proposed. A constant-intensity light source attenuating into single-photon state and a single photon detector are used to generate single-photon random pulses. The random bits are extracted by continuously comparing the time intervals between two adjacent pulses in the single-photon random pulses sequence. A random number generation rate of more than 10 M bit/s is obtained by designing high-speed single-photon detector based on micro-channel plate and field programmable gate arry (FPGA) based random bit extraction circuit. In order to reduce the correlation coefficient of random bit sequence* measurement accuracy of the time interval is improved by using a constant fraction discriminator and a frequency-multiplied counting clock. Correlation coefficient of the random bit sequence is less than 0.001, when the random bit generation rate is less than 10 k bit/s. The random bit sequences are tested by random number test program ENT and DIEHARD. The test results show that random bit sequences
Directory of Open Access Journals (Sweden)
Abbas Ali Gaeini
2012-02-01
Full Text Available Background & Objective: Exercise and extreme environments, causes hormonal and immune systems changes. Therefore, the purpose of this study was evaluating the relationship between cortisol and leukocytosis and Neutrophil numbers after exercise in cold, warm and natural temperatures. Materials & Methods: Ten young male athletes ran on a treadmill for an hour at the intensity of %60VO2max in three temperature conditions of normal (22±1˚c, 50±5RH, cold (3±1˚c, 50±2RH and warm (35±1˚c, 50±5RH. Blood samples were collected before and immediately after exercise. The total numbers of leukocytes and neutrophils were computed using Sysmex Kohden Nihon and serum cortisol concentrations determined by using ELISA. For comparing of data before and after exercise used from Paired T-test and for examine the relationship between variables used from Pearson Correlation Coefficient test. Results: The total leukocytes and the cortisol levels increased significantly after the exercise, in all the conditions (p<0.0001. Also, the number of neutrophils increased significantly after exercise in cold (p=0.001 and normal (p=0.001 environments. In addition, a significant relation was observed between cortisol levels and leukocytosis (R=0.783, P=0.007 and R=0.813, P=0.004 and between cortisol and Neutrophils after exercising in the natural and warm environment (R=0.806, P=0.005 and R=0.852, P=0.002. But, there was no significant relationship between these values after exercise in cold (R=0.63, P=0.051 and R=0.554, P=0.096. Conclusion: Exercise in all the three conditions causes the release of cortisol through stimulating the hypothalamic-pituitary- adrenal (HPA and effect of cortisol receptor on immune cells could cause increase Neutrophils and leukocytosis. It seems that elevation of cortisol concentration during exercise in warm and natural environments is responsible for increase Neutrophils and leukocytosis. Moreover, during exercise in cold environments
DEFF Research Database (Denmark)
Benn, Christine Stabell; Diness, Birgitte R; Balde, Ibraima
2014-01-01
Whether neonatal vitamin A supplementation (NVAS) should be policy in areas with vitamin A deficiency is debated. We observed that a smaller dose of vitamin A may decrease mortality more than a larger dose and conducted a randomized, double-blind, placebo-controlled trial in Guinea-Bissau with th......Whether neonatal vitamin A supplementation (NVAS) should be policy in areas with vitamin A deficiency is debated. We observed that a smaller dose of vitamin A may decrease mortality more than a larger dose and conducted a randomized, double-blind, placebo-controlled trial in Guinea......-Bissau with the primary aim of comparing the effect of 50,000 with 25,000 IU neonatal vitamin A on infant mortality. The secondary aim was to study the effect of NVAS vs. placebo, including a combined analysis of NVAS trials. Between 2004 and 2007, normal-birth-weight neonates were randomly assigned in a 1:1:1 ratio...... to be administered 2 different doses of vitamin A (50,000 or 25,000 IU) or placebo. Infant mortality rates (MRs) were compared in Cox models providing MR ratios (MRRs). Among 6048 children enrolled, there were 160 deaths in 4125 person-years (MR = 39/1000). There was no difference in mortality between the 2 dosage...
Institute of Scientific and Technical Information of China (English)
汪龙; 马海强†; 李申; 韦克金
2013-01-01
In this paper, we present a high-speed physical quantum random number generator using analog/digital converter (ADC), which is based on the random time distribution of single photons emitted by the stongly attenuated pulsed laser diode. With this scheme, the generation rate of random numbers can increase more than tenfold. A preliminary experiment consists of the time amplitude converter and 16 bit ADC, and the data generated by the system pass the pseudo-random number test program test standards. The experimental setup is efficient and robust against mechanical and temperature disturbances.% 提出了利用模数转换器提高真随机数源速率的方案，该方案基于衰减脉冲激光光子间隙随机分布，可使随机数的产生速率提高十几倍。实验中将时间幅度转换仪与16位模数转换器相结合，产生的各比特位随机数序列顺利通过了国际通用的随机数检测程序统计测试标准，该方案实验装置简单，增强了系统的抗干扰能力。
Fyodorov, Yan V; Nadal, Celine
2012-10-19
We exploit a relation between the mean number N(m) of minima of random Gaussian surfaces and extreme eigenvalues of random matrices to understand the critical behavior of N(m) in the simplest glasslike transition occuring in a toy model of a single particle in an N-dimensional random environment, with N>1. Varying the control parameter μ through the critical value μ(c) we analyze in detail how N(m)(μ) drops from being exponentially large in the glassy phase to N(m)(μ)~1 on the other side of the transition. We also extract a subleading behavior of N(m)(μ) in both glassy and simple phases. The width δμ/μ(c) of the critical region is found to scale as N(-1/3) and inside that region N(m)(μ) converges to a limiting shape expressed in terms of the Tracy-Widom distribution.
Mansingka, Abhinav S.
2013-07-24
This paper introduces fully digital implementations of four different 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 100× higher maximum Lyapunov exponent than the original jerk-equation based chaotic systems. The resulting chaotic output is shown to pass the NIST SP. 800-22 statistical test suite for pseudo-random 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.
Institute of Scientific and Technical Information of China (English)
无
2000-01-01
Under very weak condition 0＜r(t)↑∞, t→∞, we obtain a series of equivalent conditions of complete convergence for maxima of m-dimensional products of iid random variables, which provide a useful tool for researching this class of questions. Some results on strong law of large numbers are given such that our results are much stronger than the corresponding result of Gadidov's.
Institute of Scientific and Technical Information of China (English)
王岳宝; 苏淳; 梁汉营; 成凤旸
2000-01-01
Under very weak condition 0 < r(t)↑∞ , t→∞. we obtain a series of equivalent conditions of complete convergence for maxima of m-dimensional products of iid random variables, which provide a useful tool for researching this class of questions. Some results on strong law of large numbers are given such that our results are much stronger than the corresponding result of Gadidov’s.
Deneubourg, J. L.; Aron, S.; Goss, S.; Pasteels, J. M.; Duerinck, G.
1986-10-01
Two major types of foraging organisation in ants are described and compared, being illustrated with experimental data and mathematical models. The first concerns large colonies of identical, unspecialised foragers. The communication and interaction between foragers and their randomness generates collective and efficient structures. The second concerns small societies of deterministic and specialised foragers, rarely communicating together. The first organisation is discussed in relation to the different recruitment mechanisms, trail-following error, quality and degree of aggregation of food-sources, and territorial marking, and is the key to many types of collective behaviour in social insects. The second is discussed in relation to spatial specialisation, foraging density, individual learning and genetic programming. The two organisations may be associated in the same colony. The choice of organisation is discussed in relation to colony size and size and predictability of food sources.
Simonsen, Ingve; Kryvi, Jacob B; Maradudin, Alexei A
2015-01-01
An expression is obtained on the basis of phase perturbation theory for the contribution to the mean differential reflection coefficient from the in-plane co-polarized component of the light scattered diffusely from a two-dimensional randomly rough dielectric surface when the latter is illuminated by s-polarized light. This result forms the basis for an approach to inverting experimental light scattering data to obtain the normalized surface height autocorrelation function of the surface. Several parametrized forms of this correlation function, and the minimization of a cost function with respect to the parameters defining these representations, are used in the inversion scheme. This approach also yields the rms height of the surface roughness, and the dielectric constant of the dielectric substrate if it is not known in advance. The input data used in validating this inversion consists of computer simulation results for surfaces defined by exponential and Gaussian surface height correlation functions, withou...
属性值为正态随机变量的多属性决策方法%A method for MADM with normal random variables
Institute of Scientific and Technical Information of China (English)
姜广田; 樊治平
2012-01-01
针对具有正态随机变量的多属性决策(MADM)问题,提出了一种决策分析方法.在该方法中,首先通过理论分析给出根据期望和方差确定正态随机变量随机占优关系的简便方法；其次依据得到的简便方法确定针对各属性的两两方案之间的随机占优关系,并构建相应的随机占优关系矩阵;在此基础上,给出了一种基于ELECTRE Ⅲ的方案排序方法.最后,通过一个算例说明了所给方法的可行性和有效性.%This paper proposes a method to solve the multiple attribute decision making (MADM) problem with normal random variables. Firstly, a simple approach for identifying the stochastic dominance relation between a pair of normal random variables based on the expectations and variance values is given by theoretical analysis. Then, the dominance relation matrix with regard to each attribute is built according to the simple approach. Furthermore, ELECTRE III method is used to obtain the ranking result of alternatives. Finally, a numerical example is used to illustrate the feasibility and validity of proposed method.
Research on Pseudo-random Number Generator Based on CUDA Platform%基于CUDA平台的伪随机数产生器系统研究
Institute of Scientific and Technical Information of China (English)
郭海凤
2013-01-01
For linear congruence algorithm (LCA) has low speed of producing huge amounts of random number sequences,propose a parallel pseudo-random number generator based on CUDA platform. Test proved the improved algorithm is feasible. The method by using GPU parallel architecture generates parallel pseudo random number. Compared with traditional linear congruence algorithm,improved al-gorithm has longer cycles and faster speed of generating random sequence,its acceleration ratio is close to 100,solves the slow speed of traditional algorithm. And its system simulation shows it is better than the traditional one.% 针对线性同余算法在产生海量随机数序列时,速度较慢的情况,文中提出并实现了一种产生伪随机数的改进方法,即基于CUDA平台的并行线性同余法,测试证明改进算法可行。该方法通过利用GPU的并行架构,实现并行产生伪随机数。通过实验结果比较,与传统的线性同余算法相比,改进算法产生的随机序列周期较长、速度较快,当其产生大量伪随机数序列时其加速比接近100,解决了传统线性同余算法产生伪随机数周期短、速度较慢的问题,系统仿真效果较优。
Masoumi, Seyedeh Zahra; Kazemi, Farideh; Oshvandi, Khodayar; Jalali, Mozhgan; Esmaeili-Vardanjani, Ali; Rafiei, Hossein
2016-01-01
Objective: To examine effect of an educational program on pregnant women’s fear of normal vaginal delivery. Fear of natural childbirth during pregnancy may increase the risk of caesarean section. Educational programs may be effective in reducing women fear of natural childbirth. Materials and methods: This randomized controlled trial conducted from September 2012 to January 2013 in Hamadan, Iran. One hundred fifty eligible women were randomly assigned to group "A" (Intervention group, n = 75) or group "B" (Control group, n = 75). Women in group A, participated in an antenatal educations program for physiologic childbirth in 8 two-hour sessions. A self-designed questionnaire was used to examine women's fear of natural childbirth. Data were analyzed with SPSS.16 software. Results: Baseline characteristics of women were similar in both groups. After intervention the mean fear score in group A compared to group B was significantly reduced (51.7 ± 22.4 vs. 58.7 ± 21.7) (p = 0.007). Physiologic delivery was the first choice of type of child birth after training in pregnant women in group A (58.7%). But delivery in physiologic form had lowest rate in group A (8%). Conclusion: Results of present study showed that educational program could be serving as an important tool in reducing women fear from natural childbirth and in choosing of physiologic birth. And for delivery as a physiological, education and counseling of pregnant women, doctors and midwives are required. PMID:28101112
Directory of Open Access Journals (Sweden)
Seyedeh Zahra Masoumi
2016-12-01
Full Text Available Objective: To examine effect of an educational program on pregnant women’s fear of normal vaginal delivery. Fear of natural childbirth during pregnancy may increase the risk of caesarean section. Educational programs may be effective in reducing women fear of natural childbirth.Materials and methods: This randomized controlled trial conducted from September 2012 to January 2013 in Hamadan, Iran. One hundred fifty eligible women were randomly assigned to group "A" (Intervention group, n = 75 or group "B" (Control group, n = 75. Women in group A, participated in an antenatal educations program for physiologic childbirth in 8 two-hour sessions. A self-designed questionnaire was used to examine women's fear of natural childbirth. Data were analyzed with SPSS.16 software.Results: Baseline characteristics of women were similar in both groups. After intervention the mean fear score in group A compared to group B was significantly reduced (51.7 ± 22.4 vs. 58.7 ± 21.7 (p = 0.007. Physiologic delivery was the first choice of type of child birth after training in pregnant women in group A (58.7%. But delivery in physiologic form had lowest rate in group A (8%.Conclusion: Results of present study showed that educational program could be serving as an important tool in reducing women fear from natural childbirth and in choosing of physiologic birth. And for delivery as a physiological, education and counseling of pregnant women, doctors and midwives are required.
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%.
Directory of Open Access Journals (Sweden)
Olsen Nanna
2012-08-01
Full Text Available Abstract Background Research shows that obesity prevention has to start early. Targeting interventions towards subgroups of individuals who are predisposed, but yet normal weight, may prove more effective in preventing overweight than interventions towards unselected normal weight subsets. Finally, interventions focused on other factors than diet and activity are lacking. The objectives were to perform a randomized, controlled intervention aiming at preventing overweight in children aged 2–6 years, who are yet normal weight, but have high predisposition for future overweight, and to intervene not only by improving diet and physical activity, but also reduce stress and improve sleep quality and quantity. Methods/Design Based on information from the Danish National Birth Registry and administrative birth forms, children were selected based on having either a high birth weight, a mother who was overweight prior to pregnancy, or a familial low socioeconomic status. Selected children (n = 5,902 were randomized into three groups; an intervention group, a shadow control group followed in registers exclusively, and a control group examined at the beginning and at the end of the intervention. Approximately 21% agreed to participate. Children who presented as overweight prior to the intervention were excluded from this study (n = 92. In the intervention group, 271 children were included, and in the control group 272 were included. Information obtained from the shadow control group is on-going, but it is estimated that 394 children will be included. The intervention took place over on average 1½ year between 2009 and 2011, and consisted of optional individual guidance in optimizing diet and physical activity habits, reducing chronic stress and stressful events and improving sleep quality and quantity. The intervention also included participation in cooking classes and play arrangements. Information on dietary intake, meal habits, physical
Directory of Open Access Journals (Sweden)
Phahol Sakkatat
Full Text Available A study by T-square sampling method was conducted to investigate importantplant species in Ban Pong Forest, Sansai district, Chiang Mai province by estimation of theirnumber and density, and testing of their random distribution. The result showed that, therewere 14 kinds of important plant species, viz. Dipterocarpus tuberculatus Roxb., Shoreaobtuse Wall. exBlume, Bridelia retusa (L. A. Juss, Derris scandens Benth., Thysostachyssiamensis, Parinari anamense Hance, Vitex pinnata L.f., Canarium subulatum Guill.,Litsea glutinosa C.B.Roxb., Alphonsea glabrifolia Craib., Pueraria mirifica, Vaticastapfiana van Slooten, Walsura robusta Rox. and Dipterocarpus alatus Roxb. By far,Dipterocarpus tuberculatus Roxb was greatest in number and density, and all of the specieshad random distribution, except Walsura robusta Roxb and Dipterocarpus alatus Roxb
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)
Joop eHox
2014-02-01
Full Text Available Cluster randomized trials assess the effect of an intervention that is carried out at the group or cluster level. Ajzen’s theory of planned behaviour is often used to model the effect of the intervention as an indirect effect mediated in turn by attitude, norms and behavioural intention. Structural equation modelling (SEM is the technique of choice to estimate indirect effects and their significance. However, this is a large sample technique, and its application in a cluster randomized trial assumes a relatively large number of clusters. In practice, the number of clusters in these studies tends to be relatively small, e.g. much less than fifty. This study uses simulation methods to find the lowest number of clusters needed when multilevel SEM is used to estimate the indirect effect. Maximum likelihood estimation is compared to Bayesian analysis, with the central quality criteria being accuracy of the point estimate and the confidence interval. We also investigate the power of the test for the indirect effect. We conclude that Bayes estimation works well with much smaller cluster level sample sizes such as 20 cases than maximum likelihood estimation; although the bias is larger the coverage is much better. When only 5 to 10 clusters are available per treatment condition even with Bayesian estimation problems occur.
Güleç, A T
2012-03-01
Botulinum toxin A (BTX-A) is an effective and safe treatment modality for primary axillary hyperhidrosis. However, some patients experience considerable pain during injections. Dilution of botulinum toxin A in lidocaine vs. in normal saline for the treatment of primary axillary hyperhidrosis: a double-blind, randomized, comparative preliminary study. The aim of this study was to compare the efficacy, safety and pain tolerance of lidocaine-diluted BTX-A vs. saline-diluted BTX-A for the treatment of axillary hyperhidrosis. Eight patients were injected with 50 U of BTX-A diluted in 0.5 mL of saline and 1 mL of 2% lidocaine into one axilla and 50 U of BTX-A diluted in 1.5 mL of saline into the other axilla in a randomized fashion. The pain associated with the injections were self-assessed by the subjects using a 100-mm visual analogue scale (VAS). Lidocaine-diluted BTX-A and saline-diluted BTX-A were similarly effective regarding the reduction in sweat production, the onset of sweat cessation and the duration of hypo/anhidrosis. Nevertheless, the pain VAS score during the injections was significantly lower in the axilla treated with lidocaine-diluted BTX-A than the one treated with saline-diluted toxin. Preliminary study due to relatively small sample size. Botulinum toxin A diluted in lidocaine causes significantly less pain than BTX-A diluted in saline, whereas it is is equally effective and safe as the latter one in treating axillary hyperhidrosis. Therefore, we suggest that lidocaine-diluted BTX-A may be a better treatment option for the patients with primary axillary hyperhidrosis. © 2011 The Author. Journal of the European Academy of Dermatology and Venereology © 2011 European Academy of Dermatology and Venereology.
Sigmund, Eric E.; Novikov, Dmitry S.; Sui, Dabang; Ukpebor, Obehi; Baete, Steven; Babb, James S.; Liu, Kecheng; Feiweier, Thorsten; Kwon, Jane; Mcgorty, KellyAnne; Bencardino, Jenny; Fieremans, Els
2014-01-01
Purpose To collect diffusion tensor imaging (DTI) at multiple diffusion times Td in skeletal muscle in normal subjects and chronic exertional compartment syndrome (CECS) patients and analyze the data with the random permeable barrier model (RPBM) for biophysical specificity. Materials and Methods Using an IRB-approved HIPAA-compliant protocol, seven patients with clinical suspicion of CECS and eight healthy volunteers underwent DTI of the calf muscle in a Siemens MAGNETOM Verio 3-T scanner at rest and after treadmill exertion at 4 different diffusion times. Radial diffusion values λrad were computed for each of 7 different muscle compartments and analyzed with RPBM to produce estimates of free diffusivity D0, fiber diameter a, and permeability κ. Fiber diameter estimates were compared with measurements from literature autopsy reference for several compartments. Response factors (post/pre-exercise ratios) were computed and compared between normal controls and CECS patients using a mixed-model two-way analysis of variance. Results All subjects and muscle compartments showed nearly time-independent diffusion along and strongly time-dependent diffusion transverse to the muscle fibers. RPBM estimates of fiber diameter correlated well with corresponding autopsy reference. D0 showed significant (p<0.05) increases with exercise for volunteers, and a increased significantly (p<0.05) in volunteers. At the group level, response factors of all three parameters showed trends differentiating controls from CECS patients, with patients showing smaller diameter changes (p=0.07), and larger permeability increases (p=0.07) than controls. Conclusions Time-dependent diffusion measurements combined with appropriate tissue modeling can provide enhanced microstructural specificity for in vivo tissue characterization. In CECS patients, our results suggest that high-pressure interfiber edema elevates free diffusion and restricts exercise-induced fiber dilation. Such specificity may be
Directory of Open Access Journals (Sweden)
Hochul Lee
2017-05-01
Full Text Available A true random number generator based on perpendicularly magnetized voltage-controlled magnetic tunnel junction devices (MRNG is presented. Unlike MTJs used in memory applications where a stable bit is needed to store information, in this work, the MTJ is intentionally designed with small perpendicular magnetic anisotropy (PMA. This allows one to take advantage of the thermally activated fluctuations of its free layer as a stochastic noise source. Furthermore, we take advantage of the voltage dependence of anisotropy to temporarily change the MTJ state into an unstable state when a voltage is applied. Since the MTJ has two energetically stable states, the final state is randomly chosen by thermal fluctuation. The voltage controlled magnetic anisotropy (VCMA effect is used to generate the metastable state of the MTJ by lowering its energy barrier. The proposed MRNG achieves a high throughput (32 Gbps by implementing a 64×64 MTJ array into CMOS circuits and executing operations in a parallel manner. Furthermore, the circuit consumes very low energy to generate a random bit (31.5 fJ/bit due to the high energy efficiency of the voltage-controlled MTJ switching.
Lee, Hochul; Ebrahimi, Farbod; Amiri, Pedram Khalili; Wang, Kang L.
2017-05-01
A true random number generator based on perpendicularly magnetized voltage-controlled magnetic tunnel junction devices (MRNG) is presented. Unlike MTJs used in memory applications where a stable bit is needed to store information, in this work, the MTJ is intentionally designed with small perpendicular magnetic anisotropy (PMA). This allows one to take advantage of the thermally activated fluctuations of its free layer as a stochastic noise source. Furthermore, we take advantage of the voltage dependence of anisotropy to temporarily change the MTJ state into an unstable state when a voltage is applied. Since the MTJ has two energetically stable states, the final state is randomly chosen by thermal fluctuation. The voltage controlled magnetic anisotropy (VCMA) effect is used to generate the metastable state of the MTJ by lowering its energy barrier. The proposed MRNG achieves a high throughput (32 Gbps) by implementing a 64 ×64 MTJ array into CMOS circuits and executing operations in a parallel manner. Furthermore, the circuit consumes very low energy to generate a random bit (31.5 fJ/bit) due to the high energy efficiency of the voltage-controlled MTJ switching.
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.
Directory of Open Access Journals (Sweden)
Maria Giné-Garriga
Full Text Available Effective promotion of exercise could result in substantial savings in healthcare cost expenses in terms of direct medical costs, such as the number of medical appointments. However, this is hampered by our limited knowledge of how to achieve sustained increases in physical activity.To assess the effectiveness of a Primary Health Care (PHC based physical activity program in reducing the total number of visits to the healthcare center among inactive patients, over a 15-month period.Randomized controlled trial.Three hundred and sixty-two (n = 362 inactive patients suffering from at least one chronic condition were included. One hundred and eighty-three patients (n = 183; mean (SD; 68.3 (8.8 years; 118 women were randomly allocated to the physical activity program (IG. One hundred and seventy-nine patients (n = 179; 67.2 (9.1 years; 106 women were allocated to the control group (CG. The IG went through a three-month standardized physical activity program led by physical activity specialists and linked to community resources.The total number of medical appointments to the PHC, during twelve months before and after the program, was registered. Self-reported health status (SF-12 version 2 was assessed at baseline (month 0, at the end of the intervention (month 3, and at 12 months follow-up after the end of the intervention (month 15.The IG had a significantly reduced number of visits during the 12 months after the intervention: 14.8 (8.5. The CG remained about the same: 18.2 (11.1 (P = .002.Our findings indicate that a 3-month physical activity program linked to community resources is a short-duration, effective and sustainable intervention in inactive patients to decrease rates of PHC visits.ClinicalTrials.gov NCT00714831.
稀疏随机矩阵的观测次数下界%Lower Bounds on the Number of Measurements of Sparse Random Matrices
Institute of Scientific and Technical Information of China (English)
孙晶明; 王殊; 董燕
2012-01-01
压缩感知理论中的稀疏重构问题,要将一个高维信号从它的低维投影中恢复出来,通常选用稠密随机矩阵作为观测矩阵来解决这一问题.而某些稀疏随机矩阵作为观测矩阵也可以达到这一目的.稀疏随机矩阵的特点是,在编码和重构过程中都具有较低的计算复杂度,更新方便,且对存储容量的要求较低.该文基于压缩感知理论,分别对列重固定、行重固定以及一般的稀疏随机矩阵进行了研究,当这些稀疏随机矩阵满足有限等距性质时,推导了观测次数应满足的下界条件,并对三种矩阵的性能进行了分析.以二值稀疏随机矩阵为特例,进行了仿真实验.实验结果显示,结论给出的观测次数下界是比较紧的,并验证了列重固定、行重固定的稀疏随机矩阵作为观测矩阵的可行性和实用性.%Sparse recovery problem in the theory of compressed sensing is to recover a high-dimensional signal from its low-dimensional projection, and a dense random matrix is usually used as the measurement matrix to solve this problem. While some sparse random matrices as the measurement matrices can also achieve this goal. Sparse random matrices have several attractive properties, like low computational complexity in both encoding and recovery, easy incremental updates, and low storage requirement. Based on the theory of compressed sensing, this paper investigates sparse random matrices with fixed column sparsity or fixed row sparsity and general sparse random matrices respectively, and when these sparse random matrices satisfy the restricted isometry property, the lower bound conditions that the number of measurements should satisfy are deduced, and the performance of three matrices is analysed. Binary sparse random matrices are taken as a special example to do simulation experiments. Numerical results show that, the lower bounds on the number of measurements given by this paper are tight, and the feasibility
A computer generator for randomly layered structures
Institute of Scientific and Technical Information of China (English)
YU Jia-shun; HE Zhen-hua
2004-01-01
An algorithm is introduced in this paper for the synthesis of randomly layered earth models. Under the assumption that the layering and the physical parameters for a layer are random variables with truncated normal distributions, random numbers sampled from the distributions can be used to construct the layered structure and determine physical parameters for the layers. To demonstrate its application, random models were synthesized for the modelling of seismic ground motion amplification of a site with uncertainties in its model parameters.
Kryvi, J. B.; Simonsen, I.; Maradudin, A. A.
2016-09-01
The contribution to the mean differential reflection coefficient from the in-plane, co-polarized scattering of p- polarized light from a two-dimensional randomly rough dielectric surface is used to invert scattering data to obtain the normalized surface height autocorrelation function of the surface. Within phase perturbation theory this contribution to the mean differential reflection coefficient possesses singularities (poles) when the polar scattering angle θs equals +/-θB= +/- tan-1√E, where E is the dielectric constant of the dielectric medium and θB is the Brewster angle. Nevertheless, we show in this paper that if the mean differential reflection coefficient is measured only in the angular range |θs| inversion scheme. This approach also yields the rms height of the surface roughness, and the dielectric constant of the scattering medium if it is not known in advance. The input data used in this minimization procedure consist of computer simulation results for surfaces defined by exponential and Gaussian surface height correlation functions, without and with the addition of multiplicative noise. The proposed inversion scheme is computationally efficient.
Siervo, M; Sabatini, S; Fewtrell, M S; Wells, J C K
2013-12-01
Watching television and playing video game being seated represent sedentary behaviours and increase the risk of weight gain and hypertension. We investigated the acute effects of violent and non-violent video-game playing on blood pressure (BP), appetite perception and food preferences. Forty-eight young, normal-weight men (age: 23.1±1.9 years; body mass index: 22.5±1.9 kg/m(2)) participated in a three-arm, randomized trial. Subjects played a violent video game, a competitive, non-violent video game or watched TV for 1 h. Measurements of BP, stress and appetite perception were recorded before a standardized meal (∼300 kcal) and then repeated every 15 min throughout the intervention. Violent video-game playing was associated with a significant increase in diastolic BP (Δ±s.d.=+7.5±5.8 mm Hg; P=0.04) compared with the other two groups. Subjects playing violent video games felt less full (P=0.02) and reported a tendency towards sweet food consumption. Video games involving violence appear to be associated with significant effects on BP and appetite perceptions compared with non-violent gaming or watching TV.
Indian Academy of Sciences (India)
Gopal K Basak; Arunangshu Biswas
2013-02-01
In this paper we show that the continuous version of the self-normalized process $Y_{n,p}(t)=S_n(t)/V_{n,p}+(nt-[nt])X_{[nt]+1}/V_{n,p},0 < t ≤ 1;p>0$ where $S_n(t)=\\sum^{[nt]}_{i=1}X_i$ and $V_{(n,p)}=\\left(\\sum^n_{i=1}|X_i|^p\\right)^{1/p}$ and $X_i i.i.d.$ random variables belong to $DA()$, has a non-trivial distribution $\\mathrm{iff}$ ==2. The case for 2>> and ≤ < 2 is systematically eliminated by showing that either of tightness or finite dimensional convergence to a non-degenerate limiting distribution does not hold. This work is an extension of the work by Csörgő et al. who showed Donsker’s theorem for $Y_{n,2}(\\cdot p)$, i.e., for $p=2$, holds $\\mathrm{iff}$ =2 and identified the limiting process as a standard Brownian motion in sup norm.
一种用于心理测验伪随机数序列的产生方法%A Pseudo Random Number Generator for Psychology Test
Institute of Scientific and Technical Information of China (English)
文治洪; 胡文东; 李晓京; 王涛; 马进
2011-01-01
Objective To develop a method of generating pgeudo random number(PRN) applied in simulating signal of psychomotor vigilance task in psychology test. Methoda PRN series were generated by the random function of computer program and were transformed to an equilibration distribution PRN series based on the special arithmetic rule which suitable for the psychology test. The signal of psychomotor vigilance task would be controlled by the PRN series. Results The signal of psychomotor vigilance task controlled by the PRN series showed an equilibration distribution random sequence. Conclusion PRN series generated by the computer program shows an equilibration distribution PRN series which is suitable for the psychology test.%目的:设计一种伪随机数序列的产生方法,用于心理学实验中告警信号的模拟.方法:采用计算机软件Random函数产生随机数,按照不同实验的要求,按一定的规则进行变换,产生平均分布的随机数序列,用于控制视觉刺教信号随机顺序呈现或随机时间呈现的过程.结果:将此随机数序列作为刺激信号呈现的顺序,实现了刺激信号呈现平均分布的随机性要求.结论:通过Random函数和一定的规则变换产生的随机数序列,达到了平均分布随机数的要求,可以实现心理学实验的需求.
Turban, L
2016-01-01
The probability distribution of the number $s$ of distinct sites visited up to time $t$ by a random walk on the fully-connected lattice with $N$ sites is first obtained by solving the eigenvalue problem associated with the discrete master equation. Then, using generating function techniques, we compute the joint probability distribution of $s$ and $r$, where $r$ is the number of sites visited only once up to time $t$. Mean values, variances and covariance are deduced from the generating functions and their finite-size-scaling behaviour is studied. Introducing properly centered and scaled variables $u$ and $v$ for $r$ and $s$ and working in the scaling limit ($t\\to\\infty$, $N\\to\\infty$ with $w=t/N$ fixed) the joint probability density of $u$ and $v$ is shown to be a bivariate Gaussian density. It follows that the fluctuations of $r$ and $s$ around their mean values in a finite-size system are Gaussian in the scaling limit. The same type of finite-size scaling is expected to hold on periodic lattices above the ...
Bengtsson, Henrik; Ray, Amrita; Spellman, Paul; Speed, Terence P.
2009-01-01
Motivation: The rapid expansion of whole-genome copy number (CN) studies brings a demand for increased precision and resolution of CN estimates. Recent studies have obtained CN estimates from more than one platform for the same set of samples, and it is natural to want to combine the different estimates in order to meet this demand. Estimates from different platforms show different degrees of attenuation of the true CN changes. Similar differences can be observed in CNs from the same platform...
Campbell, Matthew D; Walker, Mark; Bracken, Richard M; Turner, Daniel; Stevenson, Emma J; Gonzalez, Javier T; Shaw, James A; West, Daniel J
2015-01-01
Evening-time exercise is a frequent cause of severe hypoglycemia in type 1 diabetes, fear of which deters participation in regular exercise. Recommendations for normalizing glycemia around exercise consist of prandial adjustments to bolus insulin therapy and food composition, but this carries only short-lasting protection from hypoglycemia. Therefore, this study aimed to examine the impact of a combined basal-bolus insulin dose reduction and carbohydrate feeding strategy on glycemia and metabolic parameters following evening exercise in type 1 diabetes. Ten male participants (glycated hemoglobin: 52.4±2.2 mmol/mol), treated with multiple daily injections, completed two randomized study-days, whereby administration of total daily basal insulin dose was unchanged (100%), or reduced by 20% (80%). Participants attended the laboratory at ∼08:00 h for a fasted blood sample, before returning in the evening. On arrival (∼17:00 h), participants consumed a carbohydrate meal and administered a 75% reduced rapid-acting insulin dose and 60 min later performed 45 min of treadmill running. At 60 min postexercise, participants consumed a low glycemic index (LGI) meal and administered a 50% reduced rapid-acting insulin dose, before returning home. At ∼23:00 h, participants consumed a LGI bedtime snack and returned to the laboratory the following morning (∼08:00 h) for a fasted blood sample. Venous blood samples were analyzed for glucose, glucoregulatory hormones, non-esterified fatty acids, β-hydroxybutyrate, interleukin 6, and tumor necrosis factor α. Interstitial glucose was monitored for 24 h pre-exercise and postexercise. Glycemia was similar until 6 h postexercise, with no hypoglycemic episodes. Beyond 6 h glucose levels fell during 100%, and nine participants experienced nocturnal hypoglycemia. Conversely, all participants during 80% were protected from nocturnal hypoglycemia, and remained protected for 24 h postexercise. All metabolic
Apanasovich, Tatiyana V.
2012-03-01
We introduce a valid parametric family of cross-covariance functions for multivariate spatial random fields where each component has a covariance function from a well-celebrated Matérn class. Unlike previous attempts, our model indeed allows for various smoothnesses and rates of correlation decay for any number of vector components.We present the conditions on the parameter space that result in valid models with varying degrees of complexity. We discuss practical implementations, including reparameterizations to reflect the conditions on the parameter space and an iterative algorithm to increase the computational efficiency. We perform various Monte Carlo simulation experiments to explore the performances of our approach in terms of estimation and cokriging. The application of the proposed multivariate Matérnmodel is illustrated on two meteorological datasets: temperature/pressure over the Pacific Northwest (bivariate) and wind/temperature/pressure in Oklahoma (trivariate). In the latter case, our flexible trivariate Matérn model is valid and yields better predictive scores compared with a parsimonious model with common scale parameters. © 2012 American Statistical Association.
Tang, X.; Wu, Z. M.; Wu, J. G.; Deng, T.; Fan, L.; Zhong, Z. Q.; Chen, J. J.; Xia, G. Q.
2015-01-01
We propose and experimentally demonstrate a novel technique to generate multi-channel high-speed physical random numbers (PRNs) by taking two chaotic signal outputs from mutually coupled semiconductor lasers (MC-SLs) as entropy sources. First, through controlling the operation parameters of the MC-SL system, two time-delay signature (TDS) suppressed chaotic signals can be obtained. Next, each of these two chaotic signals is sampled by an 8 bit analog-to-digital converter (ADC) with a sampling rate of 10 GHz, and then a bitwise exclusive-OR (XOR) operation on the corresponding bits in samples of the chaotic signal and its time delayed signal is implemented to obtain 8 bit XOR data. Furthermore, through selecting the five least significant bits (LSBs) of 8 bit XOR data to form 5 bit Boolean sequences, two sets of PRN streams with a rate up to 50 Gbits s-1 are generated and successfully pass the NIST statistical tests. Finally, merging these two sets of 50 Gbits s-1 PRN streams by an interleaving operation, another set of the 100 Gbits s-1 PRN stream, which meets all the quality criteria of NIST statistical tests, is also acquired.
Hostetter, Galen; Kim, Su Young; Savage, Stephanie; Gooden, Gerald C; Barrett, Michael; Zhang, Jian; Alla, Lalitamba; Watanabe, April; Einspahr, Janine; Prasad, Anil; Nickoloff, Brian J; Carpten, John; Trent, Jeffrey; Alberts, David; Bittner, Michael
2010-01-01
Genomic technologies, such as array comparative genomic hybridization (aCGH), increasingly offer definitive gene dosage profiles in clinical samples. Historically, copy number profiling was limited to large fresh-frozen tumors where intact DNA could be readily extracted. Genomic analyses of pre-neoplastic tumors and diagnostic biopsies are often limited to DNA processed by formalin-fixation and paraffin-embedding (FFPE). We present specialized protocols for DNA extraction and processing from FFPE tissues utilizing DNase processing to generate randomly fragmented DNA. The protocols are applied to FFPE clinical samples of varied tumor types, from multiple institutions and of varied block age. Direct comparative analyses with regression coefficient were calculated on split-sample (portion fresh/portion FFPE) of colorectal tumor samples. We show equal detection of a homozygous loss of SMAD4 at the exon-level in the SW480 cell line and gene-specific alterations in the split tumor samples. aCGH application to a set of archival FFPE samples of skin squamous cell carcinomas detected a novel hemizygous deletion in INPP5A on 10q26.3. Finally we present data on derivative of log ratio, a particular sensitive detector of measurement variance, for 216 sequential hybridizations to assess protocol reliability over a wide range of FFPE samples.
Sampling exactly from the normal distribution
Karney, Charles F F
2013-01-01
An algorithm for sampling exactly from the normal distribution is given. The algorithm reads some number of uniformly distributed random digits in a given base and generates an initial portion of the representation of a normal deviate in the same base. Thereafter, uniform random digits are copied directly into the representation of the normal deviate. Thus, in constrast to existing methods, it is possible to generate normal deviates exactly rounded to any precision with a mean cost that scales linearly in the precision. The method performs no arbitrary precision arithmetic, calls no transcendental functions, and, indeed, uses no floating point arithmetic whatsoever; it uses only simple integer operations. The algorithm is inspired by von Neumann's algorithm for sampling from the exponential distribution; an improvement to von Neumann's algorithm is also given.
ajansen; kwhitefoot; panteltje1; edprochak; sudhakar, the
2014-07-01
In reply to the physicsworld.com news story “How to make a quantum random-number generator from a mobile phone” (16 May, http://ow.ly/xFiYc, see also p5), which describes a way of delivering random numbers by counting the number of photons that impinge on each of the individual pixels in the camera of a Nokia N9 smartphone.
Directory of Open Access Journals (Sweden)
Sandra Ferreira Silva de Almeida
2008-04-01
Full Text Available The aim was to compare healing and perineal pain with the use of continuous and interrupted suture techniques in women after normal delivery. A randomized controlled trial was carried out at a hospital birth center in Itapecirica da Serra, Sao Paulo, Brazil. A total of 61 women participated with episiotomy or second degree perineal tear, allocated in two groups according to the continuous (n=31 or interrupted (n=30 suture techniques. The main outcomes evaluated were edema, ecchymosis, hyperemia, secretion, dehiscence, fibrosis, frequency and degree of pain (evaluated by numerical scale from 1 to 10. Data were collected during hospitalization and after discharge (four and 41 days after birth. Healing occurred by first intention in 100% of cases in both suture techniques. There were no statistically significant differences for the occurrence of morbidities, except for perineal pain due to palpation at four days after delivery, which was more frequent among women with interrupted suture.El objetivo fue comparar la cicatrización y el dolor perineal utilizando técnicas de sutura continua y separada, en mujeres que realizaron parto normal. El estudio fue controlado aleatorio, realizado en un centro para parto normal en Itapecerica de la Sierra, Sao Paulo. Participaron 61 mujeres con episiotomía o desgarro perineal de segundo grado, distribuidas en dos grupos (sutura continua n=31 y sutura separada n=30. Las principales medidas evaluadas fueron edema, equimosis, hiperemia, secreción, dehiscencia de herida, fibrosis, frecuencia y magnitud del dolor (evaluada por escala numérica de 1 a 10. Los datos fueron recolectados durante la hospitalización y después del alta (de 4 a 41 días post-parto. La cicatrización fue por primera intención en 100% de los casos, para las dos técnicas de sutura. No se encontró diferencia estadísticamente significativa en los casos de morbilidad, con excepción del dolor perineal a la palpación al cuarto día post
DEFF Research Database (Denmark)
Haak, C S; Jensen, Pernille Nymann; Pedersen, A T
2010-01-01
Hirsutism is a common disorder in women of reproductive age, and androgen disturbances may aggravate the condition. Limited evidence exists regarding efficacy of hair removal in this specific population and no data are available for patients with verified normal testosterone levels....
DEFF Research Database (Denmark)
Nielsen, Lise Hald; Ovesen, Per; Hansen, Mie R
2016-01-01
It was hypothesized that primary renal sodium retention blunted the reactivity of the renin-angiotensin-aldosterone system to changes in salt intake in preeclampsia (PE). A randomized, cross-over, double-blinded, dietary intervention design was used to measure the effects of salt tablets or placebo...... of plasma renin and angiotensin II in response to changes in dietary salt intake compatible with a primary increase in renal sodium reabsorption in hypertensive pregnancies....
Directory of Open Access Journals (Sweden)
Pankaj Shivhare
2014-08-01
Results: Abdominal pain was worst during the first 24 hours after laparoscopic cholecystectomy. At 6, 12 and 24 hrs, group A exhibited significantly less abdominal pain than group B. Group A also experienced less shoulder tip pain during the first postoperative day as compared to the control group. Conclusion: Intraperitoneal irrigation with normal saline is effective in reducing postoperative abdominal and shoulder tip pain following laparoscopic cholecystectomy. [Arch Clin Exp Surg 2014; 3(4.000: 213-219
Directory of Open Access Journals (Sweden)
Galambos Peter
2005-04-01
Full Text Available Abstract Background Reduced choroidal perfusion is hypothesized to play a role in the pathogenesis of normal tension glaucoma. Thus the impact of antiglaucomatous eye drops on ocular perfusion has been the focus of recent research and the subject of intensive investigations. The present study investigates whether topically applied latanoprost or bimatoprost influence ocular perfusion in patients with normal tension glaucoma and compares these effects with that changes detected after the treatment with dorzolamide. Methods Ocular hemodynamics were assessed by color Doppler imaging (CDI shortly before and after a one-month treatment with either latanoprost, bimatoprost or dorzolamide. Primary end-points of the study were peak systolic and end-diastolic blood flow velocities in the short posterior ciliary artery (SPCA under the new therapy. Intraocular pressure (IOP and additional perfusion parameters in the SPCA and other retrobulbar vessels were tracked as observational parameters. n = 42 patients with normal tension glaucoma were enrolled in the study. Results Systolic and diastolic blood flow velocities in the SPCA showed no significant alteration after the treatment with latanoprost or bimatoprost. Dorzolamide lead to increase of peak systolic velocity. IOP was reduced by all three agents in a range reported in the literature. Conclusion Topically applied latanoprost and bimatoprost act in a hemodynamically neutral manner and have the capability to lower IOP even in patients with normal tension glaucoma and low initial IOP level. Dorzolamide accelerates blood flow in systole. None of the tested compounds has a negative impact on hemodynamics in the short posterior ciliary arteries.
Sas, Theo; Otten, Barto; Hoorweg-Nijman, J.J.; Vulsma, Thomas; Drop, Stenvert; Massa, G.G.; Rouwé, Catrienus; Rongen-Westerlaken, C; Reeser, Maarten; Gosen, J.J.; Gerver, W J; Muinck Keizer-Schrama, Sabine; Stijnen, Theo; Jansen, Maarten
1999-01-01
textabstractShort stature and ovarian failure are the main features in Turner syndrome (TS). To optimize GH and estrogen treatment, we studied 68 previously untreated girls with TS, age 2-11 yr, who were randomly assigned to one of three GH dosage groups: group A, 4 IU/m2 day (approximately 0.045 mg/kg x day); group B, first yr 4, thereafter 6 IU/m2 x day (approximately 0.0675 mg/kg/day); group C, first yr 4, second yr 6, thereafter 8 IU/m2 x day (approximately 0.090 mg/kg x day). In the firs...
Hox, Joop J.; Moerbeek, Mirjam; Kluytmans, Anouck; van de Schoot, Rens
2014-01-01
Cluster randomized trials assess the effect of an intervention that is carried out at the group or cluster level. Ajzen's theory of planned behavior is often used to model the effect of the intervention as an indirect effect mediated in turn by attitude, norms and behavioral intention. Structural
Institute of Scientific and Technical Information of China (English)
王建民; 谢天宇; 张鸿飞; 谢超; 杨东旭; 王坚
2015-01-01
In this article, a random number generator without post-processing, which uses the randomness of photon in optics quantum random source,is designed.The designemploys feeble light to detect at single photon level.The pulse number detected by in fixed period obeys Possion distribution,but effect of electronic compo-nents and readout electronics distortsPossion distribution.Controlling mean count can eliminate bias to achieve unbiased in statistics.High quality and high speed random numbers using automatic bias-correcting technique is producedwithout post-processing and passes all standard tests relevant for random number generators,like NIST,Diehard.%利用光学量子随机源中光子的随机性，设计了一种无需后处理的随机数产生器。在设计中，用弱光源进行单光子水平的探测，利用单光子水平的光源在半导体探测器上一定周期内探测到的脉冲个数服从泊松分布的基本原理，而元器件和读出电子学造成理想泊松分布的变形，通过控制平均计数消除偏差，达到统计学上的无偏。本设计具有自动纠偏功能，产生无后处理的高质量高速真随机数，并通过了NIST、Diehard等多种技术测试标准。
Carpenter, Donald A.
2008-01-01
Confusion exists among database textbooks as to the goal of normalization as well as to which normal form a designer should aspire. This article discusses such discrepancies with the intention of simplifying normalization for both teacher and student. This author's industry and classroom experiences indicate such simplification yields quicker…
Quantiles for Finite Mixtures of Normal Distributions
Rahman, Mezbahur; Rahman, Rumanur; Pearson, Larry M.
2006-01-01
Quantiles for finite mixtures of normal distributions are computed. The difference between a linear combination of independent normal random variables and a linear combination of independent normal densities is emphasized. (Contains 3 tables and 1 figure.)
Directory of Open Access Journals (Sweden)
Yingying Luo
2017-01-01
Full Text Available Background. Patients with prediabetes are at high risk for diabetes and cardiovascular disease (CVD. No study has explored whether intervention could revert prediabetes to normal glycemic status as the primary outcome. Beijing Prediabetes Reversion Program (BPRP would evaluate whether intensive lifestyle modification and/or pioglitazone could revert prediabetic state to normoglycemia and improve the risk factors of CVD as well. Methods. BPRP is a randomized, multicenter, 2 × 2 factorial design study. Participants diagnosed as prediabetes were randomized into four groups (conventional/intensive lifestyle intervention and 30 mg pioglitazone/placebo with a three-year follow-up. The primary endpoint was conversion into normal glucose tolerance. The trial would recruit 2000 participants (500 in each arm. Results. Between March 2007 and March 2011, 1945 participants were randomized. At baseline, the individuals were 53±10 years old, with median BMI 26.0 (23.9, 28.2 kg/m2 and HbA1c 5.8 (5.6, 6.1%. 85% of the participants had IGT and 15% had IFG. Parameters relevant to glucose, lipids, blood pressure, lifestyle, and other metabolic markers were similar between conventional and intensive lifestyle intervention group at baseline. Conclusion. BPRP was the first study to determine if lifestyle modification and/or pioglitazone could revert prediabetic state to normoglycemia in Chinese population. Major baseline parameters were balanced between two lifestyle intervention groups. This trial is registered with www.chictr.org.cn: ChiCTR-PRC-06000005.
Directory of Open Access Journals (Sweden)
Fredy Ángel Miguel Amaya Robayo
2010-08-01
Full Text Available Es un hecho conocido que toda gramática libre de contexto puede ser transformada a la forma normal de Chomsky de tal forma que los lenguajes generados por las dos gramáticas son equivalentes. Una gramática en forma normal de Chomsky (FNC, tiene algunas ventajas, por ejemplo sus árboles de derivación son binarios, la forma de sus reglas más simples etc. Por eso es siempre deseable poder trabajar con una gramática en FNC en las aplicaciones que lo requieran. Existe un algoritmo que permite transformar una gramática libre de contexto a una en FNC, sin embargo la cantidad de reglas generadas al hacer la transformación depende del número de reglas en la gramática inicial así como de otras características. En este trabajo se analiza desde el punto de vista experimental y estadístico, la relación existente entre el número de reglas iniciales y el número de reglas que resultan luego de transformar una Gramática Libre de Contexto a la FNC. Esto permite planificar la cantidad de recursos computacionales necesarios en caso de tratar con gramáticas de alguna complejidad.It is well known that any context-free grammar can be transformed to the Chomsky normal form so that the languages generated by each one are equivalent. A grammar in Chomsky Normal Form (CNF, has some advantages: their derivation trees are binary, simplest rules and so on. So it is always desirable to work with a grammar in CNF in applications that require them. There is an algorithm that can transform a context-free grammar to one CNF grammar, however the number of rules generated after the transformation depends on the initial grammar and other circumstances. In this work we analyze from the experimental and statistical point of view the relationship between the number of initial rules and the number of resulting rules after transforming. This allows you to plan the amount of computational resources needed in case of dealing with grammars of some complexity.
基于 FPGA 一种真随机数生成器的设计和实现%DESIGN AND IMPLEMENTATION OF A TRUE RANDOM NUMBER GENERATOR BASED ON FPGA
Institute of Scientific and Technical Information of China (English)
吴飞; 李艳萍
2013-01-01
Aiming at the application of random number in secure communication , we design and implement a new FPGA-based true random number generator ( TRNG) in this paper .It takes the metastability of RS flip-flop as the random source to reduce the phase shift of clock signal and minimises the process differences of internal components so as to guarantee the randomness of output sequence .The outputs of multi-triggers are conducted the XOR operations and are added the post-processing module for enhancing the quality of random sequences and increasing the entropy per bit .This design has been implemented on Xilinx Spartan 3 XC3S400 platform, the random sequence generated can pass the NIST test , and all the indexes meet the design requirements .The true random number generator consists of common logic unites only, it can be quickly transplanted into ASIC design and shorten the development cycle .%针对随机数在保密通信中的应用，设计并实现一种基于FPGA的真随机数生成器，将RS触发器的亚稳态作为随机源，减小时钟信号的相位偏移，最小化内部元件的工艺差异，从而保证输出序列的随机性，对多个触发器的输出进行异或操作并且加入后处理模块来提高随机序列的质量和增加每比特的熵。该设计在Xilinx Spartan3 XC3S400平台上实现，产生的随机序列可通过NIST测试，满足设计要求。该真随机数发生器仅由普通逻辑单元组成，能快速移植到集成电路设计流程中，缩短开发周期。
DEFF Research Database (Denmark)
Danielsen, Anne Kjaergaard; Okholm, Cecilie; Pommergaard, Hans-Christian;
2014-01-01
in 1995 to 1,273 in 2010, with a larger share of multicenter studies being performed in Europe and North America. The pharmacological interventions were primarily being tested in medical studies followed by the device tests predominantly in surgical studies. The number of included patients as well...
Broer, H.; Hoveijn, I.; Lunter, G.; Vegter, G.
2003-01-01
The Birkhoff normal form procedure is a widely used tool for approximating a Hamiltonian systems by a simpler one. This chapter starts out with an introduction to Hamiltonian mechanics, followed by an explanation of the Birkhoff normal form procedure. Finally we discuss several algorithms for comput
Directory of Open Access Journals (Sweden)
Overend Tom
2011-02-01
Full Text Available Abstract Background Previous interventions to increase physical activity and reduce cardiovascular risk factors have been targeted at individuals with established disease; less attention has been given to intervention among individuals with high risk for disease nor has there been determination of the influence of setting in which the intervention is provided. In particular, family practice represents an ideal setting for the provision and long-term maintenance of lifestyle interventions for patients at risk (ie high-normal blood pressure or impaired glucose tolerance. Methods/design The Staged Nutrition and Activity Counseling (SNAC study is a randomized clustered design clinical trial that will investigate the effectiveness and efficacy of a multi-component lifestyle intervention on cardiovascular disease risk factors and vascular function in patients at risk in primary care. Patients will be randomized by practice to either a standard of care lifestyle intervention or a behaviourally-based, matched prescriptive physical activity and diet change program. The primary goal is to increase physical activity and improve dietary intake according to Canada's Guides to Physical Activity Healthy Eating over 24 months. The primary intention to treat analysis will compare behavioral, physiological and metabolic outcomes at 6, 12 and 24 months post-randomization including estimation of incident hypertension and/or diabetes. Discussion The design features of our trial, and the practical problems (and solutions associated with implementing these design features, particularly those that result in potential delay between recruitment, baseline data collection, randomization, intervention, and assessment will be discussed. Results of the SNAC trial will provide scientific rationale for the implementation of this lifestyle intervention in primary care. Trial registration ISRCTN: ISRCTN:42921300
Armstrong, Kathleen; Coyte, Peter; Semple, John
2015-01-01
Women's College Hospital (WCH) in Toronto offers specialized ambulatory surgical procedures. A feasibility study using a mobile appliciation (app) to supplement in-person follow-up care after surgery suggests that the mobile app adequately detects postoperative complications, eliminates the need for in-person follow-up care and is cost-effective. This is concordant with other postoperative telemedicine studies. The purpose of this study is to determine if we can avert in-person follow-up care through the use of mobile app compared to conventional, in-person follow-up care in the first month following surgery amongst breast reconstruction patients at WCH. This will be a pragmatic, single-centre, open, controlled, 2-arm parallel-group superiority randomized trial. Mobile app follow-up care is a novel approach to managing patients postoperatively with the potential to avert in-person follow-up and generate cost-savings for the healthcare system and patient.
Sankaranarayanan, Preethi; Schomay, Theodore E.; Aiello, Katherine A.; Alter, Orly
2015-01-01
The number of large-scale high-dimensional datasets recording different aspects of a single disease is growing, accompanied by a need for frameworks that can create one coherent model from multiple tensors of matched columns, e.g., patients and platforms, but independent rows, e.g., probes. We define and prove the mathematical properties of a novel tensor generalized singular value decomposition (GSVD), which can simultaneously find the similarities and dissimilarities, i.e., patterns of varying relative significance, between any two such tensors. We demonstrate the tensor GSVD in comparative modeling of patient- and platform-matched but probe-independent ovarian serous cystadenocarcinoma (OV) tumor, mostly high-grade, and normal DNA copy-number profiles, across each chromosome arm, and combination of two arms, separately. The modeling uncovers previously unrecognized patterns of tumor-exclusive platform-consistent co-occurring copy-number alterations (CNAs). We find, first, and validate that each of the patterns across only 7p and Xq, and the combination of 6p+12p, is correlated with a patient’s prognosis, is independent of the tumor’s stage, the best predictor of OV survival to date, and together with stage makes a better predictor than stage alone. Second, these patterns include most known OV-associated CNAs that map to these chromosome arms, as well as several previously unreported, yet frequent focal CNAs. Third, differential mRNA, microRNA, and protein expression consistently map to the DNA CNAs. A coherent picture emerges for each pattern, suggesting roles for the CNAs in OV pathogenesis and personalized therapy. In 6p+12p, deletion of the p21-encoding CDKN1A and p38-encoding MAPK14 and amplification of RAD51AP1 and KRAS encode for human cell transformation, and are correlated with a cell’s immortality, and a patient’s shorter survival time. In 7p, RPA3 deletion and POLD2 amplification are correlated with DNA stability, and a longer survival. In Xq
Directory of Open Access Journals (Sweden)
Preethi Sankaranarayanan
Full Text Available The number of large-scale high-dimensional datasets recording different aspects of a single disease is growing, accompanied by a need for frameworks that can create one coherent model from multiple tensors of matched columns, e.g., patients and platforms, but independent rows, e.g., probes. We define and prove the mathematical properties of a novel tensor generalized singular value decomposition (GSVD, which can simultaneously find the similarities and dissimilarities, i.e., patterns of varying relative significance, between any two such tensors. We demonstrate the tensor GSVD in comparative modeling of patient- and platform-matched but probe-independent ovarian serous cystadenocarcinoma (OV tumor, mostly high-grade, and normal DNA copy-number profiles, across each chromosome arm, and combination of two arms, separately. The modeling uncovers previously unrecognized patterns of tumor-exclusive platform-consistent co-occurring copy-number alterations (CNAs. We find, first, and validate that each of the patterns across only 7p and Xq, and the combination of 6p+12p, is correlated with a patient's prognosis, is independent of the tumor's stage, the best predictor of OV survival to date, and together with stage makes a better predictor than stage alone. Second, these patterns include most known OV-associated CNAs that map to these chromosome arms, as well as several previously unreported, yet frequent focal CNAs. Third, differential mRNA, microRNA, and protein expression consistently map to the DNA CNAs. A coherent picture emerges for each pattern, suggesting roles for the CNAs in OV pathogenesis and personalized therapy. In 6p+12p, deletion of the p21-encoding CDKN1A and p38-encoding MAPK14 and amplification of RAD51AP1 and KRAS encode for human cell transformation, and are correlated with a cell's immortality, and a patient's shorter survival time. In 7p, RPA3 deletion and POLD2 amplification are correlated with DNA stability, and a longer survival
Institute of Scientific and Technical Information of China (English)
胡建军; 许洪斌; 祖世华; 高孝旺
2013-01-01
For the bending fatigue under the random load conditions with normal distribution,an equivalent load was analyzed and limiting value of gear bending fatigue strength was computed based on equivalent fatigue damage.The effect of load spectrum distributed parameter on equivalent load was analyzed,and load spectrum was compiled for luffing amplitude fatigue experiments.Then experiments of gear bending fatigue strength were achieved under random load according to normal distribution on MTS electro-hydraulic servo material fatigue tester,where the group method was used.The R-S-N curve was acquired in a concrete coefficient of variation.The tests prove that bending fatigue strength of gear under random load is less than that under constant load.By contrasting with the bending fatigue strength computed based on constant load,the theoretical results can agree with experimental ones.%根据齿轮传动过程中普遍承受的高斯分布载荷谱,编制了试验用随机变幅疲劳载荷谱,在MTS电液伺服疲劳试验机上利用成组试验方法完成了该随机载荷作用下全寿命齿轮弯曲疲劳试验,得到了特定变差系数高斯分布载荷谱下齿轮弯曲强度的R-S-N曲线.试验结果证明,随机变幅疲劳试验得出的轮齿疲劳寿命低于由疲劳载荷上限值取为载荷谱均值的恒载荷疲劳试验得出的疲劳寿命,因此,如果采用后者的试验结果去估算实际服役中的齿轮的弯曲疲劳寿命是非常危险的.对随机载荷下的齿轮设计的疲劳极限的理论值进行了预测,并与试验结果进行了比较.结果表明,理论分析结果与试验结果基本相符.
Barker, C.E.; Pawlewicz, M.J.
1993-01-01
In coal samples, published recommendations based on statistical methods suggest 100 measurements are needed to estimate the mean random vitrinite reflectance (Rv-r) to within ??2%. Our survey of published thermal maturation studies indicates that those using dispersed organic matter (DOM) mostly have an objective of acquiring 50 reflectance measurements. This smaller objective size in DOM versus that for coal samples poses a statistical contradiction because the standard deviations of DOM reflectance distributions are typically larger indicating a greater sample size is needed to accurately estimate Rv-r in DOM. However, in studies of thermal maturation using DOM, even 50 measurements can be an unrealistic requirement given the small amount of vitrinite often found in such samples. Furthermore, there is generally a reduced need for assuring precision like that needed for coal applications. Therefore, a key question in thermal maturation studies using DOM is how many measurements of Rv-r are needed to adequately estimate the mean. Our empirical approach to this problem is to compute the reflectance distribution statistics: mean, standard deviation, skewness, and kurtosis in increments of 10 measurements. This study compares these intermediate computations of Rv-r statistics with a final one computed using all measurements for that sample. Vitrinite reflectance was measured on mudstone and sandstone samples taken from borehole M-25 in the Cerro Prieto, Mexico geothermal system which was selected because the rocks have a wide range of thermal maturation and a comparable humic DOM with depth. The results of this study suggest that after only 20-30 measurements the mean Rv-r is generally known to within 5% and always to within 12% of the mean Rv-r calculated using all of the measured particles. Thus, even in the worst case, the precision after measuring only 20-30 particles is in good agreement with the general precision of one decimal place recommended for mean Rv
Directory of Open Access Journals (Sweden)
Mohammad Abbasinia
2014-09-01
Full Text Available Introduction: Endotracheal tube suctioning is essential for improve oxygenation in the patients undergoing mechanical ventilation. There are two types of shallow and deep endotracheal tube suctioning. This study aimed to evaluate the effect of shallow and deep suctioning methods on respiratory rate (RR, arterial blood oxygen saturation (SpO2 and number of suctioning in patients hospitalized in the intensive care units of Al-Zahra Hospital, Isfahan, Iran. Methods: In this randomized controlled trial, 74 patients who hospitalized in the intensive care units of Isfahan Al-Zahra Hospital were randomly allocated to the shallow and deep suctioning groups. RR and SpO2 were measured immediately before, immediately after, 1 and 3 minute after each suctioning. Number of suctioning was also noted in each groups. Data were analyzed using repeated measures analysis of variance (RMANOVA, chi-square and independent t-tests. Results: RR was significantly increased and SpO2 was significantly decreased after each suctioning in the both groups. However, these changes were not significant between the two groups. The numbers of suctioning was significantly higher in the shallow suctioning group than in the deep suctioning group. Conclusion: Shallow and deep suctioning had a similar effect on RR and SpO2. However, shallow suctioning caused further manipulation of patient’s trachea than deep suctioning method. Therefore, it seems that deep endotracheal tube suctioning method can be used to clean the airway with lesser manipulation of the trachea.
Normal Order: Combinatorial Graphs
Solomon, A I; Blasiak, P; Horzela, A; Penson, K A; Solomon, Allan I.; Duchamp, Gerard; Blasiak, Pawel; Horzela, Andrzej; Penson, Karol A.
2004-01-01
A conventional context for supersymmetric problems arises when we consider systems containing both boson and fermion operators. In this note we consider the normal ordering problem for a string of such operators. In the general case, upon which we touch briefly, this problem leads to combinatorial numbers, the so-called Rook numbers. Since we assume that the two species, bosons and fermions, commute, we subsequently restrict ourselves to consideration of a single species, single-mode boson monomials. This problem leads to elegant generalisations of well-known combinatorial numbers, specifically Bell and Stirling numbers. We explicitly give the generating functions for some classes of these numbers. In this note we concentrate on the combinatorial graph approach, showing how some important classical results of graph theory lead to transparent representations of the combinatorial numbers associated with the boson normal ordering problem.
Random Access Transport Capacity
Andrews, Jeffrey G; Kountouris, Marios; Haenggi, Martin
2009-01-01
We develop a new metric for quantifying end-to-end throughput in multihop wireless networks, which we term random access transport capacity, since the interference model presumes uncoordinated transmissions. The metric quantifies the average maximum rate of successful end-to-end transmissions, multiplied by the communication distance, and normalized by the network area. We show that a simple upper bound on this quantity is computable in closed-form in terms of key network parameters when the number of retransmissions is not restricted and the hops are assumed to be equally spaced on a line between the source and destination. We also derive the optimum number of hops and optimal per hop success probability and show that our result follows the well-known square root scaling law while providing exact expressions for the preconstants as well. Numerical results demonstrate that the upper bound is accurate for the purpose of determining the optimal hop count and success (or outage) probability.
Directory of Open Access Journals (Sweden)
I. Ježek
2015-06-01
Full Text Available The chasing method was used in an on-road measurement campaign, and emission factors (EF of black carbon (BC, particle number (PN and nitrogen oxides (NOx were determined for 139 individual vehicles of different types encountered on the roads. The aggregated results provide EFs for BC, NOx and PN for three vehicle categories: goods vehicles, gasoline and diesel passenger cars. This is the first on-road measurement study where BC EFs of numerous individual diesel cars were determined in real-world driving conditions. We found good agreement between EFs of goods vehicles determined in this campaign and the results of previous studies that used either chasing or remote sensing measurement techniques. The composition of the sampled car fleet determined from the national vehicle registry information is reflective of Eurostat statistical data on the Slovenian and European vehicle fleet. The median BC EF of diesel and gasoline cars that were in use for less than 5 years, decreased by 60 and 47% from those in use for 5–10 years, respectively, the median NOx and PN EFs, of goods vehicles that were in use for less than five years, decreased from those in use for 5–10 years by 52 and 67%, respectively. The influence of engine maximum power of the measured EFs showed an increase in NOx EF from least to more powerful vehicles with diesel engines. Finally a disproportionate contribution of high emitters to the total emissions of the measured fleet was found; the top 25% of emitting diesel cars contributed 63, 47 and 61% of BC, NOx and PN emissions respectively. With the combination of relatively simple on-road measurements with sophisticated post processing individual vehicles EF can be determined and useful information about the fleet emissions can be obtained by exactly representing vehicles which contribute disproportionally to vehicle fleet emissions; and monitor how the numerous emission reduction approaches are reflected in on-road driving
Viale, Giuseppe; Slaets, Leen; de Snoo, Femke A; Bogaerts, Jan; Russo, Leila; van't Veer, Laura; Rutgers, Emiel J T; Piccart-Gebhart, Martine J; Stork-Sloots, Lisette; Dell'Orto, Patrizia; Glas, Annuska M; Cardoso, Fatima
2016-02-01
Accurate identification of breast cancer patients most likely to benefit from adjuvant systemic therapies is crucial. Better understanding of differences between methods can lead to an improved ER, PgR, and HER-2 assessment. The purpose of this preplanned translational research is to investigate the correlation of central IHC/FISH assessments with microarray mRNA readouts of ER, PgR, and HER-2 status in the MINDACT trial and to determine if any discordance could be attributed to intratumoral heterogeneity or the DCIS and normal tissue components in the specimens. MINDACT is an international, prospective, randomized, phase III trial investigating the clinical utility of MammaPrint in selecting patients with early breast cancer for adjuvant chemotherapy (n = 6694 patients). Gene-expression data were obtained by TargetPrint; IHC and/or FISH were assessed centrally (n = 5788; 86 %). Macroscopic and microscopic evaluation of centrally submitted FFPE blocks identified 1427 cases for which the very same sample was submitted for gene-expression analysis. TargetPrint ER had a positive agreement of 98 %, and a negative agreement of 95 % with central pathology. Corresponding figures for PgR were 85 and 94 % and for HER-2 72 and 99 %. Agreement of mRNA versus central protein was not different when the same or a different portion of the tumor tissue was analyzed or when DCIS and/or normal tissue was included in the sample subjected to mRNA assays. This is the first large analysis to assess the discordance rate between protein and mRNA analysis of breast cancer markers, and to look into intratumoral heterogeneity, DCIS, or normal tissue components as a potential cause of discordance. The observed difference between mRNA and protein assessment for PgR and HER-2 needs further research; the present analysis does not support intratumoral heterogeneity or the DCIS and normal tissue components being likely causes of the discordance.
Log-normal distribution from a process that is not multiplicative but is additive.
Mouri, Hideaki
2013-10-01
The central limit theorem ensures that a sum of random variables tends to a Gaussian distribution as their total number tends to infinity. However, for a class of positive random variables, we find that the sum tends faster to a log-normal distribution. Although the sum tends eventually to a Gaussian distribution, the distribution of the sum is always close to a log-normal distribution rather than to any Gaussian distribution if the summands are numerous enough. This is in contrast to the current consensus that any log-normal distribution is due to a product of random variables, i.e., a multiplicative process, or equivalently to nonlinearity of the system. In fact, the log-normal distribution is also observable for a sum, i.e., an additive process that is typical of linear systems. We show conditions for such a sum, an analytical example, and an application to random scalar fields such as those of turbulence.
Interpreting parameters in the logistic regression model with random effects
DEFF Research Database (Denmark)
Larsen, Klaus; Petersen, Jørgen Holm; Budtz-Jørgensen, Esben
2000-01-01
interpretation, interval odds ratio, logistic regression, median odds ratio, normally distributed random effects......interpretation, interval odds ratio, logistic regression, median odds ratio, normally distributed random effects...
Hellhammer, Juliane; Vogt, Dominic; Franz, Nadin; Freitas, Ulla; Rutenberg, David
2014-07-31
Supplementation with a phosphatidylserine and phosphatidylserine/ phosphatidic acid complex (PAS) has been observed to normalize stress induced dysregulations of the hypothalamus-pituitary-adrenal axis (HPAA). Prolonged stress first induces a hyper-activation of the HPAA, which then can be followed by a state of hypo-activation.The aim of this study was to examine effects of an oral supplementation with 400 mg PS & 400 mg PA (PAS 400) per day on the endocrine stress response (ACTH, saliva and serum cortisol) to a psychosocial stressor. A special focus was to analyze subgroups of low versus high chronically stressed subjects as well as to test efficacy of 200 mg PS & 200 mg PA (PAS 200). 75 healthy male volunteers were enrolled for this double-blind, placebo-controlled study, stratified by chronic stress level, and randomly allocated to one of three study arms (placebo, PAS 200 and PAS 400 per day, respectively). Study supplementation was administered for 42 days for each participant. Chronic stress was measured with the Trier Inventory for Chronic Stress (TICS), and subgroups of high and low chronic stress were differentiated by median values as provided by the TICS authors. A six week period of supplementation was followed by an acute stress test (Trier Social Stress Test - TSST). Chronic stress levels and other baseline measures did not differ between treatment groups (all p>0.05). Acute stress was successfully induced by the TSST and resulted in a hyper-responsivity of the HPAA in chronically stressed subjects. Compared to placebo, a supplementation with a daily dose of PAS 400 was effective in normalizing the ACTH (p=0.010), salivary (p=0.043) and serum cortisol responses (p=0.035) to the TSST in chronically high but not in low stressed subjects (all p>0.05). Compared to placebo, supplementation with PAS 200 did not result in any significant differences in these variables (all p>0.05). There were no significant effects of supplementation with PAS on heart rate
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...
A New Class of Random Number Generators
Marsaglia, George; Zaman, Arif
1991-01-01
We introduce a new class of generators of two types: add-with-carry and subtract-with-borrow. Related to lagged-Fibonacci generators, the new class has interesting underlying theory, astonishingly long periods and provable uniformity for full sequences. Among several that we mention, we recommend particularly promising ones that will generate a sequence of $2^{1751}$ bits, or a sequence of $2^{1376}$ 32-bit integers, or a sequence of $2^{931}$ reals with 24-bit fractions--all using simple com...
Institute of Scientific and Technical Information of China (English)
冯云田; 赵婷婷; 加藤淳; 周伟
2016-01-01
Particles are assumed smooth in classical discrete element modelling,but real particles have random rough surfaces which may influence their mechanical properties.It is necessary therefore to quantitatively improve the conventional discrete element model particles by taking their surface roughness into consideration.In this work,a new random normal contact law is established for particles that have random rough surfaces.The contact law,based on the classic Greenwood and Williamson (GW)model,is derived by both theoretical derivation and numerical simulation.A Newton-Raphson based numerical solution procedure is proposed to obtain the total contact force for a given overlap and a set of rough surface parameters.Some related computational issues key to improve computa-tional efficiency and accuracy are addressed.Instead of a complicated integral expression involved in the GW model, the curve fitted empirical formula of the random contact law retains the closed form and simplicity of the Hertz model,with only one added parameter,σ,the standard deviation of the surface roughness,and therefore can be readily incorporated into the current discrete element modelling framework.%真实颗粒的力学性质会受到其随机粗糙表面的影响，然而在传统离散元模拟中通常假设颗粒具有光滑表面，因此有必要在定量考虑颗粒表面粗糙度的基础上改进离散元的接触模型。本文基于经典 Greenwood-Williamson(GW)模型通过理论分析和数值模拟提出了一种可以考虑颗粒表面粗糙度的法向接触定律；开发了基于 Newton-Raphson迭代的数值计算方法，通过输入颗粒重叠量和一系列表面粗糙系数计算总接触力；讨论了改进计算方法效率和准确性的相关问题。相对于 GW模型中接触关系的复杂积分表示，拟合得到新随机接触定律的表达式具有类似 Hertz定律的简单结构，只包含一个表征颗粒表面粗糙度标准偏差的新增参数，
Directory of Open Access Journals (Sweden)
Roghaie Khoshkholgh
2016-05-01
Full Text Available Objective: To compare the effects of two auditory methods by mother and fetus on the results of NST in 2011-2012.Materials and methods: In this single-blind clinical trial, 213 pregnant women with gestational age of 37-41 weeks who had no pregnancy complications were randomly divided into 3 groups (auditory intervention for mother, auditory intervention for fetus, and control each containing 71 subjects. In the intervention groups, music was played through the second 10 minutes of NST. The three groups were compared regarding baseline fetal heart rate and number of accelerations in the first and second 10 minutes of NST. The data were analyzed using one-way ANOVA, Kruskal-Wallis, and paired T-test.Results: The results showed no significant difference among the three groups regarding baseline fetal heart rate in the first (p = 0.945 and second (p = 0.763 10 minutes. However, a significant difference was found among the three groups concerning the number of accelerations in the second 10 minutes. Also, a significant difference was observed in the number of accelerations in the auditory intervention for mother (p = 0.013 and auditory intervention for fetus groups (p < 0.001. The difference between the number of accelerations in the first and second 10 minutes was also statistically significant (p = 0.002.Conclusion: Music intervention was effective in the number of accelerations which is the indicator of fetal health. Yet, further studies are required to be conducted on the issue.
Combinatorial Maps with Normalized Knot
Zeps, Dainis
2010-01-01
We consider combinatorial maps with fixed combinatorial knot numbered with augmenting numeration called normalized knot. We show that knot's normalization doesn't affect combinatorial map what concerns its generality. Knot's normalization leads to more concise numeration of corners in maps, e.g., odd or even corners allow easy to follow distinguished cycles in map caused by the fixation of the knot. Knot's normalization may be applied to edge structuring knot too. If both are normalized then one is fully and other partially normalized mutually.
Lisciandro, Gregory R; Fulton, Robert M; Fosgate, Geoffrey T; Mann, Kelly A
2017-09-01
To establish a baseline lung ultrasound (LUS) artifact profile using a regionally based protocol in cats without clinical signs of respiratory disease and with radiographically normal lungs compared to a cohort of cats with left-sided congestive heart failure (CHF). Prospective case series. Forty-nine cats without clinical signs of respiratory disease and with radiographically normal lungs and 7 cats with radiographic evidence of left-sided CHF. Application of a previously published LUS protocol. Frequency of B-lines was compared based on signalment, body condition score, investigator, and reasons for radiography and between 49 cats with radiographically normal lungs to 7 cats with radiographic evidence of left-sided CHF. Overall frequency of B-lines was 12% (95% confidence interval, 5-24%) in cats without respiratory disease versus 100% (95% confidence interval, 65-100%) in those with left-sided CHF. Six cats (6/49) had B-lines with 5/6 having B-lines at a single site; and 4/5 having a single B-line at 1 site, 1/5 having 2 B-lines at 1 site; and the sixth cat having 2 positive sites with a single B-line at each. In the cohort of cats with left-sided CHF, all cats (7/7) had >3 B-lines detected at every site. The lack of B-lines in cats without respiratory disease (with radiographically normal lungs) and the predominance of B-lines in cats with left-sided CHF suggest that a regionally based LUS protocol may be clinically useful for the identification and evaluation of feline respiratory conditions. © Veterinary Emergency and Critical Care Society 2017.
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.
Vorob'ev, Nikolai Nikolaevich
2011-01-01
Fibonacci numbers date back to an 800-year-old problem concerning the number of offspring born in a single year to a pair of rabbits. This book offers the solution and explores the occurrence of Fibonacci numbers in number theory, continued fractions, and geometry. A discussion of the ""golden section"" rectangle, in which the lengths of the sides can be expressed as a ration of two successive Fibonacci numbers, draws upon attempts by ancient and medieval thinkers to base aesthetic and philosophical principles on the beauty of these figures. Recreational readers as well as students and teacher
Number names and number understanding
DEFF Research Database (Denmark)
Ejersbo, Lisser Rye; Misfeldt, Morten
2014-01-01
through using mathematical names for the numbers such as one-ten-one for 11 and five-ten-six for 56. The project combines the renaming of numbers with supporting the teaching with the new number names. Our hypothesis is that Danish children have more difficulties learning and working with numbers, because...... 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....
Improving randomness characterization through Bayesian model selection
R., Rafael Díaz-H; Martínez, Alí M Angulo; U'Ren, Alfred B; Hirsch, Jorge G; Marsili, Matteo; Castillo, Isaac Pérez
2016-01-01
Nowadays random number generation plays an essential role in technology with important applications in areas ranging from cryptography, which lies at the core of current communication protocols, to Monte Carlo methods, and other probabilistic algorithms. In this context, a crucial scientific endeavour is to develop effective methods that allow the characterization of random number generators. However, commonly employed methods either lack formality (e.g. the NIST test suite), or are inapplicable in principle (e.g. the characterization derived from the Algorithmic Theory of Information (ATI)). In this letter we present a novel method based on Bayesian model selection, which is both rigorous and effective, for characterizing randomness in a bit sequence. We derive analytic expressions for a model's likelihood which is then used to compute its posterior probability distribution. Our method proves to be more rigorous than NIST's suite and the Borel-Normality criterion and its implementation is straightforward. We...
A Robust Low Power Chaos-Based Truly Random Number Generator%一种基于混沌的鲁棒低功耗真随机数发生器
Institute of Scientific and Technical Information of China (English)
周童; 周志波; 喻明艳; 叶以正
2008-01-01
提出了一种低功耗真随机数发生器,它基于简单的伯努利移位混沌映射,并通过对映射进行特殊扩展来保证在实际实现中保持鲁棒性.映射由开关电流技术实现,从而使其可以完全嵌入到片上密码系统中.采用流水线结构并用简单的异或电路来提高信息熵.该随机数发生器采用HJTC的0.18μm CMOS mixed signal工艺进行流片,并通过测试对其统计特性进行了分析.芯片功耗仅为1.42mW,输出比特率为10Mbit/s.%This paper presents a low power,truly random number generator (TRNG) based on a simple chaotic map of the Bernoulli shift, which is extended to remain robustness in implementation. The map is realized by switched-current techniques that can fully integrate it in a cryptosystem on a chip. A pipelined architecture post-processed by a simple XOR circuit is used to improve the entropy. The TRNG is fabricated in an HJTC 0.18μm CMOS mixed signal process,and the statistical properties are investigated by measurement results. The power consumption is only 1.42mW and the truly random output bit rate is 10Mbit/s.
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, ...
Dynamical invariance for random matrices
Unterberger, Jeremie
2016-01-01
We consider a general Langevin dynamics for the one-dimensional N-particle Coulomb gas with confining potential $V$ at temperature $\\beta$. These dynamics describe for $\\beta=2$ the time evolution of the eigenvalues of $N\\times N$ random Hermitian matrices. The equilibrium partition function -- equal to the normalization constant of the Laughlin wave function in fractional quantum Hall effect -- is known to satisfy an infinite number of constraints called Virasoro or loop constraints. We introduce here a dynamical generating function on the space of random trajectories which satisfies a large class of constraints of geometric origin. We focus in this article on a subclass induced by the invariance under the Schr\\"odinger-Virasoro algebra.
Testing for Subcellular Randomness
Okunoye, Babatunde O
2008-01-01
Statistical tests were conducted on 1,000 numbers generated from the genome of Bacteriophage T4, obtained from GenBank with accession number AF158101.The numbers passed the non-parametric, distribution-free tests.Deoxyribonucleic acid was discovered to be a random number generator, existent in nature.
A Limit Theorem for the Moment of Self-Normalized Sums
Directory of Open Access Journals (Sweden)
Zang Qing-pei
2009-01-01
Full Text Available Let be a sequence of independent and identically distributed (i.i.d. random variables and is in the domain of attraction of the normal law and . For , we prove the precise asymptotics in Davis law of large numbers for
Institute of Scientific and Technical Information of China (English)
无
2004-01-01
THE last digit of my home phone number in Beijing is 4. “So what?” European readers might ask.This was my attitude when I first lived in China; I couldn't understand why Chinese friends were so shocked at my indifference to the number 4. But China brings new discoveries every day, and I have since seen the light. I know now that Chinese people have their own ways of preserving their well being, and that they see avoiding the number 4 as a good way to stay safe.
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
Euler Characteristic and Quadrilaterals of Normal Surfaces
Indian Academy of Sciences (India)
Tejas Kalelkar
2008-05-01
Let be a compact 3-manifold with a triangulation . We give an inequality relating the Euler characteristic of a surface normally embedded in with the number of normal quadrilaterals in . This gives a relation between a topological invariant of the surface and a quantity derived from its combinatorial description. Secondly, we obtain an inequality relating the number of normal triangles and normal quadrilaterals of , that depends on the maximum number of tetrahedrons that share a vertex in .
Institute of Scientific and Technical Information of China (English)
史海芳; 李树有; 姬永刚
2008-01-01
For two normal populations with u~nown means μi and variances σ2i>0,i=1,2,assume that there is a semi-order restriction between ratios of means and standard deviations and sample numbers of two normal populations are different.A procedure of obtaining the maximum likelihood estimatom of μi's and σ's under the semi-order restrictions is proposed.For i=3 case,some connected results and simulations are given.
Testing bivariate independence and normality
Kallenberg, W.C.M.; Ledwina, Teresa; Rafajlowicz, Ewaryst
1997-01-01
In many statistical studies the relationship between two random variables X and Y is investigated and in particular the question whether X and Y are independent and normally distributed is of interest. Smooth tests may be used for testing this. They consist of several components, the first measuring
Tapiero, Charles S.; Vallois, Pierre
2016-11-01
The premise of this paper is that a fractional probability distribution is based on fractional operators and the fractional (Hurst) index used that alters the classical setting of random variables. For example, a random variable defined by its density function might not have a fractional density function defined in its conventional sense. Practically, it implies that a distribution's granularity defined by a fractional kernel may have properties that differ due to the fractional index used and the fractional calculus applied to define it. The purpose of this paper is to consider an application of fractional calculus to define the fractional density function of a random variable. In addition, we provide and prove a number of results, defining the functional forms of these distributions as well as their existence. In particular, we define fractional probability distributions for increasing and decreasing functions that are right continuous. Examples are used to motivate the usefulness of a statistical approach to fractional calculus and its application to economic and financial problems. In conclusion, this paper is a preliminary attempt to construct statistical fractional models. Due to the breadth and the extent of such problems, this paper may be considered as an initial attempt to do so.
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...
Edgington, Eugene
2007-01-01
Statistical Tests That Do Not Require Random Sampling Randomization Tests Numerical Examples Randomization Tests and Nonrandom Samples The Prevalence of Nonrandom Samples in Experiments The Irrelevance of Random Samples for the Typical Experiment Generalizing from Nonrandom Samples Intelligibility Respect for the Validity of Randomization Tests Versatility Practicality Precursors of Randomization Tests Other Applications of Permutation Tests Questions and Exercises Notes References Randomized Experiments Unique Benefits of Experiments Experimentation without Mani
ON THE RANGE OF RANDOM WALKS IN RANDOM ENVIRONMENT
Institute of Scientific and Technical Information of China (English)
ZHOUXIANYIN
1995-01-01
The range of roaldom walk on Zd in symmetric random environment is investigated. As results, it is proved that the strong law of large numbers for the range of random walk oil Zd in some random environments holds if d > 3, and a weak law of large numbers holds for d = 1.
Using Quasigroups for Generating Pseudorandom Numbers
Godavarty, Vinod Kumar
2011-01-01
This paper presents an algorithm for generating pseudorandom numbers using quasigroups. Random numbers have several applications in the area of secure communication. The proposed algorithm uses a matrix of size n x n which is pre-generated and stored. The quality of random numbers generated is compared with other pseudorandom number generator using Marsaglia's Diehard battery of tests.
Betti Numbers of Gaussian Fields
Park, Changbom; Pranav, Pratyush; Chingangbam, Pravabati; van de Weygaert, Rien; Jones, Bernard; Vegter, Gert; Kim, Inkang; Hidding, Johan; Hellwing, Wojciech A.
2013-01-01
We present the relation between the genus in cosmology and the Betti numbers for excursion sets of three- and two-dimensional smooth Gaussian random fields, and numerically investigate the Betti numbers as a function of threshold level. Betti numbers are topological invariants of figures that can be
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.
Randomly Stopped Sums: Models and Psychological Applications
Directory of Open Access Journals (Sweden)
Michael eSmithson
2014-11-01
Full Text Available This paper describes an approach to modeling the sums of a continuous random variable over a number of measurement occasions when the number of occasions also is a random variable. A typical example is summing the amounts of time spent attending to pieces of information in an information search task leading to a decision to obtain the total time taken to decide. Although there is a large literature on randomly stopped sums in financial statistics, it is largely absent from psychology. The paper begins with the standard modeling approaches used in financial statistics, and then extends them in two ways. First, the randomly stopped sums are modeled as ``life distributions'' such as the gamma or log-normal distribution. A simulation study investigates Type I error rate accuracy and power for gamma and log-normal versions of this model. Second, a Bayesian hierarchical approach is used for constructing an appropriate general linear model of the sums. Model diagnostics are discussed, and three illustrations are presented from real datasets.
Niglio de Figueiredo, Marcelo; Rudolph, Bärbel; Rodolph, Bärbel; Bylund, Carma L; Goelz, Tanja; Heußner, Pia; Sattel, Heribert; Fritzsche, Kurt; Wuensch, Alexander
2015-07-07
Communication skills training has proven to be an effective means to enhance communication of health care professionals in oncology. These effects are well studied in standardized settings. The question of transferring these skills into clinical consultations remains open. We build up on a previous developed training concept consisting of a workshop and coaching. This training achieved a medium effect size in two studies with standardized patients. In the current study, we expanded and manualized the coaching concept, and we will evaluate effects of a varied number of coaching sessions on real clinical consultations. Our aim is to determine how much coaching oncologists need to transfer communication skills into clinical practice. Physicians of two German medical centers will participate in a workshop for communication skills and will be randomized to either a group with one coaching session or a group with four coaching sessions following the workshop. The participation is voluntary and the physicians will receive medical education points. Consultations held by the participating physicians with actual patients who gave their informed consent will be filmed at three time points. These consultations will be evaluated by blinded raters using a checklist based on the training content (primary outcome). Secondary outcomes will be the self-evaluated communication competence by physicians and an evaluation of the consultations by both physicians and patients. We will evaluate our communication training concept on three levels - rater, physician and patient - and concentrate on the transfer of communication skills into real life situations. As we emphasize the external validity in this study design, limitations will be expected due to heterogeneity of data. With this study we aim to gain data on how to improve communication skills training that will result in better patient outcomes. German Clinical Trials Register DRKS00004385 .
Albuquerque, Deijanira; Nihei, Jorge; Cardillo, Fabíola; Singh, Ram
2010-01-01
Increasing evidence implies beneficial effects of angiotensin-converting enzyme (ACE) inhibitors beyond those of their original indications to control hypertension. One of the most attractive non-hemodynamic properties of ACE inhibitors is their ability to regulate cytokine production. The mechanism(s) underlying the role of ACE inhibitors on cytokine synthesis are not well understood but they have traditionally been attributed to the inhibition of angiotensin (Ang) II formation. In fact, it has been extensively demonstrated that ACE inhibitors decrease Ang II-induced production of proinflammatory cytokines and chemokines. However, it is not well described if inhibition of endogenous Ang II generation by ACE inhibitors modulates systemic cytokine production in mice. To verify that, in this work, we investigated the effects of treatment with the ACE inhibitors enalapril and captopril on cytokine synthesis in C57Bl/6 and Balb/c mice. Our results show that enalapril up regulates IL-10 produced by splenocytes from Balb/c and C57Bl/6 mice and captopril increased it only in Balb/c mice. Furthermore, CD4(+)CD103(+) presented increased IL-10 production after enalapril treatment. Enalapril as well as captopril short-term treatment enhanced IL-2 synthesis in Balb/c mice. Besides, enhanced IL-2 and IL-10 levels correlates with increased CD4(+)CD103(+)CD25(negative) T cells numbers in spleens from enalapril-treated mice.
Thelin, John R.
2013-01-01
What topic would you choose if you had the luxury of writing forever? In this article, John Thelin provides his response: He would opt to write about the history of higher education in a way that relies on quantitative data. "Numbers, please!" is his research request in taking on a longitudinal study of colleges and universities over…
Thelin, John R.
2013-01-01
What topic would you choose if you had the luxury of writing forever? In this article, John Thelin provides his response: He would opt to write about the history of higher education in a way that relies on quantitative data. "Numbers, please!" is his research request in taking on a longitudinal study of colleges and universities over…
Galbraith, Mary J.
1974-01-01
Examination of models for representing integers demonstrates that formal operational thought is required for establishing the operations on integers. Advocated is the use of many models for introducing negative numbers but, apart from addition, it is recommended that operations on integers be delayed until the formal operations stage. (JP)
Counting problems for number rings
Brakenhoff, Johannes Franciscus
2009-01-01
In this thesis we look at three counting problems connected to orders in number fields. First we study the probability that for a random polynomial f in Z[X] the ring Z[X]/f is the maximal order in Q[X]/f. Connected to this is the probability that a random polynomial has a squarefree discriminant. T
Multiplex congruence network of natural numbers
Yan, Xiao-Yong; Chen, Guan-Rong; Shi, Ding-Hua
2015-01-01
Congruence theory has many applications in physical, social, biological and technological systems. Congruence arithmetic has been a fundamental tool for data security and computer algebra etc.. However, much less attention was devoted to the topological features of congruence relations among natural numbers. Here, we explore the congruence relations in the setting of a multiplex network and unveil some unique and outstanding properties of the multiplex congruence network. Analytical results show that every layer therein is a sparse and heterogeneous subnetwork with a scale-free topology. Counterintuitively, every layer has an extremely strong controllability in spite of its scale-free structure that is usually difficult to control. Another amazing feature is that the controllability is robust against targeted attacks to critical nodes but vulnerable to random failures, which also differs from normal scale-free networks. The multi-chain structure with a small number of chain roots arising from each layer accou...
Randomness and Differentiability
Brattka, Vasco; Nies, André
2011-01-01
We characterize some major algorithmic randomness notions via differentiability of effective functions. (1) We show that a real number z in [0,1] is computably random if and only if every nondecreasing computable function [0,1]->R is differentiable at z. (2) A real number z in [0,1] is weakly 2-random if and only if every almost everywhere differentiable computable function [0,1]->R is differentiable at z. (3) Recasting results of the constructivist Demuth (1975) in classical language, we show that a real z is ML random if and only if every computable function of bounded variation is differentiable at z, and similarly for absolutely continuous functions. We also use the analytic methods to show that computable randomness of a real is base invariant, and to derive preservation results for randomness notions.
Random matrix approach to the distribution of genomic distance.
Alexeev, Nikita; Zograf, Peter
2014-08-01
The cycle graph introduced by Bafna and Pevzner is an important tool for evaluating the distance between two genomes, that is, the minimal number of rearrangements needed to transform one genome into another. We interpret this distance in topological terms and relate it to the random matrix theory. Namely, the number of genomes at a given 2-break distance from a fixed one (the Hultman number) is represented by a coefficient in the genus expansion of a matrix integral over the space of complex matrices with the Gaussian measure. We study generating functions for the Hultman numbers and prove that the two-break distance distribution is asymptotically normal.
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...
Normal Pressure Hydrocephalus (NPH)
... your local chapter Join our online community Normal Pressure Hydrocephalus (NPH) Normal pressure hydrocephalus is a brain ... About Symptoms Diagnosis Causes & risks Treatments About Normal Pressure Hydrocephalus Normal pressure hydrocephalus occurs when excess cerebrospinal ...
2010-01-01
We consider the problem of reinforcement learning in high-dimensional spaces when the number of features is bigger than the number of samples. In particular, we study the least-squares temporal difference (LSTD) learning algorithm when a space of low dimension is generated with a random projection from a high-dimensional space. We provide a thorough theoretical analysis of the LSTD with random projections and derive performance bounds for the resulting algorithm. We also show how the error of...
Institute of Scientific and Technical Information of China (English)
Jim Nuovo; Joy Melnikow; Denise Chang
2003-01-01
背景：为改进随机对照试验(randomized controlled trials，RCTs)的报道质量正在进行的努力包括试验报道的强化标准(consolidated standards of reporting trials，CONSORT)声明。作者分析了入选RCTs文中明确报道所需治疗例数(number needed to treat，NNT)和绝对危险性降低(absolute risk reduction，ARR)的频率。方法：5种最常引用的杂志用于本分析，即：内科学年鉴(Ann Intern Med)、英国医学杂志(BMJ)、美国医学会杂志(JAMA)、柳叶刀(Lancet)和新英格兰医学杂志(N Engl J Med)。每种杂志均选择1989、1992、1995和1998年4个年度进行分析。以人工方法审阅了各年度每种杂志的所有各期。采用随机对照试验评价某种治疗药物并具有显著治疗效果者作为入选文章。从每篇入选文章收集以下内容：研究的疾病、治疗或预防的事件、干预措施、研究结果和报道方法(相对危险性降低[RRR]、NNT和ARR)。结果：359篇入选文章中，8篇报道了NNT，其中6篇出自1998年。18篇报道了绝对危险性减低，其中10篇出自1998年。结论：尽管推荐使用CONSORT，但很少作者用NNT或ARR这些术语表述其研究结果。今后在报道随机对照试验时应重视这些指标的使用。
The Complement of Normal Fuzzy Numbers: An Exposition
Directory of Open Access Journals (Sweden)
Mamoni Dhar
2013-07-01
Full Text Available In this article, our main intention is to revisit the existing definition of complementation of fuzzy sets and thereafter various theories associated with it are also commented on. The main contribution of this paper is to suggest a new definition of complementation of fuzzy sets on the basis of reference function. Some other results have also been introduced whenever possible by using this new definition of complementation.
The Complement of Normal Fuzzy Numbers: An Exposition
Mamoni Dhar; Baruah, Hemanta K
2013-01-01
In this article, our main intention is to revisit the existing definition of complementation of fuzzy sets and thereafter various theories associated with it are also commented on. The main contribution of this paper is to suggest a new definition of complementation of fuzzy sets on the basis of reference function. Some other results have also been introduced whenever possible by using this new definition of complementation.
Institute of Scientific and Technical Information of China (English)
GUO TieXin; CHEN XinXiang
2009-01-01
The purpose of this paper is to provide a random duality theory for the further development of the theory of random conjugate spaces for random normed modules.First,the complicated stratification structure of a module over the algebra L(μ,K) frequently makes our investigations into random duality theory considerably different from the corresponding ones into classical duality theory,thus in this paper we have to first begin in overcoming several substantial obstacles to the study of stratification structure on random locally convex modules.Then,we give the representation theorem of weakly continuous canonical module homomorphisms,the theorem of existence of random Mackey structure,and the random bipolar theorem with respect to a regular random duality pair together with some important random compatible invariants.
Institute of Scientific and Technical Information of China (English)
无
2009-01-01
The purpose of this paper is to provide a random duality theory for the further development of the theory of random conjugate spaces for random normed modules. First, the complicated stratification structure of a module over the algebra L(μ, K) frequently makes our investigations into random duality theory considerably difierent from the corresponding ones into classical duality theory, thus in this paper we have to first begin in overcoming several substantial obstacles to the study of stratification structure on random locally convex modules. Then, we give the representation theorem of weakly continuous canonical module homomorphisms, the theorem of existence of random Mackey structure, and the random bipolar theorem with respect to a regular random duality pair together with some important random compatible invariants.
Randomness Testing of Compressed Data
Chang, Weiling; Yun, Xiaochun; Wang, Shupeng; Yu, Xiangzhan
2010-01-01
Random Number Generators play a critical role in a number of important applications. In practice, statistical testing is employed to gather evidence that a generator indeed produces numbers that appear to be random. In this paper, we reports on the studies that were conducted on the compressed data using 8 compression algorithms or compressors. The test results suggest that the output of compression algorithms or compressors has bad randomness, the compression algorithms or compressors are not suitable as random number generator. We also found that, for the same compression algorithm, there exists positive correlation relationship between compression ratio and randomness, increasing the compression ratio increases randomness of compressed data. As time permits, additional randomness testing efforts will be conducted.
Normalization: A Preprocessing Stage
Patro, S. Gopal Krishna; Sahu, Kishore Kumar
2015-01-01
As we know that the normalization is a pre-processing stage of any type problem statement. Especially normalization takes important role in the field of soft computing, cloud computing etc. for manipulation of data like scale down or scale up the range of data before it becomes used for further stage. There are so many normalization techniques are there namely Min-Max normalization, Z-score normalization and Decimal scaling normalization. So by referring these normalization techniques we are ...
Institute of Scientific and Technical Information of China (English)
陈田翼; 周星延; 阎启昌; 李洪阳
2016-01-01
Objective To investigate the correlation between accuracy of dynamic stereopsis perception and the speed of stereo-image in x-axis with dynamic random dot stereograms (DRDS).Methods In a before-after Trials,30 patient (13 males,17 females,averaged 25.53±1.80 years old)with normal binocular vision visited Ophthalmology Department of China Medical University were randomly recruited.The image discrimination thresholds of Dynamic random dot stereograms (DRDS) were assessed at 60,90,120,150 degrees per second (DPS).To analyze the results with linear regression,x2 test,nonparametric Man-Whitney-U inspection,P ≤0.05 was considered to be statistically significant.Results Calculated average stereoaccuracy of each group,In the linear regression analysis,speed and stereopsis ability were negatively correlated (R =0.982).The number of each stereoaccuracy level in different speed with nonparametric was analyzed by Man-Whitney-U inspection,differences between adjacent groups had statistical significance (P ＜0.05).Comparison static image with 90,120,150DPS using x2 test,the results showed that the 60 arc passing rate of static group and 90,120,90 DPS dynamic groups had statistically significant differences (P ＜0.05),and with 60 DPS group,the difference was not significant.Conclusions At DRDS test in normal eyes,stereoaccuracy is lower than the normal average in static image when image moving at the rates that greater than 90DPS.People can recognize the objects in horizontal moving when binocular disparity is the only signal by cyclopia vision,in addition,the stereopsis ability and velocity are negatively correlated.%目的 采用动态随机点立体视图研究正常人立体视功能与立体视标运动速度的关系.方法 自身前后对照实验.选取2014年10月至2015年2月于中国医大四院眼科门诊就诊的患者中双眼视功能正常的志愿者30人,其中男13人,女17人,年龄20～29岁,平均(25.53±1.80)岁.
Thode, Henry C
2002-01-01
Describes the selection, design, theory, and application of tests for normality. Covers robust estimation, test power, and univariate and multivariate normality. Contains tests ofr multivariate normality and coordinate-dependent and invariant approaches.
Directory of Open Access Journals (Sweden)
Anwer Khurshid
2012-07-01
Full Text Available Normal 0 false false false EN-US X-NONE X-NONE In this paper, it is shown that a complex multivariate random variable is a complex multivariate normal random variable of dimensionality if and only if all nondegenerate complex linear combinations of have a complex univariate normal distribution. The characteristic function of has been derived, and simpler forms of some theorems have been given using this characterization theorem without assuming that the variance-covariance matrix of the vector is Hermitian positive definite. Marginal distributions of have been given. In addition, a complex multivariate t-distribution has been defined and the density derived. A characterization of the complex multivariate t-distribution is given. A few possible uses of this distribution have been suggested.
Normal Functions Concerning Shared Values
Institute of Scientific and Technical Information of China (English)
WANG XIAO-JING
2009-01-01
In this paper we discuss normal functions concerning shared values. We obtain the follow result. Let F be a family of meromorphic functions in the unit disc △, and a be a nonzero finite complex number. If for any f ∈ F, the zeros of f are of multiplicity, f and f' share a, then there exists a positive number M such that for any f ∈ F, (1 -|z|~2)(|f'(z)|)/(1+|f(z)|~2)≤ M.
Fractional random walk lattice dynamics
Michelitsch, Thomas; Riascos, Alejandro Perez; Nowakowski, Andrzeij; Nicolleau, Franck
2016-01-01
We analyze time-discrete and continuous `fractional' random walks on undirected regular networks with special focus on cubic periodic lattices in $n=1,2,3,..$ dimensions.The fractional random walk dynamics is governed by a master equation involving {\\it fractional powers of Laplacian matrices $L^{\\frac{\\alpha}{2}}$}where $\\alpha=2$ recovers the normal walk.First we demonstrate thatthe interval $0\\textless{}\\alpha\\leq 2$ is admissible for the fractional random walk. We derive analytical expressions for fractional transition matrix and closely related the average return probabilities. We further obtain thefundamental matrix $Z^{(\\alpha)}$, and the mean relaxation time (Kemeny constant) for the fractional random walk.The representation for the fundamental matrix $Z^{(\\alpha)}$ relates fractional random walks with normal random walks.We show that the fractional transition matrix elements exihibit for large cubic $n$-dimensional lattices a power law decay of an $n$-dimensional infinite spaceRiesz fractional deriva...
Construction of \\mu-normal sequences
Madritsch, Manfred G.; Mance, Bill
2012-01-01
In the present paper we extend Champernowne's construction of normal numbers to provide sequences which are generic for a given invariant probability measure, which need not be the maximal one. We present a construction together with estimates and examples for normal numbers with respect to L\\"uroth series expansion, continued fractions expansion or $\\beta$-expansion.
Differential Inequalities, Normality and Quasi-Normality
Liu, Xiaojun; Pang, Xuecheng
2011-01-01
We prove that if D is a domain in C, alpha>1 and c>0, then the family F of functions meromorphic in D such that |f'(z)|/(1+|f(z)|^alpha)>c for every z in D is normalin D. For alpha=1, the same assumptions imply quasi-normality but not necessarily normality.
Grimshaw, Jeremy M; Presseau, Justin; Tetroe, Jacqueline; Eccles, Martin P; Francis, Jill J; Godin, Gaston; Graham, Ian D; Hux, Janet E; Johnston, Marie; Légaré, France; Lemyre, Louise; Robinson, Nicole; Zwarenstein, Merrick
2014-08-06
Theory-based process evaluations conducted alongside randomized controlled trials provide the opportunity to investigate hypothesized mechanisms of action of interventions, helping to build a cumulative knowledge base and to inform the interpretation of individual trial outcomes. Our objective was to identify the underlying causal mechanisms in a cluster randomized trial of the effectiveness of printed educational materials (PEMs) to increase referral for diabetic retinopathy screening. We hypothesized that the PEMs would increase physicians' intention to refer patients for retinal screening by strengthening their attitude and subjective norm, but not their perceived behavioral control. Design: A theory based process evaluation alongside the Ontario Printed Educational Material (OPEM) cluster randomized trial. Postal surveys based on the Theory of Planned Behavior were sent to a random sample of trial participants two months before and six months after they received the intervention. Setting: Family physicians in Ontario, Canada. Participants: 1,512 family physicians (252 per intervention group) from the OPEM trial were invited to participate, and 31.3% (473/1512) responded at time one and time two. The final sample comprised 437 family physicians fully completing questionnaires at both time points. Main Outcome Measures: Primary: behavioral intention related to referring patient for retinopathy screening; secondary: attitude, subjective norm, perceived behavioral control. At baseline, family physicians reported positive intention, attitude, subjective norm, and perceived behavioral control to advise patients about retinopathy screening suggesting limited opportunities for improvement in these constructs. There were no significant differences on intention, attitude, subjective norm, and perceived behavioral control following the intervention. Respondents also reported additional physician- and patient-related factors perceived to influence whether patients received
Jung, P.; Talkner, P.
2010-09-01
A simple way to convert a purely random sequence of events into a signal with a strong periodic component is proposed. The signal consists of those instants of time at which the length of the random sequence exceeds an integer multiple of a given number. The larger this number the more pronounced the periodic behavior becomes.
Complete Normal Ordering 1: Foundations
Ellis, John; Skliros, Dimitri P.
2016-01-01
We introduce a new prescription for quantising scalar field theories perturbatively around a true minimum of the full quantum effective action, which is to `complete normal order' the bare action of interest. When the true vacuum of the theory is located at zero field value, the key property of this prescription is the automatic cancellation, to any finite order in perturbation theory, of all tadpole and, more generally, all `cephalopod' Feynman diagrams. The latter are connected diagrams that can be disconnected into two pieces by cutting one internal vertex, with either one or both pieces free from external lines. In addition, this procedure of `complete normal ordering' (which is an extension of the standard field theory definition of normal ordering) reduces by a substantial factor the number of Feynman diagrams to be calculated at any given loop order. We illustrate explicitly the complete normal ordering procedure and the cancellation of cephalopod diagrams in scalar field theories with non-derivative i...
A Central Limit Theorem for the Volumes of High Excursions of Stationary Associated Random Fields
Directory of Open Access Journals (Sweden)
Vadim Demichev
2015-05-01
Full Text Available We prove that under certain conditions the excursion sets volumes of stationary positively associated random fields converge after rescaling to the normal distribution as the excursion level and the size of the observation window grow. In addition, we provide a number of examples.
Shiffman, Bernard
2010-01-01
We introduce several notions of `random fewnomials', i.e. random polynomials with a fixed number f of monomials of degree N. The f exponents are chosen at random and then the coefficients are chosen to be Gaussian random, mainly from the SU(m + 1) ensemble. The results give limiting formulas as N goes to infinity for the expected distribution of complex zeros of a system of k random fewnomials in m variables. When k = m, for SU(m + 1) polynomials, the limit is the Monge-Ampere measure of a toric Kaehler potential on CP^m obtained by averaging a `discrete Legendre transform' of the Fubini-Study symplectic potential at f points of the unit simplex in R^m.
Randomness: quantum versus classical
Khrennikov, Andrei
2015-01-01
Recent tremendous development of quantum information theory led to a number of quantum technological projects, e.g., quantum random generators. This development stimulates a new wave of interest in quantum foundations. One of the most intriguing problems of quantum foundations is elaboration of a consistent and commonly accepted interpretation of quantum state. Closely related problem is clarification of the notion of quantum randomness and its interrelation with classical randomness. In this short review we shall discuss basics of classical theory of randomness (which by itself is very complex and characterized by diversity of approaches) and compare it with irreducible quantum randomness. The second part of this review is devoted to the information interpretation of quantum mechanics (QM) in the spirit of Zeilinger and Brukner (and QBism of Fuchs et al.) and physics in general (e.g., Wheeler's "it from bit") as well as digital philosophy of Chaitin (with historical coupling to ideas of Leibnitz). Finally, w...
Randomness: Quantum versus classical
Khrennikov, Andrei
2016-05-01
Recent tremendous development of quantum information theory has led to a number of quantum technological projects, e.g. quantum random generators. This development had stimulated a new wave of interest in quantum foundations. One of the most intriguing problems of quantum foundations is the elaboration of a consistent and commonly accepted interpretation of a quantum state. Closely related problem is the clarification of the notion of quantum randomness and its interrelation with classical randomness. In this short review, we shall discuss basics of classical theory of randomness (which by itself is very complex and characterized by diversity of approaches) and compare it with irreducible quantum randomness. We also discuss briefly “digital philosophy”, its role in physics (classical and quantum) and its coupling to the information interpretation of quantum mechanics (QM).
Normal probability plots with confidence.
Chantarangsi, Wanpen; Liu, Wei; Bretz, Frank; Kiatsupaibul, Seksan; Hayter, Anthony J; Wan, Fang
2015-01-01
Normal probability plots are widely used as a statistical tool for assessing whether an observed simple random sample is drawn from a normally distributed population. The users, however, have to judge subjectively, if no objective rule is provided, whether the plotted points fall close to a straight line. In this paper, we focus on how a normal probability plot can be augmented by intervals for all the points so that, if the population distribution is normal, then all the points should fall into the corresponding intervals simultaneously with probability 1-α. These simultaneous 1-α probability intervals provide therefore an objective mean to judge whether the plotted points fall close to the straight line: the plotted points fall close to the straight line if and only if all the points fall into the corresponding intervals. The powers of several normal probability plot based (graphical) tests and the most popular nongraphical Anderson-Darling and Shapiro-Wilk tests are compared by simulation. Based on this comparison, recommendations are given in Section 3 on which graphical tests should be used in what circumstances. An example is provided to illustrate the methods.