Unbiased All-Optical Random-Number Generator

Science.gov (United States)

Steinle, Tobias; Greiner, Johannes N.; Wrachtrup, Jörg; Giessen, Harald; Gerhardt, Ilja

2017-10-01

The generation of random bits is of enormous importance in modern information science. Cryptographic security is based on random numbers which require a physical process for their generation. This is commonly performed by hardware random-number generators. These often exhibit a number of problems, namely experimental bias, memory in the system, and other technical subtleties, which reduce the reliability in the entropy estimation. Further, the generated outcome has to be postprocessed to "iron out" such spurious effects. Here, we present a purely optical randomness generator, based on the bistable output of an optical parametric oscillator. Detector noise plays no role and postprocessing is reduced to a minimum. Upon entering the bistable regime, initially the resulting output phase depends on vacuum fluctuations. Later, the phase is rigidly locked and can be well determined versus a pulse train, which is derived from the pump laser. This delivers an ambiguity-free output, which is reliably detected and associated with a binary outcome. The resulting random bit stream resembles a perfect coin toss and passes all relevant randomness measures. The random nature of the generated binary outcome is furthermore confirmed by an analysis of resulting conditional entropies.

The MIXMAX random number generator

Science.gov (United States)

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.

CNV-RF Is a Random Forest-Based Copy Number Variation Detection Method Using Next-Generation Sequencing.

Science.gov (United States)

Onsongo, Getiria; Baughn, Linda B; Bower, Matthew; Henzler, Christine; Schomaker, Matthew; Silverstein, Kevin A T; Thyagarajan, Bharat

2016-11-01

Simultaneous detection of small copy number variations (CNVs) (<0.5 kb) and single-nucleotide variants in clinically significant genes is of great interest for clinical laboratories. The analytical variability in next-generation sequencing (NGS) and artifacts in coverage data because of issues with mappability along with lack of robust bioinformatics tools for CNV detection have limited the utility of targeted NGS data to identify CNVs. We describe the development and implementation of a bioinformatics algorithm, copy number variation-random forest (CNV-RF), that incorporates a machine learning component to identify CNVs from targeted NGS data. Using CNV-RF, we identified 12 of 13 deletions in samples with known CNVs, two cases with duplications, and identified novel deletions in 22 additional cases. Furthermore, no CNVs were identified among 60 genes in 14 cases with normal copy number and no CNVs were identified in another 104 patients with clinical suspicion of CNVs. All positive deletions and duplications were confirmed using a quantitative PCR method. CNV-RF also detected heterozygous deletions and duplications with a specificity of 50% across 4813 genes. The ability of CNV-RF to detect clinically relevant CNVs with a high degree of sensitivity along with confirmation using a low-cost quantitative PCR method provides a framework for providing comprehensive NGS-based CNV/single-nucleotide variant detection in a clinical molecular diagnostics laboratory. Copyright © 2016 American Society for Investigative Pathology and the Association for Molecular Pathology. Published by Elsevier Inc. All rights reserved.

Source-Independent Quantum Random Number Generation

Science.gov (United States)

Cao, Zhu; Zhou, Hongyi; Yuan, Xiao; Ma, Xiongfeng

2016-01-01

Quantum random number generators can provide genuine randomness by appealing to the fundamental principles of quantum mechanics. In general, a physical generator contains two parts—a randomness source and its readout. The source is essential to the quality of the resulting random numbers; hence, it needs to be carefully calibrated and modeled to achieve information-theoretical provable randomness. However, in practice, the source is a complicated physical system, such as a light source or an atomic ensemble, and any deviations in the real-life implementation from the theoretical model may affect the randomness of the output. To close this gap, we propose a source-independent scheme for quantum random number generation in which output randomness can be certified, even when the source is uncharacterized and untrusted. In our randomness analysis, we make no assumptions about the dimension of the source. For instance, multiphoton emissions are allowed in optical implementations. Our analysis takes into account the finite-key effect with the composable security definition. In the limit of large data size, the length of the input random seed is exponentially small compared to that of the output random bit. In addition, by modifying a quantum key distribution system, we experimentally demonstrate our scheme and achieve a randomness generation rate of over 5 ×103 bit /s .

Source-Independent Quantum Random Number Generation

Directory of Open Access Journals (Sweden)

Zhu Cao

2016-02-01

Full Text Available Quantum random number generators can provide genuine randomness by appealing to the fundamental principles of quantum mechanics. In general, a physical generator contains two parts—a randomness source and its readout. The source is essential to the quality of the resulting random numbers; hence, it needs to be carefully calibrated and modeled to achieve information-theoretical provable randomness. However, in practice, the source is a complicated physical system, such as a light source or an atomic ensemble, and any deviations in the real-life implementation from the theoretical model may affect the randomness of the output. To close this gap, we propose a source-independent scheme for quantum random number generation in which output randomness can be certified, even when the source is uncharacterized and untrusted. In our randomness analysis, we make no assumptions about the dimension of the source. For instance, multiphoton emissions are allowed in optical implementations. Our analysis takes into account the finite-key effect with the composable security definition. In the limit of large data size, the length of the input random seed is exponentially small compared to that of the output random bit. In addition, by modifying a quantum key distribution system, we experimentally demonstrate our scheme and achieve a randomness generation rate of over 5×10^{3}  bit/s.

Quality pseudo-random number generator

International Nuclear Information System (INIS)

Tarasiuk, J.

1996-01-01

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

Analysis of android random number generator

OpenAIRE

Sarıtaş, Serkan

2013-01-01

Ankara : The Department of Computer Engineering and the Graduate School of Engineering and Science of Bilkent University, 2013. Thesis (Master's) -- Bilkent University, 2013. Includes bibliographical references leaves 61-65. Randomness is a crucial resource for cryptography, and random number generators are critical building blocks of almost all cryptographic systems. Therefore, random number generation is one of the key parts of secure communication. Random number generatio...

Object grammars and random generation

Directory of Open Access Journals (Sweden)

I. Dutour

1998-12-01

Full Text Available This paper presents a new systematic approach for the uniform random generation of combinatorial objects. The method is based on the notion of object grammars which give recursive descriptions of objects and generalize context-freegrammars. The application of particular valuations to these grammars leads to enumeration and random generation of objects according to non algebraic parameters.

BWIP-RANDOM-SAMPLING, Random Sample Generation for Nuclear Waste Disposal

International Nuclear Information System (INIS)

Sagar, B.

1989-01-01

1 - Description of program or function: Random samples for different distribution types are generated. Distribution types as required for performance assessment modeling of geologic nuclear waste disposal are provided. These are: - Uniform, - Log-uniform (base 10 or natural), - Normal, - Lognormal (base 10 or natural), - Exponential, - Bernoulli, - User defined continuous distribution. 2 - Method of solution: A linear congruential generator is used for uniform random numbers. A set of functions is used to transform the uniform distribution to the other distributions. Stratified, rather than random, sampling can be chosen. Truncated limits can be specified on many distributions, whose usual definition has an infinite support. 3 - Restrictions on the complexity of the problem: Generation of correlated random variables is not included

A random number generator for continuous random variables

Science.gov (United States)

Guerra, V. M.; Tapia, R. A.; Thompson, J. R.

1972-01-01

A FORTRAN 4 routine is given which may be used to generate random observations of a continuous real valued random variable. Normal distribution of F(x), X, E(akimas), and E(linear) is presented in tabular form.

Uniform random number generators

Science.gov (United States)

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.

Graphical analysis of some pseudo-random number generators

OpenAIRE

Lewis, Peter A. W.

1986-01-01

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

Computer generation of random deviates

International Nuclear Information System (INIS)

Cormack, John

1991-01-01

The need for random deviates arises in many scientific applications. In medical physics, Monte Carlo simulations have been used in radiology, radiation therapy and nuclear medicine. Specific instances include the modelling of x-ray scattering processes and the addition of random noise to images or curves in order to assess the effects of various processing procedures. Reliable sources of random deviates with statistical properties indistinguishable from true random deviates are a fundamental necessity for such tasks. This paper provides a review of computer algorithms which can be used to generate uniform random deviates and other distributions of interest to medical physicists, along with a few caveats relating to various problems and pitfalls which can occur. Source code listings for the generators discussed (in FORTRAN, Turbo-PASCAL and Data General ASSEMBLER) are available on request from the authors. 27 refs., 3 tabs., 5 figs

All-optical fast random number generator.

Science.gov (United States)

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.

Generation of pseudo-random numbers

Science.gov (United States)

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

1982-01-01

Practical methods for generating acceptable random numbers from a variety of probability distributions which are frequently encountered in engineering applications are described. The speed, accuracy, and guarantee of statistical randomness of the various methods are discussed.

LPTAU, Quasi Random Sequence Generator

International Nuclear Information System (INIS)

Sobol, Ilya M.

1993-01-01

1 - Description of program or function: LPTAU generates quasi random sequences. These are uniformly distributed sets of L=M N points in the N-dimensional unit cube: I N =[0,1]x...x[0,1]. These sequences are used as nodes for multidimensional integration; as searching points in global optimization; as trial points in multi-criteria decision making; as quasi-random points for quasi Monte Carlo algorithms. 2 - Method of solution: Uses LP-TAU sequence generation (see references). 3 - Restrictions on the complexity of the problem: The number of points that can be generated is L 30 . The dimension of the space cannot exceed 51

On grey levels in random CAPTCHA generation

Science.gov (United States)

Newton, Fraser; Kouritzin, Michael A.

2011-06-01

A CAPTCHA is an automatically generated test designed to distinguish between humans and computer programs; specifically, they are designed to be easy for humans but difficult for computer programs to pass in order to prevent the abuse of resources by automated bots. They are commonly seen guarding webmail registration forms, online auction sites, and preventing brute force attacks on passwords. In the following, we address the question: How does adding a grey level to random CAPTCHA generation affect the utility of the CAPTCHA? We treat the problem of generating the random CAPTCHA as one of random field simulation: An initial state of background noise is evolved over time using Gibbs sampling and an efficient algorithm for generating correlated random variables. This approach has already been found to yield highly-readable yet difficult-to-crack CAPTCHAs. We detail how the requisite parameters for introducing grey levels are estimated and how we generate the random CAPTCHA. The resulting CAPTCHA will be evaluated in terms of human readability as well as its resistance to automated attacks in the forms of character segmentation and optical character recognition.

Generation and Analysis of Constrained Random Sampling Patterns

DEFF Research Database (Denmark)

Pierzchlewski, Jacek; Arildsen, Thomas

2016-01-01

Random sampling is a technique for signal acquisition which is gaining popularity in practical signal processing systems. Nowadays, event-driven analog-to-digital converters make random sampling feasible in practical applications. A process of random sampling is defined by a sampling pattern, which...... indicates signal sampling points in time. Practical random sampling patterns are constrained by ADC characteristics and application requirements. In this paper, we introduce statistical methods which evaluate random sampling pattern generators with emphasis on practical applications. Furthermore, we propose...... algorithm generates random sampling patterns dedicated for event-driven-ADCs better than existed sampling pattern generators. Finally, implementation issues of random sampling patterns are discussed....

Program pseudo-random number generator for microcomputers

International Nuclear Information System (INIS)

Ososkov, G.A.

1980-01-01

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

Generating equilateral random polygons in confinement III

International Nuclear Information System (INIS)

Diao, Y; Ernst, C; Montemayor, A; Ziegler, U

2012-01-01

In this paper we continue our earlier studies (Diao et al 2011 J. Phys. A: Math. Theor. 44 405202, Diao et al J. Phys. A: Math. Theor. 45 275203) on the generation methods of random equilateral polygons confined in a sphere. The first half of this paper is concerned with the generation of confined equilateral random walks. We show that if the selection of a vertex is uniform subject to the position of its previous vertex and the confining condition, then the distributions of the vertices are not uniform, although there exists a distribution such that if the initial vertex is selected following this distribution, then all vertices of the random walk follow this same distribution. Thus in order to generate a confined equilateral random walk, the selection of a vertex cannot be uniform subject to the position of its previous vertex and the confining condition. We provide a simple algorithm capable of generating confined equilateral random walks whose vertex distribution is almost uniform in the confinement sphere. In the second half of this paper we show that any process generating confined equilateral random walks can be turned into a process generating confined equilateral random polygons with the property that the vertex distribution of the polygons approaches the vertex distribution of the walks as the polygons get longer and longer. In our earlier studies, the starting point of the confined polygon is fixed at the center of the sphere. The new approach here allows us to move the starting point of the confined polygon off the center of the sphere. (paper)

Fast physical random bit generation with chaotic semiconductor lasers

Science.gov (United States)

Uchida, Atsushi; Amano, Kazuya; Inoue, Masaki; Hirano, Kunihito; Naito, Sunao; Someya, Hiroyuki; Oowada, Isao; Kurashige, Takayuki; Shiki, Masaru; Yoshimori, Shigeru; Yoshimura, Kazuyuki; Davis, Peter

2008-12-01

Random number generators in digital information systems make use of physical entropy sources such as electronic and photonic noise to add unpredictability to deterministically generated pseudo-random sequences. However, there is a large gap between the generation rates achieved with existing physical sources and the high data rates of many computation and communication systems; this is a fundamental weakness of these systems. Here we show that good quality random bit sequences can be generated at very fast bit rates using physical chaos in semiconductor lasers. Streams of bits that pass standard statistical tests for randomness have been generated at rates of up to 1.7 Gbps by sampling the fluctuating optical output of two chaotic lasers. This rate is an order of magnitude faster than that of previously reported devices for physical random bit generators with verified randomness. This means that the performance of random number generators can be greatly improved by using chaotic laser devices as physical entropy sources.

Quantifiers for randomness of chaotic pseudo-random number generators.

Science.gov (United States)

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

2009-08-28

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

RANDNA: a random DNA sequence generator.

Science.gov (United States)

Piva, Francesco; Principato, Giovanni

2006-01-01

Monte Carlo simulations are useful to verify the significance of data. Genomic regularities, such as the nucleotide correlations or the not uniform distribution of the motifs throughout genomic or mature mRNA sequences, exist and their significance can be checked by means of the Monte Carlo test. The test needs good quality random sequences in order to work, moreover they should have the same nucleotide distribution as the sequences in which the regularities have been found. Random DNA sequences are also useful to estimate the background score of an alignment, that is a threshold below which the resulting score is merely due to chance. We have developed RANDNA, a free software which allows to produce random DNA or RNA sequences setting both their length and the percentage of nucleotide composition. Sequences having the same nucleotide distribution of exonic, intronic or intergenic sequences can be generated. Its graphic interface makes it possible to easily set the parameters that characterize the sequences being produced and saved in a text format file. The pseudo-random number generator function of Borland Delphi 6 is used, since it guarantees a good randomness, a long cycle length and a high speed. We have checked the quality of sequences generated by the software, by means of well-known tests, both by themselves and versus genuine random sequences. We show the good quality of the generated sequences. The software, complete with examples and documentation, is freely available to users from: http://www.introni.it/en/software.

Generating and using truly random quantum states in Mathematica

Science.gov (United States)

Miszczak, Jarosław Adam

2012-01-01

The problem of generating random quantum states is of a great interest from the quantum information theory point of view. In this paper we present a package for Mathematica computing system harnessing a specific piece of hardware, namely Quantis quantum random number generator (QRNG), for investigating statistical properties of quantum states. The described package implements a number of functions for generating random states, which use Quantis QRNG as a source of randomness. It also provides procedures which can be used in simulations not related directly to quantum information processing. Program summaryProgram title: TRQS Catalogue identifier: AEKA_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEKA_v1_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.: 7924 No. of bytes in distributed program, including test data, etc.: 88 651 Distribution format: tar.gz Programming language: Mathematica, C Computer: Requires a Quantis quantum random number generator (QRNG, http://www.idquantique.com/true-random-number-generator/products-overview.html) and supporting a recent version of Mathematica Operating system: Any platform supporting Mathematica; tested with GNU/Linux (32 and 64 bit) RAM: Case dependent Classification: 4.15 Nature of problem: Generation of random density matrices. Solution method: Use of a physical quantum random number generator. Running time: Generating 100 random numbers takes about 1 second, generating 1000 random density matrices takes more than a minute.

New Trends in Pseudo-Random Number Generation

Science.gov (United States)

Gutbrod, F.

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

Evidence of significant bias in an elementary random number generator

International Nuclear Information System (INIS)

Borgwaldt, H.; Brandl, V.

1981-03-01

An elementary pseudo random number generator for isotropically distributed unit vectors in 3-dimensional space has ben tested for bias. This generator uses the IBM-suplied routine RANDU and a transparent rejection technique. The tests show clearly that non-randomness in the pseudo random numbers generated by the primary IBM generator leads to bias in the order of 1 percent in estimates obtained from the secondary random number generator. FORTRAN listings of 4 variants of the random number generator called by a simple test programme and output listings are included for direct reference. (orig.) [de

Generating equilateral random polygons in confinement II

International Nuclear Information System (INIS)

Diao, Y; Ernst, C; Montemayor, A; Ziegler, U

2012-01-01

In this paper we continue an earlier study (Diao et al 2011 J. Phys. A: Math. Theor. 44 405202) on the generation algorithms of random equilateral polygons confined in a sphere. Here, the equilateral random polygons are rooted at the center of the confining sphere and the confining sphere behaves like an absorbing boundary. One way to generate such a random polygon is the accept/reject method in which an unconditioned equilateral random polygon rooted at origin is generated. The polygon is accepted if it is within the confining sphere, otherwise it is rejected and the process is repeated. The algorithm proposed in this paper offers an alternative to the accept/reject method, yielding a faster generation process when the confining sphere is small. In order to use this algorithm effectively, a large, reusable data set needs to be pre-computed only once. We derive the theoretical distribution of the given random polygon model and demonstrate, with strong numerical evidence, that our implementation of the algorithm follows this distribution. A run time analysis and a numerical error estimate are given at the end of the paper. (paper)

Quantum random number generation for loophole-free Bell tests

Science.gov (United States)

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.

Generating random numbers by means of nonlinear dynamic systems

Science.gov (United States)

Zang, Jiaqi; Hu, Haojie; Zhong, Juhua; Luo, Duanbin; Fang, Yi

2018-07-01

To introduce the randomness of a physical process to students, a chaotic pendulum experiment was opened in East China University of Science and Technology (ECUST) on the undergraduate level in the physics department. It was shown chaotic motion could be initiated through adjusting the operation of a chaotic pendulum. By using the data of the angular displacements of chaotic motion, random binary numerical arrays can be generated. To check the randomness of generated numerical arrays, the NIST Special Publication 800-20 method was adopted. As a result, it was found that all the random arrays which were generated by the chaotic motion could pass the validity criteria and some of them were even better than the quality of pseudo-random numbers generated by a computer. Through the experiments, it is demonstrated that chaotic pendulum can be used as an efficient mechanical facility in generating random numbers, and can be applied in teaching random motion to the students.

The intermittency of vector fields and random-number generators

Science.gov (United States)

Kalinin, A. O.; Sokoloff, D. D.; Tutubalin, V. N.

2017-09-01

We examine how well natural random-number generators can reproduce the intermittency phenomena that arise in the transfer of vector fields in random media. A generator based on the analysis of financial indices is suggested as the most promising random-number generator. Is it shown that even this generator, however, fails to reproduce the phenomenon long enough to confidently detect intermittency, while the C++ generator successfully solves this problem. We discuss the prospects of using shell models of turbulence as the desired generator.

Pseudo-Random Number Generator Based on Coupled Map Lattices

Science.gov (United States)

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

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

Generating random walks and polygons with stiffness in confinement

International Nuclear Information System (INIS)

Diao, Y; Ernst, C; Saarinen, S; Ziegler, U

2015-01-01

The purpose of this paper is to explore ways to generate random walks and polygons in confinement with a bias toward stiffness. Here the stiffness refers to the curvature angle between two consecutive edges along the random walk or polygon. The stiffer the walk (polygon), the smaller this angle on average. Thus random walks and polygons with an elevated stiffness have lower than expected curvatures. The authors introduced and studied several generation algorithms with a stiffness parameter s>0 that regulates the expected curvature angle at a given vertex in which the random walks and polygons are generated one edge at a time using conditional probability density functions. Our generating algorithms also allow the generation of unconfined random walks and polygons with any desired mean curvature angle. In the case of random walks and polygons confined in a sphere of fixed radius, we observe that, as expected, stiff random walks or polygons are more likely to be close to the confinement boundary. The methods developed here require that the random walks and random polygons be rooted at the center of the confinement sphere. (paper)

Testing, Selection, and Implementation of Random Number Generators

National Research Council Canada - National Science Library

Collins, Joseph C

2008-01-01

An exhaustive evaluation of state-of-the-art random number generators with several well-known suites of tests provides the basis for selection of suitable random number generators for use in stochastic simulations...

Pseudo-random number generator based on asymptotic deterministic randomness

Science.gov (United States)

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

2008-06-01

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

Pseudo-random number generator based on asymptotic deterministic randomness

International Nuclear Information System (INIS)

Wang Kai; Pei Wenjiang; Xia Haishan; Cheung Yiuming

2008-01-01

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

Towards a high-speed quantum random number generator

Science.gov (United States)

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.

Random phenotypic variation of yeast (Saccharomyces cerevisiae) single-gene knockouts fits a double pareto-lognormal distribution.

Science.gov (United States)

Graham, John H; Robb, Daniel T; Poe, Amy R

2012-01-01

Distributed robustness is thought to influence the buffering of random phenotypic variation through the scale-free topology of gene regulatory, metabolic, and protein-protein interaction networks. If this hypothesis is true, then the phenotypic response to the perturbation of particular nodes in such a network should be proportional to the number of links those nodes make with neighboring nodes. This suggests a probability distribution approximating an inverse power-law of random phenotypic variation. Zero phenotypic variation, however, is impossible, because random molecular and cellular processes are essential to normal development. Consequently, a more realistic distribution should have a y-intercept close to zero in the lower tail, a mode greater than zero, and a long (fat) upper tail. The double Pareto-lognormal (DPLN) distribution is an ideal candidate distribution. It consists of a mixture of a lognormal body and upper and lower power-law tails. If our assumptions are true, the DPLN distribution should provide a better fit to random phenotypic variation in a large series of single-gene knockout lines than other skewed or symmetrical distributions. We fit a large published data set of single-gene knockout lines in Saccharomyces cerevisiae to seven different probability distributions: DPLN, right Pareto-lognormal (RPLN), left Pareto-lognormal (LPLN), normal, lognormal, exponential, and Pareto. The best model was judged by the Akaike Information Criterion (AIC). Phenotypic variation among gene knockouts in S. cerevisiae fits a double Pareto-lognormal (DPLN) distribution better than any of the alternative distributions, including the right Pareto-lognormal and lognormal distributions. A DPLN distribution is consistent with the hypothesis that developmental stability is mediated, in part, by distributed robustness, the resilience of gene regulatory, metabolic, and protein-protein interaction networks. Alternatively, multiplicative cell growth, and the mixing of

Chaos-based Pseudo-random Number Generation

KAUST Repository

Barakat, Mohamed L.

2014-04-10

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

Chaos-based Pseudo-random Number Generation

KAUST Repository

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

2014-01-01

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

A Method of Erasing Data Using Random Number Generators

OpenAIRE

井上,正人

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.

DNA-based random number generation in security circuitry.

Science.gov (United States)

Gearheart, Christy M; Arazi, Benjamin; Rouchka, Eric C

2010-06-01

DNA-based circuit design is an area of research in which traditional silicon-based technologies are replaced by naturally occurring phenomena taken from biochemistry and molecular biology. This research focuses on further developing DNA-based methodologies to mimic digital data manipulation. While exhibiting fundamental principles, this work was done in conjunction with the vision that DNA-based circuitry, when the technology matures, will form the basis for a tamper-proof security module, revolutionizing the meaning and concept of tamper-proofing and possibly preventing it altogether based on accurate scientific observations. A paramount part of such a solution would be self-generation of random numbers. A novel prototype schema employs solid phase synthesis of oligonucleotides for random construction of DNA sequences; temporary storage and retrieval is achieved through plasmid vectors. A discussion of how to evaluate sequence randomness is included, as well as how these techniques are applied to a simulation of the random number generation circuitry. Simulation results show generated sequences successfully pass three selected NIST random number generation tests specified for security applications.

A hybrid-type quantum random number generator

Science.gov (United States)

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

Microcomputer-Assisted Discoveries: Generate Your Own Random Numbers.

Science.gov (United States)

Kimberling, Clark

1984-01-01

Having students try to generate their own random numbers can lead to much discovery learning as one tries to create 'patternlessness' from formulas. Developing an equidistribution test and runs test, plus other ideas for generating random numbers, is discussed, with computer programs given. (MNS)

Solution-Processed Carbon Nanotube True Random Number Generator.

Science.gov (United States)

Gaviria Rojas, William A; McMorrow, Julian J; Geier, Michael L; Tang, Qianying; Kim, Chris H; Marks, Tobin J; Hersam, Mark C

2017-08-09

With the growing adoption of interconnected electronic devices in consumer and industrial applications, there is an increasing demand for robust security protocols when transmitting and receiving sensitive data. Toward this end, hardware true random number generators (TRNGs), commonly used to create encryption keys, offer significant advantages over software pseudorandom number generators. However, the vast network of devices and sensors envisioned for the "Internet of Things" will require small, low-cost, and mechanically flexible TRNGs with low computational complexity. These rigorous constraints position solution-processed semiconducting single-walled carbon nanotubes (SWCNTs) as leading candidates for next-generation security devices. Here, we demonstrate the first TRNG using static random access memory (SRAM) cells based on solution-processed SWCNTs that digitize thermal noise to generate random bits. This bit generation strategy can be readily implemented in hardware with minimal transistor and computational overhead, resulting in an output stream that passes standardized statistical tests for randomness. By using solution-processed semiconducting SWCNTs in a low-power, complementary architecture to achieve TRNG, we demonstrate a promising approach for improving the security of printable and flexible electronics.

Pseudo-Random Number Generators

Science.gov (United States)

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

1984-01-01

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

Microcomputer Unit: Generating Random Numbers.

Science.gov (United States)

Haigh, William E.

1986-01-01

Presents an activity, suitable for students in grades 6-12, on generating random numbers. Objectives, equipment needed, list of prerequisite experiences, instructional strategies, and ready-to-copy student worksheets are included. (JN)

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

Science.gov (United States)

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

2013-11-01

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

Experimental nonlocality-based randomness generation with nonprojective measurements

Science.gov (United States)

Gómez, S.; Mattar, A.; Gómez, E. S.; Cavalcanti, D.; Farías, O. Jiménez; Acín, A.; Lima, G.

2018-04-01

We report on an optical setup generating more than one bit of randomness from one entangled bit (i.e., a maximally entangled state of two qubits). The amount of randomness is certified through the observation of Bell nonlocal correlations. To attain this result we implemented a high-purity entanglement source and a nonprojective three-outcome measurement. Our implementation achieves a gain of 27% of randomness as compared with the standard methods using projective measurements. Additionally, we estimate the amount of randomness certified in a one-sided device-independent scenario, through the observation of Einstein-Podolsky-Rosen steering. Our results prove that nonprojective quantum measurements allow extending the limits for nonlocality-based certified randomness generation using current technology.

Analysis of random number generators in abnormal usage conditions

International Nuclear Information System (INIS)

Soucarros, M.

2012-01-01

Random numbers have been used through the ages for games of chance, more recently for secret codes and today they are necessary to the execution of computer programs. Random number generators have now evolved from simple dices to electronic circuits and algorithms. Accordingly, the ability to distinguish between random and non-random numbers has become more difficult. Furthermore, whereas in the past dices were loaded in order to increase winning chances, it is now possible to influence the outcome of random number generators. In consequence, this subject is still very much an issue and has recently made the headlines. Indeed, there was talks about the PS3 game console which generates constant random numbers and redundant distribution of secret keys on the internet. This thesis presents a study of several generators as well as different means to perturb them. It shows the inherent defects of their conceptions and possible consequences of their failure when they are embedded inside security components. Moreover, this work highlights problems yet to be solved concerning the testing of random numbers and the post-processing eliminating bias in these numbers distribution. (author) [fr

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

Science.gov (United States)

Bhattacharjee, Kamalika; Paul, Dipanjyoti; Das, Sukanta

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

Physical Principle for Generation of Randomness

Science.gov (United States)

Zak, Michail

2009-01-01

A physical principle (more precisely, a principle that incorporates mathematical models used in physics) has been conceived as the basis of a method of generating randomness in Monte Carlo simulations. The principle eliminates the need for conventional random-number generators. The Monte Carlo simulation method is among the most powerful computational methods for solving high-dimensional problems in physics, chemistry, economics, and information processing. The Monte Carlo simulation method is especially effective for solving problems in which computational complexity increases exponentially with dimensionality. The main advantage of the Monte Carlo simulation method over other methods is that the demand on computational resources becomes independent of dimensionality. As augmented by the present principle, the Monte Carlo simulation method becomes an even more powerful computational method that is especially useful for solving problems associated with dynamics of fluids, planning, scheduling, and combinatorial optimization. The present principle is based on coupling of dynamical equations with the corresponding Liouville equation. The randomness is generated by non-Lipschitz instability of dynamics triggered and controlled by feedback from the Liouville equation. (In non-Lipschitz dynamics, the derivatives of solutions of the dynamical equations are not required to be bounded.)

Statistical metrology - measurement and modeling of variation for advanced process development and design rule generation

International Nuclear Information System (INIS)

Boning, Duane S.; Chung, James E.

1998-01-01

Advanced process technology will require more detailed understanding and tighter control of variation in devices and interconnects. The purpose of statistical metrology is to provide methods to measure and characterize variation, to model systematic and random components of that variation, and to understand the impact of variation on both yield and performance of advanced circuits. Of particular concern are spatial or pattern-dependencies within individual chips; such systematic variation within the chip can have a much larger impact on performance than wafer-level random variation. Statistical metrology methods will play an important role in the creation of design rules for advanced technologies. For example, a key issue in multilayer interconnect is the uniformity of interlevel dielectric (ILD) thickness within the chip. For the case of ILD thickness, we describe phases of statistical metrology development and application to understanding and modeling thickness variation arising from chemical-mechanical polishing (CMP). These phases include screening experiments including design of test structures and test masks to gather electrical or optical data, techniques for statistical decomposition and analysis of the data, and approaches to calibrating empirical and physical variation models. These models can be integrated with circuit CAD tools to evaluate different process integration or design rule strategies. One focus for the generation of interconnect design rules are guidelines for the use of 'dummy fill' or 'metal fill' to improve the uniformity of underlying metal density and thus improve the uniformity of oxide thickness within the die. Trade-offs that can be evaluated via statistical metrology include the improvements to uniformity possible versus the effect of increased capacitance due to additional metal

Search for a perfect generator of random numbers

International Nuclear Information System (INIS)

Musyck, E.

1977-01-01

Theoretical tests have been carried out by COVEYOU and MAC PHERSON to verify the applications of the LEHMER algorithm. In a similar way, a theoretical method is proposed to evaluate in a rigorous way the random character of numbers generated by a shift register. This theory introduces the concept of ''degree of randomness'' of the elements, taken in a definite order, of a shift register. It permits making the judicious choice of the elements of the shift register which will produce the bits of the random numbers. On the other hand, a calculation method is developed in order to verify the primitive character of any shift register of high complexity. A new test, called ''slice test'', of empirical and theoretical use is also described; it constitutes a significant contribution to the understanding of certain properties of pseudo-random sequences. As a practical example, a random number generator structure formed with 32 bits, built out of a shift register with 61 elements and 60 modulo-2 adder circuits was made. The author is convinced that this generator can be considered to be practically perfect for all empirical applications of random numbers, particularly for the solution of Monte-Carlo problems. (author)

Random-Number Generator Validity in Simulation Studies: An Investigation of Normality.

Science.gov (United States)

Bang, Jung W.; Schumacker, Randall E.; Schlieve, Paul L.

1998-01-01

The normality of number distributions generated by various random-number generators were studied, focusing on when the random-number generator reached a normal distribution and at what sample size. Findings suggest the steps that should be followed when using a random-number generator in a Monte Carlo simulation. (SLD)

Pseudo-random number generator for the Sigma 5 computer

Science.gov (United States)

Carroll, S. N.

1983-01-01

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

Device-independent randomness generation from several Bell estimators

Science.gov (United States)

Nieto-Silleras, Olmo; Bamps, Cédric; Silman, Jonathan; Pironio, Stefano

2018-02-01

Device-independent randomness generation and quantum key distribution protocols rely on a fundamental relation between the non-locality of quantum theory and its random character. This relation is usually expressed in terms of a trade-off between the probability of guessing correctly the outcomes of measurements performed on quantum systems and the amount of violation of a given Bell inequality. However, a more accurate assessment of the randomness produced in Bell experiments can be obtained if the value of several Bell expressions is simultaneously taken into account, or if the full set of probabilities characterizing the behavior of the device is considered. We introduce protocols for device-independent randomness generation secure against classical side information, that rely on the estimation of an arbitrary number of Bell expressions or even directly on the experimental frequencies of measurement outcomes. Asymptotically, this results in an optimal generation of randomness from experimental data (as measured by the min-entropy), without having to assume beforehand that the devices violate a specific Bell inequality.

Detection of somaclonal variation by random amplified polymorphic ...

African Journals Online (AJOL)

Detection of somaclonal variation by random amplified polymorphic DNA analysis during micropropagation of Phalaenopsis bellina (Rchb.f.) Christenson. ... Among the primers used, P 16 produced the highest number of bands (29), while primer OPU 10 produced the lowest number (15). The range of similarity coefficient ...

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

Science.gov (United States)

Carpintero, D. D.

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

Image encryption using random sequence generated from generalized information domain

International Nuclear Information System (INIS)

Zhang Xia-Yan; Wu Jie-Hua; Zhang Guo-Ji; Li Xuan; Ren Ya-Zhou

2016-01-01

A novel image encryption method based on the random sequence generated from the generalized information domain and permutation–diffusion architecture is proposed. The random sequence is generated by reconstruction from the generalized information file and discrete trajectory extraction from the data stream. The trajectory address sequence is used to generate a P-box to shuffle the plain image while random sequences are treated as keystreams. A new factor called drift factor is employed to accelerate and enhance the performance of the random sequence generator. An initial value is introduced to make the encryption method an approximately one-time pad. Experimental results show that the random sequences pass the NIST statistical test with a high ratio and extensive analysis demonstrates that the new encryption scheme has superior security. (paper)

Variational random phase approximation for the anharmonic oscillator

International Nuclear Information System (INIS)

Dukelsky, J.; Schuck, P.

1990-04-01

The recently derived Variational Random Phase Approximation is examined using the anharmonic oscillator model. Special attention is paid to the ground state RPA wave function and the convergence of the proposed truncation scheme to obtain the diagonal density matrix. Comparison with the standard Coupled Cluster method is made

Generating equilateral random polygons in confinement

International Nuclear Information System (INIS)

Diao, Y; Ernst, C; Montemayor, A; Ziegler, U

2011-01-01

One challenging problem in biology is to understand the mechanism of DNA packing in a confined volume such as a cell. It is known that confined circular DNA is often knotted and hence the topology of the extracted (and relaxed) circular DNA can be used as a probe of the DNA packing mechanism. However, in order to properly estimate the topological properties of the confined circular DNA structures using mathematical models, it is necessary to generate large ensembles of simulated closed chains (i.e. polygons) of equal edge lengths that are confined in a volume such as a sphere of certain fixed radius. Finding efficient algorithms that properly sample the space of such confined equilateral random polygons is a difficult problem. In this paper, we propose a method that generates confined equilateral random polygons based on their probability distribution. This method requires the creation of a large database initially. However, once the database has been created, a confined equilateral random polygon of length n can be generated in linear time in terms of n. The errors introduced by the method can be controlled and reduced by the refinement of the database. Furthermore, our numerical simulations indicate that these errors are unbiased and tend to cancel each other in a long polygon. (paper)

Super fast physical-random number generation using laser diode frequency noises

Science.gov (United States)

Ushiki, Tetsuro; Doi, Kohei; Maehara, Shinya; Sato, Takashi; Ohkawa, Masashi; Ohdaira, Yasuo

2011-02-01

Random numbers can be classified as either pseudo- or physical-random in character. Pseudo-random numbers' periodicity renders them inappropriate for use in cryptographic applications, but naturally-generated physical-random numbers have no calculable periodicity, thereby making them ideally-suited to the task. The laser diode naturally produces a wideband "noise" signal that is believed to have tremendous capacity and great promise, for the rapid generation of physical-random numbers for use in cryptographic applications. We measured a laser diode's output, at a fast photo detector and generated physical-random numbers from frequency noises. We then identified and evaluated the binary-number-line's statistical properties. The result shows that physical-random number generation, at speeds as high as 40Gbps, is obtainable, using the laser diode's frequency noise characteristic.

An X-ray CCD signal generator with true random arrival time

International Nuclear Information System (INIS)

Huo Jia; Xu Yuming; Chen Yong; Cui Weiwei; Li Wei; Zhang Ziliang; Han Dawei; Wang Yusan; Wang Juan

2011-01-01

An FPGA-based true random signal generator with adjustable amplitude and exponential distribution of time interval is presented. Since traditional true random number generators (TRNG) are resource costly and difficult to transplant, we employed a method of random number generation based on jitter and phase noise in ring oscillators formed by gates in an FPGA. In order to improve the random characteristics, a combination of two different pseudo-random processing circuits is used for post processing. The effects of the design parameters, such as sample frequency are discussed. Statistical tests indicate that the generator can well simulate the timing behavior of random signals with Poisson distribution. The X-ray CCD signal generator will be used in debugging the CCD readout system of the Low Energy X-ray Instrument onboard the Hard X-ray Modulation Telescope (HXMT). (authors)

Efficient Raman generation in a waveguide: A route to ultrafast quantum random number generation

Energy Technology Data Exchange (ETDEWEB)

England, D. G.; Bustard, P. J.; Moffatt, D. J.; Nunn, J.; Lausten, R.; Sussman, B. J., E-mail: ben.sussman@nrc.ca [National Research Council of Canada, 100 Sussex Drive, Ottawa, Ontario K1A 0R6 (Canada)

2014-02-03

The inherent uncertainty in quantum mechanics offers a source of true randomness which can be used to produce unbreakable cryptographic keys. We discuss the development of a high-speed random number generator based on the quantum phase fluctuations in spontaneously initiated stimulated Raman scattering (SISRS). We utilize the tight confinement and long interaction length available in a Potassium Titanyl Phosphate waveguide to generate highly efficient SISRS using nanojoule pulse energies, reducing the high pump power requirements of the previous approaches. We measure the random phase of the Stokes output using a simple interferometric setup to yield quantum random numbers at 145 Mbps.

Quantum random-number generator based on a photon-number-resolving detector

International Nuclear Information System (INIS)

Ren Min; Wu, E; Liang Yan; Jian Yi; Wu Guang; Zeng Heping

2011-01-01

We demonstrated a high-efficiency quantum random number generator which takes inherent advantage of the photon number distribution randomness of a coherent light source. This scheme was realized by comparing the photon flux of consecutive pulses with a photon number resolving detector. The random bit generation rate could reach 2.4 MHz with a system clock of 6.0 MHz, corresponding to a random bit generation efficiency as high as 40%. The random number files passed all the stringent statistical tests.

Secure self-calibrating quantum random-bit generator

International Nuclear Information System (INIS)

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

2007-01-01

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

Superparamagnetic perpendicular magnetic tunnel junctions for true random number generators

Science.gov (United States)

Parks, Bradley; Bapna, Mukund; Igbokwe, Julianne; Almasi, Hamid; Wang, Weigang; Majetich, Sara A.

2018-05-01

Superparamagnetic perpendicular magnetic tunnel junctions are fabricated and analyzed for use in random number generators. Time-resolved resistance measurements are used as streams of bits in statistical tests for randomness. Voltage control of the thermal stability enables tuning the average speed of random bit generation up to 70 kHz in a 60 nm diameter device. In its most efficient operating mode, the device generates random bits at an energy cost of 600 fJ/bit. A narrow range of magnetic field tunes the probability of a given state from 0 to 1, offering a means of probabilistic computing.

Study on random number generator in Monte Carlo code

International Nuclear Information System (INIS)

Oya, Kentaro; Kitada, Takanori; Tanaka, Shinichi

2011-01-01

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

Random Item Generation Is Affected by Age

Science.gov (United States)

Multani, Namita; Rudzicz, Frank; Wong, Wing Yiu Stephanie; Namasivayam, Aravind Kumar; van Lieshout, Pascal

2016-01-01

Purpose: Random item generation (RIG) involves central executive functioning. Measuring aspects of random sequences can therefore provide a simple method to complement other tools for cognitive assessment. We examine the extent to which RIG relates to specific measures of cognitive function, and whether those measures can be estimated using RIG…

A fast ergodic algorithm for generating ensembles of equilateral random polygons

Science.gov (United States)

Varela, R.; Hinson, K.; Arsuaga, J.; Diao, Y.

2009-03-01

Knotted structures are commonly found in circular DNA and along the backbone of certain proteins. In order to properly estimate properties of these three-dimensional structures it is often necessary to generate large ensembles of simulated closed chains (i.e. polygons) of equal edge lengths (such polygons are called equilateral random polygons). However finding efficient algorithms that properly sample the space of equilateral random polygons is a difficult problem. Currently there are no proven algorithms that generate equilateral random polygons with its theoretical distribution. In this paper we propose a method that generates equilateral random polygons in a 'step-wise uniform' way. We prove that this method is ergodic in the sense that any given equilateral random polygon can be generated by this method and we show that the time needed to generate an equilateral random polygon of length n is linear in terms of n. These two properties make this algorithm a big improvement over the existing generating methods. Detailed numerical comparisons of our algorithm with other widely used algorithms are provided.

Experimentally generated randomness certified by the impossibility of superluminal signals.

Science.gov (United States)

Bierhorst, Peter; Knill, Emanuel; Glancy, Scott; Zhang, Yanbao; Mink, Alan; Jordan, Stephen; Rommal, Andrea; Liu, Yi-Kai; Christensen, Bradley; Nam, Sae Woo; Stevens, Martin J; Shalm, Lynden K

2018-04-01

From dice to modern electronic circuits, there have been many attempts to build better devices to generate random numbers. Randomness is fundamental to security and cryptographic systems and to safeguarding privacy. A key challenge with random-number generators is that it is hard to ensure that their outputs are unpredictable 1-3 . For a random-number generator based on a physical process, such as a noisy classical system or an elementary quantum measurement, a detailed model that describes the underlying physics is necessary to assert unpredictability. Imperfections in the model compromise the integrity of the device. However, it is possible to exploit the phenomenon of quantum non-locality with a loophole-free Bell test to build a random-number generator that can produce output that is unpredictable to any adversary that is limited only by general physical principles, such as special relativity 1-11 . With recent technological developments, it is now possible to carry out such a loophole-free Bell test 12-14,22 . Here we present certified randomness obtained from a photonic Bell experiment and extract 1,024 random bits that are uniformly distributed to within 10 -12 . These random bits could not have been predicted according to any physical theory that prohibits faster-than-light (superluminal) signalling and that allows independent measurement choices. To certify and quantify the randomness, we describe a protocol that is optimized for devices that are characterized by a low per-trial violation of Bell inequalities. Future random-number generators based on loophole-free Bell tests may have a role in increasing the security and trust of our cryptographic systems and infrastructure.

Quantum random flip-flop and its applications in random frequency synthesis and true random number generation

Energy Technology Data Exchange (ETDEWEB)

Stipčević, Mario, E-mail: mario.stipcevic@irb.hr [Photonics and Quantum Optics Research Unit, Center of Excellence for Advanced Materials and Sensing Devices, Ruđer Bošković Institute, Bijenička 54, 10000 Zagreb (Croatia)

2016-03-15

In this work, a new type of elementary logic circuit, named random flip-flop (RFF), is proposed, experimentally realized, and studied. Unlike conventional Boolean logic circuits whose action is deterministic and highly reproducible, the action of a RFF is intentionally made maximally unpredictable and, in the proposed realization, derived from a fundamentally random process of emission and detection of light quanta. We demonstrate novel applications of RFF in randomness preserving frequency division, random frequency synthesis, and random number generation. Possible usages of these applications in the information and communication technology, cryptographic hardware, and testing equipment are discussed.

Humans can consciously generate random number sequences: a possible test for artificial intelligence.

Science.gov (United States)

Persaud, Navindra

2005-01-01

Computer algorithms can only produce seemingly random or pseudorandom numbers whereas certain natural phenomena, such as the decay of radioactive particles, can be utilized to produce truly random numbers. In this study, the ability of humans to generate random numbers was tested in healthy adults. Subjects were simply asked to generate and dictate random numbers. Generated numbers were tested for uniformity, independence and information density. The results suggest that humans can generate random numbers that are uniformly distributed, independent of one another and unpredictable. If humans can generate sequences of random numbers then neural networks or forms of artificial intelligence, which are purported to function in ways essentially the same as the human brain, should also be able to generate sequences of random numbers. Elucidating the precise mechanism by which humans generate random number sequences and the underlying neural substrates may have implications in the cognitive science of decision-making. It is possible that humans use their random-generating neural machinery to make difficult decisions in which all expected outcomes are similar. It is also possible that certain people, perhaps those with neurological or psychiatric impairments, are less able or unable to generate random numbers. If the random-generating neural machinery is employed in decision making its impairment would have profound implications in matters of agency and free will.

Nonquadratic Variation of the Blum Blum Shub Pseudorandom Number Generator

Science.gov (United States)

2016-09-01

analyzes it for repetition and periodic behavior . Theoretically, in a random sequence , 95 percent of the values will not exceed T , where T is given by the...excursion of random walks within a sequence . A random walk can be defined in terms of a graph. First, this test changes all zeroes within the tested...Technology (NIST) tests. The original BBS is a quadratic generator that generates bits based on the output of squaring terms in a sequence . The first

Fast random-number generation using a diode laser's frequency noise characteristic

Science.gov (United States)

Takamori, Hiroki; Doi, Kohei; Maehara, Shinya; Kawakami, Kohei; Sato, Takashi; Ohkawa, Masashi; Ohdaira, Yasuo

2012-02-01

Random numbers can be classified as either pseudo- or physical-random, in character. Pseudo-random numbers are generated by definite periodicity, so, their usefulness in cryptographic applications is somewhat limited. On the other hand, naturally-generated physical-random numbers have no calculable periodicity, thereby making them ideal for the task. Diode lasers' considerable wideband noise gives them tremendous capacity for generating physical-random numbers, at a high rate of speed. We measured a diode laser's output with a fast photo detector, and evaluated the binary-numbers from the diode laser's frequency noise characteristics. We then identified and evaluated the binary-number-line's statistical properties. We also investigate the possibility that much faster physical-random number parallel-generation is possible, using separate outputs of different optical-path length and character, which we refer to as "coherence collapse".

Properties making a chaotic system a good Pseudo Random Number Generator

OpenAIRE

Falcioni, Massimo; Palatella, Luigi; Pigolotti, Simone; Vulpiani, Angelo

2005-01-01

We discuss two properties making a deterministic algorithm suitable to generate a pseudo random sequence of numbers: high value of Kolmogorov-Sinai entropy and high-dimensionality. We propose the multi dimensional Anosov symplectic (cat) map as a Pseudo Random Number Generator. We show what chaotic features of this map are useful for generating Pseudo Random Numbers and investigate numerically which of them survive in the discrete version of the map. Testing and comparisons with other generat...

A Repetition Test for Pseudo-Random Number Generators

OpenAIRE

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

2017-01-01

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

Generating functionals for quantum field theories with random potentials

International Nuclear Information System (INIS)

Jain, Mudit; Vanchurin, Vitaly

2016-01-01

We consider generating functionals for computing correlators in quantum field theories with random potentials. Examples of such theories include cosmological systems in context of the string theory landscape (e.g. cosmic inflation) or condensed matter systems with quenched disorder (e.g. spin glass). We use the so-called replica trick to define two different generating functionals for calculating correlators of the quantum fields averaged over a given distribution of random potentials. The first generating functional is appropriate for calculating averaged (in-out) amplitudes and involves a single replica of fields, but the replica limit is taken to an (unphysical) negative one number of fields outside of the path integral. When the number of replicas is doubled the generating functional can also be used for calculating averaged probabilities (squared amplitudes) using the in-in construction. The second generating functional involves an infinite number of replicas, but can be used for calculating both in-out and in-in correlators and the replica limits are taken to only a zero number of fields. We discuss the formalism in details for a single real scalar field, but the generalization to more fields or to different types of fields is straightforward. We work out three examples: one where the mass of scalar field is treated as a random variable and two where the functional form of interactions is random, one described by a Gaussian random field and the other by a Euclidean action in the field configuration space.

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

Science.gov (United States)

Ghersi, Dario; Parakh, Abhishek; Mezei, Mihaly

2017-12-05

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

Brain potentials index executive functions during random number generation.

Science.gov (United States)

Joppich, Gregor; Däuper, Jan; Dengler, Reinhard; Johannes, Sönke; Rodriguez-Fornells, Antoni; Münte, Thomas F

2004-06-01

The generation of random sequences is considered to tax different executive functions. To explore the involvement of these functions further, brain potentials were recorded in 16 healthy young adults while either engaging in random number generation (RNG) by pressing the number keys on a computer keyboard in a random sequence or in ordered number generation (ONG) necessitating key presses in the canonical order. Key presses were paced by an external auditory stimulus to yield either fast (1 press/800 ms) or slow (1 press/1300 ms) sequences in separate runs. Attentional demands of random and ordered tasks were assessed by the introduction of a secondary task (key-press to a target tone). The P3 amplitude to the target tone of this secondary task was reduced during RNG, reflecting the greater consumption of attentional resources during RNG. Moreover, RNG led to a left frontal negativity peaking 140 ms after the onset of the pacing stimulus, whenever the subjects produced a true random response. This negativity could be attributed to the left dorsolateral prefrontal cortex and was absent when numbers were repeated. This negativity was interpreted as an index for the inhibition of habitual responses. Finally, in response locked ERPs a negative component was apparent peaking about 50 ms after the key-press that was more prominent during RNG. Source localization suggested a medial frontal source. This effect was tentatively interpreted as a reflection of the greater monitoring demands during random sequence generation.

Post-processing Free Quantum Random Number Generator Based on Avalanche Photodiode Array

International Nuclear Information System (INIS)

Li Yang; Liao Sheng-Kai; Liang Fu-Tian; Shen Qi; Liang Hao; Peng Cheng-Zhi

2016-01-01

Quantum random number generators adopting single photon detection have been restricted due to the non-negligible dead time of avalanche photodiodes (APDs). We propose a new approach based on an APD array to improve the generation rate of random numbers significantly. This method compares the detectors' responses to consecutive optical pulses and generates the random sequence. We implement a demonstration experiment to show its simplicity, compactness and scalability. The generated numbers are proved to be unbiased, post-processing free, ready to use, and their randomness is verified by using the national institute of standard technology statistical test suite. The random bit generation efficiency is as high as 32.8% and the potential generation rate adopting the 32 × 32 APD array is up to tens of Gbits/s. (paper)

A true random number generator based on mouse movement and chaotic cryptography

International Nuclear Information System (INIS)

Hu Yue; Liao Xiaofeng; Wong, Kwok-wo; Zhou Qing

2009-01-01

True random number generators are in general more secure than pseudo random number generators. In this paper, we propose a novel true random number generator which generates a 256-bit random number by computer mouse movement. It is cheap, convenient and universal for personal computers. To eliminate the effect of similar movement patterns generated by the same user, three chaos-based approaches, namely, discretized 2D chaotic map permutation, spatiotemporal chaos and 'MASK' algorithm, are adopted to post-process the captured mouse movements. Random bits generated by three users are tested using NIST statistical tests. Both the spatiotemporal chaos approach and the 'MASK' algorithm pass the tests successfully. However, the latter has a better performance in terms of efficiency and effectiveness and so is more practical for common personal computer applications.

Truly random dynamics generated by autonomous dynamical systems

Science.gov (United States)

González, J. A.; Reyes, L. I.

2001-09-01

We investigate explicit functions that can produce truly random numbers. We use the analytical properties of the explicit functions to show that a certain class of autonomous dynamical systems can generate random dynamics. This dynamics presents fundamental differences with the known chaotic systems. We present real physical systems that can produce this kind of random time-series. Some applications are discussed.

Generating random networks and graphs

CERN Document Server

Coolen, Ton; Roberts, Ekaterina

2017-01-01

This book supports researchers who need to generate random networks, or who are interested in the theoretical study of random graphs. The coverage includes exponential random graphs (where the targeted probability of each network appearing in the ensemble is specified), growth algorithms (i.e. preferential attachment and the stub-joining configuration model), special constructions (e.g. geometric graphs and Watts Strogatz models) and graphs on structured spaces (e.g. multiplex networks). The presentation aims to be a complete starting point, including details of both theory and implementation, as well as discussions of the main strengths and weaknesses of each approach. It includes extensive references for readers wishing to go further. The material is carefully structured to be accessible to researchers from all disciplines while also containing rigorous mathematical analysis (largely based on the techniques of statistical mechanics) to support those wishing to further develop or implement the theory of rand...

Recommendations and illustrations for the evaluation of photonic random number generators

Science.gov (United States)

Hart, Joseph D.; Terashima, Yuta; Uchida, Atsushi; Baumgartner, Gerald B.; Murphy, Thomas E.; Roy, Rajarshi

2017-09-01

The never-ending quest to improve the security of digital information combined with recent improvements in hardware technology has caused the field of random number generation to undergo a fundamental shift from relying solely on pseudo-random algorithms to employing optical entropy sources. Despite these significant advances on the hardware side, commonly used statistical measures and evaluation practices remain ill-suited to understand or quantify the optical entropy that underlies physical random number generation. We review the state of the art in the evaluation of optical random number generation and recommend a new paradigm: quantifying entropy generation and understanding the physical limits of the optical sources of randomness. In order to do this, we advocate for the separation of the physical entropy source from deterministic post-processing in the evaluation of random number generators and for the explicit consideration of the impact of the measurement and digitization process on the rate of entropy production. We present the Cohen-Procaccia estimate of the entropy rate h (𝜖 ,τ ) as one way to do this. In order to provide an illustration of our recommendations, we apply the Cohen-Procaccia estimate as well as the entropy estimates from the new NIST draft standards for physical random number generators to evaluate and compare three common optical entropy sources: single photon time-of-arrival detection, chaotic lasers, and amplified spontaneous emission.

Recommendations and illustrations for the evaluation of photonic random number generators

Directory of Open Access Journals (Sweden)

Joseph D. Hart

2017-09-01

Full Text Available The never-ending quest to improve the security of digital information combined with recent improvements in hardware technology has caused the field of random number generation to undergo a fundamental shift from relying solely on pseudo-random algorithms to employing optical entropy sources. Despite these significant advances on the hardware side, commonly used statistical measures and evaluation practices remain ill-suited to understand or quantify the optical entropy that underlies physical random number generation. We review the state of the art in the evaluation of optical random number generation and recommend a new paradigm: quantifying entropy generation and understanding the physical limits of the optical sources of randomness. In order to do this, we advocate for the separation of the physical entropy source from deterministic post-processing in the evaluation of random number generators and for the explicit consideration of the impact of the measurement and digitization process on the rate of entropy production. We present the Cohen-Procaccia estimate of the entropy rate h(,τ as one way to do this. In order to provide an illustration of our recommendations, we apply the Cohen-Procaccia estimate as well as the entropy estimates from the new NIST draft standards for physical random number generators to evaluate and compare three common optical entropy sources: single photon time-of-arrival detection, chaotic lasers, and amplified spontaneous emission.

Parallel random number generator for inexpensive configurable hardware cells

Science.gov (United States)

Ackermann, J.; Tangen, U.; Bödekker, B.; Breyer, J.; Stoll, E.; McCaskill, J. S.

2001-11-01

A new random number generator ( RNG) adapted to parallel processors has been created. This RNG can be implemented with inexpensive hardware cells. The correlation between neighboring cells is suppressed with smart connections. With such connection structures, sequences of pseudo-random numbers are produced. Numerical tests including a self-avoiding random walk test and the simulation of the order parameter and energy of the 2D Ising model give no evidence for correlation in the pseudo-random sequences. Because the new random number generator has suppressed the correlation between neighboring cells which is usually observed in cellular automaton implementations, it is applicable for extended time simulations. It gives an immense speed-up factor if implemented directly in configurable hardware, and has recently been used for long time simulations of spatially resolved molecular evolution.

A pseudo-random number generator and its spectral test

International Nuclear Information System (INIS)

Wang Lai

1998-01-01

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

Generation of Random Numbers and Parallel Random Number Streams for Monte Carlo Simulations

Directory of Open Access Journals (Sweden)

L. Yu. Barash

2012-01-01

Full Text Available Modern methods and libraries for high quality pseudorandom number generation and for generation of parallel random number streams for Monte Carlo simulations are considered. The probability equidistribution property and the parameters when the property holds at dimensions up to logarithm of mesh size are considered for Multiple Recursive Generators.

Random generation of RNA secondary structures according to native distributions

Directory of Open Access Journals (Sweden)

Nebel Markus E

2011-10-01

Full Text Available Abstract Background Random biological sequences are a topic of great interest in genome analysis since, according to a powerful paradigm, they represent the background noise from which the actual biological information must differentiate. Accordingly, the generation of random sequences has been investigated for a long time. Similarly, random object of a more complicated structure like RNA molecules or proteins are of interest. Results In this article, we present a new general framework for deriving algorithms for the non-uniform random generation of combinatorial objects according to the encoding and probability distribution implied by a stochastic context-free grammar. Briefly, the framework extends on the well-known recursive method for (uniform random generation and uses the popular framework of admissible specifications of combinatorial classes, introducing weighted combinatorial classes to allow for the non-uniform generation by means of unranking. This framework is used to derive an algorithm for the generation of RNA secondary structures of a given fixed size. We address the random generation of these structures according to a realistic distribution obtained from real-life data by using a very detailed context-free grammar (that models the class of RNA secondary structures by distinguishing between all known motifs in RNA structure. Compared to well-known sampling approaches used in several structure prediction tools (such as SFold ours has two major advantages: Firstly, after a preprocessing step in time O(n2 for the computation of all weighted class sizes needed, with our approach a set of m random secondary structures of a given structure size n can be computed in worst-case time complexity Om⋅n⋅ log(n while other algorithms typically have a runtime in O(m⋅n2. Secondly, our approach works with integer arithmetic only which is faster and saves us from all the discomforting details of using floating point arithmetic with

Pseudo-random bit generator based on lag time series

Science.gov (United States)

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

2014-12-01

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

A Comparison of Three Random Number Generators for Aircraft Dynamic Modeling Applications

Science.gov (United States)

Grauer, Jared A.

2017-01-01

Three random number generators, which produce Gaussian white noise sequences, were compared to assess their suitability in aircraft dynamic modeling applications. The first generator considered was the MATLAB (registered) implementation of the Mersenne-Twister algorithm. The second generator was a website called Random.org, which processes atmospheric noise measured using radios to create the random numbers. The third generator was based on synthesis of the Fourier series, where the random number sequences are constructed from prescribed amplitude and phase spectra. A total of 200 sequences, each having 601 random numbers, for each generator were collected and analyzed in terms of the mean, variance, normality, autocorrelation, and power spectral density. These sequences were then applied to two problems in aircraft dynamic modeling, namely estimating stability and control derivatives from simulated onboard sensor data, and simulating flight in atmospheric turbulence. In general, each random number generator had good performance and is well-suited for aircraft dynamic modeling applications. Specific strengths and weaknesses of each generator are discussed. For Monte Carlo simulation, the Fourier synthesis method is recommended because it most accurately and consistently approximated Gaussian white noise and can be implemented with reasonable computational effort.

A method for generating skewed random numbers using two overlapping uniform distributions

International Nuclear Information System (INIS)

Ermak, D.L.; Nasstrom, J.S.

1995-02-01

The objective of this work was to implement and evaluate a method for generating skewed random numbers using a combination of uniform random numbers. The method provides a simple and accurate way of generating skewed random numbers from the specified first three moments without an a priori specification of the probability density function. We describe the procedure for generating skewed random numbers from unifon-n random numbers, and show that it accurately produces random numbers with the desired first three moments over a range of skewness values. We also show that in the limit of zero skewness, the distribution of random numbers is an accurate approximation to the Gaussian probability density function. Future work win use this method to provide skewed random numbers for a Langevin equation model for diffusion in skewed turbulence

Generating variable and random schedules of reinforcement using Microsoft Excel macros.

Science.gov (United States)

Bancroft, Stacie L; Bourret, Jason C

2008-01-01

Variable reinforcement schedules are used to arrange the availability of reinforcement following varying response ratios or intervals of time. Random reinforcement schedules are subtypes of variable reinforcement schedules that can be used to arrange the availability of reinforcement at a constant probability across number of responses or time. Generating schedule values for variable and random reinforcement schedules can be difficult. The present article describes the steps necessary to write macros in Microsoft Excel that will generate variable-ratio, variable-interval, variable-time, random-ratio, random-interval, and random-time reinforcement schedule values.

Realization of a Quantum Random Generator Certified with the Kochen-Specker Theorem

Science.gov (United States)

Kulikov, Anatoly; Jerger, Markus; Potočnik, Anton; Wallraff, Andreas; Fedorov, Arkady

2017-12-01

Random numbers are required for a variety of applications from secure communications to Monte Carlo simulation. Yet randomness is an asymptotic property, and no output string generated by a physical device can be strictly proven to be random. We report an experimental realization of a quantum random number generator (QRNG) with randomness certified by quantum contextuality and the Kochen-Specker theorem. The certification is not performed in a device-independent way but through a rigorous theoretical proof of each outcome being value indefinite even in the presence of experimental imperfections. The analysis of the generated data confirms the incomputable nature of our QRNG.

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.

GASPRNG: GPU accelerated scalable parallel random number generator library

Science.gov (United States)

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

Pseudo-random-number generators and the square site percolation threshold.

Science.gov (United States)

Lee, Michael J

2008-09-01

Selected pseudo-random-number generators are applied to a Monte Carlo study of the two-dimensional square-lattice site percolation model. A generator suitable for high precision calculations is identified from an application specific test of randomness. After extended computation and analysis, an ostensibly reliable value of p_{c}=0.59274598(4) is obtained for the percolation threshold.

Non-Stoichiometric SixN Metal-Oxide-Semiconductor Field-Effect Transistor for Compact Random Number Generator with 0.3 Mbit/s Generation Rate

Science.gov (United States)

Matsumoto, Mari; Ohba, Ryuji; Yasuda, Shin-ichi; Uchida, Ken; Tanamoto, Tetsufumi; Fujita, Shinobu

2008-08-01

The demand for random numbers for security applications is increasing. A conventional random number generator using thermal noise can generate unpredictable high-quality random numbers, but the circuit is extremely large because of large amplifier circuit for a small thermal signal. On the other hand, a pseudo-random number generator is small but the quality of randomness is bad. For a small circuit and a high quality of randomness, we purpose a non-stoichiometric SixN metal-oxide-semiconductor field-effect transistor (MOSFET) noise source device. This device generates a very large noise signal without an amplifier circuit. As a result, it is shown that, utilizing a SiN MOSFET, we can attain a compact random number generator with a high generation rate near 1 Mbit/s, which is suitable for almost all security applications.

Ultrafast quantum random number generation based on quantum phase fluctuations.

Science.gov (United States)

Xu, Feihu; Qi, Bing; Ma, Xiongfeng; Xu, He; Zheng, Haoxuan; Lo, Hoi-Kwong

2012-05-21

A quantum random number generator (QRNG) can generate true randomness by exploiting the fundamental indeterminism of quantum mechanics. Most approaches to QRNG employ single-photon detection technologies and are limited in speed. Here, we experimentally demonstrate an ultrafast QRNG at a rate over 6 Gbits/s based on the quantum phase fluctuations of a laser operating near threshold. Moreover, we consider a potential adversary who has partial knowledge on the raw data and discuss how one can rigorously remove such partial knowledge with postprocessing. We quantify the quantum randomness through min-entropy by modeling our system and employ two randomness extractors--Trevisan's extractor and Toeplitz-hashing--to distill the randomness, which is information-theoretically provable. The simplicity and high-speed of our experimental setup show the feasibility of a robust, low-cost, high-speed QRNG.

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

Science.gov (United States)

Bonelli, Antonio; Ruffo, Stefano

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

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

Science.gov (United States)

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

2016-07-11

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

Using Computer-Generated Random Numbers to Calculate the Lifetime of a Comet.

Science.gov (United States)

Danesh, Iraj

1991-01-01

An educational technique to calculate the lifetime of a comet using software-generated random numbers is introduced to undergraduate physiques and astronomy students. Discussed are the generation and eligibility of the required random numbers, background literature related to the problem, and the solution to the problem using random numbers.…

Analysis of entropy extraction efficiencies in random number generation systems

Science.gov (United States)

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.

GRD: An SPSS extension command for generating random data

Directory of Open Access Journals (Sweden)

Bradley Harding

2014-09-01

Full Text Available To master statistics and data analysis tools, it is necessary to understand a number of concepts, manyof which are quite abstract. For example, sampling from a theoretical distribution can help individuals explore andunderstand randomness. Sampling can also be used to build exercises aimed to help students master statistics. Here, we present GRD (Generator of Random Data, an extension command for SPSS (version 17 and above. With GRD, it is possible to get random data from a given distribution. In its simplest use, GRD will return a set of simulated data from a normal distribution.With subcommands to GRD, it is possible to get data from multiple groups, over multiple repeated measures, and with desired effectsizes. Group sizes can be equal or unequal. With further subcommands, it is possible to sample from any theoretical population, (not simply the normal distribution, introduce non-homogeneous variances,fix or randomize subject effects, etc. Finally, GRD’s generated data are in a format ready to be analyzed.

Asymmetric Variate Generation via a Parameterless Dual Neural Learning Algorithm

Directory of Open Access Journals (Sweden)

Simone Fiori

2008-01-01

Full Text Available In a previous work (S. Fiori, 2006, we proposed a random number generator based on a tunable non-linear neural system, whose learning rule is designed on the basis of a cardinal equation from statistics and whose implementation is based on look-up tables (LUTs. The aim of the present manuscript is to improve the above-mentioned random number generation method by changing the learning principle, while retaining the efficient LUT-based implementation. The new method proposed here proves easier to implement and relaxes some previous limitations.

Random Generators and Normal Numbers

OpenAIRE

Bailey, David H.; Crandall, Richard E.

2002-01-01

Pursuant to the authors' previous chaotic-dynamical model for random digits of fundamental constants, we investigate a complementary, statistical picture in which pseudorandom number generators (PRNGs) are central. Some rigorous results are achieved: We establish b-normality for constants of the form $\\sum_i 1/(b^{m_i} c^{n_i})$ for certain sequences $(m_i), (n_i)$ of integers. This work unifies and extends previously known classes of explicit normals. We prove that for coprime $b,c>1$ the...

Effects of a random spatial variation of the plasma density on the mode conversion in cold, unmagnetized, and stratified plasmas

Energy Technology Data Exchange (ETDEWEB)

Jung Yu, Dae [School of Space Research, Kyung Hee University, Yongin 446-701 (Korea, Republic of); Kim, Kihong [Department of Energy Systems Research, Ajou University, Suwon 443-749 (Korea, Republic of)

2013-12-15

We study the effects of a random spatial variation of the plasma density on the mode conversion of electromagnetic waves into electrostatic oscillations in cold, unmagnetized, and stratified plasmas. Using the invariant imbedding method, we calculate precisely the electromagnetic field distribution and the mode conversion coefficient, which is defined to be the fraction of the incident wave power converted into electrostatic oscillations, for the configuration where a numerically generated random density variation is added to the background linear density profile. We repeat similar calculations for a large number of random configurations and take an average of the results. We obtain a peculiar nonmonotonic dependence of the mode conversion coefficient on the strength of randomness. As the disorder increases from zero, the maximum value of the mode conversion coefficient decreases initially, then increases to a maximum, and finally decreases towards zero. The range of the incident angle in which mode conversion occurs increases monotonically as the disorder increases. We present numerical results suggesting that the decrease of mode conversion mainly results from the increased reflection due to the Anderson localization effect originating from disorder, whereas the increase of mode conversion of the intermediate disorder regime comes from the appearance of many resonance points and the enhanced tunneling between the resonance points and the cutoff point. We also find a very large local enhancement of the magnetic field intensity for particular random configurations. In order to obtain high mode conversion efficiency, it is desirable to restrict the randomness close to the resonance region.

Effects of a random spatial variation of the plasma density on the mode conversion in cold, unmagnetized, and stratified plasmas

International Nuclear Information System (INIS)

Jung Yu, Dae; Kim, Kihong

2013-01-01

We study the effects of a random spatial variation of the plasma density on the mode conversion of electromagnetic waves into electrostatic oscillations in cold, unmagnetized, and stratified plasmas. Using the invariant imbedding method, we calculate precisely the electromagnetic field distribution and the mode conversion coefficient, which is defined to be the fraction of the incident wave power converted into electrostatic oscillations, for the configuration where a numerically generated random density variation is added to the background linear density profile. We repeat similar calculations for a large number of random configurations and take an average of the results. We obtain a peculiar nonmonotonic dependence of the mode conversion coefficient on the strength of randomness. As the disorder increases from zero, the maximum value of the mode conversion coefficient decreases initially, then increases to a maximum, and finally decreases towards zero. The range of the incident angle in which mode conversion occurs increases monotonically as the disorder increases. We present numerical results suggesting that the decrease of mode conversion mainly results from the increased reflection due to the Anderson localization effect originating from disorder, whereas the increase of mode conversion of the intermediate disorder regime comes from the appearance of many resonance points and the enhanced tunneling between the resonance points and the cutoff point. We also find a very large local enhancement of the magnetic field intensity for particular random configurations. In order to obtain high mode conversion efficiency, it is desirable to restrict the randomness close to the resonance region

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

OpenAIRE

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

2011-01-01

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

A revision of the subtract-with-borrow random number generators

Science.gov (United States)

Sibidanov, Alexei

2017-12-01

The most popular and widely used subtract-with-borrow generator, also known as RANLUX, is reimplemented as a linear congruential generator using large integer arithmetic with the modulus size of 576 bits. Modern computers, as well as the specific structure of the modulus inferred from RANLUX, allow for the development of a fast modular multiplication - the core of the procedure. This was previously believed to be slow and have too high cost in terms of computing resources. Our tests show a significant gain in generation speed which is comparable with other fast, high quality random number generators. An additional feature is the fast skipping of generator states leading to a seeding scheme which guarantees the uniqueness of random number sequences. Licensing provisions: GPLv3 Programming language: C++, C, Assembler

Pseudo-random bit generator based on Chebyshev map

Science.gov (United States)

Stoyanov, B. P.

2013-10-01

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

A generator for unique quantum random numbers based on vacuum states

DEFF Research Database (Denmark)

Gabriel, C.; Wittmann, C.; Sych, D.

2010-01-01

the purity of a continuous-variable quantum vacuum state to generate unique random numbers. We use the intrinsic randomness in measuring the quadratures of a mode in the lowest energy vacuum state, which cannot be correlated to any other state. The simplicity of our source, combined with its verifiably......Random numbers are a valuable component in diverse applications that range from simulations(1) over gambling to cryptography(2,3). The quest for true randomness in these applications has engendered a large variety of different proposals for producing random numbers based on the foundational...... unpredictability of quantum mechanics(4-11). However, most approaches do not consider that a potential adversary could have knowledge about the generated numbers, so the numbers are not verifiably random and unique(12-15). Here we present a simple experimental setup based on homodyne measurements that uses...

Accelerating Pseudo-Random Number Generator for MCNP on GPU

Science.gov (United States)

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

2010-09-01

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

Testing random number generators for Monte Carlo applications

International Nuclear Information System (INIS)

Sim, L.H.

1992-01-01

Central to any system for modelling radiation transport phenomena using Monte Carlo techniques is the method by which pseudo random numbers are generated. This method is commonly referred to as the Random Number Generator (RNG). It is usually a computer implemented mathematical algorithm which produces a series of numbers uniformly distributed on the interval [0,1]. If this series satisfies certain statistical tests for randomness, then for practical purposes the pseudo random numbers in the series can be considered to be random. Tests of this nature are important not only for new RNGs but also to test the implementation of known RNG algorithms in different computer environments. Six RNGs have been tested using six statistical tests and one visual test. The statistical tests are the moments, frequency (digit and number), serial, gap, and poker tests. The visual test is a simple two dimensional ordered pair display. In addition the RNGs have been tested in a specific Monte Carlo application. This type of test is often overlooked, however it is important that in addition to satisfactory performance in statistical tests, the RNG be able to perform effectively in the applications of interest. The RNGs tested here are based on a variety of algorithms, including multiplicative and linear congruential, lagged Fibonacci, and combination arithmetic and lagged Fibonacci. The effect of the Bays-Durham shuffling algorithm on the output of a known bad RNG has also been investigated. 18 refs., 11 tabs., 4 figs. of

Cost efficiency of Japanese steam power generation companies: A Bayesian comparison of random and fixed frontier models

Energy Technology Data Exchange (ETDEWEB)

Assaf, A. George [Isenberg School of Management, University of Massachusetts-Amherst, 90 Campus Center Way, Amherst 01002 (United States); Barros, Carlos Pestana [Instituto Superior de Economia e Gestao, Technical University of Lisbon, Rua Miguel Lupi, 20, 1249-078 Lisbon (Portugal); Managi, Shunsuke [Graduate School of Environmental Studies, Tohoku University, 6-6-20 Aramaki-Aza Aoba, Aoba-Ku, Sendai 980-8579 (Japan)

2011-04-15

This study analyses and compares the cost efficiency of Japanese steam power generation companies using the fixed and random Bayesian frontier models. We show that it is essential to account for heterogeneity in modelling the performance of energy companies. Results from the model estimation also indicate that restricting CO{sub 2} emissions can lead to a decrease in total cost. The study finally discusses the efficiency variations between the energy companies under analysis, and elaborates on the managerial and policy implications of the results. (author)

Programmable pseudo-random detector-pulse-pattern generator

International Nuclear Information System (INIS)

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

1990-01-01

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

The Reliability of Randomly Generated Math Curriculum-Based Measurements

Science.gov (United States)

Strait, Gerald G.; Smith, Bradley H.; Pender, Carolyn; Malone, Patrick S.; Roberts, Jarod; Hall, John D.

2015-01-01

"Curriculum-Based Measurement" (CBM) is a direct method of academic assessment used to screen and evaluate students' skills and monitor their responses to academic instruction and intervention. Interventioncentral.org offers a math worksheet generator at no cost that creates randomly generated "math curriculum-based measures"…

An investigation of the uniform random number generator

Science.gov (United States)

Temple, E. C.

1982-01-01

Most random number generators that are in use today are of the congruential form X(i+1) + AX(i) + C mod M where A, C, and M are nonnegative integers. If C=O, the generator is called the multiplicative type and those for which C/O are called mixed congruential generators. It is easy to see that congruential generators will repeat a sequence of numbers after a maximum of M values have been generated. The number of numbers that a procedure generates before restarting the sequence is called the length or the period of the generator. Generally, it is desirable to make the period as long as possible. A detailed discussion of congruential generators is given. Also, several promising procedures that differ from the multiplicative and mixed procedure are discussed.

Random walk generated by random permutations of {1, 2, 3, ..., n + 1}

International Nuclear Information System (INIS)

Oshanin, G; Voituriez, R

2004-01-01

We study properties of a non-Markovian random walk X (n) l , l = 0, 1, 2, ..., n, evolving in discrete time l on a one-dimensional lattice of integers, whose moves to the right or to the left are prescribed by the rise-and-descent sequences characterizing random permutations π of [n + 1] = {1, 2, 3, ..., n + 1}. We determine exactly the probability of finding the end-point X n = X (n) n of the trajectory of such a permutation-generated random walk (PGRW) at site X, and show that in the limit n → ∞ it converges to a normal distribution with a smaller, compared to the conventional Polya random walk, diffusion coefficient. We formulate, as well, an auxiliary stochastic process whose distribution is identical to the distribution of the intermediate points X (n) l , l < n, which enables us to obtain the probability measure of different excursions and to define the asymptotic distribution of the number of 'turns' of the PGRW trajectories

Novel pseudo-random number generator based on quantum random walks

Science.gov (United States)

Yang, Yu-Guang; Zhao, Qian-Qian

2016-02-01

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

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

Science.gov (United States)

Yang, Yu-Guang; Zhao, Qian-Qian

2016-02-04

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

Efficient pseudo-random number generation for monte-carlo simulations using graphic processors

Science.gov (United States)

Mohanty, Siddhant; Mohanty, A. K.; Carminati, F.

2012-06-01

A hybrid approach based on the combination of three Tausworthe generators and one linear congruential generator for pseudo random number generation for GPU programing as suggested in NVIDIA-CUDA library has been used for MONTE-CARLO sampling. On each GPU thread, a random seed is generated on fly in a simple way using the quick and dirty algorithm where mod operation is not performed explicitly due to unsigned integer overflow. Using this hybrid generator, multivariate correlated sampling based on alias technique has been carried out using both CUDA and OpenCL languages.

Efficient pseudo-random number generation for Monte-Carlo simulations using graphic processors

International Nuclear Information System (INIS)

Mohanty, Siddhant; Mohanty, A K; Carminati, F

2012-01-01

A hybrid approach based on the combination of three Tausworthe generators and one linear congruential generator for pseudo random number generation for GPU programing as suggested in NVIDIA-CUDA library has been used for MONTE-CARLO sampling. On each GPU thread, a random seed is generated on fly in a simple way using the quick and dirty algorithm where mod operation is not performed explicitly due to unsigned integer overflow. Using this hybrid generator, multivariate correlated sampling based on alias technique has been carried out using both CUDA and OpenCL languages.

A practical guide and power analysis for GLMMs: detecting among treatment variation in random effects

Directory of Open Access Journals (Sweden)

Morgan P. Kain

2015-09-01

Full Text Available In ecology and evolution generalized linear mixed models (GLMMs are becoming increasingly used to test for differences in variation by treatment at multiple hierarchical levels. Yet, the specific sampling schemes that optimize the power of an experiment to detect differences in random effects by treatment/group remain unknown. In this paper we develop a blueprint for conducting power analyses for GLMMs focusing on detecting differences in variance by treatment. We present parameterization and power analyses for random-intercepts and random-slopes GLMMs because of their generality as focal parameters for most applications and because of their immediate applicability to emerging questions in the field of behavioral ecology. We focus on the extreme case of hierarchically structured binomial data, though the framework presented here generalizes easily to any error distribution model. First, we determine the optimal ratio of individuals to repeated measures within individuals that maximizes power to detect differences by treatment in among-individual variation in intercept, among-individual variation in slope, and within-individual variation in intercept. Second, we explore how power to detect differences in target variance parameters is affected by total variation. Our results indicate heterogeneity in power across ratios of individuals to repeated measures with an optimal ratio determined by both the target variance parameter and total sample size. Additionally, power to detect each variance parameter was low overall (in most cases >1,000 total observations per treatment needed to achieve 80% power and decreased with increasing variance in non-target random effects. With growing interest in variance as the parameter of inquiry, these power analyses provide a crucial component for designing experiments focused on detecting differences in variance. We hope to inspire novel experimental designs in ecology and evolution investigating the causes and

False Operation of Static Random Access Memory Cells under Alternating Current Power Supply Voltage Variation

Science.gov (United States)

Sawada, Takuya; Takata, Hidehiro; Nii, Koji; Nagata, Makoto

2013-04-01

Static random access memory (SRAM) cores exhibit susceptibility against power supply voltage variation. False operation is investigated among SRAM cells under sinusoidal voltage variation on power lines introduced by direct RF power injection. A standard SRAM core of 16 kbyte in a 90 nm 1.5 V technology is diagnosed with built-in self test and on-die noise monitor techniques. The sensitivity of bit error rate is shown to be high against the frequency of injected voltage variation, while it is not greatly influenced by the difference in frequency and phase against SRAM clocking. It is also observed that the distribution of false bits is substantially random in a cell array.

A novel approach to generate random surface thermal loads in piping

Energy Technology Data Exchange (ETDEWEB)

Costa Garrido, Oriol, E-mail: oriol.costa@ijs.si; El Shawish, Samir; Cizelj, Leon

2014-07-01

Highlights: • Approach for generating continuous and time-dependent random thermal fields. • Temperature fields simulate fluid mixing thermal loads at fluid–wall interface. • Through plane-wave decomposition, experimental temperature statistics are reproduced. • Validation of the approach with a case study from literature. • Random surface thermal loads generation for future thermal fatigue analyses of piping. - Abstract: There is a need to perform three-dimensional mechanical analyses of pipes, subjected to complex thermo-mechanical loadings such as the ones evolving from turbulent fluid mixing in a T-junction. A novel approach is proposed in this paper for fast and reliable generation of random thermal loads at the pipe surface. The resultant continuous and time-dependent temperature fields simulate the fluid mixing thermal loads at the fluid–wall interface. The approach is based on reproducing discrete fluid temperature statistics, from experimental readings or computational fluid dynamic simulation's results, at interface locations through plane-wave decomposition of temperature fluctuations. The obtained random thermal fields contain large scale instabilities such as cold and hot spots traveling at flow velocities. These low frequency instabilities are believed to be among the major causes of the thermal fatigue in T-junction configurations. The case study found in the literature has been used to demonstrate the generation of random surface thermal loads. The thermal fields generated with the proposed approach are statistically equivalent (within the first two moments) to those from CFD simulations results of similar characteristics. The fields maintain the input data at field locations for a large set of parameters used to generate the thermal loads. This feature will be of great advantage in future sensitivity fatigue analyses of three-dimensional pipe structures.

A novel approach to generate random surface thermal loads in piping

International Nuclear Information System (INIS)

Costa Garrido, Oriol; El Shawish, Samir; Cizelj, Leon

2014-01-01

Highlights: • Approach for generating continuous and time-dependent random thermal fields. • Temperature fields simulate fluid mixing thermal loads at fluid–wall interface. • Through plane-wave decomposition, experimental temperature statistics are reproduced. • Validation of the approach with a case study from literature. • Random surface thermal loads generation for future thermal fatigue analyses of piping. - Abstract: There is a need to perform three-dimensional mechanical analyses of pipes, subjected to complex thermo-mechanical loadings such as the ones evolving from turbulent fluid mixing in a T-junction. A novel approach is proposed in this paper for fast and reliable generation of random thermal loads at the pipe surface. The resultant continuous and time-dependent temperature fields simulate the fluid mixing thermal loads at the fluid–wall interface. The approach is based on reproducing discrete fluid temperature statistics, from experimental readings or computational fluid dynamic simulation's results, at interface locations through plane-wave decomposition of temperature fluctuations. The obtained random thermal fields contain large scale instabilities such as cold and hot spots traveling at flow velocities. These low frequency instabilities are believed to be among the major causes of the thermal fatigue in T-junction configurations. The case study found in the literature has been used to demonstrate the generation of random surface thermal loads. The thermal fields generated with the proposed approach are statistically equivalent (within the first two moments) to those from CFD simulations results of similar characteristics. The fields maintain the input data at field locations for a large set of parameters used to generate the thermal loads. This feature will be of great advantage in future sensitivity fatigue analyses of three-dimensional pipe structures

The random signal generator of imitated nuclear radiation pulse

International Nuclear Information System (INIS)

Li Dongcang; Yang Lei; Yuan Shulin; Yang Yinghui; Zang Fujia

2007-01-01

Based in pseudo-random uniformity number, it produces random numbers of Gaussian distribution and exponential distribution by arithmetic. The hardware is the single-chip microcomputer of 89C51. Program language makes use of Keil C. The output pulse amplitude is Gaussian distribution, exponential distribution or uniformity distribution. Likewise, it has two mode or upwards two. The time alternation of output pulse is both periodic and exponential distribution. The generator has achieved output control of multi-mode distribution, imitated random characteristic of nuclear pulse in amplitude and in time. (authors)

DNA based random key generation and management for OTP encryption.

Science.gov (United States)

Zhang, Yunpeng; Liu, Xin; Sun, Manhui

2017-09-01

One-time pad (OTP) is a principle of key generation applied to the stream ciphering method which offers total privacy. The OTP encryption scheme has proved to be unbreakable in theory, but difficult to realize in practical applications. Because OTP encryption specially requires the absolute randomness of the key, its development has suffered from dense constraints. DNA cryptography is a new and promising technology in the field of information security. DNA chromosomes storing capabilities can be used as one-time pad structures with pseudo-random number generation and indexing in order to encrypt the plaintext messages. In this paper, we present a feasible solution to the OTP symmetric key generation and transmission problem with DNA at the molecular level. Through recombinant DNA technology, by using only sender-receiver known restriction enzymes to combine the secure key represented by DNA sequence and the T vector, we generate the DNA bio-hiding secure key and then place the recombinant plasmid in implanted bacteria for secure key transmission. The designed bio experiments and simulation results show that the security of the transmission of the key is further improved and the environmental requirements of key transmission are reduced. Analysis has demonstrated that the proposed DNA-based random key generation and management solutions are marked by high security and usability. Published by Elsevier B.V.

Random number generation based on digital differential chaos

KAUST Repository

Zidan, Mohammed A.; Radwan, Ahmed G.; Salama, Khaled N.

2012-01-01

In this paper, we present a fully digital differential chaos based random number generator. The output of the digital circuit is proved to be chaotic by calculating the output time series maximum Lyapunov exponent. We introduce a new post processing

Random number generators in support of Monte Carlo problems in physics

International Nuclear Information System (INIS)

Dyadkin, I.G.

1993-01-01

The ability to support a modern users' expectations of random number generators to solve problems in physics is analyzed. The capabilities of the newest concepts and the old pseudo-random algorithms are compared. The author is in favor of multiplicative generators. Due to the 64-bit arithmetic of a modern PC, multiplicative generators have a sufficient number of periods (up to 2 62 ) and are quicker to generate and to govern independent sequences for parallel processing. In addition they are able to replicate sub-sequences (without storing their seeds) for each standard trial in any code and to simulate spatial and planar directions and EXP(-x) distributions often needed as ''bricks'' for simulating events in physics. Hundreds of multipliers for multiplicative generators have been tabulated and tested, and the required speeds have been obtained. (author)

Quantum random number generator based on quantum nature of vacuum fluctuations

Science.gov (United States)

Ivanova, A. E.; Chivilikhin, S. A.; Gleim, A. V.

2017-11-01

Quantum random number generator (QRNG) allows obtaining true random bit sequences. In QRNG based on quantum nature of vacuum, optical beam splitter with two inputs and two outputs is normally used. We compare mathematical descriptions of spatial beam splitter and fiber Y-splitter in the quantum model for QRNG, based on homodyne detection. These descriptions were identical, that allows to use fiber Y-splitters in practical QRNG schemes, simplifying the setup. Also we receive relations between the input radiation and the resulting differential current in homodyne detector. We experimentally demonstrate possibility of true random bits generation by using QRNG based on homodyne detection with Y-splitter.

Random number generation based on digital differential chaos

KAUST Repository

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.

An empirical test of pseudo random number generators by means of an exponential decaying process

International Nuclear Information System (INIS)

Coronel B, H.F.; Hernandez M, A.R.; Jimenez M, M.A.; Mora F, L.E.

2007-01-01

Empirical tests for pseudo random number generators based on the use of processes or physical models have been successfully used and are considered as complementary to theoretical tests of randomness. In this work a statistical methodology for evaluating the quality of pseudo random number generators is presented. The method is illustrated in the context of the so-called exponential decay process, using some pseudo random number generators commonly used in physics. (Author)

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

The generation of 68 Gbps quantum random number by measuring laser phase fluctuations

International Nuclear Information System (INIS)

Nie, You-Qi; Liu, Yang; Zhang, Jun; Pan, Jian-Wei; Huang, Leilei; Payne, Frank

2015-01-01

The speed of a quantum random number generator is essential for practical applications, such as high-speed quantum key distribution systems. Here, we push the speed of a quantum random number generator to 68 Gbps by operating a laser around its threshold level. To achieve the rate, not only high-speed photodetector and high sampling rate are needed but also a very stable interferometer is required. A practical interferometer with active feedback instead of common temperature control is developed to meet the requirement of stability. Phase fluctuations of the laser are measured by the interferometer with a photodetector and then digitalized to raw random numbers with a rate of 80 Gbps. The min-entropy of the raw data is evaluated by modeling the system and is used to quantify the quantum randomness of the raw data. The bias of the raw data caused by other signals, such as classical and detection noises, can be removed by Toeplitz-matrix hashing randomness extraction. The final random numbers can pass through the standard randomness tests. Our demonstration shows that high-speed quantum random number generators are ready for practical usage

Generation of diurnal variation for influent data for dynamic simulation.

Science.gov (United States)

Langergraber, G; Alex, J; Weissenbacher, N; Woerner, D; Ahnert, M; Frehmann, T; Halft, N; Hobus, I; Plattes, M; Spering, V; Winkler, S

2008-01-01

When using dynamic simulation for fine tuning of the design of activated sludge (AS) plants diurnal variations of influent data are required. For this application usually only data from the design process and no measured data are available. In this paper a simple method to generate diurnal variations of wastewater flow and concentrations is described. The aim is to generate realistic influent data in terms of flow, concentrations and TKN/COD ratios and not to predict the influent of the AS plant in detail. The work has been prepared within the framework of HSG-Sim (Hochschulgruppe Simulation, http://www.hsgsim.org), a group of researchers from Germany, Austria, Luxembourg, Poland, the Netherlands and Switzerland. (c) IWA Publishing 2008.

True random number generation from mobile telephone photo based on chaotic cryptography

International Nuclear Information System (INIS)

Zhao Liang; Liao Xiaofeng; Xiao Di; Xiang Tao; Zhou Qing; Duan Shukai

2009-01-01

A cheap, convenient and universal TRNG based on mobile telephone photo for producing random bit sequence is proposed. To settle the problem of sequential pixels and comparability, three chaos-based approaches are applied to post-process the generated binary image. The random numbers produced by three users are tested using US NIST RNG statistical test software. The experimental results indicate that the Arnold cat map is the fastest way to generate a random bit sequence and can be accepted on general PC. The 'MASK' algorithm also performs well. Finally, comparing with the TRNG of Hu et al. [Hu Y, Liao X, Wong KW, Zhou Q. A true random number generator based on mouse movement and chaotic cryptography. Chaos, Solitons and Fractals 2007. doi: 10.1016/j.chaos.2007.10.022] which is presented by Hu et al., many merits of the proposed TRNG in this paper has been found.

On the design of henon and logistic map-based random number generator

Science.gov (United States)

Magfirawaty; Suryadi, M. T.; Ramli, Kalamullah

2017-10-01

The key sequence is one of the main elements in the cryptosystem. True Random Number Generators (TRNG) method is one of the approaches to generating the key sequence. The randomness source of the TRNG divided into three main groups, i.e. electrical noise based, jitter based and chaos based. The chaos based utilizes a non-linear dynamic system (continuous time or discrete time) as an entropy source. In this study, a new design of TRNG based on discrete time chaotic system is proposed, which is then simulated in LabVIEW. The principle of the design consists of combining 2D and 1D chaotic systems. A mathematical model is implemented for numerical simulations. We used comparator process as a harvester method to obtain the series of random bits. Without any post processing, the proposed design generated random bit sequence with high entropy value and passed all NIST 800.22 statistical tests.

Problems with the random number generator RANF implemented on the CDC cyber 205

Science.gov (United States)

Kalle, Claus; Wansleben, Stephan

1984-10-01

We show that using RANF may lead to wrong results when lattice models are simulated by Monte Carlo methods. We present a shift-register sequence random number generator which generates two random numbers per cycle on a two pipe CDC Cyber 205.

PUFKEY: A High-Security and High-Throughput Hardware True Random Number Generator for Sensor Networks

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.

PUFKEY: a high-security and high-throughput hardware true random number generator for sensor networks.

Science.gov (United States)

Li, Dongfang; Lu, Zhaojun; Zou, Xuecheng; Liu, Zhenglin

2015-10-16

Random number generators (RNG) play an important role in many sensor network systems and applications, such as those requiring secure and robust communications. In this paper, we develop a high-security and high-throughput hardware true random number generator, called PUFKEY, which consists of two kinds of physical unclonable function (PUF) elements. Combined with a conditioning algorithm, true random seeds are extracted from the noise on the start-up pattern of SRAM memories. These true random seeds contain full entropy. Then, the true random seeds are used as the input for a non-deterministic hardware RNG to generate a stream of true random bits with a throughput as high as 803 Mbps. The experimental results show that the bitstream generated by the proposed PUFKEY can pass all standard national institute of standards and technology (NIST) randomness tests and is resilient to a wide range of security attacks.

A fast random number generator for the Intel Paragon supercomputer

Science.gov (United States)

Gutbrod, F.

1995-06-01

A pseudo-random number generator is presented which makes optimal use of the architecture of the i860-microprocessor and which is expected to have a very long period. It is therefore a good candidate for use on the parallel supercomputer Paragon XP. In the assembler version, it needs 6.4 cycles for a real∗4 random number. There is a FORTRAN routine which yields identical numbers up to rare and minor rounding discrepancies, and it needs 28 cycles. The FORTRAN performance on other microprocessors is somewhat better. Arguments for the quality of the generator and some numerical tests are given.

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

Directory of Open Access Journals (Sweden)

Han Shuangshuang

2013-07-01

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

High-Speed Device-Independent Quantum Random Number Generation without a Detection Loophole

Science.gov (United States)

Liu, Yang; Yuan, Xiao; Li, Ming-Han; Zhang, Weijun; Zhao, Qi; Zhong, Jiaqiang; Cao, Yuan; Li, Yu-Huai; Chen, Luo-Kan; Li, Hao; Peng, Tianyi; Chen, Yu-Ao; Peng, Cheng-Zhi; Shi, Sheng-Cai; Wang, Zhen; You, Lixing; Ma, Xiongfeng; Fan, Jingyun; Zhang, Qiang; Pan, Jian-Wei

2018-01-01

Quantum mechanics provides the means of generating genuine randomness that is impossible with deterministic classical processes. Remarkably, the unpredictability of randomness can be certified in a manner that is independent of implementation devices. Here, we present an experimental study of device-independent quantum random number generation based on a detection-loophole-free Bell test with entangled photons. In the randomness analysis, without the independent identical distribution assumption, we consider the worst case scenario that the adversary launches the most powerful attacks against the quantum adversary. After considering statistical fluctuations and applying an 80 Gb ×45.6 Mb Toeplitz matrix hashing, we achieve a final random bit rate of 114 bits /s , with a failure probability less than 10-5. This marks a critical step towards realistic applications in cryptography and fundamental physics tests.

Quantum random bit generation using energy fluctuations in stimulated Raman scattering.

Science.gov (United States)

Bustard, Philip J; England, Duncan G; Nunn, Josh; Moffatt, Doug; Spanner, Michael; Lausten, Rune; Sussman, Benjamin J

2013-12-02

Random number sequences are a critical resource in modern information processing systems, with applications in cryptography, numerical simulation, and data sampling. We introduce a quantum random number generator based on the measurement of pulse energy quantum fluctuations in Stokes light generated by spontaneously-initiated stimulated Raman scattering. Bright Stokes pulse energy fluctuations up to five times the mean energy are measured with fast photodiodes and converted to unbiased random binary strings. Since the pulse energy is a continuous variable, multiple bits can be extracted from a single measurement. Our approach can be generalized to a wide range of Raman active materials; here we demonstrate a prototype using the optical phonon line in bulk diamond.

Random field assessment of nanoscopic inhomogeneity of bone.

Science.gov (United States)

Dong, X Neil; Luo, Qing; Sparkman, Daniel M; Millwater, Harry R; Wang, Xiaodu

2010-12-01

Bone quality is significantly correlated with the inhomogeneous distribution of material and ultrastructural properties (e.g., modulus and mineralization) of the tissue. Current techniques for quantifying inhomogeneity consist of descriptive statistics such as mean, standard deviation and coefficient of variation. However, these parameters do not describe the spatial variations of bone properties. The objective of this study was to develop a novel statistical method to characterize and quantitatively describe the spatial variation of bone properties at ultrastructural levels. To do so, a random field defined by an exponential covariance function was used to represent the spatial uncertainty of elastic modulus by delineating the correlation of the modulus at different locations in bone lamellae. The correlation length, a characteristic parameter of the covariance function, was employed to estimate the fluctuation of the elastic modulus in the random field. Using this approach, two distribution maps of the elastic modulus within bone lamellae were generated using simulation and compared with those obtained experimentally by a combination of atomic force microscopy and nanoindentation techniques. The simulation-generated maps of elastic modulus were in close agreement with the experimental ones, thus validating the random field approach in defining the inhomogeneity of elastic modulus in lamellae of bone. Indeed, generation of such random fields will facilitate multi-scale modeling of bone in more pragmatic details. Copyright © 2010 Elsevier Inc. All rights reserved.

Horizontal transfer generates genetic variation in an asexual pathogen

Directory of Open Access Journals (Sweden)

Xiaoqiu Huang

2014-10-01

Full Text Available There are major gaps in the understanding of how genetic variation is generated in the asexual pathogen Verticillium dahliae. On the one hand, V. dahliae is a haploid organism that reproduces clonally. On the other hand, single-nucleotide polymorphisms and chromosomal rearrangements were found between V. dahliae strains. Lineage-specific (LS regions comprising about 5% of the genome are highly variable between V. dahliae strains. Nonetheless, it is unknown whether horizontal gene transfer plays a major role in generating genetic variation in V. dahliae. Here, we analyzed a previously sequenced V. dahliae population of nine strains from various geographical locations and hosts. We found highly homologous elements in LS regions of each strain; LS regions of V. dahliae strain JR2 are much richer in highly homologous elements than the core genome. In addition, we discovered, in LS regions of JR2, several structural forms of nonhomologous recombination, and two or three homologous sequence types of each form, with almost each sequence type present in an LS region of another strain. A large section of one of the forms is known to be horizontally transferred between V. dahliae strains. We unexpectedly found that 350 kilobases of dynamic LS regions were much more conserved than the core genome between V. dahliae and a closely related species (V. albo-atrum, suggesting that these LS regions were horizontally transferred recently. Our results support the view that genetic variation in LS regions is generated by horizontal transfer between strains, and by chromosomal reshuffling reported previously.

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

International Nuclear Information System (INIS)

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

2014-01-01

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

Probabilistic generation of random networks taking into account information on motifs occurrence.

Science.gov (United States)

Bois, Frederic Y; Gayraud, Ghislaine

2015-01-01

Because of the huge number of graphs possible even with a small number of nodes, inference on network structure is known to be a challenging problem. Generating large random directed graphs with prescribed probabilities of occurrences of some meaningful patterns (motifs) is also difficult. We show how to generate such random graphs according to a formal probabilistic representation, using fast Markov chain Monte Carlo methods to sample them. As an illustration, we generate realistic graphs with several hundred nodes mimicking a gene transcription interaction network in Escherichia coli.

Study of Randomness in AES Ciphertexts Produced by Randomly Generated S-Boxes and S-Boxes with Various Modulus and Additive Constant Polynomials

Science.gov (United States)

Das, Suman; Sadique Uz Zaman, J. K. M.; Ghosh, Ranjan

2016-06-01

In Advanced Encryption Standard (AES), the standard S-Box is conventionally generated by using a particular irreducible polynomial {11B} in GF(28) as the modulus and a particular additive constant polynomial {63} in GF(2), though it can be generated by many other polynomials. In this paper, it has been shown that it is possible to generate secured AES S-Boxes by using some other selected modulus and additive polynomials and also can be generated randomly, using a PRNG like BBS. A comparative study has been made on the randomness of corresponding AES ciphertexts generated, using these S-Boxes, by the NIST Test Suite coded for this paper. It has been found that besides using the standard one, other moduli and additive constants are also able to generate equally or better random ciphertexts; the same is true for random S-Boxes also. As these new types of S-Boxes are user-defined, hence unknown, they are able to prevent linear and differential cryptanalysis. Moreover, they act as additional key-inputs to AES, thus increasing the key-space.

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

Science.gov (United States)

Wikramaratna, R. S.

1989-07-01

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

An On-Demand Optical Quantum Random Number Generator with In-Future Action and Ultra-Fast Response.

Science.gov (United States)

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.

Ultra-fast quantum randomness generation by accelerated phase diffusion in a pulsed laser diode.

Science.gov (United States)

Abellán, C; Amaya, W; Jofre, M; Curty, M; Acín, A; Capmany, J; Pruneri, V; Mitchell, M W

2014-01-27

We demonstrate a high bit-rate quantum random number generator by interferometric detection of phase diffusion in a gain-switched DFB laser diode. Gain switching at few-GHz frequencies produces a train of bright pulses with nearly equal amplitudes and random phases. An unbalanced Mach-Zehnder interferometer is used to interfere subsequent pulses and thereby generate strong random-amplitude pulses, which are detected and digitized to produce a high-rate random bit string. Using established models of semiconductor laser field dynamics, we predict a regime of high visibility interference and nearly complete vacuum-fluctuation-induced phase diffusion between pulses. These are confirmed by measurement of pulse power statistics at the output of the interferometer. Using a 5.825 GHz excitation rate and 14-bit digitization, we observe 43 Gbps quantum randomness generation.

On the Periods of the {ranshi} Random Number Generator

Science.gov (United States)

Gutbrod, F.

The stochastic properties of the pseudo-random number generator {ranshi} are discussed, with emphasis on the average period. Within a factor 2 this turns out to be the root of the maximally possible period. The actual set of periods depends on minor details of the algorithm, and the system settles down in one of only a few different cycles. These features are in perfect agreement with absolute random motion in phase space, to the extent allowed by deterministic dynamics.

Surface texture generation during cylindrical milling in the aspect of cutting force variations

International Nuclear Information System (INIS)

Wojciechowski, S; Twardowski, P; Pelic, M

2014-01-01

The work presented here concentrates on surface texture analysis, after cylindrical milling of hardened steel. Cutting force variations occurring in the machining process have direct influence on the cutter displacements and thus on the generated surface texture. Therefore, in these experiments, the influence of active number of teeth (z c ) on the cutting force variations was investigated. Cutting forces and cutter displacements were measured during machining process (online) using, namely piezoelectric force dynamometer and 3D laser vibrometer. Surface roughness parameters were measured using stylus surface profiler. The surface roughness model including cutting parameters (f z , D) and cutting force variations was also developed. The research revealed that in cylindrical milling process, cutting force variations have immediate influence on surface texture generation

Note: Fully integrated 3.2 Gbps quantum random number generator with real-time extraction

International Nuclear Information System (INIS)

Zhang, Xiao-Guang; Nie, You-Qi; Liang, Hao; Zhang, Jun; Pan, Jian-Wei; Zhou, Hongyi; Ma, Xiongfeng

2016-01-01

We present a real-time and fully integrated quantum random number generator (QRNG) by measuring laser phase fluctuations. The QRNG scheme based on laser phase fluctuations is featured for its capability of generating ultra-high-speed random numbers. However, the speed bottleneck of a practical QRNG lies on the limited speed of randomness extraction. To close the gap between the fast randomness generation and the slow post-processing, we propose a pipeline extraction algorithm based on Toeplitz matrix hashing and implement it in a high-speed field-programmable gate array. Further, all the QRNG components are integrated into a module, including a compact and actively stabilized interferometer, high-speed data acquisition, and real-time data post-processing and transmission. The final generation rate of the QRNG module with real-time extraction can reach 3.2 Gbps.

Note: Fully integrated 3.2 Gbps quantum random number generator with real-time extraction

Energy Technology Data Exchange (ETDEWEB)

Zhang, Xiao-Guang; Nie, You-Qi; Liang, Hao; Zhang, Jun, E-mail: zhangjun@ustc.edu.cn; Pan, Jian-Wei [Hefei National Laboratory for Physical Sciences at the Microscale and Department of Modern Physics, University of Science and Technology of China, Hefei, Anhui 230026 (China); CAS Center for Excellence and Synergetic Innovation Center in Quantum Information and Quantum Physics, University of Science and Technology of China, Hefei, Anhui 230026 (China); Zhou, Hongyi; Ma, Xiongfeng [Center for Quantum Information, Institute for Interdisciplinary Information Sciences, Tsinghua University, Beijing 100084 (China)

2016-07-15

We present a real-time and fully integrated quantum random number generator (QRNG) by measuring laser phase fluctuations. The QRNG scheme based on laser phase fluctuations is featured for its capability of generating ultra-high-speed random numbers. However, the speed bottleneck of a practical QRNG lies on the limited speed of randomness extraction. To close the gap between the fast randomness generation and the slow post-processing, we propose a pipeline extraction algorithm based on Toeplitz matrix hashing and implement it in a high-speed field-programmable gate array. Further, all the QRNG components are integrated into a module, including a compact and actively stabilized interferometer, high-speed data acquisition, and real-time data post-processing and transmission. The final generation rate of the QRNG module with real-time extraction can reach 3.2 Gbps.

25 CFR 547.14 - What are the minimum technical standards for electronic random number generation?

Science.gov (United States)

2010-04-01

... random number generation? 547.14 Section 547.14 Indians NATIONAL INDIAN GAMING COMMISSION, DEPARTMENT OF... CLASS II GAMES § 547.14 What are the minimum technical standards for electronic random number generation...) Unpredictability; and (3) Non-repeatability. (b) Statistical Randomness.(1) Numbers produced by an RNG shall be...

Digital-Analog Hybrid Scheme and Its Application to Chaotic Random Number Generators

Science.gov (United States)

Yuan, Zeshi; Li, Hongtao; Miao, Yunchi; Hu, Wen; Zhu, Xiaohua

2017-12-01

Practical random number generation (RNG) circuits are typically achieved with analog devices or digital approaches. Digital-based techniques, which use field programmable gate array (FPGA) and graphics processing units (GPU) etc. usually have better performances than analog methods as they are programmable, efficient and robust. However, digital realizations suffer from the effect of finite precision. Accordingly, the generated random numbers (RNs) are actually periodic instead of being real random. To tackle this limitation, in this paper we propose a novel digital-analog hybrid scheme that employs the digital unit as the main body, and minimum analog devices to generate physical RNs. Moreover, the possibility of realizing the proposed scheme with only one memory element is discussed. Without loss of generality, we use the capacitor and the memristor along with FPGA to construct the proposed hybrid system, and a chaotic true random number generator (TRNG) circuit is realized, producing physical RNs at a throughput of Gbit/s scale. These RNs successfully pass all the tests in the NIST SP800-22 package, confirming the significance of the scheme in practical applications. In addition, the use of this new scheme is not restricted to RNGs, and it also provides a strategy to solve the effect of finite precision in other digital systems.

Hardware implementation of a GFSR pseudo-random number generator

Science.gov (United States)

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

1989-12-01

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

Quantum random number generator based on quantum tunneling effect

OpenAIRE

Zhou, Haihan; Li, Junlin; Pan, Dong; Zhang, Weixing; Long, Guilu

2017-01-01

In this paper, we proposed an experimental implementation of quantum random number generator(QRNG) with inherent randomness of quantum tunneling effect of electrons. We exploited InGaAs/InP diodes, whose valance band and conduction band shared a quasi-constant energy barrier. We applied a bias voltage on the InGaAs/InP avalanche diode, which made the diode works under Geiger mode, and triggered the tunneling events with a periodic pulse. Finally, after data collection and post-processing, our...

Robust random number generation using steady-state emission of gain-switched laser diodes

International Nuclear Information System (INIS)

Yuan, Z. L.; Lucamarini, M.; Dynes, J. F.; Fröhlich, B.; Plews, A.; Shields, A. J.

2014-01-01

We demonstrate robust, high-speed random number generation using interference of the steady-state emission of guaranteed random phases, obtained through gain-switching a semiconductor laser diode. Steady-state emission tolerates large temporal pulse misalignments and therefore significantly improves the interference quality. Using an 8-bit digitizer followed by a finite-impulse-response unbiasing algorithm, we achieve random number generation rates of 8 and 20 Gb/s, for laser repetition rates of 1 and 2.5 GHz, respectively, with a ±20% tolerance in the interferometer differential delay. We also report a generation rate of 80 Gb/s using partially phase-correlated short pulses. In relation to the field of quantum key distribution, our results confirm the gain-switched laser diode as a suitable light source, capable of providing phase-randomized coherent pulses at a clock rate of up to 2.5 GHz.

Variation in commercial smoking mixtures containing third-generation synthetic cannabinoids.

Science.gov (United States)

Frinculescu, Anca; Lyall, Catherine L; Ramsey, John; Miserez, Bram

2017-02-01

Variation in ingredients (qualitative variation) and in quantity of active compounds (quantitative variation) in herbal smoking mixtures containing synthetic cannabinoids has been shown for older products. This can be dangerous to the user, as accurate and reproducible dosing is impossible. In this study, 69 packages containing third-generation cannabinoids of seven brands on the UK market in 2014 were analyzed both qualitatively and quantitatively for variation. When comparing the labels to actual active ingredients identified in the sample, only one brand was shown to be correctly labelled. The other six brands contained less, more, or ingredients other than those listed on the label. Only two brands were inconsistent, containing different active ingredients in different samples. Quantitative variation was assessed both within one package and between several packages. Within-package variation was within a 10% range for five of the seven brands, but two brands showed larger variation, up to 25% (Relative Standard Deviation). Variation between packages was significantly higher, with variation up to 38% and maximum concentration up to 2.7 times higher than the minimum concentration. Both qualitative and quantitative variation are common in smoking mixtures and endanger the user, as it is impossible to estimate the dose or to know the compound consumed when smoking commercial mixtures. Copyright © 2016 John Wiley & Sons, Ltd. Copyright © 2016 John Wiley & Sons, Ltd.

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

Science.gov (United States)

Demchik, Vadim

2011-03-01

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

Theoretical and empirical convergence results for additive congruential random number generators

Science.gov (United States)

Wikramaratna, Roy S.

2010-03-01

Additive Congruential Random Number (ACORN) generators represent an approach to generating uniformly distributed pseudo-random numbers that is straightforward to implement efficiently for arbitrarily large order and modulus; if it is implemented using integer arithmetic, it becomes possible to generate identical sequences on any machine. This paper briefly reviews existing results concerning ACORN generators and relevant theory concerning sequences that are well distributed mod 1 in k dimensions. It then demonstrates some new theoretical results for ACORN generators implemented in integer arithmetic with modulus M=2[mu] showing that they are a family of generators that converge (in a sense that is defined in the paper) to being well distributed mod 1 in k dimensions, as [mu]=log2M tends to infinity. By increasing k, it is possible to increase without limit the number of dimensions in which the resulting sequences approximate to well distributed. The paper concludes by applying the standard TestU01 test suite to ACORN generators for selected values of the modulus (between 260 and 2150), the order (between 4 and 30) and various odd seed values. On the basis of these and earlier results, it is recommended that an order of at least 9 be used together with an odd seed and modulus equal to 230p, for a small integer value of p. While a choice of p=2 should be adequate for most typical applications, increasing p to 3 or 4 gives a sequence that will consistently pass all the tests in the TestU01 test suite, giving additional confidence in more demanding applications. The results demonstrate that the ACORN generators are a reliable source of uniformly distributed pseudo-random numbers, and that in practice (as suggested by the theoretical convergence results) the quality of the ACORN sequences increases with increasing modulus and order.

Fortran code for generating random probability vectors, unitaries, and quantum states

Directory of Open Access Journals (Sweden)

Jonas eMaziero

2016-03-01

Full Text Available The usefulness of generating random configurations is recognized in many areas of knowledge. Fortran was born for scientific computing and has been one of the main programming languages in this area since then. And several ongoing projects targeting towards its betterment indicate that it will keep this status in the decades to come. In this article, we describe Fortran codes produced, or organized, for the generation of the following random objects: numbers, probability vectors, unitary matrices, and quantum state vectors and density matrices. Some matrix functions are also included and may be of independent interest.

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

Science.gov (United States)

Chen, Nelson G

2016-08-01

Requiring that randomly generated chemical fingerprint libraries have unique fingerprints such that no two fingerprints are identical causes a systematic skew in bit occurrence frequencies, the proportion at which specified bits are set. Observed frequencies (O) at which each bit is set within the resulting libraries systematically differ from frequencies at which bits are set at fingerprint generation (E). Observed frequencies systematically skew toward 0.5, with the effect being more pronounced as library size approaches the compound space, which is the total number of unique possible fingerprints given the number of bit positions each fingerprint contains. The effect is quantified for varying library sizes as a fraction of the overall compound space, and for changes in the specified frequency E. The cause and implications for this systematic skew are subsequently discussed. When generating random libraries of chemical fingerprints, the imposition of a uniqueness requirement should either be avoided or taken into account.

A universal algorithm to generate pseudo-random numbers based on uniform mapping as homeomorphism

International Nuclear Information System (INIS)

Fu-Lai, Wang

2010-01-01

A specific uniform map is constructed as a homeomorphism mapping chaotic time series into [0,1] to obtain sequences of standard uniform distribution. With the uniform map, a chaotic orbit and a sequence orbit obtained are topologically equivalent to each other so the map can preserve the most dynamic properties of chaotic systems such as permutation entropy. Based on the uniform map, a universal algorithm to generate pseudo random numbers is proposed and the pseudo random series is tested to follow the standard 0–1 random distribution both theoretically and experimentally. The algorithm is not complex, which does not impose high requirement on computer hard ware and thus computation speed is fast. The method not only extends the parameter spaces but also avoids the drawback of small function space caused by constraints on chaotic maps used to generate pseudo random numbers. The algorithm can be applied to any chaotic system and can produce pseudo random sequence of high quality, thus can be a good universal pseudo random number generator. (general)

A universal algorithm to generate pseudo-random numbers based on uniform mapping as homeomorphism

Science.gov (United States)

Wang, Fu-Lai

2010-09-01

A specific uniform map is constructed as a homeomorphism mapping chaotic time series into [0,1] to obtain sequences of standard uniform distribution. With the uniform map, a chaotic orbit and a sequence orbit obtained are topologically equivalent to each other so the map can preserve the most dynamic properties of chaotic systems such as permutation entropy. Based on the uniform map, a universal algorithm to generate pseudo random numbers is proposed and the pseudo random series is tested to follow the standard 0-1 random distribution both theoretically and experimentally. The algorithm is not complex, which does not impose high requirement on computer hard ware and thus computation speed is fast. The method not only extends the parameter spaces but also avoids the drawback of small function space caused by constraints on chaotic maps used to generate pseudo random numbers. The algorithm can be applied to any chaotic system and can produce pseudo random sequence of high quality, thus can be a good universal pseudo random number generator.

Very high performance pseudo-random number generation on DAP

Science.gov (United States)

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

1985-07-01

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

Minimal-post-processing 320-Gbps true random bit generation using physical white chaos.

Science.gov (United States)

Wang, Anbang; Wang, Longsheng; Li, Pu; Wang, Yuncai

2017-02-20

Chaotic external-cavity semiconductor laser (ECL) is a promising entropy source for generation of high-speed physical random bits or digital keys. The rate and randomness is unfortunately limited by laser relaxation oscillation and external-cavity resonance, and is usually improved by complicated post processing. Here, we propose using a physical broadband white chaos generated by optical heterodyning of two ECLs as entropy source to construct high-speed random bit generation (RBG) with minimal post processing. The optical heterodyne chaos not only has a white spectrum without signature of relaxation oscillation and external-cavity resonance but also has a symmetric amplitude distribution. Thus, after quantization with a multi-bit analog-digital-convertor (ADC), random bits can be obtained by extracting several least significant bits (LSBs) without any other processing. In experiments, a white chaos with a 3-dB bandwidth of 16.7 GHz is generated. Its entropy rate is estimated as 16 Gbps by single-bit quantization which means a spectrum efficiency of 96%. With quantization using an 8-bit ADC, 320-Gbps physical RBG is achieved by directly extracting 4 LSBs at 80-GHz sampling rate.

Generation of correlated finite alphabet waveforms using gaussian random variables

KAUST Repository

Jardak, Seifallah

2014-09-01

Correlated waveforms have a number of applications in different fields, such as radar and communication. It is very easy to generate correlated waveforms using infinite alphabets, but for some of the applications, it is very challenging to use them in practice. Moreover, to generate infinite alphabet constant envelope correlated waveforms, the available research uses iterative algorithms, which are computationally very expensive. In this work, we propose simple novel methods to generate correlated waveforms using finite alphabet constant and non-constant-envelope symbols. To generate finite alphabet waveforms, the proposed method map the Gaussian random variables onto the phase-shift-keying, pulse-amplitude, and quadrature-amplitude modulation schemes. For such mapping, the probability-density-function of Gaussian random variables is divided into M regions, where M is the number of alphabets in the corresponding modulation scheme. By exploiting the mapping function, the relationship between the cross-correlation of Gaussian and finite alphabet symbols is derived. To generate equiprobable symbols, the area of each region is kept same. If the requirement is to have each symbol with its own unique probability, the proposed scheme allows us that as well. Although, the proposed scheme is general, the main focus of this paper is to generate finite alphabet waveforms for multiple-input multiple-output radar, where correlated waveforms are used to achieve desired beampatterns. © 2014 IEEE.

Guidelines for random excitation forces due to cross flow in steam generators

Energy Technology Data Exchange (ETDEWEB)

Taylor, C.E.; Pettigrew, M.J. [Atomic Energy of Canada Limited, Chalk River, Ontario (Canada)

1998-07-01

Random excitation forces can cause low-amplitude tube motion that will result in long-term fretting-wear or fatigue. To prevent these tube failures in steam generators and other heat exchangers, designers and trouble-shooters must have guidelines that incorporate random or turbulent fluid forces. Experiments designed to measure fluid forces have been carried out at Chalk River Laboratories and at other labs around the world. The data from these experiments have been studied and collated to determine suitable guidelines for random excitation forces. In this paper, a guideline for random excitation forces in single-phase cross flow is presented in the form of normalised spectra that are applicable to a wide range of flow conditions and tube frequencies. In particular, the experimental results used in this study were carried out over the full range of flow conditions found in a nuclear steam generator. The proposed guidelines are applicable to steam generators, condensers, reheaters and other shell-and-tube heat exchangers. They may be used for flow-induced vibration analysis of new or existing components, as input to vibration analysis computer codes and as specifications in procurement documents. (author)

Guidelines for random excitation forces due to cross flow in steam generators

International Nuclear Information System (INIS)

Taylor, C.E.; Pettigrew, M.J.

1998-01-01

Random excitation forces can cause low-amplitude tube motion that will result in long-term fretting-wear or fatigue. To prevent these tube failures in steam generators and other heat exchangers, designers and trouble-shooters must have guidelines that incorporate random or turbulent fluid forces. Experiments designed to measure fluid forces have been carried out at Chalk River Laboratories and at other labs around the world. The data from these experiments have been studied and collated to determine suitable guidelines for random excitation forces. In this paper, a guideline for random excitation forces in single-phase cross flow is presented in the form of normalised spectra that are applicable to a wide range of flow conditions and tube frequencies. In particular, the experimental results used in this study were carried out over the full range of flow conditions found in a nuclear steam generator. The proposed guidelines are applicable to steam generators, condensers, reheaters and other shell-and-tube heat exchangers. They may be used for flow-induced vibration analysis of new or existing components, as input to vibration analysis computer codes and as specifications in procurement documents. (author)

Standard random number generation for MBASIC

Science.gov (United States)

Tausworthe, R. C.

1976-01-01

A machine-independent algorithm is presented and analyzed for generating pseudorandom numbers suitable for the standard MBASIC system. The algorithm used is the polynomial congruential or linear recurrence modulo 2 method. Numbers, formed as nonoverlapping adjacent 28-bit words taken from the bit stream produced by the formula a sub m + 532 = a sub m + 37 + a sub m (modulo 2), do not repeat within the projected age of the solar system, show no ensemble correlation, exhibit uniform distribution of adjacent numbers up to 19 dimensions, and do not deviate from random runs-up and runs-down behavior.

Experimentally Generated Random Numbers Certified by the Impossibility of Superluminal Signaling

Science.gov (United States)

Bierhorst, Peter; Shalm, Lynden K.; Mink, Alan; Jordan, Stephen; Liu, Yi-Kai; Rommal, Andrea; Glancy, Scott; Christensen, Bradley; Nam, Sae Woo; Knill, Emanuel

Random numbers are an important resource for applications such as numerical simulation and secure communication. However, it is difficult to certify whether a physical random number generator is truly unpredictable. Here, we exploit the phenomenon of quantum nonlocality in a loophole-free photonic Bell test experiment to obtain data containing randomness that cannot be predicted by any theory that does not also allow the sending of signals faster than the speed of light. To certify and quantify the randomness, we develop a new protocol that performs well in an experimental regime characterized by low violation of Bell inequalities. Applying an extractor function to our data, we obtain 256 new random bits, uniform to within 10- 3 .

Towards the generation of random bits at terahertz rates based on a chaotic semiconductor laser

International Nuclear Information System (INIS)

Kanter, Ido; Aviad, Yaara; Reidler, Igor; Cohen, Elad; Rosenbluh, Michael

2010-01-01

Random bit generators (RBGs) are important in many aspects of statistical physics and crucial in Monte-Carlo simulations, stochastic modeling and quantum cryptography. The quality of a RBG is measured by the unpredictability of the bit string it produces and the speed at which the truly random bits can be generated. Deterministic algorithms generate pseudo-random numbers at high data rates as they are only limited by electronic hardware speed, but their unpredictability is limited by the very nature of their deterministic origin. It is widely accepted that the core of any true RBG must be an intrinsically non-deterministic physical process, e.g. measuring thermal noise from a resistor. Owing to low signal levels, such systems are highly susceptible to bias, introduced by amplification, and to small nonrandom external perturbations resulting in a limited generation rate, typically less than 100M bit/s. We present a physical random bit generator, based on a chaotic semiconductor laser, having delayed optical feedback, which operates reliably at rates up to 300Gbit/s. The method uses a high derivative of the digitized chaotic laser intensity and generates the random sequence by retaining a number of the least significant bits of the high derivative value. The method is insensitive to laser operational parameters and eliminates the necessity for all external constraints such as incommensurate sampling rates and laser external cavity round trip time. The randomness of long bit strings is verified by standard statistical tests.

Towards the generation of random bits at terahertz rates based on a chaotic semiconductor laser

Science.gov (United States)

Kanter, Ido; Aviad, Yaara; Reidler, Igor; Cohen, Elad; Rosenbluh, Michael

2010-06-01

Random bit generators (RBGs) are important in many aspects of statistical physics and crucial in Monte-Carlo simulations, stochastic modeling and quantum cryptography. The quality of a RBG is measured by the unpredictability of the bit string it produces and the speed at which the truly random bits can be generated. Deterministic algorithms generate pseudo-random numbers at high data rates as they are only limited by electronic hardware speed, but their unpredictability is limited by the very nature of their deterministic origin. It is widely accepted that the core of any true RBG must be an intrinsically non-deterministic physical process, e.g. measuring thermal noise from a resistor. Owing to low signal levels, such systems are highly susceptible to bias, introduced by amplification, and to small nonrandom external perturbations resulting in a limited generation rate, typically less than 100M bit/s. We present a physical random bit generator, based on a chaotic semiconductor laser, having delayed optical feedback, which operates reliably at rates up to 300Gbit/s. The method uses a high derivative of the digitized chaotic laser intensity and generates the random sequence by retaining a number of the least significant bits of the high derivative value. The method is insensitive to laser operational parameters and eliminates the necessity for all external constraints such as incommensurate sampling rates and laser external cavity round trip time. The randomness of long bit strings is verified by standard statistical tests.

The generation of random directed networks with prescribed 1-node and 2-node degree correlations

International Nuclear Information System (INIS)

Zamora-Lopez, Gorka; Kurths, Juergen; Zhou Changsong; Zlatic, Vinko

2008-01-01

The generation of random networks is a very common problem in complex network research. In this paper, we have studied the correlation nature of several real networks and found that, typically, a large number of links are deterministic, i.e. they cannot be randomized. This finding permits fast generation of ensembles of maximally random networks with prescribed 1-node and 2-node degree correlations. When the introduction of self-loops or multiple-links are not desired, random network generation methods typically reach blocked states. Here, a mechanism is proposed, the 'force-and-drop' method, to overcome such states. Our algorithm can be easily simplified for undirected graphs and reduced to account for any subclass of 2-node degree correlations

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

Directory of Open Access Journals (Sweden)

Lawnik Marcin

2018-02-01

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

Study On In Vitro Variation Generation Of Cymbidium Labell Anna Belle By Gamma Co-60 Irradiation

International Nuclear Information System (INIS)

Nguyen Huynh Phuong Uyen; Vo Thi Thu Ha; Le Quang Luan

2011-01-01

Radiation ionization is one of useful methods for mutation breeding of plants. In this study, γ-ray (Co-60) was used for generating morphological variations of Cymbidium Labell Anna Belle. The lethal doses of 50% samples (LD 50 ) after 4 months cultivation were determined at 35.0 Gy for protocorm like bodies (PLBs), 37.4 Gy for in vitro shoot bubs and 70.1 Gy for plantlets. PLBs were found as suitable samples for generation of variation of mentioned Cymbidium. The dose range from 20 to 50 Gy was determined with a high ability of variation on C. Labell Anna Belle. The highest frequency of variation was obtained ca. 3.82 x 10 -3 at the dose of 30 Gy. 157 in vitro variant plantlets were selected in M 1 V 1 generation, among variations, the variations were mainly found with 5 following types: removal of chlorophyll (8 plantlets), the leaves become shorter (64 plantlets), the leaves become longer (64 plantlets), increase of leaf number (11 plantlets) and the colour of pericardium was changed from green into violet (10 plantlets). Twenty one variant lines were selected in M 1 V 2 generation. (author)

The generation of random directed networks with prescribed 1-node and 2-node degree correlations

Energy Technology Data Exchange (ETDEWEB)

Zamora-Lopez, Gorka; Kurths, Juergen [Institute of Physics, University of Potsdam, PO Box 601553, 14415 Potsdam (Germany); Zhou Changsong [Department of Physics, Hong Kong Baptist University, Kowloon Tong, Hong Kong (China); Zlatic, Vinko [Rudjer Boskovic Institute, PO Box 180, HR-10002 Zagreb (Croatia)

2008-06-06

The generation of random networks is a very common problem in complex network research. In this paper, we have studied the correlation nature of several real networks and found that, typically, a large number of links are deterministic, i.e. they cannot be randomized. This finding permits fast generation of ensembles of maximally random networks with prescribed 1-node and 2-node degree correlations. When the introduction of self-loops or multiple-links are not desired, random network generation methods typically reach blocked states. Here, a mechanism is proposed, the 'force-and-drop' method, to overcome such states. Our algorithm can be easily simplified for undirected graphs and reduced to account for any subclass of 2-node degree correlations.

Experimental study of a quantum random-number generator based on two independent lasers

Science.gov (United States)

Sun, Shi-Hai; Xu, Feihu

2017-12-01

A quantum random-number generator (QRNG) can produce true randomness by utilizing the inherent probabilistic nature of quantum mechanics. Recently, the spontaneous-emission quantum phase noise of the laser has been widely deployed for quantum random-number generation, due to its high rate, its low cost, and the feasibility of chip-scale integration. Here, we perform a comprehensive experimental study of a phase-noise-based QRNG with two independent lasers, each of which operates in either continuous-wave (CW) or pulsed mode. We implement the QRNG by operating the two lasers in three configurations, namely, CW + CW, CW + pulsed, and pulsed + pulsed, and demonstrate their trade-offs, strengths, and weaknesses.

Harvesting Entropy for Random Number Generation for Internet of Things Constrained Devices Using On-Board Sensors

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.

Harvesting Entropy for Random Number Generation for Internet of Things Constrained Devices Using On-Board Sensors

Science.gov (United States)

Pawlowski, Marcin Piotr; Jara, Antonio; Ogorzalek, Maciej

2015-01-01

Entropy in computer security is associated with the unpredictability of a source of randomness. The random source with high entropy tends to achieve a uniform distribution of random values. Random number generators are one of the most important building blocks of cryptosystems. In constrained devices of the Internet of Things ecosystem, high entropy random number generators are hard to achieve due to hardware limitations. For the purpose of the random number generation in constrained devices, this work proposes a solution based on the least-significant bits concatenation entropy harvesting method. As a potential source of entropy, on-board integrated sensors (i.e., temperature, humidity and two different light sensors) have been analyzed. Additionally, the costs (i.e., time and memory consumption) of the presented approach have been measured. The results obtained from the proposed method with statistical fine tuning achieved a Shannon entropy of around 7.9 bits per byte of data for temperature and humidity sensors. The results showed that sensor-based random number generators are a valuable source of entropy with very small RAM and Flash memory requirements for constrained devices of the Internet of Things. PMID:26506357

Harvesting entropy for random number generation for internet of things constrained devices using on-board sensors.

Science.gov (United States)

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.

RANDOMNUMBERS, Random Number Sequence Generated from Gas Ionisation Chamber Data

International Nuclear Information System (INIS)

Frigerio, N.A.; Sanathanan, L.P.; Morley, M.; Tyler, S.A.; Clark, N.A.; Wang, J.

1989-01-01

1 - Description of problem or function: RANDOM NUMBERS is a data collection of almost 2.7 million 31-bit random numbers generated by using a high resolution gas ionization detector chamber in conjunction with a 4096-channel multichannel analyzer to record the radioactive decay of alpha particles from a U-235 source. The signals from the decaying alpha particles were fed to the 4096-channel analyzer, and for each channel the frequency of signals registered in a 20,000-microsecond interval was recorded. The parity bits of these frequency counts, 0 for an even count and 1 for and odd count, were then assembled in sequence to form 31-bit random numbers and transcribed onto magnetic tape. This cycle was repeated to obtain the random numbers. 2 - Method of solution: The frequency distribution of counts from the device conforms to the Brockwell-Moyal distribution which takes into account the dead time of the counter. The count data were analyzed and tests for randomness on a sample indicate that the device is a highly reliable source of truly random numbers. 3 - Restrictions on the complexity of the problem: The RANDOM NUMBERS tape contains 2,669,568 31-bit numbers

Self-Powered Random Number Generator Based on Coupled Triboelectric and Electrostatic Induction Effects at the Liquid-Dielectric Interface.

Science.gov (United States)

Yu, Aifang; Chen, Xiangyu; Cui, Haotian; Chen, Libo; Luo, Jianjun; Tang, Wei; Peng, Mingzeng; Zhang, Yang; Zhai, Junyi; Wang, Zhong Lin

2016-12-27

Modern cryptography increasingly employs random numbers generated from physical sources in lieu of conventional software-based pseudorandom numbers, primarily owing to the great demand of unpredictable, indecipherable cryptographic keys from true random numbers for information security. Thus, far, the sole demonstration of true random numbers has been generated through thermal noise and/or quantum effects, which suffers from expensive and complex equipment. In this paper, we demonstrate a method for self-powered creation of true random numbers by using triboelectric technology to collect random signals from nature. This random number generator based on coupled triboelectric and electrostatic induction effects at the liquid-dielectric interface includes an elaborately designed triboelectric generator (TENG) with an irregular grating structure, an electronic-optical device, and an optical-electronic device. The random characteristics of raindrops are harvested through TENG and consequently transformed and converted by electronic-optical device and an optical-electronic device with a nonlinear characteristic. The cooperation of the mechanical, electrical, and optical signals ensures that the generator possesses complex nonlinear input-output behavior and contributes to increased randomness. The random number sequences are deduced from final electrical signals received by an optical-electronic device using a familiar algorithm. These obtained random number sequences exhibit good statistical characteristics, unpredictability, and unrepeatability. Our study supplies a simple, practical, and effective method to generate true random numbers, which can be widely used in cryptographic protocols, digital signatures, authentication, identification, and other information security fields.

Primitive polynomials selection method for pseudo-random number generator

Science.gov (United States)

Anikin, I. V.; Alnajjar, Kh

2018-01-01

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

Experimental Analysis of a Piezoelectric Energy Harvesting System for Harmonic, Random, and Sine on Random Vibration

Directory of Open Access Journals (Sweden)

Jackson W. Cryns

2013-01-01

Full Text Available Harvesting power with a piezoelectric vibration powered generator using a full-wave rectifier conditioning circuit is experimentally compared for varying sinusoidal, random, and sine on random (SOR input vibration scenarios; the implications of source vibration characteristics on harvester design are discussed. The rise in popularity of harvesting energy from ambient vibrations has made compact, energy dense piezoelectric generators commercially available. Much of the available literature focuses on maximizing harvested power through nonlinear processing circuits that require accurate knowledge of generator internal mechanical and electrical characteristics and idealization of the input vibration source, which cannot be assumed in general application. Variations in source vibration and load resistance are explored for a commercially available piezoelectric generator. The results agree with numerical and theoretical predictions in the previous literature for optimal power harvesting in sinusoidal and flat broadband vibration scenarios. Going beyond idealized steady-state sinusoidal and flat random vibration input, experimental SOR testing allows for more accurate representation of real world ambient vibration. It is shown that characteristic interactions from more complex vibration sources significantly alter power generation and processing requirements by varying harvested power, shifting optimal conditioning impedance, inducing voltage fluctuations, and ultimately rendering idealized sinusoidal and random analyses incorrect.

PRIMITIVE MATRICES AND GENERATORS OF PSEUDO RANDOM SEQUENCES OF GALOIS

Directory of Open Access Journals (Sweden)

A. Beletsky

2014-04-01

Full Text Available In theory and practice of information cryptographic protection one of the key problems is the forming a binary pseudo-random sequences (PRS with a maximum length with acceptable statistical characteristics. PRS generators are usually implemented by linear shift register (LSR of maximum period with linear feedback [1]. In this paper we extend the concept of LSR, assuming that each of its rank (memory cell can be in one of the following condition. Let’s call such registers “generalized linear shift register.” The research goal is to develop algorithms for constructing Galois and Fibonacci generalized matrix of n-order over the field , which uniquely determined both the structure of corresponding generalized of n-order LSR maximal period, and formed on their basis Galois PRS generators of maximum length. Thus the article presents the questions of formation the primitive generalized Fibonacci and Galois arbitrary order matrix over the prime field . The synthesis of matrices is based on the use of irreducible polynomials of degree and primitive elements of the extended field generated by polynomial. The constructing methods of Galois and Fibonacci conjugated primitive matrices are suggested. The using possibilities of such matrices in solving the problem of constructing generalized generators of Galois pseudo-random sequences are discussed.

Multiple ECG Fiducial Points-Based Random Binary Sequence Generation for Securing Wireless Body Area Networks.

Science.gov (United States)

Zheng, Guanglou; Fang, Gengfa; Shankaran, Rajan; Orgun, Mehmet A; Zhou, Jie; Qiao, Li; Saleem, Kashif

2017-05-01

Generating random binary sequences (BSes) is a fundamental requirement in cryptography. A BS is a sequence of N bits, and each bit has a value of 0 or 1. For securing sensors within wireless body area networks (WBANs), electrocardiogram (ECG)-based BS generation methods have been widely investigated in which interpulse intervals (IPIs) from each heartbeat cycle are processed to produce BSes. Using these IPI-based methods to generate a 128-bit BS in real time normally takes around half a minute. In order to improve the time efficiency of such methods, this paper presents an ECG multiple fiducial-points based binary sequence generation (MFBSG) algorithm. The technique of discrete wavelet transforms is employed to detect arrival time of these fiducial points, such as P, Q, R, S, and T peaks. Time intervals between them, including RR, RQ, RS, RP, and RT intervals, are then calculated based on this arrival time, and are used as ECG features to generate random BSes with low latency. According to our analysis on real ECG data, these ECG feature values exhibit the property of randomness and, thus, can be utilized to generate random BSes. Compared with the schemes that solely rely on IPIs to generate BSes, this MFBSG algorithm uses five feature values from one heart beat cycle, and can be up to five times faster than the solely IPI-based methods. So, it achieves a design goal of low latency. According to our analysis, the complexity of the algorithm is comparable to that of fast Fourier transforms. These randomly generated ECG BSes can be used as security keys for encryption or authentication in a WBAN system.

Extensions of von Neumann's method for generating random variables

International Nuclear Information System (INIS)

Monahan, J.F.

1979-01-01

Von Neumann's method of generating random variables with the exponential distribution and Forsythe's method for obtaining distributions with densities of the form e/sup -G//sup( x/) are generalized to apply to certain power series representations. The flexibility of the power series methods is illustrated by algorithms for the Cauchy and geometric distributions

Computing variational bounds for flow through random aggregates of Spheres

International Nuclear Information System (INIS)

Berryman, J.G.

1983-01-01

Known formulas for variational bounds on Darcy's constant for slow flow through porous media depend on two-point and three-poiint spatial correlation functions. Certain bounds due to Prager and Doi depending only a two-point correlation functions have been calculated for the first time for random aggregates of spheres with packing fractions (eta) up to eta = 0.64. Three radial distribution functions for hard spheres were tested for eta up to 0.49: (1) the uniform distribution or ''well-stirred approximation,'' (2) the Percus Yevick approximation, and (3) the semi-empirical distribution of Verlet and Weis. The empirical radial distribution functions of Benett andd Finney were used for packing fractions near the random-close-packing limit (eta/sub RCP/dapprox.0.64). An accurate multidimensional Monte Carlo integration method (VEGAS) developed by Lepage was used to compute the required two-point correlation functions. The results show that Doi's bounds are preferred for eta>0.10 while Prager's bounds are preferred for eta>0.10. The ''upper bounds'' computed using the well-stirred approximation actually become negative (which is physically impossible) as eta increases, indicating the very limited value of this approximation. The other two choices of radial distribution function give reasonable results for eta up to 0.49. However, these bounds do not decrease with eta as fast as expected for large eta. It is concluded that variational bounds dependent on three-point correlation functions are required to obtain more accurate bounds on Darcy's constant for large eta

Variational method for the minimization of entropy generation in solar cells

Energy Technology Data Exchange (ETDEWEB)

Smit, Sjoerd; Kessels, W. M. M., E-mail: w.m.m.kessels@tue.nl [Department of Applied Physics, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven (Netherlands)

2015-04-07

In this work, a method is presented to extend traditional solar cell simulation tools to make it possible to calculate the most efficient design of practical solar cells. The method is based on the theory of nonequilibrium thermodynamics, which is used to derive an expression for the local entropy generation rate in the solar cell, making it possible to quantify all free energy losses on the same scale. The framework of non-equilibrium thermodynamics can therefore be combined with the calculus of variations and existing solar cell models to minimize the total entropy generation rate in the cell to find the most optimal design. The variational method is illustrated by applying it to a homojunction solar cell. The optimization results in a set of differential algebraic equations, which determine the optimal shape of the doping profile for given recombination and transport models.

Random matrix approach to the dynamics of stock inventory variations

International Nuclear Information System (INIS)

Zhou Weixing; Mu Guohua; Kertész, János

2012-01-01

It is well accepted that investors can be classified into groups owing to distinct trading strategies, which forms the basic assumption of many agent-based models for financial markets when agents are not zero-intelligent. However, empirical tests of these assumptions are still very rare due to the lack of order flow data. Here we adopt the order flow data of Chinese stocks to tackle this problem by investigating the dynamics of inventory variations for individual and institutional investors that contain rich information about the trading behavior of investors and have a crucial influence on price fluctuations. We find that the distributions of cross-correlation coefficient C ij have power-law forms in the bulk that are followed by exponential tails, and there are more positive coefficients than negative ones. In addition, it is more likely that two individuals or two institutions have a stronger inventory variation correlation than one individual and one institution. We find that the largest and the second largest eigenvalues (λ 1 and λ 2 ) of the correlation matrix cannot be explained by random matrix theory and the projections of investors' inventory variations on the first eigenvector u(λ 1 ) are linearly correlated with stock returns, where individual investors play a dominating role. The investors are classified into three categories based on the cross-correlation coefficients C VR between inventory variations and stock returns. A strong Granger causality is unveiled from stock returns to inventory variations, which means that a large proportion of individuals hold the reversing trading strategy and a small part of individuals hold the trending strategy. Our empirical findings have scientific significance in the understanding of investors' trading behavior and in the construction of agent-based models for emerging stock markets. (paper)

Random matrix approach to the dynamics of stock inventory variations

Science.gov (United States)

Zhou, Wei-Xing; Mu, Guo-Hua; Kertész, János

2012-09-01

It is well accepted that investors can be classified into groups owing to distinct trading strategies, which forms the basic assumption of many agent-based models for financial markets when agents are not zero-intelligent. However, empirical tests of these assumptions are still very rare due to the lack of order flow data. Here we adopt the order flow data of Chinese stocks to tackle this problem by investigating the dynamics of inventory variations for individual and institutional investors that contain rich information about the trading behavior of investors and have a crucial influence on price fluctuations. We find that the distributions of cross-correlation coefficient Cij have power-law forms in the bulk that are followed by exponential tails, and there are more positive coefficients than negative ones. In addition, it is more likely that two individuals or two institutions have a stronger inventory variation correlation than one individual and one institution. We find that the largest and the second largest eigenvalues (λ1 and λ2) of the correlation matrix cannot be explained by random matrix theory and the projections of investors' inventory variations on the first eigenvector u(λ1) are linearly correlated with stock returns, where individual investors play a dominating role. The investors are classified into three categories based on the cross-correlation coefficients CV R between inventory variations and stock returns. A strong Granger causality is unveiled from stock returns to inventory variations, which means that a large proportion of individuals hold the reversing trading strategy and a small part of individuals hold the trending strategy. Our empirical findings have scientific significance in the understanding of investors' trading behavior and in the construction of agent-based models for emerging stock markets.

Random Sequence for Optimal Low-Power Laser Generated Ultrasound

Science.gov (United States)

Vangi, D.; Virga, A.; Gulino, M. S.

2017-08-01

Low-power laser generated ultrasounds are lately gaining importance in the research world, thanks to the possibility of investigating a mechanical component structural integrity through a non-contact and Non-Destructive Testing (NDT) procedure. The ultrasounds are, however, very low in amplitude, making it necessary to use pre-processing and post-processing operations on the signals to detect them. The cross-correlation technique is used in this work, meaning that a random signal must be used as laser input. For this purpose, a highly random and simple-to-create code called T sequence, capable of enhancing the ultrasound detectability, is introduced (not previously available at the state of the art). Several important parameters which characterize the T sequence can influence the process: the number of pulses Npulses , the pulse duration δ and the distance between pulses dpulses . A Finite Element FE model of a 3 mm steel disk has been initially developed to analytically study the longitudinal ultrasound generation mechanism and the obtainable outputs. Later, experimental tests have shown that the T sequence is highly flexible for ultrasound detection purposes, making it optimal to use high Npulses and δ but low dpulses . In the end, apart from describing all phenomena that arise in the low-power laser generation process, the results of this study are also important for setting up an effective NDT procedure using this technology.

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

Science.gov (United States)

Stoev, Peter; Stoilova, Stanislava

2017-12-01

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

Cellular Automata-Based Parallel Random Number Generators Using FPGAs

Directory of Open Access Journals (Sweden)

David H. K. Hoe

2012-01-01

Full Text Available Cellular computing represents a new paradigm for implementing high-speed massively parallel machines. Cellular automata (CA, which consist of an array of locally connected processing elements, are a basic form of a cellular-based architecture. The use of field programmable gate arrays (FPGAs for implementing CA accelerators has shown promising results. This paper investigates the design of CA-based pseudo-random number generators (PRNGs using an FPGA platform. To improve the quality of the random numbers that are generated, the basic CA structure is enhanced in two ways. First, the addition of a superrule to each CA cell is considered. The resulting self-programmable CA (SPCA uses the superrule to determine when to make a dynamic rule change in each CA cell. The superrule takes its inputs from neighboring cells and can be considered itself a second CA working in parallel with the main CA. When implemented on an FPGA, the use of lookup tables in each logic cell removes any restrictions on how the super-rules should be defined. Second, a hybrid configuration is formed by combining a CA with a linear feedback shift register (LFSR. This is advantageous for FPGA designs due to the compactness of the LFSR implementations. A standard software package for statistically evaluating the quality of random number sequences known as Diehard is used to validate the results. Both the SPCA and the hybrid CA/LFSR were found to pass all the Diehard tests.

Algorithms for random generation and counting a Markov chain approach

CERN Document Server

Sinclair, Alistair

1993-01-01

This monograph studies two classical computational problems: counting the elements of a finite set of combinatorial structures, and generating them at random from some probability distribution. Apart from their intrinsic interest, these problems arise naturally in many branches of mathematics and the natural sciences.

A robust random number generator based on differential comparison of chaotic laser signals.

Science.gov (United States)

Zhang, Jianzhong; Wang, Yuncai; Liu, Ming; Xue, Lugang; Li, Pu; Wang, Anbang; Zhang, Mingjiang

2012-03-26

We experimentally realize a robust real-time random number generator by differentially comparing the signal from a chaotic semiconductor laser and its delayed signal through a 1-bit analog-to-digital converter. The probability density distribution of the output chaotic signal based on the differential comparison method possesses an extremely small coefficient of Pearson's median skewness (1.5 × 10⁻⁶), which can yield a balanced random sequence much easily than the previously reported method that compares the signal from the chaotic laser with a certain threshold value. Moveover, we experimently demonstrate that our method can stably generate good random numbers at rates of 1.44 Gbit/s with excellent immunity from external perturbations while the previously reported method fails.

An adaptive random search for short term generation scheduling with network constraints.

Directory of Open Access Journals (Sweden)

J A Marmolejo

Full Text Available This paper presents an adaptive random search approach to address a short term generation scheduling with network constraints, which determines the startup and shutdown schedules of thermal units over a given planning horizon. In this model, we consider the transmission network through capacity limits and line losses. The mathematical model is stated in the form of a Mixed Integer Non Linear Problem with binary variables. The proposed heuristic is a population-based method that generates a set of new potential solutions via a random search strategy. The random search is based on the Markov Chain Monte Carlo method. The main key of the proposed method is that the noise level of the random search is adaptively controlled in order to exploring and exploiting the entire search space. In order to improve the solutions, we consider coupling a local search into random search process. Several test systems are presented to evaluate the performance of the proposed heuristic. We use a commercial optimizer to compare the quality of the solutions provided by the proposed method. The solution of the proposed algorithm showed a significant reduction in computational effort with respect to the full-scale outer approximation commercial solver. Numerical results show the potential and robustness of our approach.

Compact Quantum Random Number Generator with Silicon Nanocrystals Light Emitting Device Coupled to a Silicon Photomultiplier

Science.gov (United States)

Bisadi, Zahra; Acerbi, Fabio; Fontana, Giorgio; Zorzi, Nicola; Piemonte, Claudio; Pucker, Georg; Pavesi, Lorenzo

2018-02-01

A small-sized photonic quantum random number generator, easy to be implemented in small electronic devices for secure data encryption and other applications, is highly demanding nowadays. Here, we propose a compact configuration with Silicon nanocrystals large area light emitting device (LED) coupled to a Silicon photomultiplier to generate random numbers. The random number generation methodology is based on the photon arrival time and is robust against the non-idealities of the detector and the source of quantum entropy. The raw data show high quality of randomness and pass all the statistical tests in national institute of standards and technology tests (NIST) suite without a post-processing algorithm. The highest bit rate is 0.5 Mbps with the efficiency of 4 bits per detected photon.

Generating Correlated QPSK Waveforms By Exploiting Real Gaussian Random Variables

KAUST Repository

Jardak, Seifallah

2012-11-01

The design of waveforms with specified auto- and cross-correlation properties has a number of applications in multiple-input multiple-output (MIMO) radar, one of them is the desired transmit beampattern design. In this work, an algorithm is proposed to generate quadrature phase shift- keying (QPSK) waveforms with required cross-correlation properties using real Gaussian random-variables (RV’s). This work can be considered as the extension of what was presented in [1] to generate BPSK waveforms. This work will be extended for the generation of correlated higher-order phase shift-keying (PSK) and quadrature amplitude modulation (QAM) schemes that can better approximate the desired beampattern.

Generating Correlated QPSK Waveforms By Exploiting Real Gaussian Random Variables

KAUST Repository

Jardak, Seifallah; Ahmed, Sajid; Alouini, Mohamed-Slim

2012-01-01

The design of waveforms with specified auto- and cross-correlation properties has a number of applications in multiple-input multiple-output (MIMO) radar, one of them is the desired transmit beampattern design. In this work, an algorithm is proposed to generate quadrature phase shift- keying (QPSK) waveforms with required cross-correlation properties using real Gaussian random-variables (RV’s). This work can be considered as the extension of what was presented in [1] to generate BPSK waveforms. This work will be extended for the generation of correlated higher-order phase shift-keying (PSK) and quadrature amplitude modulation (QAM) schemes that can better approximate the desired beampattern.

Variational Infinite Hidden Conditional Random Fields

NARCIS (Netherlands)

Bousmalis, Konstantinos; Zafeiriou, Stefanos; Morency, Louis-Philippe; Pantic, Maja; Ghahramani, Zoubin

2015-01-01

Hidden conditional random fields (HCRFs) are discriminative latent variable models which have been shown to successfully learn the hidden structure of a given classification problem. An Infinite hidden conditional random field is a hidden conditional random field with a countably infinite number of

Stochastic process variation in deep-submicron CMOS circuits and algorithms

CERN Document Server

Zjajo, Amir

2014-01-01

One of the most notable features of nanometer scale CMOS technology is the increasing magnitude of variability of the key device parameters affecting performance of integrated circuits. The growth of variability can be attributed to multiple factors, including the difficulty of manufacturing control, the emergence of new systematic variation-generating mechanisms, and most importantly, the increase in atomic-scale randomness, where device operation must be described as a stochastic process. In addition to wide-sense stationary stochastic device variability and temperature variation, existence of non-stationary stochastic electrical noise associated with fundamental processes in integrated-circuit devices represents an elementary limit on the performance of electronic circuits. In an attempt to address these issues, Stochastic Process Variation in Deep-Submicron CMOS: Circuits and Algorithms offers unique combination of mathematical treatment of random process variation, electrical noise and temperature and ne...

Random Variation in Student Performance by Class Size: Implications of NCLB in Rural Pennsylvania

Science.gov (United States)

Goetz, Stephan J.

2005-01-01

Schools that fail to make "adequate yearly progress" under NCLB face sanctions and may lose students to other schools. In smaller schools, random yearly variation in innate student ability and behavior can cause changes in scores that are beyond the influence of teachers. This study examines changes in reading and math scores across…

Development and testing of high performance pseudo random number generator for Monte Carlo simulation

International Nuclear Information System (INIS)

Chakraborty, Brahmananda

2009-01-01

Random number plays an important role in any Monte Carlo simulation. The accuracy of the results depends on the quality of the sequence of random numbers employed in the simulation. These include randomness of the random numbers, uniformity of their distribution, absence of correlation and long period. In a typical Monte Carlo simulation of particle transport in a nuclear reactor core, the history of a particle from its birth in a fission event until its death by an absorption or leakage event is tracked. The geometry of the core and the surrounding materials are exactly modeled in the simulation. To track a neutron history one needs random numbers for determining inter collision distance, nature of the collision, the direction of the scattered neutron etc. Neutrons are tracked in batches. In one batch approximately 2000-5000 neutrons are tracked. The statistical accuracy of the results of the simulation depends on the total number of particles (number of particles in one batch multiplied by the number of batches) tracked. The number of histories to be generated is usually large for a typical radiation transport problem. To track a very large number of histories one needs to generate a long sequence of independent random numbers. In other words the cycle length of the random number generator (RNG) should be more than the total number of random numbers required for simulating the given transport problem. The number of bits of the machine generally limits the cycle length. For a binary machine of p bits the maximum cycle length is 2 p . To achieve higher cycle length in the same machine one has to use either register arithmetic or bit manipulation technique

Compact Quantum Random Number Generator with Silicon Nanocrystals Light Emitting Device Coupled to a Silicon Photomultiplier

Directory of Open Access Journals (Sweden)

Zahra Bisadi

2018-02-01

Full Text Available A small-sized photonic quantum random number generator, easy to be implemented in small electronic devices for secure data encryption and other applications, is highly demanding nowadays. Here, we propose a compact configuration with Silicon nanocrystals large area light emitting device (LED coupled to a Silicon photomultiplier to generate random numbers. The random number generation methodology is based on the photon arrival time and is robust against the non-idealities of the detector and the source of quantum entropy. The raw data show high quality of randomness and pass all the statistical tests in national institute of standards and technology tests (NIST suite without a post-processing algorithm. The highest bit rate is 0.5 Mbps with the efficiency of 4 bits per detected photon.

Pseudo random number generator based on quantum chaotic map

Science.gov (United States)

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.

Automatic generation of randomized trial sequences for priming experiments.

Science.gov (United States)

Ihrke, Matthias; Behrendt, Jörg

2011-01-01

In most psychological experiments, a randomized presentation of successive displays is crucial for the validity of the results. For some paradigms, this is not a trivial issue because trials are interdependent, e.g., priming paradigms. We present a software that automatically generates optimized trial sequences for (negative-) priming experiments. Our implementation is based on an optimization heuristic known as genetic algorithms that allows for an intuitive interpretation due to its similarity to natural evolution. The program features a graphical user interface that allows the user to generate trial sequences and to interactively improve them. The software is based on freely available software and is released under the GNU General Public License.

At least some errors are randomly generated (Freud was wrong)

Science.gov (United States)

Sellen, A. J.; Senders, J. W.

1986-01-01

An experiment was carried out to expose something about human error generating mechanisms. In the context of the experiment, an error was made when a subject pressed the wrong key on a computer keyboard or pressed no key at all in the time allotted. These might be considered, respectively, errors of substitution and errors of omission. Each of seven subjects saw a sequence of three digital numbers, made an easily learned binary judgement about each, and was to press the appropriate one of two keys. Each session consisted of 1,000 presentations of randomly permuted, fixed numbers broken into 10 blocks of 100. One of two keys should have been pressed within one second of the onset of each stimulus. These data were subjected to statistical analyses in order to probe the nature of the error generating mechanisms. Goodness of fit tests for a Poisson distribution for the number of errors per 50 trial interval and for an exponential distribution of the length of the intervals between errors were carried out. There is evidence for an endogenous mechanism that may best be described as a random error generator. Furthermore, an item analysis of the number of errors produced per stimulus suggests the existence of a second mechanism operating on task driven factors producing exogenous errors. Some errors, at least, are the result of constant probability generating mechanisms with error rate idiosyncratically determined for each subject.

Fully Digital Chaotic Oscillators Applied to Pseudo Random Number Generation

KAUST Repository

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.

Variational study of mass generation and deconfinement in Yang-Mills theory

Science.gov (United States)

Comitini, Giorgio; Siringo, Fabio

2018-03-01

A very simple variational approach to pure SU (N ) Yang-Mills theory is proposed, based on the Gaussian effective potential in a linear covariant gauge. The method provides an analytical variational argument for mass generation. The method can be improved order by order by a perturbative massive expansion around the optimal trial vacuum. At finite temperature, a weak first-order transition is found (at Tc≈250 MeV for N =3 ) where the mass scale drops discontinuously. Above the transition the optimal mass increases linearly as expected for deconfined bosons. The equation of state is found in good agreement with the lattice data.

Direct generation of all-optical random numbers from optical pulse amplitude chaos.

Science.gov (United States)

Li, Pu; Wang, Yun-Cai; Wang, An-Bang; Yang, Ling-Zhen; Zhang, Ming-Jiang; Zhang, Jian-Zhong

2012-02-13

We propose and theoretically demonstrate an all-optical method for directly generating all-optical random numbers from pulse amplitude chaos produced by a mode-locked fiber ring laser. Under an appropriate pump intensity, the mode-locked laser can experience a quasi-periodic route to chaos. Such a chaos consists of a stream of pulses with a fixed repetition frequency but random intensities. In this method, we do not require sampling procedure and external triggered clocks but directly quantize the chaotic pulses stream into random number sequence via an all-optical flip-flop. Moreover, our simulation results show that the pulse amplitude chaos has no periodicity and possesses a highly symmetric distribution of amplitude. Thus, in theory, the obtained random number sequence without post-processing has a high-quality randomness verified by industry-standard statistical tests.

A programmable Gaussian random pulse generator for automated performance measurements

International Nuclear Information System (INIS)

Abdel-Aal, R.E.

1989-01-01

This paper describes a versatile random signal generator which produces logic pulses with a Gaussian distribution for the pulse spacing. The average rate at the pulse generator output can be software-programmed, which makes it useful in performing automated measurements of dead time and CPU time performance of data acquisition systems and modules over a wide range of data rates. Hardware and software components are described and data on the input-output characteristics and the statistical properties of the pulse generator are given. Typical applications are discussed together with advantages over using radioactive test sources. Results obtained from an automated performance run on a VAX 11/785 data acquisition system are presented. (orig.)

Catalytic micromotor generating self-propelled regular motion through random fluctuation

Science.gov (United States)

Yamamoto, Daigo; Mukai, Atsushi; Okita, Naoaki; Yoshikawa, Kenichi; Shioi, Akihisa

2013-07-01

Most of the current studies on nano/microscale motors to generate regular motion have adapted the strategy to fabricate a composite with different materials. In this paper, we report that a simple object solely made of platinum generates regular motion driven by a catalytic chemical reaction with hydrogen peroxide. Depending on the morphological symmetry of the catalytic particles, a rich variety of random and regular motions are observed. The experimental trend is well reproduced by a simple theoretical model by taking into account of the anisotropic viscous effect on the self-propelled active Brownian fluctuation.

Long period pseudo random number sequence generator

Science.gov (United States)

Wang, Charles C. (Inventor)

1989-01-01

A circuit for generating a sequence of pseudo random numbers, (A sub K). There is an exponentiator in GF(2 sup m) for the normal basis representation of elements in a finite field GF(2 sup m) each represented by m binary digits and having two inputs and an output from which the sequence (A sub K). Of pseudo random numbers is taken. One of the two inputs is connected to receive the outputs (E sub K) of maximal length shift register of n stages. There is a switch having a pair of inputs and an output. The switch outputs is connected to the other of the two inputs of the exponentiator. One of the switch inputs is connected for initially receiving a primitive element (A sub O) in GF(2 sup m). Finally, there is a delay circuit having an input and an output. The delay circuit output is connected to the other of the switch inputs and the delay circuit input is connected to the output of the exponentiator. Whereby after the exponentiator initially receives the primitive element (A sub O) in GF(2 sup m) through the switch, the switch can be switched to cause the exponentiator to receive as its input a delayed output A(K-1) from the exponentiator thereby generating (A sub K) continuously at the output of the exponentiator. The exponentiator in GF(2 sup m) is novel and comprises a cyclic-shift circuit; a Massey-Omura multiplier; and, a control logic circuit all operably connected together to perform the function U(sub i) = 92(sup i) (for n(sub i) = 1 or 1 (for n(subi) = 0).

Scope of Various Random Number Generators in ant System Approach for TSP

Science.gov (United States)

Sen, S. K.; Shaykhian, Gholam Ali

2007-01-01

Experimented on heuristic, based on an ant system approach for traveling salesman problem, are several quasi- and pseudo-random number generators. This experiment is to explore if any particular generator is most desirable. Such an experiment on large samples has the potential to rank the performance of the generators for the foregoing heuristic. This is mainly to seek an answer to the controversial issue "which generator is the best in terms of quality of the result (accuracy) as well as cost of producing the result (time/computational complexity) in a probabilistic/statistical sense."

Cassie state robustness of plasma generated randomly nano-rough surfaces

Energy Technology Data Exchange (ETDEWEB)

Di Mundo, Rosa, E-mail: rosa.dimundo@poliba.it; Bottiglione, Francesco; Carbone, Giuseppe

2014-10-15

Graphical abstract: - Highlights: • Superhydrophobic randomly rough surfaces are generated by plasma etching. • Statistical analysis of roughness allows calculation of theWenzel roughness factor, r{sub W.} • A r{sub W} threshold is theoretically determined, above which superhydrophobicity is “robust”. • Dynamic wetting, e.g. with high speed impacting drops, confirms this prediction. - Abstract: Superhydrophobic surfaces are effective in practical applications provided they are “robust superhydrophobic”, i.e. able to retain the Cassie state, i.e. with water suspended onto the surface protrusions, even under severe conditions (high pressure, vibrations, high speed impact, etc.). We show that for randomly rough surfaces, given the Young angle, Cassie states are robust when a threshold value of the Wenzel roughness factor, r{sub W}, is exceeded. In particular, superhydrophobic nano-textured surfaces have been generated by self-masked plasma etching. In view of their random roughness, topography features, acquired by Atomic Force Microscopy, have been statistically analyzed in order to gain information on statistical parameters such as power spectral density, fractal dimension and Wenzel roughness factor (r{sub W}), which has been used to assess Cassie state robustness. Results indicate that randomly rough surfaces produced by plasma at high power or long treatment duration, which are also fractal self-affine, have a r{sub W} higher than the theoretical threshold, thus for them a robust superhydrophobicity is predicted. In agreement with this, under dynamic wetting conditionson these surfaces the most pronounced superhydrophobic character has been appreciated: they show the lowest contact angle hysteresis and result in the sharpest bouncing when hit by drops at high impact velocity.

On the limiting characteristics of quantum random number generators at various clusterings of photocounts

Science.gov (United States)

Molotkov, S. N.

2017-03-01

Various methods for the clustering of photocounts constituting a sequence of random numbers are considered. It is shown that the clustering of photocounts resulting in the Fermi-Dirac distribution makes it possible to achieve the theoretical limit of the random number generation rate.

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

International Nuclear Information System (INIS)

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

2012-01-01

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

Unidirectional interference in use of nondominant hand during concurrent Grooved Pegboard and random number generation tasks.

Science.gov (United States)

Strenge, Hans; Niederberger, Uwe

2008-06-01

The interference effect between Grooved Pegboard task with either hand and the executive task of cued verbal random number generation was investigated. 24 normal right-handed subjects performed each task under separate (single-task) and concurrent (dual-task) conditions. Articulatory suppression was required as an additional secondary task during pegboard performance. Analysis indicated an unambiguous distinction between the two hands. Comparisons of single-task and dual-task conditions showed an asymmetrical pattern of unidirectional interference with no practice effects during pegboard performance. Concurrent performance with nondominant hand but not the dominant hand of random number generation performance became continuously slower. There was no effect of divided attention on pegboard performance. Findings support the idea that the nondominant hand on the pegboard and random number tasks draw from the same processing resources but that for the executive aspect random number generation is more sensitive to changes in allocation of attentional resources.

GenRGenS: Software for Generating Random Genomic Sequences and Structures

OpenAIRE

Ponty , Yann; Termier , Michel; Denise , Alain

2006-01-01

International audience; GenRGenS is a software tool dedicated to randomly generating genomic sequences and structures. It handles several classes of models useful for sequence analysis, such as Markov chains, hidden Markov models, weighted context-free grammars, regular expressions and PROSITE expressions. GenRGenS is the only program that can handle weighted context-free grammars, thus allowing the user to model and to generate structured objects (such as RNA secondary structures) of any giv...

Adaptive filtration of speech signals in the presence of correlated noise with random variation of probabilistic characteristics

OpenAIRE

M. O. Partala; S. Ya. Zhuk

2007-01-01

On the base of mixed Markoff process in discrete time optimal and quasioptimal algorithms is designed for adaptive filtration of speech signals in the presence of correlated noise with random variation of probabilistic characteristics.

Total variation regularization of the 3-D gravity inverse problem using a randomized generalized singular value decomposition

Science.gov (United States)

Vatankhah, Saeed; Renaut, Rosemary A.; Ardestani, Vahid E.

2018-04-01

We present a fast algorithm for the total variation regularization of the 3-D gravity inverse problem. Through imposition of the total variation regularization, subsurface structures presenting with sharp discontinuities are preserved better than when using a conventional minimum-structure inversion. The associated problem formulation for the regularization is nonlinear but can be solved using an iteratively reweighted least-squares algorithm. For small-scale problems the regularized least-squares problem at each iteration can be solved using the generalized singular value decomposition. This is not feasible for large-scale, or even moderate-scale, problems. Instead we introduce the use of a randomized generalized singular value decomposition in order to reduce the dimensions of the problem and provide an effective and efficient solution technique. For further efficiency an alternating direction algorithm is used to implement the total variation weighting operator within the iteratively reweighted least-squares algorithm. Presented results for synthetic examples demonstrate that the novel randomized decomposition provides good accuracy for reduced computational and memory demands as compared to use of classical approaches.

Chaotic generation of PN sequences : a VLSI implementation

NARCIS (Netherlands)

Dornbusch, A.; Pineda de Gyvez, J.

1999-01-01

Generation of repeatable pseudo-random sequences with chaotic analog electronics is not feasible using standard circuit topologies. Component variation caused by imperfect fabrication causes the same divergence of output sequences as does varying initial conditions. By quantizing the output of a

A modern theory of random variation with applications in stochastic calculus, financial mathematics, and Feynman integration

CERN Document Server

Muldowney, Patrick

2012-01-01

A Modern Theory of Random Variation is a new and radical re-formulation of the mathematical underpinnings of subjects as diverse as investment, communication engineering, and quantum mechanics. Setting aside the classical theory of probability measure spaces, the book utilizes a mathematically rigorous version of the theory of random variation that bases itself exclusively on finitely additive probability distribution functions. In place of twentieth century Lebesgue integration and measure theory, the author uses the simpler concept of Riemann sums, and the non-absolute Riemann-type integration of Henstock. Readers are supplied with an accessible approach to standard elements of probability theory such as the central limmit theorem and Brownian motion as well as remarkable, new results on Feynman diagrams and stochastic integrals. Throughout the book, detailed numerical demonstrations accompany the discussions of abstract mathematical theory, from the simplest elements of the subject to the most complex. I...

Much of the variation in breast pathology quality assurance data in the UK can be explained by the random order in which cases arrive at individual centres, but some true outliers do exist.

Science.gov (United States)

Cross, Simon S; Stephenson, Timothy J; Harrison, Robert F

2011-10-01

To investigate the role of random temporal order of patient arrival at screening centres in the variability seen in rates of node positivity and breast cancer grade between centres in the NHS Breast Screening Programme. Computer simulations were performed of the variation in node positivity and breast cancer grade with the random temporal arrival of patients at screening centres based on national UK audit data. Cumulative mean graphs of these data were plotted. Confidence intervals for the parameters were generated, using the binomial distribution. UK audit data were plotted on these control limit graphs. The results showed that much of the variability in the audit data could be accounted for by the effects of random order of arrival of cases at the screening centres. Confidence intervals of 99.7% identified true outliers in the data. Much of the variation in breast pathology quality assurance data in the UK can be explained by the random order in which cases arrive at individual centres. Control charts with confidence intervals of 99.7% plotted against the number of reported cases are useful tools for identification of true outliers. 2011 Blackwell Publishing Limited.

A portable high-quality random number generator for lattice field theory simulations

International Nuclear Information System (INIS)

Luescher, M.

1993-09-01

The theory underlying a proposed random number generator for numerical simulations in elementary particle physics and statistical mechanics is discussed. The generator is based on an algorithm introduced by Marsaglia and Zaman, with an important added feature leading to demonstrably good statistical properties. It can be implemented exactly on any computer complying with the IEEE-754 standard for single precision floating point arithmetic. (orig.)

Radiation Transport in Random Media With Large Fluctuations

Science.gov (United States)

Olson, Aaron; Prinja, Anil; Franke, Brian

2017-09-01

Neutral particle transport in media exhibiting large and complex material property spatial variation is modeled by representing cross sections as lognormal random functions of space and generated through a nonlinear memory-less transformation of a Gaussian process with covariance uniquely determined by the covariance of the cross section. A Karhunen-Loève decomposition of the Gaussian process is implemented to effciently generate realizations of the random cross sections and Woodcock Monte Carlo used to transport particles on each realization and generate benchmark solutions for the mean and variance of the particle flux as well as probability densities of the particle reflectance and transmittance. A computationally effcient stochastic collocation method is implemented to directly compute the statistical moments such as the mean and variance, while a polynomial chaos expansion in conjunction with stochastic collocation provides a convenient surrogate model that also produces probability densities of output quantities of interest. Extensive numerical testing demonstrates that use of stochastic reduced-order modeling provides an accurate and cost-effective alternative to random sampling for particle transport in random media.

Experimental Analysis of a Piezoelectric Energy Harvesting System for Harmonic, Random, and Sine on Random Vibration

Energy Technology Data Exchange (ETDEWEB)

Cryns, Jackson W.; Hatchell, Brian K.; Santiago-Rojas, Emiliano; Silvers, Kurt L.

2013-07-01

Formal journal article Experimental analysis of a piezoelectric energy harvesting system for harmonic, random, and sine on random vibration Abstract: Harvesting power with a piezoelectric vibration powered generator using a full-wave rectifier conditioning circuit is experimentally compared for varying sinusoidal, random and sine on random (SOR) input vibration scenarios. Additionally, the implications of source vibration characteristics on harvester design are discussed. Studies in vibration harvesting have yielded numerous alternatives for harvesting electrical energy from vibrations but piezoceramics arose as the most compact, energy dense means of energy transduction. The rise in popularity of harvesting energy from ambient vibrations has made piezoelectric generators commercially available. Much of the available literature focuses on maximizing harvested power through nonlinear processing circuits that require accurate knowledge of generator internal mechanical and electrical characteristics and idealization of the input vibration source, which cannot be assumed in general application. In this manuscript, variations in source vibration and load resistance are explored for a commercially available piezoelectric generator. We characterize the source vibration by its acceleration response for repeatability and transcription to general application. The results agree with numerical and theoretical predictions for in previous literature that load optimal resistance varies with transducer natural frequency and source type, and the findings demonstrate that significant gains are seen with lower tuned transducer natural frequencies for similar source amplitudes. Going beyond idealized steady state sinusoidal and simplified random vibration input, SOR testing allows for more accurate representation of real world ambient vibration. It is shown that characteristic interactions from more complex vibrational sources significantly alter power generation and power processing

Seismic random noise attenuation using shearlet and total generalized variation

International Nuclear Information System (INIS)

Kong, Dehui; Peng, Zhenming

2015-01-01

Seismic denoising from a corrupted observation is an important part of seismic data processing which improves the signal-to-noise ratio (SNR) and resolution. In this paper, we present an effective denoising method to attenuate seismic random noise. The method takes advantage of shearlet and total generalized variation (TGV) regularization. Different regularity levels of TGV improve the quality of the final result by suppressing Gibbs artifacts caused by the shearlet. The problem is formulated as mixed constraints in a convex optimization. A Bregman algorithm is proposed to solve the proposed model. Extensive experiments based on one synthetic datum and two post-stack field data are done to compare performance. The results demonstrate that the proposed method provides superior effectiveness and preserve the structure better. (paper)

Seismic random noise attenuation using shearlet and total generalized variation

Science.gov (United States)

Kong, Dehui; Peng, Zhenming

2015-12-01

Seismic denoising from a corrupted observation is an important part of seismic data processing which improves the signal-to-noise ratio (SNR) and resolution. In this paper, we present an effective denoising method to attenuate seismic random noise. The method takes advantage of shearlet and total generalized variation (TGV) regularization. Different regularity levels of TGV improve the quality of the final result by suppressing Gibbs artifacts caused by the shearlet. The problem is formulated as mixed constraints in a convex optimization. A Bregman algorithm is proposed to solve the proposed model. Extensive experiments based on one synthetic datum and two post-stack field data are done to compare performance. The results demonstrate that the proposed method provides superior effectiveness and preserve the structure better.

Random Positional Variation Among the Skull, Mandible, and Cervical Spine With Treatment Progression During Head-and-Neck Radiotherapy

International Nuclear Information System (INIS)

Ahn, Peter H.; Ahn, Andrew I.; Lee, C. Joe; Shen Jin; Miller, Ekeni; Lukaj, Alex; Milan, Elissa; Yaparpalvi, Ravindra; Kalnicki, Shalom; Garg, Madhur K.

2009-01-01

Purpose: With 54 o of freedom from the skull to mandible to C7, ensuring adequate immobilization for head-and-neck radiotherapy (RT) is complex. We quantify variations in skull, mandible, and cervical spine movement between RT sessions. Methods and Materials: Twenty-three sequential head-and-neck RT patients underwent serial computed tomography. Patients underwent planned rescanning at 11, 22, and 33 fractions for a total of 93 scans. Coordinates of multiple bony elements of the skull, mandible, and cervical spine were used to calculate rotational and translational changes of bony anatomy compared with the original planning scan. Results: Mean translational and rotational variations on rescanning were negligible, but showed a wide range. Changes in scoliosis and lordosis of the cervical spine between fractions showed similar variability. There was no correlation between positional variation and fraction number and no strong correlation with weight loss or skin separation. Semi-independent rotational and translation movement of the skull in relation to the lower cervical spine was shown. Positioning variability measured by means of vector displacement was largest in the mandible and lower cervical spine. Conclusions: Although only small overall variations in position between head-and-neck RT sessions exist on average, there is significant random variation in patient positioning of the skull, mandible, and cervical spine elements. Such variation is accentuated in the mandible and lower cervical spine. These random semirigid variations in positioning of the skull and spine point to a need for improved immobilization and/or confirmation of patient positioning in RT of the head and neck

Random Positional Variation Among the Skull, Mandible, and Cervical Spine With Treatment Progression During Head-and-Neck Radiotherapy

Energy Technology Data Exchange (ETDEWEB)

Ahn, Peter H. [Department of Radiation Oncology, Montefiore Medical Center and Albert Einstein College of Medicine, Bronx, NY (United States)], E-mail: phahn@mdanderson.org; Ahn, Andrew I [Albert Einstein College of Medicine of Yeshiva University, Bronx, NY (United States); Lee, C Joe; Jin, Shen; Miller, Ekeni; Lukaj, Alex; Milan, Elissa; Yaparpalvi, Ravindra; Kalnicki, Shalom; Garg, Madhur K [Department of Radiation Oncology, Montefiore Medical Center and Albert Einstein College of Medicine, Bronx, NY (United States)

2009-02-01

Purpose: With 54{sup o} of freedom from the skull to mandible to C7, ensuring adequate immobilization for head-and-neck radiotherapy (RT) is complex. We quantify variations in skull, mandible, and cervical spine movement between RT sessions. Methods and Materials: Twenty-three sequential head-and-neck RT patients underwent serial computed tomography. Patients underwent planned rescanning at 11, 22, and 33 fractions for a total of 93 scans. Coordinates of multiple bony elements of the skull, mandible, and cervical spine were used to calculate rotational and translational changes of bony anatomy compared with the original planning scan. Results: Mean translational and rotational variations on rescanning were negligible, but showed a wide range. Changes in scoliosis and lordosis of the cervical spine between fractions showed similar variability. There was no correlation between positional variation and fraction number and no strong correlation with weight loss or skin separation. Semi-independent rotational and translation movement of the skull in relation to the lower cervical spine was shown. Positioning variability measured by means of vector displacement was largest in the mandible and lower cervical spine. Conclusions: Although only small overall variations in position between head-and-neck RT sessions exist on average, there is significant random variation in patient positioning of the skull, mandible, and cervical spine elements. Such variation is accentuated in the mandible and lower cervical spine. These random semirigid variations in positioning of the skull and spine point to a need for improved immobilization and/or confirmation of patient positioning in RT of the head and neck.

A method for the generation of random multiple Coulomb scattering angles

International Nuclear Information System (INIS)

Campbell, J.R.

1995-06-01

A method for the random generation of spatial angles drawn from non-Gaussian multiple Coulomb scattering distributions is presented. The method employs direct numerical inversion of cumulative probability distributions computed from the universal non-Gaussian angular distributions of Marion and Zimmerman. (author). 12 refs., 3 figs

A data based random number generator for a multivariate distribution (using stochastic interpolation)

Science.gov (United States)

Thompson, J. R.; Taylor, M. S.

1982-01-01

Let X be a K-dimensional random variable serving as input for a system with output Y (not necessarily of dimension k). given X, an outcome Y or a distribution of outcomes G(Y/X) may be obtained either explicitly or implicity. The situation is considered in which there is a real world data set X sub j sub = 1 (n) and a means of simulating an outcome Y. A method for empirical random number generation based on the sample of observations of the random variable X without estimating the underlying density is discussed.

Systematic errors due to linear congruential random-number generators with the Swendsen-Wang algorithm: a warning.

Science.gov (United States)

Ossola, Giovanni; Sokal, Alan D

2004-08-01

We show that linear congruential pseudo-random-number generators can cause systematic errors in Monte Carlo simulations using the Swendsen-Wang algorithm, if the lattice size is a multiple of a very large power of 2 and one random number is used per bond. These systematic errors arise from correlations within a single bond-update half-sweep. The errors can be eliminated (or at least radically reduced) by updating the bonds in a random order or in an aperiodic manner. It also helps to use a generator of large modulus (e.g., 60 or more bits).

On the Generation of Random Ensembles of Qubits and Qutrits Computing Separability Probabilities for Fixed Rank States

Directory of Open Access Journals (Sweden)

Khvedelidze Arsen

2018-01-01

Full Text Available The generation of random mixed states is discussed, aiming for the computation of probabilistic characteristics of composite finite dimensional quantum systems. In particular, we consider the generation of random Hilbert-Schmidt and Bures ensembles of qubit and qutrit pairs and compute the corresponding probabilities to find a separable state among the states of a fixed rank.

Novel Complete Probabilistic Models of Random Variation in High Frequency Performance of Nanoscale MOSFET

Directory of Open Access Journals (Sweden)

Rawid Banchuin

2013-01-01

Full Text Available The novel probabilistic models of the random variations in nanoscale MOSFET's high frequency performance defined in terms of gate capacitance and transition frequency have been proposed. As the transition frequency variation has also been considered, the proposed models are considered as complete unlike the previous one which take only the gate capacitance variation into account. The proposed models have been found to be both analytic and physical level oriented as they are the precise mathematical expressions in terms of physical parameters. Since the up-to-date model of variation in MOSFET's characteristic induced by physical level fluctuation has been used, part of the proposed models for gate capacitance is more accurate and physical level oriented than its predecessor. The proposed models have been verified based on the 65 nm CMOS technology by using the Monte-Carlo SPICE simulations of benchmark circuits and Kolmogorov-Smirnov tests as highly accurate since they fit the Monte-Carlo-based analysis results with 99% confidence. Hence, these novel models have been found to be versatile for the statistical/variability aware analysis/design of nanoscale MOSFET-based analog/mixed signal circuits and systems.

General inverse problems for regular variation

DEFF Research Database (Denmark)

Damek, Ewa; Mikosch, Thomas Valentin; Rosinski, Jan

2014-01-01

Regular variation of distributional tails is known to be preserved by various linear transformations of some random structures. An inverse problem for regular variation aims at understanding whether the regular variation of a transformed random object is caused by regular variation of components ...

The cosmic microwave background radiation power spectrum as a random bit generator for symmetric- and asymmetric-key cryptography.

Science.gov (United States)

Lee, Jeffrey S; Cleaver, Gerald B

2017-10-01

In this note, the Cosmic Microwave Background (CMB) Radiation is shown to be capable of functioning as a Random Bit Generator, and constitutes an effectively infinite supply of truly random one-time pad values of arbitrary length. It is further argued that the CMB power spectrum potentially conforms to the FIPS 140-2 standard. Additionally, its applicability to the generation of a (n × n) random key matrix for a Vernam cipher is established.

A novel image encryption algorithm based on synchronized random bit generated in cascade-coupled chaotic semiconductor ring lasers

Science.gov (United States)

Li, Jiafu; Xiang, Shuiying; Wang, Haoning; Gong, Junkai; Wen, Aijun

2018-03-01

In this paper, a novel image encryption algorithm based on synchronization of physical random bit generated in a cascade-coupled semiconductor ring lasers (CCSRL) system is proposed, and the security analysis is performed. In both transmitter and receiver parts, the CCSRL system is a master-slave configuration consisting of a master semiconductor ring laser (M-SRL) with cross-feedback and a solitary SRL (S-SRL). The proposed image encryption algorithm includes image preprocessing based on conventional chaotic maps, pixel confusion based on control matrix extracted from physical random bit, and pixel diffusion based on random bit stream extracted from physical random bit. Firstly, the preprocessing method is used to eliminate the correlation between adjacent pixels. Secondly, physical random bit with verified randomness is generated based on chaos in the CCSRL system, and is used to simultaneously generate the control matrix and random bit stream. Finally, the control matrix and random bit stream are used for the encryption algorithm in order to change the position and the values of pixels, respectively. Simulation results and security analysis demonstrate that the proposed algorithm is effective and able to resist various typical attacks, and thus is an excellent candidate for secure image communication application.

Methods for identifying SNP interactions: a review on variations of Logic Regression, Random Forest and Bayesian logistic regression.

Science.gov (United States)

Chen, Carla Chia-Ming; Schwender, Holger; Keith, Jonathan; Nunkesser, Robin; Mengersen, Kerrie; Macrossan, Paula

2011-01-01

Due to advancements in computational ability, enhanced technology and a reduction in the price of genotyping, more data are being generated for understanding genetic associations with diseases and disorders. However, with the availability of large data sets comes the inherent challenges of new methods of statistical analysis and modeling. Considering a complex phenotype may be the effect of a combination of multiple loci, various statistical methods have been developed for identifying genetic epistasis effects. Among these methods, logic regression (LR) is an intriguing approach incorporating tree-like structures. Various methods have built on the original LR to improve different aspects of the model. In this study, we review four variations of LR, namely Logic Feature Selection, Monte Carlo Logic Regression, Genetic Programming for Association Studies, and Modified Logic Regression-Gene Expression Programming, and investigate the performance of each method using simulated and real genotype data. We contrast these with another tree-like approach, namely Random Forests, and a Bayesian logistic regression with stochastic search variable selection.

40 CFR 761.308 - Sample selection by random number generation on any two-dimensional square grid.

Science.gov (United States)

2010-07-01

... 40 Protection of Environment 30 2010-07-01 2010-07-01 false Sample selection by random number... § 761.79(b)(3) § 761.308 Sample selection by random number generation on any two-dimensional square... area created in accordance with paragraph (a) of this section, select two random numbers: one each for...

The effects of transcranial magnetic stimulation over the dorsolateral prefrontal cortex on suppression of habitual counting during random number generation.

Science.gov (United States)

Jahanshahi, M; Profice, P; Brown, R G; Ridding, M C; Dirnberger, G; Rothwell, J C

1998-08-01

Random number generation is an attention-demanding task that engages working memory and executive processes. Random number generation requires holding information 'on line', suppression of habitual counting, internally driven response generation and monitoring of responses. Evidence from PET studies suggests that the dorsolateral prefrontal cortex (DLPFC) is involved in the generation of random responses. We examined the effects of short trains of transcranial magnetic stimulation (TMS) over the left or right DLPFC or medial frontal cortex on random number generation in healthy normal participants. As in previous evidence, in control trials without stimulation participants performed poorly on the random number generation task, showing repetition avoidance and a tendency to count. Brief disruption of processing with TMS over the left DLPFC changed the balance of the individuals' counting bias, increasing the most habitual counting in ones and reducing the lower probability response of counting in twos. This differential effect of TMS over the left DLPFC on the balance of the subject's counting bias was not obtained with TMS over the right DLPFC or the medial frontal cortex. The results suggest that, with disruption of the left DLPFC with TMS, habitual counting in ones that has previously been suppressed is released from inhibition. From these findings a network modulation model of random number generation is proposed, whereby suppression of habitual responses is achieved through the modulatory influence of the left DLPFC over a number-associative network in the superior temporal cortex. To allow emergence of appropriate random responses, the left DLPFC inhibits the superior temporal cortex to prevent spreading activation and habitual counting in ones.

An efficient algorithm for generating random number pairs drawn from a bivariate normal distribution

Science.gov (United States)

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.

A Robust SRAM-PUF Key Generation Scheme Based on Polar Codes

OpenAIRE

Chen, Bin; Ignatenko, Tanya; Willems, Frans M. J.; Maes, Roel; van der Sluis, Erik; Selimis, Georgios

2017-01-01

Physical unclonable functions (PUFs) are relatively new security primitives used for device authentication and device-specific secret key generation. In this paper we focus on SRAM-PUFs. The SRAM-PUFs enjoy uniqueness and randomness properties stemming from the intrinsic randomness of SRAM memory cells, which is a result of manufacturing variations. This randomness can be translated into the cryptographic keys thus avoiding the need to store and manage the device cryptographic keys. Therefore...

Application of random number generators in genetic algorithms to improve rainfall-runoff modelling

Science.gov (United States)

Chlumecký, Martin; Buchtele, Josef; Richta, Karel

2017-10-01

The efficient calibration of rainfall-runoff models is a difficult issue, even for experienced hydrologists. Therefore, fast and high-quality model calibration is a valuable improvement. This paper describes a novel methodology and software for the optimisation of a rainfall-runoff modelling using a genetic algorithm (GA) with a newly prepared concept of a random number generator (HRNG), which is the core of the optimisation. The GA estimates model parameters using evolutionary principles, which requires a quality number generator. The new HRNG generates random numbers based on hydrological information and it provides better numbers compared to pure software generators. The GA enhances the model calibration very well and the goal is to optimise the calibration of the model with a minimum of user interaction. This article focuses on improving the internal structure of the GA, which is shielded from the user. The results that we obtained indicate that the HRNG provides a stable trend in the output quality of the model, despite various configurations of the GA. In contrast to previous research, the HRNG speeds up the calibration of the model and offers an improvement of rainfall-runoff modelling.

Efficient stochastic EMC/EMI analysis using HDMR-generated surrogate models

KAUST Repository

Yü cel, Abdulkadir C.; Bagci, Hakan; Michielssen, Eric

2011-01-01

of direct Monte-Carlo (MC) methods. Unfortunately, SC-gPC-generated surrogate models often lack accuracy (i) when the number of uncertain/random system variables is large and/or (ii) when the observables exhibit rapid variations. © 2011 IEEE.

Variation in rates of early development in Haliotis asinina generate competent larvae of different ages

Directory of Open Access Journals (Sweden)

Jackson Daniel J

2012-02-01

Full Text Available Abstract Introduction Inter-specific comparisons of metazoan developmental mechanisms have provided a wealth of data concerning the evolution of body form and the generation of morphological novelty. Conversely, studies of intra-specific variation in developmental programs are far fewer. Variation in the rate of development may be an advantage to the many marine invertebrates that posses a biphasic life cycle, where fitness commonly requires the recruitment of planktonically dispersing larvae to patchily distributed benthic environments. Results We have characterised differences in the rate of development between individuals originating from a synchronised fertilisation event in the tropical abalone Haliotis asinina, a broadcast spawning lecithotrophic vetigastropod. We observed significant differences in the time taken to complete early developmental events (time taken to complete third cleavage and to hatch from the vitelline envelope, mid-larval events (variation in larval shell development and late larval events (the acquisition of competence to respond to a metamorphosis inducing cue. We also provide estimates of the variation in maternally provided energy reserves that suggest maternal provisioning is unlikely to explain the majority of the variation in developmental rate we report here. Conclusions Significant differences in the rates of development exist both within and between cohorts of synchronously fertilised H. asinina gametes. These differences can be detected shortly after fertilisation and generate larvae of increasingly divergent development states. We discuss the significance of our results within an ecological context, the adaptive significance of mechanisms that might maintain this variation, and potential sources of this variation.

Leveraging Random Number Generation for Mastery of Learning in Teaching Quantitative Research Courses via an E-Learning Method

Science.gov (United States)

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…

On the generation of log-Levy distributions and extreme randomness

International Nuclear Information System (INIS)

Eliazar, Iddo; Klafter, Joseph

2011-01-01

The log-normal distribution is prevalent across the sciences, as it emerges from the combination of multiplicative processes and the central limit theorem (CLT). The CLT, beyond yielding the normal distribution, also yields the class of Levy distributions. The log-Levy distributions are the Levy counterparts of the log-normal distribution, they appear in the context of ultraslow diffusion processes, and they are categorized by Mandelbrot as belonging to the class of extreme randomness. In this paper, we present a natural stochastic growth model from which both the log-normal distribution and the log-Levy distributions emerge universally-the former in the case of deterministic underlying setting, and the latter in the case of stochastic underlying setting. In particular, we establish a stochastic growth model which universally generates Mandelbrot's extreme randomness. (paper)

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

Directory of Open Access Journals (Sweden)

Bilan Stepan

2017-01-01

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

Chaotic oscillation and random-number generation based on nanoscale optical-energy transfer.

Science.gov (United States)

Naruse, Makoto; Kim, Song-Ju; Aono, Masashi; Hori, Hirokazu; Ohtsu, Motoichi

2014-08-12

By using nanoscale energy-transfer dynamics and density matrix formalism, we demonstrate theoretically and numerically that chaotic oscillation and random-number generation occur in a nanoscale system. The physical system consists of a pair of quantum dots (QDs), with one QD smaller than the other, between which energy transfers via optical near-field interactions. When the system is pumped by continuous-wave radiation and incorporates a timing delay between two energy transfers within the system, it emits optical pulses. We refer to such QD pairs as nano-optical pulsers (NOPs). Irradiating an NOP with external periodic optical pulses causes the oscillating frequency of the NOP to synchronize with the external stimulus. We find that chaotic oscillation occurs in the NOP population when they are connected by an external time delay. Moreover, by evaluating the time-domain signals by statistical-test suites, we confirm that the signals are sufficiently random to qualify the system as a random-number generator (RNG). This study reveals that even relatively simple nanodevices that interact locally with each other through optical energy transfer at scales far below the wavelength of irradiating light can exhibit complex oscillatory dynamics. These findings are significant for applications such as ultrasmall RNGs.

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.

True random bit generators based on current time series of contact glow discharge electrolysis

Science.gov (United States)

Rojas, Andrea Espinel; Allagui, Anis; Elwakil, Ahmed S.; Alawadhi, Hussain

2018-05-01

Random bit generators (RBGs) in today's digital information and communication systems employ a high rate physical entropy sources such as electronic, photonic, or thermal time series signals. However, the proper functioning of such physical systems is bound by specific constrains that make them in some cases weak and susceptible to external attacks. In this study, we show that the electrical current time series of contact glow discharge electrolysis, which is a dc voltage-powered micro-plasma in liquids, can be used for generating random bit sequences in a wide range of high dc voltages. The current signal is quantized into a binary stream by first using a simple moving average function which makes the distribution centered around zero, and then applying logical operations which enables the binarized data to pass all tests in industry-standard randomness test suite by the National Institute of Standard Technology. Furthermore, the robustness of this RBG against power supply attacks has been examined and verified.

Generation, combination and extension of random set approximations to coherent lower and upper probabilities

International Nuclear Information System (INIS)

Hall, Jim W.; Lawry, Jonathan

2004-01-01

Random set theory provides a convenient mechanism for representing uncertain knowledge including probabilistic and set-based information, and extending it through a function. This paper focuses upon the situation when the available information is in terms of coherent lower and upper probabilities, which are encountered, for example, when a probability distribution is specified by interval parameters. We propose an Iterative Rescaling Method (IRM) for constructing a random set with corresponding belief and plausibility measures that are a close outer approximation to the lower and upper probabilities. The approach is compared with the discrete approximation method of Williamson and Downs (sometimes referred to as the p-box), which generates a closer approximation to lower and upper cumulative probability distributions but in most cases a less accurate approximation to the lower and upper probabilities on the remainder of the power set. Four combination methods are compared by application to example random sets generated using the IRM

Synchronization of random bit generators based on coupled chaotic lasers and application to cryptography.

Science.gov (United States)

Kanter, Ido; Butkovski, Maria; Peleg, Yitzhak; Zigzag, Meital; Aviad, Yaara; Reidler, Igor; Rosenbluh, Michael; Kinzel, Wolfgang

2010-08-16

Random bit generators (RBGs) constitute an important tool in cryptography, stochastic simulations and secure communications. The later in particular has some difficult requirements: high generation rate of unpredictable bit strings and secure key-exchange protocols over public channels. Deterministic algorithms generate pseudo-random number sequences at high rates, however, their unpredictability is limited by the very nature of their deterministic origin. Recently, physical RBGs based on chaotic semiconductor lasers were shown to exceed Gbit/s rates. Whether secure synchronization of two high rate physical RBGs is possible remains an open question. Here we propose a method, whereby two fast RBGs based on mutually coupled chaotic lasers, are synchronized. Using information theoretic analysis we demonstrate security against a powerful computational eavesdropper, capable of noiseless amplification, where all parameters are publicly known. The method is also extended to secure synchronization of a small network of three RBGs.

The cosmic microwave background radiation power spectrum as a random bit generator for symmetric- and asymmetric-key cryptography

Directory of Open Access Journals (Sweden)

Jeffrey S. Lee

2017-10-01

Full Text Available In this note, the Cosmic Microwave Background (CMB Radiation is shown to be capable of functioning as a Random Bit Generator, and constitutes an effectively infinite supply of truly random one-time pad values of arbitrary length. It is further argued that the CMB power spectrum potentially conforms to the FIPS 140-2 standard. Additionally, its applicability to the generation of a (n × n random key matrix for a Vernam cipher is established. Keywords: Particle physics, Computer science, Mathematics, Astrophysics

Randomness at the root of things 1: Random walks

Science.gov (United States)

Ogborn, Jon; Collins, Simon; Brown, Mick

2003-09-01

This is the first of a pair of articles about randomness in physics. In this article, we use some variations on the idea of a `random walk' to consider first the path of a particle in Brownian motion, and then the random variation to be expected in radioactive decay. The arguments are set in the context of the general importance of randomness both in physics and in everyday life. We think that the ideas could usefully form part of students' A-level work on random decay and quantum phenomena, as well as being good for their general education. In the second article we offer a novel and simple approach to Poisson sequences.

Random Intercept and Random Slope 2-Level Multilevel Models

Directory of Open Access Journals (Sweden)

Rehan Ahmad Khan

2012-11-01

Full Text Available Random intercept model and random intercept & random slope model carrying two-levels of hierarchy in the population are presented and compared with the traditional regression approach. The impact of students’ satisfaction on their grade point average (GPA was explored with and without controlling teachers influence. The variation at level-1 can be controlled by introducing the higher levels of hierarchy in the model. The fanny movement of the fitted lines proves variation of student grades around teachers.

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

Science.gov (United States)

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

2011-08-01

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

Variation-aware advanced CMOS devices and SRAM

CERN Document Server

Shin, Changhwan

2016-01-01

This book provides a comprehensive overview of contemporary issues in complementary metal-oxide semiconductor (CMOS) device design, describing how to overcome process-induced random variations such as line-edge-roughness, random-dopant-fluctuation, and work-function variation, and the applications of novel CMOS devices to cache memory (or Static Random Access Memory, SRAM). The author places emphasis on the physical understanding of process-induced random variation as well as the introduction of novel CMOS device structures and their application to SRAM. The book outlines the technical predicament facing state-of-the-art CMOS technology development, due to the effect of ever-increasing process-induced random/intrinsic variation in transistor performance at the sub-30-nm technology nodes. Therefore, the physical understanding of process-induced random/intrinsic variations and the technical solutions to address these issues plays a key role in new CMOS technology development. This book aims to provide the reade...

Precise colocalization of interacting structural and pigmentary elements generates extensive color pattern variation in Phelsuma lizards

Science.gov (United States)

2013-01-01

Background Color traits in animals play crucial roles in thermoregulation, photoprotection, camouflage, and visual communication, and are amenable to objective quantification and modeling. However, the extensive variation in non-melanic pigments and structural colors in squamate reptiles has been largely disregarded. Here, we used an integrated approach to investigate the morphological basis and physical mechanisms generating variation in color traits in tropical day geckos of the genus Phelsuma. Results Combining histology, optics, mass spectrometry, and UV and Raman spectroscopy, we found that the extensive variation in color patterns within and among Phelsuma species is generated by complex interactions between, on the one hand, chromatophores containing yellow/red pteridine pigments and, on the other hand, iridophores producing structural color by constructive interference of light with guanine nanocrystals. More specifically, we show that 1) the hue of the vivid dorsolateral skin is modulated both by variation in geometry of structural, highly ordered narrowband reflectors, and by the presence of yellow pigments, and 2) that the reflectivity of the white belly and of dorsolateral pigmentary red marks, is increased by underlying structural disorganized broadband reflectors. Most importantly, these interactions require precise colocalization of yellow and red chromatophores with different types of iridophores, characterized by ordered and disordered nanocrystals, respectively. We validated these results through numerical simulations combining pigmentary components with a multilayer interferential optical model. Finally, we show that melanophores form dark lateral patterns but do not significantly contribute to variation in blue/green or red coloration, and that changes in the pH or redox state of pigments provide yet another source of color variation in squamates. Conclusions Precisely colocalized interacting pigmentary and structural elements generate extensive

Parallel Monte Carlo Particle Transport and the Quality of Random Number Generators: How Good is Good Enough?

International Nuclear Information System (INIS)

Procassini, R J; Beck, B R

2004-01-01

It might be assumed that use of a ''high-quality'' random number generator (RNG), producing a sequence of ''pseudo random'' numbers with a ''long'' repetition period, is crucial for producing unbiased results in Monte Carlo particle transport simulations. While several theoretical and empirical tests have been devised to check the quality (randomness and period) of an RNG, for many applications it is not clear what level of RNG quality is required to produce unbiased results. This paper explores the issue of RNG quality in the context of parallel, Monte Carlo transport simulations in order to determine how ''good'' is ''good enough''. This study employs the MERCURY Monte Carlo code, which incorporates the CNPRNG library for the generation of pseudo-random numbers via linear congruential generator (LCG) algorithms. The paper outlines the usage of random numbers during parallel MERCURY simulations, and then describes the source and criticality transport simulations which comprise the empirical basis of this study. A series of calculations for each test problem in which the quality of the RNG (period of the LCG) is varied provides the empirical basis for determining the minimum repetition period which may be employed without producing a bias in the mean integrated results

Assessment of the suitability of different random number generators for Monte Carlo simulations in gamma-ray spectrometry

International Nuclear Information System (INIS)

Cornejo Diaz, N.; Vergara Gil, A.; Jurado Vargas, M.

2010-01-01

The Monte Carlo method has become a valuable numerical laboratory framework in which to simulate complex physical systems. It is based on the generation of pseudo-random number sequences by numerical algorithms called random generators. In this work we assessed the suitability of different well-known random number generators for the simulation of gamma-ray spectrometry systems during efficiency calibrations. The assessment was carried out in two stages. The generators considered (Delphi's linear congruential, mersenne twister, XorShift, multiplier with carry, universal virtual array, and non-periodic logistic map based generator) were first evaluated with different statistical empirical tests, including moments, correlations, uniformity, independence of terms and the DIEHARD battery of tests. In a second step, an application-specific test was conducted by implementing the generators in our Monte Carlo program DETEFF and comparing the results obtained with them. The calculations were performed with two different CPUs, for a typical HpGe detector and a water sample in Marinelli geometry, with gamma-rays between 59 and 1800 keV. For the Non-periodic Logistic Map based generator, dependence of the most significant bits was evident. This explains the bias, in excess of 5%, of the efficiency values obtained with this generator. The results of the application-specific assessment and the statistical performance of the other algorithms studied indicate their suitability for the Monte Carlo simulation of gamma-ray spectrometry systems for efficiency calculations.

Assessment of the suitability of different random number generators for Monte Carlo simulations in gamma-ray spectrometry.

Science.gov (United States)

Díaz, N Cornejo; Gil, A Vergara; Vargas, M Jurado

2010-03-01

The Monte Carlo method has become a valuable numerical laboratory framework in which to simulate complex physical systems. It is based on the generation of pseudo-random number sequences by numerical algorithms called random generators. In this work we assessed the suitability of different well-known random number generators for the simulation of gamma-ray spectrometry systems during efficiency calibrations. The assessment was carried out in two stages. The generators considered (Delphi's linear congruential, mersenne twister, XorShift, multiplier with carry, universal virtual array, and non-periodic logistic map based generator) were first evaluated with different statistical empirical tests, including moments, correlations, uniformity, independence of terms and the DIEHARD battery of tests. In a second step, an application-specific test was conducted by implementing the generators in our Monte Carlo program DETEFF and comparing the results obtained with them. The calculations were performed with two different CPUs, for a typical HpGe detector and a water sample in Marinelli geometry, with gamma-rays between 59 and 1800 keV. For the Non-periodic Logistic Map based generator, dependence of the most significant bits was evident. This explains the bias, in excess of 5%, of the efficiency values obtained with this generator. The results of the application-specific assessment and the statistical performance of the other algorithms studied indicate their suitability for the Monte Carlo simulation of gamma-ray spectrometry systems for efficiency calculations. Copyright 2009 Elsevier Ltd. All rights reserved.

Limited phenotypic variation of hypocalcified amelogenesis imperfecta in a danish five-generation family with a novel FAM83H nonsense mutation

DEFF Research Database (Denmark)

Haubek, Dorte; Gjørup, Hans; Jensen, Lillian Gryesten

2011-01-01

Limited phenotypic variation of hypocalcified amelogenesis imperfecta in a danish five-generation family with a novel FAM83H nonsense mutation......Limited phenotypic variation of hypocalcified amelogenesis imperfecta in a danish five-generation family with a novel FAM83H nonsense mutation...

Thermodynamic method for generating random stress distributions on an earthquake fault

Science.gov (United States)

Barall, Michael; Harris, Ruth A.

2012-01-01

This report presents a new method for generating random stress distributions on an earthquake fault, suitable for use as initial conditions in a dynamic rupture simulation. The method employs concepts from thermodynamics and statistical mechanics. A pattern of fault slip is considered to be analogous to a micro-state of a thermodynamic system. The energy of the micro-state is taken to be the elastic energy stored in the surrounding medium. Then, the Boltzmann distribution gives the probability of a given pattern of fault slip and stress. We show how to decompose the system into independent degrees of freedom, which makes it computationally feasible to select a random state. However, due to the equipartition theorem, straightforward application of the Boltzmann distribution leads to a divergence which predicts infinite stress. To avoid equipartition, we show that the finite strength of the fault acts to restrict the possible states of the system. By analyzing a set of earthquake scaling relations, we derive a new formula for the expected power spectral density of the stress distribution, which allows us to construct a computer algorithm free of infinities. We then present a new technique for controlling the extent of the rupture by generating a random stress distribution thousands of times larger than the fault surface, and selecting a portion which, by chance, has a positive stress perturbation of the desired size. Finally, we present a new two-stage nucleation method that combines a small zone of forced rupture with a larger zone of reduced fracture energy.

Assessment of the genetic diversity in five generations of a ...

African Journals Online (AJOL)

Genetic variation among and within five generations of an inbred commercial captive line of Litopenaeus vannamei and genetic distance among them were evaluated by random amplified polymorphic DNA (RAPD), using descriptive and genetic similarity analyses for dominant markers at single- and multi-populational level ...

Generation of dense plume fingers in saturated-unsaturated homogeneous porous media

Science.gov (United States)

Cremer, Clemens J. M.; Graf, Thomas

2015-02-01

Flow under variable-density conditions is widespread, occurring in geothermal reservoirs, at waste disposal sites or due to saltwater intrusion. The migration of dense plumes typically results in the formation of vertical plume fingers which are known to be triggered by material heterogeneity or by variations in source concentration that causes the density variation. Using a numerical groundwater model, six perturbation methods are tested under saturated and unsaturated flow conditions to mimic heterogeneity and concentration variations on the pore scale in order to realistically generate dense fingers. A laboratory-scale sand tank experiment is numerically simulated, and the perturbation methods are evaluated by comparing plume fingers obtained from the laboratory experiment with numerically simulated fingers. Dense plume fingering for saturated flow can best be reproduced with a spatially random, time-constant perturbation of the solute source. For unsaturated flow, a spatially and temporally random noise of solute concentration or a random conductivity field adequately simulate plume fingering.

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

International Nuclear Information System (INIS)

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

2011-01-01

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

A versatile programmable CAMAC random pulse generator

International Nuclear Information System (INIS)

Abdel-Aal, R.E.

1991-01-01

A new technique for generating linear pulses which can be random in both amplitude and time is described. With this technique, desired values for both pulse amplitude and spacing are set for the individual pulses by the software on a pulse-by-pulse basis. The versatility offered by this software programming allows a wide range of distributions to be obtained; with the user having close control on the distribution parameters. A number of such distributions may also be combined into a single output pulse stream. An implementation in a CAMAC module is presented. Both hardware and software aspects are described and typical performance results for amplitude and time distributions of the uniform and Gaussian type are given. Implications of using the pulser in a typical data acquisition environment on both the data acquisition and the pulser performance are considered. Typical applications are discussed together with some of the limitations. (orig.)

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

International Nuclear Information System (INIS)

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

2011-01-01

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

Generated effect modifiers (GEM's) in randomized clinical trials.

Science.gov (United States)

Petkova, Eva; Tarpey, Thaddeus; Su, Zhe; Ogden, R Todd

2017-01-01

In a randomized clinical trial (RCT), it is often of interest not only to estimate the effect of various treatments on the outcome, but also to determine whether any patient characteristic has a different relationship with the outcome, depending on treatment. In regression models for the outcome, if there is a non-zero interaction between treatment and a predictor, that predictor is called an "effect modifier". Identification of such effect modifiers is crucial as we move towards precision medicine, that is, optimizing individual treatment assignment based on patient measurements assessed when presenting for treatment. In most settings, there will be several baseline predictor variables that could potentially modify the treatment effects. This article proposes optimal methods of constructing a composite variable (defined as a linear combination of pre-treatment patient characteristics) in order to generate an effect modifier in an RCT setting. Several criteria are considered for generating effect modifiers and their performance is studied via simulations. An example from a RCT is provided for illustration. © The Author 2016. Published by Oxford University Press. All rights reserved. For permissions, please e-mail: journals.permissions@oup.com.

Random number generation in bilingual Balinese and German students: preliminary findings from an exploratory cross-cultural study.

Science.gov (United States)

Strenge, Hans; Lesmana, Cokorda Bagus Jaya; Suryani, Luh Ketut

2009-08-01

Verbal random number generation is a procedurally simple task to assess executive function and appears ideally suited for the use under diverse settings in cross-cultural research. The objective of this study was to examine ethnic group differences between young adults in Bali (Indonesia) and Kiel (Germany): 50 bilingual healthy students, 30 Balinese and 20 Germans, attempted to generate a random sequence of the digits 1 to 9. In Balinese participants, randomization was done in Balinese (native language L1) and Indonesian (first foreign language L2), in German subjects in the German (L1) and English (L2) languages. 10 of 30 Balinese (33%), but no Germans, were unable to inhibit habitual counting in more than half of the responses. The Balinese produced significantly more nonrandom responses than the Germans with higher rates of counting and significantly less occurrence of the digits 2 and 3 in L1 compared with L2. Repetition and cycling behavior did not differ between the four languages. The findings highlight the importance of taking into account culture-bound psychosocial factors for Balinese individuals when administering and interpreting a random number generation test.

Genetic variation of seedling traits in a random mating population of sunflower

International Nuclear Information System (INIS)

Habib, S.

2004-01-01

Forty S/sub 1/ families obtained from a random mating population of sunflower were evaluated in the laboratory for various seedling traits. The objectives of this study were to investigate the extent and nature of genetic variability and to determine the estimates of genotypic and phenotypic correlations among ten seedling traits prevailing in a random mating population of sunflower. The results indicated that significant differences existed among the 40 S/sub 1/ families for all the traits evaluated. Genotypic and phenotypic coefficients of variation were comparatively high for emergence rate index, root/shoot ratio, dry root weight, fresh root weight and fresh shoot weight. The estimates of broad-sense heritability were high and significant for all the traits. The study of genotypic and phenotypic correlations among these traits revealed that generally, the seedlings which took more time to emerge were vigorous for most of the traits except fresh shoot length. However, rapidly emerging seedlings had higher emergence percentage. The root traits appeared to be better indicators of seedling vigour compared to other traits as these traits exhibited strong and positive genotypic and phenotypic correlations among them. (author)

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

Science.gov (United States)

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

2014-04-01

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

Non-random mating for selection with restricted rates of inbreeding and overlapping generations

NARCIS (Netherlands)

Sonesson, A.K.; Meuwissen, T.H.E.

2002-01-01

Minimum coancestry mating with a maximum of one offspring per mating pair (MC1) is compared with random mating schemes for populations with overlapping generations. Optimum contribution selection is used, whereby $\\\\\\\\Delta F$ is restricted. For schemes with $\\\\\\\\Delta F$ restricted to 0.25% per

On Generating Optimal Signal Probabilities for Random Tests: A Genetic Approach

Directory of Open Access Journals (Sweden)

M. Srinivas

1996-01-01

Full Text Available Genetic Algorithms are robust search and optimization techniques. A Genetic Algorithm based approach for determining the optimal input distributions for generating random test vectors is proposed in the paper. A cost function based on the COP testability measure for determining the efficacy of the input distributions is discussed. A brief overview of Genetic Algorithms (GAs and the specific details of our implementation are described. Experimental results based on ISCAS-85 benchmark circuits are presented. The performance of our GAbased approach is compared with previous results. While the GA generates more efficient input distributions than the previous methods which are based on gradient descent search, the overheads of the GA in computing the input distributions are larger.

Variations in reporting of outcomes in randomized trials on diet and physical activity in pregnancy

DEFF Research Database (Denmark)

Rogozińska, Ewelina; Marlin, Nadine; Yang, Fen

2017-01-01

AIM: Trials on diet and physical activity in pregnancy report on various outcomes. We aimed to assess the variations in outcomes reported and their quality in trials on lifestyle interventions in pregnancy. METHODS: We searched major databases without language restrictions for randomized controlled...... trials on diet and physical activity-based interventions in pregnancy up to March 2015. Two independent reviewers undertook study selection and data extraction. We estimated the percentage of papers reporting 'critically important' and 'important' outcomes. We defined the quality of reporting...... as a proportion using a six-item questionnaire. Regression analysis was used to identify factors affecting this quality. RESULTS: Sixty-six randomized controlled trials were published in 78 papers (66 main, 12 secondary). Gestational diabetes (57.6%, 38/66), preterm birth (48.5%, 32/66) and cesarian section (60...

On a direct algorithm for the generation of log-normal pseudo-random numbers

CERN Document Server

Chamayou, J M F

1976-01-01

The random variable ( Pi /sub i=1//sup n/X/sub i//X/sub i+n/)/sup 1/ square root 2n/ is used to generate standard log normal variables Lambda (0, 1), where the X/sub i/ are independent uniform variables on (0, 1). (8 refs).

Generation of correlated finite alphabet waveforms using gaussian random variables

KAUST Repository

Ahmed, Sajid

2016-01-13

Various examples of methods and systems are provided for generation of correlated finite alphabet waveforms using Gaussian random variables in, e.g., radar and communication applications. In one example, a method includes mapping an input signal comprising Gaussian random variables (RVs) onto finite-alphabet non-constant-envelope (FANCE) symbols using a predetermined mapping function, and transmitting FANCE waveforms through a uniform linear array of antenna elements to obtain a corresponding beampattern. The FANCE waveforms can be based upon the mapping of the Gaussian RVs onto the FANCE symbols. In another example, a system includes a memory unit that can store a plurality of digital bit streams corresponding to FANCE symbols and a front end unit that can transmit FANCE waveforms through a uniform linear array of antenna elements to obtain a corresponding beampattern. The system can include a processing unit that can encode the input signal and/or determine the mapping function.

Generation of correlated finite alphabet waveforms using gaussian random variables

KAUST Repository

Ahmed, Sajid; Alouini, Mohamed-Slim; Jardak, Seifallah

2016-01-01

Various examples of methods and systems are provided for generation of correlated finite alphabet waveforms using Gaussian random variables in, e.g., radar and communication applications. In one example, a method includes mapping an input signal comprising Gaussian random variables (RVs) onto finite-alphabet non-constant-envelope (FANCE) symbols using a predetermined mapping function, and transmitting FANCE waveforms through a uniform linear array of antenna elements to obtain a corresponding beampattern. The FANCE waveforms can be based upon the mapping of the Gaussian RVs onto the FANCE symbols. In another example, a system includes a memory unit that can store a plurality of digital bit streams corresponding to FANCE symbols and a front end unit that can transmit FANCE waveforms through a uniform linear array of antenna elements to obtain a corresponding beampattern. The system can include a processing unit that can encode the input signal and/or determine the mapping function.

Evolving cellular automata for diversity generation and pattern recognition: deterministic versus random strategy

International Nuclear Information System (INIS)

De Menezes, Marcio Argollo; Brigatti, Edgardo; Schwämmle, Veit

2013-01-01

Microbiological systems evolve to fulfil their tasks with maximal efficiency. The immune system is a remarkable example, where the distinction between self and non-self is made by means of molecular interaction between self-proteins and antigens, triggering affinity-dependent systemic actions. Specificity of this binding and the infinitude of potential antigenic patterns call for novel mechanisms to generate antibody diversity. Inspired by this problem, we develop a genetic algorithm where agents evolve their strings in the presence of random antigenic strings and reproduce with affinity-dependent rates. We ask what is the best strategy to generate diversity if agents can rearrange their strings a finite number of times. We find that endowing each agent with an inheritable cellular automaton rule for performing rearrangements makes the system more efficient in pattern-matching than if transformations are totally random. In the former implementation, the population evolves to a stationary state where agents with different automata rules coexist. (paper)

Variational data assimilation using targetted random walks

KAUST Repository

Cotter, S. L.

2011-02-15

The variational approach to data assimilation is a widely used methodology for both online prediction and for reanalysis. In either of these scenarios, it can be important to assess uncertainties in the assimilated state. Ideally, it is desirable to have complete information concerning the Bayesian posterior distribution for unknown state given data. We show that complete computational probing of this posterior distribution is now within the reach in the offline situation. We introduce a Markov chain-Monte Carlo (MCMC) method which enables us to directly sample from the Bayesian posterior distribution on the unknown functions of interest given observations. Since we are aware that these methods are currently too computationally expensive to consider using in an online filtering scenario, we frame this in the context of offline reanalysis. Using a simple random walk-type MCMC method, we are able to characterize the posterior distribution using only evaluations of the forward model of the problem, and of the model and data mismatch. No adjoint model is required for the method we use; however, more sophisticated MCMC methods are available which exploit derivative information. For simplicity of exposition, we consider the problem of assimilating data, either Eulerian or Lagrangian, into a low Reynolds number flow in a two-dimensional periodic geometry. We will show that in many cases it is possible to recover the initial condition and model error (which we describe as unknown forcing to the model) from data, and that with increasing amounts of informative data, the uncertainty in our estimations reduces. © 2011 John Wiley & Sons, Ltd.

A high-speed on-chip pseudo-random binary sequence generator for multi-tone phase calibration

Science.gov (United States)

Gommé, Liesbeth; Vandersteen, Gerd; Rolain, Yves

2011-07-01

An on-chip reference generator is conceived by adopting the technique of decimating a pseudo-random binary sequence (PRBS) signal in parallel sequences. This is of great benefit when high-speed generation of PRBS and PRBS-derived signals is the objective. The design implemented standard CMOS logic is available in commercial libraries to provide the logic functions for the generator. The design allows the user to select the periodicity of the PRBS and the PRBS-derived signals. The characterization of the on-chip generator marks its performance and reveals promising specifications.

A high-speed on-chip pseudo-random binary sequence generator for multi-tone phase calibration

International Nuclear Information System (INIS)

Gommé, Liesbeth; Vandersteen, Gerd; Rolain, Yves

2011-01-01

An on-chip reference generator is conceived by adopting the technique of decimating a pseudo-random binary sequence (PRBS) signal in parallel sequences. This is of great benefit when high-speed generation of PRBS and PRBS-derived signals is the objective. The design implemented standard CMOS logic is available in commercial libraries to provide the logic functions for the generator. The design allows the user to select the periodicity of the PRBS and the PRBS-derived signals. The characterization of the on-chip generator marks its performance and reveals promising specifications

Model and scenario variations in predicted number of generations of Spodoptera litura Fab. on peanut during future climate change scenario.

Directory of Open Access Journals (Sweden)

Mathukumalli Srinivasa Rao

Full Text Available The present study features the estimation of number of generations of tobacco caterpillar, Spodoptera litura. Fab. on peanut crop at six locations in India using MarkSim, which provides General Circulation Model (GCM of future data on daily maximum (T.max, minimum (T.min air temperatures from six models viz., BCCR-BCM2.0, CNRM-CM3, CSIRO-Mk3.5, ECHams5, INCM-CM3.0 and MIROC3.2 along with an ensemble of the six from three emission scenarios (A2, A1B and B1. This data was used to predict the future pest scenarios following the growing degree days approach in four different climate periods viz., Baseline-1975, Near future (NF -2020, Distant future (DF-2050 and Very Distant future (VDF-2080. It is predicted that more generations would occur during the three future climate periods with significant variation among scenarios and models. Among the seven models, 1-2 additional generations were predicted during DF and VDF due to higher future temperatures in CNRM-CM3, ECHams5 & CSIRO-Mk3.5 models. The temperature projections of these models indicated that the generation time would decrease by 18-22% over baseline. Analysis of variance (ANOVA was used to partition the variation in the predicted number of generations and generation time of S. litura on peanut during crop season. Geographical location explained 34% of the total variation in number of generations, followed by time period (26%, model (1.74% and scenario (0.74%. The remaining 14% of the variation was explained by interactions. Increased number of generations and reduction of generation time across the six peanut growing locations of India suggest that the incidence of S. litura may increase due to projected increase in temperatures in future climate change periods.

Random generation of bubble sizes on the heated wall during subcooled boiling

International Nuclear Information System (INIS)

Koncar, B.; Mavko, B.

2003-01-01

In subcooled flow boiling, a locally averaged bubble diameter significantly varies in the transverse direction to the flow. From the experimental data of Bartel, a bent crosssectional profile of local bubble diameter with the maximum value shifted away from the heated wall may be observed. In the present paper, the increasing part of the profile (near the heated wall) is explained by a random generation of bubble sizes on the heated wall. The hypothesis was supported by a statistical analysis of different CFD simulations, varying by the size of the generated bubble (normal distribution) and the number of generated bubbles per unit surface. Local averaging of calculated void fraction distributions over different bubble classes was performed. The increasing curve of the locally averaged bubble diameter in the near-wall region was successfully predicted. (author)

Hardware random number generator base on monostable multivibrators dedicated for distributed measurement and control systems

Science.gov (United States)

Czernik, Pawel

2013-10-01

The hardware random number generator based on the 74121 monostable multivibrators for applications in cryptographically secure distributed measurement and control systems with asymmetric resources was presented. This device was implemented on the basis of the physical electronic vibration generator in which the circuit is composed of two "loop" 74121 monostable multivibrators, D flip-flop and external clock signal source. The clock signal, witch control D flip-flop was generated by a computer on one of the parallel port pins. There was presented programmed the author's acquisition process of random data from the measuring system to a computer. The presented system was designed, builded and thoroughly tested in the term of cryptographic security in our laboratory, what there is the most important part of this publication. Real cryptographic security was tested based on the author's software and the software environment called RDieHarder. The obtained results was here presented and analyzed in detail with particular reference to the specificity of distributed measurement and control systems with asymmetric resources.

Generated effect modifiers (GEM’s) in randomized clinical trials

Science.gov (United States)

Petkova, Eva; Tarpey, Thaddeus; Su, Zhe; Ogden, R. Todd

2017-01-01

In a randomized clinical trial (RCT), it is often of interest not only to estimate the effect of various treatments on the outcome, but also to determine whether any patient characteristic has a different relationship with the outcome, depending on treatment. In regression models for the outcome, if there is a non-zero interaction between treatment and a predictor, that predictor is called an “effect modifier”. Identification of such effect modifiers is crucial as we move towards precision medicine, that is, optimizing individual treatment assignment based on patient measurements assessed when presenting for treatment. In most settings, there will be several baseline predictor variables that could potentially modify the treatment effects. This article proposes optimal methods of constructing a composite variable (defined as a linear combination of pre-treatment patient characteristics) in order to generate an effect modifier in an RCT setting. Several criteria are considered for generating effect modifiers and their performance is studied via simulations. An example from a RCT is provided for illustration. PMID:27465235

Smoothing Brascamp-Lieb Inequalities and Strong Converses for Common Randomness Generation

OpenAIRE

Liu, Jingbo; Courtade, Thomas A.; Cuff, Paul; Verdu, Sergio

2016-01-01

We study the infimum of the best constant in a functional inequality, the Brascamp-Lieb-like inequality, over auxiliary measures within a neighborhood of a product distribution. In the finite alphabet and the Gaussian cases, such an infimum converges to the best constant in a mutual information inequality. Implications for strong converse properties of two common randomness (CR) generation problems are discussed. In particular, we prove the strong converse property of the rate region for the ...

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

OpenAIRE

Chen, Jiageng; Miyaji, Atsuko; Su, Chunhua

2014-01-01

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

Genetic variations of Lansium domesticum Corr. accessions from Java, Sumatra and Ceram based on Random Amplified Polymorphic DNA fingerprints

Directory of Open Access Journals (Sweden)

KUSUMADEWI SRI YULITA

2011-07-01

Full Text Available Yulita KS (2011 Genetic variations of Lansium domesticum Corr. accessions from Java, Bengkulu and Ceram based on Random Amplified Polymorphic DNA fingerprints. Biodiversitas 12: 125-130. Duku (Lansium domesticum Corr. is one of popular tropical fruits in SE Asia. The spesies has three varieties, known as duku, langsat and kokosan; and duku is the most popular one for being the sweetiest fruit. Indonesia has several local varieties of duku, such as duku Condet, duku Sumber and duku Palembang. This present study aimed to assess genetic diversity of 47 accessions of duku from Java, Sumatra, and Ceram based on RAPD fingerprints. Ten RAPD’s primers were initially screened and five were selected for the analysis. These five primers (OPA 7, 13, 18, OPB 7, and OPN 12 generated 53 scorable bands with an average of 10.6 polymorphic fragment per primer. Percentage of polymorphism ranged from 16.89% (OPA 7 and OPN 12 to 24.54% (OPB 7 with an average of 20.16% polymorphism. OPB 7 at 450 bp was exclusively possessed by accession 20 (Java, OPA 18 at 500 bp was by accession 6 (Java, 550 bp by 3 clones from Bengkulu. While OPN 12 at 300 bp and OPA 13 at 450 bp were shared among the accessions. Clustering analysis was performed based on RAPD profiles using the UPGMA method. The range of genetic similarity value among accessions was 0.02-0.65 suggesting high variation of gene pool existed among accessions.

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

Science.gov (United States)

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

2011-08-01

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

Situational variations in ethnic identity across immigration generations: Implications for acculturative change and cross-cultural adaptation.

Science.gov (United States)

Noels, Kimberly A; Clément, Richard

2015-12-01

This study examined whether the acculturation of ethnic identity is first evident in more public situations with greater opportunity for intercultural interaction and eventually penetrates more intimate situations. It also investigated whether situational variations in identity are associated with cross-cultural adaptation. First-generation (G1), second-generation (G2) and mixed-parentage second-generation (G2.5) young adult Canadians (n = 137, n = 169, and n = 91, respectively) completed a questionnaire assessing their heritage and Canadian identities across four situational domains (family, friends, university and community), global heritage identity and cross-cultural adaptation. Consistent with the acculturation penetration hypothesis, the results showed Canadian identity was stronger than heritage identity in public domains, but the converse was true in the family domain; moreover, the difference between the identities in the family domain was attenuated in later generations. Situational variability indicated better adaptation for the G1 cohort, but poorer adaptation for the G2.5 cohort. For the G2 cohort, facets of global identity moderated the relation, such that those with a weaker global identity experienced greater difficulties and hassles with greater identity variability but those with a stronger identity did not. These results are interpreted in light of potential interpersonal issues implied by situational variation for each generation cohort. © 2015 International Union of Psychological Science.

Electrostatic Swelling and Conformational Variation Observed in High-Generation Polyelectrolyte Dendrimers

International Nuclear Information System (INIS)

Butler, Paul D.; Chen, Wei-Ren; Herwig, Kenneth W.; Hong, Kunlun; Liu, Yun; Porcar, L.; Shew, Chwen-Yang; Smith, Gregory Scott; Chen, Hsin-Lung; Chen, Chun-Yu; Li, Xin; Liu, Emily

2010-01-01

A coordinated study combining small angle neutron scattering (SANS) and small angle x-ray scattering (SAXS) measurements was conducted to investigate the structural characteristics of aqueous (D2O) generation 7 and 8 (G7 and G8) PAMAM dendrimer solutions as a function of molecular protonation at room temperature. The change in intra-molecular conformation was clearly exhibited in the data analysis by separating the variation in the inter-molecular correlation. Our results unambiguously demonstrate an increased molecular size and evolved intra-molecular density profile upon increasing the molecular protonation. This is contrary to the existing understanding that in higher generation polyelectrolyte dendrimers, steric crowding stiffens the local motion of dendrimer segments exploring additional available intra-dendrimer volume and therefore inhibits the electrostatic swelling. Our observation is relevant to elucidation of the general microscopic picture of polyelectrolyte dendrimer structure, as well as the development of dendrimer-based packages with based on the stimuli-responsive principle.

Precise algorithm to generate random sequential adsorption of hard polygons at saturation

Science.gov (United States)

Zhang, G.

2018-04-01

Random sequential adsorption (RSA) is a time-dependent packing process, in which particles of certain shapes are randomly and sequentially placed into an empty space without overlap. In the infinite-time limit, the density approaches a "saturation" limit. Although this limit has attracted particular research interest, the majority of past studies could only probe this limit by extrapolation. We have previously found an algorithm to reach this limit using finite computational time for spherical particles and could thus determine the saturation density of spheres with high accuracy. In this paper, we generalize this algorithm to generate saturated RSA packings of two-dimensional polygons. We also calculate the saturation density for regular polygons of three to ten sides and obtain results that are consistent with previous, extrapolation-based studies.

Random number generation as an index of controlled processing.

Science.gov (United States)

Jahanshahi, Marjan; Saleem, T; Ho, Aileen K; Dirnberger, Georg; Fuller, R

2006-07-01

Random number generation (RNG) is a functionally complex process that is highly controlled and therefore dependent on Baddeley's central executive. This study addresses this issue by investigating whether key predictions from this framework are compatible with empirical data. In Experiment 1, the effect of increasing task demands by increasing the rate of the paced generation was comprehensively examined. As expected, faster rates affected performance negatively because central resources were increasingly depleted. Next, the effects of participants' exposure were manipulated in Experiment 2 by providing increasing amounts of practice on the task. There was no improvement over 10 practice trials, suggesting that the high level of strategic control required by the task was constant and not amenable to any automatization gain with repeated exposure. Together, the results demonstrate that RNG performance is a highly controlled and demanding process sensitive to additional demands on central resources (Experiment 1) and is unaffected by repeated performance or practice (Experiment 2). These features render the easily administered RNG task an ideal and robust index of executive function that is highly suitable for repeated clinical use. ((c) 2006 APA, all rights reserved).

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.

Theory and implementation of a very high throughput true random number generator in field programmable gate array

Energy Technology Data Exchange (ETDEWEB)

Wang, Yonggang, E-mail: wangyg@ustc.edu.cn; Hui, Cong; Liu, Chong; Xu, Chao [Department of Modern Physics, University of Science and Technology of China, Hefei 230026 (China)

2016-04-15

The contribution of this paper is proposing a new entropy extraction mechanism based on sampling phase jitter in ring oscillators to make a high throughput true random number generator in a field programmable gate array (FPGA) practical. Starting from experimental observation and analysis of the entropy source in FPGA, a multi-phase sampling method is exploited to harvest the clock jitter with a maximum entropy and fast sampling speed. This parametrized design is implemented in a Xilinx Artix-7 FPGA, where the carry chains in the FPGA are explored to realize the precise phase shifting. The generator circuit is simple and resource-saving, so that multiple generation channels can run in parallel to scale the output throughput for specific applications. The prototype integrates 64 circuit units in the FPGA to provide a total output throughput of 7.68 Gbps, which meets the requirement of current high-speed quantum key distribution systems. The randomness evaluation, as well as its robustness to ambient temperature, confirms that the new method in a purely digital fashion can provide high-speed high-quality random bit sequences for a variety of embedded applications.

Heuristic Relative Entropy Principles with Complex Measures: Large-Degree Asymptotics of a Family of Multi-variate Normal Random Polynomials

Science.gov (United States)

Kiessling, Michael Karl-Heinz

2017-10-01

Let z\\in C, let σ ^2>0 be a variance, and for N\\in N define the integrals E_N^{}(z;σ ) := {1/σ } \\int _R\\ (x^2+z^2) e^{-{1/2σ^2 x^2}}{√{2π }}/dx \\quad if N=1, {1/σ } \\int _{R^N} \\prod \\prod \\limits _{1≤ k1. These are expected values of the polynomials P_N^{}(z)=\\prod _{1≤ n≤ N}(X_n^2+z^2) whose 2 N zeros ± i X_k^{}_{k=1,\\ldots ,N} are generated by N identically distributed multi-variate mean-zero normal random variables {X_k}N_{k=1} with co-variance {Cov}_N^{}(X_k,X_l)=(1+σ ^2-1/N)δ _{k,l}+σ ^2-1/N(1-δ _{k,l}). The E_N^{}(z;σ ) are polynomials in z^2, explicitly computable for arbitrary N, yet a list of the first three E_N^{}(z;σ ) shows that the expressions become unwieldy already for moderate N—unless σ = 1, in which case E_N^{}(z;1) = (1+z^2)^N for all z\\in C and N\\in N. (Incidentally, commonly available computer algebra evaluates the integrals E_N^{}(z;σ ) only for N up to a dozen, due to memory constraints). Asymptotic evaluations are needed for the large- N regime. For general complex z these have traditionally been limited to analytic expansion techniques; several rigorous results are proved for complex z near 0. Yet if z\\in R one can also compute this "infinite-degree" limit with the help of the familiar relative entropy principle for probability measures; a rigorous proof of this fact is supplied. Computer algebra-generated evidence is presented in support of a conjecture that a generalization of the relative entropy principle to signed or complex measures governs the N→ ∞ asymptotics of the regime iz\\in R. Potential generalizations, in particular to point vortex ensembles and the prescribed Gauss curvature problem, and to random matrix ensembles, are emphasized.

Generation of Variations on Theme Music Based on Impressions of Story Scenes Considering Human's Feeling of Music and Stories

Directory of Open Access Journals (Sweden)

Kenkichi Ishizuka

2008-01-01

Full Text Available This paper describes a system which generates variations on theme music fitting to story scenes represented by texts and/or pictures. Inputs to the present system are original theme music and numerical information on given story scenes. The present system varies melodies, tempos, tones, tonalities, and accompaniments of given theme music based on impressions of story scenes. Genetic algorithms (GAs using modular neural network (MNN models as fitness functions are applied to music generation in order to reflect user's feeling of music and stories. The present system adjusts MNN models for each user on line. This paper also describes the evaluation experiments to confirm whether the generated variations on theme music reflect impressions of story scenes appropriately or not.

Analytical and between-subject variation of thrombin generation measured by calibrated automated thrombography on plasma samples.

Science.gov (United States)

Kristensen, Anne F; Kristensen, Søren R; Falkmer, Ursula; Münster, Anna-Marie B; Pedersen, Shona

2018-05-01

The Calibrated Automated Thrombography (CAT) is an in vitro thrombin generation (TG) assay that holds promise as a valuable tool within clinical diagnostics. However, the technique has a considerable analytical variation, and we therefore, investigated the analytical and between-subject variation of CAT systematically. Moreover, we assess the application of an internal standard for normalization to diminish variation. 20 healthy volunteers donated one blood sample which was subsequently centrifuged, aliquoted and stored at -80 °C prior to analysis. The analytical variation was determined on eight runs, where plasma from the same seven volunteers was processed in triplicates, and for the between-subject variation, TG analysis was performed on plasma from all 20 volunteers. The trigger reagents used for the TG assays included both PPP reagent containing 5 pM tissue factor (TF) and PPPlow with 1 pM TF. Plasma, drawn from a single donor, was applied to all plates as an internal standard for each TG analysis, which subsequently was used for normalization. The total analytical variation for TG analysis performed with PPPlow reagent is 3-14% and 9-13% for PPP reagent. This variation can be minimally reduced by using an internal standard but mainly for ETP (endogenous thrombin potential). The between-subject variation is higher when using PPPlow than PPP and this variation is considerable higher than the analytical variation. TG has a rather high inherent analytical variation but considerable lower than the between-subject variation when using PPPlow as reagent.

Selectivity and sparseness in randomly connected balanced networks.

Directory of Open Access Journals (Sweden)

Cengiz Pehlevan

Full Text Available Neurons in sensory cortex show stimulus selectivity and sparse population response, even in cases where no strong functionally specific structure in connectivity can be detected. This raises the question whether selectivity and sparseness can be generated and maintained in randomly connected networks. We consider a recurrent network of excitatory and inhibitory spiking neurons with random connectivity, driven by random projections from an input layer of stimulus selective neurons. In this architecture, the stimulus-to-stimulus and neuron-to-neuron modulation of total synaptic input is weak compared to the mean input. Surprisingly, we show that in the balanced state the network can still support high stimulus selectivity and sparse population response. In the balanced state, strong synapses amplify the variation in synaptic input and recurrent inhibition cancels the mean. Functional specificity in connectivity emerges due to the inhomogeneity caused by the generative statistical rule used to build the network. We further elucidate the mechanism behind and evaluate the effects of model parameters on population sparseness and stimulus selectivity. Network response to mixtures of stimuli is investigated. It is shown that a balanced state with unselective inhibition can be achieved with densely connected input to inhibitory population. Balanced networks exhibit the "paradoxical" effect: an increase in excitatory drive to inhibition leads to decreased inhibitory population firing rate. We compare and contrast selectivity and sparseness generated by the balanced network to randomly connected unbalanced networks. Finally, we discuss our results in light of experiments.

Forward modeling of gravity data using geostatistically generated subsurface density variations

Science.gov (United States)

Phelps, Geoffrey

2016-01-01

Using geostatistical models of density variations in the subsurface, constrained by geologic data, forward models of gravity anomalies can be generated by discretizing the subsurface and calculating the cumulative effect of each cell (pixel). The results of such stochastically generated forward gravity anomalies can be compared with the observed gravity anomalies to find density models that match the observed data. These models have an advantage over forward gravity anomalies generated using polygonal bodies of homogeneous density because generating numerous realizations explores a larger region of the solution space. The stochastic modeling can be thought of as dividing the forward model into two components: that due to the shape of each geologic unit and that due to the heterogeneous distribution of density within each geologic unit. The modeling demonstrates that the internally heterogeneous distribution of density within each geologic unit can contribute significantly to the resulting calculated forward gravity anomaly. Furthermore, the stochastic models match observed statistical properties of geologic units, the solution space is more broadly explored by producing a suite of successful models, and the likelihood of a particular conceptual geologic model can be compared. The Vaca Fault near Travis Air Force Base, California, can be successfully modeled as a normal or strike-slip fault, with the normal fault model being slightly more probable. It can also be modeled as a reverse fault, although this structural geologic configuration is highly unlikely given the realizations we explored.

Random number generators for large-scale parallel Monte Carlo simulations on FPGA

Science.gov (United States)

Lin, Y.; Wang, F.; Liu, B.

2018-05-01

Through parallelization, field programmable gate array (FPGA) can achieve unprecedented speeds in large-scale parallel Monte Carlo (LPMC) simulations. FPGA presents both new constraints and new opportunities for the implementations of random number generators (RNGs), which are key elements of any Monte Carlo (MC) simulation system. Using empirical and application based tests, this study evaluates all of the four RNGs used in previous FPGA based MC studies and newly proposed FPGA implementations for two well-known high-quality RNGs that are suitable for LPMC studies on FPGA. One of the newly proposed FPGA implementations: a parallel version of additive lagged Fibonacci generator (Parallel ALFG) is found to be the best among the evaluated RNGs in fulfilling the needs of LPMC simulations on FPGA.

Adaptive force produced by stress-induced regulation of random variation intensity.

Science.gov (United States)

Shimansky, Yury P

2010-08-01

The Darwinian theory of life evolution is capable of explaining the majority of related phenomena. At the same time, the mechanisms of optimizing traits beneficial to a population as a whole but not directly to an individual remain largely unclear. There are also significant problems with explaining the phenomenon of punctuated equilibrium. From another perspective, multiple mechanisms for the regulation of the rate of genetic mutations according to the environmental stress have been discovered, but their precise functional role is not well understood yet. Here a novel mathematical paradigm called a Kinetic-Force Principle (KFP), which can serve as a general basis for biologically plausible optimization methods, is introduced and its rigorous derivation is provided. Based on this principle, it is shown that, if the rate of random changes in a biological system is proportional, even only roughly, to the amount of environmental stress, a virtual force is created, acting in the direction of stress relief. It is demonstrated that KFP can provide important insights into solving the above problems. Evidence is presented in support of a hypothesis that the nature employs KFP for accelerating adaptation in biological systems. A detailed comparison between KFP and the principle of variation and natural selection is presented and their complementarity is revealed. It is concluded that KFP is not a competing alternative, but a powerful addition to the principle of variation and natural selection. It is also shown KFP can be used in multiple ways for adaptation of individual biological organisms.

Examining Psychokinesis: The Interaction of Human Intention with Random Number Generators--A Meta-Analysis

Science.gov (United States)

Bosch, Holger; Steinkamp, Fiona; Boller, Emil

2006-01-01

Seance-room and other large-scale psychokinetic phenomena have fascinated humankind for decades. Experimental research has reduced these phenomena to attempts to influence (a) the fall of dice and, later, (b) the output of random number generators (RNGs). The meta-analysis combined 380 studies that assessed whether RNG output correlated with human…

An Architecturally Constrained Model of Random Number Generation and its Application to Modelling the Effect of Generation Rate

Directory of Open Access Journals (Sweden)

Nicholas J. Sexton

2014-07-01

Full Text Available Random number generation (RNG is a complex cognitive task for human subjects, requiring deliberative control to avoid production of habitual, stereotyped sequences. Under various manipulations (e.g., speeded responding, transcranial magnetic stimulation, or neurological damage the performance of human subjects deteriorates, as reflected in a number of qualitatively distinct, dissociable biases. For example, the intrusion of stereotyped behaviour (e.g., counting increases at faster rates of generation. Theoretical accounts of the task postulate that it requires the integrated operation of multiple, computationally heterogeneous cognitive control ('executive' processes. We present a computational model of RNG, within the framework of a novel, neuropsychologically-inspired cognitive architecture, ESPro. Manipulating the rate of sequence generation in the model reproduced a number of key effects observed in empirical studies, including increasing sequence stereotypy at faster rates. Within the model, this was due to time limitations on the interaction of supervisory control processes, namely, task setting, proposal of responses, monitoring, and response inhibition. The model thus supports the fractionation of executive function into multiple, computationally heterogeneous processes.

Creating, generating and comparing random network models with NetworkRandomizer.

Science.gov (United States)

Tosadori, Gabriele; Bestvina, Ivan; Spoto, Fausto; Laudanna, Carlo; Scardoni, Giovanni

2016-01-01

Biological networks are becoming a fundamental tool for the investigation of high-throughput data in several fields of biology and biotechnology. With the increasing amount of information, network-based models are gaining more and more interest and new techniques are required in order to mine the information and to validate the results. To fill the validation gap we present an app, for the Cytoscape platform, which aims at creating randomised networks and randomising existing, real networks. Since there is a lack of tools that allow performing such operations, our app aims at enabling researchers to exploit different, well known random network models that could be used as a benchmark for validating real, biological datasets. We also propose a novel methodology for creating random weighted networks, i.e. the multiplication algorithm, starting from real, quantitative data. Finally, the app provides a statistical tool that compares real versus randomly computed attributes, in order to validate the numerical findings. In summary, our app aims at creating a standardised methodology for the validation of the results in the context of the Cytoscape platform.

Environmental and geographic variables are effective surrogates for genetic variation in conservation planning.

Science.gov (United States)

Hanson, Jeffrey O; Rhodes, Jonathan R; Riginos, Cynthia; Fuller, Richard A

2017-11-28

Protected areas buffer species from anthropogenic threats and provide places for the processes that generate and maintain biodiversity to continue. However, genetic variation, the raw material for evolution, is difficult to capture in conservation planning, not least because genetic data require considerable resources to obtain and analyze. Here we show that freely available environmental and geographic distance variables can be highly effective surrogates in conservation planning for representing adaptive and neutral intraspecific genetic variation. We obtained occurrence and genetic data from the IntraBioDiv project for 27 plant species collected over the European Alps using a gridded sampling scheme. For each species, we identified loci that were potentially under selection using outlier loci methods, and mapped their main gradients of adaptive and neutral genetic variation across the grid cells. We then used the cells as planning units to prioritize protected area acquisitions. First, we verified that the spatial patterns of environmental and geographic variation were correlated, respectively, with adaptive and neutral genetic variation. Second, we showed that these surrogates can predict the proportion of genetic variation secured in randomly generated solutions. Finally, we discovered that solutions based only on surrogate information secured substantial amounts of adaptive and neutral genetic variation. Our work paves the way for widespread integration of surrogates for genetic variation into conservation planning.

Genarris: Random generation of molecular crystal structures and fast screening with a Harris approximation

Science.gov (United States)

Li, Xiayue; Curtis, Farren S.; Rose, Timothy; Schober, Christoph; Vazquez-Mayagoitia, Alvaro; Reuter, Karsten; Oberhofer, Harald; Marom, Noa

2018-06-01

We present Genarris, a Python package that performs configuration space screening for molecular crystals of rigid molecules by random sampling with physical constraints. For fast energy evaluations, Genarris employs a Harris approximation, whereby the total density of a molecular crystal is constructed via superposition of single molecule densities. Dispersion-inclusive density functional theory is then used for the Harris density without performing a self-consistency cycle. Genarris uses machine learning for clustering, based on a relative coordinate descriptor developed specifically for molecular crystals, which is shown to be robust in identifying packing motif similarity. In addition to random structure generation, Genarris offers three workflows based on different sequences of successive clustering and selection steps: the "Rigorous" workflow is an exhaustive exploration of the potential energy landscape, the "Energy" workflow produces a set of low energy structures, and the "Diverse" workflow produces a maximally diverse set of structures. The latter is recommended for generating initial populations for genetic algorithms. Here, the implementation of Genarris is reported and its application is demonstrated for three test cases.

Insights into pre-reversal paleosecular variation from stochastic models

Directory of Open Access Journals (Sweden)

Klaudio ePeqini

2015-09-01

Full Text Available To provide insights on the paleosecular variation of the geomagnetic field and the mechanism of reversals, long time series of the dipolar magnetic moment are generated by two different stochastic models, known as the domino model and the inhomogeneous Lebovitz disk dynamo model, with initial values taken from the from paleomagnetic data. The former model considers mutual interactions of N macrospins embedded in a uniformly rotating medium, where random forcing and dissipation act on each macrospin. With an appropriate set of the model’s parameters values, the series generated by this model have similar statistical behaviour to the time series of the SHA.DIF.14K model. The latter model is an extension of the classical two-disk Rikitake model, considering N dynamo elements with appropriate interactions between them.We varied the parameters set of both models aiming at generating suitable time series with behaviour similar to the long time series of recent secular variation (SV. Such series are then extended to the near future, obtaining reversals in both cases of models. The analysis of the time series generated by simulating the models show that the reversals appears after a persistent period of low intensity geomagnetic field, as it is occurring in the present times.

Molecular Darwinism: the contingency of spontaneous genetic variation.

Science.gov (United States)

Arber, Werner

2011-01-01

The availability of spontaneously occurring genetic variants is an important driving force of biological evolution. Largely thanks to experimental investigations by microbial geneticists, we know today that several different molecular mechanisms contribute to the overall genetic variations. These mechanisms can be assigned to three natural strategies to generate genetic variants: 1) local sequence changes, 2) intragenomic reshuffling of DNA segments, and 3) acquisition of a segment of foreign DNA. In these processes, specific gene products are involved in cooperation with different nongenetic elements. Some genetic variations occur fully at random along the DNA filaments, others rather with a statistical reproducibility, although at many possible sites. We have to be aware that evolution in natural ecosystems is of higher complexity than under most laboratory conditions, not at least in view of symbiotic associations and the occurrence of horizontal gene transfer. The encountered contingency of genetic variation can possibly best ensure a long-term persistence of life under steadily changing living conditions.

Generalization of Random Intercept Multilevel Models

Directory of Open Access Journals (Sweden)

Rehan Ahmad Khan

2013-10-01

Full Text Available The concept of random intercept models in a multilevel model developed by Goldstein (1986 has been extended for k-levels. The random variation in intercepts at individual level is marginally split into components by incorporating higher levels of hierarchy in the single level model. So, one can control the random variation in intercepts by incorporating the higher levels in the model.

Stochastic generation of explicit pore structures by thresholding Gaussian random fields

Energy Technology Data Exchange (ETDEWEB)

Hyman, Jeffrey D., E-mail: jhyman@lanl.gov [Program in Applied Mathematics, University of Arizona, Tucson, AZ 85721-0089 (United States); Computational Earth Science, Earth and Environmental Sciences (EES-16), and Center for Nonlinear Studies, Los Alamos National Laboratory, Los Alamos, NM 87544 (United States); Winter, C. Larrabee, E-mail: winter@email.arizona.edu [Program in Applied Mathematics, University of Arizona, Tucson, AZ 85721-0089 (United States); Department of Hydrology and Water Resources, University of Arizona, Tucson, AZ 85721-0011 (United States)

2014-11-15

We provide a description and computational investigation of an efficient method to stochastically generate realistic pore structures. Smolarkiewicz and Winter introduced this specific method in pores resolving simulation of Darcy flows (Smolarkiewicz and Winter, 2010 [1]) without giving a complete formal description or analysis of the method, or indicating how to control the parameterization of the ensemble. We address both issues in this paper. The method consists of two steps. First, a realization of a correlated Gaussian field, or topography, is produced by convolving a prescribed kernel with an initial field of independent, identically distributed random variables. The intrinsic length scales of the kernel determine the correlation structure of the topography. Next, a sample pore space is generated by applying a level threshold to the Gaussian field realization: points are assigned to the void phase or the solid phase depending on whether the topography over them is above or below the threshold. Hence, the topology and geometry of the pore space depend on the form of the kernel and the level threshold. Manipulating these two user prescribed quantities allows good control of pore space observables, in particular the Minkowski functionals. Extensions of the method to generate media with multiple pore structures and preferential flow directions are also discussed. To demonstrate its usefulness, the method is used to generate a pore space with physical and hydrological properties similar to a sample of Berea sandstone. -- Graphical abstract: -- Highlights: •An efficient method to stochastically generate realistic pore structures is provided. •Samples are generated by applying a level threshold to a Gaussian field realization. •Two user prescribed quantities determine the topology and geometry of the pore space. •Multiple pore structures and preferential flow directions can be produced. •A pore space based on Berea sandstone is generated.

Growth variation and heritability in a second-generation Eucalyptus urophylla progeny test at Lad Krating Plantation, Chachoengsao province, Thailand

Directory of Open Access Journals (Sweden)

Lucky Nhlanhla Dlamini

2017-06-01

Full Text Available In Thailand, Eucalyptus urophylla was introduced with the main purpose of supplying raw material for pulp and chip wood production. The demand for genetically improved seed is increasing to support high productivity plantation establishment. One of the tree improvement activities established to meet the high demand for improved seed was a second generation progeny test at Lad Krating Plantation, Thailand to provide the best material for the successful plantation program. The aim of the current study was to compare growth variation of the first and second generation of Eucalyptus urophylla progeny that could provide information on suitable families for improved quality seed. The progeny test comprised the best 45 half-sib families selected from 80 half-sib families of the first-generation progeny test. The design of the progeny test was a randomized and complete block design (16 trees/plot × 45 plots/block × 9 blocks, with 4 rows of 4 trees at a spacing of 2 m × 1 m. Growth was assessed at age 3 yr. The average height and diameter at breast height over bark (DBH, was 13.72 m, and 8.75 cm, respectively. There were highly significant (p < 0.01 differences among provenances and families in both height and DBH. The individual heritability values for height and DBH were 0.48 and 0.60, respectively. The family heritability values for height and DBH were 0.98 and 0.99, respectively. These 45 half-sib families proved to be genetically superior ensuring higher productivity and contributing to the success of the Forest Industry Organization plantation at Lad Krating.

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

Science.gov (United States)

Lawnik, Marcin

2018-01-01

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

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 source generating far field with elliptical flat-topped beam profile

International Nuclear Information System (INIS)

Zhang, Yongtao; Cai, Yangjian

2014-01-01

Circular and rectangular multi-Gaussian Schell-model (MGSM) sources which generate far fields with circular and rectangular flat-topped beam profiles were introduced just recently (Sahin and Korotkova 2012 Opt. Lett. 37 2970; Korotkova 2014 Opt. Lett. 39 64). In this paper, a random source named an elliptical MGSM source is introduced. An analytical expression for the propagation factor of an elliptical MGSM beam is derived. Furthermore, an analytical propagation formula for an elliptical MGSM beam passing through a stigmatic ABCD optical system is derived, and its propagation properties in free space are studied. It is interesting to find that an elliptical MGSM source generates a far field with an elliptical flat-topped beam profile, being qualitatively different from that of circular and rectangular MGSM sources. The ellipticity and the flatness of the elliptical flat-topped beam profile in the far field are determined by the initial coherence widths and the beam index, respectively. (paper)

Online Detection and Estimation of Grid Impedance Variation for Distributed Power Generation

DEFF Research Database (Denmark)

Jebali-Ben Ghorbal, Manel; Ghzaiel, Walid; Slama-Belkhodja, Ilhem

2012-01-01

A better knowledge of the grid impedance is essential in order to improve power quality and control of the Distributed Power Generation Systems (DPGS) and also for a safe connection or reconnection to the utility grid. An LCL-filter associated to a Voltage Source Inverter (VSI) is usually used...... to disconnect the DPG systems of the network. This work presents a rapid and simple technique to detect the grid impedance variation and to determine the grid impedance before and after grid faults accurs. Implementation on FPGA control board, simulations and experimental results are presented to validate...

Localized motion in random matrix decomposition of complex financial systems

Science.gov (United States)

Jiang, Xiong-Fei; Zheng, Bo; Ren, Fei; Qiu, Tian

2017-04-01

With the random matrix theory, we decompose the multi-dimensional time series of complex financial systems into a set of orthogonal eigenmode functions, which are classified into the market mode, sector mode, and random mode. In particular, the localized motion generated by the business sectors, plays an important role in financial systems. Both the business sectors and their impact on the stock market are identified from the localized motion. We clarify that the localized motion induces different characteristics of the time correlations for the stock-market index and individual stocks. With a variation of a two-factor model, we reproduce the return-volatility correlations of the eigenmodes.

Design of Energy Aware Adder Circuits Considering Random Intra-Die Process Variations

Directory of Open Access Journals (Sweden)

Marco Lanuzza

2011-04-01

Full Text Available Energy consumption is one of the main barriers to current high-performance designs. Moreover, the increased variability experienced in advanced process technologies implies further timing yield concerns and therefore intensifies this obstacle. Thus, proper techniques to achieve robust designs are a critical requirement for integrated circuit success. In this paper, the influence of intra-die random process variations is analyzed considering the particular case of the design of energy aware adder circuits. Five well known adder circuits were designed exploiting an industrial 45 nm static complementary metal-oxide semiconductor (CMOS standard cell library. The designed adders were comparatively evaluated under different energy constraints. As a main result, the performed analysis demonstrates that, for a given energy budget, simpler circuits (which are conventionally identified as low-energy slow architectures operating at higher power supply voltages can achieve a timing yield significantly better than more complex faster adders when used in low-power design with supply voltages lower than nominal.

Within- and Trans-Generational Effects of Variation in Dietary Macronutrient Content on Life-History Traits in the Moth Plodia interpunctella

Science.gov (United States)

Knell, Robert J.

2016-01-01

It is increasingly clear that parental environment can play an important role in determining offspring phenotype. These “transgenerational effects” have been linked to many different components of the environment, including toxin exposure, infection with pathogens and parasites, temperature and food quality. In this study, we focus on the latter, asking how variation in the quantity and quality of nutrition affects future generations. Previous studies have shown that artificial diets are a useful tool to examine the within-generation effects of variation in macronutrient content on life history traits, and could therefore be applied to investigations of the transgenerational effects of parental diet. Synthetic diets varying in total macronutrient content and protein: carbohydrate ratios were used to examine both within- and trans-generational effects on life history traits in a generalist stored product pest, the Indian meal moth Plodia interpunctella. The macronutrient composition of the diet was important for shaping within-generation life history traits, including pupal weight, adult weight, and phenoloxidase activity, and had indirect effects via maternal weight on fecundity. Despite these clear within-generation effects on the biology of P. interpunctella, diet composition had no transgenerational effects on the life history traits of offspring. P. interpunctella mothers were able to maintain their offspring quality, possibly at the expense of their own somatic condition, despite high variation in dietary macronutrient composition. This has important implications for the plastic biology of this successful generalist pest. PMID:28033396

Within- and Trans-Generational Effects of Variation in Dietary Macronutrient Content on Life-History Traits in the Moth Plodia interpunctella.

Directory of Open Access Journals (Sweden)

Joanne E Littlefair

Full Text Available It is increasingly clear that parental environment can play an important role in determining offspring phenotype. These "transgenerational effects" have been linked to many different components of the environment, including toxin exposure, infection with pathogens and parasites, temperature and food quality. In this study, we focus on the latter, asking how variation in the quantity and quality of nutrition affects future generations. Previous studies have shown that artificial diets are a useful tool to examine the within-generation effects of variation in macronutrient content on life history traits, and could therefore be applied to investigations of the transgenerational effects of parental diet. Synthetic diets varying in total macronutrient content and protein: carbohydrate ratios were used to examine both within- and trans-generational effects on life history traits in a generalist stored product pest, the Indian meal moth Plodia interpunctella. The macronutrient composition of the diet was important for shaping within-generation life history traits, including pupal weight, adult weight, and phenoloxidase activity, and had indirect effects via maternal weight on fecundity. Despite these clear within-generation effects on the biology of P. interpunctella, diet composition had no transgenerational effects on the life history traits of offspring. P. interpunctella mothers were able to maintain their offspring quality, possibly at the expense of their own somatic condition, despite high variation in dietary macronutrient composition. This has important implications for the plastic biology of this successful generalist pest.

Within- and Trans-Generational Effects of Variation in Dietary Macronutrient Content on Life-History Traits in the Moth Plodia interpunctella.

Science.gov (United States)

Littlefair, Joanne E; Knell, Robert J

2016-01-01

It is increasingly clear that parental environment can play an important role in determining offspring phenotype. These "transgenerational effects" have been linked to many different components of the environment, including toxin exposure, infection with pathogens and parasites, temperature and food quality. In this study, we focus on the latter, asking how variation in the quantity and quality of nutrition affects future generations. Previous studies have shown that artificial diets are a useful tool to examine the within-generation effects of variation in macronutrient content on life history traits, and could therefore be applied to investigations of the transgenerational effects of parental diet. Synthetic diets varying in total macronutrient content and protein: carbohydrate ratios were used to examine both within- and trans-generational effects on life history traits in a generalist stored product pest, the Indian meal moth Plodia interpunctella. The macronutrient composition of the diet was important for shaping within-generation life history traits, including pupal weight, adult weight, and phenoloxidase activity, and had indirect effects via maternal weight on fecundity. Despite these clear within-generation effects on the biology of P. interpunctella, diet composition had no transgenerational effects on the life history traits of offspring. P. interpunctella mothers were able to maintain their offspring quality, possibly at the expense of their own somatic condition, despite high variation in dietary macronutrient composition. This has important implications for the plastic biology of this successful generalist pest.

Modified loss coefficients in the determination of optimum generation scheduling

Energy Technology Data Exchange (ETDEWEB)

Hazarika, D.; Bordoloi, P.K. (Assam Engineering Coll. (IN))

1991-03-01

A modified method has been evolved to form the loss coefficients of an electrical power system network by decoupling load and generation and thereby creating additional fictitious load buses. The system losses are then calculated and co-ordinated to arrive at an optimum scheduling of generation using the standard co-ordination equation. The method presented is superior to the ones currently available, in that it is applicable to a multimachine system with random variation of load and it accounts for limits in plant generations and line losses. The precise nature of results and the economy in the cost of energy production obtained by this method is quantified and presented. (author).

Overview of the creative genome: effects of genome structure and sequence on the generation of variation and evolution.

Science.gov (United States)

Caporale, Lynn Helena

2012-09-01

This overview of a special issue of Annals of the New York Academy of Sciences discusses uneven distribution of distinct types of variation across the genome, the dependence of specific types of variation upon distinct classes of DNA sequences and/or the induction of specific proteins, the circumstances in which distinct variation-generating systems are activated, and the implications of this work for our understanding of evolution and of cancer. Also discussed is the value of non text-based computational methods for analyzing information carried by DNA, early insights into organizational frameworks that affect genome behavior, and implications of this work for comparative genomics. © 2012 New York Academy of Sciences.

Techniques to assess biological variation in destructive data

NARCIS (Netherlands)

Tijskens, L.M.M.; Schouten, R.E.; Jongbloed, G.; Konopacki, P.J.

2018-01-01

Variation is present in all measured data, due to variation between individuals (biological variation) and variation induced by the measuring system (technical variation). Biological variation present in experimental data is not the result of a random process but strictly subject to deterministic

The determinants of cost efficiency of hydroelectric generating plants: A random frontier approach

International Nuclear Information System (INIS)

Barros, Carlos P.; Peypoch, Nicolas

2007-01-01

This paper analyses the technical efficiency in the hydroelectric generating plants of a main Portuguese electricity enterprise EDP (Electricity of Portugal) between 1994 and 2004, investigating the role played by increase in competition and regulation. A random cost frontier method is adopted. A translog frontier model is used and the maximum likelihood estimation technique is employed to estimate the empirical model. We estimate the efficiency scores and decompose the exogenous variables into homogeneous and heterogeneous. It is concluded that production and capacity are heterogeneous, signifying that the hydroelectric generating plants are very distinct and therefore any energy policy should take into account this heterogeneity. It is also concluded that competition, rather than regulation, plays the key role in increasing hydroelectric plant efficiency

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

Science.gov (United States)

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

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

An empirical test of pseudo random number generators by means of an exponential decaying process; Una prueba empirica de generadores de numeros pseudoaleatorios mediante un proceso de decaimiento exponencial

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)

Implementation of a RANLUX Based Pseudo-Random Number Generator in FPGA Using VHDL and Impulse C

OpenAIRE

Agnieszka Dąbrowska-Boruch; Grzegorz Gancarczyk; Kazimierz Wiatr

2014-01-01

Monte Carlo simulations are widely used e.g. in the field of physics and molecular modelling. The main role played in these is by the high performance random number generators, such as RANLUX or MERSSENE TWISTER. In this paper the authors introduce the world's first implementation of the RANLUX algorithm on an FPGA platform for high performance computing purposes. A significant speed-up of one generator instance over 60 times, compared with a graphic card based solution, can be noticed. Compa...

Using Multisite Experiments to Study Cross-Site Variation in Treatment Effects: A Hybrid Approach with Fixed Intercepts and A Random Treatment Coefficient

Science.gov (United States)

Bloom, Howard S.; Raudenbush, Stephen W.; Weiss, Michael J.; Porter, Kristin

2017-01-01

The present article considers a fundamental question in evaluation research: "By how much do program effects vary across sites?" The article first presents a theoretical model of cross-site impact variation and a related estimation model with a random treatment coefficient and fixed site-specific intercepts. This approach eliminates…

GENERATION OF MULTI-LOD 3D CITY MODELS IN CITYGML WITH THE PROCEDURAL MODELLING ENGINE RANDOM3DCITY

Directory of Open Access Journals (Sweden)

F. Biljecki

2016-09-01

Full Text Available The production and dissemination of semantic 3D city models is rapidly increasing benefiting a growing number of use cases. However, their availability in multiple LODs and in the CityGML format is still problematic in practice. This hinders applications and experiments where multi-LOD datasets are required as input, for instance, to determine the performance of different LODs in a spatial analysis. An alternative approach to obtain 3D city models is to generate them with procedural modelling, which is – as we discuss in this paper – well suited as a method to source multi-LOD datasets useful for a number of applications. However, procedural modelling has not yet been employed for this purpose. Therefore, we have developed RANDOM3DCITY, an experimental procedural modelling engine for generating synthetic datasets of buildings and other urban features. The engine is designed to produce models in CityGML and does so in multiple LODs. Besides the generation of multiple geometric LODs, we implement the realisation of multiple levels of spatiosemantic coherence, geometric reference variants, and indoor representations. As a result of their permutations, each building can be generated in 392 different CityGML representations, an unprecedented number of modelling variants of the same feature. The datasets produced by RANDOM3DCITY are suited for several applications, as we show in this paper with documented uses. The developed engine is available under an open-source licence at Github at http://github.com/tudelft3d/Random3Dcity.

Certified randomness in quantum physics.

Science.gov (United States)

Acín, Antonio; Masanes, Lluis

2016-12-07

The concept of randomness plays an important part in many disciplines. On the one hand, the question of whether random processes exist is fundamental for our understanding of nature. On the other, randomness is a resource for cryptography, algorithms and simulations. Standard methods for generating randomness rely on assumptions about the devices that are often not valid in practice. However, quantum technologies enable new methods for generating certified randomness, based on the violation of Bell inequalities. These methods are referred to as device-independent because they do not rely on any modelling of the devices. Here we review efforts to design device-independent randomness generators and the associated challenges.

Distributed photovoltaic architecture powering a DC bus: Impact of duty cycle and load variations on the efficiency of the generator

Science.gov (United States)

Allouache, Hadj; Zegaoui, Abdallah; Boutoubat, Mohamed; Bokhtache, Aicha Aissa; Kessaissia, Fatma Zohra; Charles, Jean-Pierre; Aillerie, Michel

2018-05-01

This paper focuses on a photovoltaic generator feeding a load via a boost converter in a distributed PV architecture. The principal target is the evaluation of the efficiency of a distributed photovoltaic architecture powering a direct current (DC) PV bus. This task is achieved by outlining an original way for tracking the Maximum Power Point (MPP) taking into account load variations and duty cycle on the electrical quantities of the boost converter and on the PV generator output apparent impedance. Thereafter, in a given sized PV system, we analyze the influence of the load variations on the behavior of the boost converter and we deduce the limits imposed by the load on the DC PV bus. The simultaneous influences of 1- the variation of the duty cycle of the boost converter and 2- the load power on the parameters of the various components of the photovoltaic chain and on the boost performances are clearly presented as deduced by simulation.

Variations in the response of AECL random coil seals as a function of the angular position of the probe

International Nuclear Information System (INIS)

Silk, M.G.

1986-04-01

The AECL random coil seal is to be used as a Nuclear Safeguards seal to deter and detect tampering with nuclear material in store. To be effective the ultrasonic signature from the seal must remain constant and be different from that of other seals. Angular variations in the ultrasonic response from certain seals have, however, been observed and the programme of study reported here has been carried out in order to clarify the source of this variation. It is shown that the variation observed may most probably be attributed to the ultrasonic probes used in the investigation and, in particular, to deviation of the probe beam from circularity. However it is probable that the angle of the beam with respect to the probe case (squint) is also a contributory factor. In addition, to reduce the degree of angular variation it is important to exclude air bubbles and to ensure that the coil is placed as centrally in the beam as possible. It is anticipated that the exclusion of air bubbles will be easier in the field than in the laboratory studies. The need to place the seal reasonably centrally with respect to the beam places some minor limits on the coil design and also makes it essential that the probe fits closely into its holder in the seal as any slackness may give rise to signature variations. (author)

High-harmonic generation in a dense medium

International Nuclear Information System (INIS)

Strelkov, V.V.; Platonenko, V.T.; Becker, A.

2005-01-01

The high-harmonic generation in a plasma or gas under conditions when the single-atom response is affected by neighboring ions or atoms of the medium is studied theoretically. We solve numerically the three-dimensional Schroedinger equation for a single-electron atom in the combined fields of the neighboring particles and the laser, and average the results over different random positions of the particles using the Monte Carlo method. Harmonic spectra are calculated for different medium densities and laser intensities. We observe a change of the harmonic properties due to a random variation of the harmonic phase induced by the field of the medium, when the medium density exceeds a certain transition density. The transition density is found to depend on the harmonic order, but it is almost independent of the fundamental intensity. It also differs for the two (shorter and longer) quantum paths. The latter effect leads for ionic densities in the transition regime to a narrowing of the harmonic lines and a shortening of the attosecond pulses generated using a group of harmonics

Next-Generation Sequencing-Based Detection of Germline Copy Number Variations in BRCA1/BRCA2

DEFF Research Database (Denmark)

Schmidt, Ane Y; Hansen, Thomas V O; Ahlborn, Lise B

2017-01-01

Genetic testing of BRCA1/2 includes screening for single nucleotide variants and small insertions/deletions and for larger copy number variations (CNVs), primarily by Sanger sequencing and multiplex ligation-dependent probe amplification (MLPA). With the advent of next-generation sequencing (NGS)...

Randomly Generating Four Mixed Bell-Diagonal States with a Concurrences Sum to Unity

International Nuclear Information System (INIS)

Toh, S. P.; Zainuddin Hishamuddin; Foo Kim Eng

2012-01-01

A two-qubit system in quantum information theory is the simplest bipartite quantum system and its concurrence for pure and mixed states is well known. As a subset of two-qubit systems, Bell-diagonal states can be depicted by a very simple geometrical representation of a tetrahedron with sides of length 2√2. Based on this geometric representation, we propose a simple approach to randomly generate four mixed Bell decomposable states in which the sum of their concurrence is equal to one. (general)

NHash: Randomized N-Gram Hashing for Distributed Generation of Validatable Unique Study Identifiers in Multicenter Research.

Science.gov (United States)

Zhang, Guo-Qiang; Tao, Shiqiang; Xing, Guangming; Mozes, Jeno; Zonjy, Bilal; Lhatoo, Samden D; Cui, Licong

2015-11-10

A unique study identifier serves as a key for linking research data about a study subject without revealing protected health information in the identifier. While sufficient for single-site and limited-scale studies, the use of common unique study identifiers has several drawbacks for large multicenter studies, where thousands of research participants may be recruited from multiple sites. An important property of study identifiers is error tolerance (or validatable), in that inadvertent editing mistakes during their transmission and use will most likely result in invalid study identifiers. This paper introduces a novel method called "Randomized N-gram Hashing (NHash)," for generating unique study identifiers in a distributed and validatable fashion, in multicenter research. NHash has a unique set of properties: (1) it is a pseudonym serving the purpose of linking research data about a study participant for research purposes; (2) it can be generated automatically in a completely distributed fashion with virtually no risk for identifier collision; (3) it incorporates a set of cryptographic hash functions based on N-grams, with a combination of additional encryption techniques such as a shift cipher; (d) it is validatable (error tolerant) in the sense that inadvertent edit errors will mostly result in invalid identifiers. NHash consists of 2 phases. First, an intermediate string using randomized N-gram hashing is generated. This string consists of a collection of N-gram hashes f1, f2, ..., fk. The input for each function fi has 3 components: a random number r, an integer n, and input data m. The result, fi(r, n, m), is an n-gram of m with a starting position s, which is computed as (r mod |m|), where |m| represents the length of m. The output for Step 1 is the concatenation of the sequence f1(r1, n1, m1), f2(r2, n2, m2), ..., fk(rk, nk, mk). In the second phase, the intermediate string generated in Phase 1 is encrypted using techniques such as shift cipher. The result

MODIFIED AES WITH RANDOM S BOX GENERATION TO OVERCOME THE SIDE CHANNEL ASSAULTS USING CLOUD

Directory of Open Access Journals (Sweden)

M. Navaneetha Krishnan

2017-01-01

Full Text Available Development of any communication system with secure and complex cryptographic algorithms highly depends on concepts of data security which is crucial in the current technological world. The security and complexity of the cryptography algorithms need to get increased by randomization of secret keys. To overcome the issues associated to data security and for improvising it during encryption and decryption process over the encrypting device, a novel Secure Side Channel Assault Prevention (SSCAP approach has been projected which will eliminate outflow of side channel messages and also provides effective security over the encrypting device. An effective Enriched AES (E-AES encryption algorithm is proposed to reduce the side channel attack; the modified algorithm in this research shows its improvement in the Generation of Random Multiple S - Box (GRM S-Box which makes it hard to the attacks to break the text which is in encrypted form. Our novel SSCAP approach also improves the security over the original information; it widely minimizes the leakage of the side channel information. Attackers cannot easily get a clue about the proposed S-Box Generation technique. Our E-AES algorithm will be implemented in cloud environment thereby improving the cloud security. The proposed SSCAP approach is judged against the existing security based algorithms on the scale of encryption and decryption time, time taken for generating the key, and performance. The proposed work proves to outperform over all other methods used in the past.

Transposon mutagenesis in Mycoplasma hyopneumoniae using a novel mariner-based system for generating random mutations.

Science.gov (United States)

Maglennon, Gareth A; Cook, Beth S; Deeney, Alannah S; Bossé, Janine T; Peters, Sarah E; Langford, Paul R; Maskell, Duncan J; Tucker, Alexander W; Wren, Brendan W; Rycroft, Andrew N

2013-12-21

Mycoplasma hyopneumoniae is the cause of enzootic pneumonia in pigs, a chronic respiratory disease associated with significant economic losses to swine producers worldwide. The molecular pathogenesis of infection is poorly understood due to the lack of genetic tools to allow manipulation of the organism and more generally for the Mycoplasma genus. The objective of this study was to develop a system for generating random transposon insertion mutants in M. hyopneumoniae that could prove a powerful tool in enabling the pathogenesis of infection to be unraveled. A novel delivery vector was constructed containing a hyperactive C9 mutant of the Himar1 transposase along with a mini transposon containing the tetracycline resistance cassette, tetM. M. hyopneumoniae strain 232 was electroporated with the construct and tetM-expressing transformants selected on agar containing tetracycline. Individual transformants contained single transposon insertions that were stable upon serial passages in broth medium. The insertion sites of 44 individual transformants were determined and confirmed disruption of several M. hyopneumoniae genes. A large pool of over 10 000 mutants was generated that should allow saturation of the M. hyopneumoniae strain 232 genome. This is the first time that transposon mutagenesis has been demonstrated in this important pathogen and could be generally applied for other Mycoplasma species that are intractable to genetic manipulation. The ability to generate random mutant libraries is a powerful tool in the further study of the pathogenesis of this important swine pathogen.

Application of random number generators in genetic algorithms to improve rainfall-runoff modelling

Czech Academy of Sciences Publication Activity Database

Chlumecký, M.; Buchtele, Josef; Richta, K.

2017-01-01

Roč. 553, October (2017), s. 350-355 ISSN 0022-1694 Institutional support: RVO:67985874 Keywords : genetic algorithm * optimisation * rainfall-runoff modeling * random generator Subject RIV: DA - Hydrology ; Limnology OBOR OECD: Hydrology Impact factor: 3.483, year: 2016 https://ac.els-cdn.com/S0022169417305516/1-s2.0-S0022169417305516-main.pdf?_tid=fa1bad8a-bd6a-11e7-8567-00000aab0f27&acdnat=1509365462_a1335d3d997e9eab19e23b1eee977705

A Segregating Inversion Generates Fitness Variation in Yellow Monkeyflower (Mimulus guttatus)

Science.gov (United States)

Fishman, Lila; Kelly, John K.; Willis, John H.

2016-01-01

Polymorphic chromosomal rearrangements can bind hundreds of genes into single genetic loci with diverse effects. Rearrangements are often associated with local adaptation and speciation and may also be an important component of genetic variation within populations. We genetically and phenotypically characterize a segregating inversion (inv6) in the Iron Mountain (IM) population of Mimulus guttatus (yellow monkeyflower). We initially mapped inv6 as a region of recombination suppression in three F2 populations resulting from crosses among IM plants. In each case, the F1 parent was heterozygous for a derived haplotype, homogenous across markers spanning over 5 Mb of chromsome 6. In the three F2 populations, inv6 reduced male and female fitness components. In addition, inv6 carriers suffered an ∼30% loss of pollen viability in the field. Despite these costs, inv6 exists at moderate frequency (∼8%) in the natural population, suggesting counterbalancing fitness benefits that maintain the polymorphism. Across 4 years of monitoring in the field, inv6 had an overall significant positive effect on seed production (lifetime female fitness) of carriers. This benefit was particularly strong in harsh years and may be mediated (in part) by strong positive effects on flower production. These data suggest that opposing fitness effects maintain an intermediate frequency, and as a consequence, inv6 generates inbreeding depression and high genetic variance. We discuss these findings in relation to the theory of inbreeding depression and the maintenance of fitness variation. PMID:26868767

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

Science.gov (United States)

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

2016-01-01

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

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

Science.gov (United States)

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

2016-01-01

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

The effect of random dopant fluctuation on threshold voltage and drain current variation in junctionless nanotransistors

International Nuclear Information System (INIS)

Rezapour, Arash; Rezapour, Pegah

2015-01-01

We investigate the effect of dopant random fluctuation on threshold voltage and drain current variation in a two-gate nanoscale transistor. We used a quantum-corrected technology computer aided design simulation to run the simulation (10000 randomizations). With this simulation, we could study the effects of varying the dimensions (length and width), and thicknesses of oxide and dopant factors of a transistor on the threshold voltage and drain current in subthreshold region (off) and overthreshold (on). It was found that in the subthreshold region the variability of the drain current and threshold voltage is relatively fixed while in the overthreshold region the variability of the threshold voltage and drain current decreases remarkably, despite the slight reduction of gate voltage diffusion (compared with that of the subthreshold). These results have been interpreted by using previously reported models for threshold current variability, load displacement, and simple analytical calculations. Scaling analysis shows that the variability of the characteristics of this semiconductor increases as the effects of the short channel increases. Therefore, with a slight increase of length and a reduction of width, oxide thickness, and dopant factor, we could correct the effect of the short channel. (paper)

Generation and monitoring of discrete stable random processes using multiple immigration population models

Energy Technology Data Exchange (ETDEWEB)

Matthews, J O; Hopcraft, K I; Jakeman, E [Applied Mathematics Division, School of Mathematical Sciences, University of Nottingham, Nottingham, NG7 2RD (United Kingdom)

2003-11-21

Some properties of classical population processes that comprise births, deaths and multiple immigrations are investigated. The rates at which the immigrants arrive can be tailored to produce a population whose steady state fluctuations are described by a pre-selected distribution. Attention is focused on the class of distributions with a discrete stable law, which have power-law tails and whose moments and autocorrelation function do not exist. The separate problem of monitoring and characterizing the fluctuations is studied, analysing the statistics of individuals that leave the population. The fluctuations in the size of the population are transferred to the times between emigrants that form an intermittent time series of events. The emigrants are counted with a detector of finite dynamic range and response time. This is modelled through clipping the time series or saturating it at an arbitrary but finite level, whereupon its moments and correlation properties become finite. Distributions for the time to the first counted event and for the time between events exhibit power-law regimes that are characteristic of the fluctuations in population size. The processes provide analytical models with which properties of complex discrete random phenomena can be explored, and in addition provide generic means by which random time series encompassing a wide range of intermittent and other discrete random behaviour may be generated.

Generation and monitoring of discrete stable random processes using multiple immigration population models

International Nuclear Information System (INIS)

Matthews, J O; Hopcraft, K I; Jakeman, E

2003-01-01

Some properties of classical population processes that comprise births, deaths and multiple immigrations are investigated. The rates at which the immigrants arrive can be tailored to produce a population whose steady state fluctuations are described by a pre-selected distribution. Attention is focused on the class of distributions with a discrete stable law, which have power-law tails and whose moments and autocorrelation function do not exist. The separate problem of monitoring and characterizing the fluctuations is studied, analysing the statistics of individuals that leave the population. The fluctuations in the size of the population are transferred to the times between emigrants that form an intermittent time series of events. The emigrants are counted with a detector of finite dynamic range and response time. This is modelled through clipping the time series or saturating it at an arbitrary but finite level, whereupon its moments and correlation properties become finite. Distributions for the time to the first counted event and for the time between events exhibit power-law regimes that are characteristic of the fluctuations in population size. The processes provide analytical models with which properties of complex discrete random phenomena can be explored, and in addition provide generic means by which random time series encompassing a wide range of intermittent and other discrete random behaviour may be generated

Combining rational and random strategies in β-glucosidase Zm-p60.1 protein library construction.

Directory of Open Access Journals (Sweden)

Dušan Turek

Full Text Available Saturation mutagenesis is a cornerstone technique in protein engineering because of its utility (in conjunction with appropriate analytical techniques for assessing effects of varying residues at selected positions on proteins' structures and functions. Site-directed mutagenesis with degenerate primers is the simplest and most rapid saturation mutagenesis technique. Thus, it is highly appropriate for assessing whether or not variation at certain sites is permissible, but not necessarily the most time- and cost-effective technique for detailed assessment of variations' effects. Thus, in the presented study we applied the technique to randomize position W373 in β-glucosidase Zm-p60.1, which is highly conserved among β-glucosidases. Unexpectedly, β-glucosidase activity screening of the generated variants showed that most variants were active, although they generally had significantly lower activity than the wild type enzyme. Further characterization of the library led us to conclude that a carefully selected combination of randomized codon-based saturation mutagenesis and site-directed mutagenesis may be most efficient, particularly when constructing and investigating randomized libraries with high fractions of positive hits.

Combining rational and random strategies in β-glucosidase Zm-p60.1 protein library construction.

Science.gov (United States)

Turek, Dušan; Klimeš, Pavel; Mazura, Pavel; Brzobohatý, Břetislav

2014-01-01

Saturation mutagenesis is a cornerstone technique in protein engineering because of its utility (in conjunction with appropriate analytical techniques) for assessing effects of varying residues at selected positions on proteins' structures and functions. Site-directed mutagenesis with degenerate primers is the simplest and most rapid saturation mutagenesis technique. Thus, it is highly appropriate for assessing whether or not variation at certain sites is permissible, but not necessarily the most time- and cost-effective technique for detailed assessment of variations' effects. Thus, in the presented study we applied the technique to randomize position W373 in β-glucosidase Zm-p60.1, which is highly conserved among β-glucosidases. Unexpectedly, β-glucosidase activity screening of the generated variants showed that most variants were active, although they generally had significantly lower activity than the wild type enzyme. Further characterization of the library led us to conclude that a carefully selected combination of randomized codon-based saturation mutagenesis and site-directed mutagenesis may be most efficient, particularly when constructing and investigating randomized libraries with high fractions of positive hits.

Random Numbers and Quantum Computers

Science.gov (United States)

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…

Run charts revisited: a simulation study of run chart rules for detection of non-random variation in health care processes.

Science.gov (United States)

Anhøj, Jacob; Olesen, Anne Vingaard

2014-01-01

A run chart is a line graph of a measure plotted over time with the median as a horizontal line. The main purpose of the run chart is to identify process improvement or degradation, which may be detected by statistical tests for non-random patterns in the data sequence. We studied the sensitivity to shifts and linear drifts in simulated processes using the shift, crossings and trend rules for detecting non-random variation in run charts. The shift and crossings rules are effective in detecting shifts and drifts in process centre over time while keeping the false signal rate constant around 5% and independent of the number of data points in the chart. The trend rule is virtually useless for detection of linear drift over time, the purpose it was intended for.

Random variation in voluntary dry matter intake and effect of day length on feed intake capacity in growing cattle

DEFF Research Database (Denmark)

Ingvartsen, Klaus Lønne; Andersen, Refsgaard; Foldager, John

1992-01-01

The objective of this paper is to describe the random variation in voluntary dry matter intake (VDMI) and to discuss the application of the results for monitoring purposes. Furthermore, the objective is to review and quantify the influence of day length or photoperiod on VDMI. VDMI was recorded...... was increased by 0.32% per hour increase in day length. This is in agreement with the increase found in reviewed literature when photoperiod was manipulated artificially. Practical application of the results for monitoring purposes are exemplified and discussed....

Multimodal biometric approach for cancelable face template generation

Science.gov (United States)

Paul, Padma Polash; Gavrilova, Marina

2012-06-01

Due to the rapid growth of biometric technology, template protection becomes crucial to secure integrity of the biometric security system and prevent unauthorized access. Cancelable biometrics is emerging as one of the best solutions to secure the biometric identification and verification system. We present a novel technique for robust cancelable template generation algorithm that takes advantage of the multimodal biometric using feature level fusion. Feature level fusion of different facial features is applied to generate the cancelable template. A proposed algorithm based on the multi-fold random projection and fuzzy communication scheme is used for this purpose. In cancelable template generation, one of the main difficulties is keeping interclass variance of the feature. We have found that interclass variations of the features that are lost during multi fold random projection can be recovered using fusion of different feature subsets and projecting in a new feature domain. Applying the multimodal technique in feature level, we enhance the interclass variability hence improving the performance of the system. We have tested the system for classifier fusion for different feature subset and different cancelable template fusion. Experiments have shown that cancelable template improves the performance of the biometric system compared with the original template.

Variational principles for the spectral radius of functional operators

International Nuclear Information System (INIS)

Antonevich, A B; Zajkowski, K

2006-01-01

The spectral radius of a functional operator with positive coefficients generated by a set of maps (a dynamical system) is shown to be a logarithmically convex functional of the logarithms of the coefficients. This yields the following variational principle: the logarithm of the spectral radius is the Legendre transform of a convex functional T defined on a set of vector-valued probability measures and depending only on the original dynamical system. A combinatorial construction of the functional T by means of the random walk process corresponding to the dynamical system is presented in the subexponential case. Examples of the explicit calculation of the functional T and the spectral radius are presented.

Engineering applications of fpgas chaotic systems, artificial neural networks, random number generators, and secure communication systems

CERN Document Server

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

Variation and design criterion of heat load ratio of generator for air cooled lithium bromide–water double effect absorption chiller

International Nuclear Information System (INIS)

Li, Zeyu; Liu, Liming; Liu, Jinping

2016-01-01

Highlights: • Design criterion of heat load ratio of generator is vital to system performance. • Heat load ratio of generator changes with working condition. • Change of heat load ratio of generator for four systems was obtained and compared. • Design criterion of heat load ratio of generator was presented. - Abstract: The heat load ratio of generator (HLRG) is a special system parameter because it is not fixed at the design value but changes with the working condition. For the air cooled chiller, the deviation from the design working condition occurs easily due to the variation of the surrounding temperature. The system is likely to suffer from crystallization when the working condition is different from the designed one if the HLRG is designed improperly. Consequently, the design criterion of HLRG based on a broad range of working condition is essential and urgent to the development of air cooled lithium bromide–water double effect absorption chiller. This paper mainly deals with the variation of HLRG with the working condition as well as corresponding design criterion. Four types of double effect chillers named series, pre-parallel, rear parallel and reverse parallel flow system were considered. The parametric model was developed by the introduction of a new thermodynamic relationship of generator. The change of HLRG for different types of chillers with the working condition was analyzed and compared. The corresponding design criterion of HLRG was presented. This paper is helpful for further improvement of the performance and reliability of air cooled lithium bromide–water double effect absorption chiller.

Very late stent thrombosis with second generation drug eluting stents compared to bare metal stents: Network meta-analysis of randomized primary percutaneous coronary intervention trials.

Science.gov (United States)

Philip, Femi; Stewart, Susan; Southard, Jeffrey A

2016-07-01

The relative safety of drug-eluting stents (DES) and bare-metal stents (BMS) in primary percutaneous coronary intervention (PPCI) in ST elevation myocardial infarction (STEMI) continues to be debated. The long-term clinical outcomes between second generation DES and BMS for primary percutaneous coronary intervention (PCI) using network meta-analysis were compared. Randomized controlled trials comparing stent types (first generation DES, second generation DES, or BMS) were considered for inclusion. A search strategy used Medline, Embase, Cochrane databases, and proceedings of international meetings. Information about study design, inclusion criteria, and sample characteristics were extracted. Network meta-analysis was used to pool direct (comparison of second generation DES to BMS) and indirect evidence (first generation DES with BMS and second generation DES) from the randomized trials. Twelve trials comparing all stents types including 9,673 patients randomly assigned to treatment groups were analyzed. Second generation DES was associated with significantly lower incidence of definite or probable ST (OR 0.59, 95% CI 0.39-0.89), MI (OR 0.59, 95% CI 0.39-0.89), and TVR at 3 years (OR 0.50: 95% CI 0.31-0.81) compared with BMS. In addition, there was a significantly lower incidence of MACE with second generation DES versus BMS (OR 0.54, 95% CI 0.34-0.74) at 3 years. These were driven by a higher rate of TVR, MI and stent thrombosis in the BMS group at 3 years. There was a non-significant reduction in the overall and cardiac mortality [OR 0.83, 95% CI (0.60-1.14), OR 0.88, 95% CI (0.6-1.28)] with the use of second generation DES versus BMS at 3 years. Network meta-analysis of randomized trials of primary PCI demonstrated lower incidence of MACE, MI, TVR, and stent thrombosis with second generation DES compared with BMS. © 2016 Wiley Periodicals, Inc. © 2016 Wiley Periodicals, Inc.

Random distributed feedback fibre lasers

Energy Technology Data Exchange (ETDEWEB)

Turitsyn, Sergei K., E-mail: s.k.turitsyn@aston.ac.uk [Aston Institute of Photonic Technologies, Aston University, Birmingham B4 7ET (United Kingdom); Novosibirsk State University, 2 Pirogova str., 630090, Novosibirsk (Russian Federation); Babin, Sergey A. [Novosibirsk State University, 2 Pirogova str., 630090, Novosibirsk (Russian Federation); Institute of Automation and Electrometry SB RAS, 1 Ac. Koptug. ave., 630090, Novosibirsk (Russian Federation); Churkin, Dmitry V. [Aston Institute of Photonic Technologies, Aston University, Birmingham B4 7ET (United Kingdom); Novosibirsk State University, 2 Pirogova str., 630090, Novosibirsk (Russian Federation); Institute of Automation and Electrometry SB RAS, 1 Ac. Koptug. ave., 630090, Novosibirsk (Russian Federation); Vatnik, Ilya D.; Nikulin, Maxim [Institute of Automation and Electrometry SB RAS, 1 Ac. Koptug. ave., 630090, Novosibirsk (Russian Federation); Podivilov, Evgenii V. [Novosibirsk State University, 2 Pirogova str., 630090, Novosibirsk (Russian Federation); Institute of Automation and Electrometry SB RAS, 1 Ac. Koptug. ave., 630090, Novosibirsk (Russian Federation)

2014-09-10

The concept of random lasers exploiting multiple scattering of photons in an amplifying disordered medium in order to generate coherent light without a traditional laser resonator has attracted a great deal of attention in recent years. This research area lies at the interface of the fundamental theory of disordered systems and laser science. The idea was originally proposed in the context of astrophysics in the 1960s by V.S. Letokhov, who studied scattering with “negative absorption” of the interstellar molecular clouds. Research on random lasers has since developed into a mature experimental and theoretical field. A simple design of such lasers would be promising for potential applications. However, in traditional random lasers the properties of the output radiation are typically characterized by complex features in the spatial, spectral and time domains, making them less attractive than standard laser systems in terms of practical applications. Recently, an interesting and novel type of one-dimensional random laser that operates in a conventional telecommunication fibre without any pre-designed resonator mirrors–random distributed feedback fibre laser–was demonstrated. The positive feedback required for laser generation in random fibre lasers is provided by the Rayleigh scattering from the inhomogeneities of the refractive index that are naturally present in silica glass. In the proposed laser concept, the randomly backscattered light is amplified through the Raman effect, providing distributed gain over distances up to 100 km. Although an effective reflection due to the Rayleigh scattering is extremely small (∼0.1%), the lasing threshold may be exceeded when a sufficiently large distributed Raman gain is provided. Such a random distributed feedback fibre laser has a number of interesting and attractive features. The fibre waveguide geometry provides transverse confinement, and effectively one-dimensional random distributed feedback leads to the

Random distributed feedback fibre lasers

International Nuclear Information System (INIS)

Turitsyn, Sergei K.; Babin, Sergey A.; Churkin, Dmitry V.; Vatnik, Ilya D.; Nikulin, Maxim; Podivilov, Evgenii V.

2014-01-01

The concept of random lasers exploiting multiple scattering of photons in an amplifying disordered medium in order to generate coherent light without a traditional laser resonator has attracted a great deal of attention in recent years. This research area lies at the interface of the fundamental theory of disordered systems and laser science. The idea was originally proposed in the context of astrophysics in the 1960s by V.S. Letokhov, who studied scattering with “negative absorption” of the interstellar molecular clouds. Research on random lasers has since developed into a mature experimental and theoretical field. A simple design of such lasers would be promising for potential applications. However, in traditional random lasers the properties of the output radiation are typically characterized by complex features in the spatial, spectral and time domains, making them less attractive than standard laser systems in terms of practical applications. Recently, an interesting and novel type of one-dimensional random laser that operates in a conventional telecommunication fibre without any pre-designed resonator mirrors–random distributed feedback fibre laser–was demonstrated. The positive feedback required for laser generation in random fibre lasers is provided by the Rayleigh scattering from the inhomogeneities of the refractive index that are naturally present in silica glass. In the proposed laser concept, the randomly backscattered light is amplified through the Raman effect, providing distributed gain over distances up to 100 km. Although an effective reflection due to the Rayleigh scattering is extremely small (∼0.1%), the lasing threshold may be exceeded when a sufficiently large distributed Raman gain is provided. Such a random distributed feedback fibre laser has a number of interesting and attractive features. The fibre waveguide geometry provides transverse confinement, and effectively one-dimensional random distributed feedback leads to the

Efficient Statistical Extraction of the Per-Unit-Length Capacitance and Inductance Matrices of Cables with Random Parameters

Directory of Open Access Journals (Sweden)

P. Manfredi

2015-05-01

Full Text Available Cable bundles often exhibit random parameter variations due to uncertain or uncontrollable physical properties and wire positioning. Efficient tools, based on the so-called polynomial chaos, exist to rapidly assess the impact of such variations on the per-unit-length capacitance and inductance matrices, and on the pertinent cable response. Nevertheless, the state-of-the-art method for the statistical extraction of the per-unit-length capacitance and inductance matrices of cables suffers from several inefficiencies that hinder its applicability to large problems, in terms of number of random parameters and/or conductors. This paper presents an improved methodology that overcomes the aforementioned limitations by exploiting a recently-published, alternative approach to generate the pertinent polynomial chaos system of equations. A sparse and decoupled system is obtained that provides remarkable benefits in terms of speed, memory consumption and problem size that can be dealt with. The technique is thoroughly validated through the statistical analysis of two canonical structures, i.e. a ribbon cable and a shielded cable with random geometry and position.

Procedural facade variations from a single layout

KAUST Repository

Bao, Fan

2013-02-19

We introduce a framework to generate many variations of a facade design that look similar to a given facade layout. Starting from an input image, the facade is hierarchically segmented and labeled with a collection of manual and automatic tools. The user can then model constraints that should be maintained in any variation of the input facade design. Subsequently, facade variations are generated for different facade sizes, where multiple variations can be produced for a certain size. Computing such new facade variations has many unique challenges, and we propose a new algorithm based on interleaving heuristic search and quadratic programming. In contrast to most previous work, we focus on the generation of new design variations and not on the automatic analysis of the input\\'s structure. Adding a modeling step with the user in the loop ensures that our results routinely are of high quality. © 2013 ACM.

Procedural facade variations from a single layout

KAUST Repository

Bao, Fan; Schwarz, Michael; Wonka, Peter

2013-01-01

We introduce a framework to generate many variations of a facade design that look similar to a given facade layout. Starting from an input image, the facade is hierarchically segmented and labeled with a collection of manual and automatic tools. The user can then model constraints that should be maintained in any variation of the input facade design. Subsequently, facade variations are generated for different facade sizes, where multiple variations can be produced for a certain size. Computing such new facade variations has many unique challenges, and we propose a new algorithm based on interleaving heuristic search and quadratic programming. In contrast to most previous work, we focus on the generation of new design variations and not on the automatic analysis of the input's structure. Adding a modeling step with the user in the loop ensures that our results routinely are of high quality. © 2013 ACM.

A rule-based software test data generator

Science.gov (United States)

Deason, William H.; Brown, David B.; Chang, Kai-Hsiung; Cross, James H., II

1991-01-01

Rule-based software test data generation is proposed as an alternative to either path/predicate analysis or random data generation. A prototype rule-based test data generator for Ada programs is constructed and compared to a random test data generator. Four Ada procedures are used in the comparison. Approximately 2000 rule-based test cases and 100,000 randomly generated test cases are automatically generated and executed. The success of the two methods is compared using standard coverage metrics. Simple statistical tests showing that even the primitive rule-based test data generation prototype is significantly better than random data generation are performed. This result demonstrates that rule-based test data generation is feasible and shows great promise in assisting test engineers, especially when the rule base is developed further.

Effect of heat- and steam-generating sheet on daily activities of living in patients with osteoarthritis of the knee: randomized prospective study.

Science.gov (United States)

Seto, Hiroaki; Ikeda, Hiroshi; Hisaoka, Hidehiko; Kurosawa, Hisashi

2008-05-01

Thermotherapy is widely known to be effective for osteoarthritis of the knee (knee OA), but most treatment methods make use of dry heat. We developed a sheet that generates heat and steam simultaneously. In this prospective randomized study, we evaluated the effectiveness of this sheet. Of 41 female patients with knee OA randomized to use the heat/steam-generating sheet or the dry heat-generating sheet, 37 patients (20 using the heat/steam-generating sheet and 17 using the dry heat-generating sheet) who used the sheets continuously for 4 weeks were studied. Outcome measures included the Western Ontario and McMaster Universities Osteoarthritis Index (WOMAC) and Japan Orthopaedic Association (JOA) scores, which were applied at baseline and after 2 and 4 weeks of use. Significant improvement of the total WOMAC score was observed at 2 and 4 weeks (compared to baseline) in the heat/steam-generating sheet group, but no significant change was observed in the dry heat-generating sheet group. Among the JOA scores, the gait ability score was also improved significantly only in the heat/steam-generating sheet group. The effects were still seen 6 weeks after completion of treatment. The present study provided evidence that the heat/steam-generating sheet that we developed is effective for alleviating pain and is especially superior in regard to improving stiffness and gait impairment in patients with knee OA. Furthermore, the effect persists for at least 6 weeks after application.

A comparison of observation-level random effect and Beta-Binomial models for modelling overdispersion in Binomial data in ecology & evolution.

Science.gov (United States)

Harrison, Xavier A

2015-01-01

Overdispersion is a common feature of models of biological data, but researchers often fail to model the excess variation driving the overdispersion, resulting in biased parameter estimates and standard errors. Quantifying and modeling overdispersion when it is present is therefore critical for robust biological inference. One means to account for overdispersion is to add an observation-level random effect (OLRE) to a model, where each data point receives a unique level of a random effect that can absorb the extra-parametric variation in the data. Although some studies have investigated the utility of OLRE to model overdispersion in Poisson count data, studies doing so for Binomial proportion data are scarce. Here I use a simulation approach to investigate the ability of both OLRE models and Beta-Binomial models to recover unbiased parameter estimates in mixed effects models of Binomial data under various degrees of overdispersion. In addition, as ecologists often fit random intercept terms to models when the random effect sample size is low (model types under a range of random effect sample sizes when overdispersion is present. Simulation results revealed that the efficacy of OLRE depends on the process that generated the overdispersion; OLRE failed to cope with overdispersion generated from a Beta-Binomial mixture model, leading to biased slope and intercept estimates, but performed well for overdispersion generated by adding random noise to the linear predictor. Comparison of parameter estimates from an OLRE model with those from its corresponding Beta-Binomial model readily identified when OLRE were performing poorly due to disagreement between effect sizes, and this strategy should be employed whenever OLRE are used for Binomial data to assess their reliability. Beta-Binomial models performed well across all contexts, but showed a tendency to underestimate effect sizes when modelling non-Beta-Binomial data. Finally, both OLRE and Beta-Binomial models performed

Quasi optimal and adaptive sparse grids with control variates for PDEs with random diffusion coefficient

KAUST Repository

Tamellini, Lorenzo

2016-01-05

In this talk we discuss possible strategies to minimize the impact of the curse of dimensionality effect when building sparse-grid approximations of a multivariate function u = u(y1, ..., yN ). More precisely, we present a knapsack approach , in which we estimate the cost and the error reduction contribution of each possible component of the sparse grid, and then we choose the components with the highest error reduction /cost ratio. The estimates of the error reduction are obtained by either a mixed a-priori / a-posteriori approach, in which we first derive a theoretical bound and then tune it with some inexpensive auxiliary computations (resulting in the so-called quasi-optimal sparse grids ), or by a fully a-posteriori approach (obtaining the so-called adaptive sparse grids ). This framework is very general and can be used to build quasi-optimal/adaptive sparse grids on bounded and unbounded domains (e.g. u depending on uniform and normal random distributions for yn), using both nested and non-nested families of univariate collocation points. We present some theoretical convergence results as well as numerical results showing the efficiency of the proposed approach for the approximation of the solution of elliptic PDEs with random diffusion coefficients. In this context, to treat the case of rough permeability fields in which a sparse grid approach may not be suitable, we propose to use the sparse grids as a control variate in a Monte Carlo simulation.

Pseudo Random Coins Show More Heads Than Tails

OpenAIRE

Bauke, Heiko; Mertens, Stephan

2003-01-01

Tossing a coin is the most elementary Monte Carlo experiment. In a computer the coin is replaced by a pseudo random number generator. It can be shown analytically and by exact enumerations that popular random number generators are not capable of imitating a fair coin: pseudo random coins show more heads than tails. This bias explains the empirically observed failure of some random number generators in random walk experiments. It can be traced down to the special role of the value zero in the ...

Modeling stimulus variation in three common implicit attitude tasks.

Science.gov (United States)

Wolsiefer, Katie; Westfall, Jacob; Judd, Charles M

2017-08-01

We explored the consequences of ignoring the sampling variation due to stimuli in the domain of implicit attitudes. A large literature in psycholinguistics has examined the statistical treatment of random stimulus materials, but the recommendations from this literature have not been applied to the social psychological literature on implicit attitudes. This is partly because of inherent complications in applying crossed random-effect models to some of the most common implicit attitude tasks, and partly because no work to date has demonstrated that random stimulus variation is in fact consequential in implicit attitude measurement. We addressed this problem by laying out statistically appropriate and practically feasible crossed random-effect models for three of the most commonly used implicit attitude measures-the Implicit Association Test, affect misattribution procedure, and evaluative priming task-and then applying these models to large datasets (average N = 3,206) that assess participants' implicit attitudes toward race, politics, and self-esteem. We showed that the test statistics from the traditional analyses are substantially (about 60 %) inflated relative to the more-appropriate analyses that incorporate stimulus variation. Because all three tasks used the same stimulus words and faces, we could also meaningfully compare the relative contributions of stimulus variation across the tasks. In an appendix, we give syntax in R, SAS, and SPSS for fitting the recommended crossed random-effects models to data from all three tasks, as well as instructions on how to structure the data file.

Random within-herd variation in financial performance and time to financial steady-state following management changes in the dairy herd

DEFF Research Database (Denmark)

Kristensen, Erling Lundager; Østergaard, Søren; Krogh, Mogens Agerbo

2008-01-01

The manager of a dairy herd and the affiliated consultants constantly need to judge whether financial performance of the production system is satisfactory and whether financial performance relates to real (systematic) effects of changes in management. This is no easy task because the dairy herd...... is a very complex system. Thus, it is difficult to obtain empirical data that allows a valid estimation of the random (within-herd) variation in financial performance corrected for management changes. Thus, simulation seems to be the only option. This study suggests that much caution must be recommended...

Learning-based stochastic object models for characterizing anatomical variations

Science.gov (United States)

Dolly, Steven R.; Lou, Yang; Anastasio, Mark A.; Li, Hua

2018-03-01

It is widely known that the optimization of imaging systems based on objective, task-based measures of image quality via computer-simulation requires the use of a stochastic object model (SOM). However, the development of computationally tractable SOMs that can accurately model the statistical variations in human anatomy within a specified ensemble of patients remains a challenging task. Previously reported numerical anatomic models lack the ability to accurately model inter-patient and inter-organ variations in human anatomy among a broad patient population, mainly because they are established on image data corresponding to a few of patients and individual anatomic organs. This may introduce phantom-specific bias into computer-simulation studies, where the study result is heavily dependent on which phantom is used. In certain applications, however, databases of high-quality volumetric images and organ contours are available that can facilitate this SOM development. In this work, a novel and tractable methodology for learning a SOM and generating numerical phantoms from a set of volumetric training images is developed. The proposed methodology learns geometric attribute distributions (GAD) of human anatomic organs from a broad patient population, which characterize both centroid relationships between neighboring organs and anatomic shape similarity of individual organs among patients. By randomly sampling the learned centroid and shape GADs with the constraints of the respective principal attribute variations learned from the training data, an ensemble of stochastic objects can be created. The randomness in organ shape and position reflects the learned variability of human anatomy. To demonstrate the methodology, a SOM of an adult male pelvis is computed and examples of corresponding numerical phantoms are created.

Random Number Generation in HIV Disease: Associations with Neuropsychological Functions and Activities of Daily Living.

Science.gov (United States)

Sheppard, David P; Woods, Steven Paul; Doyle, Katie L; Verduzco, Marizela

2017-02-01

HIV is associated with frontostriatal dysregulation and executive dysfunction. This study evaluated whether HIV-infected individuals evidence deficits in random number generation (RNG), which is a strategic task requiring paced, rule-guided production of digits. In total, 74 HIV+ adults and 54 seronegative comparison participants completed a comprehensive research neuropsychological battery. Participants produced a random digit sequence by avoiding any order and using numbers 1 through 10 for 100 s at a pace of 1 digit/s. Outcomes included intrusions, repetitions, seriation (1-2-3-4), and cycling (median length of gaps between repeating digits). HIV disease was associated with higher levels of seriation and cycling (ps  .10). Among HIV+ individuals, higher seriation was associated with neuropsychological performance including poorer auditory attention, verbal learning, and delayed memory, whereas higher cycling scores were associated with poorer delayed memory and verbal fluency (ps random sequences, which showed medium associations with higher order verbal abilities and may contribute to greater declines in everyday functioning outcomes. Future studies might examine RNG's role in health behaviors such as medical decision-making or medication adherence. © The Author 2016. Published by Oxford University Press. All rights reserved. For permissions, please e-mail: journals.permissions@oup.com.

Extracting random numbers from quantum tunnelling through a single diode.

Science.gov (United States)

Bernardo-Gavito, Ramón; Bagci, Ibrahim Ethem; Roberts, Jonathan; Sexton, James; Astbury, Benjamin; Shokeir, Hamzah; McGrath, Thomas; Noori, Yasir J; Woodhead, Christopher S; Missous, Mohamed; Roedig, Utz; Young, Robert J

2017-12-19

Random number generation is crucial in many aspects of everyday life, as online security and privacy depend ultimately on the quality of random numbers. Many current implementations are based on pseudo-random number generators, but information security requires true random numbers for sensitive applications like key generation in banking, defence or even social media. True random number generators are systems whose outputs cannot be determined, even if their internal structure and response history are known. Sources of quantum noise are thus ideal for this application due to their intrinsic uncertainty. In this work, we propose using resonant tunnelling diodes as practical true random number generators based on a quantum mechanical effect. The output of the proposed devices can be directly used as a random stream of bits or can be further distilled using randomness extraction algorithms, depending on the application.

Lotka-Volterra system in a random environment

Science.gov (United States)

Dimentberg, Mikhail F.

2002-03-01

Classical Lotka-Volterra (LV) model for oscillatory behavior of population sizes of two interacting species (predator-prey or parasite-host pairs) is conservative. This may imply unrealistically high sensitivity of the system's behavior to environmental variations. Thus, a generalized LV model is considered with the equation for preys' reproduction containing the following additional terms: quadratic ``damping'' term that accounts for interspecies competition, and term with white-noise random variations of the preys' reproduction factor that simulates the environmental variations. An exact solution is obtained for the corresponding Fokker-Planck-Kolmogorov equation for stationary probability densities (PDF's) of the population sizes. It shows that both population sizes are independent γ-distributed stationary random processes. Increasing level of the environmental variations does not lead to extinction of the populations. However it may lead to an intermittent behavior, whereby one or both population sizes experience very rare and violent short pulses or outbreaks while remaining on a very low level most of the time. This intermittency is described analytically by direct use of the solutions for the PDF's as well as by applying theory of excursions of random functions and by predicting PDF of peaks in the predators' population size.

Random Number Generation in Autism.

Science.gov (United States)

Williams, Mark A.; Moss, Simon A.; Bradshaw, John L.; Rinehart, Nicole J.

2002-01-01

This study explored the ability of 14 individuals with autism to generate a unique series of digits. Individuals with autism were more likely to repeat previous digits than comparison individuals, suggesting they may exhibit a shortfall in response inhibition. Results support the executive dysfunction theory of autism. (Contains references.)…

Autonomous Byte Stream Randomizer

Science.gov (United States)

Paloulian, George K.; Woo, Simon S.; Chow, Edward T.

2013-01-01

Net-centric networking environments are often faced with limited resources and must utilize bandwidth as efficiently as possible. In networking environments that span wide areas, the data transmission has to be efficient without any redundant or exuberant metadata. The Autonomous Byte Stream Randomizer software provides an extra level of security on top of existing data encryption methods. Randomizing the data s byte stream adds an extra layer to existing data protection methods, thus making it harder for an attacker to decrypt protected data. Based on a generated crypto-graphically secure random seed, a random sequence of numbers is used to intelligently and efficiently swap the organization of bytes in data using the unbiased and memory-efficient in-place Fisher-Yates shuffle method. Swapping bytes and reorganizing the crucial structure of the byte data renders the data file unreadable and leaves the data in a deconstructed state. This deconstruction adds an extra level of security requiring the byte stream to be reconstructed with the random seed in order to be readable. Once the data byte stream has been randomized, the software enables the data to be distributed to N nodes in an environment. Each piece of the data in randomized and distributed form is a separate entity unreadable on its own right, but when combined with all N pieces, is able to be reconstructed back to one. Reconstruction requires possession of the key used for randomizing the bytes, leading to the generation of the same cryptographically secure random sequence of numbers used to randomize the data. This software is a cornerstone capability possessing the ability to generate the same cryptographically secure sequence on different machines and time intervals, thus allowing this software to be used more heavily in net-centric environments where data transfer bandwidth is limited.

Composition, peat-forming vegetation and kerogen paraffinicity of Cenozoic coals: Relationship to variations in the petroleum generation potential (Hydrogen Index)