Quantum random number generation
Ma, Xiongfeng; Yuan, Xiao; Cao, Zhu; Zhang, Zhen; Qi, Bing
2016-01-01
Here, quantum physics can be exploited to generate true random numbers, which play important roles in many applications, especially in cryptography. Genuine randomness from the measurement of a quantum system reveals the inherent nature of quantumness — coherence, an important feature that differentiates quantum mechanics from classical physics. The generation of genuine randomness is generally considered impossible with only classical means. Based on the degree of trustworthiness on devices, quantum random number generators (QRNGs) can be grouped into three categories. The first category, practical QRNG, is built on fully trusted and calibrated devices and typically can generate randomness at a high speed by properly modeling the devices. The second category is self-testing QRNG, where verifiable randomness can be generated without trusting the actual implementation. The third category, semi-self-testing QRNG, is an intermediate category which provides a tradeoff between the trustworthiness on the device and the random number generation speed.
Quantum random number generation
Ma, Xiongfeng; Yuan, Xiao; Cao, Zhu; Zhang, Zhen; Qi, Bing
2016-06-28
Here, quantum physics can be exploited to generate true random numbers, which play important roles in many applications, especially in cryptography. Genuine randomness from the measurement of a quantum system reveals the inherent nature of quantumness -- coherence, an important feature that differentiates quantum mechanics from classical physics. The generation of genuine randomness is generally considered impossible with only classical means. Based on the degree of trustworthiness on devices, quantum random number generators (QRNGs) can be grouped into three categories. The first category, practical QRNG, is built on fully trusted and calibrated devices and typically can generate randomness at amore » high speed by properly modeling the devices. The second category is self-testing QRNG, where verifiable randomness can be generated without trusting the actual implementation. The third category, semi-self-testing QRNG, is an intermediate category which provides a tradeoff between the trustworthiness on the device and the random number generation speed.« less
Quantum random number generator
Pooser, Raphael C.
2016-05-10
A quantum random number generator (QRNG) and a photon generator for a QRNG are provided. The photon generator may be operated in a spontaneous mode below a lasing threshold to emit photons. Photons emitted from the photon generator may have at least one random characteristic, which may be monitored by the QRNG to generate a random number. In one embodiment, the photon generator may include a photon emitter and an amplifier coupled to the photon emitter. The amplifier may enable the photon generator to be used in the QRNG without introducing significant bias in the random number and may enable multiplexing of multiple random numbers. The amplifier may also desensitize the photon generator to fluctuations in power supplied thereto while operating in the spontaneous mode. In one embodiment, the photon emitter and amplifier may be a tapered diode amplifier.
Uniform random number generators
NASA Technical Reports Server (NTRS)
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.
Digital random-number generator
NASA Technical Reports Server (NTRS)
Brocker, D. H.
1973-01-01
For binary digit array of N bits, use N noise sources to feed N nonlinear operators; each flip-flop in digit array is set by nonlinear operator to reflect whether amplitude of generator which feeds it is above or below mean value of generated noise. Fixed-point uniform distribution random number generation method can also be used to generate random numbers with other than uniform distribution.
High speed optical quantum random number generation.
Fürst, Martin; Weier, Henning; Nauerth, Sebastian; Marangon, Davide G; Kurtsiefer, Christian; Weinfurter, Harald
2010-06-01
We present a fully integrated, ready-for-use quantum random number generator (QRNG) whose stochastic model is based on the randomness of detecting single photons in attenuated light. We show that often annoying deadtime effects associated with photomultiplier tubes (PMT) can be utilized to avoid postprocessing for bias or correlations. The random numbers directly delivered to a PC, generated at a rate of up to 50 Mbit/s, clearly pass all tests relevant for (physical) random number generators. PMID:20588431
Self-correcting random number generator
Humble, Travis S.; Pooser, Raphael C.
2016-09-06
A system and method for generating random numbers. The system may include a random number generator (RNG), such as a quantum random number generator (QRNG) configured to self-correct or adapt in order to substantially achieve randomness from the output of the RNG. By adapting, the RNG may generate a random number that may be considered random regardless of whether the random number itself is tested as such. As an example, the RNG may include components to monitor one or more characteristics of the RNG during operation, and may use the monitored characteristics as a basis for adapting, or self-correcting, to provide a random number according to one or more performance criteria.
Generation of pseudo-random numbers
NASA Technical Reports Server (NTRS)
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.
The MCNP5 Random number generator
Brown, F. B.; Nagaya, Y.
2002-01-01
MCNP and other Monte Carlo particle transport codes use random number generators to produce random variates from a uniform distribution on the interval. These random variates are then used in subsequent sampling from probability distributions to simulate the physical behavior of particles during the transport process. This paper describes the new random number generator developed for MCNP Version 5. The new generator will optionally preserve the exact random sequence of previous versions and is entirely conformant to the Fortran-90 standard, hence completely portable. In addition, skip-ahead algorithms have been implemented to efficiently initialize the generator for new histories, a capability that greatly simplifies parallel algorithms. Further, the precision of the generator has been increased, extending the period by a factor of 10{sup 5}. Finally, the new generator has been subjected to 3 different sets of rigorous and extensive statistical tests to verify that it produces a sufficiently random sequence.
Self-testing quantum random number generator.
Lunghi, Tommaso; Brask, Jonatan Bohr; Lim, Charles Ci Wen; Lavigne, Quentin; Bowles, Joseph; Martin, Anthony; Zbinden, Hugo; Brunner, Nicolas
2015-04-17
The generation of random numbers is a task of paramount importance in modern science. A central problem for both classical and quantum randomness generation is to estimate the entropy of the data generated by a given device. Here we present a protocol for self-testing quantum random number generation, in which the user can monitor the entropy in real time. Based on a few general assumptions, our protocol guarantees continuous generation of high quality randomness, without the need for a detailed characterization of the devices. Using a fully optical setup, we implement our protocol and illustrate its self-testing capacity. Our work thus provides a practical approach to quantum randomness generation in a scenario of trusted but error-prone devices. PMID:25933297
Self-Testing Quantum Random Number Generator
NASA Astrophysics Data System (ADS)
Lunghi, Tommaso; Brask, Jonatan Bohr; Lim, Charles Ci Wen; Lavigne, Quentin; Bowles, Joseph; Martin, Anthony; Zbinden, Hugo; Brunner, Nicolas
2015-04-01
The generation of random numbers is a task of paramount importance in modern science. A central problem for both classical and quantum randomness generation is to estimate the entropy of the data generated by a given device. Here we present a protocol for self-testing quantum random number generation, in which the user can monitor the entropy in real time. Based on a few general assumptions, our protocol guarantees continuous generation of high quality randomness, without the need for a detailed characterization of the devices. Using a fully optical setup, we implement our protocol and illustrate its self-testing capacity. Our work thus provides a practical approach to quantum randomness generation in a scenario of trusted but error-prone devices.
Source-Independent Quantum Random Number Generation
NASA Astrophysics Data System (ADS)
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 .
Spatio-temporal optical random number generator.
Stipčević, M; Bowers, J E
2015-05-01
We present a first random number generator (RNG) which simultaneously uses independent spatial and temporal quantum randomness contained in an optical system. Availability of the two independent sources of entropy makes the RNG resilient to hardware failure and signal injection attacks. We show that the deviation from randomness of the generated numbers can be estimated quickly from simple measurements thus eliminating the need for usual time-consuming statistical testing of the output data. As a confirmation it is demonstrated that generated numbers pass NIST Statistical test suite. PMID:25969254
Generation of Random Numbers by Micromechanism
NASA Astrophysics Data System (ADS)
Mita, Makoto; Toshiyoshi, Hiroshi; Ataka, Manabu; Fujita, Hiroyuki
We have successfully developed a novel micromechanism of random number generator (RNG) by using the silicon micromachining technique. The MEM(Micro Electro Mechanical)RNG produce a series of random numbers by using the pull-in instability of electrostatic actuation operated with a typical dc 150 volt. The MEM RNG is made by the deep reactive ion etching of a silicon-on-insulator(SOI) wafer, and is very small compared with the conventional RNG hardware based on the randomness of thermal noise or isotope radiation. Quality of randomness has been experimentally confirmed by the self-correlation study of the generated series of numbers. The MEM RNG proposed here would be a true random number generation, which is needed for the highly secured encryption system of today’s information technology.
Truly random number generation: an example
NASA Astrophysics Data System (ADS)
Frauchiger, Daniela; Renner, Renato
2013-10-01
Randomness is crucial for a variety of applications, ranging from gambling to computer simulations, and from cryptography to statistics. However, many of the currently used methods for generating randomness do not meet the criteria that are necessary for these applications to work properly and safely. A common problem is that a sequence of numbers may look random but nevertheless not be truly random. In fact, the sequence may pass all standard statistical tests and yet be perfectly predictable. This renders it useless for many applications. For example, in cryptography, the predictability of a "andomly" chosen password is obviously undesirable. Here, we review a recently developed approach to generating true | and hence unpredictable | randomness.
Quantum random number generator using photon-number path entanglement.
Kwon, Osung; Cho, Young-Wook; Kim, Yoon-Ho
2009-03-20
We report a quantum random number generator based on the photon-number-path entangled state that is prepared by means of two-photon quantum interference at a beam splitter. The randomness in our scheme is truly quantum mechanical in origin since it results from the projection measurement of the entangled two-photon state. The generated bit sequences satisfy the standard randomness test. PMID:19305476
The RANDOM computer program: A linear congruential random number generator
NASA Technical Reports Server (NTRS)
Miles, R. F., Jr.
1986-01-01
The RANDOM Computer Program is a FORTRAN program for generating random number sequences and testing linear congruential random number generators (LCGs). The linear congruential form of random number generator is discussed, and the selection of parameters of an LCG for a microcomputer described. This document describes the following: (1) The RANDOM Computer Program; (2) RANDOM.MOD, the computer code needed to implement an LCG in a FORTRAN program; and (3) The RANCYCLE and the ARITH Computer Programs that provide computational assistance in the selection of parameters for an LCG. The RANDOM, RANCYCLE, and ARITH Computer Programs are written in Microsoft FORTRAN for the IBM PC microcomputer and its compatibles. With only minor modifications, the RANDOM Computer Program and its LCG can be run on most micromputers or mainframe computers.
Statistical Analysis of Random Number Generators
NASA Astrophysics Data System (ADS)
Accardi, Luigi; Gäbler, Markus
2011-01-01
In many applications, for example cryptography and Monte Carlo simulation, there is need for random numbers. Any procedure, algorithm or device which is intended to produce such is called a random number generator (RNG). What makes a good RNG? This paper gives an overview on empirical testing of the statistical properties of the sequences produced by RNGs and special software packages designed for that purpose. We also present the results of applying a particular test suite--TestU01-- to a family of RNGs currently being developed at the Centro Interdipartimentale Vito Volterra (CIVV), Roma, Italy.
How random are random numbers generated using photons?
NASA Astrophysics Data System (ADS)
Solis, Aldo; Angulo Martínez, Alí M.; Ramírez Alarcón, Roberto; Cruz Ramírez, Hector; U'Ren, Alfred B.; Hirsch, Jorge G.
2015-06-01
Randomness is fundamental in quantum theory, with many philosophical and practical implications. In this paper we discuss the concept of algorithmic randomness, which provides a quantitative method to assess the Borel normality of a given sequence of numbers, a necessary condition for it to be considered random. We use Borel normality as a tool to investigate the randomness of ten sequences of bits generated from the differences between detection times of photon pairs generated by spontaneous parametric downconversion. These sequences are shown to fulfil the randomness criteria without difficulties. As deviations from Borel normality for photon-generated random number sequences have been reported in previous work, a strategy to understand these diverging findings is outlined.
Operational conditions for random-number generation
NASA Astrophysics Data System (ADS)
Compagner, A.
1995-11-01
Ensemble theory is used to describe arbitrary sequences of integers, whether formed by the decimals of π or produced by a roulette or by any other means. Correlation coefficients of any range and order are defined as Fourier transforms of the ensemble weights. Competing definitions of random sequences are considered. Special attention is given to sequences of random numbers needed for Monte Carlo calculations. Different recipes for those sequences lead to correlations that vary in range and order, but the total amount of correlation is the same for all sequences of a given length (without internal periodicities). For maximum-length sequences produced by linear algorithms, most correlation coefficients are zero, but the remaining ones are of absolute value 1. In well-tempered sequences, these complete correlations are of high order or of very long range. General conditions to be obeyed by random-number generators are discussed and a qualitative method for comparing different recipes is given.
Random number generation from spontaneous Raman scattering
NASA Astrophysics Data System (ADS)
Collins, M. J.; Clark, A. S.; Xiong, C.; Mägi, E.; Steel, M. J.; Eggleton, B. J.
2015-10-01
We investigate the generation of random numbers via the quantum process of spontaneous Raman scattering. Spontaneous Raman photons are produced by illuminating a highly nonlinear chalcogenide glass ( As 2 S 3 ) fiber with a CW laser at a power well below the stimulated Raman threshold. Single Raman photons are collected and separated into two discrete wavelength detuning bins of equal scattering probability. The sequence of photon detection clicks is converted into a random bit stream. Postprocessing is applied to remove detector bias, resulting in a final bit rate of ˜650 kb/s. The collected random bit-sequences pass the NIST statistical test suite for one hundred 1 Mb samples, with the significance level set to α = 0.01 . The fiber is stable, robust and the high nonlinearity (compared to silica) allows for a short fiber length and low pump power favourable for real world application.
Long period pseudo random number sequence generator
NASA Technical Reports Server (NTRS)
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).
A Pseudo-Random Number Generator Based on Normal Numbers
Bailey, David H.
2004-12-31
In a recent paper, Richard Crandall and the present author established that each of a certain class of explicitly given real constants, uncountably infinite in number, is b-normal, for an integer that appears in the formula defining the constant. A b-normal constant is one where every string of m digits appears in the base-b expansion of the constant with limiting frequency b{sup -m}. This paper shows how this result can be used to fashion an efficient and effective pseudo-random number generator, which generates successive strings of binary digits from one of the constants in this class. The resulting generator, which tests slightly faster than a conventional linear congruential generator, avoids difficulties with large power-of-two data access strides that may occur when using conventional generators. It is also well suited for parallel processing--each processor can quickly and independently compute its starting value, with the collective sequence generated by all processors being the same as that generated by a single processor.
A random number generator for continuous random variables
NASA Technical Reports Server (NTRS)
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.
Statistical Evaluation of a Superconductive Physical Random Number Generator
NASA Astrophysics Data System (ADS)
Sugiura, Tatsuro; Yamanashi, Yuki; Yoshikawa, Nobuyuki
A physical random number generator, which generates truly random number trains by using the randomness of physical phenomena, is widely used in the field of cryptographic applications. We have developed an ultra high-speed superconductive physical random number generator that can generate random numbers at a frequency of more than 10GHz by utilizing the high-speed operation and high-sensitivity of superconductive integrated circuits. In this study, we have statistically evaluated the quality of the random number trains generated by the superconductive physical random number generator. The performances of the statistical tests were based on a test method provided by National Institute of Standards and Technology (NIST). These statistical tests comprised several fundamental tests that were performed to evaluate the random number trains for their utilization in practical cryptographic applications. We have generated 230 random number trains consisting of 20, 000-bits by using the superconductive physical random number generator fabricated by the SRL 2.5kA/cm2 Nb standard process. The generated random number trains passed all the fundamental statistical tests. This result indicates that the superconductive random number generator can be sufficiently utilized in practical applications.
Bias-free true random-number generator.
Wei, Wei; Guo, Hong
2009-06-15
We propose what we believe to be a new approach to nondeterministic random-number generation. The randomness originated from the uncorrelated nature of consecutive laser pulses with Poissonian photon statistics and that of photon number detections is used to generate random bit, and the von Neumann correction method is used to extract the final random bit. This method is proved to be bias free in randomness generation, provided that the single photon detections are mutually independent. Further, it has the advantage in fast random bit generation, since no postprocessing is needed. A true random-number generator based on this method is realized, and its randomness is tested and guaranteed using three statistical test batteries. PMID:19529733
Effects of regular switching between languages during random number generation.
Strenge, Hans; Böhm, Jessica
2005-04-01
Random number generation is a task that engages working memory and executive processes within the domain of number representation. In the present study we address the role of language in number processing by switching languages during random number generation (numbers 1-9), using German (L1) and English (L2), and alternating L1/L2. Results indicate large correspondence between performance in L1 and L2. In contrast to nonswitching performance, randomization with alternating languages showed a significant increase of omitted responses, whereas the random sequences were less stereotyped, showing significantly less repetition avoidance and cycling behavior. During an intentional switch between languages, errors in language sequence appeared in 23% of responses on the average, independently of the quality of randomization but associated with a clear persistence of L2. These results indicate that random number generation is more closely linked to auditory-phonological representation of numerals than to visual arabic notation. PMID:15974362
Quantum random number generation for loophole-free Bell tests
NASA Astrophysics Data System (ADS)
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.
SPRNG Scalable Parallel Random Number Generator LIbrary
Energy Science and Technology Software Center (ESTSC)
2010-03-16
This revision corrects some errors in SPRNG 1. Users of newer SPRNG versions can obtain the corrected files and build their version with it. This version also improves the scalability of some of the application-based tests in the SPRNG test suite. It also includes an interface to a parallel Mersenne Twister, so that if users install the Mersenne Twister, then they can test this generator with the SPRNG test suite and also use some SPRNGmore » features with that generator.« less
Humans cannot consciously generate random numbers sequences: Polemic study.
Figurska, Małgorzata; Stańczyk, Maciej; Kulesza, Kamil
2008-01-01
It is widely believed, that randomness exists in Nature. In fact such an assumption underlies many scientific theories and is embedded in the foundations of quantum mechanics. Assuming that this hypothesis is valid one can use natural phenomena, like radioactive decay, to generate random numbers. Today, computers are capable of generating the so-called pseudorandom numbers. Such series of numbers are only seemingly random (bias in the randomness quality can be observed). Question whether people can produce random numbers, has been investigated by many scientists in the recent years. The paper "Humans can consciously generate random numbers sequences..." published recently in Medical Hypotheses made claims that were in many ways contrary to state of art; it also stated far-reaching hypotheses. So, we decided to repeat the experiments reported, with special care being taken of proper laboratory procedures. Here, we present the results and discuss possible implications in computer and other sciences. PMID:17888582
RNGAVXLIB: Program library for random number generation, AVX realization
NASA Astrophysics Data System (ADS)
Guskova, M. S.; Barash, L. Yu.; Shchur, L. N.
2016-03-01
We present the random number generator (RNG) library RNGAVXLIB, which contains fast AVX realizations of a number of modern random number generators, and also the abilities to jump ahead inside a RNG sequence and to initialize up to 1019 independent random number streams with block splitting method. Fast AVX implementations produce exactly the same output sequences as the original algorithms. Usage of AVX vectorization allows to substantially improve performance of the generators. The new realizations are up to 2 times faster than the SSE realizations implemented in the previous version of the library (Barash and Shchur, 2013), and up to 40 times faster compared to the original algorithms written in ANSI C.
Pseudo-random number generator for the Sigma 5 computer
NASA Technical Reports Server (NTRS)
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.
Quantum Random Number Generation Using a Quanta Image Sensor.
Amri, Emna; Felk, Yacine; Stucki, Damien; Ma, Jiaju; Fossum, Eric R
2016-01-01
A new quantum random number generation method is proposed. The method is based on the randomness of the photon emission process and the single photon counting capability of the Quanta Image Sensor (QIS). It has the potential to generate high-quality random numbers with remarkable data output rate. In this paper, the principle of photon statistics and theory of entropy are discussed. Sample data were collected with QIS jot device, and its randomness quality was analyzed. The randomness assessment method and results are discussed. PMID:27367698
Quantum Random Number Generation Using a Quanta Image Sensor
Amri, Emna; Felk, Yacine; Stucki, Damien; Ma, Jiaju; Fossum, Eric R.
2016-01-01
A new quantum random number generation method is proposed. The method is based on the randomness of the photon emission process and the single photon counting capability of the Quanta Image Sensor (QIS). It has the potential to generate high-quality random numbers with remarkable data output rate. In this paper, the principle of photon statistics and theory of entropy are discussed. Sample data were collected with QIS jot device, and its randomness quality was analyzed. The randomness assessment method and results are discussed. PMID:27367698
A hybrid-type quantum random number generator
NASA Astrophysics Data System (ADS)
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).
Quantum random number generator based on photonic emission in semiconductors.
Stipcević, M; Rogina, B Medved
2007-04-01
We report upon the realization of a novel fast nondeterministic random number generator whose randomness relies on the intrinsic randomness of the quantum physical processes of photonic emission in semiconductors and subsequent detection by the photoelectric effect. Timing information of detected photons is used to generate binary random digits-bits. The bit extraction method based on the restartable clock method theoretically eliminates both bias and autocorrelation while reaching efficiency of almost 0.5 bits per random event. A prototype has been built and statistically tested. PMID:17477690
NASA Astrophysics Data System (ADS)
Miszczak, Jarosław Adam
2013-01-01
The presented package for the Mathematica computing system allows the harnessing of quantum random number generators (QRNG) for investigating the statistical properties of quantum states. The described package implements a number of functions for generating random states. The new version of the package adds the ability to use the on-line quantum random number generator service and implements new functions for retrieving lists of random numbers. Thanks to the introduced improvements, the new version provides faster access to high-quality sources of random numbers and can be used in simulations requiring large amount of random data. New version program summaryProgram title: TRQS Catalogue identifier: AEKA_v2_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEKA_v2_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 18 134 No. of bytes in distributed program, including test data, etc.: 2 520 49 Distribution format: tar.gz Programming language: Mathematica, C. Computer: Any supporting Mathematica in version 7 or higher. Operating system: Any platform supporting Mathematica; tested with GNU/Linux (32 and 64 bit). RAM: Case-dependent Supplementary material: Fig. 1 mentioned below can be downloaded. Classification: 4.15. External routines: Quantis software library (http://www.idquantique.com/support/quantis-trng.html) Catalogue identifier of previous version: AEKA_v1_0 Journal reference of previous version: Comput. Phys. Comm. 183(2012)118 Does the new version supersede the previous version?: Yes Nature of problem: Generation of random density matrices and utilization of high-quality random numbers for the purpose of computer simulation. Solution method: Use of a physical quantum random number generator and an on-line service providing access to the source of true random
Social Noise: Generating Random Numbers from Twitter Streams
NASA Astrophysics Data System (ADS)
Fernández, Norberto; Quintas, Fernando; Sánchez, Luis; Arias, Jesús
2015-12-01
Due to the multiple applications of random numbers in computer systems (cryptography, online gambling, computer simulation, etc.) it is important to have mechanisms to generate these numbers. True Random Number Generators (TRNGs) are commonly used for this purpose. TRNGs rely on non-deterministic sources to generate randomness. Physical processes (like noise in semiconductors, quantum phenomenon, etc.) play this role in state of the art TRNGs. In this paper, we depart from previous work and explore the possibility of defining social TRNGs using the stream of public messages of the microblogging service Twitter as randomness source. Thus, we define two TRNGs based on Twitter stream information and evaluate them using the National Institute of Standards and Technology (NIST) statistical test suite. The results of the evaluation confirm the feasibility of the proposed approach.
Brain potentials index executive functions during random number generation.
Joppich, Gregor; Däuper, Jan; Dengler, Reinhard; Johannes, Sönke; Rodriguez-Fornells, Antoni; Münte, Thomas F
2004-06-01
The generation of random sequences is considered to tax different executive functions. To explore the involvement of these functions further, brain potentials were recorded in 16 healthy young adults while either engaging in random number generation (RNG) by pressing the number keys on a computer keyboard in a random sequence or in ordered number generation (ONG) necessitating key presses in the canonical order. Key presses were paced by an external auditory stimulus to yield either fast (1 press/800 ms) or slow (1 press/1300 ms) sequences in separate runs. Attentional demands of random and ordered tasks were assessed by the introduction of a secondary task (key-press to a target tone). The P3 amplitude to the target tone of this secondary task was reduced during RNG, reflecting the greater consumption of attentional resources during RNG. Moreover, RNG led to a left frontal negativity peaking 140 ms after the onset of the pacing stimulus, whenever the subjects produced a true random response. This negativity could be attributed to the left dorsolateral prefrontal cortex and was absent when numbers were repeated. This negativity was interpreted as an index for the inhibition of habitual responses. Finally, in response locked ERPs a negative component was apparent peaking about 50 ms after the key-press that was more prominent during RNG. Source localization suggested a medial frontal source. This effect was tentatively interpreted as a reflection of the greater monitoring demands during random sequence generation. PMID:15140558
Two-bit quantum random number generator based on photon-number-resolving detection.
Jian, Yi; Ren, Min; Wu, E; Wu, Guang; Zeng, Heping
2011-07-01
Here we present a new fast two-bit quantum random number generator based on the intrinsic randomness of the quantum physical phenomenon of photon statistics of coherent light source. Two-bit random numbers were generated according to the number of detected photons in each light pulse by a photon-number-resolving detector. Poissonian photon statistics of the coherent light source guaranteed the complete randomness of the bit sequences. Multi-bit true random numbers were generated for the first time based on the multi-photon events from a coherent light source. PMID:21806174
Accelerating Pseudo-Random Number Generator for MCNP on GPU
NASA Astrophysics Data System (ADS)
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.
Ultrafast quantum random number generation based on quantum phase fluctuations.
Xu, Feihu; Qi, Bing; Ma, Xiongfeng; Xu, He; Zheng, Haoxuan; Lo, Hoi-Kwong
2012-05-21
A quantum random number generator (QRNG) can generate true randomness by exploiting the fundamental indeterminism of quantum mechanics. Most approaches to QRNG employ single-photon detection technologies and are limited in speed. Here, we experimentally demonstrate an ultrafast QRNG at a rate over 6 Gbits/s based on the quantum phase fluctuations of a laser operating near threshold. Moreover, we consider a potential adversary who has partial knowledge on the raw data and discuss how one can rigorously remove such partial knowledge with postprocessing. We quantify the quantum randomness through min-entropy by modeling our system and employ two randomness extractors--Trevisan's extractor and Toeplitz-hashing--to distill the randomness, which is information-theoretically provable. The simplicity and high-speed of our experimental setup show the feasibility of a robust, low-cost, high-speed QRNG. PMID:22714224
GASPRNG: GPU accelerated scalable parallel random number generator library
NASA Astrophysics Data System (ADS)
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
Random number generation in native and foreign languages.
Strenge, Hans; Bohm, Jessica
2004-06-01
The effects of different levels of language proficiency on random number generation were examined in this study. 16 healthy right-handed students (7 women, 9 men; aged 22 to 25 years, M=23.8, SD=.83) attempted to generate a random sequence of the digits 1 to 9 at pacing frequencies of 1, 1.5, and 2 Hz. Randomization was done in German (native language L1), English (first foreign language L2), and French (second foreign language L3). There was a pattern of redundancy and seriation tendencies, increasing with speed of generation for all languages (L1-L3). While using L2 and L3, responses slowed and the number of errors committed increased. Further, there was a peculiar pattern of dissociation in nonrandom performance with an increase of habitual counting in ones and a strong reduction of counting in twos. All effects were most pronounced when subjects used L3 and 2-Hz pacing rates. Slowing and nonrandomness was not correlated with self-assessment parameters regarding language proficiency. We suggest that in a task involving number activation in a nonnative language, lack of proficiency will interfere with random number generation, leading to interruptions and rule breaking, at least when reaching the limits of attentional capacity at higher pacing rates. PMID:15291201
Analysis of entropy extraction efficiencies in random number generation systems
NASA Astrophysics Data System (ADS)
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.
Strong experimental guarantees in ultrafast quantum random number generation
NASA Astrophysics Data System (ADS)
Mitchell, Morgan W.; Abellan, Carlos; Amaya, Waldimar
2015-01-01
We describe a methodology and standard of proof for experimental claims of quantum random-number generation (QRNG), analogous to well-established methods from precision measurement. For appropriately constructed physical implementations, lower bounds on the quantum contribution to the average min-entropy can be derived from measurements on the QRNG output. Given these bounds, randomness extractors allow generation of nearly perfect "ɛ -random" bit streams. An analysis of experimental uncertainties then gives experimentally derived confidence levels on the ɛ randomness of these sequences. We demonstrate the methodology by application to phase-diffusion QRNG, driven by spontaneous emission as a trusted randomness source. All other factors, including classical phase noise, amplitude fluctuations, digitization errors, and correlations due to finite detection bandwidth, are treated with paranoid caution, i.e., assuming the worst possible behaviors consistent with observations. A data-constrained numerical optimization of the distribution of untrusted parameters is used to lower bound the average min-entropy. Under this paranoid analysis, the QRNG remains efficient, generating at least 2.3 quantum random bits per symbol with 8-bit digitization and at least 0.83 quantum random bits per symbol with binary digitization at a confidence level of 0.999 93. The result demonstrates ultrafast QRNG with strong experimental guarantees.
Quantum random number generators and their applications in cryptography
NASA Astrophysics Data System (ADS)
Stipcevic, Mario
2012-06-01
Random number generators (RNG) are an important resource in many areas: cryptography (both quantum and classical), probabilistic computation (Monte Carlo methods), numerical simulations, industrial testing and labeling, hazard games, scientific research etc. Because today's computers are deterministic, they can not create random numbers unless complemented with a physical RNG. Randomness of a RNG can be defined and scientifically characterized and measured. Especially valuable is the information-theoretic provable RNG which, at state of the art, seem to be possible only by harvest of randomness inherent to certain (simple) quantum systems and such a generator we call Quantum RNG (QRNG). On the other hand, current industry standards dictate use of RNGs based on free running oscillators (FRO) whose randomness is derived from electronics noise present in logic circuits and which, although quantum in nature, cannot be strictly proven. This approach is currently used in FPGA and ASIC chips. We compare weak and strong aspects of the two approaches for use in cryptography and in general. We also give an alternative definition of randomness, discuss usage of single photon detectors in realization of QRNGs and give several examples where QRNG can significantly improve security of a cryptographic system.
Postprocessing for quantum random-number generators: Entropy evaluation and randomness extraction
NASA Astrophysics Data System (ADS)
Ma, Xiongfeng; Xu, Feihu; Xu, He; Tan, Xiaoqing; Qi, Bing; Lo, Hoi-Kwong
2013-06-01
Quantum random-number generators (QRNGs) can offer a means to generate information-theoretically provable random numbers, in principle. In practice, unfortunately, the quantum randomness is inevitably mixed with classical randomness due to classical noises. To distill this quantum randomness, one needs to quantify the randomness of the source and apply a randomness extractor. Here, we propose a generic framework for evaluating quantum randomness of real-life QRNGs by min-entropy, and apply it to two different existing quantum random-number systems in the literature. Moreover, we provide a guideline of QRNG data postprocessing for which we implement two information-theoretically provable randomness extractors: Toeplitz-hashing extractor and Trevisan's extractor.
NASA Astrophysics Data System (ADS)
Barash, L. Yu.; Shchur, L. N.
2013-10-01
In this update, we present the new version of the random number generator (RNG) library RNGSSELIB, which, in particular, contains fast SSE realizations of a number of modern and most reliable generators [1]. The new features are: (i) Fortran compatibility and examples of using the library in Fortran; (ii) new modern and reliable generators; (iii) the abilities to jump ahead inside a RNG sequence and to initialize up to 1019 independent random number streams with block splitting method. Summary of revisions: We added Fortran compatibility and examples of using the library in Fortran for each of the generators. New modern and reliable generators GM29, GM55.4, GQ58.1, GQ58.3, and GQ58.4, which were introduced in [5] were added to the library. The ability to jump ahead inside a RNG sequence and to initialize independent random number streams with block splitting method are added for each of the RNGs. Restrictions: For SSE realizations of the generators, the Intel or AMD CPU supporting SSE2 command set is required. In order to use the SSE realization for the lfsr113 generator, the CPU must support the SSE4.1 command set. Additional comments: The function call interface has been slightly modified compared to the previous version in order to support Fortran compatibility. For each of the generators, RNGSSELIB supports the following functions, where rng should be replaced by the particular name of the RNG: void rng_skipahead_(rng_state* state, unsigned long long offset); void rng_init_(rng_state* state); void rng_init_sequence_(rng_state* state,unsigned long long SequenceNumber); unsigned int rng_generate_(rng_state* state); float rng_generate_uniform_float_(rng_state* state); unsigned int rng_sse_generate_(rng_sse_state* state); void rng_get_sse_state_(rng_state* state,rng_sse_state* sse_state); void rng_print_state_(rng_state* state); void rng_print_sse_state_(rng_sse_state* state); There are a few peculiarities for some of the RNGs. For example, the function void mt
Implementing Quality Control on a Random Number Stream to Improve a Stochastic Weather Generator
Technology Transfer Automated Retrieval System (TEKTRAN)
For decades stochastic modelers have used computerized random number generators to produce random numeric sequences fitting a specified statistical distribution. Unfortunately, none of the random number generators we tested satisfactorily produced the target distribution. The result is generated d...
Quantum Statistical Testing of a Quantum Random Number Generator
Humble, Travis S
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.
Strenge, Hans; Rogge, Carolin
2010-04-01
The effects of different instructions on verbal random number generation were examined in 40 healthy students who attempted to generate random sequences of the digits 1 to 6. Two groups of 20 received different instructions with alternative numerical representations. The Symbolic group (Arabic digits) was instructed to randomize while continuously using the analogy of selecting and replacing numbered balls from a hat, whereas the Nonsymbolic group (arrays of dots) was instructed to imagine repeatedly throwing a die. Participants asked for self-reports on their strategies reported spontaneously occurring visuospatial imagination of a mental number line (42%), or imagining throwing a die (23%). Individual number representation was not affected by the initial instruction. There were no differences in randomization performance by group. Comprehensive understanding of the nature of the randomization task requires considering individual differences in construction of mental models. PMID:20499555
Statistical Tests of the Apple IIe Random Number Generator Yield Suggestions from Generator Seeding.
ERIC Educational Resources Information Center
Gleason, John M.
1988-01-01
Discusses flaws in the Apple IIe Applesoft random number generator, RND, and reports results of frequency and serial correlation tests of the generator. Suggestions of seeds that yield sequences of numbers which pass fundamental screening tests for randomness are presented. (Author/LRW)
FPGA Implementation of Metastability-Based True Random Number Generator
NASA Astrophysics Data System (ADS)
Hata, Hisashi; Ichikawa, Shuichi
True random number generators (TRNGs) are important as a basis for computer security. Though there are some TRNGs composed of analog circuit, the use of digital circuits is desired for the application of TRNGs to logic LSIs. Some of the digital TRNGs utilize jitter in free-running ring oscillators as a source of entropy, which consume large power. Another type of TRNG exploits the metastability of a latch to generate entropy. Although this kind of TRNG has been mostly implemented with full-custom LSI technology, this study presents an implementation based on common FPGA technology. Our TRNG is comprised of logic gates only, and can be integrated in any kind of logic LSI. The RS latch in our TRNG is implemented as a hard-macro to guarantee the quality of randomness by minimizing the signal skew and load imbalance of internal nodes. To improve the quality and throughput, the output of 64-256 latches are XOR'ed. The derived design was verified on a Xilinx Virtex-4 FPGA (XC4VFX20), and passed NIST statistical test suite without post-processing. Our TRNG with 256 latches occupies 580 slices, while achieving 12.5Mbps throughput.
Maximization of Extractable Randomness in a Quantum Random-Number Generator
NASA Astrophysics Data System (ADS)
Haw, J. Y.; Assad, S. M.; Lance, A. M.; Ng, N. H. Y.; Sharma, V.; Lam, P. K.; Symul, T.
2015-05-01
The generation of random numbers via quantum processes is an efficient and reliable method to obtain true indeterministic random numbers that are of vital importance to cryptographic communication and large-scale computer modeling. However, in realistic scenarios, the raw output of a quantum random-number generator is inevitably tainted by classical technical noise. The integrity of the device can be compromised if this noise is tampered with or even controlled by some malicious party. To safeguard against this, we propose and experimentally demonstrate an approach that produces side-information-independent randomness that is quantified by min-entropy conditioned on this classical noise. We present a method for maximizing the conditional min entropy of the number sequence generated from a given quantum-to-classical-noise ratio. The detected photocurrent in our experiment is shown to have a real-time random-number generation rate of 14 (Mb i t /s )/MHz . The spectral response of the detection system shows the potential to deliver more than 70 Gbit /s of random numbers in our experimental setup.
Statistical evaluation of PACSTAT random number generation capabilities
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.
Manipulating attentional load in sequence learning through random number generation
Wierzchoń, Michał; Gaillard, Vinciane; Asanowicz, Dariusz; Cleeremans, Axel
2012-01-01
Implicit learning is often assumed to be an effortless process. However, some artificial grammar learning and sequence learning studies using dual tasks seem to suggest that attention is essential for implicit learning to occur. This discrepancy probably results from the specific type of secondary task that is used. Different secondary tasks may engage attentional resources differently and therefore may bias performance on the primary task in different ways. Here, we used a random number generation (RNG) task, which may allow for a closer monitoring of a participant’s engagement in a secondary task than the popular secondary task in sequence learning studies: tone counting (TC). In the first two experiments, we investigated the interference associated with performing RNG concurrently with a serial reaction time (SRT) task. In a third experiment, we compared the effects of RNG and TC. In all three experiments, we directly evaluated participants’ knowledge of the sequence with a subsequent sequence generation task. Sequence learning was consistently observed in all experiments, but was impaired under dual-task conditions. Most importantly, our data suggest that RNG is more demanding and impairs learning to a greater extent than TC. Nevertheless, we failed to observe effects of the secondary task in subsequent sequence generation. Our studies indicate that RNG is a promising task to explore the involvement of attention in the SRT task. PMID:22723816
Efficient Raman generation in a waveguide: A route to ultrafast quantum random number generation
England, D. G.; Bustard, P. J.; Moffatt, D. J.; Nunn, J.; Lausten, R.; Sussman, B. J.
2014-02-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.
Stipčević, Mario
2016-03-01
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. PMID:27036825
NASA Astrophysics Data System (ADS)
Stipčević, Mario
2016-03-01
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.
Efficient and robust quantum random number generation by photon number detection
Applegate, M. J.; Thomas, O.; Dynes, J. F.; Yuan, Z. L.; Shields, A. J.; Ritchie, D. A.
2015-08-17
We present an efficient and robust quantum random number generator based upon high-rate room temperature photon number detection. We employ an electric field-modulated silicon avalanche photodiode, a type of device particularly suited to high-rate photon number detection with excellent photon number resolution to detect, without an applied dead-time, up to 4 photons from the optical pulses emitted by a laser. By both measuring and modeling the response of the detector to the incident photons, we are able to determine the illumination conditions that achieve an optimal bit rate that we show is robust against variation in the photon flux. We extract random bits from the detected photon numbers with an efficiency of 99% corresponding to 1.97 bits per detected photon number yielding a bit rate of 143 Mbit/s, and verify that the extracted bits pass stringent statistical tests for randomness. Our scheme is highly scalable and has the potential of multi-Gbit/s bit rates.
Using Computer-Generated Random Numbers to Calculate the Lifetime of a Comet.
ERIC Educational Resources Information Center
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.…
Bias-free true random number generation using superconducting nanowire single-photon detectors
NASA Astrophysics Data System (ADS)
He, Yuhao; Zhang, Weijun; Zhou, Hui; You, Lixing; Lv, Chaolin; Zhang, Lu; Liu, Xiaoyu; Wu, Junjie; Chen, Sijing; Ren, Min; Wang, Zhen; Xie, Xiaoming
2016-08-01
We demonstrate a bias-free true random number generator (TRNG) based on single photon detection using superconducting nanowire single photon detectors (SNSPDs). By comparing the photon detection signals of two consecutive laser pulses and extracting the random bits by the von Neumann correction method, we achieved a random number generation efficiency of 25% (a generation rate of 3.75 Mbit s‑1 at a system clock rate of 15 MHz). Using a multi-channel superconducting nanowire single photon detector system with controllable pulse signal amplitudes, we detected the single photons with photon number resolution and positional sensitivity, which could further increase the random number generation efficiency. In a three-channel SNSPD system, the random number bit generation efficiency was improved to 75%, corresponding to a generation rate of 7.5 Mbit s‑1 with a 10 MHz system clock rate. All of the generated random numbers successfully passed the statistical test suite.
Multi-bit quantum random number generation by measuring positions of arrival photons
NASA Astrophysics Data System (ADS)
Yan, Qiurong; Zhao, Baosheng; Liao, Qinghong; Zhou, Nanrun
2014-10-01
We report upon the realization of a novel multi-bit optical quantum random number generator by continuously measuring the arrival positions of photon emitted from a LED using MCP-based WSA photon counting imaging detector. A spatial encoding method is proposed to extract multi-bits random number from the position coordinates of each detected photon. The randomness of bits sequence relies on the intrinsic randomness of the quantum physical processes of photonic emission and subsequent photoelectric conversion. A prototype has been built and the random bit generation rate could reach 8 Mbit/s, with random bit generation efficiency of 16 bits per detected photon. FPGA implementation of Huffman coding is proposed to reduce the bias of raw extracted random bits. The random numbers passed all tests for physical random number generator.
Multi-bit quantum random number generation by measuring positions of arrival photons.
Yan, Qiurong; Zhao, Baosheng; Liao, Qinghong; Zhou, Nanrun
2014-10-01
We report upon the realization of a novel multi-bit optical quantum random number generator by continuously measuring the arrival positions of photon emitted from a LED using MCP-based WSA photon counting imaging detector. A spatial encoding method is proposed to extract multi-bits random number from the position coordinates of each detected photon. The randomness of bits sequence relies on the intrinsic randomness of the quantum physical processes of photonic emission and subsequent photoelectric conversion. A prototype has been built and the random bit generation rate could reach 8 Mbit/s, with random bit generation efficiency of 16 bits per detected photon. FPGA implementation of Huffman coding is proposed to reduce the bias of raw extracted random bits. The random numbers passed all tests for physical random number generator. PMID:25362380
Multi-bit quantum random number generation by measuring positions of arrival photons
Yan, Qiurong; Zhao, Baosheng; Liao, Qinghong; Zhou, Nanrun
2014-10-15
We report upon the realization of a novel multi-bit optical quantum random number generator by continuously measuring the arrival positions of photon emitted from a LED using MCP-based WSA photon counting imaging detector. A spatial encoding method is proposed to extract multi-bits random number from the position coordinates of each detected photon. The randomness of bits sequence relies on the intrinsic randomness of the quantum physical processes of photonic emission and subsequent photoelectric conversion. A prototype has been built and the random bit generation rate could reach 8 Mbit/s, with random bit generation efficiency of 16 bits per detected photon. FPGA implementation of Huffman coding is proposed to reduce the bias of raw extracted random bits. The random numbers passed all tests for physical random number generator.
A generator for unique quantum random numbers based on vacuum states
NASA Astrophysics Data System (ADS)
Gabriel, Christian; Wittmann, Christoffer; Sych, Denis; Dong, Ruifang; Mauerer, Wolfgang; Andersen, Ulrik L.; Marquardt, Christoph; Leuchs, Gerd
2010-10-01
Random numbers are a valuable component in diverse applications that range from simulations over gambling to cryptography. The quest for true randomness in these applications has engendered a large variety of different proposals for producing random numbers based on the foundational unpredictability of quantum mechanics. However, most approaches do not consider that a potential adversary could have knowledge about the generated numbers, so the numbers are not verifiably random and unique. Here we present a simple experimental setup based on homodyne measurements that uses the purity of a continuous-variable quantum vacuum state to generate unique random numbers. We use the intrinsic randomness in measuring the quadratures of a mode in the lowest energy vacuum state, which cannot be correlated to any other state. The simplicity of our source, combined with its verifiably unique randomness, are important attributes for achieving high-reliability, high-speed and low-cost quantum random number generators.
Novel pseudo-random number generator based on quantum random walks
Yang, Yu-Guang; Zhao, Qian-Qian
2016-01-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. PMID:26842402
Novel pseudo-random number generator based on quantum random walks
NASA Astrophysics Data System (ADS)
Yang, Yu-Guang; Zhao, Qian-Qian
2016-02-01
In this paper, we investigate the potential application of quantum computation for constructing pseudo-random number generators (PRNGs) and further construct a novel PRNG based on quantum random walks (QRWs), a famous quantum computation model. The PRNG merely relies on the equations used in the QRWs, and thus the generation algorithm is simple and the computation speed is fast. The proposed PRNG is subjected to statistical tests such as NIST and successfully passed the test. Compared with the representative PRNG based on quantum chaotic maps (QCM), the present QRWs-based PRNG has some advantages such as better statistical complexity and recurrence. For example, the normalized Shannon entropy and the statistical complexity of the QRWs-based PRNG are 0.999699456771172 and 1.799961178212329e-04 respectively given the number of 8 bits-words, say, 16Mbits. By contrast, the corresponding values of the QCM-based PRNG are 0.999448131481064 and 3.701210794388818e-04 respectively. Thus the statistical complexity and the normalized entropy of the QRWs-based PRNG are closer to 0 and 1 respectively than those of the QCM-based PRNG when the number of words of the analyzed sequence increases. It provides a new clue to construct PRNGs and also extends the applications of quantum computation.
Novel pseudo-random number generator based on quantum random walks.
Yang, Yu-Guang; Zhao, Qian-Qian
2016-01-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. PMID:26842402
a Pseudo-Random Number Generator Employing Multiple RÉNYI Maps
NASA Astrophysics Data System (ADS)
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.
NASA Astrophysics Data System (ADS)
Lim, Daihyun; Ranasinghe, Damith C.; Devadas, Srinivas; Jamali, Behnam; Abbott, Derek; Cole, Peter H.
2005-05-01
While pseudo random number generators based on computational complexity are widely used for most of cryptographic applications and probabilistic simulations, the generation of true random numbers based on physical randomness is required to guarantee the advanced security of cryptographic systems. In this paper we present a method to exploit manufacturing variations, metastablity, and thermal noise in integrated circuits to generate random numbers. This metastability based physical random number generator provides a compact and low-power solution which can be fabricated using standard IC manufacturing processes. Test-chips were fabricated in TSMC 0.18um process and experimental results show that the generated random bits pass standard randomness tests successfully. The operation of the proposed scheme is robust against environmental changes since it can be re-calibrated to new environmental conditions such as temperature and power supply voltage.
Strenge, Hans; Müller-Deile, Joachim
2007-08-01
Oral random number generation is a widely used neuropsychological task engaging a number of overlapping neural systems of attention, number representation, response generation, and working memory. Although phonological processing is known to be essential for random number generation no information exists on the significance of the auditory feedback of hearing one's own voice on task performance. We therefore examined the influence of auditory feedback in 15 profoundly deaf adults with cochlear implants in a device-on/off experiment. No significant effects of occluding auditory feedback on random number generation were noted, thus supporting an internal response-monitoring model independent of auditory condition. PMID:17691037
Nie, You-Qi; Zhang, Jun Pan, Jian-Wei; Zhang, Hong-Fei; Wang, Jian; Zhang, Zhen; Ma, Xiongfeng
2014-02-03
We present a practical high-speed quantum random number generator, where the timing of single-photon detection relative to an external time reference is measured as the raw data. The bias of the raw data can be substantially reduced compared with the previous realizations. The raw random bit rate of our generator can reach 109 Mbps. We develop a model for the generator and evaluate the min-entropy of the raw data. Toeplitz matrix hashing is applied for randomness extraction, after which the final random bits are able to pass the standard randomness tests.
High-speed quantum-random number generation by continuous measurement of arrival time of photons
Yan, Qiurong; Zhao, Baosheng; Hua, Zhang; Liao, Qinghong; Yang, Hao
2015-07-15
We demonstrate a novel high speed and multi-bit optical quantum random number generator by continuously measuring arrival time of photons with a common starting point. To obtain the unbiased and post-processing free random bits, the measured photon arrival time is converted into the sum of integral multiple of a fixed period and a phase time. Theoretical and experimental results show that the phase time is an independent and uniform random variable. A random bit extraction method by encoding the phase time is proposed. An experimental setup has been built and the unbiased random bit generation rate could reach 128 Mb/s, with random bit generation efficiency of 8 bits per detected photon. The random numbers passed all tests in the statistical test suite.
High-speed quantum-random number generation by continuous measurement of arrival time of photons.
Yan, Qiurong; Zhao, Baosheng; Hua, Zhang; Liao, Qinghong; Yang, Hao
2015-07-01
We demonstrate a novel high speed and multi-bit optical quantum random number generator by continuously measuring arrival time of photons with a common starting point. To obtain the unbiased and post-processing free random bits, the measured photon arrival time is converted into the sum of integral multiple of a fixed period and a phase time. Theoretical and experimental results show that the phase time is an independent and uniform random variable. A random bit extraction method by encoding the phase time is proposed. An experimental setup has been built and the unbiased random bit generation rate could reach 128 Mb/s, with random bit generation efficiency of 8 bits per detected photon. The random numbers passed all tests in the statistical test suite. PMID:26233362
Truly random number generation based on measurement of phase noise of a laser.
Guo, Hong; Tang, Wenzhuo; Liu, Yu; Wei, Wei
2010-05-01
We present a simple approach to realize truly random number generator based on measuring the phase noise of a single-mode vertical cavity surface emitting laser. The true randomness of the quantum phase noise originates from the spontaneous emission of photons and the random bit generation rate is ultimately limited only by the laser linewidth. With the final bit generation rate of 20 Mbit/s, the truly random bit sequence guaranteed by the uncertainty principle of quantum mechanics passes the three standard randomness tests (ENT, Diehard, and NIST Statistical Test Suites). Moreover, a continuously generated random bit sequence, with length up to 14 Gbit, is verified by two additional criteria for its true randomness. PMID:20866215
A novel quantum random number generation algorithm used by smartphone camera
NASA Astrophysics Data System (ADS)
Wu, Nan; Wang, Kun; Hu, Haixing; Song, Fangmin; Li, Xiangdong
2015-05-01
We study an efficient algorithm to extract quantum random numbers (QRN) from the raw data obtained by charge-coupled device (CCD) or complementary metal-oxide semiconductor (CMOS) based sensors, like a camera used in a commercial smartphone. Based on NIST statistical test for random number generators, the proposed algorithm has a high QRN generation rate and high statistical randomness. This algorithm provides a kind of simple, low-priced and reliable devices as a QRN generator for quantum key distribution (QKD) or other cryptographic applications.
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. PMID:18712198
The generation of 68 Gbps quantum random number by measuring laser phase fluctuations.
Nie, You-Qi; Huang, Leilei; Liu, Yang; Payne, Frank; Zhang, Jun; Pan, Jian-Wei
2015-06-01
The speed of a quantum random number generator is essential for practical applications, such as high-speed quantum key distribution systems. Here, we push the speed of a quantum random number generator to 68 Gbps by operating a laser around its threshold level. To achieve the rate, not only high-speed photodetector and high sampling rate are needed but also a very stable interferometer is required. A practical interferometer with active feedback instead of common temperature control is developed to meet the requirement of stability. Phase fluctuations of the laser are measured by the interferometer with a photodetector and then digitalized to raw random numbers with a rate of 80 Gbps. The min-entropy of the raw data is evaluated by modeling the system and is used to quantify the quantum randomness of the raw data. The bias of the raw data caused by other signals, such as classical and detection noises, can be removed by Toeplitz-matrix hashing randomness extraction. The final random numbers can pass through the standard randomness tests. Our demonstration shows that high-speed quantum random number generators are ready for practical usage. PMID:26133826
The generation of 68 Gbps quantum random number by measuring laser phase fluctuations
Nie, You-Qi; Liu, Yang; Zhang, Jun Pan, Jian-Wei; Huang, Leilei; Payne, Frank
2015-06-15
The speed of a quantum random number generator is essential for practical applications, such as high-speed quantum key distribution systems. Here, we push the speed of a quantum random number generator to 68 Gbps by operating a laser around its threshold level. To achieve the rate, not only high-speed photodetector and high sampling rate are needed but also a very stable interferometer is required. A practical interferometer with active feedback instead of common temperature control is developed to meet the requirement of stability. Phase fluctuations of the laser are measured by the interferometer with a photodetector and then digitalized to raw random numbers with a rate of 80 Gbps. The min-entropy of the raw data is evaluated by modeling the system and is used to quantify the quantum randomness of the raw data. The bias of the raw data caused by other signals, such as classical and detection noises, can be removed by Toeplitz-matrix hashing randomness extraction. The final random numbers can pass through the standard randomness tests. Our demonstration shows that high-speed quantum random number generators are ready for practical usage.
Loss-tolerant measurement-device-independent quantum random number generation
NASA Astrophysics Data System (ADS)
Cao, Zhu; Zhou, Hongyi; Ma, Xiongfeng
2015-12-01
Quantum random number generators (QRNGs) output genuine random numbers based upon the uncertainty principle. A QRNG contains two parts in general—a randomness source and a readout detector. How to remove detector imperfections has been one of the most important questions in practical randomness generation. We propose a simple solution, measurement-device-independent QRNG, which not only removes all detector side channels but is robust against losses. In contrast to previous fully device-independent QRNGs, our scheme does not require high detector efficiency or nonlocality tests. Simulations show that our protocol can be implemented efficiently with a practical coherent state laser and other standard optical components. The security analysis of our QRNG consists mainly of two parts: measurement tomography and randomness quantification, where several new techniques are developed to characterize the randomness associated with a positive-operator valued measure.
Note: Fully integrated 3.2 Gbps quantum random number generator with real-time extraction
NASA Astrophysics Data System (ADS)
Zhang, Xiao-Guang; Nie, You-Qi; Zhou, Hongyi; Liang, Hao; Ma, Xiongfeng; Zhang, Jun; Pan, Jian-Wei
2016-07-01
We present a real-time and fully integrated quantum random number generator (QRNG) by measuring laser phase fluctuations. The QRNG scheme based on laser phase fluctuations is featured for its capability of generating ultra-high-speed random numbers. However, the speed bottleneck of a practical QRNG lies on the limited speed of randomness extraction. To close the gap between the fast randomness generation and the slow post-processing, we propose a pipeline extraction algorithm based on Toeplitz matrix hashing and implement it in a high-speed field-programmable gate array. Further, all the QRNG components are integrated into a module, including a compact and actively stabilized interferometer, high-speed data acquisition, and real-time data post-processing and transmission. The final generation rate of the QRNG module with real-time extraction can reach 3.2 Gbps.
Note: Fully integrated 3.2 Gbps quantum random number generator with real-time extraction.
Zhang, Xiao-Guang; Nie, You-Qi; Zhou, Hongyi; Liang, Hao; Ma, Xiongfeng; Zhang, Jun; Pan, Jian-Wei
2016-07-01
We present a real-time and fully integrated quantum random number generator (QRNG) by measuring laser phase fluctuations. The QRNG scheme based on laser phase fluctuations is featured for its capability of generating ultra-high-speed random numbers. However, the speed bottleneck of a practical QRNG lies on the limited speed of randomness extraction. To close the gap between the fast randomness generation and the slow post-processing, we propose a pipeline extraction algorithm based on Toeplitz matrix hashing and implement it in a high-speed field-programmable gate array. Further, all the QRNG components are integrated into a module, including a compact and actively stabilized interferometer, high-speed data acquisition, and real-time data post-processing and transmission. The final generation rate of the QRNG module with real-time extraction can reach 3.2 Gbps. PMID:27475609
Efficient pseudo-random number generation for monte-carlo simulations using graphic processors
NASA Astrophysics Data System (ADS)
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.
Scope of Various Random Number Generators in Ant System Approach for TSP
NASA Technical Reports Server (NTRS)
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 just to seek an answer to the controversial performance ranking of the generators in probabilistic/statically sense.
25 CFR 547.14 - What are the minimum technical standards for electronic random number generation?
Code of Federal Regulations, 2010 CFR
2010-04-01
... CLASS II GAMES § 547.14 What are the minimum technical standards for electronic random number generation... rules of the game. For example, if a bingo game with 75 objects with numbers or other designations has a... serial correlation (outcomes shall be independent from the previous game); and (x) Test on...
25 CFR 547.14 - What are the minimum technical standards for electronic random number generation?
Code of Federal Regulations, 2012 CFR
2012-04-01
... CLASS II GAMES § 547.14 What are the minimum technical standards for electronic random number generation... rules of the game. For example, if a bingo game with 75 objects with numbers or other designations has a... serial correlation (outcomes shall be independent from the previous game); and (x) Test on...
25 CFR 547.14 - What are the minimum technical standards for electronic random number generation?
Code of Federal Regulations, 2011 CFR
2011-04-01
... CLASS II GAMES § 547.14 What are the minimum technical standards for electronic random number generation... rules of the game. For example, if a bingo game with 75 objects with numbers or other designations has a... serial correlation (outcomes shall be independent from the previous game); and (x) Test on...
Robust random number generation using steady-state emission of gain-switched laser diodes
Yuan, Z. L. Lucamarini, M.; Dynes, J. F.; Fröhlich, B.; Plews, A.; Shields, A. J.
2014-06-30
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.
An efficient algorithm for generating random number pairs drawn from a bivariate normal distribution
NASA Technical Reports Server (NTRS)
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.
Cryptographic random number generators for low-power distributed measurement system
NASA Astrophysics Data System (ADS)
Czernik, Pawel; Olszyna, Jakub
2009-06-01
In this paper we present the State of The Art in Cryptographic Random Number Generators (RNG). We provide analysis of every of the most popular types of RNGs such as linear generators (i.e. congruential, multiple recursive), non-linear generators (i.e. Quadratic, Blum-Blum-Shub) and cryptographic algorithms based (i.e. RSA generator, SHA-1 generator). Finally we choose solutions which are suitable to Distributed Measurement Systems (DMS) specific requirements according to cryptographic security, computational efficiency (throughput) and complexity of implementation (VHDL targeted at FPGA and ASIC devices). Strong asymmetry of computing power and memory capacity is taken into account in both software and hardware solutions.
ERIC Educational Resources Information Center
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…
Geisseler, Olivia; Pflugshaupt, Tobias; Buchmann, Andreas; Bezzola, Ladina; Reuter, Katja; Schuknecht, Bernhard; Weller, David; Linnebank, Michael; Brugger, Peter
2016-09-01
Human subjects typically deviate systematically from randomness when attempting to produce a sequence of random numbers. Despite an increasing number of behavioral and functional neuroimaging studies on random number generation (RNG), its structural correlates have never been investigated. We set out to fill this gap in 44 patients with multiple sclerosis (MS), a disease whose impact on RNG has never been studied. The RNG task required the paced (1 Hz) generation of the numbers from 1 to 6 in a sequence as random as possible. The same task was administered in 39 matched healthy controls. To assess neuroanatomical correlates such as cortical thickness, lesion load and third ventricle width, all subjects underwent high-resolution structural MRI. Compared to controls, MS patients exhibited an enhanced tendency to arrange consecutive numbers in an ascending order ("forward counting"). Furthermore, patients showed a higher susceptibility to rule breaks (producing out-of-category digits like 7) and to skip beats of the metronome. Clinico-anatomical correlation analyses revealed two main findings: First, increased counting in MS patients was associated with higher cortical lesion load. Second, increased number of skipped beats was related to widespread cortical thinning. In conclusion, our test results illustrate a loss of behavioral complexity in the course of MS, while the imaging results suggest an association between this loss and cortical pathology. PMID:27403852
A robust random number generator based on differential comparison of chaotic laser signals.
Zhang, Jianzhong; Wang, Yuncai; Liu, Ming; Xue, Lugang; Li, Pu; Wang, Anbang; Zhang, Mingjiang
2012-03-26
We experimentally realize a robust real-time random number generator by differentially comparing the signal from a chaotic semiconductor laser and its delayed signal through a 1-bit analog-to-digital converter. The probability density distribution of the output chaotic signal based on the differential comparison method possesses an extremely small coefficient of Pearson's median skewness (1.5 × 10⁻⁶), which can yield a balanced random sequence much easily than the previously reported method that compares the signal from the chaotic laser with a certain threshold value. Moveover, we experimently demonstrate that our method can stably generate good random numbers at rates of 1.44 Gbit/s with excellent immunity from external perturbations while the previously reported method fails. PMID:22453429
Scope of Various Random Number Generators in ant System Approach for TSP
NASA Technical Reports Server (NTRS)
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."
Towse, John N.; Loetscher, Tobias; Brugger, Peter
2014-01-01
We investigate the number preferences of children and adults when generating random digit sequences. Previous research has shown convincingly that adults prefer smaller numbers when randomly choosing between responses 1–6. We analyze randomization choices made by both children and adults, considering a range of experimental studies and task configurations. Children – most of whom are between 8 and 11~years – show a preference for relatively large numbers when choosing numbers 1–10. Adults show a preference for small numbers with the same response set. We report a modest association between children’s age and numerical bias. However, children also exhibit a small number bias with a smaller response set available, and they show a preference specifically for the numbers 1–3 across many datasets. We argue that number space demonstrates both continuities (numbers 1–3 have a distinct status) and change (a developmentally emerging bias toward the left side of representational space or lower numbers). PMID:24478747
Attack on a Chaos-Based Random Number Generator Using Anticipating Synchronization
NASA Astrophysics Data System (ADS)
Yeniçeri, Ramazan; Kilinç, Selçuk; Yalçin, Müştak E.
Chaotic systems have been used in random number generation, owing to the property of sensitive dependence on initial conditions and hence the possibility to produce unpredictable signals. Within the types of chaotic systems, those which are defined by only one delay-differential equation are attractive due to their simple model. On the other hand, it is possible to synchronize to the future states of a time-delay chaotic system by anticipating synchronization. Therefore, random number generator (RNG), which employs such a system, might not be immune to the attacks. In this paper, attack on a chaos-based random number generator using anticipating synchronization is investigated. The considered time-delay chaotic system produces binary signals, which can directly be used as a source of RNG. Anticipating synchronization is obtained by incorporating other systems appropriately coupled to the original one. Quantification of synchronization is given by the bit error between the streams produced by the original and coupled systems. It is shown that the bit streams generated by the original system can be anticipated by the coupled systems beforehand.
Random Numbers and Quantum Computers
ERIC Educational Resources Information Center
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…
ERIC Educational Resources Information Center
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…
An On-Demand Optical Quantum Random Number Generator with In-Future Action and Ultra-Fast Response
Stipčević, Mario; Ursin, Rupert
2015-01-01
Random numbers are essential for our modern information based society e.g. in cryptography. Unlike frequently used pseudo-random generators, physical random number generators do not depend on complex algorithms but rather on a physicsal process to provide true randomness. Quantum random number generators (QRNG) do rely on a process, wich can be described by a probabilistic theory only, even in principle. Here we present a conceptualy 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. PMID:26057576
An On-Demand Optical Quantum Random Number Generator with In-Future Action and Ultra-Fast Response.
Stipčević, Mario; Ursin, Rupert
2015-01-01
Random numbers are essential for our modern information based society e.g. in cryptography. Unlike frequently used pseudo-random generators, physical random number generators do not depend on complex algorithms but rather on a physical process to provide true randomness. Quantum random number generators (QRNG) do rely on a process, which can be described by a probabilistic theory only, even in principle. Here we present a conceptually simple implementation, which offers a 100% efficiency of 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. PMID:26057576
Zhmurov, A; Rybnikov, K; Kholodov, Y; Barsegov, V
2011-05-12
The use of graphics processing units (GPUs) in simulation applications offers a significant speed gain as compared to computations on central processing units (CPUs). Many simulation methods require a large number of independent random variables generated at each step. We present two approaches for implementation of random number generators (RNGs) on a GPU. In the one-RNG-per-thread approach, one RNG produces a stream of random numbers in each thread of execution, whereas the one-RNG-for-all-threads method builds on the ability of different threads to communicate, thus, sharing random seeds across an entire GPU device. We used these approaches to implement Ran2, Hybrid Taus, and Lagged Fibonacci algorithms on a GPU. We profiled the performance of these generators in terms of the computational time, memory usage, and the speedup factor (CPU time/GPU time). These generators have been incorporated into the program for Langevin simulations of biomolecules fully implemented on the GPU. The ∼250-fold computational speedup on the GPU allowed us to carry out single-molecule dynamic force measurements in silico to explore the mechanical properties of the bacteriophage HK97 in the experimental subsecond time scale. We found that the nanomechanical response of HK97 depends on the conditions of force application, including the rate of change and geometry of the mechanical perturbation. Hence, using the GPU-based implementation of RNGs, presented here, in conjunction with Langevin simulations, makes it possible to directly compare the results of dynamic force measurements in vitro and in silico. PMID:21194190
Fast physical and pseudo random number generation based on a nonlinear optoelectronic oscillator
NASA Astrophysics Data System (ADS)
Mu, Penghua; Pan, Wei; Xiang, Shuiying; Li, Nianqiang; Liu, Xinkai; Zou, Xihua
2015-08-01
High speed random number generation (RNG) utilizing a nonlinear optoelectronic oscillator (OEO) is explored experimentally. It has been found that by simply adjusting either the injected optical power or the gain of the modulator driver, low complexity dynamics such as square wave, and more complex dynamics including fully developed chaos can be experimentally achieved. More importantly, physical RNG based on high-speed-oscilloscope measurements and pseudo RNG based on post-processing are implemented in this paper. The generated bit sequences pass all the standard statistical random tests, indicating that fast physical and pseudo RNG could be achieved based on the same OEO entropy source. Our results could provide further insight into the implementation of RNG based on chaotic optical systems.
Chaotic oscillation and random-number generation based on nanoscale optical-energy transfer
Naruse, Makoto; Kim, Song-Ju; Aono, Masashi; Hori, Hirokazu; Ohtsu, Motoichi
2014-01-01
By using nanoscale energy-transfer dynamics and density matrix formalism, we demonstrate theoretically and numerically that chaotic oscillation and random-number generation occur in a nanoscale system. The physical system consists of a pair of quantum dots (QDs), with one QD smaller than the other, between which energy transfers via optical near-field interactions. When the system is pumped by continuous-wave radiation and incorporates a timing delay between two energy transfers within the system, it emits optical pulses. We refer to such QD pairs as nano-optical pulsers (NOPs). Irradiating an NOP with external periodic optical pulses causes the oscillating frequency of the NOP to synchronize with the external stimulus. We find that chaotic oscillation occurs in the NOP population when they are connected by an external time delay. Moreover, by evaluating the time-domain signals by statistical-test suites, we confirm that the signals are sufficiently random to qualify the system as a random-number generator (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. PMID:25113239
40 CFR 761.308 - Sample selection by random number generation on any two-dimensional square grid.
Code of Federal Regulations, 2010 CFR
2010-07-01
... 40 Protection of Environment 30 2010-07-01 2010-07-01 false Sample selection by random number generation on any two-dimensional square grid. 761.308 Section 761.308 Protection of Environment... Â§ 761.79(b)(3) § 761.308 Sample selection by random number generation on any two-dimensional...
40 CFR 761.308 - Sample selection by random number generation on any two-dimensional square grid.
Code of Federal Regulations, 2011 CFR
2011-07-01
... 40 Protection of Environment 31 2011-07-01 2011-07-01 false Sample selection by random number generation on any two-dimensional square grid. 761.308 Section 761.308 Protection of Environment... Â§ 761.79(b)(3) § 761.308 Sample selection by random number generation on any two-dimensional...
40 CFR 761.308 - Sample selection by random number generation on any two-dimensional square grid.
Code of Federal Regulations, 2012 CFR
2012-07-01
... 40 Protection of Environment 32 2012-07-01 2012-07-01 false Sample selection by random number generation on any two-dimensional square grid. 761.308 Section 761.308 Protection of Environment... Â§ 761.79(b)(3) § 761.308 Sample selection by random number generation on any two-dimensional...
40 CFR 761.308 - Sample selection by random number generation on any two-dimensional square grid.
Code of Federal Regulations, 2013 CFR
2013-07-01
... 40 Protection of Environment 32 2013-07-01 2013-07-01 false Sample selection by random number generation on any two-dimensional square grid. 761.308 Section 761.308 Protection of Environment... Â§ 761.79(b)(3) § 761.308 Sample selection by random number generation on any two-dimensional...
40 CFR 761.308 - Sample selection by random number generation on any two-dimensional square grid.
Code of Federal Regulations, 2014 CFR
2014-07-01
... 40 Protection of Environment 31 2014-07-01 2014-07-01 false Sample selection by random number generation on any two-dimensional square grid. 761.308 Section 761.308 Protection of Environment... Â§ 761.79(b)(3) § 761.308 Sample selection by random number generation on any two-dimensional...
Capone, Fioravante; Capone, Gianluca; Ranieri, Federico; Di Pino, Giovanni; Oricchio, Gianluca; Di Lazzaro, Vincenzo
2014-10-01
Random number generation (RNG) is a procedurally-simple task related to specific executive functions, such as updating and monitoring of information and inhibition of automatic responses. The effect of practice on executive functions has been widely investigated, however little is known on the impact of practice on RNG. Transcranial direct current stimulation (tDCS) allows to modulate, non-invasively, brain activity and to enhance the effects of training on executive functions. Hence, this study aims to investigate the effect of practice on RNG and to explore the possibility to influence it by tDCS applied over dorsolateral prefrontal cortex. Twenty-six healthy volunteers have been evaluated within single session and between different sessions of RNG using several measures of randomness, which are informative of separable cognitive components servicing random behavior. We found that repetition measures significantly change within single session, seriation measures significantly change both within and between sessions, while cycling measures are not affected by practice. tDCS does not produce any additional effect, however a sub-analysis limited to the first session revealed an increasing trend in seriation measure after anodal compared to cathodal stimulation. Our findings support the hypothesis that practice selectively and consistently influences specific cognitive components related to random behavior, while tDCS transiently affects RNG performance. PMID:24811195
High-Order Photonic W-states for Random Number Generation
NASA Astrophysics Data System (ADS)
Graefe, Markus; Heilmann, Rene; Perez-Leija, Armando; Keil, Robert; Dreisow, Felix; Heinrich, Matthias; Nolte, Stefan; Christodoulides, Demetrios N.; Szameit, Alexander
2014-05-01
Multipartite entanglement plays a key role in a number of counter-intuitive phenomena in quantum me- chances. A particular type of multipartite entangled states are the so called W-states which are in generalized form a coherent superposition of N single qubit states exhibiting equal probability amplitudes. The entanglement carried by these quantum entities has the remarkable property of being intrinsically robust to decoherence in one of the qubits. In our work, we experimentally realize high order W-states by forcing single photons to exist in a uniform coherent superposition of N (up to 16) spatial optical modes within a multi-port integrated system. Interestingly, in the generated W-states, a single photon will emerge from any of the N output ports with exactly the same probability. Based on that fact we have additionally developed a scheme for the generation of genuine random bits on chip, without the need of any post-processig. The authenticity of the random numbers is validated by applying the fifteen statistical tests suggested by National Institute of Standard Technology.
Li, Dongfang; Lu, Zhaojun; Zou, Xuecheng; Liu, Zhenglin
2015-01-01
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. PMID:26501283
Li, Dongfang; Lu, Zhaojun; Zou, Xuecheng; Liu, Zhenglin
2015-01-01
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. PMID:26501283
NASA Astrophysics Data System (ADS)
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.
Random numbers from vacuum fluctuations
NASA Astrophysics Data System (ADS)
Shi, Yicheng; Chng, Brenda; Kurtsiefer, Christian
2016-07-01
We implement a quantum random number generator based on a balanced homodyne measurement of vacuum fluctuations of the electromagnetic field. The digitized signal is directly processed with a fast randomness extraction scheme based on a linear feedback shift register. The random bit stream is continuously read in a computer at a rate of about 480 Mbit/s and passes an extended test suite for random numbers.
Oomens, Wouter; Maes, Joseph H. R.; Hasselman, Fred; Egger, Jos I. M.
2015-01-01
The concept of executive functions plays a prominent role in contemporary experimental and clinical studies on cognition. One paradigm used in this framework is the random number generation (RNG) task, the execution of which demands aspects of executive functioning, specifically inhibition and working memory. Data from the RNG task are best seen as a series of successive events. However, traditional RNG measures that are used to quantify executive functioning are mostly summary statistics referring to deviations from mathematical randomness. In the current study, we explore the utility of recurrence quantification analysis (RQA), a non-linear method that keeps the entire sequence intact, as a better way to describe executive functioning compared to traditional measures. To this aim, 242 first- and second-year students completed a non-paced RNG task. Principal component analysis of their data showed that traditional and RQA measures convey more or less the same information. However, RQA measures do so more parsimoniously and have a better interpretation. PMID:26097449
Oomens, Wouter; Maes, Joseph H R; Hasselman, Fred; Egger, Jos I M
2015-01-01
The concept of executive functions plays a prominent role in contemporary experimental and clinical studies on cognition. One paradigm used in this framework is the random number generation (RNG) task, the execution of which demands aspects of executive functioning, specifically inhibition and working memory. Data from the RNG task are best seen as a series of successive events. However, traditional RNG measures that are used to quantify executive functioning are mostly summary statistics referring to deviations from mathematical randomness. In the current study, we explore the utility of recurrence quantification analysis (RQA), a non-linear method that keeps the entire sequence intact, as a better way to describe executive functioning compared to traditional measures. To this aim, 242 first- and second-year students completed a non-paced RNG task. Principal component analysis of their data showed that traditional and RQA measures convey more or less the same information. However, RQA measures do so more parsimoniously and have a better interpretation. PMID:26097449
Sexton, Nicholas J.; Cooper, Richard P.
2014-01-01
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 behavior (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. PMID:25071644
Pawlowski, Marcin Piotr; Jara, Antonio; Ogorzalek, Maciej
2015-01-01
Entropy in computer security is associated with the unpredictability of a source of randomness. The random source with high entropy tends to achieve a uniform distribution of random values. Random number generators are one of the most important building blocks of cryptosystems. In constrained devices of the Internet of Things ecosystem, high entropy random number generators are hard to achieve due to hardware limitations. For the purpose of the random number generation in constrained devices, this work proposes a solution based on the least-significant bits concatenation entropy harvesting method. As a potential source of entropy, on-board integrated sensors (i.e., temperature, humidity and two different light sensors) have been analyzed. Additionally, the costs (i.e., time and memory consumption) of the presented approach have been measured. The results obtained from the proposed method with statistical fine tuning achieved a Shannon entropy of around 7.9 bits per byte of data for temperature and humidity sensors. The results showed that sensor-based random number generators are a valuable source of entropy with very small RAM and Flash memory requirements for constrained devices of the Internet of Things. PMID:26506357
Pawlowski, Marcin Piotr; Jara, Antonio; Ogorzalek, Maciej
2015-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
Click, Timothy H.; Kaminski, George A.; Liu, Aibing B.
2010-01-01
We have simulated pure liquid butane, methanol and hydrated alanine polypeptide with the Monte Carlo technique using three kinds of random number generators - the standard Linear Congruential Generator (LCG), a modification of the LCG with additional randomization used in the BOSS software, and the “Mersenne Twister” generator by Matsumoto and Nishimura. While using the latter two random number generators leads to reasonably similar physical features, the LCG produces a significant different results. For the pure fluids, a noticeable expansion occurs. Using the original LCG on butane yields a molecular volume of 171.4 Å3 per molecule compared to ca. 163.6–163.9 Å3 for the other two generators, a deviation of about 5%. For methanol, the LCG produces an average volume of 86.3 Å3 per molecule, which is about 24% higher than the 68.8–70.2 Å3 obtained with the random number generator in BOSS and the generator by Matsumoto and Nishimura. In case of the hydrated tridecaalanine peptide, the volume and energy tend to be noticeably greater with the LCG than with the BOSS (modified LCG) random number generator. For the simulated hydrated extended conformation of tridecaalanine, the difference in volume reached ca. 87%. The uniformity and periodicity of the generators do not seem to play the crucial role in these phenomena. We conclude that it is important to test a random number generator by modeling a system such as the pure liquid methanol with a well-established force field before routinely employing it in Monte Carlo simulations. PMID:20734313
Three criteria for quantum random-number generators based on beam splitters
Svozil, Karl
2009-05-15
We propose three criteria for the generation of random digital strings from quantum beam splitters: (i) three or more mutually exclusive outcomes corresponding to the invocation of three- and higher-dimensional Hilbert spaces, (ii) the mandatory use of pure states in conjugated bases for preparation and detection, and (iii) the use of entangled singlet (unique) states for elimination of bias.
Generating Random Samples of a Given Size Using Social Security Numbers.
ERIC Educational Resources Information Center
Erickson, Richard C.; Brauchle, Paul E.
1984-01-01
The purposes of this article are (1) to present a method by which social security numbers may be used to draw cluster samples of a predetermined size and (2) to describe procedures used to validate this method of drawing random samples. (JOW)
A new technique for ultrafast physical random number generation using optical chaos
NASA Astrophysics Data System (ADS)
Elsonbaty, Amr; Hegazy, Salem F.; Obayya, Salah S. A.
2016-04-01
In this paper, we numerically demonstrate a new extraction scheme for generating ultra-fast physically random sequence of bits. For this purpose, we utilize a dual-channel optical chaos source with suppressed time delayed (TD) signature in both the intensity and the phase of its two channels. The proposed technique uses M 1-bit analog-to-digital converters (ADCs) to compare the level of the chaotic intensity signal at time t with its levels after incommensurable delay-interval Tm, where m = {1,2, … , M}. The binary output of each 1-bit ADC is then sampled by a positive-edge-triggered D flip flop. The clock sequence applied to the flip-flops is relatively delayed such that the rising edge of the clock triggering the m flip-flop precedes the rising edge of the clock of a subsequent m+1 flip-flop by a fixed period. The outputs of all flip flops are then combined by means of a parity-check logic. Numerical simulations are carried out using values of parameters at which TD signature is suppressed for chosen values of setup parameters. The 15 statistical tests in Special Publication 800-22 from NIST are applied to the generated random bits in order to examine the randomness quality of these bits for different values of M. The results show that all tests are passed from M = 1 to M = 39 at sampling rate up to 34.5 GHz which indicates that the maximum generation rate of random bits is 2.691 Tb/sec using a chaotic source of single VCSEL and without employing any pre-processing techniques.
Efficient Monte Carlo simulations using a shuffled nested Weyl sequence random number generator.
Tretiakov, K V; Wojciechowski, K W
1999-12-01
The pseudorandom number generator proposed recently by Holian et al. [B. L. Holian, O. E. Percus, T. T. Warnock, and P. A. Whitlock, Phys. Rev. E 50, 1607 (1994)] is tested via Monte Carlo computation of the free energy difference between the defectless hcp and fcc hard sphere crystals by the Frenkel-Ladd method [D. Frenkel and A. J. C. Ladd, J. Chem. Phys. 81, 3188 (1984)]. It is shown that this fast and convenient for parallel computing generator gives results in good agreement with results obtained by other generators. An estimate of high accuracy is obtained for the hcp-fcc free energy difference near melting. PMID:11970727
Koyama, Kento; Hokunan, Hidekazu; Hasegawa, Mayumi; Kawamura, Shuso; Koseki, Shigenobu
2016-12-01
We investigated a bacterial sample preparation procedure for single-cell studies. In the present study, we examined whether single bacterial cells obtained via 10-fold dilution followed a theoretical Poisson distribution. Four serotypes of Salmonella enterica, three serotypes of enterohaemorrhagic Escherichia coli and one serotype of Listeria monocytogenes were used as sample bacteria. An inoculum of each serotype was prepared via a 10-fold dilution series to obtain bacterial cell counts with mean values of one or two. To determine whether the experimentally obtained bacterial cell counts follow a theoretical Poisson distribution, a likelihood ratio test between the experimentally obtained cell counts and Poisson distribution which parameter estimated by maximum likelihood estimation (MLE) was conducted. The bacterial cell counts of each serotype sufficiently followed a Poisson distribution. Furthermore, to examine the validity of the parameters of Poisson distribution from experimentally obtained bacterial cell counts, we compared these with the parameters of a Poisson distribution that were estimated using random number generation via computer simulation. The Poisson distribution parameters experimentally obtained from bacterial cell counts were within the range of the parameters estimated using a computer simulation. These results demonstrate that the bacterial cell counts of each serotype obtained via 10-fold dilution followed a Poisson distribution. The fact that the frequency of bacterial cell counts follows a Poisson distribution at low number would be applied to some single-cell studies with a few bacterial cells. In particular, the procedure presented in this study enables us to develop an inactivation model at the single-cell level that can estimate the variability of survival bacterial numbers during the bacterial death process. PMID:27554145
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. PMID:19831087
Wang, Yonggang; Hui, Cong; Liu, Chong; Xu, Chao
2016-04-01
The contribution of this paper is proposing a new entropy extraction mechanism based on sampling phase jitter in ring oscillators to make a high throughput true random number generator in a field programmable gate array (FPGA) practical. Starting from experimental observation and analysis of the entropy source in FPGA, a multi-phase sampling method is exploited to harvest the clock jitter with a maximum entropy and fast sampling speed. This parametrized design is implemented in a Xilinx Artix-7 FPGA, where the carry chains in the FPGA are explored to realize the precise phase shifting. The generator circuit is simple and resource-saving, so that multiple generation channels can run in parallel to scale the output throughput for specific applications. The prototype integrates 64 circuit units in the FPGA to provide a total output throughput of 7.68 Gbps, which meets the requirement of current high-speed quantum key distribution systems. The randomness evaluation, as well as its robustness to ambient temperature, confirms that the new method in a purely digital fashion can provide high-speed high-quality random bit sequences for a variety of embedded applications. PMID:27131692
NASA Astrophysics Data System (ADS)
Wang, Yonggang; Hui, Cong; Liu, Chong; Xu, Chao
2016-04-01
The contribution of this paper is proposing a new entropy extraction mechanism based on sampling phase jitter in ring oscillators to make a high throughput true random number generator in a field programmable gate array (FPGA) practical. Starting from experimental observation and analysis of the entropy source in FPGA, a multi-phase sampling method is exploited to harvest the clock jitter with a maximum entropy and fast sampling speed. This parametrized design is implemented in a Xilinx Artix-7 FPGA, where the carry chains in the FPGA are explored to realize the precise phase shifting. The generator circuit is simple and resource-saving, so that multiple generation channels can run in parallel to scale the output throughput for specific applications. The prototype integrates 64 circuit units in the FPGA to provide a total output throughput of 7.68 Gbps, which meets the requirement of current high-speed quantum key distribution systems. The randomness evaluation, as well as its robustness to ambient temperature, confirms that the new method in a purely digital fashion can provide high-speed high-quality random bit sequences for a variety of embedded applications.
NASA Astrophysics Data System (ADS)
Liberty, Joshua W.
This dissertation uses the hierarchical q-state Potts model at the critical point to develop a new random number generator test. We start with an exposition of renormalization group approach by means of which one can numerically exactly compute the free energy, specific heat and susceptibility of large, but finite lattices. We then show that generalization of these standard techniques allows one to also compute probability distributions related to the energy and the order parameter. The various computed quantities can be compared with Monte Carlo estimates of the same quantities. We demonstrate that the structure of the hierarchical lattices used allows one to perform the Monte Carlo calculations by direct sampling. This avoids the usual critical slowing down that plagues Monte Carlo calculations at the critical point. As is well known, critical behavior is highly susceptible to perturbations. We expect that flaws of the pseudo random number generator, such as correlations, will cause statistically significant discrepancies between the results of the simulations and the numerically exactly computed results. Details of the computer code generated for these tests are included.
25 CFR 547.14 - What are the minimum technical standards for electronic random number generation?
Code of Federal Regulations, 2013 CFR
2013-04-01
... must not be feasible to predict future outputs of an RNG, even if the algorithm and the past sequence...) Scaling algorithms and scaled numbers. An RNG that provides output scaled to given ranges must: (1) Be... an unbiased algorithm. A scaling algorithm is considered to be unbiased if the measured bias is...
25 CFR 547.14 - What are the minimum technical standards for electronic random number generation?
Code of Federal Regulations, 2014 CFR
2014-04-01
... must not be feasible to predict future outputs of an RNG, even if the algorithm and the past sequence...) Scaling algorithms and scaled numbers. An RNG that provides output scaled to given ranges must: (1) Be... an unbiased algorithm. A scaling algorithm is considered to be unbiased if the measured bias is...
NASA Astrophysics Data System (ADS)
Czernik, Pawel
The chaotic signal generator based on the theory of nonlinear dynamical systems for applications in cryptographically secure distributed measurement and control systems with asymmetric resources is presented. This system was implemented on the basis of the physical chaotic electronic vibration generator in which the resonant circuit is composed of two capacitors, two resistors, coil and transistor, called the Colpitts oscillator. The presented system was designed, programmed and thoroughly tested in the term of cryptographic security in our laboratory, what there is the most important part of this publication. True cryptographic security was tested based on the author's software and the software environment called RDieHarder. The obtained results will be here presented and analyzed in detail with particular reference to the specificity of distributed measurement and control systems with asymmetric resources.
Investigating the Randomness of Numbers
ERIC Educational Resources Information Center
Pendleton, Kenn L.
2009-01-01
The use of random numbers is pervasive in today's world. Random numbers have practical applications in such far-flung arenas as computer simulations, cryptography, gambling, the legal system, statistical sampling, and even the war on terrorism. Evaluating the randomness of extremely large samples is a complex, intricate process. However, the…
Beem, Lance W.
2011-01-01
Abstract Background Reiki therapy is documented for relief of pain and stress. Energetic healing has been documented to alter biologic markers of illness such as hematocrit. True random number generators are reported to be affected by energy healers and spiritually oriented conscious awareness. Methods The patient was a then 54-year-old severely ill man who had hepatitis C types 1 and 2 and who did not improve with conventional therapy. He also suffered from obesity, the metabolic syndrome, asthma, and hypertension. He was treated with experimental high-dose interferon/riboviron therapy with resultant profound anemia and neutropenia. Energetic healing and Reiki therapy was administered initially to enhance the patient's sense of well-being and to relieve anxiety. Possible effects on the patient's absolute neutrophil count and hematocrit were incidentally noted. Reiki therapy was then initiated at times of profound neutropenia to assess its possible effect on the patient's absolute neutrophil count (ANC). Reiki and other energetic healing sessions were monitored with a true random number generator (RNG). Results Statistically significant relationships were documented between Reiki therapy, a quieting of the electronically created white noise of the RNG during healing sessions, and improvement in the patient's ANC. The immediate clinical result was that the patient could tolerate the high-dose interferon regimen without missing doses because of absolute neutropenia. The patient was initially a late responder to interferon and had been given a 5% chance of clearing the virus. He remains clear of the virus 1 year after treatment. Conclusions The association between changes in the RNG, Reiki therapy, and a patient's ANC is the first to the authors' knowledge in the medical literature. Future studies assessing the effects of energetic healing on specific biologic markers of disease are anticipated. Concurrent use of a true RNG may prove to correlate with the
Random numbers certified by Bell's theorem.
Pironio, S; Acín, A; Massar, S; de la Giroday, A Boyer; Matsukevich, D N; Maunz, P; Olmschenk, S; Hayes, D; Luo, L; Manning, T A; Monroe, C
2010-04-15
Randomness is a fundamental feature of nature and a valuable resource for applications ranging from cryptography and gambling to numerical simulation of physical and biological systems. Random numbers, however, are difficult to characterize mathematically, and their generation must rely on an unpredictable physical process. Inaccuracies in the theoretical modelling of such processes or failures of the devices, possibly due to adversarial attacks, limit the reliability of random number generators in ways that are difficult to control and detect. Here, inspired by earlier work on non-locality-based and device-independent quantum information processing, we show that the non-local correlations of entangled quantum particles can be used to certify the presence of genuine randomness. It is thereby possible to design a cryptographically secure random number generator that does not require any assumption about the internal working of the device. Such a strong form of randomness generation is impossible classically and possible in quantum systems only if certified by a Bell inequality violation. We carry out a proof-of-concept demonstration of this proposal in a system of two entangled atoms separated by approximately one metre. The observed Bell inequality violation, featuring near perfect detection efficiency, guarantees that 42 new random numbers are generated with 99 per cent confidence. Our results lay the groundwork for future device-independent quantum information experiments and for addressing fundamental issues raised by the intrinsic randomness of quantum theory. PMID:20393558
Random Numbers from a Delay Equation
NASA Astrophysics Data System (ADS)
Self, Julian; Mackey, Michael C.
2016-05-01
Delay differential equations can have "chaotic" solutions that can be used to mimic Brownian motion. Since a Brownian motion is random in its velocity, it is reasonable to think that a random number generator might be constructed from such a model. In this preliminary study, we consider one specific example of this and show that it satisfies criteria commonly employed in the testing of random number generators (from TestU01's very stringent "Big Crush" battery of tests). A technique termed digit discarding, commonly used in both this generator and physical RNGs using laser feedback systems, is discussed with regard to the maximal Lyapunov exponent. Also, we benchmark the generator to a contemporary common method: the multiple recursive generator, MRG32k3a. Although our method is about 7 times slower than MRG32k3a, there is in principle no apparent limit on the number of possible values that can be generated from the scheme we present here.
NASA Astrophysics Data System (ADS)
Barash, L. Yu.; Shchur, L. N.
2014-04-01
The library PRAND for pseudorandom number generation for modern CPUs and GPUs is presented. It contains both single-threaded and multi-threaded realizations of a number of modern and most reliable generators recently proposed and studied in Barash (2011), Matsumoto and Tishimura (1998), L'Ecuyer (1999,1999), Barash and Shchur (2006) and the efficient SIMD realizations proposed in Barash and Shchur (2011). One of the useful features for using PRAND in parallel simulations is the ability to initialize up to 1019 independent streams. Using massive parallelism of modern GPUs and SIMD parallelism of modern CPUs substantially improves performance of the generators.
True random numbers from amplified quantum vacuum.
Jofre, M; Curty, M; Steinlechner, F; Anzolin, G; Torres, J P; Mitchell, M W; Pruneri, V
2011-10-10
Random numbers are essential for applications ranging from secure communications to numerical simulation and quantitative finance. Algorithms can rapidly produce pseudo-random outcomes, series of numbers that mimic most properties of true random numbers while quantum random number generators (QRNGs) exploit intrinsic quantum randomness to produce true random numbers. Single-photon QRNGs are conceptually simple but produce few random bits per detection. In contrast, vacuum fluctuations are a vast resource for QRNGs: they are broad-band and thus can encode many random bits per second. Direct recording of vacuum fluctuations is possible, but requires shot-noise-limited detectors, at the cost of bandwidth. We demonstrate efficient conversion of vacuum fluctuations to true random bits using optical amplification of vacuum and interferometry. Using commercially-available optical components we demonstrate a QRNG at a bit rate of 1.11 Gbps. The proposed scheme has the potential to be extended to 10 Gbps and even up to 100 Gbps by taking advantage of high speed modulation sources and detectors for optical fiber telecommunication devices. PMID:21997077
ERIC Educational Resources Information Center
Rinehart, Nicole J.; Bradshaw, John L.; Moss, Simon A.; Brereton, Avril V.; Tonge, Bruce J.
2006-01-01
The repetitive, stereotyped and obsessive behaviours, which are core diagnostic features of autism, are thought to be underpinned by executive dysfunction. This study examined executive impairment in individuals with autism and Asperger's disorder using a verbal equivalent of an established pseudo-random number generating task. Different patterns…
NASA Technical Reports Server (NTRS)
Lindsey, R. S., Jr. (Inventor)
1975-01-01
An exemplary embodiment of the present invention provides a source of random width and random spaced rectangular voltage pulses whose mean or average frequency of operation is controllable within prescribed limits of about 10 hertz to 1 megahertz. A pair of thin-film metal resistors are used to provide a differential white noise voltage pulse source. Pulse shaping and amplification circuitry provide relatively short duration pulses of constant amplitude which are applied to anti-bounce logic circuitry to prevent ringing effects. The pulse outputs from the anti-bounce circuits are then used to control two one-shot multivibrators whose output comprises the random length and random spaced rectangular pulses. Means are provided for monitoring, calibrating and evaluating the relative randomness of the generator.
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
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
NASA Astrophysics Data System (ADS)
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.
ERIC Educational Resources Information Center
Griffiths, Martin
2011-01-01
One of the author's undergraduate students recently asked him whether it was possible to generate a random positive integer. After some thought, the author realised that there were plenty of interesting mathematical ideas inherent in her question. So much so in fact, that the author decided to organise a workshop, open both to undergraduates and…
Mohr, Christine; Koutrakis, Nikolaos; Kuhn, Gustav
2014-01-01
Magical ideation and belief in the paranormal is considered to represent a trait-like character; people either believe in it or not. Yet, anecdotes indicate that exposure to an anomalous event can turn skeptics into believers. This transformation is likely to be accompanied by altered cognitive functioning such as impaired judgments of event likelihood. Here, we investigated whether the exposure to an anomalous event changes individuals' explicit traditional (religious) and non-traditional (e.g., paranormal) beliefs as well as cognitive biases that have previously been associated with non-traditional beliefs, e.g., repetition avoidance when producing random numbers in a mental dice task. In a classroom, 91 students saw a magic demonstration after their psychology lecture. Before the demonstration, half of the students were told that the performance was done respectively by a conjuror (magician group) or a psychic (psychic group). The instruction influenced participants' explanations of the anomalous event. Participants in the magician, as compared to the psychic group, were more likely to explain the event through conjuring abilities while the reverse was true for psychic abilities. Moreover, these explanations correlated positively with their prior traditional and non-traditional beliefs. Finally, we observed that the psychic group showed more repetition avoidance than the magician group, and this effect remained the same regardless of whether assessed before or after the magic demonstration. We conclude that pre-existing beliefs and contextual suggestions both influence people's interpretations of anomalous events and associated cognitive biases. Beliefs and associated cognitive biases are likely flexible well into adulthood and change with actual life events. PMID:25653626
Mohr, Christine; Koutrakis, Nikolaos; Kuhn, Gustav
2015-01-01
Magical ideation and belief in the paranormal is considered to represent a trait-like character; people either believe in it or not. Yet, anecdotes indicate that exposure to an anomalous event can turn skeptics into believers. This transformation is likely to be accompanied by altered cognitive functioning such as impaired judgments of event likelihood. Here, we investigated whether the exposure to an anomalous event changes individuals’ explicit traditional (religious) and non-traditional (e.g., paranormal) beliefs as well as cognitive biases that have previously been associated with non-traditional beliefs, e.g., repetition avoidance when producing random numbers in a mental dice task. In a classroom, 91 students saw a magic demonstration after their psychology lecture. Before the demonstration, half of the students were told that the performance was done respectively by a conjuror (magician group) or a psychic (psychic group). The instruction influenced participants’ explanations of the anomalous event. Participants in the magician, as compared to the psychic group, were more likely to explain the event through conjuring abilities while the reverse was true for psychic abilities. Moreover, these explanations correlated positively with their prior traditional and non-traditional beliefs. Finally, we observed that the psychic group showed more repetition avoidance than the magician group, and this effect remained the same regardless of whether assessed before or after the magic demonstration. We conclude that pre-existing beliefs and contextual suggestions both influence people’s interpretations of anomalous events and associated cognitive biases. Beliefs and associated cognitive biases are likely flexible well into adulthood and change with actual life events. PMID:25653626
ERIC Educational Resources Information Center
Ben-Ari, Morechai
2004-01-01
The term "random" is frequently used in discussion of the theory of evolution, even though the mathematical concept of randomness is problematic and of little relevance in the theory. Therefore, since the core concept of the theory of evolution is the non-random process of natural selection, the term random should not be used in teaching the…
Random walks on the mental number line.
Shaki, Samuel; Fischer, Martin H
2014-01-01
The direction of influence between conceptual and motor activation, and its relevance for real-life activities, is still unclear. Here, we use the frequently reported association between small/large numbers and left/right space to investigate this issue during walking. We asked healthy adults to generate random numbers as they made lateral turns and found that (1) lateral turn decisions are predicted by the last few numbers generated prior to turning; (2) the intention to turn left/right makes small/large numbers more accessible; and (3) magnitude but not order of auditorily presented numbers influences the listener's turn selection. Our findings document a bidirectional influence between conceptual and motor activation and point to a hierarchically organized conceptual-motor activation. PMID:24091774
Autocorrelation peaks in congruential pseudorandom number generators
NASA Technical Reports Server (NTRS)
Neuman, F.; Merrick, R. B.
1976-01-01
The complete correlation structure of several congruential pseudorandom number generators (PRNG) of the same type and small cycle length was studied to deal with the problem of congruential PRNG almost repeating themselves at intervals smaller than their cycle lengths, during simulation of bandpass filtered normal random noise. Maximum period multiplicative and mixed congruential generators were studied, with inferences drawn from examination of several tractable members of a class of random number generators, and moduli from 2 to the 5th power to 2 to the 9th power. High correlation is shown to exist in mixed and multiplicative congruential random number generators and prime moduli Lehmer generators for shifts a fraction of their cycle length. The random noise sequences in question are required when simulating electrical noise, air turbulence, or time variation of wind parameters.
Can brains generate random numbers?
NASA Astrophysics Data System (ADS)
Chvátal, V.; Goldsmith, M.
2013-01-01
Motivated by EEG recordings of normal brain activity, we construct arbitrarily large McCulloch-Pitts neural networks that, without any external input, make every subset of their neurons fire in some iteration (and therefore in infinitely many iterations).
Security of practical private randomness generation
NASA Astrophysics Data System (ADS)
Pironio, Stefano; Massar, Serge
2013-01-01
Measurements on entangled quantum systems necessarily yield outcomes that are intrinsically unpredictable if they violate a Bell inequality. This property can be used to generate certified randomness in a device-independent way, i.e., without making detailed assumptions about the internal working of the quantum devices used to generate the random numbers. Furthermore these numbers are also private; i.e., they appear random not only to the user but also to any adversary that might possess a perfect description of the devices. Since this process requires a small initial random seed to sample the behavior of the quantum devices and to extract uniform randomness from the raw outputs of the devices, one usually speaks of device-independent randomness expansion. The purpose of this paper is twofold. First, we point out that in most real, practical situations, where the concept of device independence is used as a protection against unintentional flaws or failures of the quantum apparatuses, it is sufficient to show that the generated string is random with respect to an adversary that holds only classical side information; i.e., proving randomness against quantum side information is not necessary. Furthermore, the initial random seed does not need to be private with respect to the adversary, provided that it is generated in a way that is independent from the measured systems. The devices, however, will generate cryptographically secure randomness that cannot be predicted by the adversary, and thus one can, given access to free public randomness, talk about private randomness generation. The theoretical tools to quantify the generated randomness according to these criteria were already introduced in S. Pironio [Nature (London)NATUAS0028-083610.1038/nature09008 464, 1021 (2010)], but the final results were improperly formulated. The second aim of this paper is to correct this inaccurate formulation and therefore lay out a precise theoretical framework for practical device
Experimental Certification of Random Numbers via Quantum Contextuality
Um, Mark; Zhang, Xiang; Zhang, Junhua; Wang, Ye; Yangchao, Shen; Deng, D. -L; Duan, Lu-Ming; Kim, Kihwan
2013-01-01
The intrinsic unpredictability of measurements in quantum mechanics can be used to produce genuine randomness. Here, we demonstrate a random number generator where the randomness is certified by quantum contextuality in connection with the Kochen-Specker theorem. In particular, we generate random numbers from measurements on a single trapped ion with three internal levels, and certify the generated randomness by showing a bound on the minimum entropy through observation of violation of the Klyachko-Can-Binicioglu-Shumovsky (KCBS) inequality. Concerning the test of the KCBS inequality, we close the detection efficiency loophole for the first time and make it relatively immune to the compatibility loophole. In our experiment, we generate 1 × 105 random numbers that are guaranteed to have 5.2 × 104 bits of minimum entropy with a 99% confidence level. PMID:23568082
Experimental certification of random numbers via quantum contextuality.
Um, Mark; Zhang, Xiang; Zhang, Junhua; Wang, Ye; Yangchao, Shen; Deng, D-L; Duan, Lu-Ming; Kim, Kihwan
2013-01-01
The intrinsic unpredictability of measurements in quantum mechanics can be used to produce genuine randomness. Here, we demonstrate a random number generator where the randomness is certified by quantum contextuality in connection with the Kochen-Specker theorem. In particular, we generate random numbers from measurements on a single trapped ion with three internal levels, and certify the generated randomness by showing a bound on the minimum entropy through observation of violation of the Klyachko-Can-Binicioglu-Shumovsky (KCBS) inequality. Concerning the test of the KCBS inequality, we close the detection efficiency loophole for the first time and make it relatively immune to the compatibility loophole. In our experiment, we generate 1 × 10(5) random numbers that are guaranteed to have 5.2 × 10(4) bits of minimum entropy with a 99% confidence level. PMID:23568082
NASA Astrophysics Data System (ADS)
Tang, X.; Wu, Z. M.; Wu, J. G.; Deng, T.; Fan, L.; Zhong, Z. Q.; Chen, J. J.; Xia, G. Q.
2015-01-01
We propose and experimentally demonstrate a novel technique to generate multi-channel high-speed physical random numbers (PRNs) by taking two chaotic signal outputs from mutually coupled semiconductor lasers (MC-SLs) as entropy sources. First, through controlling the operation parameters of the MC-SL system, two time-delay signature (TDS) suppressed chaotic signals can be obtained. Next, each of these two chaotic signals is sampled by an 8 bit analog-to-digital converter (ADC) with a sampling rate of 10 GHz, and then a bitwise exclusive-OR (XOR) operation on the corresponding bits in samples of the chaotic signal and its time delayed signal is implemented to obtain 8 bit XOR data. Furthermore, through selecting the five least significant bits (LSBs) of 8 bit XOR data to form 5 bit Boolean sequences, two sets of PRN streams with a rate up to 50 Gbits s-1 are generated and successfully pass the NIST statistical tests. Finally, merging these two sets of 50 Gbits s-1 PRN streams by an interleaving operation, another set of the 100 Gbits s-1 PRN stream, which meets all the quality criteria of NIST statistical tests, is also acquired.
Efficient generation of large random networks
NASA Astrophysics Data System (ADS)
Batagelj, Vladimir; Brandes, Ulrik
2005-03-01
Random networks are frequently generated, for example, to investigate the effects of model parameters on network properties or to test the performance of algorithms. Recent interest in the statistics of large-scale networks sparked a growing demand for network generators that can generate large numbers of large networks quickly. We here present simple and efficient algorithms to randomly generate networks according to the most commonly used models. Their running time and space requirement is linear in the size of the network generated, and they are easily implemented.
Physical tests for random numbers in simulations
Vattulainen, I.; Ala-Nissila, T.; Kankaala, K. , FIN-00014 University of Helsinki Department of Electrical Engineering, Tampere University of Technology, P.O. Box 692, FIN-3310, Tampere Center for Scientific Computing, P.O. Box 405, FIN-02101 Espoo )
1994-11-07
We propose three physical tests to measure correlations in random numbers used in Monte Carlo simulations. The first test uses autocorrelation times of certain physical quantities when the Ising model is simulated with the Wolff algorithm. The second test is based on random walks, and the third on blocks of [ital n] successive numbers. We apply the tests to show that recent errors in high precision Ising simulations using generalized feedback shift register algorithms are due to short range correlations in random number sequences.
Computer generation of random deviates.
Cormack, J; Shuter, B
1991-06-01
The need for random deviates arises in many scientific applications, such as the simulation of physical processes, numerical evaluation of complex mathematical formulae and the modeling of decision processes. 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. PMID:1747086
NASA Astrophysics Data System (ADS)
Taylor, Adam; Bennie, Peter; Guyon, Fredric; Cameron, Iain; Glanfield, James; Emam, Omar
2013-08-01
This paper describes a proposal for a space flight demonstration of a low power, compact Dynamically Reconfigurable Programmable Board (DRPB) based upon a minor evolution of the Astrium Janus payload for UKube 1. The Janus payload is one of a number of the payloads selected to be part of the first national UK-Cube satellite (UKube) [1] to be sponsored by the UK Space Agency. In the UKube configuration the demonstrator performs two experiments the first uses firmware to realise an Astrium patented cosmic random number generator for generating secure cryptographic keys while the second monitors the large high performance SRAM based FPGA for SEU and SEFI events allowing correlation with predicted upset rates. This experiment is called the Janus experiment after the two-faced roman god of beginnings and transitions, transitioning from clear text to encrypted and marking the beginning of flying advanced FPGA's on suitable missions.
Quasi-Random Sequence Generators.
Energy Science and Technology Software Center (ESTSC)
1994-03-01
Version 00 LPTAU generates quasi-random sequences. The sequences are uniformly distributed sets of L=2**30 points in the N-dimensional unit cube: I**N=[0,1]. The sequences are used as nodes for multidimensional integration, as searching points in global optimization, as trial points in multicriteria decision making, as quasi-random points for quasi Monte Carlo algorithms.
Fast generation of sparse random kernel graphs
Hagberg, Aric; Lemons, Nathan; Du, Wen -Bo
2015-09-10
The development of kernel-based inhomogeneous random graphs has provided models that are flexible enough to capture many observed characteristics of real networks, and that are also mathematically tractable. We specify a class of inhomogeneous random graph models, called random kernel graphs, that produces sparse graphs with tunable graph properties, and we develop an efficient generation algorithm to sample random instances from this model. As real-world networks are usually large, it is essential that the run-time of generation algorithms scales better than quadratically in the number of vertices n. We show that for many practical kernels our algorithm runs in timemore » at most ο(n(logn)²). As an example, we show how to generate samples of power-law degree distribution graphs with tunable assortativity.« less
Fast generation of sparse random kernel graphs
Hagberg, Aric; Lemons, Nathan; Du, Wen -Bo
2015-09-10
The development of kernel-based inhomogeneous random graphs has provided models that are flexible enough to capture many observed characteristics of real networks, and that are also mathematically tractable. We specify a class of inhomogeneous random graph models, called random kernel graphs, that produces sparse graphs with tunable graph properties, and we develop an efficient generation algorithm to sample random instances from this model. As real-world networks are usually large, it is essential that the run-time of generation algorithms scales better than quadratically in the number of vertices n. We show that for many practical kernels our algorithm runs in time at most ο(n(logn)²). As an example, we show how to generate samples of power-law degree distribution graphs with tunable assortativity.
Fast Generation of Sparse Random Kernel Graphs
2015-01-01
The development of kernel-based inhomogeneous random graphs has provided models that are flexible enough to capture many observed characteristics of real networks, and that are also mathematically tractable. We specify a class of inhomogeneous random graph models, called random kernel graphs, that produces sparse graphs with tunable graph properties, and we develop an efficient generation algorithm to sample random instances from this model. As real-world networks are usually large, it is essential that the run-time of generation algorithms scales better than quadratically in the number of vertices n. We show that for many practical kernels our algorithm runs in time at most 𝒪(n(logn)2). As a practical example we show how to generate samples of power-law degree distribution graphs with tunable assortativity. PMID:26356296
Security of Semi-Device-Independent Random Number Expansion Protocols
Li, Dan-Dan; Wen, Qiao-Yan; Wang, Yu-Kun; Zhou, Yu-Qian; Gao, Fei
2015-01-01
Semi-device-independent random number expansion (SDI-RNE) protocols require some truly random numbers to generate fresh ones, with making no assumptions on the internal working of quantum devices except for the dimension of the Hilbert space. The generated randomness is certified by non-classical correlation in the prepare-and-measure test. Until now, the analytical relations between the amount of the generated randomness and the degree of non-classical correlation, which are crucial for evaluating the security of SDI-RNE protocols, are not clear under both the ideal condition and the practical one. In the paper, first, we give the analytical relation between the above two factors under the ideal condition. As well, we derive the analytical relation under the practical conditions, where devices’ behavior is not independent and identical in each round and there exists deviation in estimating the non-classical behavior of devices. Furthermore, we choose a different randomness extractor (i.e., two-universal random function) and give the security proof. PMID:26503335
Security of Semi-Device-Independent Random Number Expansion Protocols.
Li, Dan-Dan; Wen, Qiao-Yan; Wang, Yu-Kun; Zhou, Yu-Qian; Gao, Fei
2015-01-01
Semi-device-independent random number expansion (SDI-RNE) protocols require some truly random numbers to generate fresh ones, with making no assumptions on the internal working of quantum devices except for the dimension of the Hilbert space. The generated randomness is certified by non-classical correlation in the prepare-and-measure test. Until now, the analytical relations between the amount of the generated randomness and the degree of non-classical correlation, which are crucial for evaluating the security of SDI-RNE protocols, are not clear under both the ideal condition and the practical one. In the paper, first, we give the analytical relation between the above two factors under the ideal condition. As well, we derive the analytical relation under the practical conditions, where devices' behavior is not independent and identical in each round and there exists deviation in estimating the non-classical behavior of devices. Furthermore, we choose a different randomness extractor (i.e., two-universal random function) and give the security proof. PMID:26503335
Entanglement generation of nearly random operators.
Weinstein, Yaakov S; Hellberg, C Stephen
2005-07-15
We study the entanglement generation of operators whose statistical properties approach those of random matrices but are restricted in some way. These include interpolating ensemble matrices, where the interval of the independent random parameters are restricted, pseudorandom operators, where there are far fewer random parameters than required for random matrices, and quantum chaotic evolution. Restricting randomness in different ways allows us to probe connections between entanglement and randomness. We comment on which properties affect entanglement generation and discuss ways of efficiently producing random states on a quantum computer. PMID:16090726
Physical Principle for Generation of Randomness
NASA Technical Reports Server (NTRS)
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.)
Integrated-Circuit Pseudorandom-Number Generator
NASA Technical Reports Server (NTRS)
Steelman, James E.; Beasley, Jeff; Aragon, Michael; Ramirez, Francisco; Summers, Kenneth L.; Knoebel, Arthur
1992-01-01
Integrated circuit produces 8-bit pseudorandom numbers from specified probability distribution, at rate of 10 MHz. Use of Boolean logic, circuit implements pseudorandom-number-generating algorithm. Circuit includes eight 12-bit pseudorandom-number generators, outputs are uniformly distributed. 8-bit pseudorandom numbers satisfying specified nonuniform probability distribution are generated by processing uniformly distributed outputs of eight 12-bit pseudorandom-number generators through "pipeline" of D flip-flops, comparators, and memories implementing conditional probabilities on zeros and ones.
The correlation structure of several popular pseudorandom number generators
NASA Technical Reports Server (NTRS)
Neuman, F.; Merrick, R.; Martin, C. F.
1973-01-01
One of the desirable properties of a pseudorandom number generator is that the sequence of numbers it generates should have very low autocorrelation for all shifts except for zero shift and those that are multiples of its cycle length. Due to the simple methods of constructing random numbers, the ideal is often not quite fulfilled. A simple method of examining any random generator for previously unsuspected regularities is discussed. Once they are discovered it is often easy to derive the mathematical relationships, which describe the mathematical relationships, which describe the regular behavior. As examples, it is shown that high correlation exists in mixed and multiplicative congruential random number generators and prime moduli Lehmer generators for shifts a fraction of their cycle lengths.
Computer routines for probability distributions, random numbers, and related functions
Kirby, W.
1983-01-01
Use of previously coded and tested subroutines simplifies and speeds up program development and testing. This report presents routines that can be used to calculate various probability distributions and other functions of importance in statistical hydrology. The routines are designed as general-purpose Fortran subroutines and functions to be called from user-written main progress. The probability distributions provided include the beta, chi-square, gamma, Gaussian (normal), Pearson Type III (tables and approximation), and Weibull. Also provided are the distributions of the Grubbs-Beck outlier test, Kolmogorov 's and Smirnov 's D, Student 's t, noncentral t (approximate), and Snedecor F. Other mathematical functions include the Bessel function, I sub o, gamma and log-gamma functions, error functions, and exponential integral. Auxiliary services include sorting and printer-plotting. Random number generators for uniform and normal numbers are provided and may be used with some of the above routines to generate numbers from other distributions. (USGS)
Computer routines for probability distributions, random numbers, and related functions
Kirby, W.H.
1980-01-01
Use of previously codes and tested subroutines simplifies and speeds up program development and testing. This report presents routines that can be used to calculate various probability distributions and other functions of importance in statistical hydrology. The routines are designed as general-purpose Fortran subroutines and functions to be called from user-written main programs. The probability distributions provided include the beta, chisquare, gamma, Gaussian (normal), Pearson Type III (tables and approximation), and Weibull. Also provided are the distributions of the Grubbs-Beck outlier test, Kolmogorov 's and Smirnov 's D, Student 's t, noncentral t (approximate), and Snedecor F tests. Other mathematical functions include the Bessel function I (subzero), gamma and log-gamma functions, error functions and exponential integral. Auxiliary services include sorting and printer plotting. Random number generators for uniform and normal numbers are provided and may be used with some of the above routines to generate numbers from other distributions. (USGS)
Configurable Cellular Automata for Pseudorandom Number Generation
NASA Astrophysics Data System (ADS)
Quieta, Marie Therese; Guan, Sheng-Uei
This paper proposes a generalized structure of cellular automata (CA) — the configurable cellular automata (CoCA). With selected properties from programmable CA (PCA) and controllable CA (CCA), a new approach to cellular automata is developed. In CoCA, the cells are dynamically reconfigured at run-time via a control CA. Reconfiguration of a cell simply means varying the properties of that cell with time. Some examples of properties to be reconfigured are rule selection, boundary condition, and radius. While the objective of this paper is to propose CoCA as a new CA method, the main focus is to design a CoCA that can function as a good pseudorandom number generator (PRNG). As a PRNG, CoCA can be a suitable candidate as it can pass 17 out of 18 Diehard tests with 31 cells. CoCA PRNG's performance based on Diehard test is considered superior over other CA PRNG works. Moreover, CoCA opens new rooms for research not only in the field of random number generation, but in modeling complex systems as well.
Random, but Uniform Please: Requirements for Synthetic Weather Generation
Technology Transfer Automated Retrieval System (TEKTRAN)
Synthetic weather generation models often rely on standard uniform random numbers (RN) to simulate stochastic aspects of weather. However, short sequences of RNs, needed to generate certain weather variables, are not necessarily uniformly distributed, as assumed by weather generation models, and may...
Which numbers do you have in mind? Number generation is influenced by reading direction.
Göbel, Silke M; Maier, Carolin A; Shaki, Samuel
2015-09-01
In Western participants, small numbers are associated with left and larger numbers with right space. A biological account proposes that brain asymmetries lead to these attentional asymmetries in number space. In contrast, a cultural account proposes that the direction of this association is shaped by reading direction. We explored whether number generation is influenced by reading direction in participants from a left-to-right (UK) and a right-to-left (Arab) reading culture. Participants generated numbers randomly while lying on their left and right side. The mean number generated by participants from a left-to-right reading culture was smaller when they lay on their left than on their right side, and the opposite was found for participants from a right-to-left reading culture. Asymmetries in number space observed in number generation are more compatible with a cultural than biological account. PMID:26224271
Generating functionals for quantum field theories with random potentials
NASA Astrophysics Data System (ADS)
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.
On grey levels in random CAPTCHA generation
NASA Astrophysics Data System (ADS)
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.
Recycling random numbers in the stochastic simulation algorithm.
Yates, Christian A; Klingbeil, Guido
2013-03-01
The stochastic simulation algorithm (SSA) was introduced by Gillespie and in a different form by Kurtz. Since its original formulation there have been several attempts at improving the efficiency and hence the speed of the algorithm. We briefly discuss some of these methods before outlining our own simple improvement, the recycling direct method (RDM), and demonstrating that it is capable of increasing the speed of most stochastic simulations. The RDM involves the statistically acceptable recycling of random numbers in order to reduce the computational cost associated with their generation and is compatible with several of the pre-existing improvements on the original SSA. Our improvement is also sufficiently simple (one additional line of code) that we hope will be adopted by both trained mathematical modelers and experimentalists wishing to simulate their model systems. PMID:23485273
Random generation of structured linear optimization problems
Arthur, J.; Frendewey, J. Jr.
1994-12-31
We describe the on-going development of a random generator for linear optimization problems (LPs) founded on the concept of block structure. The general LP: minimize z = cx subject to Ax = b, x {ge} 0 can take a variety of special forms determined (primarily) by predefined structures on the matrix A of constraint coefficients. The authors have developed several random problem generators which provide instances of LPs having such structure; in particular (i) general (non-structured) problems, (ii) generalized upper bound (GUB) constraints, (iii) minimum cost network flow problems, (iv) transportation and assignment problems, (v) shortest path problems, (vi) generalized network flow problems, and (vii) multicommodity network flow problems. This paper discusses the general philosophy behind the construction of these generators. In addition, the task of combining the generators into a single generator -- in which the matrix A can contain various blocks, each of a prescribed structure from those mentioned above -- is described.
Code System to Generate Latin Hypercube and Random Samples.
IMAN, RONALD L.
1999-02-25
Version: 00 LHS was written for the generation of multi variate samples either completely at random or by a constrained randomization termed Latin hypercube sampling (LHS). The generation of these samples is based on user-specified parameters which dictate the characteristics of the generated samples, such as type of sample (LHS or random), sample size, number of samples desired, correlation structure on input variables, and type of distribution specified on each variable. The following distributions are built into the program: normal, lognormal, uniform, loguniform, triangular, and beta. In addition, the samples from the uniform and loguniform distributions may be modified by changing the frequency of the sampling within subintervals, and a subroutine which can be modified by the user to generate samples from other distributions (including empirical data) is provided.
Code System to Generate Latin Hypercube and Random Samples.
Energy Science and Technology Software Center (ESTSC)
1999-02-25
Version: 00 LHS was written for the generation of multi variate samples either completely at random or by a constrained randomization termed Latin hypercube sampling (LHS). The generation of these samples is based on user-specified parameters which dictate the characteristics of the generated samples, such as type of sample (LHS or random), sample size, number of samples desired, correlation structure on input variables, and type of distribution specified on each variable. The following distributions aremore » built into the program: normal, lognormal, uniform, loguniform, triangular, and beta. In addition, the samples from the uniform and loguniform distributions may be modified by changing the frequency of the sampling within subintervals, and a subroutine which can be modified by the user to generate samples from other distributions (including empirical data) is provided.« less
Saturation of number variance in embedded random-matrix ensembles
NASA Astrophysics Data System (ADS)
Prakash, Ravi; Pandey, Akhilesh
2016-05-01
We study fluctuation properties of embedded random matrix ensembles of noninteracting particles. For ensemble of two noninteracting particle systems, we find that unlike the spectra of classical random matrices, correlation functions are nonstationary. In the locally stationary region of spectra, we study the number variance and the spacing distributions. The spacing distributions follow the Poisson statistics, which is a key behavior of uncorrelated spectra. The number variance varies linearly as in the Poisson case for short correlation lengths but a kind of regularization occurs for large correlation lengths, and the number variance approaches saturation values. These results are known in the study of integrable systems but are being demonstrated for the first time in random matrix theory. We conjecture that the interacting particle cases, which exhibit the characteristics of classical random matrices for short correlation lengths, will also show saturation effects for large correlation lengths.
Building Kindergartners' Number Sense: A Randomized Controlled Study
ERIC Educational Resources Information Center
Jordan, Nancy C.; Glutting, Joseph; Dyson, Nancy; Hassinger-Das, Brenna; Irwin, Casey
2012-01-01
Math achievement in elementary school is mediated by performance and growth in number sense during kindergarten. The aim of the present study was to test the effectiveness of a targeted small-group number sense intervention for high-risk kindergartners from low-income communities. Children were randomly assigned to 1 of 3 groups (n = 44 in each…
Quantum random bit generation using stimulated Raman scattering.
Bustard, Philip J; Moffatt, Doug; Lausten, Rune; Wu, Guorong; Walmsley, Ian A; Sussman, Benjamin J
2011-12-01
Random number sequences are a critical resource in a wide variety of information systems, including applications in cryptography, simulation, and data sampling. We introduce a quantum random number generator based on the phase measurement of Stokes light generated by amplification of zero-point vacuum fluctuations using stimulated Raman scattering. This is an example of quantum noise amplification using the most noise-free process possible: near unitary quantum evolution. The use of phase offers robustness to classical pump noise and the ability to generate multiple bits per measurement. The Stokes light is generated with high intensity and as a result, fast detectors with high signal-to-noise ratios can be used for measurement, eliminating the need for single-photon sensitive devices. The demonstrated implementation uses optical phonons in bulk diamond. PMID:22273908
The Generation of Random Equilateral Polygons
NASA Astrophysics Data System (ADS)
Alvarado, Sotero; Calvo, Jorge Alberto; Millett, Kenneth C.
2011-04-01
Freely jointed random equilateral polygons serve as a common model for polymer rings, reflecting their statistical properties under theta conditions. To generate equilateral polygons, researchers employ many procedures that have been proved, or at least are believed, to be random with respect to the natural measure on the space of polygonal knots. As a result, the random selection of equilateral polygons, as well as the statistical robustness of this selection, is of particular interest. In this research, we study the key features of four popular methods: the Polygonal Folding, the Crankshaft Rotation, the Hedgehog, and the Triangle Methods. In particular, we compare the implementation and efficacy of these procedures, especially in regards to the population distribution of polygons in the space of polygonal knots, the distribution of edge vectors, the local curvature, and the local torsion. In addition, we give a rigorous proof that the Crankshaft Rotation Method is ergodic.
Uniqueness: skews bit occurrence frequencies in randomly generated fingerprint libraries.
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. PMID:27230477
Efficient biased random bit generation for parallel processing
Slone, D.M.
1994-09-28
A lattice gas automaton was implemented on a massively parallel machine (the BBN TC2000) and a vector supercomputer (the CRAY C90). The automaton models Burgers equation {rho}t + {rho}{rho}{sub x} = {nu}{rho}{sub xx} in 1 dimension. The lattice gas evolves by advecting and colliding pseudo-particles on a 1-dimensional, periodic grid. The specific rules for colliding particles are stochastic in nature and require the generation of many billions of random numbers to create the random bits necessary for the lattice gas. The goal of the thesis was to speed up the process of generating the random bits and thereby lessen the computational bottleneck of the automaton.
EPCGen2 Pseudorandom Number Generators: Analysis of J3Gen
Peinado, Alberto; Munilla, Jorge; Fúster-Sabater, Amparo
2014-01-01
This paper analyzes the cryptographic security of J3Gen, a promising pseudo random number generator for low-cost passive Radio Frequency Identification (RFID) tags. Although J3Gen has been shown to fulfill the randomness criteria set by the EPCglobal Gen2 standard and is intended for security applications, we describe here two cryptanalytic attacks that question its security claims: (i) a probabilistic attack based on solving linear equation systems; and (ii) a deterministic attack based on the decimation of the output sequence. Numerical results, supported by simulations, show that for the specific recommended values of the configurable parameters, a low number of intercepted output bits are enough to break J3Gen. We then make some recommendations that address these issues. PMID:24721767
Building Kindergartners’ Number Sense: A Randomized Controlled Study
Jordan, Nancy C.; Glutting, Joseph; Dyson, Nancy; Hassinger-Das, Brenna; Irwin, Casey
2015-01-01
Math achievement in elementary school is mediated by performance and growth in number sense during kindergarten. The aim of the present study was to test the effectiveness of a targeted small group number sense intervention for high-risk kindergartners from low-income communities. Children were randomly assigned to one of three groups (n = 44 in each group): a number sense intervention group, a language intervention group, or a business as usual control group. Accounting for initial skill level in mathematical knowledge, children who received the number sense intervention performed better than controls at immediate post test, with meaningful effects on measures of number competencies and general math achievement. Many of the effects held eight weeks after the intervention was completed, suggesting that children internalized what they had learned. There were no differences between the language and control groups on any math-related measures. PMID:25866417
At least some errors are randomly generated (Freud was wrong)
NASA Technical Reports Server (NTRS)
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.
Number of cliques in random scale-free network ensembles
NASA Astrophysics Data System (ADS)
Bianconi, Ginestra; Marsili, Matteo
2006-12-01
In this paper we calculate the average number of cliques in random scale-free networks in the limit of large network size N≫1. We consider first the hidden variable ensemble and subsequently the Molloy Reed ensemble. In both cases we find that cliques, i.e. fully connected subgraphs, appear also when the average degree is finite. This is in contrast to what happens in Erdös and Renyi graphs in which diverging average degree is required to observe cliques of size c>3. Moreover we show that in random scale-free networks the clique number, i.e. the size of the largest clique present in the network, diverges with the system size.
The random walk of a low-Reynolds-number swimmer
NASA Astrophysics Data System (ADS)
Rafaï, Salima; Garcia, Michaël; Berti, Stefano; Peyla, Philippe
2010-11-01
Swimming at a micrometer scale demands particular strategies. Indeed when inertia is negligible as compared to viscous forces (i.e. Reynolds number Re is lower than unity), hydrodynamics equations are reversible in time. To achieve propulsion a low Reynolds number, swimmers must then deform in a way that is not invariant under time reversal. Here we investigate the dispersal properties of self propelled organisms by means of microscopy and cell tracking. Our system of interest is the microalga Chlamydomonas Reinhardtii, a motile single celled green alga about 10 micrometers in diameter that swims with two flagellae. In the case of dilute suspensions, we show that tracked trajectories are well modelled by a correlated random walk. This process is based on short time correlations in the direction of movement called persistence. At longer times, correlations are lost and a standard random walk caracterizes the trajectories. Moreover, high speed imaging enables us to show how speed fluctuations at very short times affect the statistical description of the dynamics. Finally we show how drag forces modify the characteristics of this particular random walk.
Multistability, chaos, and random signal generation in semiconductor superlattices.
Ying, Lei; Huang, Danhong; Lai, Ying-Cheng
2016-06-01
Historically, semiconductor superlattices, artificial periodic structures of different semiconductor materials, were invented with the purpose of engineering or manipulating the electronic properties of semiconductor devices. A key application lies in generating radiation sources, amplifiers, and detectors in the "unusual" spectral range of subterahertz and terahertz (0.1-10 THz), which cannot be readily realized using conventional radiation sources, the so-called THz gap. Efforts in the past three decades have demonstrated various nonlinear dynamical behaviors including chaos, suggesting the potential to exploit chaos in semiconductor superlattices as random signal sources (e.g., random number generators) in the THz frequency range. We consider a realistic model of hot electrons in semiconductor superlattice, taking into account the induced space charge field. Through a systematic exploration of the phase space we find that, when the system is subject to an external electrical driving of a single frequency, chaos is typically associated with the occurrence of multistability. That is, for a given parameter setting, while there are initial conditions that lead to chaotic trajectories, simultaneously there are other initial conditions that lead to regular motions. Transition to multistability, i.e., the emergence of multistability with chaos as a system parameter passes through a critical point, is found and argued to be abrupt. Multistability thus presents an obstacle to utilizing the superlattice system as a reliable and robust random signal source. However, we demonstrate that, when an additional driving field of incommensurate frequency is applied, multistability can be eliminated, with chaos representing the only possible asymptotic behavior of the system. In such a case, a random initial condition will lead to a trajectory landing in a chaotic attractor with probability 1, making quasiperiodically driven semiconductor superlattices potentially as a reliable
Multistability, chaos, and random signal generation in semiconductor superlattices
NASA Astrophysics Data System (ADS)
Ying, Lei; Huang, Danhong; Lai, Ying-Cheng
2016-06-01
Historically, semiconductor superlattices, artificial periodic structures of different semiconductor materials, were invented with the purpose of engineering or manipulating the electronic properties of semiconductor devices. A key application lies in generating radiation sources, amplifiers, and detectors in the "unusual" spectral range of subterahertz and terahertz (0.1-10 THz), which cannot be readily realized using conventional radiation sources, the so-called THz gap. Efforts in the past three decades have demonstrated various nonlinear dynamical behaviors including chaos, suggesting the potential to exploit chaos in semiconductor superlattices as random signal sources (e.g., random number generators) in the THz frequency range. We consider a realistic model of hot electrons in semiconductor superlattice, taking into account the induced space charge field. Through a systematic exploration of the phase space we find that, when the system is subject to an external electrical driving of a single frequency, chaos is typically associated with the occurrence of multistability. That is, for a given parameter setting, while there are initial conditions that lead to chaotic trajectories, simultaneously there are other initial conditions that lead to regular motions. Transition to multistability, i.e., the emergence of multistability with chaos as a system parameter passes through a critical point, is found and argued to be abrupt. Multistability thus presents an obstacle to utilizing the superlattice system as a reliable and robust random signal source. However, we demonstrate that, when an additional driving field of incommensurate frequency is applied, multistability can be eliminated, with chaos representing the only possible asymptotic behavior of the system. In such a case, a random initial condition will lead to a trajectory landing in a chaotic attractor with probability 1, making quasiperiodically driven semiconductor superlattices potentially as a reliable
A Computer Program for Generating Sequences of Primary Arithmetic Facts in Random Order.
ERIC Educational Resources Information Center
Burns, Edward
A computer program which generates randomly sequenced problems for testing the abilities of students to add, subtract, and multiply one-digit numbers is described. Appendices provide tables of random sequences with directions for using the tables. The 54-statement FORTRAN program which can be used in generating additional sequences is also…
Number of distinct sites visited by N random walkers
NASA Astrophysics Data System (ADS)
Larralde, Hernan; Trunfio, Paul; Havlin, Shlomo; Stanley, H. Eugene; Weiss, George H.
1992-05-01
We study the number of distinct sites visited by N random walkers after t steps SN(t) under the condition that all the walkers are initially at the origin. We derive asymptotic expressions for the mean number of distinct sites
49 CFR 229.105 - Steam generator number.
Code of Federal Regulations, 2011 CFR
2011-10-01
... 49 Transportation 4 2011-10-01 2011-10-01 false Steam generator number. 229.105 Section 229.105..., DEPARTMENT OF TRANSPORTATION RAILROAD LOCOMOTIVE SAFETY STANDARDS Safety Requirements Steam Generators § 229.105 Steam generator number. An identification number shall be marked on the steam...
49 CFR 229.105 - Steam generator number.
Code of Federal Regulations, 2012 CFR
2012-10-01
... 49 Transportation 4 2012-10-01 2012-10-01 false Steam generator number. 229.105 Section 229.105..., DEPARTMENT OF TRANSPORTATION RAILROAD LOCOMOTIVE SAFETY STANDARDS Safety Requirements Steam Generators § 229.105 Steam generator number. An identification number shall be marked on the steam...
49 CFR 229.105 - Steam generator number.
Code of Federal Regulations, 2010 CFR
2010-10-01
... 49 Transportation 4 2010-10-01 2010-10-01 false Steam generator number. 229.105 Section 229.105..., DEPARTMENT OF TRANSPORTATION RAILROAD LOCOMOTIVE SAFETY STANDARDS Safety Requirements Steam Generators § 229.105 Steam generator number. An identification number shall be marked on the steam...
49 CFR 229.105 - Steam generator number.
Code of Federal Regulations, 2013 CFR
2013-10-01
... 49 Transportation 4 2013-10-01 2013-10-01 false Steam generator number. 229.105 Section 229.105..., DEPARTMENT OF TRANSPORTATION RAILROAD LOCOMOTIVE SAFETY STANDARDS Safety Requirements Steam Generators § 229.105 Steam generator number. An identification number shall be marked on the steam...
49 CFR 229.105 - Steam generator number.
Code of Federal Regulations, 2014 CFR
2014-10-01
... 49 Transportation 4 2014-10-01 2014-10-01 false Steam generator number. 229.105 Section 229.105..., DEPARTMENT OF TRANSPORTATION RAILROAD LOCOMOTIVE SAFETY STANDARDS Safety Requirements Steam Generators § 229.105 Steam generator number. An identification number shall be marked on the steam...
Generation of kth-order random toposequences
NASA Astrophysics Data System (ADS)
Odgers, Nathan P.; McBratney, Alex. B.; Minasny, Budiman
2008-05-01
The model presented in this paper derives toposequences from a digital elevation model (DEM). It is written in ArcInfo Macro Language (AML). The toposequences are called kth-order random toposequences, because they take a random path uphill to the top of a hill and downhill to a stream or valley bottom from a randomly selected seed point, and they are located in a streamshed of order k according to a particular stream-ordering system. We define a kth-order streamshed as the area of land that drains directly to a stream segment of stream order k. The model attempts to optimise the spatial configuration of a set of derived toposequences iteratively by using simulated annealing to maximise the total sum of distances between each toposequence hilltop in the set. The user is able to select the order, k, of the derived toposequences. Toposequences are useful for determining soil sampling locations for use in collecting soil data for digital soil mapping applications. Sampling locations can be allocated according to equal elevation or equal-distance intervals along the length of the toposequence, for example. We demonstrate the use of this model for a study area in the Hunter Valley of New South Wales, Australia. Of the 64 toposequences derived, 32 were first-order random toposequences according to Strahler's stream-ordering system, and 32 were second-order random toposequences. The model that we present in this paper is an efficient method for sampling soil along soil toposequences. The soils along a toposequence are related to each other by the topography they are found in, so soil data collected by this method is useful for establishing soil-landscape rules for the preparation of digital soil maps.
Truly random bit generation based on a novel random Brillouin fiber laser.
Xiang, Dao; Lu, Ping; Xu, Yanping; Gao, Song; Chen, Liang; Bao, Xiaoyi
2015-11-15
We propose a novel dual-emission random Brillouin fiber laser (RBFL) with bidirectional pumping operation. Numerical simulations and experimental verification of the chaotic temporal and statistical properties of the RBFL are conducted, revealing intrinsic unpredictable intensity fluctuations and two completely uncorrelated laser outputs. A random bit generator based on quantum noise sources in the random Fabry-Perot resonator of the RBFL is realized at a bit rate of 5 Mbps with verified randomness. PMID:26565888
RANDOM PULSE GENERATOR PRODUCING FIDUCIAL MARKS
Nielsen, W.F.
1960-02-01
The apparatus for automatically applying a fiducial marking, having a nonrepetitive pattern, to a plurality of simultaneously made records comprises, in series, a bypass filter, a trigger circuit, and a pulse generator, with printing means connected to and controlled by the pulse generator for simultaneously making the visible fiducial marks on a plurality of simultaneously produced records.
Image encryption using random sequence generated from generalized information domain
NASA Astrophysics Data System (ADS)
Xia-Yan, Zhang; Guo-Ji, Zhang; Xuan, Li; Ya-Zhou, Ren; Jie-Hua, Wu
2016-05-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.
Generation of large prime numbers from a sequence of previous prime numbers
NASA Astrophysics Data System (ADS)
Samir, Brahim Belhaouari; Rezk, Youssef A. Y.
2012-09-01
A prime number is co-prime with all the primes as well. This paper utilizes this fact by generating larger prime numbers based on a set of smaller prime numbers. The prime numbers are ordered and each two consecutive primes are coupled to generate their co-prime number formula extending this process larger prime sequence is established. Will the process help us produce larger prime numbers faster and more efficiently? This paper investigates the described process.
Pseudorandom number generation using chaotic true orbits of the Bernoulli map
NASA Astrophysics Data System (ADS)
Saito, Asaki; Yamaguchi, Akihiro
2016-06-01
We devise a pseudorandom number generator that exactly computes chaotic true orbits of the Bernoulli map on quadratic algebraic integers. Moreover, we describe a way to select the initial points (seeds) for generating multiple pseudorandom binary sequences. This selection method distributes the initial points almost uniformly (equidistantly) in the unit interval, and latter parts of the generated sequences are guaranteed not to coincide. We also demonstrate through statistical testing that the generated sequences possess good randomness properties.
Pseudorandom number generation using chaotic true orbits of the Bernoulli map.
Saito, Asaki; Yamaguchi, Akihiro
2016-06-01
We devise a pseudorandom number generator that exactly computes chaotic true orbits of the Bernoulli map on quadratic algebraic integers. Moreover, we describe a way to select the initial points (seeds) for generating multiple pseudorandom binary sequences. This selection method distributes the initial points almost uniformly (equidistantly) in the unit interval, and latter parts of the generated sequences are guaranteed not to coincide. We also demonstrate through statistical testing that the generated sequences possess good randomness properties. PMID:27368787
Detail of generator number three, oblique. Control panels on the ...
Detail of generator number three, oblique. Control panels on the main floor and on the mezzanine are visible behind and above the generators. - March Air Force Base, Strategic Air Command, Utility Building, 5220 Riverside Drive, Moreno Valley, Riverside County, CA
Ultra-fast quantum randomness generation by accelerated phase diffusion in a pulsed laser diode.
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. PMID:24515170
The Reliability of Randomly Generated Math Curriculum-Based Measurements
ERIC Educational Resources Information Center
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"…
Khonina, Svetlana N; Golub, Ilya
2015-09-01
We show that it is possible to generate transversely random, diffraction-free/longitudinally invariant vector optical fields. The randomness in transverse polarization distribution complements a previously studied one in intensity of scalar Bessel-type beams, adding another degree of freedom to control these beams. Moreover, we show that the relative transversely random phase distribution is also conserved along the optical axis. Thus, intensity, phase, and polarization of Bessel-type beams can be transversely random/arbitrary while invariant upon propagation. Such fields may find applications in encryption/secure communications, optical trapping, etc. PMID:26368714
NASA Astrophysics Data System (ADS)
Mironowicz, Piotr; Tavakoli, Armin; Hameedi, Alley; Marques, Breno; Pawłowski, Marcin; Bourennane, Mohamed
2016-06-01
Quantum communication with systems of dimension larger than two provides advantages in information processing tasks. Examples include higher rates of key distribution and random number generation. The main disadvantage of using such multi-dimensional quantum systems is the increased complexity of the experimental setup. Here, we analyze a not-so-obvious problem: the relation between randomness certification and computational requirements of the post-processing of experimental data. In particular, we consider semi-device independent randomness certification from an experiment using a four dimensional quantum system to violate the classical bound of a random access code. Using state-of-the-art techniques, a smaller quantum violation requires more computational power to demonstrate randomness, which at some point becomes impossible with today’s computers although the randomness is (probably) still there. We show that by dedicating more input settings of the experiment to randomness certification, then by more computational postprocessing of the experimental data which corresponds to a quantum violation, one may increase the amount of certified randomness. Furthermore, we introduce a method that significantly lowers the computational complexity of randomness certification. Our results show how more randomness can be generated without altering the hardware and indicate a path for future semi-device independent protocols to follow.
Simulation and study of small numbers of random events
NASA Technical Reports Server (NTRS)
Shelton, R. D.
1986-01-01
Random events were simulated by computer and subjected to various statistical methods to extract important parameters. Various forms of curve fitting were explored, such as least squares, least distance from a line, maximum likelihood. Problems considered were dead time, exponential decay, and spectrum extraction from cosmic ray data using binned data and data from individual events. Computer programs, mostly of an iterative nature, were developed to do these simulations and extractions and are partially listed as appendices. The mathematical basis for the compuer programs is given.
Secure self-calibrating quantum random-bit generator
Fiorentino, M.; Santori, C.; Spillane, S. M.; Beausoleil, R. G.; Munro, W. J.
2007-03-15
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.
Narrow-band generation in random distributed feedback fiber laser.
Sugavanam, Srikanth; Tarasov, Nikita; Shu, Xuewen; Churkin, Dmitry V
2013-07-15
Narrow-band emission of spectral width down to ~0.05 nm line-width is achieved in the random distributed feedback fiber laser employing narrow-band fiber Bragg grating or fiber Fabry-Perot interferometer filters. The observed line-width is ~10 times less than line-width of other demonstrated up to date random distributed feedback fiber lasers. The random DFB laser with Fabry-Perot interferometer filter provides simultaneously multi-wavelength and narrow-band (within each line) generation with possibility of further wavelength tuning. PMID:23938497
Fully photonics-based physical random bit generator.
Li, Pu; Sun, Yuanyuan; Liu, Xianglian; Yi, Xiaogang; Zhang, Jianguo; Guo, Xiaomin; Guo, Yanqiang; Wang, Yuncai
2016-07-15
We propose a fully photonics-based approach for ultrafast physical random bit generation. This approach exploits a compact nonlinear loop mirror (called a terahertz optical asymmetric demultiplexer, TOAD) to sample the chaotic optical waveform in an all-optical domain and then generate random bit streams through further comparison with a threshold level. This method can efficiently overcome the electronic jitter bottleneck confronted by existing RBGs in practice. A proof-of-concept experiment demonstrates that this method can continuously extract 5 Gb/s random bit streams from the chaotic output of a distributed feedback laser diode (DFB-LD) with optical feedback. This limited generation rate is caused by the bandwidth of the used optical chaos. PMID:27420532
Biased Random Number Generator Based on Bell's Theorem
NASA Astrophysics Data System (ADS)
Yong-Gang, Tan; Yao-Hua, Hu; Hai-Feng, Yang
2016-03-01
Not Available Supported by the National Natural Science Foundation of China under Grant Nos 61378011, U1204616 and 11447143, the Program for Science and Technology Innovation Talents in Universities of Henan Province under Grant No 2012HASTIT028, and the Program for Science and Technology Innovation Research Team in University of Henan Province under Grant No 13IRTSTHN020.
Sum-frequency generation from photon number squeezed light
NASA Technical Reports Server (NTRS)
Wu, Ling-An; Du, Cong-Shi; Wu, Mei-Juan; Li, Shi-Qun
1994-01-01
We investigate the quantum fluctuations of the fields produced in sum-frequency (SF) generation from light initially in the photon number squeezed state. It is found that, to the fourth power term, the output SF light is sub-Poissonian whereas the quantum fluctuations of the input beams increase. Quantum anticorrelation also exists in SF generation.
All-optical quantum random bit generation from intrinsically binary phase of parametric oscillators.
Marandi, Alireza; Leindecker, Nick C; Vodopyanov, Konstantin L; Byer, Robert L
2012-08-13
We demonstrate a novel all-optical quantum random number generator (RNG) based on above-threshold binary phase state selection in a degenerate optical parametric oscillator (OPO). Photodetection is not a part of the random process, and no post processing is required for the generated bit sequence. We show that the outcome is statistically random with 99% confidence, and verify that the randomness is due to the phase of initiating photons generated through spontaneous parametric down conversion of the pump, with negligible contribution of classical noise sources. With the use of micro- and nanoscale OPO resonators, this technique offers a promise for simple, robust, and high-speed on-chip all-optical quantum RNGs. PMID:23038574
The generation of random variates from a relativistic Maxwellian distribution
Swisdak, M.
2013-06-15
A procedure for generating random variates from a relativistic Maxwellian distribution with arbitrary temperature and drift velocity is presented. The algorithm is based on the rejection method and can be used to initialize particle velocities in kinetic simulations of plasmas and gases.
Realistic noise-tolerant randomness amplification using finite number of devices
NASA Astrophysics Data System (ADS)
Brandão, Fernando G. S. L.; Ramanathan, Ravishankar; Grudka, Andrzej; Horodecki, Karol; Horodecki, Michał; Horodecki, Paweł; Szarek, Tomasz; Wojewódka, Hanna
2016-04-01
Randomness is a fundamental concept, with implications from security of modern data systems, to fundamental laws of nature and even the philosophy of science. Randomness is called certified if it describes events that cannot be pre-determined by an external adversary. It is known that weak certified randomness can be amplified to nearly ideal randomness using quantum-mechanical systems. However, so far, it was unclear whether randomness amplification is a realistic task, as the existing proposals either do not tolerate noise or require an unbounded number of different devices. Here we provide an error-tolerant protocol using a finite number of devices for amplifying arbitrary weak randomness into nearly perfect random bits, which are secure against a no-signalling adversary. The correctness of the protocol is assessed by violating a Bell inequality, with the degree of violation determining the noise tolerance threshold. An experimental realization of the protocol is within reach of current technology.
Realistic noise-tolerant randomness amplification using finite number of devices.
Brandão, Fernando G S L; Ramanathan, Ravishankar; Grudka, Andrzej; Horodecki, Karol; Horodecki, Michał; Horodecki, Paweł; Szarek, Tomasz; Wojewódka, Hanna
2016-01-01
Randomness is a fundamental concept, with implications from security of modern data systems, to fundamental laws of nature and even the philosophy of science. Randomness is called certified if it describes events that cannot be pre-determined by an external adversary. It is known that weak certified randomness can be amplified to nearly ideal randomness using quantum-mechanical systems. However, so far, it was unclear whether randomness amplification is a realistic task, as the existing proposals either do not tolerate noise or require an unbounded number of different devices. Here we provide an error-tolerant protocol using a finite number of devices for amplifying arbitrary weak randomness into nearly perfect random bits, which are secure against a no-signalling adversary. The correctness of the protocol is assessed by violating a Bell inequality, with the degree of violation determining the noise tolerance threshold. An experimental realization of the protocol is within reach of current technology. PMID:27098302
Realistic noise-tolerant randomness amplification using finite number of devices
Brandão, Fernando G. S. L.; Ramanathan, Ravishankar; Grudka, Andrzej; Horodecki, Karol; Horodecki, Michał; Horodecki, Paweł; Szarek, Tomasz; Wojewódka, Hanna
2016-01-01
Randomness is a fundamental concept, with implications from security of modern data systems, to fundamental laws of nature and even the philosophy of science. Randomness is called certified if it describes events that cannot be pre-determined by an external adversary. It is known that weak certified randomness can be amplified to nearly ideal randomness using quantum-mechanical systems. However, so far, it was unclear whether randomness amplification is a realistic task, as the existing proposals either do not tolerate noise or require an unbounded number of different devices. Here we provide an error-tolerant protocol using a finite number of devices for amplifying arbitrary weak randomness into nearly perfect random bits, which are secure against a no-signalling adversary. The correctness of the protocol is assessed by violating a Bell inequality, with the degree of violation determining the noise tolerance threshold. An experimental realization of the protocol is within reach of current technology. PMID:27098302
Inkjet aerosol generator as monodisperse particle number standard
NASA Astrophysics Data System (ADS)
Iida, Kenjiro; Sakurai, Hiromu; Ehara, Kensei
2013-05-01
Inkjet technology can be applied to generate highly monodisperse aerosol particles in micrometer range at a precisely controlled rate. AIST has been developing an inkjet aerosol generator (AIST-IAG), and the device will soon become the secondary measurement standard for aerosol particle number concentration in 0.35 μm to 10 μm range. The AIST-IAG can generate both solid and liquid particles consisting of water-soluble ionic compounds. We first report the characteristics of the particle sizes of the generated particles. The full width half maximum of the particle size distribution is about 2 percent, and the particle diameter of the IAG particles was calibrated as a function of the particle mass within 0.6-10 μm range using polystyrene latex sphere as reference material. Then we report the capability of the AIST-IAG as the particle number standard. The particle generation efficiency ηIAG was defined as the number of aerosol particles exiting from the AIST-IAG divided by the rate of the droplet generation, and the values of ηIAG within 0.35-10 μm is essentially 100%, and the 95% confidence interval of the values is less than 1%. The result strongly supports that the AISTIAG can be used to calibrate the counting efficiency of the optical particle counters in submicrometer to micrometer range.
Cascaded Cerenkov third-harmonic generation in random quadratic media
Ayoub, Mousa; Roedig, Philip; Imbrock, Joerg; Denz, Cornelia
2011-12-12
We investigate experimentally and theoretically the conical emission of Cerenkov-type third-harmonic generation in strontium barium niobate of random 2D-{chi}{sup (2)} distribution. The azimuthal intensity distribution is explained by the polarization properties of the fundamental and Cerenkov second-harmonic waves, depending on the cascaded origin of the generation process. Moreover, we show the role of the individual domain shape in an additional modulation on the conical emission, controlled by the electrical switching of the spontaneous polarization of the ferroelectric medium.
Raw and Central Moments of Binomial Random Variables via Stirling Numbers
ERIC Educational Resources Information Center
Griffiths, Martin
2013-01-01
We consider here the problem of calculating the moments of binomial random variables. It is shown how formulae for both the raw and the central moments of such random variables may be obtained in a recursive manner utilizing Stirling numbers of the first kind. Suggestions are also provided as to how students might be encouraged to explore this…
On the generation of random variables for radar simulation purposes
NASA Astrophysics Data System (ADS)
Galati, G.; Fanelli, S.
The uniform pseudorandom number generator, available in the subroutine FORTRAN RANDN/FG UNIVAC for 36 bit computers such as the UNIVAC 1100 series, underwent statistical tests. The pure congruence generator performs particularly well. Using these uniform numbers, it is easy to obtain pseudorandom numbers distributed with the laws of practical interest for digital simulations. With the Gaussian law, it is possible to use the central limit theorem and the Box-Muller method. Subroutines for these methods require between 0.6 and 0.15 msec.
Shteingart, Hanan; Loewenstein, Yonatan
2016-01-01
There is a long history of experiments in which participants are instructed to generate a long sequence of binary random numbers. The scope of this line of research has shifted over the years from identifying the basic psychological principles and/or the heuristics that lead to deviations from randomness, to one of predicting future choices. In this paper, we used generalized linear regression and the framework of Reinforcement Learning in order to address both points. In particular, we used logistic regression analysis in order to characterize the temporal sequence of participants' choices. Surprisingly, a population analysis indicated that the contribution of the most recent trial has only a weak effect on behavior, compared to more preceding trials, a result that seems irreconcilable with standard sequential effects that decay monotonously with the delay. However, when considering each participant separately, we found that the magnitudes of the sequential effect are a monotonous decreasing function of the delay, yet these individual sequential effects are largely averaged out in a population analysis because of heterogeneity. The substantial behavioral heterogeneity in this task is further demonstrated quantitatively by considering the predictive power of the model. We show that a heterogeneous model of sequential dependencies captures the structure available in random sequence generation. Finally, we show that the results of the logistic regression analysis can be interpreted in the framework of reinforcement learning, allowing us to compare the sequential effects in the random sequence generation task to those in an operant learning task. We show that in contrast to the random sequence generation task, sequential effects in operant learning are far more homogenous across the population. These results suggest that in the random sequence generation task, different participants adopt different cognitive strategies to suppress sequential dependencies when
Evolution of dendrimer conformational structure with generation number
NASA Astrophysics Data System (ADS)
Betancourt, Beatriz A. Pazmiño; Douglas, Jack F.
2016-05-01
We simulate the conformational structure of a coarse-grained model of dendrimer molecules in a good solvent as a function of generation number G and find that they evolve through substantially more complex structures than regular star polymers with increasing arms because of their hierarchical topological structure. As G increases, they evolve from 3-arm stars to branched polymers that geometrically resemble lattice animals, and then percolation clusters for G = 4 - 6 range. For larger G, the dendrimers become similar to porous particles, but the molecule segregates segregates into subdomains at G = 9, reflecting the branching complexity of the first dendrimer generation.
K-System Generator of Pseudorandom Numbers on Galois Field
NASA Astrophysics Data System (ADS)
Athanasiu, G. G.; Floratos, E. G.; Savvidy, G. K.
We analyze the structure of the periodic trajectories of the K-system generator of pseudorandom numbers on a rational sublattice which coincides with the Galois field GF[p]. The period of the trajectories increases as a function of the lattice size p and the dimension of the K-matrix d. We emphasize the connection of this approach with the one which is based on primitive matrices over Galois fields.
K-system generator of pseudorandom numbers of Galois field
Athanasiu, G.G.; Floratos, E.G.; Savvidy, G.K.
1997-06-01
We analyze the structure of the periodic trajectories of the K-system generator of pseudorandom numbers on a rational sublattice which coincides with the Galois field GF[p]. The period of the trajectories increases as a function of the lattice size p and the dimension of the K-matrix d. We emphasize the connection of this approach with the one which is based on primitive matrices over Galois fields.
Non-random DNA fragmentation in next-generation sequencing
Poptsova, Maria S.; Il'icheva, Irina A.; Nechipurenko, Dmitry Yu.; Panchenko, Larisa A.; Khodikov, Mingian V.; Oparina, Nina Y.; Polozov, Robert V.; Nechipurenko, Yury D.; Grokhovsky, Sergei L.
2014-01-01
Next Generation Sequencing (NGS) technology is based on cutting DNA into small fragments, and their massive parallel sequencing. The multiple overlapping segments termed “reads” are assembled into a contiguous sequence. To reduce sequencing errors, every genome region should be sequenced several dozen times. This sequencing approach is based on the assumption that genomic DNA breaks are random and sequence-independent. However, previously we showed that for the sonicated restriction DNA fragments the rates of double-stranded breaks depend on the nucleotide sequence. In this work we analyzed genomic reads from NGS data and discovered that fragmentation methods based on the action of the hydrodynamic forces on DNA, produce similar bias. Consideration of this non-random DNA fragmentation may allow one to unravel what factors and to what extent influence the non-uniform coverage of various genomic regions. PMID:24681819
Non-random DNA fragmentation in next-generation sequencing
NASA Astrophysics Data System (ADS)
Poptsova, Maria S.; Il'Icheva, Irina A.; Nechipurenko, Dmitry Yu.; Panchenko, Larisa A.; Khodikov, Mingian V.; Oparina, Nina Y.; Polozov, Robert V.; Nechipurenko, Yury D.; Grokhovsky, Sergei L.
2014-03-01
Next Generation Sequencing (NGS) technology is based on cutting DNA into small fragments, and their massive parallel sequencing. The multiple overlapping segments termed ``reads'' are assembled into a contiguous sequence. To reduce sequencing errors, every genome region should be sequenced several dozen times. This sequencing approach is based on the assumption that genomic DNA breaks are random and sequence-independent. However, previously we showed that for the sonicated restriction DNA fragments the rates of double-stranded breaks depend on the nucleotide sequence. In this work we analyzed genomic reads from NGS data and discovered that fragmentation methods based on the action of the hydrodynamic forces on DNA, produce similar bias. Consideration of this non-random DNA fragmentation may allow one to unravel what factors and to what extent influence the non-uniform coverage of various genomic regions.
Shteingart, Hanan; Loewenstein, Yonatan
2016-01-01
There is a long history of experiments in which participants are instructed to generate a long sequence of binary random numbers. The scope of this line of research has shifted over the years from identifying the basic psychological principles and/or the heuristics that lead to deviations from randomness, to one of predicting future choices. In this paper, we used generalized linear regression and the framework of Reinforcement Learning in order to address both points. In particular, we used logistic regression analysis in order to characterize the temporal sequence of participants’ choices. Surprisingly, a population analysis indicated that the contribution of the most recent trial has only a weak effect on behavior, compared to more preceding trials, a result that seems irreconcilable with standard sequential effects that decay monotonously with the delay. However, when considering each participant separately, we found that the magnitudes of the sequential effect are a monotonous decreasing function of the delay, yet these individual sequential effects are largely averaged out in a population analysis because of heterogeneity. The substantial behavioral heterogeneity in this task is further demonstrated quantitatively by considering the predictive power of the model. We show that a heterogeneous model of sequential dependencies captures the structure available in random sequence generation. Finally, we show that the results of the logistic regression analysis can be interpreted in the framework of reinforcement learning, allowing us to compare the sequential effects in the random sequence generation task to those in an operant learning task. We show that in contrast to the random sequence generation task, sequential effects in operant learning are far more homogenous across the population. These results suggest that in the random sequence generation task, different participants adopt different cognitive strategies to suppress sequential dependencies when
A program generating homogeneous random graphs with given weights
NASA Astrophysics Data System (ADS)
Bogacz, L.; Burda, Z.; Janke, W.; Waclaw, B.
2005-12-01
We present a program package to generate homogeneous random graphs with probabilities prescribed by the user. The statistical weight of a labeled graph α is given in the form W(α)=∏i=1Np(q), where p(q) is an arbitrary user function and q are the degrees of the graph nodes. The program can be used to generate two types of graphs (simple graphs and pseudo-graphs) from three types of ensembles (micro-canonical, canonical and grand-canonical). Program summaryTitle of the program:GraphGen Catalogue identifier:ADWL Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADWL Program obtainable from:CPC Program Library, Queen's University of Belfast, N. Ireland Computer for which the program is designed and others on which it has been tested: PC, Alpha workstation Operating systems or monitors under which the program has been tested:Linux, Unix, MS Windows XP Programing language used:C Memory required to execute with typical data:300 k words for a graph with 1000 nodes and up to 50 000 links No. of bits in a word:32 No. of processor used:1 Has the code been vectorized or parallelized:No No. of lines in distributed program, including test data, etc.:2253 No. of bytes in distributed program, including test data, etc.:14 330 Distribution format:tar.gz Keywords:Random graphs, complex networks, Markov process, Monte Carlo method Nature of the problem:The program generates random graphs. The probabilities of graph occurrence are proportional to their statistical weight, dependent on node degrees defined by arbitrary distributions Method of solution:The starting graph is taken arbitrary and then a sequence of graphs is generated. Each graph is obtained from the previous one by means of a simple modification. The probability of accepting or rejecting the new graph results from a detailed balance condition realized as Metropolis algorithm. When the length of the generated Markov chain increases, the probabilities of graph occurrence approach the stationary distribution given by
Grid-generated isotropic homogeneous turbulence at high Reynolds numbers
NASA Technical Reports Server (NTRS)
Rosen, G.
1981-01-01
Consideration is given to an empirical formula for the longitudinal correlation function for grid-generated incompressible fluid turbulence at Reynolds numbers above 12,800. The formula, which relates the longitudinal correlation function to the inverse cube of a dimensionless geometrical ratio, is shown to minimize the global correlation integrals into which the two-point velocity correlation tensor has been substituted subject to a global constraint on the Sobolev concomitent of the longitudinal correlation function. Furthermore, the energy spectrum function associated with the empirical formula is shown to satisfy a tertiary Helmholtz-type linear condition throughout the initial period of decay.
Phase transition in a stochastic prime-number generator.
Luque, Bartolo; Lacasa, Lucas; Miramontes, Octavio
2007-07-01
We introduce a stochastic algorithm that acts as a prime-number generator. The dynamics of this algorithm gives rise to a continuous phase transition, which separates a phase where the algorithm is able to reduce a whole set of integers into primes and a phase where the system reaches a frozen state with low prime density. We present both numerical simulations and an analytical approach in terms of an annealed approximation, by means of which the data are collapsed. A critical slowing-down phenomenon is also outlined. PMID:17677398
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. PMID:20721222
Generation of Random Particle Packings for Discrete Element Models
NASA Astrophysics Data System (ADS)
Abe, S.; Weatherley, D.; Ayton, T.
2012-04-01
An important step in the setup process of Discrete Element Model (DEM) simulations is the generation of a suitable particle packing. There are quite a number of properties such a granular material specimen should ideally have, such as high coordination number, isotropy, the ability to fill arbitrary bounding volumes and the absence of locked-in stresses. An algorithm which is able to produce specimens fulfilling these requirements is the insertion based sphere packing algorithm originally proposed by Place and Mora, 2001 [2] and extended in this work. The algorithm works in two stages. First a number of "seed" spheres are inserted into the bounding volume. In the second stage the gaps between the "seed" spheres are filled by inserting new spheres in a way so they have D+1 (i.e. 3 in 2D, 4 in 3D) touching contacts with either other spheres or the boundaries of the enclosing volume. Here we present an implementation of the algorithm and a systematic statistical analysis of the generated sphere packings. The analysis of the particle radius distribution shows that they follow a power-law with an exponent ≈ D (i.e. ≈3 for a 3D packing and ≈2 for 2D). Although the algorithm intrinsically guarantees coordination numbers of at least 4 in 3D and 3 in 2D, the coordination numbers realized in the generated packings can be significantly higher, reaching beyond 50 if the range of particle radii is sufficiently large. Even for relatively small ranges of particle sizes (e.g. Rmin = 0.5Rmax) the maximum coordination number may exceed 10. The degree of isotropy of the generated sphere packing is also analysed in both 2D and 3D, by measuring the distribution of orientations of vectors joining the centres of adjacent particles. If the range of particle sizes is small, the packing algorithm yields moderate anisotropy approaching that expected for a face-centred cubic packing of equal-sized particles. However, once Rmin < 0.3Rmax a very high degree of isotropy is demonstrated in
NASA Astrophysics Data System (ADS)
Alamino, R. C.; Saad, D.
2008-06-01
Using methods of statistical physics, we study the average number and kernel size of general sparse random matrices over Galois fields GF(q) , with a given connectivity profile, in the thermodynamical limit of large matrices. We introduce a mapping of GF(q) matrices onto spin systems using the representation of the cyclic group of order q as the q th complex roots of unity. This representation facilitates the derivation of the average kernel size of random matrices using the replica approach, under the replica-symmetric ansatz, resulting in saddle point equations for general connectivity distributions. Numerical solutions are then obtained for particular cases by population dynamics. Similar techniques also allow us to obtain an expression for the exact and average numbers of random matrices for any general connectivity profile. We present numerical results for particular distributions.
NASA Astrophysics Data System (ADS)
Urano, Ryo; Okamoto, Yuko
2015-12-01
We propose a replica-exchange method (REM) which does not use pseudo random numbers. For this purpose, we first give a conditional probability for Gibbs sampling replica-exchange method (GSREM) based on the heat bath method. In GSREM, replica exchange is performed by conditional probability based on the weight of states using pseudo random numbers. From the conditional probability, we propose a new method called deterministic replica-exchange method (DETREM) that produces thermal equilibrium distribution based on a differential equation instead of using pseudo random numbers. This method satisfies the detailed balance condition using a conditional probability of Gibbs heat bath method and thus results can reproduce the Boltzmann distribution within the condition of the probability. We confirmed that the equivalent results were obtained by REM and DETREM with two-dimensional Ising model. DETREM can avoid problems of choice of seeds in pseudo random numbers for parallel computing of REM and gives analytic method for REM using a differential equation.
Feedback control of digital chaotic systems with application to pseudorandom number generator
NASA Astrophysics Data System (ADS)
Deng, Yashuang; Hu, Hanping; Liu, Lingfeng
2015-07-01
The dynamical properties will degrade when chaotic systems are implemented in digital computers with finite precisions, and such degradation often has serious negative influence on some digital chaos-based systems. Degradation reduction for a class of digital chaotic systems is investigated in this paper. A varying parameter control method is proposed based on the state feedback control technology at first. Then two chaotic maps are applied to verify its validity. Finally, a novel pseudorandom number generator is constructed, which can pass all the tests of NIST SP800-22 at both level-one and level-two approaches and also most of the tests of TestU01. Moreover, it performs better than some existing pseudorandom number generators. Thus, it has acceptable quality of randomness and can be used for cryptography and other applications.
Theory of second harmonic generation in randomly oriented species
NASA Astrophysics Data System (ADS)
Andrews, David L.; Allcock, Philip; Demidov, Andrey A.
1995-01-01
It is well known that second harmonic generation (SHG) is a process forbidden within atomic and molecular fluids. Nonetheless recent experimental observations of second harmonic evolution in suspensions of randomly oriented Halobacterium halobium purple membranes have raised new questions about the precise criteria which determine prohibition of the second harmonic. To address the problem a theoretical framework for SHG is developed that specifically deals with molecular systems, and is therefore cast in terms of molecular properties with more regard to the influence of the local structure. This contrasts with the classical approach based on bulk susceptibilities, which has not proved adequate to explain the conflicting experimental results. By properly formulating the detailed procedure for dealing with the necessary orientational averages, the present theory discloses a relationship between the coherent process of second harmonic generation and a directed component of its incoherent counterpart, hyper-Rayleigh scattering. Inter alia, the theory explains the SHG detected in purple membrane suspensions. The polarisation features of the harmonic evolution are also considered more generally, and in particular it is shown that the SHG signal will persist under conditions of circularly polarised pumping. This specific polarisation feature will allow experimental validation of the theory.
Internal wave generation by tidal flow over random topography
NASA Astrophysics Data System (ADS)
Zhao, Jiajun; Zhang, Likun; Swinney, Harry
2015-11-01
The irregularity of oceanic topography plays a critical role in determining the power in internal waves generated by tidal flow over the seafloor. We conduct numerical simulations (for a fluid with a constant buoyancy frequency) for different synthetic random topographies. For topography with small rms height Hrms and small slopes the simulations yield a quadratic dependence of the power on Hrms, in accord with linear theory. However, for tall topography with steep slopes the internal wave power is found to vary linearly with Hrms. The transition from quadratic to linear scaling of the radiated internal wave power on Hrms occurs when the ``valley slope'' exceeds the internal wave slope. (The valley slope, to be defined in this talk, characterizes the maximum slope of topography between adjacent peaks.) The simulations also reveal that the radiated power saturates with increasing topographic resolution, as conjectured in previous studies. The present results should be helpful in improving estimates of the total internal wave power generated by the world's oceans.
Quasi-Monte Carlo, quasi-random numbers and quasi-error estimates
NASA Astrophysics Data System (ADS)
Kleiss, Ronald
We discuss quasi-random number sequences as a basis for numerical integration with potentially better convergence properties than standard Monte Carlo. The importance of the discrepancy as both a measure of smoothness of distribution and an ingredient in the error estimate is reviewed. It is argued that the classical Koksma-Hlawka inequality is not relevant for error estimates in realistic cases, and a new class of error estimates is presented, based on a generalization of the Woźniakowski lemma.
Oracle inequalities for SVMs that are based on random entropy numbers
Steinwart, Ingo
2009-01-01
In this paper we present a new technique for bounding local Rademacher averages of function classes induced by a loss function and a reproducing kernel Hilbert space (RKHS). At the heart of this technique lies the observation that certain expectations of random entropy numbers can be bounded by the eigenvalues of the integral operator associated to the RKHS. We then work out the details of the new technique by establishing two new oracle inequalities for SVMs, which complement and generalize orevious results.
Reconstruction of photon number conditioned states using phase randomized homodyne measurements
NASA Astrophysics Data System (ADS)
Chrzanowski, H. M.; Assad, S. M.; Bernu, J.; Hage, B.; Lund, A. P.; Ralph, T. C.; Lam, P. K.; Symul, T.
2013-05-01
We experimentally demonstrate the reconstruction of a photon number conditioned state without using a photon number discriminating detector. By using only phase randomized homodyne measurements, we reconstruct up to the three photon subtracted squeezed vacuum state. The reconstructed Wigner functions of these states show regions of pronounced negativity, signifying the non-classical nature of the reconstructed states. The techniques presented allow for complete characterization of the role of a conditional measurement on an ensemble of states, and might prove useful in systems where photon counting still proves technically challenging.
Central Limit Theorems and Uniform Laws of Large Numbers for Arrays of Random Fields
Jenish, Nazgul; Prucha, Ingmar R.
2009-01-01
Over the last decades, spatial-interaction models have been increasingly used in economics. However, the development of a sufficiently general asymptotic theory for nonlinear spatial models has been hampered by a lack of relevant central limit theorems (CLTs), uniform laws of large numbers (ULLNs) and pointwise laws of large numbers (LLNs). These limit theorems form the essential building blocks towards developing the asymptotic theory of M-estimators, including maximum likelihood and generalized method of moments estimators. The paper establishes a CLT, ULLN, and LLN for spatial processes or random fields that should be applicable to a broad range of data processes. PMID:20161289
Microcomputers: Instrument Generation Software. Evaluation Guides. Guide Number 11.
ERIC Educational Resources Information Center
Gray, Peter J.
Designed to assist evaluators in selecting the appropriate software for the generation of various data collection instruments, this guide discusses such key program characteristics as text entry, item storage and manipulation, item retrieval, and printing. Some characteristics of a good instrument generation program are discussed; these include…
Effect of the driving algorithm on the turbulence generated by a random jet array
NASA Astrophysics Data System (ADS)
Pérez-Alvarado, Alejandro; Mydlarski, Laurent; Gaskin, Susan
2016-02-01
Different driving algorithms for a large random jet array (RJA) were tested and their performance characterized by comparing the statistics of the turbulence generated downstream of the RJA. Of particular interest was the spatial configuration of the jets operating at any given instant (an aspect that has not been documented in previous RJAs studies), as well as the statistics of their respective on/off times. All algorithms generated flows with nonzero skewnesses of the velocity fluctuation normal to the plane of the RJA (identified as an inherent limitation of the system resulting from the unidirectional forcing imposed from only one side of the RJA), and slightly super-Gaussian kurtoses of the velocity fluctuations in all directions. It was observed that algorithms imposing spatial configurations generated the most isotropic flows; however, they suffered from high mean flows and low turbulent kinetic energies. The algorithm identified as RANDOM (also referred to as the "sunbathing algorithm") generated the flow that, on an overall basis, most closely approximated zero-mean-flow homogeneous isotropic turbulence, with variations in horizontal and vertical homogeneities of RMS velocities of no more than ±6 %, deviations from isotropy ( w RMS/ u RMS) in the range of 0.62-0.77, and mean flows on the order of 7 % of the RMS velocities (determined by averaging their absolute values over the three velocity components and three downstream distances). A relatively high turbulent Reynolds number ( Re T = u T ℓ/ ν = 2360, where ℓ is the integral length scale of the flow and u T is a characteristic RMS velocity) was achieved using the RANDOM algorithm and the integral length scale ( ℓ = 11.5 cm) is the largest reported to date. The quality of the turbulence in our large facility demonstrates the ability of RJAs to be scaled-up and to be the laboratory system most capable of generating the largest quasi-homogeneous isotropic turbulent regions with zero mean flow.
Quantum cryptography using coherent states: Randomized encryption and key generation
NASA Astrophysics Data System (ADS)
Corndorf, Eric
With the advent of the global optical-telecommunications infrastructure, an increasing number of individuals, companies, and agencies communicate information with one another over public networks or physically-insecure private networks. While the majority of the traffic flowing through these networks requires little or no assurance of secrecy, the same cannot be said for certain communications between banks, between government agencies, within the military, and between corporations. In these arenas, the need to specify some level of secrecy in communications is a high priority. While the current approaches to securing sensitive information (namely the public-key-cryptography infrastructure and deterministic private-key ciphers like AES and 3DES) seem to be cryptographically strong based on empirical evidence, there exist no mathematical proofs of secrecy for any widely deployed cryptosystem. As an example, the ubiquitous public-key cryptosystems infer all of their secrecy from the assumption that factoring of the product of two large primes is necessarily time consuming---something which has not, and perhaps cannot, be proven. Since the 1980s, the possibility of using quantum-mechanical features of light as a physical mechanism for satisfying particular cryptographic objectives has been explored. This research has been fueled by the hopes that cryptosystems based on quantum systems may provide provable levels of secrecy which are at least as valid as quantum mechanics itself. Unfortunately, the most widely considered quantum-cryptographic protocols (BB84 and the Ekert protocol) have serious implementation problems. Specifically, they require quantum-mechanical states which are not readily available, and they rely on unproven relations between intrusion-level detection and the information available to an attacker. As a result, the secrecy level provided by these experimental implementations is entirely unspecified. In an effort to provably satisfy the cryptographic
Records for the number of distinct sites visited by a random walk on the fully connected lattice
NASA Astrophysics Data System (ADS)
Turban, Loïc
2015-11-01
We consider a random walk on the fully connected lattice with N sites and study the time evolution of the number of distinct sites s visited by the walker on a subset with n sites. A record value v is obtained for s at a record time t when the walker visits a site of the subset for the first time. The record time t is a partial covering time when v\\lt n and a total covering time when v = n. The probability distributions for the number of records s, the record value v and the record (covering) time t, involving r-Stirling numbers, are obtained using generating function techniques. The mean values, variances and skewnesses are deduced from the generating functions. In the scaling limit the probability distributions for s and v lead to the same Gaussian density. The fluctuations of the record time t are also Gaussian at partial covering, when n-v={{O}}(n). They are distributed according to the type-I Gumbel extreme-value distribution at total covering, when v = n. A discrete sequence of generalized Gumbel distributions, indexed by n-v, is obtained at almost total covering, when n-v={{O}}(1). These generalized Gumbel distributions are crossing over to the Gaussian distribution when n - v increases.
NASA Astrophysics Data System (ADS)
Mortazavi, Milad; Mani, Ali
2015-11-01
Air entrainment in breaking waves is a ubiquitous and complex phenomenon. It is the main source of air transfer from atmosphere to the oceans. Furthermore, air entrainment due to ship-induced waves contributes to bubbly flows in ship wakes and also affect their performance. In this study, we consider a turbulent hydraulic jump as a canonical setting to investigate air entrainment due to turbulence-wave interactions. The flow has an inlet Froude number of 2.0, while three different Weber numbers (We = 1820, 729, 292), and two different Reynolds numbers (Re = 11000, 5500) based on the inlet height and inlet velocity are investigated. Air entrainment is shown to be very sensitive to the We number, while Re number has a minor effect. Wave breaking and interface collisions are significantly reduced in the low Weber number cases. As a result, micro-bubble generation is significantly reduced with decreasing Weber number. Vortex shedding events are observed to emerge at the toe of the jump in all of the cases. For high Weber number regimes, shedding of vortices is accompanied by engulfment of air pockets into the jump in a periodic manner, while for lower Webber number regimes such events are significantly suppressed. Reynolds number is shown to have a negligible effect on the air entrainment, wave breaking and micro-bubble generation, contrary to the previous assumptions in other studies. Supported by ONR.
Hysteresis in random-field Ising model on a Bethe lattice with a mixed coordination number
NASA Astrophysics Data System (ADS)
Shukla, Prabodh; Thongjaomayum, Diana
2016-06-01
We study zero-temperature hysteresis in the random-field Ising model on a Bethe lattice where a fraction c of the sites have coordination number z = 4 while the remaining fraction 1-c have z = 3. Numerical simulations as well as probabilistic methods are used to show the existence of critical hysteresis for all values of c\\gt 0. This extends earlier results for c = 0 and c = 1 to the entire range 0≤slant c≤slant 1, and provides new insight in non-equilibrium critical phenomena. Our analysis shows that a spanning avalanche can occur on a lattice even in the absence of a spanning cluster of z = 4 sites.
Brownian motion properties of optoelectronic random bit generators based on laser chaos.
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. PMID:27410852
NASA Astrophysics Data System (ADS)
Zurek, W. H.
2013-10-01
I show that random distributions of vortex-antivortex pairs (rather than of individual vortices) lead to scaling of typical winding numbers 𝒲 trapped inside a loop of circumference 𝒞 with the square root of that circumference, W\\sim \\sqrt{C}, when the expected winding numbers are large, |𝒲| ≫ 1. Such scaling is consistent with the Kibble-Zurek mechanism (KZM), with <𝒲2> inversely proportional to \\hat {\\xi }, the typical size of the domain that can break symmetry in unison. (The dependence of \\hat {\\xi } on quench rate is predicted by KZM from critical exponents of the phase transition.) Thus, according to KZM, the dispersion \\sqrt{\\langle {W}^{2}\\rangle } scales as \\sqrt{C/\\hat {\\xi }} for large 𝒲. By contrast, a distribution of individual vortices with randomly assigned topological charges would result in the dispersion scaling with the square root of the area inside 𝒞 (i.e., \\sqrt{\\langle {W}^{2}\\rangle }\\sim C). Scaling of the dispersion of 𝒲 as well as of the probability of detection of non-zero 𝒲 with 𝒞 and \\hat {\\xi } can be also studied for loops so small that non-zero windings are rare. In this case I show that dispersion varies not as 1/\\sqrt{\\hat {\\xi }}, but as 1/\\hat {\\xi }, which results in a doubling of the scaling of dispersion with the quench rate when compared to the large |𝒲| regime. Moreover, the probability of trapping of non-zero 𝒲 becomes approximately equal to <𝒲2>, and scales as 1/{\\hat {\\xi }}^{2}. This quadruples—as compared with \\sqrt{\\langle {W}^{2}\\rangle }\\simeq \\sqrt{C/\\hat {\\xi }} valid for large 𝒲—the exponent in the power law dependence of the frequency of trapping of |𝒲| = 1 on \\hat {\\xi } when the probability of |𝒲| > 1 is negligible. This change of the power law exponent by a factor of four—from 1/\\sqrt{\\hat {\\xi }} for the dispersion of large 𝒲 to 1/{\\hat
Zurek, W H
2013-10-01
I show that random distributions of vortex-antivortex pairs (rather than of individual vortices) lead to scaling of typical winding numbers W trapped inside a loop of circumference C with the square root of that circumference, W ≈√C, when the expected winding numbers are large, |W| ≫ 1. Such scaling is consistent with the Kibble-Zurek mechanism (KZM), with
Shimobaba, Tomoyoshi; Makowski, Michał; Nagahama, Yuki; Endo, Yutaka; Hirayama, Ryuji; Hiyama, Daisuke; Hasegawa, Satoki; Sano, Marie; Kakue, Takashi; Oikawa, Minoru; Sugie, Takashige; Takada, Naoki; Ito, Tomoyoshi
2016-05-20
We propose two calculation methods of generating color computer-generated holograms (CGHs) with the random phase-free method and color space conversion in order to improve the image quality and accelerate the calculation. The random phase-free method improves the image quality in monochrome CGH, but it is not performed in color CGH. We first aimed to improve the image quality of color CGH using the random phase-free method and then to accelerate the color CGH generation with a combination of the random phase-free method and color space conversion method, which accelerates the color CGH calculation due to down-sampling of the color components converted by color space conversion. To overcome the problem of image quality degradation that occurs due to the down-sampling of random phases, the combination of the random phase-free method and color space conversion method improves the quality of reconstructed images and accelerates the color CGH calculation. We demonstrated the effectiveness of the proposed method in simulation, and in this paper discuss its application to lensless zoomable holographic projection. PMID:27411145
ERIC Educational Resources Information Center
Gersten, Russell; Rolfhus, Eric; Clarke, Ben; Decker, Lauren E.; Wilkins, Chuck; Dimino, Joseph
2015-01-01
Replication studies are extremely rare in education. This randomized controlled trial (RCT) is a scale-up replication of Fuchs et al., which in a sample of 139 found a statistically significant positive impact for Number Rockets, a small-group intervention for at-risk first graders that focused on building understanding of number operations. The…
NASA Astrophysics Data System (ADS)
ajansen; kwhitefoot; panteltje1; edprochak; sudhakar, the
2014-07-01
In reply to the physicsworld.com news story “How to make a quantum random-number generator from a mobile phone” (16 May, http://ow.ly/xFiYc, see also p5), which describes a way of delivering random numbers by counting the number of photons that impinge on each of the individual pixels in the camera of a Nokia N9 smartphone.
Fuchs, Lynn S; Powell, Sarah R; Seethaler, Pamela M; Cirino, Paul T; Fletcher, Jack M; Fuchs, Douglas; Hamlett, Carol L; Zumeta, Rebecca O
2009-08-01
The purposes of this study were to assess the efficacy of remedial tutoring for 3rd graders with mathematics difficulty, to investigate whether tutoring is differentially efficacious depending on students' math difficulty status (mathematics difficulty alone vs. mathematics plus reading difficulty), to explore transfer from number combination (NC) remediation, and to examine the transportability of the tutoring protocols. At 2 sites, 133 students were stratified on mathematics difficulty status and site and then randomly assigned to 3 conditions: control (no tutoring), tutoring on automatic retrieval of NCs (i.e., Math Flash), or tutoring on word problems with attention to the foundational skills of NCs, procedural calculations, and algebra (i.e., Pirate Math). Tutoring occurred for 16 weeks, 3 sessions per week and 20-30 min per session. Math Flash enhanced fluency with NCs with transfer to procedural computation but without transfer to algebra or word problems. Pirate Math enhanced word problem skill as well as fluency with NCs, procedural computation, and algebra. Tutoring was not differentially efficacious as a function of students' mathematics difficulty status. The tutoring protocols proved transportable across sites. PMID:19865600
Microcomputer-controlled high-power low-frequency random-signal generator
Baishusin, B.M.; Galin, I.A.; Galishnikov, Y.P.; Voznyi, V.A.
1986-07-01
This paper describes a generator of high-power low-frequency random signals that is controlled by a microcomputer and realizes polygaussian expansions. The generator provides random as well as determined periodic or single signals of any shape with a power of up to 25 kW at frequencies of 0-200 Hz. A schematic diagram of the interface is shown. It consists of an Elektronika D3-28 microcomputer, an interface, a control-pulse generator, a thyristor switch unit, and a parallel voltage divider.
Heimel, J A; Coolen, A C
2001-05-01
We study the dynamics of the batch minority game, with random external information, using generating functional techniques introduced by De Dominicis. The relevant control parameter in this model is the ratio alpha=p/N of the number p of possible values for the external information over the number N of trading agents. In the limit N-->infinity we calculate the location alphac of the phase transition (signaling the onset of anomalous response), and solve the statics for alpha>alphac exactly. The temporal correlations in global market fluctuations turn out not to decay to zero for infinitely widely separated times. For alpha
Statistical analysis of sets of random walks: how to resolve their generating mechanism.
Coscoy, Sylvie; Huguet, Etienne; Amblard, François
2007-11-01
The analysis of experimental random walks aims at identifying the process(es) that generate(s) them. It is in general a difficult task, because statistical dispersion within an experimental set of random walks is a complex combination of the stochastic nature of the generating process, and the possibility to have more than one simple process. In this paper, we study by numerical simulations how the statistical distribution of various geometric descriptors such as the second, third and fourth order moments of two-dimensional random walks depends on the stochastic process that generates that set. From these observations, we derive a method to classify complex sets of random walks, and resolve the generating process(es) by the systematic comparison of experimental moment distributions with those numerically obtained for candidate processes. In particular, various processes such as Brownian diffusion combined with convection, noise, confinement, anisotropy, or intermittency, can be resolved by using high order moment distributions. In addition, finite-size effects are observed that are useful for treating short random walks. As an illustration, we describe how the present method can be used to study the motile behavior of epithelial microvilli. The present work should be of interest in biology for all possible types of single particle tracking experiments. PMID:17896161
NASA Astrophysics Data System (ADS)
Hao, Longjie; Min, Lequan
2014-06-01
Recently, a stream encryption scheme using d-bit segment sequences has been proposed. This scheme may generate key avalanche effect. The randomness tests of d-bit segment pseudorandom number generator will be important for implementing such a scheme. Firstly this paper extends Beker and Piper's binary pseudorandom sequence statistical test suite to d-bit segment sequences case. Secondly, a novel 3-dimensional polynomial discrete chaotic map (3DPDCM) is proposed. The calculated Lyapunov exponents of the 3DPCDM are 0.213, 0.125 and - 3.228. Using the 3DPDCM constructs a 6-dimensional generalized synchronization chaotic system. Based on this system, a 8-bit segment chaotic pseudorandom number generator (CPRNG) is introduced. Using the generalized test suite tests 100 key streams generated via the 8-bit PRNG with different initial conditions and perturbed system parameters. The tested results are similar to those of the key streams generated via RC4 PRNG. As an application, using the key streams generated via the CPRNG and the RC4 PRNG encrypts an RGB image Landscape. The results have shown that the encrypted RGB images have significant avalanche effects. This research suggests that the requirements for PRNGs are not as strict as those under the traditional avalanche criteria. Suitable designed chaos-based d-bit string PRNGs may be qualified candidates for the stream encryption scheme with avalanche effect.
Graphene based widely-tunable and singly-polarized pulse generation with random fiber lasers
Yao, B. C.; Rao, Y. J.; Wang, Z. N.; Wu, Y.; Zhou, J. H.; Wu, H.; Fan, M. Q.; Cao, X. L.; Zhang, W. L.; Chen, Y. F.; Li, Y. R.; Churkin, D.; Turitsyn, S.; Wong, C. W.
2015-01-01
Pulse generation often requires a stabilized cavity and its corresponding mode structure for initial phase-locking. Contrastingly, modeless cavity-free random lasers provide new possibilities for high quantum efficiency lasing that could potentially be widely tunable spectrally and temporally. Pulse generation in random lasers, however, has remained elusive since the discovery of modeless gain lasing. Here we report coherent pulse generation with modeless random lasers based on the unique polarization selectivity and broadband saturable absorption of monolayer graphene. Simultaneous temporal compression of cavity-free pulses are observed with such a polarization modulation, along with a broadly-tunable pulsewidth across two orders of magnitude down to 900 ps, a broadly-tunable repetition rate across three orders of magnitude up to 3 MHz, and a singly-polarized pulse train at 41 dB extinction ratio, about an order of magnitude larger than conventional pulsed fiber lasers. Moreover, our graphene-based pulse formation also demonstrates robust pulse-to-pulse stability and wide-wavelength operation due to the cavity-less feature. Such a graphene-based architecture not only provides a tunable pulsed random laser for fiber-optic sensing, speckle-free imaging, and laser-material processing, but also a new way for the non-random CW fiber lasers to generate widely tunable and singly-polarized pulses. PMID:26687730
Random walk of a swimmer in a low-Reynolds-number medium
NASA Astrophysics Data System (ADS)
Garcia, Michaël; Berti, Stefano; Peyla, Philippe; Rafaï, Salima
2011-03-01
Swimming at a micrometer scale demands particular strategies. When inertia is negligible compared to viscous forces, hydrodynamics equations are reversible in time. To achieve propulsion, microswimmers must therefore deform in a way that is not invariant under time reversal. Here, we investigate dispersal properties of the microalga Chlamydomonas reinhardtii by means of microscopy and cell tracking. We show that tracked trajectories are well modeled by a correlated random walk. This process is based on short time correlations in the direction of movement called persistence. At longer times, correlation is lost and a standard random walk characterizes the trajectories. Moreover, high-speed imaging enables us to show how the back-and-forth motion of flagella at very short times affects the statistical description of the dynamics. Finally, we show how drag forces modify the characteristics of this particular random walk.
Random fields generation on the GPU with the spectral turning bands method
NASA Astrophysics Data System (ADS)
Hunger, L.; Cosenza, B.; Kimeswenger, S.; Fahringer, T.
2014-08-01
Random field (RF) generation algorithms are of paramount importance for many scientific domains, such as astrophysics, geostatistics, computer graphics and many others. Some examples are the generation of initial conditions for cosmological simulations or hydrodynamical turbulence driving. In the latter a new random field is needed every time-step. Current approaches commonly make use of 3D FFT (Fast Fourier Transform) and require the whole generated field to be stored in memory. Moreover, they are limited to regular rectilinear meshes and need an extra processing step to support non-regular meshes. In this paper, we introduce TBARF (Turning BAnd Random Fields), a RF generation algorithm based on the turning band method that is optimized for massively parallel hardware such as GPUs. Our algorithm replaces the 3D FFT with a lower order, one-dimensional FFT followed by a projection step, and is further optimized with loop unrolling and blocking. We show that TBARF can easily generate RF on non-regular (non uniform) meshes and can afford mesh sizes bigger than the available GPU memory by using a streaming, out-of-core approach. TBARF is 2 to 5 times faster than the traditional methods when generating RFs with more than 16M cells. It can also generate RF on non-regular meshes, and has been successfully applied to two real case scenarios: planetary nebulae and cosmological simulations.
An Autonomous Mobile Robot Guided by a Chaotic True Random Bits Generator
NASA Astrophysics Data System (ADS)
Volos, Ch. K.; Kyprianidis, I. M.; Stouboulos, I. N.; Stavrinides, S. G.; Anagnostopoulos, A. N.
In this work a robot's controller, which ensures chaotic motion to an autonomous mobile robot, is presented. This new strategy, which is very useful in many robotic missions, generates an unpredictable trajectory by using a chaotic path planning generator. The proposed generator produces a trajectory, which is the result of a sequence of planned target locations. In contrary with other similar works, this one is based on a new chaotic true random bits generator, which has as a basic feature the coexistence of two different synchronization phenomena between mutually coupled identical nonlinear circuits. Simulation tests confirm that the whole robot's workplace is covered with unpredictable way in a very satisfactory time.
Towse, John Nicholas; Towse, Andrea Sarah; Saito, Satoru; Maehara, Yukio; Miyake, Akira
2016-01-01
Generating random number sequences is a popular psychological task often used to measure executive functioning. We explore random generation under “joint cognition” instructions; pairs of participants take turns to compile a shared response sequence. Across three studies, we point to six key findings from this novel format. First, there are both costs and benefits from group performance. Second, repetition avoidance occurs in dyadic as well as individual production settings. Third, individuals modify their choices in a dyadic situation such that the pair becomes the unit of psychological function. Fourth, there is immediate contagion of sequence stereotypy amongst the pairs (i.e., each contributor “owns” their partner’s response). Fifth, dyad effects occur even when participants know their partner is not interacting with them (Experiment 2). Sixth, ironically, directing participants’ efforts away from their shared task responsibility can actually benefit conjoint performance (Experiment 3). These results both constrain models of random generation and illuminate processes of joint cognition. PMID:26977923
Use of chaotic and random vibrations to generate high frequency test inputs
Gregory, D. L.; Paez, T. L.
1990-01-01
This paper and a companion paper show the traditional limits on amplitude and frequency that can be generated in a laboratory test on a vibration exciter can be substantially extended. This is accomplished by attaching a device to the shaker that permits controlled metal to metal impacts that generate high frequency, high acceleration environment on a test surface. A companion paper (Reference 1) shows that a sinusoidal or random shaker input can be used to generate a random vibration environment on the test surface. This paper derives the three response components that occur on the test surface due to an impact on the bottom surface and the base driven response from the shaker input. These response components are used to generate impulse response functions and frequency response functions which are used in the companion paper to derive power spectral density functions for the overall response. 9 refs., 8 figs.
Code to generate random identifiers and select QA/QC samples
Mehnert, Edward
1992-01-01
SAMPLID is a PC-based, FORTRAN-77 code which generates unique numbers for identification of samples, selection of QA/QC samples, and generation of labels. These procedures are tedious, but using a computer code such as SAMPLID can increase efficiency and reduce or eliminate errors and bias. The algorithm, used in SAMPLID, for generation of pseudorandom numbers is free of statistical flaws present in commonly available algorithms.
Odic, Darko; Halberda, Justin
2015-01-01
Humans can quickly and intuitively represent the number of objects in a scene using visual evidence through the Approximate Number System (ANS). But the computations that support the encoding of visual number—the transformation from the retinal input into ANS representations—remain controversial. Two types of number encoding theories have been proposed: those arguing that number is encoded through a dedicated, enumeration computation, and those arguing that visual number is inferred from nonnumber specific visual features, such as surface area, density, convex hull, etc. Here, we attempt to adjudicate between these two theories by testing participants on both a number and a cumulative area task while also tracking their eye-movements. We hypothesize that if approximate number and surface area depend on distinct encoding computations, saccadic signatures should be distinct for the two tasks, even if the visual stimuli are identical. Consistent with this hypothesis, we find that discriminating number versus cumulative area modulates both where participants look (i.e., participants spend more time looking at the more numerous set in the number task and the larger set in the cumulative area task), and how participants look (i.e., cumulative area encoding shows fewer, longer saccades, while number encoding shows many short saccades and many switches between targets). We further identify several saccadic signatures that are associated with task difficulty and correct versus incorrect trials for both dimensions. These results suggest distinct encoding algorithms for number and cumulative area extraction, and thereby distinct representations of these dimensions. PMID:26575191
Generating Random Parallel Test Forms Using CTT in a Computer-Based Environment.
ERIC Educational Resources Information Center
Weiner, John A.; Gibson, Wade M.
1998-01-01
Describes a procedure for automated-test-forms assembly based on Classical Test Theory (CTT). The procedure uses stratified random-content sampling and test-form preequating to ensure both content and psychometric equivalence in generating virtually unlimited parallel forms. Extends the usefulness of CTT in automated test construction. (Author/SLD)
Copy number variation of individual cattle genomes using next-generation sequencing
Technology Transfer Automated Retrieval System (TEKTRAN)
Copy number variations (CNVs) affect a wide range of phenotypic traits; however, CNVs in or near segmental duplication regions are often intractable. Using a read depth approach based on next-generation sequencing, we examined genome-wide copy number differences among five taurine (three Angus, one ...
Copy number variation of individual cattle genomes using next-generation sequencing
Technology Transfer Automated Retrieval System (TEKTRAN)
Copy Number Variations (CNVs) affect a wide range of phenotypic traits; however, CNVs in or near segmental duplication regions are often difficult to track. Using a read depth approach based on next generation sequencing, we examined genome-wide copy number differences among five taurine (three Angu...
Individualized cattle copy number and segmental duplication maps using next generation sequencing
Technology Transfer Automated Retrieval System (TEKTRAN)
Copy Number Variations (CNVs) affect a wide range of phenotypic traits; however, CNVs in or near segmental duplication regions are often intractable. Using a read depth approach based on next generation sequencing, we examined genome-wide copy number differences among five taurine (three Angus, one ...
Generating Variable and Random Schedules of Reinforcement Using Microsoft Excel Macros
ERIC Educational Resources Information Center
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.…
Spectral turning bands for efficient Gaussian random fields generation on GPUs and accelerators
NASA Astrophysics Data System (ADS)
Hunger, L.; Cosenza, B.; Kimeswenger, S.; Fahringer, T.
2015-11-01
A random field (RF) is a set of correlated random variables associated with different spatial locations. RF generation algorithms are of crucial importance for many scientific areas, such as astrophysics, geostatistics, computer graphics, and many others. Current approaches commonly make use of 3D fast Fourier transform (FFT), which does not scale well for RF bigger than the available memory; they are also limited to regular rectilinear meshes. We introduce random field generation with the turning band method (RAFT), an RF generation algorithm based on the turning band method that is optimized for massively parallel hardware such as GPUs and accelerators. Our algorithm replaces the 3D FFT with a lower-order, one-dimensional FFT followed by a projection step and is further optimized with loop unrolling and blocking. RAFT can easily generate RF on non-regular (non-uniform) meshes and efficiently produce fields with mesh sizes bigger than the available device memory by using a streaming, out-of-core approach. Our algorithm generates RF with the correct statistical behavior and is tested on a variety of modern hardware, such as NVIDIA Tesla, AMD FirePro and Intel Phi. RAFT is faster than the traditional methods on regular meshes and has been successfully applied to two real case scenarios: planetary nebulae and cosmological simulations.
Broadband second harmonic generation in an imperfect nonlinear photonic crystal with random defects
NASA Astrophysics Data System (ADS)
Ren, Kun; Liu, Yali; Ren, Xiaobin; Fan, Jingyang
2016-09-01
In this paper, we study broadband second harmonic generation (SHG) in an imperfect nonlinear photonic crystal in which defects are introduced with random lengths. We show that the efficient SHG output is obtained when the length of each defect varies near certain specialized values. The bandwidth of the SHG output broadens with the increasing randomness of defect length. Moreover, the SHG bandwidth is nearly unaffected only when the total length of the whole structure is long enough. The disordered structure also exhibits good tolerance to the fabrication error, which provides a way to control SHG intensity and bandwidth separately.
Dependent online kernel learning with constant number of random Fourier features.
Hu, Zhen; Lin, Ming; Zhang, Changshui
2015-10-01
Traditional online kernel learning analysis assumes independently identically distributed (i.i.d.) about the training sequence. Recent studies reveal that when the loss function is smooth and strongly convex, given T i.i.d. training instances, a constant sampling complexity of random Fourier features is sufficient to ensure O(logT/T) convergence rate of excess risk, which is optimal in online kernel learning up to a logT factor. However, the i.i.d. hypothesis is too strong in practice, which greatly impairs their value. In this paper, we study the sampling complexity of random Fourier features in online kernel learning under non-i.i.d. assumptions. We prove that the sampling complexity under non-i.i.d. settings is also constant, but the convergence rate of excess risk is O(logT/T+ ϕ) , where ϕ is the mixing coefficient measuring the extent of non-i.i.d. of training sequence. We conduct experiments both on artificial and real large-scale data sets to verify our theories. PMID:25616082
NASA Astrophysics Data System (ADS)
Tomita, Toshihiro; Miyaji, Kousuke
2016-04-01
The dependence of random telegraph noise (RTN) amplitude distribution on the number of traps and trap depth position is investigated using three-dimensional Monte Carlo device simulation including random dopant fluctuation (RDF) in a 30 nm NAND multi level flash memory. The ΔV th tail distribution becomes broad at fixed double traps, indicating that the number of traps greatly affects the worst RTN characteristics. It is also found that for both fixed single and fixed double traps, the ΔV th distribution in the lowest cell threshold voltage (V th) state shows the broadest distribution among all cell V th states. This is because the drain current flows at the channel surface in the lowest cell V th state, while at a high cell V th, it flows at the deeper position owing to the fringing coupling between the control gate (CG) and the channel. In this work, the ΔV th distribution with the number of traps following the Poisson distribution is also considered to cope with the variations in trap number. As a result, it is found that the number of traps is an important factor for understanding RTN characteristics. In addition, considering trap position in the tunnel oxide thickness direction is also an important factor.
Generation of photon-number squeezed states with a fiber-optic symmetric interferometer.
Hosaka, Aruto; Hirosawa, Kenichi; Sawada, Ryota; Kannari, Fumihiko
2015-07-27
We numerically and experimentally demonstrate photon-number squeezed state generation with a symmetric fiber interferometer in an 800-nm wavelength and compared with an asymmetric fiber interferometer, although photon-number squeezed pulses have been generated only with asymmetric interferometers. Even though we obtain -1.0dB squeezing with an asymmetric fiber interferometer, since perfect spectral phase and intensity matching between displacement and signal pulses are achieved with a symmetric fiber interferometer, we obtain better squeezing of -3.1dB. We also numerically calculate and clarify this scheme's usefulness at a 1.55-μm wavelength. PMID:26367549
On an acoustic field generated by subsonic jet at low Reynolds numbers
NASA Technical Reports Server (NTRS)
Yamamoto, K.; Arndt, R. E. A.
1978-01-01
An acoustic field generated by subsonic jets at low Reynolds numbers was investigated. This work is motivated by the need to increase the fundamental understanding of the jet noise generation mechanism which is essential to the development of further advanced techniques of noise suppression. The scope of this study consists of two major investigation. One is a study of large scale coherent structure in the jet turbulence, and the other is a study of the Reynolds number dependence of jet noise. With this in mind, extensive flow and acoustic measurements in low Reynolds number turbulent jets (8,930 less than or equal to M less than or equal to 220,000) were undertaken using miniature nozzles of the same configuration but different diameters at various exist Mach numbers (0.2 less than or equal to M less than or equal to 0.9).
Venkataraman, Narayan; Ulfarsson, Gudmundur F; Shankar, Venky N
2013-10-01
A nine-year (1999-2007) continuous panel of crash histories on interstates in Washington State, USA, was used to estimate random parameter negative binomial (RPNB) models for various aggregations of crashes. A total of 21 different models were assessed in terms of four ways to aggregate crashes, by: (a) severity, (b) number of vehicles involved, (c) crash type, and by (d) location characteristics. The models within these aggregations include specifications for all severities (property damage only, possible injury, evident injury, disabling injury, and fatality), number of vehicles involved (one-vehicle to five-or-more-vehicle), crash type (sideswipe, same direction, overturn, head-on, fixed object, rear-end, and other), and location types (urban interchange, rural interchange, urban non-interchange, rural non-interchange). A total of 1153 directional road segments comprising of the seven Washington State interstates were analyzed, yielding statistical models of crash frequency based on 10,377 observations. These results suggest that in general there was a significant improvement in log-likelihood when using RPNB compared to a fixed parameter negative binomial baseline model. Heterogeneity effects are most noticeable for lighting type, road curvature, and traffic volume (ADT). Median lighting or right-side lighting are linked to increased crash frequencies in many models for more than half of the road segments compared to both-sides lighting. Both-sides lighting thereby appears to generally lead to a safety improvement. Traffic volume has a random parameter but the effect is always toward increasing crash frequencies as expected. However that the effect is random shows that the effect of traffic volume on crash frequency is complex and varies by road segment. The number of lanes has a random parameter effect only in the interchange type models. The results show that road segment-specific insights into crash frequency occurrence can lead to improved design policy and
ERIC Educational Resources Information Center
Fuchs, Lynn S.; Powell, Sarah R.; Seethaler, Pamela M.; Cirino, Paul T.; Fletcher, Jack M.; Fuchs, Douglas; Hamlett, Carol L.; Zumeta, Rebecca O.
2009-01-01
The purposes of this study were to assess the efficacy of remedial tutoring for 3rd graders with mathematics difficulty, to investigate whether tutoring is differentially efficacious depending on students' math difficulty status (mathematics difficulty alone vs. mathematics plus reading difficulty), to explore transfer from number combination (NC)…
Device-independent randomness generation in the presence of weak cross-talk.
Silman, J; Pironio, S; Massar, S
2013-03-01
Device-independent protocols use nonlocality to certify that they are performing properly. This is achieved via Bell experiments on entangled quantum systems, which are kept isolated from one another during the measurements. However, with present-day technology, perfect isolation comes at the price of experimental complexity and extremely low data rates. Here we argue that for device-independent randomness generation--and other device-independent protocols where the devices are in the same lab--we can slightly relax the requirement of perfect isolation and still retain most of the advantages of the device-independent approach, by allowing a little cross-talk between the devices. This opens up the possibility of using existent experimental systems with high data rates, such as Josephson phase qubits on the same chip, thereby bringing device-independent randomness generation much closer to practical application. PMID:23521241
NASA Astrophysics Data System (ADS)
Beale, Paul
2015-03-01
We propose a new class of pseudorandom number generators based on Pohlig-Hellman exponentiation ciphers. The method generates uniform pseudorandom streams by encrypting simple sequences of short integer messages into ciphertexts by exponentiation modulo prime numbers. The advantages of the method are: the method is trivially parallelizable by parameterization with each pseudorandom number generator derived from an independent prime modulus, the method is fully scalable on massively parallel computing clusters due to the large number of primes available for each implementation, the seeding and initialization of the independent streams is simple, the method requires only a few integer multiply-mod operations per pseudorandom number, the state of each instance is defined by only a few integer values, the period of each instance is different, and the method passes a battery of intrastream and interstream correlation tests using up to 1013 pseudorandom numbers per test. We propose an implementation using 32-bit prime moduli with small exponents that require only a few 64-bit multiply-mod operations that can be executed directly in hardware. The 32-bit implementation we propose has millions of possible instances, all with periods greater than 1018. Supported by NSF CNS-082179.
Catalytic micromotor generating self-propelled regular motion through random fluctuation.
Yamamoto, Daigo; Mukai, Atsushi; Okita, Naoaki; Yoshikawa, Kenichi; Shioi, Akihisa
2013-07-21
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. PMID:23883050
Catalytic micromotor generating self-propelled regular motion through random fluctuation
NASA Astrophysics Data System (ADS)
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.
Liverseed, David R; Logan, Perry W; Johnson, Carl E; Morey, Sandy Z; Raynor, Peter C
2013-03-01
Conventional abrasive sanding generates high concentrations of particles. Depending on the substrate being abraded and exposure duration, overexposure to the particles can cause negative health effects ranging from respiratory irritation to cancer. The goal of this study was to understand the differences in particle emissions between a conventional random orbital sanding system and a self-generated vacuum random orbital sanding system with attached particle filtration bag. Particle concentrations were sampled for each system in a controlled test chamber for oak wood, chromate painted (hexavalent chromium) steel panels, and gel-coated (titanium dioxide) fiberglass panels using a Gesamtstaub-Probenahmesystem (GSP) sampler at three different locations adjacent to the sanding. Elevated concentrations were reported for all particles in the samples collected during conventional sanding. The geometric mean concentration ratios for the three substrates ranged from 320 to 4640 times greater for the conventional sanding system than the self-generated vacuum sanding system. The differences in the particle concentration generated by the two sanding systems were statistically significant with the two sample t-test (P < 0.0001) for all three substances. The data suggest that workers using conventional sanding systems could utilize the self-generated vacuum sanding system technology to potentially reduce exposure to particles and mitigate negative health effects. PMID:23065674
Liverseed, David R.
2013-01-01
Conventional abrasive sanding generates high concentrations of particles. Depending on the substrate being abraded and exposure duration, overexposure to the particles can cause negative health effects ranging from respiratory irritation to cancer. The goal of this study was to understand the differences in particle emissions between a conventional random orbital sanding system and a self-generated vacuum random orbital sanding system with attached particle filtration bag. Particle concentrations were sampled for each system in a controlled test chamber for oak wood, chromate painted (hexavalent chromium) steel panels, and gel-coated (titanium dioxide) fiberglass panels using a Gesamtstaub-Probenahmesystem (GSP) sampler at three different locations adjacent to the sanding. Elevated concentrations were reported for all particles in the samples collected during conventional sanding. The geometric mean concentration ratios for the three substrates ranged from 320 to 4640 times greater for the conventional sanding system than the self-generated vacuum sanding system. The differences in the particle concentration generated by the two sanding systems were statistically significant with the two sample t-test (P < 0.0001) for all three substances. The data suggest that workers using conventional sanding systems could utilize the self-generated vacuum sanding system technology to potentially reduce exposure to particles and mitigate negative health effects. PMID:23065674
Technology Transfer Automated Retrieval System (TEKTRAN)
Many species in temperate climates show latitudinal variation in life-cycle corresponding to synchronization with seasonal fluctuations in resources. In particular, insects often vary clinally in voltinism (the number of generations per year) which is determined by the timing of diapause terminatio...
Post-processing Free Quantum Random Number Generator Based on Avalanche Photodiode Array
NASA Astrophysics Data System (ADS)
Yang, Li; Sheng-Kai, Liao; Fu-Tian, Liang; Qi, Shen; Hao, Liang; Cheng-Zhi, Peng
2016-03-01
Not Available Supported by the Chinese Academy of Sciences Center for Excellence and Synergetic Innovation Center in Quantum Information and Quantum Physics, Shanghai Branch, University of Science and Technology of China, and the National Natural Science Foundation of China under Grant No 11405172.
Modeling natural gas prices as a random walk: The advantages for generation planning
Felder, F.A.
1995-11-01
Random walk modeling allows decision makers to evaluate risk mitigation strategies. Easily constructed, the random walk provides probability information that long-term fuel forecasts do not. This is vital to meeting the ratepayers` need for low-cost power, the shareholders` financial objectives, and the regulators` desire for straightforward information. Power generation planning depends heavily on long-term fuel price forecasts. This is particularly true for natural gas-fired plants, because fuel expenses are a significant portion of busbar costs and are subject to considerable uncertainty. Accurate forecasts, then, are critical - especially if electric utilities are to take advantage of the current low cost of natural gas technologies and their relatively clean burning characteristics, without becoming overdependent on a fuel that might significantly increase in price. Moreover, the transition to a more competitive generation market requires a more market-driven planning process. Current planning techniques use several long-term fuel forecasts - one serving as an expected case and others for sensitivity analysis - as inputs for modeling production costs. These forecasts are deterministic: For every time interval there is one, and only one projected fuel price - a serious limitation. Further, past natural gas price predictions have been erroneous and may be susceptible to bias. Today, deregulation of the natural gas production industry allows for a new approach in long-term fuel forecasting. Using NYMEX information, a random walk model of natural gas prices can be constructed. A random walk assumes that prices move randomly, and in modeling prices in this context one would be sure to include this all-important price volatility.
Marteau, T M; Saidi, G; Goodburn, S; Lawton, J; Michie, S; Bobrow, M
2000-09-01
The Objective of this study was to test the hypothesis that presenting risk information using numbers rather than words is a more effective way of communicating the residual risk inherent in a screen negative test result. We used a randomised controlled trial in a large UK teaching hospital. Two hundred and twenty pregnant women who received negative results on serum screening for Down syndrome participated. Presentation of screen negative test results were given either as a numerical probability (e.g. you have a 1:650 chance of having a baby with Down syndrome) or as a verbal probability (your chance of having a baby with Down syndrome is low). In both interventions the verbal anchor 'it is unlikely that your baby has Down syndrome' was used. Our aims were to measure the understanding of the residual risk in a screen negative result, and anxiety. Immediately after receipt of the results, 97% of those receiving their results in the form of a numerical probability and 91% of those receiving their results in the form of a verbal probability correctly understood that their baby probably did not have Down syndrome (95% CI for difference: 0% to 12%; p=0.04). All those who were incorrect believed that their baby definitely did not have Down syndrome. Subgroup analysis showed that this effect was confined to those with lower levels of education (i.e. those without a university degree), amongst whom understanding was poorer. There was no difference between intervention groups in understanding the results at four months. There were no differences between intervention groups in the levels of anxiety at one week or four months after receiving their results. In conclusion, communicating residual risks using numbers rather than words has a small beneficial effect of increasing awareness of residual risks without raising anxiety. Further work is needed to estimate the size of this effect in less well-informed and less highly educated populations. PMID:11015699
Dominguez-Juarez, J.L.; Kozyreff, G.; Martorell, Jordi
2011-01-01
Unmarked sensitive detection of molecules is needed in environmental pollution monitoring, disease diagnosis, security screening systems and in many other situations in which a substance must be identified. When molecules are attached or adsorbed onto an interface, detecting their presence is possible using second harmonic light generation, because at interfaces the inversion symmetry is broken. However, such light generation usually requires either dense matter or a large number of molecules combined with high-power laser sources. Here we show that using high-Q spherical microresonators and low average power, between 50 and 100 small non-fluorescent molecules deposited on the outer surface of the microresonator can generate a detectable change in the second harmonic light. This generation requires phase matching in the whispering gallery modes, which we achieved using a new procedure to periodically pattern, with nanometric precision, a molecular surface monolayer. PMID:21448153
Allele-specific copy number profiling by next-generation DNA sequencing.
Chen, Hao; Bell, John M; Zavala, Nicolas A; Ji, Hanlee P; Zhang, Nancy R
2015-02-27
The progression and clonal development of tumors often involve amplifications and deletions of genomic DNA. Estimation of allele-specific copy number, which quantifies the number of copies of each allele at each variant loci rather than the total number of chromosome copies, is an important step in the characterization of tumor genomes and the inference of their clonal history. We describe a new method, falcon, for finding somatic allele-specific copy number changes by next generation sequencing of tumors with matched normals. falcon is based on a change-point model on a bivariate mixed Binomial process, which explicitly models the copy numbers of the two chromosome haplotypes and corrects for local allele-specific coverage biases. By using the Binomial distribution rather than a normal approximation, falcon more effectively pools evidence from sites with low coverage. A modified Bayesian information criterion is used to guide model selection for determining the number of copy number events. Falcon is evaluated on in silico spike-in data and applied to the analysis of a pre-malignant colon tumor sample and late-stage colorectal adenocarcinoma from the same individual. The allele-specific copy number estimates obtained by falcon allows us to draw detailed conclusions regarding the clonal history of the individual's colon cancer. PMID:25477383
Thermodynamic method for generating random stress distributions on an earthquake fault
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.
NASA Technical Reports Server (NTRS)
Over, Thomas, M.; Gupta, Vijay K.
1994-01-01
Under the theory of independent and identically distributed random cascades, the probability distribution of the cascade generator determines the spatial and the ensemble properties of spatial rainfall. Three sets of radar-derived rainfall data in space and time are analyzed to estimate the probability distribution of the generator. A detailed comparison between instantaneous scans of spatial rainfall and simulated cascades using the scaling properties of the marginal moments is carried out. This comparison highlights important similarities and differences between the data and the random cascade theory. Differences are quantified and measured for the three datasets. Evidence is presented to show that the scaling properties of the rainfall can be captured to the first order by a random cascade with a single parameter. The dependence of this parameter on forcing by the large-scale meteorological conditions, as measured by the large-scale spatial average rain rate, is investigated for these three datasets. The data show that this dependence can be captured by a one-to-one function. Since the large-scale average rain rate can be diagnosed from the large-scale dynamics, this relationship demonstrates an important linkage between the large-scale atmospheric dynamics and the statistical cascade theory of mesoscale rainfall. Potential application of this research to parameterization of runoff from the land surface and regional flood frequency analysis is briefly discussed, and open problems for further research are presented.
Theory and generation of conditional, scalable sub-Gaussian random fields
NASA Astrophysics Data System (ADS)
Panzeri, M.; Riva, M.; Guadagnini, A.; Neuman, S. P.
2016-03-01
Many earth and environmental (as well as a host of other) variables, Y, and their spatial (or temporal) increments, ΔY, exhibit non-Gaussian statistical scaling. Previously we were able to capture key aspects of such non-Gaussian scaling by treating Y and/or ΔY as sub-Gaussian random fields (or processes). This however left unaddressed the empirical finding that whereas sample frequency distributions of Y tend to display relatively mild non-Gaussian peaks and tails, those of ΔY often reveal peaks that grow sharper and tails that become heavier with decreasing separation distance or lag. Recently we proposed a generalized sub-Gaussian model (GSG) which resolves this apparent inconsistency between the statistical scaling behaviors of observed variables and their increments. We presented an algorithm to generate unconditional random realizations of statistically isotropic or anisotropic GSG functions and illustrated it in two dimensions. Most importantly, we demonstrated the feasibility of estimating all parameters of a GSG model underlying a single realization of Y by analyzing jointly spatial moments of Y data and corresponding increments, ΔY. Here, we extend our GSG model to account for noisy measurements of Y at a discrete set of points in space (or time), present an algorithm to generate conditional realizations of corresponding isotropic or anisotropic random fields, introduce two approximate versions of this algorithm to reduce CPU time, and explore them on one and two-dimensional synthetic test cases.
Distributional regimes for the number of k-word matches between two random sequences
Lippert, Ross A.; Huang, Haiyan; Waterman, Michael S.
2002-01-01
When comparing two sequences, a natural approach is to count the number of k-letter words the two sequences have in common. No positional information is used in the count, but it has the virtue that the comparison time is linear with sequence length. For this reason this statistic D2 and certain transformations of D2 are used for EST sequence database searches. In this paper we begin the rigorous study of the statistical distribution of D2. Using an independence model of DNA sequences, we derive limiting distributions by means of the Stein and Chen–Stein methods and identify three asymptotic regimes, including compound Poisson and normal. The compound Poisson distribution arises when the word size k is large and word matches are rare. The normal distribution arises when the word size is small and matches are common. Explicit expressions for what is meant by large and small word sizes are given in the paper. However, when word size is small and the letters are uniformly distributed, the anticipated limiting normal distribution does not always occur. In this situation the uniform distribution provides the exception to other letter distributions. Therefore a naive, one distribution fits all, approach to D2 statistics could easily create serious errors in estimating significance. PMID:12374863
Topographic height dependence of internal wave generation by tidal flow over random topography
NASA Astrophysics Data System (ADS)
Zhao, Jiajun; Zhang, Likun; Swinney, Harry L.
2015-10-01
Internal waves (IWs) generated by tidal flow over the seafloor play a critical role in ocean circulation and climate. We determine the dependence of the radiated IW power on topographic parameters in numerical simulations of tidal flow over two-dimensional random topographic profiles that have the spectrum of oceanic abyssal hills. The IW power increases as the horizontal spatial resolution scale is decreased, but below a certain spatial scale the power saturates at a level less than the linear theory prediction. For increasing topographic RMS height Hrms the emergent interference of the tide and the IWs from different generation sites leads to a transition in the IW power dependence on Hrms from quadratic to linear. This transition in the scaling of the IW power depends on the slopes of a valley's nearest neighboring peaks. Our results should guide the modeling of IW generation by tidal flow over small-scale ocean topography.
A FORTRAN program for generation of multivariate normally distributed random variables
NASA Astrophysics Data System (ADS)
Ghosh, Amitava; Kulatilake, Pinnaduwa H. S. W.
The computer program given in this paper generates a set of values for each of the random variables which are distributed according to a multivariate normal distribution. It is written in FORTRAN 77 and is designed to run on a CYBER 175 computer. In generating a set of values, the program either can use actual data of the variables as input to estimate parameter values of the multivariate normal distribution or the parameter values of the multivariate normal distribution can be used directly as input to the program. The theory and the necessary algorithms for the generation are given in detail. Use of the program is illustrated through an example in soil engineering. Monte-Carlo simulation method is used for working out the example.
Yang, Xiuping; Min, Lequan; Wang, Xue
2015-05-01
This paper sets up a chaos criterion theorem on a kind of cubic polynomial discrete maps. Using this theorem, Zhou-Song's chaos criterion theorem on quadratic polynomial discrete maps and generalized synchronization (GS) theorem construct an eight-dimensional chaotic GS system. Numerical simulations have been carried out to verify the effectiveness of theoretical results. The chaotic GS system is used to design a chaos-based pseudorandom number generator (CPRNG). Using FIPS 140-2 test suit/Generalized FIPS 140-2, test suit tests the randomness of two 1000 key streams consisting of 20 000 bits generated by the CPRNG, respectively. The results show that there are 99.9%/98.5% key streams to have passed the FIPS 140-2 test suit/Generalized FIPS 140-2 test. Numerical simulations show that the different keystreams have an average 50.001% same codes. The key space of the CPRNG is larger than 2(1345). As an application of the CPRNG, this study gives an image encryption example. Experimental results show that the linear coefficients between the plaintext and the ciphertext and the decrypted ciphertexts via the 100 key streams with perturbed keys are less than 0.00428. The result suggests that the decrypted texts via the keystreams generated via perturbed keys of the CPRNG are almost completely independent on the original image text, and brute attacks are needed to break the cryptographic system. PMID:26026316
Yang, Xiuping Min, Lequan Wang, Xue
2015-05-15
This paper sets up a chaos criterion theorem on a kind of cubic polynomial discrete maps. Using this theorem, Zhou-Song's chaos criterion theorem on quadratic polynomial discrete maps and generalized synchronization (GS) theorem construct an eight-dimensional chaotic GS system. Numerical simulations have been carried out to verify the effectiveness of theoretical results. The chaotic GS system is used to design a chaos-based pseudorandom number generator (CPRNG). Using FIPS 140-2 test suit/Generalized FIPS 140-2, test suit tests the randomness of two 1000 key streams consisting of 20 000 bits generated by the CPRNG, respectively. The results show that there are 99.9%/98.5% key streams to have passed the FIPS 140-2 test suit/Generalized FIPS 140-2 test. Numerical simulations show that the different keystreams have an average 50.001% same codes. The key space of the CPRNG is larger than 2{sup 1345}. As an application of the CPRNG, this study gives an image encryption example. Experimental results show that the linear coefficients between the plaintext and the ciphertext and the decrypted ciphertexts via the 100 key streams with perturbed keys are less than 0.00428. The result suggests that the decrypted texts via the keystreams generated via perturbed keys of the CPRNG are almost completely independent on the original image text, and brute attacks are needed to break the cryptographic system.
NASA Astrophysics Data System (ADS)
Yang, Xiuping; Min, Lequan; Wang, Xue
2015-05-01
This paper sets up a chaos criterion theorem on a kind of cubic polynomial discrete maps. Using this theorem, Zhou-Song's chaos criterion theorem on quadratic polynomial discrete maps and generalized synchronization (GS) theorem construct an eight-dimensional chaotic GS system. Numerical simulations have been carried out to verify the effectiveness of theoretical results. The chaotic GS system is used to design a chaos-based pseudorandom number generator (CPRNG). Using FIPS 140-2 test suit/Generalized FIPS 140-2, test suit tests the randomness of two 1000 key streams consisting of 20 000 bits generated by the CPRNG, respectively. The results show that there are 99.9%/98.5% key streams to have passed the FIPS 140-2 test suit/Generalized FIPS 140-2 test. Numerical simulations show that the different keystreams have an average 50.001% same codes. The key space of the CPRNG is larger than 21345. As an application of the CPRNG, this study gives an image encryption example. Experimental results show that the linear coefficients between the plaintext and the ciphertext and the decrypted ciphertexts via the 100 key streams with perturbed keys are less than 0.00428. The result suggests that the decrypted texts via the keystreams generated via perturbed keys of the CPRNG are almost completely independent on the original image text, and brute attacks are needed to break the cryptographic system.
On the generation of log-Lévy distributions and extreme randomness
NASA Astrophysics Data System (ADS)
Eliazar, Iddo; Klafter, Joseph
2011-10-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 Lévy distributions. The log-Lévy distributions are the Lévy 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-Lévy 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.
NASA Astrophysics Data System (ADS)
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.
NASA Astrophysics Data System (ADS)
Das, Suman; Sadique Uz Zaman, J. K. M.; Ghosh, Ranjan
2014-12-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.
Photon-number entangled states generated in Kerr media with optical parametric pumping
Kowalewska-Kudlaszyk, A.; Leonski, W.; Perina, Jan Jr.
2011-05-15
Two nonlinear Kerr oscillators mutually coupled by parametric pumping are studied as a source of states entangled in photon numbers. Temporal evolution of entanglement quantified by negativity shows the effects of sudden death and birth of entanglement. Entanglement is preserved even in asymptotic states under certain conditions. The role of reservoirs at finite temperature in entanglement evolution is elucidated. Relation between generation of entangled states and violation of Cauchy-Schwartz inequality for oscillator intensities is found.
A random approach of test macro generation for early detection of hotspots
NASA Astrophysics Data System (ADS)
Lee, Jong-hyun; Kim, Chin; Kang, Minsoo; Hwang, Sungwook; Yang, Jae-seok; Harb, Mohammed; Al-Imam, Mohamed; Madkour, Kareem; ElManhawy, Wael; Kwan, Joe
2016-03-01
Multiple-Patterning Technology (MPT) is still the preferred choice over EUV for the advanced technology nodes, starting the 20nm node. Down the way to 7nm and 5nm nodes, Self-Aligned Multiple Patterning (SAMP) appears to be one of the effective multiple patterning techniques in terms of achieving small pitch of printed lines on wafer, yet its yield is in question. Predicting and enhancing the yield in the early stages of technology development are some of the main objectives for creating test macros on test masks. While conventional yield ramp techniques for a new technology node have relied on using designs from previous technology nodes as a starting point to identify patterns for Design of Experiment (DoE) creation, these techniques are challenging to apply in the case of introducing an MPT technique like SAMP that did not exist in previous nodes. This paper presents a new strategy for generating test structures based on random placement of unit patterns that can construct more meaningful bigger patterns. Specifications governing the relationships between those unit patterns can be adjusted to generate layout clips that look like realistic SAMP designs. A via chain can be constructed to connect the random DoE of SAMP structures through a routing layer to external pads for electrical measurement. These clips are decomposed according to the decomposition rules of the technology into the appropriate mandrel and cut masks. The decomposed clips can be tested through simulations, or electrically on silicon to discover hotspots. The hotspots can be used in optimizing the fabrication process and models to fix them. They can also be used as learning patterns for DFM deck development. By expanding the size of the randomly generated test structures, more hotspots can be detected. This should provide a faster way to enhance the yield of a new technology node.
Generation of a Superposition of Odd Photon Number States for Quantum Information Networks
NASA Astrophysics Data System (ADS)
Neergaard-Nielsen, J. S.; Nielsen, B. Melholt; Hettich, C.; Mølmer, K.; Polzik, E. S.
2006-08-01
We report on the experimental observation of quantum-network-compatible light described by a nonpositive Wigner function. The state is generated by photon subtraction from a squeezed vacuum state produced by a continuous wave optical parametric amplifier. Ideally, the state is a coherent superposition of odd photon number states, closely resembling a superposition of weak coherent states |α⟩-|-α⟩. In the limit of low squeezing the state is basically a single photon state. Light is generated with about 10 000 and more events per second in a nearly perfect spatial mode with a Fourier-limited frequency bandwidth which matches well atomic quantum memory requirements. The generated state of light is an excellent input state for testing quantum memories, quantum repeaters, and linear optics quantum computers.
NASA Astrophysics Data System (ADS)
Meshram, S. Gajbhiye; Sharma, S. K.; Tignath, S.
2015-10-01
Watershed is an ideal unit for planning and management of land and water resources (Gajbhiye et al., IEEE international conference on advances in technology and engineering (ICATE), Bombay, vol 1, issue 9, pp 23-25, 2013a; Gajbhiye et al., Appl Water Sci 4(1):51-61, 2014a; Gajbhiye et al., J Geol Soc India (SCI-IF 0.596) 84(2):192-196, 2014b). This study aims to generate the curve number, using remote sensing and geographical information system (GIS) and the effect of slope on curve number values. The study was carried out in Kanhaiya Nala watershed located in Satna district of Madhya Pradesh. Soil map, Land Use/Land cover and slope map were generated in GIS Environment. The CN parameter values corresponding to various soil, land cover, and land management conditions were selected from Natural Resource Conservation Service (NRCS) standard table. Curve number (CN) is an index developed by the NRCS, to represent the potential for storm water runoff within a drainage area. The CN for a drainage basin is estimated using a combination of land use, soil, and antecedent soil moisture condition (AMC). In present study effect of slope on CN values were determined. The result showed that the CN unadjusted value are higher in comparison to CN adjusted with slope. Remote sensing and GIS is very reliable technique for the preparation of most of the input data required by the SCS curve number model.
NASA Astrophysics Data System (ADS)
Galindo-Torres, S. A.; Muñoz, J. D.; Alonso-Marroquín, F.
2010-11-01
Minkowski operators (dilation and erosion of sets in vector spaces) have been extensively used in computer graphics, image processing to analyze the structure of materials, and more recently in molecular dynamics. Here, we apply those mathematical concepts to extend the discrete element method to simulate granular materials with complex-shaped particles. The Voronoi-Minkowski diagrams are introduced to generate random packings of complex-shaped particles with tunable particle roundness. Contact forces and potentials are calculated in terms of distances instead of overlaps. By using the Verlet method to detect neighborhood, we achieve CPU times that grow linearly with the body’s number of sides. Simulations of dissipative granular materials under shear demonstrate that the method maintains conservation of energy in accord with the first law of thermodynamics. A series of simulations for biaxial test, shear band formation, hysteretic behavior, and ratcheting show that the model can reproduce the main features of real granular-soil behavior.
Stochastic generation of explicit pore structures by thresholding Gaussian random fields
Hyman, Jeffrey D.; Winter, C. Larrabee
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.
NASA Astrophysics Data System (ADS)
Deneubourg, J. L.; Aron, S.; Goss, S.; Pasteels, J. M.; Duerinck, G.
1986-10-01
Two major types of foraging organisation in ants are described and compared, being illustrated with experimental data and mathematical models. The first concerns large colonies of identical, unspecialised foragers. The communication and interaction between foragers and their randomness generates collective and efficient structures. The second concerns small societies of deterministic and specialised foragers, rarely communicating together. The first organisation is discussed in relation to the different recruitment mechanisms, trail-following error, quality and degree of aggregation of food-sources, and territorial marking, and is the key to many types of collective behaviour in social insects. The second is discussed in relation to spatial specialisation, foraging density, individual learning and genetic programming. The two organisations may be associated in the same colony. The choice of organisation is discussed in relation to colony size and size and predictability of food sources.
Zieliński, Tomasz G
2015-04-01
This paper proposes and discusses an approach for the design and quality inspection of the morphology dedicated for sound absorbing foams, using a relatively simple technique for a random generation of periodic microstructures representative for open-cell foams with spherical pores. The design is controlled by a few parameters, namely, the total open porosity and the average pore size, as well as the standard deviation of pore size. These design parameters are set up exactly and independently, however, the setting of the standard deviation of pore sizes requires some number of pores in the representative volume element (RVE); this number is a procedure parameter. Another pore structure parameter which may be indirectly affected is the average size of windows linking the pores, however, it is in fact weakly controlled by the maximal pore-penetration factor, and moreover, it depends on the porosity and pore size. The proposed methodology for testing microstructure-designs of sound absorbing porous media applies the multi-scale modeling where some important transport parameters-responsible for sound propagation in a porous medium-are calculated from microstructure using the generated RVE, in order to estimate the sound velocity and absorption of such a designed material. PMID:25920832
Zhang, Guo-Qiang; Tao, Shiqiang; Xing, Guangming; Mozes, Jeno; Zonjy, Bilal; Lhatoo, Samden D
2015-01-01
Background 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. Objective 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. Methods 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 f 1, f 2, ..., f k. The input for each function f i has 3 components: a random number r, an integer n, and input data m. The result, f i(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 f 1(r 1, n 1, m 1), f 2(r 2, n 2, m 2), ..., f k(r k, n k, m k). In the second phase, the intermediate string generated in Phase 1 is encrypted
Stochastic generation of explicit pore structures by thresholding Gaussian random fields
NASA Astrophysics Data System (ADS)
Hyman, Jeffrey D.; Winter, C. Larrabee
2014-11-01
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.
A plane wave generation method by wave number domain point focusing.
Chang, Ji-Ho; Choi, Jung-Woo; Kim, Yang-Hann
2010-11-01
A method for generation of a wave-field that is a plane wave is described. This method uses an array of loudspeakers phased so that the field in the wave-number domain is nearly concentrated at a point, this point being at the wave-number vector of the desired plane wave. The method described here for such a wave-number concentration makes use of an expansion in spherical harmonics, and requires a relatively small number of measurement points for a good approximate achievement of a plane wave. The measurement points are on a spherical surface surrounding the array of loudspeakers. The input signals for the individual loudspeakers can be derived without a matrix inversion or without explicit assumptions about the loudspeakers. The mathematical development involves spherical harmonics and three-dimensional Fourier transforms. Some numerical examples are given, with various assumptions concerning the nature of the loudspeakers, that support the premise that the method described in the present paper may be useful in applications. PMID:21110571
de Manzano, Örjan; Ullén, Fredrik
2012-01-01
To what extent free response generation in different tasks uses common and task-specific neurocognitive processes has remained unclear. Here, we investigated overlap and differences in neural activity during musical improvisation and pseudo-random response generation. Brain activity was measured using fMRI in a group of professional classical pianists, who performed musical improvisation of melodies, pseudo-random key-presses and a baseline condition (sight-reading), on either two, six or twelve keys on a piano keyboard. The results revealed an extensive overlap in neural activity between the two generative conditions. Active regions included the dorsolateral and dorsomedial prefrontal cortices, inferior frontal gyrus, anterior cingulate cortex and pre-SMA. No regions showed higher activity in improvisation than in pseudo-random generation. These findings suggest that the activated regions fulfill generic functions that are utilized in different types of free generation tasks, independent of overall goal. In contrast, pseudo-random generation was accompanied by higher activity than improvisation in several regions. This presumably reflects the participants' musical expertise as well as the pseudo-random generation task's high load on attention, working memory, and executive control. The results highlight the significance of using naturalistic tasks to study human behavior and cognition. No brain activity was related to the size of the response set. We discuss that this may reflect that the musicians were able to use specific strategies for improvisation, by which there was no simple relationship between response set size and neural activity. PMID:21782960
Mohamed, Somaia; Rosenheck, Robert A; Lin, Haiqun; Swartz, Marvin; McEvoy, Joseph; Stroup, Scott
2015-07-01
No large-scale randomized trial has compared the effect of different second-generation antipsychotic drugs and any first-generation drug on alcohol, drug and nicotine use in patients with schizophrenia. The Clinical Antipsychotic Trial of Intervention Effectiveness study randomly assigned 1432 patients formally diagnosed with schizophrenia to four second-generation antipsychotic drugs (olanzapine, risperidone quetiapine, and ziprasidone) and one first-generation antipsychotic (perphenazine) and followed them for up to 18 months. Secondary outcome data documented cigarettes smoked in the past week and alcohol and drug use severity ratings. At baseline, 61% of patients smoked, 35% used alcohol, and 23% used illicit drugs. Although there were significant effects of time showing reduction in substance use over the 18 months (all p < 0.0001), this study found no evidence that any antipsychotic was robustly superior to any other in a secondary analysis of data on substance use outcomes from a large 18-month randomized schizophrenia trial. PMID:26075840
Generation of internal gravity waves by tidal flow over random oceanic topography
NASA Astrophysics Data System (ADS)
Zhao, Jiajun; Zhang, Likun; Swinney, Harry
2015-03-01
Internal waves (IWs) are gravity waves that propagate within density-stratified fluids such as the ocean, atmosphere, and protoplanetary disks. IWs generated by tidal flow over oceanic topography provide much of the energy needed to sustain vertical mixing, which plays a critical role in ocean circulation and global climate. Therefore, it is important to determine the amount of energy that is extracted from tidal flow over topography and radiated into IWs. We conduct 2D numerical simulations to determine the IW power generated by tidal flow over random topographies that have the seafloor spectrum. The power is found to saturate with increasing topographic roughness, and to scale linearly with the characteristic height of the topography. The linear dependence on the topographic height is, surprisingly, nearly independent of the value of the exponent characterizing the topographic spectrum. Our results should lead to improved predictions of the IW power generated by tidal flow over global ocean topography. Research supported by the Office of Naval Research and the Texas Advanced Computing Center. JZ is supported also by the President's Graduate Fellowship from the National University of Singapore.
Computer generated holograms of 3D objects with reduced number of projections
NASA Astrophysics Data System (ADS)
Huang, Su-juan; Liu, Dao-jin; Zhao, Jing-jing
2010-11-01
A new method for synthesizing computer-generated holograms of 3D objects has been proposed with reduced number of projections. According to the principles of paraboloid of revolution in 3D Fourier space, spectra information of 3D objects is gathered from projection images. We record a series of real projection images of 3D objects under incoherent white-light illumination by circular scanning method, and synthesize interpolated projection images by motion estimation and compensation between adjacent real projection images, then extract the spectra information of the 3D objects from all projection images in circle form. Because of quantization error, information extraction in two circles form is better than in single circle. Finally hologram is encoded based on computer-generated holography using a conjugate-symmetric extension. Our method significantly reduces the number of required real projections without increasing much of the computing time of the hologram and degrading the reconstructed image. Numerical reconstruction of the hologram shows good results.
NASA Astrophysics Data System (ADS)
Dasgupta, Sakyasingha; Nishikawa, Isao; Aihara, Kazuyuki; Toyoizumi, Taro
Source of cortical variability and its influence on signal processing remain an open question. We address the latter, by studying two types of balanced randomly connected networks of quadratic I-F neurons, with irregular spontaneous activity: (a) a deterministic network with strong connections generating noise by chaotic dynamics (b) a stochastic network with weak connections receiving noisy input. They are analytically tractable in the limit of large network-size and channel time-constant. Despite different sources of noise, spontaneous activity of these networks are identical unless majority of neurons are simultaneously recorded. However, the two networks show remarkably different sensitivity to external stimuli. In the former, input reverberates internally and can be read out over long time, but in the latter, inputs rapidly decay. This is further enhanced with activity-dependent plasticity at input synapses producing marked difference in decoding inputs from neural activity. We show, this leads to distinct performance of the two networks to integrate temporally separate signals from multiple sources, with the deterministic chaotic network activity serving as reservoir for Monte Carlo sampling to perform near optimal Bayesian integration, unlike its stochastic counterpart.
Generation of Large Numbers of Antigen-Expressing Human Dendritic Cells Using CD14-ML Technology
Imamura, Yuya; Haruta, Miwa; Tomita, Yusuke; Matsumura, Keiko; Ikeda, Tokunori; Yuno, Akira; Hirayama, Masatoshi; Nakayama, Hideki; Mizuta, Hiroshi; Nishimura, Yasuharu; Senju, Satoru
2016-01-01
We previously reported a method to expand human monocytes through lentivirus-mediated introduction of cMYC and BMI1, and we named the monocyte-derived proliferating cells, CD14-ML. CD14-ML differentiated into functional DC (CD14-ML-DC) upon addition of IL-4, resulting in the generation of a large number of DC. One drawback of this method was the extensive donor-dependent variation in proliferation efficiency. In the current study, we found that introduction of BCL2 or LYL1 along with cMYC and BMI1 was beneficial. Using the improved method, we obtained CD14-ML from all samples, regardless of whether the donors were healthy individuals or cancer patients. In vitro stimulation of peripheral blood T cells with CD14-ML-DC that were loaded with cancer antigen-derived peptides led to the establishment of CD4+ and CD8+ T cell lines that recognized the peptides. Since CD14-ML was propagated for more than 1 month, we could readily conduct genetic modification experiments. To generate CD14-ML-DC that expressed antigenic proteins, we introduced lentiviral antigen-expression vectors and subjected the cells to 2 weeks of culture for drug-selection and expansion. The resulting antigen-expressing CD14-ML-DC successfully induced CD8+ T cell lines that were reactive to CMVpp65 or MART1/MelanA, suggesting an application in vaccination therapy. Thus, this improved method enables the generation of a sufficient number of DC for vaccination therapy from a small amount of peripheral blood from cancer patients. Information on T cell epitopes is not necessary in vaccination with cancer antigen-expressing CD14-ML-DC; therefore, all patients, irrespective of HLA type, will benefit from anti-cancer therapy based on this technology. PMID:27050553
Design of Chaotic Pseudo-Random Bit Generator and its Applications in Stream-Cipher Cryptography
NASA Astrophysics Data System (ADS)
Wang, Xing-Yuan; Wang, Xiao-Juan
Because of the sensitivity of chaotic systems on initial conditions/control parameters, when chaotic systems are realized in a discrete space with finite states, the dynamical properties will be far different from the ones described by the continuous chaos theory, and some degradation will arise. This problem will cause the chaotic trajectory eventually periodic. In order to solve the problem, a new binary stream-cipher algorithm based on one-dimensional piecewise linear chaotic map is proposed in this paper. In the process of encryption and decryption, we employ a secret variant to perturb the chaotic trajectory and the control parameter to lengthen the cycle-length of chaotic trajectory. In addition, we design a nonlinear principle to generate a pseudo-random chaotic bit sequence as key stream. Cryptanalysis shows that the cryptosystem is of high security.
If the immune repertoire evolved to be large, random, and somatically generated, then...
Langman, Rodney E; Cohn, Melvin
2002-01-01
The evolution of the somatically generated random combining site repertoire of the "adaptive" immune system depended on the concurrent appearance of a somatic process that sorted the repertoire into anti-self and anti-nonself. Unlike the germline-selected sorting process characteristic of "innate" defense mechanisms, somatic sorting of the repertoire requires that antigens be classified based on their behavior, not on their physical or chemical properties. As specific recognitive combining sites (paratopes) define antigenic determinants (epitopes), the sorting of the repertoire operates epitope-by-epitope. By contrast, the coupling of the paratope to effector function must operate antigen-by-antigen because the response to each epitope on the antigen must be in the same effector class (i.e., coherent). This distinction resolves a long standing debate and provides a basis for analyzing the various models. PMID:12381346
Precise algorithm to generate random sequential addition of hard hyperspheres at saturation.
Zhang, G; Torquato, S
2013-11-01
The study of the packing of hard hyperspheres in d-dimensional Euclidean space R^{d} has been a topic of great interest in statistical mechanics and condensed matter theory. While the densest known packings are ordered in sufficiently low dimensions, it has been suggested that in sufficiently large dimensions, the densest packings might be disordered. The random sequential addition (RSA) time-dependent packing process, in which congruent hard hyperspheres are randomly and sequentially placed into a system without interparticle overlap, is a useful packing model to study disorder in high dimensions. Of particular interest is the infinite-time saturation limit in which the available space for another sphere tends to zero. However, the associated saturation density has been determined in all previous investigations by extrapolating the density results for nearly saturated configurations to the saturation limit, which necessarily introduces numerical uncertainties. We have refined an algorithm devised by us [S. Torquato, O. U. Uche, and F. H. Stillinger, Phys. Rev. E 74, 061308 (2006)] to generate RSA packings of identical hyperspheres. The improved algorithm produce such packings that are guaranteed to contain no available space in a large simulation box using finite computational time with heretofore unattained precision and across the widest range of dimensions (2≤d≤8). We have also calculated the packing and covering densities, pair correlation function g(2)(r), and structure factor S(k) of the saturated RSA configurations. As the space dimension increases, we find that pair correlations markedly diminish, consistent with a recently proposed "decorrelation" principle, and the degree of "hyperuniformity" (suppression of infinite-wavelength density fluctuations) increases. We have also calculated the void exclusion probability in order to compute the so-called quantizer error of the RSA packings, which is related to the second moment of inertia of the average
Precise algorithm to generate random sequential addition of hard hyperspheres at saturation
NASA Astrophysics Data System (ADS)
Zhang, G.; Torquato, S.
2013-11-01
The study of the packing of hard hyperspheres in d-dimensional Euclidean space Rd has been a topic of great interest in statistical mechanics and condensed matter theory. While the densest known packings are ordered in sufficiently low dimensions, it has been suggested that in sufficiently large dimensions, the densest packings might be disordered. The random sequential addition (RSA) time-dependent packing process, in which congruent hard hyperspheres are randomly and sequentially placed into a system without interparticle overlap, is a useful packing model to study disorder in high dimensions. Of particular interest is the infinite-time saturation limit in which the available space for another sphere tends to zero. However, the associated saturation density has been determined in all previous investigations by extrapolating the density results for nearly saturated configurations to the saturation limit, which necessarily introduces numerical uncertainties. We have refined an algorithm devised by us [S. Torquato, O. U. Uche, and F. H. Stillinger, Phys. Rev. EPLEEE81539-375510.1103/PhysRevE.74.061308 74, 061308 (2006)] to generate RSA packings of identical hyperspheres. The improved algorithm produce such packings that are guaranteed to contain no available space in a large simulation box using finite computational time with heretofore unattained precision and across the widest range of dimensions (2≤d≤8). We have also calculated the packing and covering densities, pair correlation function g2(r), and structure factor S(k) of the saturated RSA configurations. As the space dimension increases, we find that pair correlations markedly diminish, consistent with a recently proposed “decorrelation” principle, and the degree of “hyperuniformity” (suppression of infinite-wavelength density fluctuations) increases. We have also calculated the void exclusion probability in order to compute the so-called quantizer error of the RSA packings, which is related to the
Ischebeck, Anja; Heim, Stefan; Siedentopf, Christian; Zamarian, Laura; Schocke, Michael; Kremser, Christian; Egger, Karl; Strenge, Hans; Scheperjans, Filip; Delazer, Margarete
2008-08-01
Months, days of the week, and numbers differ from other verbal concepts because they are ordered in a sequence, whereas no order is imposed on members of other categories, such as animals or tools. Recent studies suggest that numbers activate a representation of their quantity within the intraparietal sulcus (IPS) automatically, that is, in tasks that do not require the processing of quantity. It is unclear, however, whether ordered verbal materials in general and not only numbers activate the IPS in such tasks. In the present functional magnetic resonance imaging study word generation of months, numbers, and animals were compared. Word generation of numbers and nonnumerical materials from an ordered category (months) activated the IPS more strongly than generating items from a not-ordered category such as animals or the verbal control conditions. An ROI analysis of three subregions within the anterior IPS revealed that the most anterior and lateral of these regions, human intraparietal area hIP2, shows a greater sensitivity to ordered materials than the other two areas, hIP1 and hIP3. Interestingly, no difference in activation was observed within the IPS between numbers and months suggesting that the activation of the IPS might not be modulated by the additional quantity information carried by numbers. PMID:17705220
NASA Astrophysics Data System (ADS)
Dutta, N. K.; Ma, S.; Chen, Z.
2009-06-01
Semiconductor optical amplifiers are important for wide range of applications including optical networks, optical tomography and optical logic systems. For many of these applications particularly for optical networks and optical logic high speed performance of the SOA is important. The speed of operation of SOA is limited by the gain and phase recovery times in the SOA. We have demonstrated higher speed operation (i) for SOAs with a carrier reservoir layer, (ii) for SOAs with a multi-quantum well modulation doped active region, and, (iii) for SOAs with a quantum dot (QD) active region. The multi-quantum well SOA has been integrated with InGaAsP/InP based waveguides to build Mach- Zehnder interferometers (MZI). XOR optical logic has been demonstrated at 80 Gb/s using these SOA-MZI structures. XOR operation has been analyzed by solving the rate equation of the SOA, for SOAs with both regular and QD active region. Mach-Zehnder interferometers fabricated using SOA with quantum dot active region (QD-SOA) can be used for XOR operation at 250 Gb/s. Pseudo random bit stream (PRBS) generation using both regular and QD-SOA have been studied and their performance modeled. The model shows QD-SOA based devices can be used to produce PRBS generators that operate near 250 Gb/s.
Çelik, Ö; Atak, Ç
2015-01-01
Salinity is one of the major problems limiting the yield of agricultural products. Radiation mutagenesis is used to improve salt-tolerant mutant plants. In this study, we aimed to improve salt-tolerant mutants of two oriental tobacco varieties. One thousand seeds of each variety (M₀) were irradiated with 100, 200, 300, and 400 Gy gamma rays by Cs-137 gamma. In the M₁ generation, 2999 single plants were harvested. The next season, these seeds were bulked and planted to obtain M₂ progeny. The seeds of 1900 M₂ plants were picked separately. Salinity tolerance was tested in the M₃ generation. Among M₃ plantlets, 10 salt-tolerant tobacco mutants were selected. According to the results of the selection studies, 100- and 200-Gy gamma radiation doses were the effective doses to obtain the desired mutants. Glutathione reductase enzyme activities of salt-tolerant tobacco mutants were determined biochemically as a stress-tolerance marker. The differences between control and salt-tolerant mutants belonging to the Akhisar 97 and İzmir Özbaş tobacco varieties were evaluated by random amplified polymorphic DNA analysis. The total polymorphism rate was 73.91%. PMID:25730072
Unstructured and adaptive mesh generation for high Reynolds number viscous flows
NASA Technical Reports Server (NTRS)
Mavriplis, Dimitri J.
1991-01-01
A method for generating and adaptively refining a highly stretched unstructured mesh suitable for the computation of high-Reynolds-number viscous flows about arbitrary two-dimensional geometries was developed. The method is based on the Delaunay triangulation of a predetermined set of points and employs a local mapping in order to achieve the high stretching rates required in the boundary-layer and wake regions. The initial mesh-point distribution is determined in a geometry-adaptive manner which clusters points in regions of high curvature and sharp corners. Adaptive mesh refinement is achieved by adding new points in regions of large flow gradients, and locally retriangulating; thus, obviating the need for global mesh regeneration. Initial and adapted meshes about complex multi-element airfoil geometries are shown and compressible flow solutions are computed on these meshes.
Levy, R C; Kozak, G M; Wadsworth, C B; Coates, B S; Dopman, E B
2015-01-01
Many temperate insects take advantage of longer growing seasons at lower latitudes by increasing their generation number or voltinism. In some insects, development time abruptly decreases when additional generations are fit into the season. Consequently, latitudinal 'sawtooth' clines associated with shifts in voltinism are seen for phenotypes correlated with development time, like body size. However, latitudinal variation in voltinism has not been linked to genetic variation at specific loci. Here, we show a pattern in allele frequency among voltinism ecotypes of the European corn borer moth (Ostrinia nubilalis) that is reminiscent of a sawtooth cline. We characterized 145 autosomal and sex-linked SNPs and found that period, a circadian gene that is genetically linked to a major QTL determining variation in post-diapause development time, shows cyclical variation between voltinism ecotypes. Allele frequencies at an unlinked circadian clock gene cryptochrome1 were correlated with period. These results suggest that selection on development time to 'fit' complete life cycles into a latitudinally varying growing season produces oscillations in alleles associated with voltinism, primarily through changes at loci underlying the duration of transitions between diapause and other life history phases. Correlations among clock loci suggest possible coupling between the circadian clock and the circannual rhythms for synchronizing seasonal life history. We anticipate that latitudinal oscillations in allele frequency will represent signatures of adaptation to seasonal environments in other insects and may be critical to understanding the ecological and evolutionary consequences of variable environments, including response to global climate change. PMID:25430782
Kowacs, Tanja; O'Reilly, Laura; Pan, Qing; Huijser, Annemarie; Lang, Philipp; Rau, Sven; Browne, Wesley R; Pryce, Mary T; Vos, Johannes G
2016-03-21
The photocatalytic generation of hydrogen (H2) from protons by two cyclometalated ruthenium-platinum polypyridyl complexes, [Ru(bpy)2(2,5-bpp)PtIS](2+) (1) and [Ru(dceb)2(2,5-bpp)PtIS](2+) (2) [where bpy = 2,2'-bipyridine, 2,5-bpp = 2,2',5',2″-terpyridine, dceb = 4,4'-di(carboxyethyl)bipyridine, and S = solvent], is reported. Turnover numbers (TONs) for H2 generation were increased by nearly an order of magnitude by the introduction of carboxyethyl ester units, i.e., from 80 for 1P to 650 for 2P after 6 h of irradiation, with an early turnover frequency (TOF) increasing from 15 to 200 h(-1). The TON and TOF values for 2P are among the highest reported to date for supramolecular photocatalysts. The increase correlates with stabilization of the excited states localized on the peripheral ligands of the light-harvesting Ru(II) center. PMID:26925834
The number distribution of neutrons and gammas generated in a multiplying sample
Enqvist, A.; Pozzi, S.; Pazsit, I.
2006-07-01
The subject of this paper is an analytical derivation of the full probability distribution of the number of neutrons and photons generated in a sample with internal multiplication by one internal source emission event, and its comparison with Monte Carlo calculations. We derive recursive analytic expressions for the probability distributions P(n) of neutrons and photons up to values of n for which P(n) is significant, as functions of the first collision probability p of the source neutrons. The derivation was performed by using the symbolic algebra code MATHEMATICA. With the introduction of a modified factorial moment of the number of fission neutrons and photons, the resulting expressions were brought to a formally equivalent form with those for the factorial moments of the searched probability distributions. The results were compared with Monte Carlo calculations, and excellent agreement was found between the analytical results and the simulations. The results show that the probability distributions change with increasing sample mass such that the 'bulk' of the distribution changes only slightly, but a tail develops for higher n values, which is the main reason for the increase of the factorial moments with increasing sample mass. (authors)
Implementation of 140 Gb/s true random bit generator based on a chaotic photonic integrated circuit.
Argyris, Apostolos; Deligiannidis, Stavros; Pikasis, Evangelos; Bogris, Adonis; Syvridis, Dimitris
2010-08-30
In the present work a photonic integrated circuit (PIC) that emits broadband chaotic signals is employed for ultra-fast generation of true random bit sequences. Chaotic dynamics emerge from a DFB laser, accompanied by a monolithic integrated 1-cm long external cavity (EC) that provides controllable optical feedback. The short length minimizes the existence of external cavity modes, so flattened broadband spectra with minimized intrinsic periodicities can emerge. After sampling and quantization--without including optical de-correlation techniques and using most significant bits (MSB) elimination post-processing--truly random bit streams with bit-rates as high as 140 Gb/s can be generated. Finally, the extreme robustness of the random bit generator for adaptive bit-rate operation and for various operating conditions of the PIC is demonstrated. PMID:20940769
A simulation of the measurement of electrical conductivity in randomly generated two-phase rocks.
NASA Astrophysics Data System (ADS)
Mandolesi, Eric; Moorkamp, Max; Jones, Alan G.
2014-05-01
Geological models of the subsurface require detailed data, often unavailable from direct observation or well logs. Hence imaging the subsurface relies on models obtained by interpretation of geophysical data. Several electromagnetic (EM) geophysical methods focus on the EM properties of rocks and sediments to determine a reliable image of the subsurface, while the same electromagnetic properties are directly measured in laboratories. Often these laboratory measurements return equivocal results that are difficult to reconcile with field observations. Recently different numerical approaches have been investigated in order to understand the effects of the geometry and continuity of interconnected pathways of conductors on EM field measurements, often restricting the studies to direct current (DC) sources. Bearing in mind the time-varying nature of the natural electromagnetic sources that play a role in field measurements, we numerically simulate the effects of such EM sources on the conductivity measured on the surface of a randomly generated three-dimensional body embedded in a uniform host by using electromagnetic induction equations, thus simulating a magnetotelluric (MT) survey. A key point in such a simulation is the scalability of the problem: the deeper the target, the longer the period of the EM source is needed. On the other hand, a long period signal ignores small heterogeneous conductors in the target bulk of the material, averaging the different conductivities in a median value. Since most real rocks are poor conductors, we have modeled a two-phase mixture of rock and interconnected conductive elements (representing melts, saline fluids, sulphidic, carbonitic, or metallic sediments, etc.), randomly generated within the background host. We have compared the results from the simulated measurements with the target rock embedded at different depths with electrical conductivity predicted by both Hashin-Shtrikman (HS) bounds and an updated multi-phase Archie
NASA Astrophysics Data System (ADS)
Carranza, Emmanuel John M.; Laborte, Alice G.
2015-01-01
Machine learning methods that have been used in data-driven predictive modeling of mineral prospectivity (e.g., artificial neural networks) invariably require large number of training prospect/locations and are unable to handle missing values in certain evidential data. The Random Forests (RF) algorithm, which is a machine learning method, has recently been applied to data-driven predictive mapping of mineral prospectivity, and so it is instructive to further study its efficacy in this particular field. This case study, carried out using data from Abra (Philippines), examines (a) if RF modeling can be used for data-driven modeling of mineral prospectivity in areas with a few (i.e., <20) mineral occurrences and (b) if RF modeling can handle evidential data with missing values. We found that RF modeling outperforms weights-of-evidence (WofE) modeling of porphyry-Cu prospectivity in the Abra area, where 12 porphyry-Cu prospects are known to exist. Moreover, just like WofE modeling, RF modeling allows analysis of the spatial associations of known prospects with individual layers of evidential data. Furthermore, RF modeling can handle missing values in evidential data through an RF-based imputation technique whereas in WofE modeling values are simply represented by zero weights. Therefore, the RF algorithm is potentially more useful than existing methods that are currently used for data-driven predictive mapping of mineral prospectivity. In particular, it is not a purely black-box method like artificial neural networks in the context of data-driven predictive modeling of mineral prospectivity. However, further testing of the method in other areas with a few mineral occurrences is needed to fully investigate its usefulness in data-driven predictive modeling of mineral prospectivity.
On the Formation Mechanisms of Artificially Generated High Reynolds Number Turbulent Boundary Layers
NASA Astrophysics Data System (ADS)
Rodríguez-López, Eduardo; Bruce, Paul J. K.; Buxton, Oliver R. H.
2016-08-01
We investigate the evolution of an artificially thick turbulent boundary layer generated by two families of small obstacles (divided into uniform and non-uniform wall normal distributions of blockage). One- and two-point velocity measurements using constant temperature anemometry show that the canonical behaviour of a boundary layer is recovered after an adaptation region downstream of the trips presenting 150~% higher momentum thickness (or equivalently, Reynolds number) than the natural case for the same downstream distance (x≈ 3 m). The effect of the degree of immersion of the trips for h/δ ≳ 1 is shown to play a secondary role. The one-point diagnostic quantities used to assess the degree of recovery of the canonical properties are the friction coefficient (representative of the inner motions), the shape factor and wake parameter (representative of the wake regions); they provide a severe test to be applied to artificially generated boundary layers. Simultaneous two-point velocity measurements of both spanwise and wall-normal correlations and the modulation of inner velocity by the outer structures show that there are two different formation mechanisms for the boundary layer. The trips with high aspect ratio and uniform distributed blockage leave the inner motions of the boundary layer relatively undisturbed, which subsequently drive the mixing of the obstacles' wake with the wall-bounded flow (wall-driven). In contrast, the low aspect-ratio trips with non-uniform blockage destroy the inner structures, which are then re-formed further downstream under the influence of the wake of the trips (wake-driven).
On the Formation Mechanisms of Artificially Generated High Reynolds Number Turbulent Boundary Layers
NASA Astrophysics Data System (ADS)
Rodríguez-López, Eduardo; Bruce, Paul J. K.; Buxton, Oliver R. H.
2016-03-01
We investigate the evolution of an artificially thick turbulent boundary layer generated by two families of small obstacles (divided into uniform and non-uniform wall normal distributions of blockage). One- and two-point velocity measurements using constant temperature anemometry show that the canonical behaviour of a boundary layer is recovered after an adaptation region downstream of the trips presenting 150~% higher momentum thickness (or equivalently, Reynolds number) than the natural case for the same downstream distance (x≈ 3 m). The effect of the degree of immersion of the trips for h/δ ≳ 1 is shown to play a secondary role. The one-point diagnostic quantities used to assess the degree of recovery of the canonical properties are the friction coefficient (representative of the inner motions), the shape factor and wake parameter (representative of the wake regions); they provide a severe test to be applied to artificially generated boundary layers. Simultaneous two-point velocity measurements of both spanwise and wall-normal correlations and the modulation of inner velocity by the outer structures show that there are two different formation mechanisms for the boundary layer. The trips with high aspect ratio and uniform distributed blockage leave the inner motions of the boundary layer relatively undisturbed, which subsequently drive the mixing of the obstacles' wake with the wall-bounded flow (wall-driven). In contrast, the low aspect-ratio trips with non-uniform blockage destroy the inner structures, which are then re-formed further downstream under the influence of the wake of the trips (wake-driven).
Using GIS to generate spatially balanced random survey designs for natural resource applications.
Theobald, David M; Stevens, Don L; White, Denis; Urquhart, N Scott; Olsen, Anthony R; Norman, John B
2007-07-01
Sampling of a population is frequently required to understand trends and patterns in natural resource management because financial and time constraints preclude a complete census. A rigorous probability-based survey design specifies where to sample so that inferences from the sample apply to the entire population. Probability survey designs should be used in natural resource and environmental management situations because they provide the mathematical foundation for statistical inference. Development of long-term monitoring designs demand survey designs that achieve statistical rigor and are efficient but remain flexible to inevitable logistical or practical constraints during field data collection. Here we describe an approach to probability-based survey design, called the Reversed Randomized Quadrant-Recursive Raster, based on the concept of spatially balanced sampling and implemented in a geographic information system. This provides environmental managers a practical tool to generate flexible and efficient survey designs for natural resource applications. Factors commonly used to modify sampling intensity, such as categories, gradients, or accessibility, can be readily incorporated into the spatially balanced sample design. PMID:17546523
A high-speed on-chip pseudo-random binary sequence generator for multi-tone phase calibration
NASA Astrophysics Data System (ADS)
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.
2014-01-01
Background Copy number variation (CNV), a source of genetic diversity in mammals, has been shown to underlie biological functions related to production traits. Notwithstanding, there have been few studies conducted on CNVs using next generation sequencing at the population level. Results Illumina NGS data was obtained for ten Holsteins, a dairy cattle, and 22 Hanwoo, a beef cattle. The sequence data for each of the 32 animals varied from 13.58-fold to almost 20-fold coverage. We detected a total of 6,811 deleted CNVs across the analyzed individuals (average length = 2732.2 bp) corresponding to 0.74% of the cattle genome (18.6 Mbp of variable sequence). By examining the overlap between CNV deletion regions and genes, we selected 30 genes with the highest deletion scores. These genes were found to be related to the nervous system, more specifically with nervous transmission, neuron motion, and neurogenesis. We regarded these genes as having been effected by the domestication process. Further analysis of the CNV genotyping information revealed 94 putative selected CNVs and 954 breed-specific CNVs. Conclusions This study provides useful information for assessing the impact of CNVs on cattle traits using NGS at the population level. PMID:24673797
NASA Astrophysics Data System (ADS)
Han, Dandan; Min, Lequan; Chen, Guanrong
Based on a stream encryption scheme with avalanche effect (SESAE), a stream encryption scheme with both key avalanche effect and plaintext avalanche effect (SESKPAE) is introduced. Using this scheme and an ideal 2d-word (d-segment) pseudorandom number generator (PRNG), a plaintext can be encrypted such that each bit of the ciphertext block has a change with the probable probability of (2d ‑ 1)/2d when any word of the key is changed or any bit of the plaintext is changed. To that end, a novel four-dimensional discrete chaotic system (4DDCS) is proposed. Combining the 4DDCS with a generalized synchronization (GS) theorem, a novel eight-dimensional discrete GS chaotic system (8DDGSCS) is constructed. Using the 8DDGSCS, a 216-word chaotic pseudorandom number generator (CPRNG) is designed. The keyspace of the 216-word CPRNG is larger than 21195. Then, the FIPS 140-2 test suit/generalized FIPS 140-2 test suit is used to test the randomness of the 1000-key streams consisting of 20000 bits generated by the 216-word CPRNG, the RC4 algorithm PRNG and the ZUC algorithm PRNG, respectively. The test results show that for the three PRNGs, there are 100%/98.9%, 99.9%/98.8%, 100%/97.9% key streams passing the tests, respectively. Furthermore, the SP800-22 test suite is used to test the randomness of four 100-key streams consisting of 1000000 bits generated by four PRNGs, respectively. The numerical results show that the randomness performances of the 216-word CPRNG is promising, showing that there are no significant correlations between the key streams and the perturbed key streams generated via the 216-word CPRNG. Finally, using the 216-word CPRNG and the SESKPAE to encrypt two gray-scale images, test results demonstrate that the 216-word CPRNG is able to generate both key avalanche effect and plaintext avalanche effect, which are similar to those generated via an ideal CPRNG, and performs better than other comparable schemes.
NASA Technical Reports Server (NTRS)
Wang, Charles C.; Pei, Dingyi
1990-01-01
A VLSI design for computing exponentiation in finite fields is developed. An algorithm to generate a relatively long pseudorandom number sequence is presented. It is shown that the period of this sequence is significantly increased compared to that of the sequence generated by the most commonly used maximal length shift register scheme.
Spectroscopy and implosion dynamics of low wire number nested arrays on the 1 MA COBRA generator
NASA Astrophysics Data System (ADS)
Safronova, A. S.; Kantsyrev, V. L.; Esaulov, A. A.; Ouart, N. D.; Yilmaz, M. F.; Williamson, K. M.; Shrestha, I.; Osborne, G. C.; Greenly, J. B.; Chandler, K. M.; McBride, R. D.; Chalenski, D. A.; Hammer, D. A.; Kusse, B. R.; LePell, P. D.
2008-03-01
Low wire number nested array Z-pinch experiments have been carried out with wires made of aluminum, stainless steel (uniform), and combinations of these two materials (mixed) on the 1MA COBRA generator at Cornell University [J. D. Douglass, J. B. Greenly, D. A. Hammer et al., in Proceedings of the 15th IEEE International Pulsed Power Conference (IEEE, Piscataway, NJ, 2005)]. The outer array consisted of eight wires, whereas the inner array had four or eight wires. The 10μm Al wires were alloy 5056 and the 6.25μm stainless steel wires were alloy SS304. The diagnostic suite included fast-x-ray and extreme ultraviolet (EUV) detectors, a time-gated x-ray pinhole camera, x-ray spectrometers, and laser shadow imaging. The main focus was made on the spectroscopic study of plasma evolution after the main x-ray burst though the data from photoconducting detector (PCD) and EUV signals over the whole period of current, and in addition laser shadowgraphy images before the main x-ray burst were analyzed. Modeling of the time-gated spectra recorded after the main x-ray burst indicates that the electron temperature Te either follows the PCD signals and peaks at times of the second (and the third if present) x-ray burst or has the higher value at the first frame (closest to the main x-ray burst), then slightly changes and increases at the last frame, which coincides with the second maximum of the current. It was also found that the values of Te never drop below 150eV, and the EUV signal remains intense even when the PCD signal is almost zero.
Spectroscopy and implosion dynamics of low wire number nested arrays on the 1 MA COBRA generator
Safronova, A. S.; Kantsyrev, V. L.; Esaulov, A. A.; Ouart, N. D.; Yilmaz, M. F.; Williamson, K. M.; Shrestha, I.; Osborne, G. C.; Greenly, J. B.; Chandler, K. M.; McBride, R. D.; Chalenski, D. A.; Hammer, D. A.; Kusse, B. R.; LePell, P. D.
2008-03-15
Low wire number nested array Z-pinch experiments have been carried out with wires made of aluminum, stainless steel (uniform), and combinations of these two materials (mixed) on the 1 MA COBRA generator at Cornell University [J. D. Douglass, J. B. Greenly, D. A. Hammer et al., in Proceedings of the 15th IEEE International Pulsed Power Conference (IEEE, Piscataway, NJ, 2005)]. The outer array consisted of eight wires, whereas the inner array had four or eight wires. The 10 {mu}m Al wires were alloy 5056 and the 6.25 {mu}m stainless steel wires were alloy SS304. The diagnostic suite included fast-x-ray and extreme ultraviolet (EUV) detectors, a time-gated x-ray pinhole camera, x-ray spectrometers, and laser shadow imaging. The main focus was made on the spectroscopic study of plasma evolution after the main x-ray burst though the data from photoconducting detector (PCD) and EUV signals over the whole period of current, and in addition laser shadowgraphy images before the main x-ray burst were analyzed. Modeling of the time-gated spectra recorded after the main x-ray burst indicates that the electron temperature Te either follows the PCD signals and peaks at times of the second (and the third if present) x-ray burst or has the higher value at the first frame (closest to the main x-ray burst), then slightly changes and increases at the last frame, which coincides with the second maximum of the current. It was also found that the values of Te never drop below 150 eV, and the EUV signal remains intense even when the PCD signal is almost zero.
Education in Chronically Poor Rural Areas Lags across Generations. Issue Brief Number 24
ERIC Educational Resources Information Center
Ulrich, Jessica D.
2011-01-01
As part of the Community and Environment in Rural America (CERA) initiative, the Carsey Institute has been investigating broad trends between rural community types, including the education level of residents and their parents. Since 2007, Carsey researchers have conducted over 17,000 telephone surveys with randomly selected adult Americans from…
NASA Astrophysics Data System (ADS)
Johansen, Stein E.
2014-12-01
The paper recapitulates some key elements in previously published results concerning exact and complete determination of prime numbers vs. composite numbers from a "negative" approach. This approach applies a certain "revolving chamber" to generate the set of composite numbers not having 2, 3 or 5 as factor, and by this indirectly to also deduce the complementary set of prime numbers larger than 5 as an exact, complete and non-trivial pattern. Since this approach is anchored in a certain geometric positioning of natural numbers, the paper will consider some possible implications for the more general relation between number theory and geometry, as well as more specifically in relation to hadronic mathematics, initiated by R.M. Santilli.
Srinivasa Rao, Mathukumalli; Swathi, Pettem; Rama Rao, Chitiprolu Anantha; Rao, K. V.; Raju, B. M. K.; Srinivas, Karlapudi; Manimanjari, Dammu; Maheswari, Mandapaka
2015-01-01
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. PMID:25671564
ArcCN-Runoff: An ArcGIS tool for generating curve number and runoff maps
Zhan, X.; Huang, M.-L.
2004-01-01
The development and the application of ArcCN-Runoff tool, an extension of ESRI@ ArcGIS software, are reported. This tool can be applied to determine curve numbers and to calculate runoff or infiltration for a rainfall event in a watershed. Implementation of GIS techniques such as dissolving, intersecting, and a curve-number reference table improve efficiency. Technical processing time may be reduced from days, if not weeks, to hours for producing spatially varied curve number and runoff maps. An application example for a watershed in Lyon County and Osage County, Kansas, USA, is presented. ?? 2004 Elsevier Ltd. All rights reserved.
ERIC Educational Resources Information Center
Green, Samuel B.; Levy, Roy; Thompson, Marilyn S.; Lu, Min; Lo, Wen-Juo
2012-01-01
A number of psychometricians have argued for the use of parallel analysis to determine the number of factors. However, parallel analysis must be viewed at best as a heuristic approach rather than a mathematically rigorous one. The authors suggest a revision to parallel analysis that could improve its accuracy. A Monte Carlo study is conducted to…
NASA Astrophysics Data System (ADS)
Siegel, Z.; Siegel, Edward Carl-Ludwig
2011-03-01
RANDOMNESS of Numbers cognitive-semantics DEFINITION VIA Cognition QUERY: WHAT???, NOT HOW?) VS. computer-``science" mindLESS number-crunching (Harrel-Sipser-...) algorithmics Goldreich "PSEUDO-randomness"[Not.AMS(02)] mea-culpa is ONLY via MAXWELL-BOLTZMANN CLASSICAL-STATISTICS(NOT FDQS!!!) "hot-plasma" REPULSION VERSUS Newcomb(1881)-Weyl(1914;1916)-Benford(1938) "NeWBe" logarithmic-law digit-CLUMPING/ CLUSTERING NON-Randomness simple Siegel[AMS Joint.Mtg.(02)-Abs. # 973-60-124] algebraic-inversion to THE QUANTUM and ONLY BEQS preferentially SEQUENTIALLY lower-DIGITS CLUMPING/CLUSTERING with d = 0 BEC, is ONLY VIA Siegel-Baez FUZZYICS=CATEGORYICS (SON OF TRIZ)/"Category-Semantics"(C-S), latter intersection/union of Lawvere(1964)-Siegel(1964)] category-theory (matrix: MORPHISMS V FUNCTORS) "+" cognitive-semantics'' (matrix: ANTONYMS V SYNONYMS) yields Siegel-Baez FUZZYICS=CATEGORYICS/C-S tabular list-format matrix truth-table analytics: MBCS RANDOMNESS TRUTH/EMET!!!
Using histograms to introduce randomization in the generation of ensembles of decision trees
Kamath, Chandrika; Cantu-Paz, Erick; Littau, David
2005-02-22
A system for decision tree ensembles that includes a module to read the data, a module to create a histogram, a module to evaluate a potential split according to some criterion using the histogram, a module to select a split point randomly in an interval around the best split, a module to split the data, and a module to combine multiple decision trees in ensembles. The decision tree method includes the steps of reading the data; creating a histogram; evaluating a potential split according to some criterion using the histogram, selecting a split point randomly in an interval around the best split, splitting the data, and combining multiple decision trees in ensembles.
Technical bases of the second generation SARIS core model (Task Number: 90-008-0)
Gregory, M.V.
1991-11-01
A methodology has been developed to rigorously derive the constants in the Savannah River Simulator (SARIS) core model from detailed, charge-design, diffusion theory solutions. This methodology is intended to replace the ill-defined, ad hoc iterative process used in the past to generate these constants. Along the development path, three shortcomings of the current core model were identified and corrected. The updated core model with revised constants is termed the second generation core model. In addition, changes in the decay heat and delayed neutron precursor models are also recommended, all in the interest of improving simulator neutronics fidelity.
NASA Astrophysics Data System (ADS)
Bewerunge, Jörg; Sengupta, Ankush; Capellmann, Ronja F.; Platten, Florian; Sengupta, Surajit; Egelhaaf, Stefan U.
2016-07-01
Colloidal particles were exposed to a random potential energy landscape that has been created optically via a speckle pattern. The mean particle density as well as the potential roughness, i.e., the disorder strength, were varied. The local probability density of the particles as well as its main characteristics were determined. For the first time, the disorder-averaged pair density correlation function g(1)(r) and an analogue of the Edwards-Anderson order parameter g(2)(r), which quantifies the correlation of the mean local density among disorder realisations, were measured experimentally and shown to be consistent with replica liquid state theory results.
Bewerunge, Jörg; Sengupta, Ankush; Capellmann, Ronja F; Platten, Florian; Sengupta, Surajit; Egelhaaf, Stefan U
2016-07-28
Colloidal particles were exposed to a random potential energy landscape that has been created optically via a speckle pattern. The mean particle density as well as the potential roughness, i.e., the disorder strength, were varied. The local probability density of the particles as well as its main characteristics were determined. For the first time, the disorder-averaged pair density correlation function g((1))(r) and an analogue of the Edwards-Anderson order parameter g((2))(r), which quantifies the correlation of the mean local density among disorder realisations, were measured experimentally and shown to be consistent with replica liquid state theory results. PMID:27475395
Reynolds number effects on the vortical-flow structure generated by a double-delta wing
NASA Astrophysics Data System (ADS)
Hebbar, S. K.; Platzer, M. F.; Fritzelas, A. E.
An experimental investigation of the high-incidence vortical flowfield over a 76/40° double-delta wing model with sharp leading edges was conducted in the Naval Postgraduate School water tunnel facility at three nominal flow Reynolds numbers of 15000, 45000, and 75000 (based on centerline chord). Extensive flow visualization studies were performed with the dye-injection technique, followed by laser Doppler velocity measurements. The primary objective of this investigation was the determination of the influence of Reynolds number on vortex interactions/trajectories, and breakdown. It was found that there is a significant influence of Reynolds number. Specifically, with the increase of flow Reynolds number the strake and wing vortex trajectories tend to move outboards and closer to the model surface, and the vortex breakdown location moves forwards toward the apex of the model. The intertwining or coiling-up feature of the vortex interaction phenomenon becomes less dominant and disappears altogether at high Reynolds numbers. These trends in the vortex interaction and bursting data are found to be in good agreement with previous wind tunnel data.
Elliptic grid generation with orthogonality and spacing control on an arbitrary number of boundaries
NASA Technical Reports Server (NTRS)
White, J. A.
1990-01-01
A procedure for the generation of two and quasi-three-dimensional grids with control of orthogonality and spacing with respect to any and/or all boundaries of the domain is described. The elliptic grid generation equations of Thompson are solved implicitly. Control of the grid behavior is achieved through the introduction of forcing functions terms in the manner of Steger and Sorenson or in a modification of the method of Hilgenstock. The forcing function terms are constructed on the boundaries and propagated into the domain using transfinite Lagrangian bivariate interpolation. An anisotropic transfinite stencil is introduced and is shown to produce excellent grid behavior particularly in the vicinity of corner singularities. Emphasis is placed on the generation of viscous grids and the method is shown to be suited for use in the generation of grids for internal as well as external flow geometries. A FORTRAN program named PISCES has been written to implement the algorithm. Examples of grids for internal and external flows are given that highlight the characteristics and behavior of the algorithm.
Generation of a two-center overlap integral over Slater orbitals of higher principal quantum numbers
NASA Technical Reports Server (NTRS)
Tai, H.
1992-01-01
The expressions for two-center overlap integrals between angular s, p, and d Slater orbitals of arbitrary, higher principal quantum number are explicitly listed. The expressions obtained are extremely compact and independent of the coordinate system. It is further shown that the numerical values of the integrals obtained in this way are free from any numerical instability.
Performance of a cascade in an annular vortex-generating tunnel over range of Reynolds numbers
NASA Technical Reports Server (NTRS)
Thurston, Sidney; Brunk, Ralph E
1951-01-01
Total-pressure deficiency for an annular cascade of 65-(12)10 blades was measured at three radial stations over a range of Reynolds numbers from 50,000 to 250,000 and at angles of attack of 15 degrees and 25 degrees. The variation of turning angle and shape of static pressure distribution at these stations is also shown.
ERIC Educational Resources Information Center
Earnest, Darrell Steven
2012-01-01
This dissertation explores fifth and eighth grade students' interpretations of three kinds of mathematical representations: number lines, the Cartesian plane, and graphs of linear functions. Two studies were conducted. In Study 1, I administered the paper-and-pencil Linear Representations Assessment (LRA) to examine students'…
Enhanced enstrophy generation for turbulent convection in low-Prandtl-number fluids
Schumacher, Jörg; Götzfried, Paul; Scheel, Janet D.
2015-01-01
Turbulent convection is often present in liquids with a kinematic viscosity much smaller than the diffusivity of the temperature. Here we reveal why these convection flows obey a much stronger level of fluid turbulence than those in which kinematic viscosity and thermal diffusivity are the same; i.e., the Prandtl number Pr is unity. We compare turbulent convection in air at Pr=0.7 and in liquid mercury at Pr=0.021. In this comparison the Prandtl number at constant Grashof number Gr is varied, rather than at constant Rayleigh number Ra as usually done. Our simulations demonstrate that the turbulent Kolmogorov-like cascade is extended both at the large- and small-scale ends with decreasing Pr. The kinetic energy injection into the flow takes place over the whole cascade range. In contrast to convection in air, the kinetic energy injection rate is particularly enhanced for liquid mercury for all scales larger than the characteristic width of thermal plumes. As a consequence, mean values and fluctuations of the local strain rates are increased, which in turn results in significantly enhanced enstrophy production by vortex stretching. The normalized distributions of enstrophy production in the bulk and the ratio of the principal strain rates are found to agree for both Prs. Despite the different energy injection mechanisms, the principal strain rates also agree with those in homogeneous isotropic turbulence conducted at the same Reynolds numbers as for the convection flows. Our results have thus interesting implications for small-scale turbulence modeling of liquid metal convection in astrophysical and technological applications. PMID:26195793
Enhanced enstrophy generation for turbulent convection in low-Prandtl-number fluids.
Schumacher, Jörg; Götzfried, Paul; Scheel, Janet D
2015-08-01
Turbulent convection is often present in liquids with a kinematic viscosity much smaller than the diffusivity of the temperature. Here we reveal why these convection flows obey a much stronger level of fluid turbulence than those in which kinematic viscosity and thermal diffusivity are the same; i.e., the Prandtl number Pr is unity. We compare turbulent convection in air at Pr=0.7 and in liquid mercury at Pr=0.021. In this comparison the Prandtl number at constant Grashof number Gr is varied, rather than at constant Rayleigh number Ra as usually done. Our simulations demonstrate that the turbulent Kolmogorov-like cascade is extended both at the large- and small-scale ends with decreasing Pr. The kinetic energy injection into the flow takes place over the whole cascade range. In contrast to convection in air, the kinetic energy injection rate is particularly enhanced for liquid mercury for all scales larger than the characteristic width of thermal plumes. As a consequence, mean values and fluctuations of the local strain rates are increased, which in turn results in significantly enhanced enstrophy production by vortex stretching. The normalized distributions of enstrophy production in the bulk and the ratio of the principal strain rates are found to agree for both Prs. Despite the different energy injection mechanisms, the principal strain rates also agree with those in homogeneous isotropic turbulence conducted at the same Reynolds numbers as for the convection flows. Our results have thus interesting implications for small-scale turbulence modeling of liquid metal convection in astrophysical and technological applications. PMID:26195793
Martinez, L C; Calzado, A
2016-01-01
A parametric model is used for the calculation of the CT number of some selected human tissues of known compositions (Hi) in two hybrid systems, one SPECT-CT and one PET-CT. Only one well characterized substance, not necessarily tissue-like, needs to be scanned with the protocol of interest. The linear attenuation coefficients of these tissues for some energies of interest (μ(i)) have been calculated from their tabulated compositions and the NIST databases. These coefficients have been compared with those calculated with the bilinear model from the CT number (μ(B)i). No relevant differences have been found for bones and lung. In the soft tissue region, the differences can be up to 5%. These discrepancies are attributed to the different chemical composition for the tissues assumed by both methods. PMID:26454019
Assessing copy number alterations in targeted, amplicon-based next-generation sequencing data.
Grasso, Catherine; Butler, Timothy; Rhodes, Katherine; Quist, Michael; Neff, Tanaya L; Moore, Stephen; Tomlins, Scott A; Reinig, Erica; Beadling, Carol; Andersen, Mark; Corless, Christopher L
2015-01-01
Changes in gene copy number are important in the setting of precision medicine. Recent studies have established that copy number alterations (CNAs) can be detected in sequencing libraries prepared by hybridization-capture, but there has been comparatively little attention given to CNA assessment in amplicon-based libraries prepared by PCR. In this study, we developed an algorithm for detecting CNAs in amplicon-based sequencing data. CNAs determined from the algorithm mirrored those from a hybridization-capture library. In addition, analysis of 14 pairs of matched normal and breast carcinoma tissues revealed that sequence data pooled from normal samples could be substituted for a matched normal tissue without affecting the detection of clinically relevant CNAs (>|2| copies). Comparison of CNAs identified by array comparative genomic hybridization and amplicon-based libraries across 10 breast carcinoma samples showed an excellent correlation. The CNA algorithm also compared favorably with fluorescence in situ hybridization, with agreement in 33 of 38 assessments across four different genes. Factors that influenced the detection of CNAs included the number of amplicons per gene, the average read depth, and, most important, the proportion of tumor within the sample. Our results show that CNAs can be identified in amplicon-based targeted sequencing data, and that their detection can be optimized by ensuring adequate tumor content and read coverage. PMID:25468433
NASA Astrophysics Data System (ADS)
Kaminsky, William; Lloyd, Seth
2006-03-01
We argue theoretically that adiabatic quantum computation using only polynomial resources can solve almost all members of a nontrivial randomly generated set of NP-complete problem instances, namely the problem of finding the ground states of spin glasses on 3D cubic lattices having independent, identically Gaussian-distributed couplings. The argument uses the droplet model of quantum spin glasses, particularly its prediction that the paramagnet-spin glass transition is unstable to even infinitesimal longitudinal fields. We then review the ongoing debate as to how well the droplet model describes 3D spin glasses and note that those inclined to view the intractability of NP-complete problems as a guiding physical intuition could take the results presented here as justifying greater suspicion toward the droplet model. Finally, due to this uncertainty as well as uncertainty in regard to the typical case classical complexity of this random NP-complete problem, we outline work using rigorous mean-field methods on a NP-complete problem whose typical-case classical complexity on random instances is better established, namely MAX CLIQUE on random graphs.
Plume generation in natural thermal convection at high Rayleigh and Prandtl numbers
NASA Astrophysics Data System (ADS)
Lithgow-Bertelloni, C.; Richards, M. A.; Conrad, C. P.; Griffiths, R. W.
2001-05-01
We study natural thermal convection of a fluid (corn syrup) with a large Prandtl number (103 107) and temperature-dependent viscosity. The experimental tank (1 × 1 × 0.3m) is heated from below with insulating top and side boundaries, so that the fluid experiences secular heating as experiments proceed. This setup allows a focused study of thermal plumes from the bottom boundary layer over a range of Rayleigh numbers relevant to convective plumes in the deep interior of the Earth's mantle. The effective value of Ra, based on the viscosity of the fluid at the interior temperature, varies from 105 at the beginning to almost 108 toward the end of the experiments. Thermals (plumes) from the lower boundary layer are trailed by continuous conduits with long residence times. Plumes dominate flow in the tank, although there is a weaker large-scale circulation induced by material cooling at the imperfectly insulating top and sidewalls. At large Ra convection is extremely time-dependent and exhibits episodic bursts of plumes, separated by periods of quiescence. This bursting behaviour probably results from the inability of the structure of the thermal boundary layer and its instabilities to keep pace with the rate of secular change in the value of Ra. The frequency of plumes increases and their size decreases with increasing Ra, and we characterize these changes via in situ thermocouple measurements, shadowgraph videos, and videos of liquid crystal films recorded during several experiments. A scaling analysis predicts observed changes in plume head and tail radii with increasing Ra. Since inertial effects are largely absent no transition to ‘hard’ thermal turbulence is observed, in contrast to a previous conclusion from numerical calculations at similar Rayleigh numbers. We suggest that bursting behaviour similar to that observed may occur in the Earth's mantle as it undergoes secular cooling on the billion-year time scale.
NASA Technical Reports Server (NTRS)
Motschmann, Uwe; Raeder, Joachim
1992-01-01
The behavior of minor ions just downstream of a low Mach number quasi-perpendicular shock is investigated both theoretically and by computer simulations. Because all ions see the same cross shock electric field their deceleration depends on their charge to mass ratio, yielding different downstream velocities. It is shown that these differences in velocity can lead to coherent wave structures in the downstream region of quasi-perpendicular shocks with a narrow transition layer. These waves are shown to be multi ion hybrid waves in contrast to mirror waves and ion cyclotron waves. Under favorable conditions these waves should be observable both at interplanetary shocks and at planetary bowshocks.
NASA Astrophysics Data System (ADS)
Kim, Ildoo; Wu, X. L.
2015-10-01
A structure-based Strouhal-Reynolds number relationship, St =1 /(A +B /Re ) , has been recently proposed based on observations of laminar vortex shedding from circular cylinders in a flowing soap film. Since the new St -Re relation was derived from a general physical consideration, it raises the possibility that it may be applicable to vortex shedding from bodies other than circular ones. The work presented herein provides experimental evidence that this is the case. Our measurements also show that, in the asymptotic limit (Re →∞ ), St∞=1 /A ≃0.21 is constant independent of rod shapes, leaving B the only parameter that is shape dependent.
Bardin, Jérémie; Rouget, Isabelle; Yacobucci, Margaret Mary; Cecca, Fabrizio
2014-08-01
Since the introduction of the cladistic method in systematics, continuous characters have been integrated into analyses but no methods for their treatment have received unanimous support. Some methods require a large number of character states to discretise continuous characters in order to keep the maximum level of information about taxa differences within the coding scheme. Our objective was to assess the impact of increasing the character state number on the outcomes of phylogenetic analyses. Analysis of a variety of simulated datasets shows that these methods for coding continuous characters can lead to the generation of well-resolved trees that do not reflect a phylogenetic signal. We call this phenomenon the flattening of the tree-length distribution; it is influenced by both the relative quantity of continuous characters in relation to discrete characters, and the number of characters in relation to the number of taxa. Bootstrap tests provide a method to avoid this potential bias. PMID:24148350
The limit of small Rossby numbers for randomly forced quasi-geostrophic equation on β-plane
NASA Astrophysics Data System (ADS)
Kuksin, Sergei; Maiocchi, Alberto
2015-07-01
We consider the 2d quasigeostrophic equation on the β-plane for the stream function ψ, with dissipation and a random force: Here \\psi=\\psi(t,x,y), x\\in{ R}/2π L{ Z}, y\\in { R}/2π { Z} . For typical values of the horizontal period L we prove that the law of the action-vector of a solution for (*) (formed by the halves of the squared norms of its complex Fourier coefficients) converges, as β → ∞, to the law of an action-vector for solution of an auxiliary effective equation, and the stationary distribution of the action-vector for solutions of (*) converges to that of the effective equation. Moreover, this convergence is uniform in κ ∈ (0, 1]. The effective equation is an infinite system of stochastic equations which splits into invariant subsystems of complex dimension ⩽3 each of these subsystems is an integrable hamiltonian system, coupled with a Langevin thermostat. Under the iterated limits limL=ρ→∞limβ→∞ and limκ→0limβ→∞ we get similar systems. In particular, none of the three limiting systems exhibits the energy cascade to high frequencies.
3,5,11 needles: looking for the perfect number of needles--a randomized and controlled study.
Ceccherelli, Francesco; Marino, Elena; Caliendo, Antonio; Dezzoni, Rossana; Roveri, Antonella; Gagliardi, Giuseppe
2014-01-01
Acupuncture has been successfully used in myofascial pain syndromes. However, the number of needles used, i.e. the "dose" of acupuncture stimulation, to obtain the best antinociceptive efficacy, is still a matter of debate. The question was addressed comparing the clinical efficacy of 3 different therapeutic schemes, mainly characterized by different numbers of needles used on 90 patients affected by a painful cervical myofascial syndrome. Patients were divided into 3 groups; the first group of 30 patients was treated with 11 needles, the second group of 30 patients was treated with 5 needles and the third group of 30 patients was treated with 3 needles. Each group underwent eight cycles of somatic acupuncture. In each session and in each group, all needles were stimulated until the pain tolerance threshold was reached; "pain tolerance is the amount of pain a person can handle without breaking down, either physically or emotionally". Pain intensity was evaluated before therapy, immediately after, and at 1 and 3 months follow-up by means of both the Mc Gill Pain Questionnaire and the Visual Analogue Scale (VAS). Pain and the repercussion of pain on the patient's quality of life (DOPE- Descriptors Of Pain Effects) were also measured using a test we developed, administered at each session. In all groups, needles were inserted superficially, except for the two most painful trigger points that were deeply inserted. All groups, independently from the number of needles used, obtained a good and significant therapeutic effect without clinically relevant differences among groups. For this pathology and patients of this kind, the number of needles, 3 or 5 or 11, seems not to be an important variable in determining the therapeutic effect. PMID:25693307
Generation of Tollmien-Schlichting waves by free-stream disturbances at low Mach numbers
NASA Technical Reports Server (NTRS)
Goldstein, M. E.
1983-01-01
The method of matched asymptotic expansions is used to study the generation of Tollmien-Schlichting waves by free stream disturbances incident on a flat plate boundary layer. Near the leading edge, the motion is governed by the unsteady boundary layer equation, while farther downstream it is governed (to lowest order) by the Orr-Sommerfeld equation with slowly varying coefficients. It is shown that there is an overlap domain where the Tollmien-Schlichting wave solutions to the Orr-Sommerfeld equation and an appropriate asymptotic solution of the unsteady boundary layer equation match, in the matched asymptotic expansion sense. The analysis leads to a set of scaling laws for the asymptotic structure of the unsteady boundary layer.
NASA Astrophysics Data System (ADS)
Eck, M.; Mukunda, M.
The proliferation of space vehicle launch sites and the projected utilization of these facilities portends an increase in the number of on-pad, ascent, and on-orbit solid-rocket motor (SRM) casings and liquid-rocket tanks which will randomly fail or will fail from range destruct actions. Beyond the obvious safety implications, these failures may have serious resource implications for mission system and facility planners. SRM-casing failures and liquid-rocket tankage failures result in the generation of large, high velocity fragments which may be serious threats to the safety of launch support personnel if proper bunkers and exclusion areas are not provided. In addition, these fragments may be indirect threats to the general public's safety if they encounter hazardous spacecraft payloads which have not been designed to withstand shrapnel of this caliber. They may also become threats to other spacecraft if, by failing on-orbit, they add to the ever increasing space-junk collision cross-section. Most prior attempts to assess the velocity of fragments from failed SRM casings have simply assigned the available chamber impulse to available casing and fuel mass and solved the resulting momentum balance for velocity. This method may predict a fragment velocity which is high or low by a factor of two depending on the ratio of fuel to casing mass extant at the time of failure. Recognizing the limitations of existing methods, the authors devised an analytical approach which properly partitions the available impulse to each major system-mass component. This approach uses the Physics International developed PISCES code to couple the forces generated by an Eulerian modeled gas flow field to a Lagrangian modeled fuel and casing system. The details of a predictive analytical modeling process as well as the development of normalized relations for momentum partition as a function of SRM burn time and initial geometry are discussed in this paper. Methods for applying similar modeling
Random recursive trees and the elephant random walk
NASA Astrophysics Data System (ADS)
Kürsten, Rüdiger
2016-03-01
One class of random walks with infinite memory, so-called elephant random walks, are simple models describing anomalous diffusion. We present a surprising connection between these models and bond percolation on random recursive trees. We use a coupling between the two models to translate results from elephant random walks to the percolation process. We calculate, besides other quantities, exact expressions for the first and the second moment of the root cluster size and of the number of nodes in child clusters of the first generation. We further introduce another model, the skew elephant random walk, and calculate the first and second moment of this process.
Generating arbitrary photon-number entangled states for continuous-variable quantum informatics.
Lee, Su-Yong; Park, Jiyong; Lee, Hai-Woong; Nha, Hyunchul
2012-06-18
We propose two experimental schemes that can produce an arbitrary photon-number entangled state (PNES) in a finite dimension. This class of entangled states naturally includes non-Gaussian continuous-variable (CV) states that may provide some practical advantages over the Gaussian counterparts (two-mode squeezed states). We particularly compare the entanglement characteristics of the Gaussian and the non-Gaussian states in view of the degree of entanglement and the Einstein-Podolsky-Rosen correlation, and further discuss their applications to the CV teleportation and the nonlocality test. The experimental imperfection due to the on-off photodetectors with nonideal efficiency is also considered in our analysis to show the feasibility of our schemes within existing technologies. PMID:22714485
Pseudo-Random Modulation of a Laser Diode for Generating Ultrasonic Longitudinal Waves
NASA Technical Reports Server (NTRS)
Madaras, Eric I.; Anatasi, Robert F.
2004-01-01
Laser generated ultrasound systems have historically been more complicated and expensive than conventional piezoelectric based systems, and this fact has relegated the acceptance of laser based systems to niche applications for which piezoelectric based systems are less suitable. Lowering system costs, while improving throughput, increasing ultrasound signal levels, and improving signal-to-noise are goals which will help increase the general acceptance of laser based ultrasound. One current limitation with conventional laser generated ultrasound is a material s damage threshold limit. Increasing the optical power to generate more signal eventually damages the material being tested due to rapid, high heating. Generation limitations for laser based ultrasound suggests the use of pulse modulation techniques as an alternate generation method. Pulse modulation techniques can spread the laser energy over time or space, thus reducing laser power densities and minimizing damage. Previous experiments by various organizations using spatial or temporal pulse modulation have been shown to generate detectable surface, plate, and bulk ultrasonic waves with narrow frequency bandwidths . Using narrow frequency bandwidths improved signal detectability, but required the use of expensive and powerful lasers and opto-electronic systems. The use of a laser diode to generate ultrasound is attractive because of its low cost, small size, light weight, simple optics and modulation capability. The use of pulse compression techniques should allow certain types of laser diodes to produce usable ultrasonic signals. The method also does not need to be limited to narrow frequency bandwidths. The method demonstrated here uses a low power laser diode (approximately 150 mW) that is modulated by controlling the diode s drive current and the resulting signal is recovered by cross correlation. A potential application for this system which is briefly demonstrated is in detecting signals in thick
Doyle, Orla; McGlanaghy, Edel; O’Farrelly, Christine; Tremblay, Richard E.
2016-01-01
This study examined the impact of a targeted Irish early intervention program on children’s emotional and behavioral development using multiple methods to test the robustness of the results. Data on 164 Preparing for Life participants who were randomly assigned into an intervention group, involving home visits from pregnancy onwards, or a control group, was used to test the impact of the intervention on Child Behavior Checklist scores at 24-months. Using inverse probability weighting to account for differential attrition, permutation testing to address small sample size, and quantile regression to characterize the distributional impact of the intervention, we found that the few treatment effects were largely concentrated among boys most at risk of developing emotional and behavioral problems. The average treatment effect identified a 13% reduction in the likelihood of falling into the borderline clinical threshold for Total Problems. The interaction and subgroup analysis found that this main effect was driven by boys. The distributional analysis identified a 10-point reduction in the Externalizing Problems score for boys at the 90th percentile. No effects were observed for girls or for the continuous measures of Total, Internalizing, and Externalizing problems. These findings suggest that the impact of this prenatally commencing home visiting program may be limited to boys experiencing the most difficulties. Further adoption of the statistical methods applied here may help to improve the internal validity of randomized controlled trials and contribute to the field of evaluation science more generally. Trial Registration: ISRCTN Registry ISRCTN04631728 PMID:27253184
Generation of Functional Fluorescent BK Channels by Random Insertion of GFP Variants
Giraldez, Teresa; Hughes, Thomas E.; Sigworth, Fred J.
2005-01-01
The yellow and cyan variants of green fluorescent protein (GFP) constitute an excellent pair for fluorescence resonance energy transfer (FRET) and can be used to study conformational rearrangements of proteins. Our aim was to develop a library of fluorescent large conductance voltage- and Ca2+-gated channels (BK or slo channels) for future use in FRET studies. We report the results of a random insertion of YFP and CFP into multiple sites of the α subunit of the hslo channel using a Tn5 transposon-based technique. 55 unique fluorescent fusion proteins were obtained and tested for cell surface expression and channel function. 19 constructs are expressed at the plasma membrane and show voltage and Ca2+-dependent currents. In 16 of them the voltage and Ca2+ dependence is very similar to the wild-type channel. Two insertions in the Ca2+ bowl and one in the RCK2 domain showed a strong shift in the G-V curve. The remaining 36 constructs were retained intracellularly; a solubility assay suggests that these proteins are not forming intracellular aggregates. The “success rate” of 19 out of 55 hslo insertion constructs compares very favorably with other studies of random GFP fusions. PMID:16260837
Characterizing the next-generation matrix and basic reproduction number in ecological epidemiology.
Roberts, M G; Heesterbeek, J A P
2013-03-01
We address the interaction of ecological processes, such as consumer-resource relationships and competition, and the epidemiology of infectious diseases spreading in ecosystems. Modelling such interactions seems essential to understand the dynamics of infectious agents in communities consisting of interacting host and non-host species. We show how the usual epidemiological next-generation matrix approach to characterize invasion into multi-host communities can be extended to calculate R₀, and how this relates to the ecological community matrix. We then present two simple examples to illustrate this approach. The first of these is a model of the rinderpest, wildebeest, grass interaction, where our inferred dynamics qualitatively matches the observed phenomena that occurred after the eradication of rinderpest from the Serengeti ecosystem in the 1980s. The second example is a prey-predator system, where both species are hosts of the same pathogen. It is shown that regions for the parameter values exist where the two host species are only able to coexist when the pathogen is present to mediate the ecological interaction. PMID:23086599
Eason, R. O.
1980-09-01
Many data acquisition systems incorporate high-speed scanners to convert analog signals into digital format for further processing. Some systems multiplex many channels into a single scanner. A random access scanner whose scan sequence is specified by a table in random access memory will permit different scan rates on different channels. Generation of this scan table can be a tedious manual task when there are many channels (e.g. 50), when there are more than a few scan rates (e.g. 5), and/or when the ratio of the highest scan rate to the lowest scan rate becomes large (e.g. 100:1). An algorithm is developed which will generate these scan sequences for the random access scanner and implements the algorithm on a digital computer. Application of number theory to the mathematical statement of the problem led to development of several algorithms which were implemented in FORTRAN. The most efficient of these algorithms operates by partitioning the problem into a set of subproblems. Through recursion they solve each subproblem by partitioning it repeatedly into even smaller parts, continuing until a set of simple problems is created. From this process, a pictorial representation or wheel diagram of the problem can be constructed. From the wheel diagram and a description of the original problem, a scan table can be constructed. In addition, the wheel diagram can be used as a method of storing the scan sequence in a smaller amount of memory. The most efficient partitioning algorithm solved most scan table problems in less than a second of CPU time. Some types of problems, however, required as much as a few minutes of CPU time. 26 figures, 2 tables.
Na, Giyoun; Wolfe, Andrew; Ko, CheMyong; Youn, Hyesook; Lee, Young-Min; Byun, Sung June; Jeon, Iksoo
2016-01-01
Bacterial Artificial Chromosome (BAC) clones are widely used for retrieving genomic DNA sequences for gene targeting. In this study, low-copy-number plasmids pBAC-FB, pBAC-FC, and pBAC-DE, which carry the F plasmid replicon, were generated from pBACe3.6. pBAC-FB was successfully used to retrieve a sequence of a BAC that was resistant to retrieval by a high-copy-number plasmid via λ Red-mediated recombineering (gap-repair cloning). This plasmid was also used to retrieve two other genes from BAC, indicating its general usability retrieving genes from BAC. The retrieved genes were manipulated in generating targeting vectors for gene knockouts by recombineering. The functionality of the targeting vector was further validated in a targeting experiment with C57BL/6 embryonic stem cells. The low-copy-number plasmid pBAC-FB is a plasmid of choice to retrieve toxic DNA sequences from BACs and to manipulate them to generate gene-targeting constructs by recombineering. PMID:22945876
Hox, Joop J.; Moerbeek, Mirjam; Kluytmans, Anouck; van de Schoot, Rens
2013-01-01
Cluster randomized trials assess the effect of an intervention that is carried out at the group or cluster level. Ajzen's theory of planned behavior is often used to model the effect of the intervention as an indirect effect mediated in turn by attitude, norms and behavioral intention. Structural equation modeling (SEM) is the technique of choice to estimate indirect effects and their significance. However, this is a large sample technique, and its application in a cluster randomized trial assumes a relatively large number of clusters. In practice, the number of clusters in these studies tends to be relatively small, e.g., much less than fifty. This study uses simulation methods to find the lowest number of clusters needed when multilevel SEM is used to estimate the indirect effect. Maximum likelihood estimation is compared to Bayesian analysis, with the central quality criteria being accuracy of the point estimate and the confidence interval. We also investigate the power of the test for the indirect effect. We conclude that Bayes estimation works well with much smaller cluster level sample sizes such as 20 cases than maximum likelihood estimation; although the bias is larger the coverage is much better. When only 5–10 clusters are available per treatment condition even with Bayesian estimation problems occur. PMID:24550881
Hox, Joop J; Moerbeek, Mirjam; Kluytmans, Anouck; van de Schoot, Rens
2014-01-01
Cluster randomized trials assess the effect of an intervention that is carried out at the group or cluster level. Ajzen's theory of planned behavior is often used to model the effect of the intervention as an indirect effect mediated in turn by attitude, norms and behavioral intention. Structural equation modeling (SEM) is the technique of choice to estimate indirect effects and their significance. However, this is a large sample technique, and its application in a cluster randomized trial assumes a relatively large number of clusters. In practice, the number of clusters in these studies tends to be relatively small, e.g., much less than fifty. This study uses simulation methods to find the lowest number of clusters needed when multilevel SEM is used to estimate the indirect effect. Maximum likelihood estimation is compared to Bayesian analysis, with the central quality criteria being accuracy of the point estimate and the confidence interval. We also investigate the power of the test for the indirect effect. We conclude that Bayes estimation works well with much smaller cluster level sample sizes such as 20 cases than maximum likelihood estimation; although the bias is larger the coverage is much better. When only 5-10 clusters are available per treatment condition even with Bayesian estimation problems occur. PMID:24550881
Analysis and Validation of Grid dem Generation Based on Gaussian Markov Random Field
NASA Astrophysics Data System (ADS)
Aguilar, F. J.; Aguilar, M. A.; Blanco, J. L.; Nemmaoui, A.; García Lorca, A. M.
2016-06-01
Digital Elevation Models (DEMs) are considered as one of the most relevant geospatial data to carry out land-cover and land-use classification. This work deals with the application of a mathematical framework based on a Gaussian Markov Random Field (GMRF) to interpolate grid DEMs from scattered elevation data. The performance of the GMRF interpolation model was tested on a set of LiDAR data (0.87 points/m2) provided by the Spanish Government (PNOA Programme) over a complex working area mainly covered by greenhouses in Almería, Spain. The original LiDAR data was decimated by randomly removing different fractions of the original points (from 10% to up to 99% of points removed). In every case, the remaining points (scattered observed points) were used to obtain a 1 m grid spacing GMRF-interpolated Digital Surface Model (DSM) whose accuracy was assessed by means of the set of previously extracted checkpoints. The GMRF accuracy results were compared with those provided by the widely known Triangulation with Linear Interpolation (TLI). Finally, the GMRF method was applied to a real-world case consisting of filling the LiDAR-derived DSM gaps after manually filtering out non-ground points to obtain a Digital Terrain Model (DTM). Regarding accuracy, both GMRF and TLI produced visually pleasing and similar results in terms of vertical accuracy. As an added bonus, the GMRF mathematical framework makes possible to both retrieve the estimated uncertainty for every interpolated elevation point (the DEM uncertainty) and include break lines or terrain discontinuities between adjacent cells to produce higher quality DTMs.
ERIC Educational Resources Information Center
Lawrence, Joshua F.; Crosson, Amy C.; Paré-Blagoev, E. Juliana; Snow, Catherine E.
2015-01-01
Classroom discussion, despite its association with good academic outcomes, is exceedingly rare in U.S. schools. The Word Generation intervention involves the provision of texts and activities to be implemented across content area class, organized around engaging and discussable dilemmas. The program was evaluated with 1,554 middle grade students…
Akbarzade, Marzieh; Rafiee, Bahare; Asadi, Nasrin; Zare, Najaf
2015-01-01
Background: Relaxation-training, as an anxiety-reducer intervention, plays an important role in fetal health. The present study aimed to analyze the effect of maternal relaxation on stress test (NST), basal fetal heart rate, and number of fetal heart accelerations. Methods: In this randomized controlled trial, 84 pregnant women were randomly divided into two groups of teaching relaxation and control groups in 2012. In the intervention group, 60-90 minute classes were held every week lasting for 4 weeks. Besides, home practice charts were given to the mothers and researchers controlled the home practices by phone calls every week. The control group received routine prenatal care. In the 4th week, NST was performed in the intervention group 30 minutes before and after the 4th session. In the control group, NST was done in the 4th week. The quantitative variables in the two groups were compared through ANOVA and Chi-square test. Results: The results of paired t-test showed that relaxation could improve the NST results (P=0.01). Mean and standard deviation of basal fetal heart rate was 138.95±8.18 before the intervention and 133.07±6.9 after the intervention. Paired t-test also showed that relaxation reduced the basal fetal heart rate (P=0.001). Mean and standard deviation of the number of fetal heart accelerations was 1.5±0.8 before the intervention and 2.2±0.9 after it. The results of paired t-test also showed that relaxation increased the number of fetal heart accelerations (P=0.001). Conclusions: Relaxation could improve the NST results, reduce the basal fetal heart rate, and increase the number of fetal heart accelerations. Therefore, relaxation is recommended during pregnancy. Trial Registration Number: IRCT2012072810418N1 PMID:25553334
2013-01-01
Copy number variation (CNV) is a prevalent form of critical genetic variation that leads to an abnormal number of copies of large genomic regions in a cell. Microarray-based comparative genome hybridization (arrayCGH) or genotyping arrays have been standard technologies to detect large regions subject to copy number changes in genomes until most recently high-resolution sequence data can be analyzed by next-generation sequencing (NGS). During the last several years, NGS-based analysis has been widely applied to identify CNVs in both healthy and diseased individuals. Correspondingly, the strong demand for NGS-based CNV analyses has fuelled development of numerous computational methods and tools for CNV detection. In this article, we review the recent advances in computational methods pertaining to CNV detection using whole genome and whole exome sequencing data. Additionally, we discuss their strengths and weaknesses and suggest directions for future development. PMID:24564169
Autonomous Byte Stream Randomizer
NASA Technical Reports Server (NTRS)
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.
Zhang, Guang-He; Poon, Carmen C Y; Zhang, Yuan-Ting
2012-01-01
Wireless body sensor network (WBSN), a key building block for m-Health, demands extremely stringent resource constraints and thus lightweight security methods are preferred. To minimize resource consumption, utilizing information already available to a WBSN, particularly common to different sensor nodes of a WBSN, for security purposes becomes an attractive solution. In this paper, we tested the randomness and distinctiveness of the 128-bit biometric binary sequences (BSs) generated from interpulse intervals (IPIs) of 20 healthy subjects as well as 30 patients suffered from myocardial infarction and 34 subjects with other cardiovascular diseases. The encoding time of a biometric BS on a WBSN node is on average 23 ms and memory occupation is 204 bytes for any given IPI sequence. The results from five U.S. National Institute of Standards and Technology statistical tests suggest that random biometric BSs can be generated from both healthy subjects and cardiovascular patients and can potentially be used as authentication identifiers for securing WBSNs. Ultimately, it is preferred that these biometric BSs can be used as encryption keys such that key distribution over the WBSN can be avoided. PMID:22049370
Control logic to track the outputs of a command generator or randomly forced target
NASA Technical Reports Server (NTRS)
Trankle, T. L.; Bryson, A. E., Jr.
1977-01-01
A procedure is presented for synthesizing time-invariant control logic to cause the outputs of a linear plant to track the outputs of an unforced (or randomly forced) linear dynamic system. The control logic uses feed-forward of the reference system state variables and feedback of the plant state variables. The feed-forward gains are obtained from the solution of a linear algebraic matrix equation of the Liapunov type. The feedback gains are the usual regulator gains, determined to stabilize (or augment the stability of) the plant, possibly including integral control. The method is applied here to the design of control logic for a second-order servomechanism to follow a linearly increasing (ramp) signal, an unstable third-order system with two controls to track two separate ramp signals, and a sixth-order system with two controls to track a constant signal and an exponentially decreasing signal (aircraft landing-flare or glide-slope-capture with constant velocity).
2016-01-01
Current methods for distinguishing acute coronary syndromes such as heart attack from stable coronary artery disease, based on the kinetics of thrombin formation, have been limited to evaluating sensitivity of well-established chemical species (e.g., thrombin) using simple quantifiers of their concentration profiles (e.g., maximum level of thrombin concentration, area under the thrombin concentration versus time curve). In order to get an improved classifier, we use a 34-protein factor clotting cascade model and convert the simulation data into a high-dimensional representation (about 19000 features) using a piecewise cubic polynomial fit. Then, we systematically find plausible assays to effectively gauge changes in acute coronary syndrome/coronary artery disease populations by introducing a statistical learning technique called Random Forests. We find that differences associated with acute coronary syndromes emerge in combinations of a handful of features. For instance, concentrations of 3 chemical species, namely, active alpha-thrombin, tissue factor-factor VIIa-factor Xa ternary complex, and intrinsic tenase complex with factor X, at specific time windows, could be used to classify acute coronary syndromes to an accuracy of about 87.2%. Such a combination could be used to efficiently assay the coagulation system. PMID:27171403
Arumugam, Jayavel; Bukkapatnam, Satish T S; Narayanan, Krishna R; Srinivasa, Arun R
2016-01-01
Current methods for distinguishing acute coronary syndromes such as heart attack from stable coronary artery disease, based on the kinetics of thrombin formation, have been limited to evaluating sensitivity of well-established chemical species (e.g., thrombin) using simple quantifiers of their concentration profiles (e.g., maximum level of thrombin concentration, area under the thrombin concentration versus time curve). In order to get an improved classifier, we use a 34-protein factor clotting cascade model and convert the simulation data into a high-dimensional representation (about 19000 features) using a piecewise cubic polynomial fit. Then, we systematically find plausible assays to effectively gauge changes in acute coronary syndrome/coronary artery disease populations by introducing a statistical learning technique called Random Forests. We find that differences associated with acute coronary syndromes emerge in combinations of a handful of features. For instance, concentrations of 3 chemical species, namely, active alpha-thrombin, tissue factor-factor VIIa-factor Xa ternary complex, and intrinsic tenase complex with factor X, at specific time windows, could be used to classify acute coronary syndromes to an accuracy of about 87.2%. Such a combination could be used to efficiently assay the coagulation system. PMID:27171403
NASA Astrophysics Data System (ADS)
Vibert, Jean-Francois; Kosmidis, Efstratios K.
2003-05-01
The mechanisms involved in respiratory rhythm and in its persistence along lifetime have not been completely elucidated yet. The debate if they rely on pacemaker units or on the emerging properties of neural networks is still on. We propose a simple model taking advantage of the synaptic noise and allowing to bridge network and pacemaker theories. The pBC (reticular preBotzinger Complex) and PC (pneumotaxic center) are two randomly and sparsely connected excitatory networks. pBC excites PC that in turn, strongly inhibits pBC. As a part of the reticular formation, the pBC, receives many uncorrelated inputs (noise). The model reproduces most of the experimental observations. Once started, the pBC, whose activity is started by synaptic noise, increase of activity is an emerging property of the excitatory network. This activates the PC that in turn inhibits the pBC and starts the expiration. If, for any reason, noise becomes too low, the network becomes silent, and pacemakers become the only active units able to restart a new inspiration. Safety measures of this kind are very much expected in the operation of a system as vital as respiration. Simulations using an enhanced biologically plausible model of neurons fully support the proposed model.
Giné-Garriga, Maria; Martin-Borràs, Carme; Puig-Ribera, Anna; Martín-Cantera, Carlos; Solà, Mercè; Cuesta-Vargas, Antonio
2013-01-01
Background Effective promotion of exercise could result in substantial savings in healthcare cost expenses in terms of direct medical costs, such as the number of medical appointments. However, this is hampered by our limited knowledge of how to achieve sustained increases in physical activity. Objectives To assess the effectiveness of a Primary Health Care (PHC) based physical activity program in reducing the total number of visits to the healthcare center among inactive patients, over a 15-month period. Research Design Randomized controlled trial. Subjects Three hundred and sixty-two (n = 362) inactive patients suffering from at least one chronic condition were included. One hundred and eighty-three patients (n = 183; mean (SD); 68.3 (8.8) years; 118 women) were randomly allocated to the physical activity program (IG). One hundred and seventy-nine patients (n = 179; 67.2 (9.1) years; 106 women) were allocated to the control group (CG). The IG went through a three-month standardized physical activity program led by physical activity specialists and linked to community resources. Measures The total number of medical appointments to the PHC, during twelve months before and after the program, was registered. Self-reported health status (SF-12 version 2) was assessed at baseline (month 0), at the end of the intervention (month 3), and at 12 months follow-up after the end of the intervention (month 15). Results The IG had a significantly reduced number of visits during the 12 months after the intervention: 14.8 (8.5). The CG remained about the same: 18.2 (11.1) (P = .002). Conclusions Our findings indicate that a 3-month physical activity program linked to community resources is a short-duration, effective and sustainable intervention in inactive patients to decrease rates of PHC visits. Trial Registration ClinicalTrials.gov NCT00714831 PMID:23805219
NASA Technical Reports Server (NTRS)
Edwards, T. R. (Inventor)
1985-01-01
Apparatus for doubling the data density rate of an analog to digital converter or doubling the data density storage capacity of a memory deviced is discussed. An interstitial data point midway between adjacent data points in a data stream having an even number of equal interval data points is generated by applying a set of predetermined one-dimensional convolute integer coefficients which can include a set of multiplier coefficients and a normalizer coefficient. Interpolator means apply the coefficients to the data points by weighting equally on each side of the center of the even number of equal interval data points to obtain an interstital point value at the center of the data points. A one-dimensional output data set, which is twice as dense as a one-dimensional equal interval input data set, can be generated where the output data set includes interstitial points interdigitated between adjacent data points in the input data set. The method for generating the set of interstital points is a weighted, nearest-neighbor, non-recursive, moving, smoothing averaging technique, equivalent to applying a polynomial regression calculation to the data set.
Model of a once-through steam generator with moving boundaries and a variable number of nodes
Berry, G.
1983-01-01
A model of a once-through steam generator (OTSG) with moving boundaries and variable nodes was developed for liquid-metal fast breeder reactor (LMFBR) applications. The main advantage of the current model is its ability to generate a variable number of nodes. The OTSG model consists of four regions identified as subcooled, nucleate-boiling, film-boiling, and superheated. The number of nodes within each region is variable, which allows the user to change the number of nodes and assess this effect on the resulting solution. The model also permits the elimination of regions (during a cool-down transient) or the formation of regions (start-up, or reheat after a cool-down transient). The model can also be used to simulate a boiler by eliminating the film-boiling and superheated regions. The model permits the user to select the appropriate heat-transfer correlations or use the default selections. The model has a separate section where steady-state values are determined before the code enters the transient section. The paper describes the formation of the model, and the steady-state and transient solution methods. Typical results are presented.
NASA Technical Reports Server (NTRS)
Ashford, Gregory A.; Powell, Kenneth G.
1995-01-01
A method for generating high quality unstructured triangular grids for high Reynolds number Navier-Stokes calculations about complex geometries is described. Careful attention is paid in the mesh generation process to resolving efficiently the disparate length scales which arise in these flows. First the surface mesh is constructed in a way which ensures that the geometry is faithfully represented. The volume mesh generation then proceeds in two phases thus allowing the viscous and inviscid regions of the flow to be meshed optimally. A solution-adaptive remeshing procedure which allows the mesh to adapt itself to flow features is also described. The procedure for tracking wakes and refinement criteria appropriate for shock detection are described. Although at present it has only been implemented in two dimensions, the grid generation process has been designed with the extension to three dimensions in mind. An implicit, higher-order, upwind method is also presented for computing compressible turbulent flows on these meshes. Two recently developed one-equation turbulence models have been implemented to simulate the effects of the fluid turbulence. Results for flow about a RAE 2822 airfoil and a Douglas three-element airfoil are presented which clearly show the improved resolution obtainable.
NASA Astrophysics Data System (ADS)
Ashford, Gregory A.; Powell, Kenneth G.
1995-10-01
A method for generating high quality unstructured triangular grids for high Reynolds number Navier-Stokes calculations about complex geometries is described. Careful attention is paid in the mesh generation process to resolving efficiently the disparate length scales which arise in these flows. First the surface mesh is constructed in a way which ensures that the geometry is faithfully represented. The volume mesh generation then proceeds in two phases thus allowing the viscous and inviscid regions of the flow to be meshed optimally. A solution-adaptive remeshing procedure which allows the mesh to adapt itself to flow features is also described. The procedure for tracking wakes and refinement criteria appropriate for shock detection are described. Although at present it has only been implemented in two dimensions, the grid generation process has been designed with the extension to three dimensions in mind. An implicit, higher-order, upwind method is also presented for computing compressible turbulent flows on these meshes. Two recently developed one-equation turbulence models have been implemented to simulate the effects of the fluid turbulence. Results for flow about a RAE 2822 airfoil and a Douglas three-element airfoil are presented which clearly show the improved resolution obtainable.
Béguin, J-B; Bookjans, E M; Christensen, S L; Sørensen, H L; Müller, J H; Polzik, E S; Appel, J
2014-12-31
We demonstrate preparation and detection of an atom number distribution in a one-dimensional atomic lattice with the variance -14 dB below the Poissonian noise level. A mesoscopic ensemble containing a few thousand atoms is trapped in the evanescent field of a nanofiber. The atom number is measured through dual-color homodyne interferometry with a pW-power shot noise limited probe. Strong coupling of the evanescent probe guided by the nanofiber allows for a real-time measurement with a precision of ±8 atoms on an ensemble of some 10(3) atoms in a one-dimensional trap. The method is very well suited for generating collective atomic entangled or spin-squeezed states via a quantum nondemolition measurement as well as for tomography of exotic atomic states in a one-dimensional lattice. PMID:25615331
NASA Astrophysics Data System (ADS)
Ikeda, Tomoaki; Atobe, Takashi; Takagi, Shohei
2012-01-01
The aeroacoustic sound generated from the flow around two NACA four-digit airfoils is investigated numerically, at relatively low Reynolds numbers that do not prompt boundary-layer transition. By using high-order finite-difference schemes to discretize compressible Navier-Stokes equations, the sound scattered on airfoil surface is directly resolved as an unsteady pressure fluctuation. As the wavelength of an emitted noise is shortened compared to the airfoil chord, the diffraction effect on non-compact chord length appears more noticeable, developing multiple lobes in directivity. The instability mechanism that produces sound sources, or unsteady vortical motions, is quantitatively examined, also by using a linear stability theory. While the evidence of boundary-layer instability waves is captured in the present result, the most amplified frequency in the boundary shear layer does not necessarily agree with the primary frequency of a trailing-edge noise, when wake instability is dominant in laminar flow. This contradicts the observation of other trailing-edge noise studies at higher Reynolds numbers. However, via acoustic disturbances, the boundary-layer instability may become more significant, through the resonance with the wake instability, excited by increasing a base-flow Mach number. Evidence suggests that this would correspond to the onset of an acoustic feedback loop. The wake-flow frequencies derived by an absolute-instability analysis are compared with the frequencies realized in flow simulations, to clarify the effect of an acoustic feedback mechanism, at a low Reynolds number.
NASA Astrophysics Data System (ADS)
Rahbaralam, Maryam; Fernàndez-Garcia, Daniel; Sanchez-Vila, Xavier
2015-12-01
Random walk particle tracking methods are a computationally efficient family of methods to solve reactive transport problems. While the number of particles in most realistic applications is in the order of 106-109, the number of reactive molecules even in diluted systems might be in the order of fractions of the Avogadro number. Thus, each particle actually represents a group of potentially reactive molecules. The use of a low number of particles may result not only in loss of accuracy, but also may lead to an improper reproduction of the mixing process, limited by diffusion. Recent works have used this effect as a proxy to model incomplete mixing in porous media. In this work, we propose using a Kernel Density Estimation (KDE) of the concentrations that allows getting the expected results for a well-mixed solution with a limited number of particles. The idea consists of treating each particle as a sample drawn from the pool of molecules that it represents; this way, the actual location of a tracked particle is seen as a sample drawn from the density function of the location of molecules represented by that given particle, rigorously represented by a kernel density function. The probability of reaction can be obtained by combining the kernels associated to two potentially reactive particles. We demonstrate that the observed deviation in the reaction vs time curves in numerical experiments reported in the literature could be attributed to the statistical method used to reconstruct concentrations (fixed particle support) from discrete particle distributions, and not to the occurrence of true incomplete mixing. We further explore the evolution of the kernel size with time, linking it to the diffusion process. Our results show that KDEs are powerful tools to improve computational efficiency and robustness in reactive transport simulations, and indicates that incomplete mixing in diluted systems should be modeled based on alternative mechanistic models and not on a
NASA Astrophysics Data System (ADS)
Wasko, Conrad; Pui, Alexander; Sharma, Ashish; Mehrotra, Rajeshwar; Jeremiah, Erwin
2015-12-01
Low-frequency variability, in the form of the El Niño-Southern Oscillation, plays a key role in shaping local weather systems. However, current continuous stochastic rainfall models do not account for this variability in their simulations. Here a modified Random Pulse Bartlett Lewis stochastic generation model is presented for continuous rainfall simulation exhibiting low-frequency variability. Termed the Hierarchical Random Bartlett Lewis Model (HRBLM), the model features a hierarchical structure to represent a range of rainfall characteristics associated with the El Niño-Southern Oscillation with parameters conditioned to vary as functions of relevant climatic states. Long observational records of near-continuous rainfall at various locations in Australia are used to formulate and evaluate the model. The results indicate clear benefits of using the hierarchical climate-dependent structure proposed. In addition to accurately representing the wet spells characteristics and observed low-frequency variability, the model replicates the interannual variability of the antecedent rainfall preceding the extremes, which is known to be of considerable importance in design flood estimation applications.
Watt-level supercontinuum generation in As2Se3 fibers pumped by a 2-micron random fiber laser
NASA Astrophysics Data System (ADS)
Tang, Yulong; Li, Feng; Xu, Jianqiu
2016-05-01
Chalcogenide fibers are good candidates for generating supercontinuum (SC) radiation due to their large nonlinear refractive indices and high mid-infrared transmission, but their low damage thresholds hamper the SC power scaling, thereby limiting the ultimately achieved SC brightness. Here, we report an As2Se3 fiber SC system pumped by a novel random Q-switched 2 μm Tm3+ fiber laser. The maximum SC output power is 1.09 W with slope efficiency of 24%, and the SC spans from ~1980 to ~2500 nm with a spectral width of ~500 nm at the -20 dB points. The spectral power density is ~2 mW nm-1. To the best of our knowledge, this is the highest power and spectral density SC emission ever achieved in chalcogenide fibers.
Pandya, Bhavi; Gaddam, Sainath; Raza, Muhammad; Asti, Deepak; Nalluri, Nikhil; Vazzana, Thomas; Kandov, Ruben; Lafferty, James
2016-01-01
AIM: To evaluate the premise, that biodegradable polymer drug eluting stents (BD-DES) could improve clinical outcomes compared to second generation permanent polymer drug eluting stents (PP-DES), we pooled the data from all the available randomized control trials (RCT) comparing the clinical performance of both these stents. METHODS: A systematic literature search of PubMed, Cochrane, Google scholar databases, EMBASE, MEDLINE and SCOPUS was performed during time period of January 2001 to April 2015 for RCT and comparing safety and efficacy of BD-DES vs second generation PP-DES. The primary outcomes of interest were definite stent thrombosis, target lesion revascularization, myocardial infarction, cardiac deaths and total deaths during the study period. RESULTS: A total of 11 RCT’s with a total of 12644 patients were included in the meta-analysis, with 6598 patients in BD-DES vs 6046 patients in second generation PP-DES. The mean follow up period was 16 mo. Pooled analysis showed non-inferiority of BD-DES, comparing events of stent thrombosis (OR = 1.42, 95%CI: 0.79-2.52, P = 0.24), target lesion revascularization (OR = 0.99, 95%CI: 0.84-1.17, P = 0.92), myocardial infarction (OR = 1.06, 95%CI: 0.86-1.29, P = 0.92), cardiac deaths (OR = 1.07, 95%CI 0.82-1.41, P = 0.94) and total deaths (OR = 0.96, 95%CI: 0.80-1.17, P = 0.71). CONCLUSION: BD-DES, when compared to second generation PP-DES, showed no significant advantage and the outcomes were comparable between both the groups. PMID:26981219
Lozenge Tilings and Hurwitz Numbers
NASA Astrophysics Data System (ADS)
Novak, Jonathan
2015-10-01
We give a new proof of the fact that, near a turning point of the frozen boundary, the vertical tiles in a uniformly random lozenge tiling of a large sawtooth domain are distributed like the eigenvalues of a GUE random matrix. Our argument uses none of the standard tools of integrable probability. In their place, it uses a combinatorial interpretation of the Harish-Chandra/Itzykson-Zuber integral as a generating function for desymmetrized Hurwitz numbers.
Moura, André L.; Carreño, Sandra J. M.; Pincheira, Pablo I. R.; Fabris, Zanine V.; Maia, Lauro J. Q.; Gomes, Anderson S. L.; de Araújo, Cid B.
2016-01-01
Ultraviolet and blue light were obtained by nonlinear frequency conversion in a random laser (RL) based on Nd0.10Y0.90Al3(BO3)4 nanocrystalline powder. RL operation at 1062 nm, due to the 4F3/2 → 4I11/2 transition of neodymium ions (Nd3+), was achieved by exciting the Nd3+ with a tunable beam from 680 to 920 nm covering the ground state absorption transitions to the 4F9/2, (4F7/2,4S3/2), (4F5/2,2H9/2), and 4F3/2 states. Light from 340 to 460 nm was obtained via the second-harmonic generation of the excitation beam while tunable blue light, from 417 to 486 nm, was generated by self-sum-frequency mixing between the excitation beam and the RL emission. PMID:27250647
Moura, André L; Carreño, Sandra J M; Pincheira, Pablo I R; Fabris, Zanine V; Maia, Lauro J Q; Gomes, Anderson S L; de Araújo, Cid B
2016-01-01
Ultraviolet and blue light were obtained by nonlinear frequency conversion in a random laser (RL) based on Nd0.10Y0.90Al3(BO3)4 nanocrystalline powder. RL operation at 1062 nm, due to the (4)F3/2 → (4)I11/2 transition of neodymium ions (Nd(3+)), was achieved by exciting the Nd(3+) with a tunable beam from 680 to 920 nm covering the ground state absorption transitions to the (4)F9/2, ((4)F7/2,(4)S3/2), ((4)F5/2,(2)H9/2), and (4)F3/2 states. Light from 340 to 460 nm was obtained via the second-harmonic generation of the excitation beam while tunable blue light, from 417 to 486 nm, was generated by self-sum-frequency mixing between the excitation beam and the RL emission. PMID:27250647
NASA Astrophysics Data System (ADS)
Moura, André L.; Carreño, Sandra J. M.; Pincheira, Pablo I. R.; Fabris, Zanine V.; Maia, Lauro J. Q.; Gomes, Anderson S. L.; de Araújo, Cid B.
2016-06-01
Ultraviolet and blue light were obtained by nonlinear frequency conversion in a random laser (RL) based on Nd0.10Y0.90Al3(BO3)4 nanocrystalline powder. RL operation at 1062 nm, due to the 4F3/2 → 4I11/2 transition of neodymium ions (Nd3+), was achieved by exciting the Nd3+ with a tunable beam from 680 to 920 nm covering the ground state absorption transitions to the 4F9/2, (4F7/2,4S3/2), (4F5/2,2H9/2), and 4F3/2 states. Light from 340 to 460 nm was obtained via the second-harmonic generation of the excitation beam while tunable blue light, from 417 to 486 nm, was generated by self-sum-frequency mixing between the excitation beam and the RL emission.
Liu, Biao; Morrison, Carl D.; Johnson, Candace S.; Trump, Donald L.; Qin, Maochun; Conroy, Jeffrey C.; Wang, Jianmin; Liu, Song
2013-01-01
Accurate detection of somatic copy number variations (CNVs) is an essential part of cancer genome analysis, and plays an important role in oncotarget identifications. Next generation sequencing (NGS) holds the promise to revolutionize somatic CNV detection. In this review, we provide an overview of current analytic tools used for CNV detection in NGS-based cancer studies. We summarize the NGS data types used for CNV detection, decipher the principles for data preprocessing, segmentation, and interpretation, and discuss the challenges in somatic CNV detection. This review aims to provide a guide to the analytic tools used in NGS-based cancer CNV studies, and to discuss the important factors that researchers need to consider when analyzing NGS data for somatic CNV detections. PMID:24240121
NASA Astrophysics Data System (ADS)
Weible, K. J.; Bich, A.; Roth, S.; Dumouchel, C.; Pernet, P.; Eisner, M.; Völkel, R.; Bitterli, R.; Scharf, T.; Noell, W.
2008-08-01
A wide range of lasers from the UV to the IR are selected based on their optical power and spectral characteristics to match the particular absorption behavior for the material to be processed. Periodic microlens arrays are often used as multi-aperture integrators to transform the Gaussian or non-uniform beam profile into a homogenized intensity profile either in 1-D or 2-D distribution. Each microlens element samples the input inhomogeneous beam and spreads it over a given angular distribution. Incoherent beams that are either temporally or spatially incoherent can produce very uniform intensity profiles. However, coherent beams will experience interference effects in the recombination of the beams generated by each individual microlens element. For many applications, for example pulsed laser sources, it is not possible to use a rotating or moving element, such as a rotating diffuser, to circumvent the interferences resulting from the beam coherence. Micro-optical elements comprised of a randomly varying component can be used to help smooth out the interference effects within the far-field intensity profile.
Coyte, Peter C; Bhatia, R Sacha; Semple, John L
2015-01-01
Background Women’s College Hospital, Toronto, Canada, offers specialized ambulatory surgical procedures. Patients often travel great distances to undergo surgery. Most patients receiving ambulatory surgery have a low rate of postoperative events necessitating clinic visits. However, regular follow-up is still considered important in the early postoperative phase. Increasingly, telemedicine is used to overcome the distance patients must travel to receive specialized care. Telemedicine data suggest that mobile monitoring and follow-up care is valued by patients and can reduce costs to society. Women’s College Hospital has used a mobile app (QoC Health Inc) to complement in-person postoperative follow-up care for breast reconstruction patients. Preliminary studies suggest that mobile app follow-up care is feasible, can avert in-person follow-up care, and is cost-effective from a societal and health care system perspective. Objective We hope to expand the use of mobile app follow-up care through its formal assessment in a randomized controlled trial. In postoperative ambulatory surgery patients at Women’s College Hospital (WCH), can we avert in-person follow-up care through the use of mobile app follow-up care compared to conventional, in-person follow-up care in the first 30 days after surgery. Methods This will be a pragmatic, single-center, open, controlled, 2-arm parallel-group superiority randomized trial comparing mobile app and in-person follow-up care over the first month following surgery. The patient population will comprise all postoperative ambulatory surgery patients at WCH undergoing breast reconstruction. The intervention consists of a postoperative mobile app follow-up care using the quality of recovery-9 (QoR9) and a pain visual analog scale (VAS), surgery-specific questions, and surgical site photos submitted daily for the first 2 weeks and weekly for the following 2 weeks. The primary outcome is the total number of physician visits related to
Han, Ya; Liu, Yan-Ge; Huang, Wei; Wang, Zhi; Guo, Jun-Qi; Luo, Ming-Ming
2016-07-25
A refractive index (RI) tunable functional materials infiltrated side-hole ring fiber (SHRF) is proposed to generate 10 LP OAM states with 6 topology numbers. On the basis of perturbation theory, the basis of the SHRF is demonstrated to be the LP modes. After a fixed propagation distance of 0.03 m, 0.009 m and 0.012 m, the phase difference between the odd and even LP_{11}x, LP_{21}x,y, LP_{31}x,y modes in the SHRF accumulate to ± π/2 respectively with na ranging from 1.412 to 1.44. Correspondingly, the output states are OAM _{± 1}x, OAM _{± 2}x,y, OAM _{± 3}x,y with a bandwidth of 380 nm, 100 nm and 80 nm respectively. The proposed fiber is easy to be fabricated with the mature fiber drawing technology and could facilitate the realization of all fiber based OAM system. PMID:27464176
NASA Astrophysics Data System (ADS)
Mandolesi, Eric; Moorkamp, Max; Jones, Alan G.
2015-04-01
Most electromagnetic (EM) geophysical methods focus on the electrical properties of rocks and sediments to determine reliable images of the subsurface, images routinely used in a broad range of applications. Often laboratory measurements of the same EM properties return equivocal results that are difficult to reconcile with observations obtained by EM imaging techniques. These inconsistencies lead to major interpretation problems. Different numerical approaches have been investigated in order to understand the consequences of the presence or absence of interconnected networks of fractures and pores on EM field measurements. These networks have a crucial effect on the EM field measurements, given that they can be permeated by conductive fluids that enhance the conductivity measurements of the whole environment. Most of the above-mentioned studies restrict their examination to direct current (DC) sources only. Bearing in mind that the time-varying nature of the natural electromagnetic sources play a major role in field measurements, we numerically model the effects of such EM sources on the conductivity measured on the surface of a randomly generated three-dimensional body buried in a uniform conductivity host by simulating a magnetotelluric (MT) station measurements on the top of the target random host itself. As a second experiment we simulated a DC measurement of the target bulk conductivity. The spatial distribution and shape of the conductor network allows in fact the propagation of time-varying EM fields by induction, leading the two different methods to measure a different numerical value for the bulk of the same physical property. We have compared the results from the simulated measurements obtained considering time-varying and DC sources with electrical conductivity predicted by both Hashin-Shtrikman (HS) bounds and Archie's Law, and we have compared these results with statistical properties of the model themselves. Our results suggest that for time
Fusar-Poli, Paolo; Kempton, Matthew J; Rosenheck, Robert A
2013-03-01
The aim of the present article is to test at a meta-analytical level the efficacy and safety of second-generation long-acting antipsychotic injections (SGLAI) in schizophrenia. Thirteen randomized-controlled trials comparing SGLAI with either placebo or oral antipsychotics were included in a quantitative meta-analysis (6313 patients). Efficacy and safety measures as well as demographic and clinical variables were extracted from each publication or obtained directly from authors. Publication bias was assessed with funnel plots and Egger's intercept. Heterogeneity was addressed with the Q statistic and the I² index. SGLAI were more effective than placebo injections [Hedges's g=0.336, 95% confidence interval (CI) 0.246-0.426, Z=7.325, P<0.001] in reducing the Positive and Negative Syndrome Scale (PANSS) scores, but no differences were observed compared with oral antipsychotics (Hedges's g=0.072, 95% CI -0.072 to 0.217, Z=0.983, P=0.326). There were more responders under SGLAI than placebo (47 vs. 24%, NNT 4, 95% CI 3-6), but no differences in comparison with oral antipsychotics [relative risk (RR)=0.962, P=0.094]. SGLAI and controls groups shared a common safety profile with respect to the number of deaths, overall number of treatment-adverse events, insomnia, QT prolongation, or pain in the injection site. There was a greater risk of developing extrapyramidal side effects with SGLAI than with placebo (RR=2.037, P<0.001) or with oral antipsychotics (RR=1.451, P=0.048). There was no evidence of publication bias (Egger's P=0.476), and sensitivity analysis confirmed the robustness of results. The present meta-analysis shows superior efficacy for the SGLAI over placebo on psychotic symptoms, although with a relatively small effect size; no evidence of superiority in efficacy over oral antipsychotics; and modest evidence of greater symptoms of extrapyramidal side effects. These data suggest that SGLAI lack an advantage in reducing psychotic symptoms over oral medications
You, Peng; Liu, Zhen; Wang, Hongqiang; Wei, Xizhang; Li, Xiang
2014-01-01
Compressed sensing has been applied to achieve high resolution range profiles (HRRPs) using a stepped-frequency radar. In this new scheme, much fewer pulses are required to recover the target's strong scattering centers, which can greatly reduce the coherent processing interval (CPI) and improve the anti-jamming capability. For practical applications, however, the required number of pulses is difficult to determine in advance and any reduction of the transmitted pulses is attractive. In this paper, a dynamic compressed sensing strategy for HRRP generation is proposed, in which the estimated HRRP is updated with sequentially transmitted and received pulses until the proper stopping rules are satisfied. To efficiently implement the sequential update, a complex-valued fast sequential homotopy (CV-FSH) algorithm is developed based on group sparse recovery. This algorithm performs as an efficient recursive procedure of sparse recovery, thus avoiding solving a new optimization problem from scratch. Furthermore, the proper stopping rules are presented according to the special characteristics of HRRP. Therefore, the optimal number of pulses required in each CPI can be sought adapting to the echo signal. The results using simulated and real data show the effectiveness of the proposed approach and demonstrate that the established dynamic strategy is more suitable for uncooperative targets. PMID:24815679
NASA Astrophysics Data System (ADS)
Yang, X. I. A.; Meneveau, C.; Marusic, I.; Biferale, L.
2016-08-01
In wall-bounded turbulence, the moment generating functions (MGFs) of the streamwise velocity fluctuations
Random graphs with hidden color.
Söderberg, Bo
2003-07-01
We propose and investigate a unifying class of sparse random graph models, based on a hidden coloring of edge-vertex incidences, extending an existing approach, random graphs with a given degree distribution, in a way that admits a nontrivial correlation structure in the resulting graphs. The approach unifies a number of existing random graph ensembles within a common general formalism, and allows for the analytic calculation of observable graph characteristics. In particular, generating function techniques are used to derive the size distribution of connected components (clusters) as well as the location of the percolation threshold where a giant component appears. PMID:12935185
Random distributed feedback fibre lasers
NASA Astrophysics Data System (ADS)
Turitsyn, Sergei K.; Babin, Sergey A.; Churkin, Dmitry V.; Vatnik, Ilya D.; Nikulin, Maxim; Podivilov, Evgenii V.
2014-09-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 generation
Random ambience using high fidelity images
NASA Astrophysics Data System (ADS)
Abu, Nur Azman; Sahib, Shahrin
2011-06-01
Most of the secure communication nowadays mandates true random keys as an input. These operations are mostly designed and taken care of by the developers of the cryptosystem. Due to the nature of confidential crypto development today, pseudorandom keys are typically designed and still preferred by the developers of the cryptosystem. However, these pseudorandom keys are predictable, periodic and repeatable, hence they carry minimal entropy. True random keys are believed to be generated only via hardware random number generators. Careful statistical analysis is still required to have any confidence the process and apparatus generates numbers that are sufficiently random to suit the cryptographic use. In this underlying research, each moment in life is considered unique in itself. The random key is unique for the given moment generated by the user whenever he or she needs the random keys in practical secure communication. An ambience of high fidelity digital image shall be tested for its randomness according to the NIST Statistical Test Suite. Recommendation on generating a simple 4 megabits per second random cryptographic keys live shall be reported.
Wang, Li; Bordi, Peter L.; Fleming, Jennifer A.; Hill, Alison M.; Kris‐Etherton, Penny M.
2015-01-01
Background Avocados are a nutrient‐dense source of monounsaturated fatty acids (MUFA) that can be used to replace saturated fatty acids (SFA) in a diet to lower low density lipoprotein cholesterol (LDL‐C). Well‐controlled studies are lacking on the effect of avocado consumption on cardiovascular disease (CVD) risk factors. Methods and Results A randomized, crossover, controlled feeding trial was conducted with 45 overweight or obese participants with baseline LDL‐C in the 25th to 90th percentile. Three cholesterol‐lowering diets (6% to 7% SFA) were fed (5 weeks each): a lower‐fat diet (LF: 24% fat); 2 moderate‐fat diets (34% fat) provided similar foods and were matched for macronutrients and fatty acids: the avocado diet (AV) included one fresh Hass avocado (136 g) per day, and the moderate‐fat diet (MF) mainly used high oleic acid oils to match the fatty acid content of one avocado. Compared with baseline, the reduction in LDL‐C and non‐high‐density lipoprotein (HDL) cholesterol on the AV diet (−13.5 mg/dL, −14.6 mg/dL) was greater (P<0.05) than the MF (−8.3 mg/dL, −8.7 mg/dL) and LF (−7.4 mg/dL, −4.8 mg/dL) diets. Furthermore, only the AV diet significantly decreased LDL particle number (LDL‐P, −80.1 nmol/L, P=0.0001), small dense LDL cholesterol (LDL3+4, −4.1 mg/dL, P=0.04), and the ratio of LDL/HDL (−6.6%, P<0.0001) from baseline. Conclusions Inclusion of one avocado per day as part of a moderate‐fat, cholesterol‐lowering diet has additional LDL‐C, LDL‐P, and non‐HDL‐C lowering effects, especially for small, dense LDL. Our results demonstrate that avocados have beneficial effects on cardio‐metabolic risk factors that extend beyond their heart‐healthy fatty acid profile. Clinical Trial Registration URL: http://www.clinicaltrials.gov. Unique identifier: NCT01235832. PMID:25567051
Random bits, true and unbiased, from atmospheric turbulence.
Marangon, Davide G; Vallone, Giuseppe; Villoresi, Paolo
2014-01-01
Random numbers represent a fundamental ingredient for secure communications and numerical simulation as well as to games and in general to Information Science. Physical processes with intrinsic unpredictability may be exploited to generate genuine random numbers. The optical propagation in strong atmospheric turbulence is here taken to this purpose, by observing a laser beam after a 143 km free-space path. In addition, we developed an algorithm to extract the randomness of the beam images at the receiver without post-processing. The numbers passed very selective randomness tests for qualification as genuine random numbers. The extracting algorithm can be easily generalized to random images generated by different physical processes. PMID:24976499
Yu, Zheng; Haage, Kristina; Streit, Verena E; Gierl, Alfons; Ruiz, Ramón A Torres
2009-04-01
Arabidopsis thaliana has, in conjunction with A. arenosa, developed into a system for the molecular analysis of alloplolyploidy. However, there are very few Arabidopsis lines available to study autopolyploidy. In order to investigate polyploidy on a reliable basis, we have optimised conventional methodologies and developed a novel strategy for the rapid generation and identification of polyploids based on trichome branching patterns. The analysis of more than two dozen independently induced Arabidopsis lines has led to interesting observations concerning the relationship between cell size and ploidy levels and on the relative stability of tetraploidy in Arabidopsis over at least three consecutive generations. The most important finding of this work is that neo-tetraploid lines exhibit considerable stability through all the generations tested. The systematic generation of tetraploid collections through this strategy as well as the lines generated in this work will help to unravel the consequences of polyploidy, particularly tetraploidy, on the genome, on gene expression and on natural diversity in Arabidopsis. PMID:19205656
Design of True Random One-Time Pads in DNA XOR Cryptosystem
NASA Astrophysics Data System (ADS)
Hirabayashi, Miki; Kojima, Hiroaki; Oiwa, Kazuhiro
We present a new model to realize true random one-time pad (OTP) encryption using DNA self-assembly. OTP is an unbreakable cryptosystem if the pad (random key) is truly random, never reused, and kept secret. Mathematical algorithms can generate pseudo-random numbers only. "True" random numbers can be generated from a physical process such as thermal noise. In this work, we propose a new tile-colony algorithm that can utilize the DNA hybridization process as an effective source for the random key construction, and discuss the error tolerance of this method. Our results indicate that the molecular computation using DNA motifs will provide promising OTP applications.
NASA Astrophysics Data System (ADS)
Descartes, R.; Rota, G.-C.; Euler, L.; Bernoulli, J. D.; Siegel, Edward Carl-Ludwig
2011-03-01
Quantum-statistics Dichotomy: Fermi-Dirac(FDQS) Versus Bose-Einstein(BEQS), respectively with contact-repulsion/non-condensation(FDCR) versus attraction/ condensationBEC are manifestly-demonstrated by Taylor-expansion ONLY of their denominator exponential, identified BOTH as Descartes analytic-geometry conic-sections, FDQS as Elllipse (homotopy to rectangle FDQS distribution-function), VIA Maxwell-Boltzmann classical-statistics(MBCS) to Parabola MORPHISM, VS. BEQS to Hyperbola, Archimedes' HYPERBOLICITY INEVITABILITY, and as well generating-functions[Abramowitz-Stegun, Handbook Math.-Functions--p. 804!!!], respectively of Euler-numbers/functions, (via Riemann zeta-function(domination of quantum-statistics: [Pathria, Statistical-Mechanics; Huang, Statistical-Mechanics]) VS. Bernoulli-numbers/ functions. Much can be learned about statistical-physics from Euler-numbers/functions via Riemann zeta-function(s) VS. Bernoulli-numbers/functions [Conway-Guy, Book of Numbers] and about Euler-numbers/functions, via Riemann zeta-function(s) MORPHISM, VS. Bernoulli-numbers/ functions, visa versa!!! Ex.: Riemann-hypothesis PHYSICS proof PARTLY as BEQS BEC/BEA!!!
Sensory deprivation: visual experience alters the mental number line.
Pasqualotto, Achille; Taya, Shuichiro; Proulx, Michael J
2014-03-15
Early studies on numeric cognition reported that numbers are spatially organised according to a left-to-right small-to-large 'number line'. We investigated whether this spatial-number organisation is dictated by visual experience. We tested congenitally and late blind, and blindfolded sighted participants in a random number generation task where in one block their heads were alternately turned left or right before uttering the number. We found that the 'random' number generation was biased according to the side where the head was turned to. Consistent with the standard number line, participants with visual experience generated smaller numbers for left turns, and larger numbers for right turns. In contrast, participants without any visual experience showed the opposite pattern of results. These results suggest a role for visual experience in the development of spatial and numerical representations, which is supported by cultural differences in number representation, and provide converging evidence for visually driven organisation of the parietal cortex. PMID:24355751
ERIC Educational Resources Information Center
Wheeler, Marc E.; Keller, Thomas E.; DuBois, David L.
2010-01-01
Between 2007 and 2009, reports were released on the results of three separate large-scale random assignment studies of the effectiveness of school-based mentoring programs for youth. The studies evaluated programs implemented by Big Brothers Big Sisters of America (BBBSA) affiliates (Herrera et al., 2007), Communities In Schools of San Antonio,…
Gerrits, Thomas; Glancy, Scott; Clement, Tracy S.; Calkins, Brice; Lita, Adriana E.; Nam, Sae Woo; Mirin, Richard P.; Knill, Emanuel; Miller, Aaron J.; Migdall, Alan L.
2010-09-15
We have created heralded coherent-state superpositions (CSSs) by subtracting up to three photons from a pulse of squeezed vacuum light. To produce such CSSs at a sufficient rate, we used our high-efficiency photon-number-resolving transition edge sensor to detect the subtracted photons. This experiment is enabled by and utilizes the full photon-number-resolving capabilities of this detector. The CSS produced by three-photon subtraction had a mean-photon number of 2.75{sub -0.24}{sup +0.06} and a fidelity of 0.59{sub -0.14}{sup +0.04} with an ideal CSS. This confirms that subtracting more photons results in higher-amplitude CSSs.
2012-01-01
Background Tandemly arranged nuclear ribosomal DNA (rDNA), encoding 18S, 5.8S and 26S ribosomal RNA (rRNA), exhibit concerted evolution, a pattern thought to result from the homogenisation of rDNA arrays. However rDNA homogeneity at the single nucleotide polymorphism (SNP) level has not been detailed in organisms with more than a few hundred copies of the rDNA unit. Here we study rDNA complexity in species with arrays consisting of thousands of units. Methods We examined homogeneity of genic (18S) and non-coding internally transcribed spacer (ITS1) regions of rDNA using Roche 454 and/or Illumina platforms in four angiosperm species, Nicotiana sylvestris, N. tomentosiformis, N. otophora and N. kawakamii. We compared the data with Southern blot hybridisation revealing the structure of intergenic spacer (IGS) sequences and with the number and distribution of rDNA loci. Results and Conclusions In all four species the intragenomic homogeneity of the 18S gene was high; a single ribotype makes up over 90% of the genes. However greater variation was observed in the ITS1 region, particularly in species with two or more rDNA loci, where >55% of rDNA units were a single ribotype, with the second most abundant variant accounted for >18% of units. IGS heterogeneity was high in all species. The increased number of ribotypes in ITS1 compared with 18S sequences may reflect rounds of incomplete homogenisation with strong selection for functional genic regions and relaxed selection on ITS1 variants. The relationship between the number of ITS1 ribotypes and the number of rDNA loci leads us to propose that rDNA evolution and complexity is influenced by locus number and/or amplification of orphaned rDNA units at new chromosomal locations. PMID:23259460
Churkin, D V; El-Taher, A E; Vatnik, I D; Babin, Sergei A
2012-09-30
The longitudinal distribution of the Stokes-component power in a Raman fibre laser with a random distributed feedback and unidirectional pumping is measured. The fibre parameters (linear loss and Rayleigh backscattering coefficient) are calculated based on the distributions obtained. A numerical model is developed to describe the lasing power distribution. The simulation results are in good agreement with the experimental data. (optical fibres, lasers and amplifiers. properties and applications)
Smith, A D; Resnick, D A; Zhang, A; Geisler, S C; Arnold, E; Arnold, G F
1994-01-01
Random systematic mutagenesis was used to generate a library of human rhinovirus 14 chimeras that each display a segment from the V3 loop of human immunodeficiency virus type 1. The sequence XXIGPGRAXX, where X could be any of the 20 amino acids, was inserted at the neutralizing immunogenic site II of human rhinovirus 14 between VP2 residues 159 and 160. Twenty-five unique chimeric viruses were isolated, and the identity of their randomized residues was determined. A nonrandom amino acid distribution that may reflect structural requirements for viability was observed at the randomized positions. Fifteen of 25 chimeras were neutralized by one or more of a panel of four anti-human immunodeficiency virus type 1 V3 loop antibody preparations, indicating that antigenicity had been successfully transplanted. Libraries of chimeric viruses produced by using the techniques described may be a source of vaccines and other immunotherapeutic reagents. The random systematic mutagenesis methodology described should be generally useful for the rapid transplantation of foreign sequences into viral coat and other proteins to produce libraries containing members with the desired properties. PMID:8254775
Pérez-Mañá, Clara; Farré, Magí; Rodríguez-Morató, Jose; Papaseit, Esther; Pujadas, Mitona; Fitó, Montserrat; Robledo, Patricia; Covas, Maria-Isabel; Cheynier, Véronique; Meudec, Emmanuelle; Escudier, Jean-Louis; de la Torre, Rafael
2015-06-01
In humans, urinary hydroxytyrosol (OHTyr) concentrations have been associated to alcohol and wine consumption. To explore the role of wine components on promoting an endogenous OHTyr generation we performed a cross-over, double-blind, randomized controlled clinical trial (n = 28 healthy volunteers). Ethanol (wine and vodka), dealcoholized wine, and placebo were administered. Alcohol, dealcoholized wine, and particularly wine promoted a de novo OHTyr generation in vivo in humans. Potential OHTyr precursors (tyrosine, tyrosol, tyramine) were investigated in rats. Tyrosol was metabolized to OHTyr. Collating both studies, it is postulated that an increased Tyr bioavailability, a shift to a reductive pathway in dopamine and tyramine oxidative metabolism, and the biotransformation of Tyr to OHTyr were mechanisms involved in the OHTyr endogenous generation. PMID:25712532
NASA Astrophysics Data System (ADS)
Pederzani, Jean-Noel; Haj-Hariri, Hossein
2012-11-01
An embedded-boundary (or cut-cell) method for complex geometry with moving boundaries is used to solve the three dimensional Navier-Stokes equation around a self-propelling manta swimming at moderately high Reynolds numbers. The motion of the ray is prescribed using a kinematic model fitted to actual biological data. The dependence of thrust production mechanism on Strouhal and Reynolds numbers is investigated. The vortex core structures are accurately plotted and a correlation between wake structures and propulsive performance is established. This insight is critical in understanding the key flow features that a bio-inspired autonomous vehicle should reproduce in order to swim efficiently. The solution method is implemented, on a block-structured Cartesian grid using a cut-cell approach enabling the code to correctly evaluate the wall shear-stress, a key feature necessary at higher Reynolds. To enhance computational efficiency, a parallel adaptive mesh refinement technique is used. The present method is validated against published experimental results. Supported by ONR MURI.
NASA Technical Reports Server (NTRS)
Leybold, H. A.
1971-01-01
Random numbers were generated with the aid of a digital computer and transformed such that the probability density function of a discrete random load history composed of these random numbers had one of the following non-Gaussian distributions: Poisson, binomial, log-normal, Weibull, and exponential. The resulting random load histories were analyzed to determine their peak statistics and were compared with cumulative peak maneuver-load distributions for fighter and transport aircraft in flight.
Snouwaert, J; Bunick, D; Hutchison, C; Fowlkes, D M
1987-01-01
We have isolated clones with well over 100 randomly dispersed point mutations distributed throughout the 5' half of chemically synthesized adenovirus type 2 VA I genes. In addition, we have isolated clusters of mutations targeted to the regions corresponding to the A and B block consensus sequences of eukaryotic tRNA and adenovirus VA genes. In vitro analyses of these constructs have allowed us to survey in detail the importance of DNA sequence to transcriptional efficiency. Our analyses demonstrate that certain constructs with radically substituted A block regions can be transcribed efficiently. In contrast, there is little tolerance for variation in the sequence within the B block region. We propose that the B block sequence should be R-G-A/T-T-C-R-A-N-N-C for optimal transcriptional efficiency of the VA I gene in mammalian cells. PMID:3671085
Gallego, Carlos J.; Bennette, Caroline S.; Heagerty, Patrick; Comstock, Bryan; Horike-Pyne, Martha; Hisama, Fuki; Amendola, Laura M.; Bennett, Robin L.; Dorschner, Michael O.; Tarczy-Hornoch, Peter; Grady, William M.; Fullerton, S. Malia; Trinidad, Susan B.; Regier, Dean A.; Nickerson, Deborah A.; Burke, Wylie; Patrick, Donald L.; Jarvik, Gail P.; Veenstra, David L.
2014-01-01
Whole exome and whole genome sequencing are applications of next generation sequencing transforming clinical care, but there is little evidence whether these tests improve patient outcomes or if they are cost effective compared to current standard of care. These gaps in knowledge can be addressed by comparative effectiveness and patient-centered outcomes research. We designed a randomized controlled trial that incorporates these research methods to evaluate whole exome sequencing compared to usual care in patients being evaluated for hereditary colorectal cancer and polyposis syndromes. Approximately 220 patients will be randomized and followed for 12 months after return of genomic findings. Patients will receive findings associated with colorectal cancer in a first return of result visit, and findings not associated with colorectal cancer (incidental findings) during a second return of result visit. The primary outcome is efficacy to detect mutations associated with these syndromes; secondary outcomes include psychosocial impact, cost-effectiveness and comparative costs. The secondary outcomes will be obtained via surveys before and after each return visit. The expected challenges in conducting this randomized controlled trial include the relatively low prevalence of genetic disease, difficult interpretation of some genetic variants, and uncertainty about which incidental findings should be returned to patients. The approaches utilized in this study may help guide other investigators in clinical genomics to identify useful outcome measures and strategies to address comparative effectiveness questions about the clinical implementation of genomic sequencing in clinical care. PMID:24997220
Chen, Haibin; Zhen, Xin; Gu, Xuejun; Yan, Hao; Cervino, Laura; Xiao, Yang; Zhou, Linghong
2015-01-01
In medical image processing, robust segmentation of inhomogeneous targets is a challenging problem. Because of the complexity and diversity in medical images, the commonly used semiautomatic segmentation algorithms usually fail in the segmentation of inhomogeneous objects. In this study, we propose a novel algorithm imbedded with a seed point autogeneration for random walks segmentation enhancement, namely SPARSE, for better segmentation of inhomogeneous objects. With a few user-labeled points, SPARSE is able to generate extended seed points by estimating the probability of each voxel with respect to the labels. The random walks algorithm is then applied upon the extended seed points to achieve improved segmentation result. SPARSE is implemented under the compute unified device architecture (CUDA) programming environment on graphic processing unit (GPU) hardware platform. Quantitative evaluations are performed using clinical homogeneous and inhomogeneous cases. It is found that the SPARSE can greatly decrease the sensitiveness to initial seed points in terms of location and quantity, as well as the freedom of selecting parameters in edge weighting function. The evaluation results of SPARSE also demonstrate substantial improvements in accuracy and robustness to inhomogeneous target segmentation over the original random walks algorithm. PMID:26103201
Randomness and degrees of irregularity.
Pincus, S; Singer, B H
1996-01-01
The fundamental question "Are sequential data random?" arises in myriad contexts, often with severe data length constraints. Furthermore, there is frequently a critical need to delineate nonrandom sequences in terms of closeness to randomness--e.g., to evaluate the efficacy of therapy in medicine. We address both these issues from a computable framework via a quantification of regularity. ApEn (approximate entropy), defining maximal randomness for sequences of arbitrary length, indicating the applicability to sequences as short as N = 5 points. An infinite sequence formulation of randomness is introduced that retains the operational (and computable) features of the finite case. In the infinite sequence setting, we indicate how the "foundational" definition of independence in probability theory, and the definition of normality in number theory, reduce to limit theorems without rates of convergence, from which we utilize ApEn to address rates of convergence (of a deficit from maximal randomness), refining the aforementioned concepts in a computationally essential manner. Representative applications among many are indicated to assess (i) random number generation output; (ii) well-shuffled arrangements; and (iii) (the quality of) bootstrap replicates. PMID:11607637
Park, Y S; Kwak, J M; Kwon, O Y; Kim, Y S; Lee, D S; Cho, M J; Lee, H H; Nam, H G
1993-01-01
Two hundred thirty-seven expressed sequence tags (ESTs) of Brassica napus were generated by single-run partial sequencing of 197 random root cDNA clones. A computer search of these root ESTs revealed that 21 ESTs show significant similarity to the protein-coding sequences in the existing data bases, including five stress- or defense-related genes and four clones related to the genes from other kingdoms. Northern blot analysis of the 10 data base-matched cDNA clones revealed that many of the clones are expressed most abundantly in root but less abundantly in other organs. However, two clones were highly root specific. The results show that generation of the root ESTs by partial sequencing of random cDNA clones along with the expression analysis is an efficient approach to isolate genes that are functional in plant root in a large scale. We also discuss the results of the examination of cDNA libraries and sequencing methods suitable for this approach. PMID:8029332
Chambers, David W
2005-01-01
Groups naturally promote their strengths and prefer values and rules that give them an identity and an advantage. This shows up as generational tensions across cohorts who share common experiences, including common elders. Dramatic cultural events in America since 1925 can help create an understanding of the differing value structures of the Silents, the Boomers, Gen Xers, and the Millennials. Differences in how these generations see motivation and values, fundamental reality, relations with others, and work are presented, as are some applications of these differences to the dental profession. PMID:16623137
Ojeda, Natalia
2014-01-01
Cognitive remediation improves cognition in patients with schizophrenia, but its effect on other relevant factors such as negative symptoms and functional outcome has not been extensively studied. In this hospital-based study, 84 inpatients with chronic schizophrenia were recruited from Alava Hospital (Spain). All of the subjects underwent a baseline and a 3-month assessment that examined neurocognition, clinical symptoms, insight, and functional outcome according to the Global Assessment of Functioning (GAF) scale and Disability Assessment Schedule from World Health Organization (DAS-WHO). In addition to receiving standard treatment, patients were randomly assigned either to receive neuropsychological rehabilitation (REHACOP) or to a control group. REHACOP is an integrative program that taps all basic cognitive functions. The program included experts’ latest suggestions about positive feedback and activities of daily living in the patients’ environment. The REHACOP group showed significantly greater improvements at 3 months in the areas of neurocognition, negative symptoms, disorganization, and emotional distress compared with the control group (Cohen’s effect size for these changes ranged from d = 0.47 for emotional distress to d = 0.58 for disorganization symptoms). The REHACOP group also improved significantly in both the GAF (d = 0.61) and DAS-WHO total scores (d = 0.57). Specifically, the patients showed significant improvement in vocational outcomes (d = 0.47), family contact (d = 0.50), and social competence (d = 0.56). In conclusion, neuropsychological rehabilitation may be useful for the reduction of negative symptoms and functional disability in schizophrenia. These findings support the integration of neuropsychological rehabilitation into standard treatment programs for patients with schizophrenia. PMID:23686130
NASA Technical Reports Server (NTRS)
Eck, Marshall; Mukunda, Meera
1988-01-01
A calculational method is described which provides a powerful tool for predicting solid rocket motor (SRM) casing and liquid rocket tankage fragmentation response. The approach properly partitions the available impulse to each major system-mass component. It uses the Pisces code developed by Physics International to couple the forces generated by an Eulerian-modeled gas flow field to a Lagrangian-modeled fuel and casing system. The details of the predictive analytical modeling process and the development of normalized relations for momentum partition as a function of SRM burn time and initial geometry are discussed. Methods for applying similar modeling techniques to liquid-tankage-overpressure failures are also discussed. Good agreement between predictions and observations are obtained for five specific events.
Barker, C.E.; Pawlewicz, M.J.
1993-01-01
In coal samples, published recommendations based on statistical methods suggest 100 measurements are needed to estimate the mean random vitrinite reflectance (Rv-r) to within ??2%. Our survey of published thermal maturation studies indicates that those using dispersed organic matter (DOM) mostly have an objective of acquiring 50 reflectance measurements. This smaller objective size in DOM versus that for coal samples poses a statistical contradiction because the standard deviations of DOM reflectance distributions are typically larger indicating a greater sample size is needed to accurately estimate Rv-r in DOM. However, in studies of thermal maturation using DOM, even 50 measurements can be an unrealistic requirement given the small amount of vitrinite often found in such samples. Furthermore, there is generally a reduced need for assuring precision like that needed for coal applications. Therefore, a key question in thermal maturation studies using DOM is how many measurements of Rv-r are needed to adequately estimate the mean. Our empirical approach to this problem is to compute the reflectance distribution statistics: mean, standard deviation, skewness, and kurtosis in increments of 10 measurements. This study compares these intermediate computations of Rv-r statistics with a final one computed using all measurements for that sample. Vitrinite reflectance was measured on mudstone and sandstone samples taken from borehole M-25 in the Cerro Prieto, Mexico geothermal system which was selected because the rocks have a wide range of thermal maturation and a comparable humic DOM with depth. The results of this study suggest that after only 20-30 measurements the mean Rv-r is generally known to within 5% and always to within 12% of the mean Rv-r calculated using all of the measured particles. Thus, even in the worst case, the precision after measuring only 20-30 particles is in good agreement with the general precision of one decimal place recommended for mean Rv
Abbasinia, Mohammad; Irajpour, Alireza; Babaii, Atye; Shamali, Mehdi; Vahdatnezhad, Jahanbakhsh
2014-01-01
Introduction: Endotracheal tube suctioning is essential for improve oxygenation in the patients undergoing mechanical ventilation. There are two types of shallow and deep endotracheal tube suctioning. This study aimed to evaluate the effect of shallow and deep suctioning methods on respiratory rate (RR), arterial blood oxygen saturation (SpO2) and number of suctioning in patients hospitalized in the intensive care units of Al-Zahra Hospital, Isfahan, Iran. Methods: In this randomized controlled trial, 74 patients who hospitalized in the intensive care units of Isfahan Al-Zahra Hospital were randomly allocated to the shallow and deep suctioning groups. RR and SpO2 were measured immediately before, immediately after, 1 and 3 minute after each suctioning. Number of suctioning was also noted in each groups. Data were analyzed using repeated measures analysis of variance (RMANOVA), chi-square and independent t-tests. Results: RR was significantly increased and SpO2 was significantly decreased after each suctioning in the both groups. However, these changes were not significant between the two groups. The numbers of suctioning was significantly higher in the shallow suctioning group than in the deep suctioning group. Conclusion: Shallow and deep suctioning had a similar effect on RR and SpO2. However, shallow suctioning caused further manipulation of patient's trachea than deep suctioning method. Therefore, it seems that deep endotracheal tube suctioning method can be used to clean the airway with lesser manipulation of the trachea. PMID:25276759
NASA Technical Reports Server (NTRS)
Thompson, J. F.; Mastin, C. W.; Thames, F. C.
1974-01-01
A method for automatic numerical generation of a general curvilinear coordinate system with coordinate lines coincident with all boundaries of a general multi-connected region containing any number of arbitrarily shaped bodies is presented. With this procedure the numerical solution of a partial differential system may be done on a fixed rectangular field with a square mesh with no interpolation required regardless of the shape of the physical boundaries, regardless of the spacing of the curvilinear coordinate lines in the physical field, and regardless of the movement of the coordinate system. Numerical solutions for the lifting and nonlifting potential flow about Joukowski and Karman-Trefftz airfoils using this coordinate system generation show excellent comparison with the analytic solutions. The application to fields with multiple bodies is illustrated by a potential flow solution for multiple airfoils.
2011-01-01
Background During a wildlife screening program for avian influenza A viruses (AIV) and avian paramyxoviruses (APMV) in Belgium, we isolated two hemagglutinating agents from pools of cloacal swabs of wild mallards (Anas platyrhynchos) caught in a single sampling site at two different times. AIV and APMV1 were excluded using hemagglutination inhibition (HI) testing and specific real-time RT-PCR tests. Methods To refine the virological identification of APMV2-10 realized by HI subtyping tests and in lack of validated molecular tests for APMV2-10, random access amplification was used in combination with next generation sequencing for the sequence independent identification of the viruses and the determination of their genomes. Results Three different APMVs were identified. From one pooled sample, the complete genome sequence (15054 nucleotides) of an APMV4 was assembled from the random sequences. From the second pooled sample, the nearly complete genome sequence of an APMV6 (genome size of 16236 nucleotides) was determined, as well as a partial sequence for an APMV4. This APMV4 was closely related but not identical to the APMV4 isolated from the first sample. Although a cross-reactivity with other APMV subtypes did not allow formal identification, the HI subtyping revealed APMV4 and APMV6 in the respective pooled samples but failed to identify the co-infecting APMV4 in the APMV6 infected pool. Conclusions These data further contribute to the knowledge about the genetic diversity within the serotypes APMV4 and 6, and confirm the limited sensitivity of the HI subtyping test. Moreover, this study demonstrates the value of a random access nucleic acid amplification method in combination with massive parallel sequencing. Using only a moderate and economical sequencing effort, the characterization and full genome sequencing of APMVs can be obtained, including the identification of viruses in mixed infections. PMID:21978491
NASA Astrophysics Data System (ADS)
Assad, S. M.; Thearle, O.; Lam, P. K.
2016-07-01
The rates at which a user can generate device-independent quantum random numbers from a Bell-type experiment depend on the measurements that the user performs. By numerically optimizing over these measurements, we present lower bounds on the randomness generation rates for a family of two-qubit states composed from a mixture of partially entangled states and the completely mixed state. We also report on the randomness generation rates from a tomographic measurement. Interestingly in this case, the randomness generation rates are not monotonic functions of entanglement.
Scale-invariant geometric random graphs
NASA Astrophysics Data System (ADS)
Xie, Zheng; Rogers, Tim
2016-03-01
We introduce and analyze a class of growing geometric random graphs that are invariant under rescaling of space and time. Directed connections between nodes are drawn according to influence zones that depend on node position in space and time, mimicking the heterogeneity and increased specialization found in growing networks. Through calculations and numerical simulations we explore the consequences of scale invariance for geometric random graphs generated this way. Our analysis reveals a dichotomy between scale-free and Poisson distributions of in- and out-degree, the existence of a random number of hub nodes, high clustering, and unusual percolation behavior. These properties are similar to those of empirically observed web graphs.
NASA Astrophysics Data System (ADS)
Chou, Y. C.; Hsiao, Yi-Feng; Hwang, Gwo-Jen; To, Kiwing
2016-02-01
The rotation of the γ subunit of F1-ATPase is stochastic, processive, unidirectional, reversible through an external torque, and stepwise with a slow rotation. We propose a mechanism that can explain these properties of the rotary molecular motor, and that can determine the direction of rotation. The asymmetric structures of the γ subunit, both at the tip of the shaft (C and N termini) and at the part (ɛ subunit) protruding from the α3β3 subunits, are critical. The torque required for stochastic rotation is generated from the impulsive reactive force due to the random collisions between the γ subunit and the quasihexagonal α3β3 subunits. The rotation is the result of the random motion of the confined asymmetric γ subunit. The steps originate from the chemical reactions of the γ subunit and physical interaction between the γ subunit and the flexible protrusions of the α3β3 subunits. An external torque as well as a configurational modification in the γ subunit (the central rotor) can reverse the rotational direction. We demonstrate the applicability of the mechanism to a macroscopic simulation system, which has the essential ingredients of the F1-ATPase structure, by reproducing the dynamic properties of the rotation.
Eck, Marshall B.; Mukunda, Meera
1988-10-01
The details of a predictive analytical modeling process as well as the development of normalized relations for momentum partition as a function of SRM burn time and initial geometry are discussed in this paper. Methods for applying similar modeling techniques to liquid-tankage-over-pressure failures are also discussed. These methods have been calibrated against observed SRM ascent failures and on-orbit tankage failures. Casing-quadrant sized fragments with velocities exceeding 100 m/s resulted from Titan 34D-SRM range destruct actions at 10 sec mission elapsed time (MET). Casing-quadrant sized fragments with velocities of approximately 200 m/s resulted from STS-SRM range destruct actions at 110 sec MET. Similar sized fragments for Ariane third stage and Delta second stage tankage were predicted to have maximum velocities of 260 m/s and 480 m/s respectively. Good agreement was found between the predictions and observations for five specific events and it was concluded that the methods developed have good potential for use in predicting the fragmentation process of a number of generically similar casing and tankage systems. There are three copies in the file, one of these is loose.
von Krempelhuber, Alfred; Vollmar, Jens; Pokorny, Rolf; Rapp, Petra; Wulff, Niels; Petzold, Barbara; Handley, Amanda; Mateo, Lyn; Siersbol, Henriette; Kollaritsch, Herwig; Chaplin, Paul
2009-01-01
IMVAMUNE® is a Modified Vaccinia Ankara-based virus that is being developed as a safer 3rd generation smallpox vaccine. In order to determine the optimal dose for further development, a double-blind, randomized Phase II trial was performed testing three different doses of IMVAMUNE® in 164 healthy volunteers. All three IMVAMUNE® doses displayed a favourable safety profile, with local reactions as the most frequent observation. The 1×108 TCID50 IMVAMUNE® dose induced a total antibody response in 94% of the subjects following the first vaccination and the highest peak seroconversion rates by ELISA (100%) and PRNT (71%). This IMVAMUNE® dose was considered to be optimal for the further clinical development of this highly attenuated poxvirus as a safer smallpox vaccine. PMID:19944151
NASA Astrophysics Data System (ADS)
Ježek, I.; Katrašnik, T.; Westerdahl, D.; Močnik, G.
2015-06-01
The chasing method was used in an on-road measurement campaign, and emission factors (EF) of black carbon (BC), particle number (PN) and nitrogen oxides (NOx) were determined for 139 individual vehicles of different types encountered on the roads. The aggregated results provide EFs for BC, NOx and PN for three vehicle categories: goods vehicles, gasoline and diesel passenger cars. This is the first on-road measurement study where BC EFs of numerous individual diesel cars were determined in real-world driving conditions. We found good agreement between EFs of goods vehicles determined in this campaign and the results of previous studies that used either chasing or remote sensing measurement techniques. The composition of the sampled car fleet determined from the national vehicle registry information is reflective of Eurostat statistical data on the Slovenian and European vehicle fleet. The median BC EF of diesel and gasoline cars that were in use for less than 5 years, decreased by 60 and 47% from those in use for 5-10 years, respectively, the median NOx and PN EFs, of goods vehicles that were in use for less than five years, decreased from those in use for 5-10 years by 52 and 67%, respectively. The influence of engine maximum power of the measured EFs showed an increase in NOx EF from least to more powerful vehicles with diesel engines. Finally a disproportionate contribution of high emitters to the total emissions of the measured fleet was found; the top 25% of emitting diesel cars contributed 63, 47 and 61% of BC, NOx and PN emissions respectively. With the combination of relatively simple on-road measurements with sophisticated post processing individual vehicles EF can be determined and useful information about the fleet emissions can be obtained by exactly representing vehicles which contribute disproportionally to vehicle fleet emissions; and monitor how the numerous emission reduction approaches are reflected in on-road driving conditions.
Khoshkholgh, Roghaie; Keshavarz, Tahereh; Moshfeghy, Zeinab; Akbarzadeh, Marzieh; Asadi, Nasrin; Zare, Najaf
2016-01-01
Objective: To compare the effects of two auditory methods by mother and fetus on the results of NST in 2011-2012. Materials and methods: In this single-blind clinical trial, 213 pregnant women with gestational age of 37-41 weeks who had no pregnancy complications were randomly divided into 3 groups (auditory intervention for mother, auditory intervention for fetus, and control) each containing 71 subjects. In the intervention groups, music was played through the second 10 minutes of NST. The three groups were compared regarding baseline fetal heart rate and number of accelerations in the first and second 10 minutes of NST. The data were analyzed using one-way ANOVA, Kruskal-Wallis, and paired T-test. Results: The results showed no significant difference among the three groups regarding baseline fetal heart rate in the first (p = 0.945) and second (p = 0.763) 10 minutes. However, a significant difference was found among the three groups concerning the number of accelerations in the second 10 minutes. Also, a significant difference was observed in the number of accelerations in the auditory intervention for mother (p = 0.013) and auditory intervention for fetus groups (p < 0.001). The difference between the number of accelerations in the first and second 10 minutes was also statistically significant (p = 0.002). Conclusion: Music intervention was effective in the number of accelerations which is the indicator of fetal health. Yet, further studies are required to be conducted on the issue. PMID:27385971
De, Rajat K.
2015-01-01
Copy number variation (CNV) is a form of structural alteration in the mammalian DNA sequence, which are associated with many complex neurological diseases as well as cancer. The development of next generation sequencing (NGS) technology provides us a new dimension towards detection of genomic locations with copy number variations. Here we develop an algorithm for detecting CNVs, which is based on depth of coverage data generated by NGS technology. In this work, we have used a novel way to represent the read count data as a two dimensional geometrical point. A key aspect of detecting the regions with CNVs, is to devise a proper segmentation algorithm that will distinguish the genomic locations having a significant difference in read count data. We have designed a new segmentation approach in this context, using convex hull algorithm on the geometrical representation of read count data. To our knowledge, most algorithms have used a single distribution model of read count data, but here in our approach, we have considered the read count data to follow two different distribution models independently, which adds to the robustness of detection of CNVs. In addition, our algorithm calls CNVs based on the multiple sample analysis approach resulting in a low false discovery rate with high precision. PMID:26291322
Garate, Zita; Quintana-Bustamante, Oscar; Crane, Ana M.; Olivier, Emmanuel; Poirot, Laurent; Galetto, Roman; Kosinski, Penelope; Hill, Collin; Kung, Charles; Agirre, Xabi; Orman, Israel; Cerrato, Laura; Alberquilla, Omaira; Rodriguez-Fornes, Fatima; Fusaki, Noemi; Garcia-Sanchez, Felix; Maia, Tabita M.; Ribeiro, Maria L.; Sevilla, Julian; Prosper, Felipe; Jin, Shengfang; Mountford, Joanne; Guenechea, Guillermo; Gouble, Agnes; Bueren, Juan A.; Davis, Brian R.; Segovia, Jose C.
2015-01-01
Summary Pyruvate kinase deficiency (PKD) is a rare erythroid metabolic disease caused by mutations in the PKLR gene. Erythrocytes from PKD patients show an energetic imbalance causing chronic non-spherocytic hemolytic anemia, as pyruvate kinase defects impair ATP production in erythrocytes. We generated PKD induced pluripotent stem cells (PKDiPSCs) from peripheral blood mononuclear cells (PB-MNCs) of PKD patients by non-integrative Sendai viral vectors. PKDiPSCs were gene edited to integrate a partial codon-optimized R-type pyruvate kinase cDNA in the second intron of the PKLR gene by TALEN-mediated homologous recombination (HR). Notably, we found allele specificity of HR led by the presence of a single-nucleotide polymorphism. High numbers of erythroid cells derived from gene-edited PKDiPSCs showed correction of the energetic imbalance, providing an approach to correct metabolic erythroid diseases and demonstrating the practicality of this approach to generate the large cell numbers required for comprehensive biochemical and metabolic erythroid analyses. PMID:26549847
Garate, Zita; Quintana-Bustamante, Oscar; Crane, Ana M; Olivier, Emmanuel; Poirot, Laurent; Galetto, Roman; Kosinski, Penelope; Hill, Collin; Kung, Charles; Agirre, Xabi; Orman, Israel; Cerrato, Laura; Alberquilla, Omaira; Rodriguez-Fornes, Fatima; Fusaki, Noemi; Garcia-Sanchez, Felix; Maia, Tabita M; Ribeiro, Maria L; Sevilla, Julian; Prosper, Felipe; Jin, Shengfang; Mountford, Joanne; Guenechea, Guillermo; Gouble, Agnes; Bueren, Juan A; Davis, Brian R; Segovia, Jose C
2015-12-01
Pyruvate kinase deficiency (PKD) is a rare erythroid metabolic disease caused by mutations in the PKLR gene. Erythrocytes from PKD patients show an energetic imbalance causing chronic non-spherocytic hemolytic anemia, as pyruvate kinase defects impair ATP production in erythrocytes. We generated PKD induced pluripotent stem cells (PKDiPSCs) from peripheral blood mononuclear cells (PB-MNCs) of PKD patients by non-integrative Sendai viral vectors. PKDiPSCs were gene edited to integrate a partial codon-optimized R-type pyruvate kinase cDNA in the second intron of the PKLR gene by TALEN-mediated homologous recombination (HR). Notably, we found allele specificity of HR led by the presence of a single-nucleotide polymorphism. High numbers of erythroid cells derived from gene-edited PKDiPSCs showed correction of the energetic imbalance, providing an approach to correct metabolic erythroid diseases and demonstrating the practicality of this approach to generate the large cell numbers required for comprehensive biochemical and metabolic erythroid analyses. PMID:26549847
NASA Astrophysics Data System (ADS)
Ježek, I.; Katrašnik, T.; Westerdahl, D.; Močnik, G.
2015-10-01
The chasing method was used in an on-road measurement campaign, and emission factors (EF) of black carbon (BC), particle number (PN) and nitrogen oxides (NOx) were determined for 139 individual vehicles of different types encountered on the roads. The aggregated results provide EFs for BC, NOx and PN for three vehicle categories: goods vehicles, gasoline and diesel passenger cars. This is the first on-road measurement study where BC EFs of numerous individual diesel cars were determined in real-world driving conditions. We found good agreement between EFs of goods vehicles determined in this campaign and the results of previous studies that used either chasing or remote-sensing measurement techniques. The composition of the sampled car fleet determined from the national vehicle registry information is reflective of Eurostat statistical data on the Slovenian and European vehicle fleet. The median BC EF of diesel and gasoline cars that were in use for less than 5 years decreased by 60 and 47 % from those in use for 5-10 years, respectively; the median NOx and PN EFs of goods vehicles that were in use for less than 5 years decreased from those in use for 5-10 years by 52 and 67 %, respectively. Surprisingly, we found an increase of BC EFs in the newer goods vehicle fleet compared to the 5-10-year old one. The influence of engine maximum power of the measured EFs showed an increase in NOx EF from least to more powerful vehicles with diesel engines. Finally, a disproportionate contribution of high emitters to the total emissions of the measured fleet was found; the top 25 % of emitting diesel cars contributed 63, 47 and 61 % of BC, NOx and PN emissions respectively. With the combination of relatively simple on-road measurements and sophisticated post processing, individual vehicle EF can be determined and useful information about the fleet emissions can be obtained by exactly representing vehicles which contribute disproportionally to vehicle fleet emissions; and
NASA Astrophysics Data System (ADS)
Kang, Zhiwen; Chen, Jiajie; Ho, Ho-Pui
2016-05-01
Surface-enhanced Raman scattering (SERS) typically requires hot-spots generated in nano-fabricated plasmonic structures. Here we report a highly versatile approach based on the use of random gold nano-island substrates (AuNIS). Hot spots are produced through the entrapment of colloidal plasmonic nano-crystals at the interface between AuNIS and a microbubble, which is generated from the localized plasmonic absorption of a focused laser beam. The entrapment strength is strongly dependent on the shape of the microbubble, which is in turn affected by the surface wetting characteristics of the AuNIS with respect to the solvent composition. The laser power intensity required to trigger microbubble-induced SERS is as low as 200 μW μm-2. Experimental results indicate that the SERS limit of detection (LOD) for molecules of 4-MBA (with -SH bonds) is 10-12 M, R6G or RhB (without -SH bonds) is 10-7 M. The proposed strategy has potential applications in low-cost lab-on-chip devices for the label-free detection of chemical and biological molecules.
Kang, Zhiwen; Chen, Jiajie; Ho, Ho-Pui
2016-05-21
Surface-enhanced Raman scattering (SERS) typically requires hot-spots generated in nano-fabricated plasmonic structures. Here we report a highly versatile approach based on the use of random gold nano-island substrates (AuNIS). Hot spots are produced through the entrapment of colloidal plasmonic nano-crystals at the interface between AuNIS and a microbubble, which is generated from the localized plasmonic absorption of a focused laser beam. The entrapment strength is strongly dependent on the shape of the microbubble, which is in turn affected by the surface wetting characteristics of the AuNIS with respect to the solvent composition. The laser power intensity required to trigger microbubble-induced SERS is as low as 200 μW μm(-2). Experimental results indicate that the SERS limit of detection (LOD) for molecules of 4-MBA (with -SH bonds) is 10(-12) M, R6G or RhB (without -SH bonds) is 10(-7) M. The proposed strategy has potential applications in low-cost lab-on-chip devices for the label-free detection of chemical and biological molecules. PMID:27125956
Wang, Sijian; Nan, Bin; Rosset, Saharon; Zhu, Ji
2011-03-01
We propose a computationally intensive method, the random lasso method, for variable selection in linear models. The method consists of two major steps. In step 1, the lasso method is applied to many bootstrap samples, each using a set of randomly selected covariates. A measure of importance is yielded from this step for each covariate. In step 2, a similar procedure to the first step is implemented with the exception that for each bootstrap sample, a subset of covariates is randomly selected with unequal selection probabilities determined by the covariates' importance. Adaptive lasso may be used in the second step with weights determined by the importance measures. The final set of covariates and their coefficients are determined by averaging bootstrap results obtained from step 2. The proposed method alleviates some of the limitations of lasso, elastic-net and related methods noted especially in the context of microarray data analysis: it tends to remove highly correlated variables altogether or select them all, and maintains maximal flexibility in estimating their coefficients, particularly with different signs; the number of selected variables is no longer limited by the sample size; and the resulting prediction accuracy is competitive or superior compared to the alternatives. We illustrate the proposed method by extensive simulation studies. The proposed method is also applied to a Glioblastoma microarray data analysis. PMID:22997542
Nakagawa, Masaki; Togashi, Yuichi
2016-01-01
Cell activities primarily depend on chemical reactions, especially those mediated by enzymes, and this has led to these activities being modeled as catalytic reaction networks. Although deterministic ordinary differential equations of concentrations (rate equations) have been widely used for modeling purposes in the field of systems biology, it has been pointed out that these catalytic reaction networks may behave in a way that is qualitatively different from such deterministic representation when the number of molecules for certain chemical species in the system is small. Apart from this, representing these phenomena by simple binary (on/off) systems that omit the quantities would also not be feasible. As recent experiments have revealed the existence of rare chemical species in cells, the importance of being able to model potential small-number phenomena is being recognized. However, most preceding studies were based on numerical simulations, and theoretical frameworks to analyze these phenomena have not been sufficiently developed. Motivated by the small-number issue, this work aimed to develop an analytical framework for the chemical master equation describing the distributional behavior of catalytic reaction networks. For simplicity, we considered networks consisting of two-body catalytic reactions. We used the probability generating function method to obtain the steady-state solutions of the chemical master equation without specifying the parameters. We obtained the time evolution equations of the first- and second-order moments of concentrations, and the steady-state analytical solution of the chemical master equation under certain conditions. These results led to the rank conservation law, the connecting state to the winner-takes-all state, and analysis of 2-molecules M-species systems. A possible interpretation of the theoretical conclusion for actual biochemical pathways is also discussed. PMID:27047384
Nakagawa, Masaki; Togashi, Yuichi
2016-01-01
Cell activities primarily depend on chemical reactions, especially those mediated by enzymes, and this has led to these activities being modeled as catalytic reaction networks. Although deterministic ordinary differential equations of concentrations (rate equations) have been widely used for modeling purposes in the field of systems biology, it has been pointed out that these catalytic reaction networks may behave in a way that is qualitatively different from such deterministic representation when the number of molecules for certain chemical species in the system is small. Apart from this, representing these phenomena by simple binary (on/off) systems that omit the quantities would also not be feasible. As recent experiments have revealed the existence of rare chemical species in cells, the importance of being able to model potential small-number phenomena is being recognized. However, most preceding studies were based on numerical simulations, and theoretical frameworks to analyze these phenomena have not been sufficiently developed. Motivated by the small-number issue, this work aimed to develop an analytical framework for the chemical master equation describing the distributional behavior of catalytic reaction networks. For simplicity, we considered networks consisting of two-body catalytic reactions. We used the probability generating function method to obtain the steady-state solutions of the chemical master equation without specifying the parameters. We obtained the time evolution equations of the first- and second-order moments of concentrations, and the steady-state analytical solution of the chemical master equation under certain conditions. These results led to the rank conservation law, the connecting state to the winner-takes-all state, and analysis of 2-molecules M-species systems. A possible interpretation of the theoretical conclusion for actual biochemical pathways is also discussed. PMID:27047384
Körbelin, Jakob; Sieber, Timo; Michelfelder, Stefan; Lunding, Lars; Spies, Elmar; Hunger, Agnes; Alawi, Malik; Rapti, Kleopatra; Indenbirken, Daniela; Müller, Oliver J; Pasqualini, Renata; Arap, Wadih; Kleinschmidt, Jürgen A; Trepel, Martin
2016-06-01
Vectors mediating strong, durable, and tissue-specific transgene expression are mandatory for safe and effective gene therapy. In settings requiring systemic vector administration, the availability of suited vectors is extremely limited. Here, we present a strategy to select vectors with true specificity for a target tissue from random peptide libraries displayed on adeno-associated virus (AAV) by screening the library under circulation conditions in a murine model. Guiding the in vivo screening by next-generation sequencing, we were able to monitor the selection kinetics and to determine the right time point to discontinue the screening process. The establishment of different rating scores enabled us to identify the most specifically enriched AAV capsid candidates. As proof of concept, a capsid variant was selected that specifically and very efficiently delivers genes to the endothelium of the pulmonary vasculature after intravenous administration. This technical approach of selecting target-specific vectors in vivo is applicable to any given tissue of interest and therefore has broad implications in translational research and medicine. PMID:27018516
Yamamoto, Toshiyuki; Shimojima, Keiko; Ondo, Yumiko; Imai, Katsumi; Chong, Pin Fee; Kira, Ryutaro; Amemiya, Mitsuhiro; Saito, Akira; Okamoto, Nobuhiko
2016-01-01
Next-generation sequencing (NGS) is widely used for the detection of disease-causing nucleotide variants. The challenges associated with detecting copy number variants (CNVs) using NGS analysis have been reported previously. Disease-related exome panels such as Illumina TruSight One are more cost-effective than whole-exome sequencing (WES) because of their selective target regions (~21% of the WES). In this study, CNVs were analyzed using data extracted through a disease-related exome panel analysis and the eXome Hidden Markov Model (XHMM). Samples from 61 patients with undiagnosed developmental delays and 52 healthy parents were included in this study. In the preliminary study to validate the constructed XHMM system (microarray-first approach), 34 patients who had previously been analyzed by chromosomal microarray testing were used. Among the five CNVs larger than 200 kb that were considered as non-pathogenic CNVs and were used as positive controls, four CNVs was successfully detected. The system was subsequently used to analyze different samples from 27 patients (NGS-first approach); 2 of these patients were successfully diagnosed as having pathogenic CNVs (an unbalanced translocation der(5)t(5;14) and a 16p11.2 duplication). These diagnoses were re-confirmed by chromosomal microarray testing and/or fluorescence in situ hybridization. The NGS-first approach generated no false-negative or false-positive results for pathogenic CNVs, indicating its high sensitivity and specificity in detecting pathogenic CNVs. The results of this study show the possible clinical utility of pathogenic CNV screening using disease-related exome panel analysis and XHMM. PMID:27579173
Yamamoto, Toshiyuki; Shimojima, Keiko; Ondo, Yumiko; Imai, Katsumi; Chong, Pin Fee; Kira, Ryutaro; Amemiya, Mitsuhiro; Saito, Akira; Okamoto, Nobuhiko
2016-01-01
Next-generation sequencing (NGS) is widely used for the detection of disease-causing nucleotide variants. The challenges associated with detecting copy number variants (CNVs) using NGS analysis have been reported previously. Disease-related exome panels such as Illumina TruSight One are more cost-effective than whole-exome sequencing (WES) because of their selective target regions (~21% of the WES). In this study, CNVs were analyzed using data extracted through a disease-related exome panel analysis and the eXome Hidden Markov Model (XHMM). Samples from 61 patients with undiagnosed developmental delays and 52 healthy parents were included in this study. In the preliminary study to validate the constructed XHMM system (microarray-first approach), 34 patients who had previously been analyzed by chromosomal microarray testing were used. Among the five CNVs larger than 200 kb that were considered as non-pathogenic CNVs and were used as positive controls, four CNVs was successfully detected. The system was subsequently used to analyze different samples from 27 patients (NGS-first approach); 2 of these patients were successfully diagnosed as having pathogenic CNVs (an unbalanced translocation der(5)t(5;14) and a 16p11.2 duplication). These diagnoses were re-confirmed by chromosomal microarray testing and/or fluorescence in situ hybridization. The NGS-first approach generated no false-negative or false-positive results for pathogenic CNVs, indicating its high sensitivity and specificity in detecting pathogenic CNVs. The results of this study show the possible clinical utility of pathogenic CNV screening using disease-related exome panel analysis and XHMM. PMID:27579173
NASA Technical Reports Server (NTRS)
Parsons-Wingerter, Patricia; Elliott, Katherine E.; Farr, Andrew G.; Radhakrishnan, Krishnan; Clark, John I.; Sage, E. Helene
2000-01-01
Quantitative analysis of vascular generational branching demonstrated that transforming growth factor-beta1 (TGF-beta1), a multifunctional cytokine and angiogenic regulator, strongly inhibited angiogenesis in the arterial tree of the developing quail chorioallantoic membrane (CAM) by inhibition of the normal increase in the number of new, small vessels. The cytokine was applied uniformly in solution at embryonic day 7 (E7) to the CAMs of quail embryos cultured in petri dishes. After 24 h the rate of arterial growth was inhibited by as much as 105% as a function of increasing TGF-beta1 concentration. Inhibition of the rate of angiogenesis in the arterial tree by TGF-beta1 relative to controls was measured in digital images by three well-correlated, computerized methods. The first computerized method, direct measurement by the computer code VESGEN of vascular morphological parameters according to branching generations G(sub 1) through G(sub greater than or equal to 5), revealed that TGF-beta1 selectively inhibited the increase in the number density of small vessels, N(sub v greater than or equal to 5), (382 plus or minus 85 per square centimeter) for specimens treated with 1 microgram TGF-beta1/CAM for 24 h, compared to 583 plus or minus 99 per square centimeter for controls), but did not significantly affect other parameters such as average vessel length or vessel diameter. The second and third methods, the fractal dimension (D(sub f)) and grid intersection (rho (sub v)), are statistical descriptors of spatial pattern and density. According to D(sub f) and rho(sub v), arterial density increased in control specimens from 1.382 plus or minus 0.007 and 662 plus or minus 52 per square centimeters at E7 (0 h) to 1.439 plus or minus 0.013 and 884 plus or minus 55 per square centimeters at E8 (24 h), compared to 1.379 plus or minus 0.039 and 650 plus or minus 111 per square centimeter for specimens treated with 1 microgram TGF-beta1/CAM for 24 h. TGF-beta1 therefore
Evans, Joseph; Kim, Jeongwoon; Childs, Kevin L; Vaillancourt, Brieanne; Crisovan, Emily; Nandety, Aruna; Gerhardt, Daniel J; Richmond, Todd A; Jeddeloh, Jeffrey A; Kaeppler, Shawn M; Casler, Michael D; Buell, C Robin
2014-01-01
Switchgrass (Panicum virgatum) is a polyploid, outcrossing grass species native to North America and has recently been recognized as a potential biofuel feedstock crop. Significant phenotypic variation including ploidy is present across the two primary ecotypes of switchgrass, referred to as upland and lowland switchgrass. The tetraploid switchgrass genome is approximately 1400 Mbp, split between two subgenomes, with significant repetitive sequence content limiting the efficiency of re-sequencing approaches for determining genome diversity. To characterize genetic diversity in upland and lowland switchgrass as a first step in linking genotype to phenotype, we designed an exome capture probe set based on transcript assemblies that represent approximately 50 Mb of annotated switchgrass exome sequences. We then evaluated and optimized the probe set using solid phase comparative genome hybridization and liquid phase exome capture followed by next-generation sequencing. Using the optimized probe set, we assessed variation in the exomes of eight switchgrass genotypes representing tetraploid lowland and octoploid upland cultivars to benchmark our exome capture probe set design. We identified ample variation in the switchgrass genome including 1 395 501 single nucleotide polymorphisms (SNPs), 8173 putative copy number variants and 3336 presence/absence variants. While the majority of the SNPs (84%) detected was bi-allelic, a substantial number was tri-allelic with limited occurrence of tetra-allelic polymorphisms consistent with the heterozygous and polyploid nature of the switchgrass genome. Collectively, these data demonstrate the efficacy of exome capture for discovery of genome variation in a polyploid species with a large, repetitive and heterozygous genome. PMID:24947485
Chen, Xinguang; Yu, Bin; Zhou, Dunjin; Zhou, Wang; Gong, Jie; Li, Shiyue; Stanton, Bonita
2015-01-01
Background Mobile populations and men who have sex with men (MSM) play an increasing role in the current HIV epidemic in China and across the globe. While considerable research has addressed both of these at-risk populations, more effective HIV control requires accurate data on the number of MSM at the population level, particularly MSM among migrant populations. Methods Survey data from a random sample of male rural-to-urban migrants (aged 18-45, n=572) in Wuhan, China were analyzed and compared with those of randomly selected non-migrant urban (n=566) and rural counterparts (580). The GIS/GPS technologies were used for sampling and the survey estimation method was used for data analysis. Results HIV-related risk behaviors among rural-to-urban migrants were similar to those among the two comparison groups. The estimated proportion of MSM among migrants [95% CI] was 5.8% [4.7, 6.8], higher than 2.8% [1.2, 4.5] for rural residents and 1.0% [0.0, 2.4] for urban residents, respectively. Among these migrants, the MSM were more likely than non-MSM to be older in age, married, and migrated to more cities. They were also more likely to co-habit with others in rental properties located in new town and neighborhoods with fewer old acquaintances and more entertainment establishments. In addition, they were more likely to engage in commercial sex and less likely to consistently use condoms. Conclusion Findings of this study indicate that compared to rural and urban populations, the migrant population in Wuhan consists of a higher proportion of MSM who also exhibit higher levels of HIV-related risk behaviors. More effective interventions should target this population with a focus on neighborhood factors, social capital and collective efficacy for risk reduction. PMID:26241900
Randomness versus deterministic chaos: Effect on invasion percolation clusters
NASA Astrophysics Data System (ADS)
Peng, Chung-Kang; Prakash, Sona; Herrmann, Hans J.; Stanley, H. Eugene
1990-10-01
What is the difference between randomness and chaos \\? Although one can define randomness and one can define chaos, one cannot easily assess the difference in a practical situation. Here we compare the results of these two antipodal approaches on a specific example. Specifically, we study how well the logistic map in its chaotic regime can be used as quasirandom number generator by calculating pertinent properties of a well-known random process: invasion percolation. Only if λ>λ*1 (the first reverse bifurcation point) is a smooth extrapolation in system size possible, and percolation exponents are retrieved. If λ≠1, a sequential filling of the lattice with the random numbers generates a measurable anisotropy in the growth sequence of the clusters, due to short-range correlations.
Sultana, Tahmina; Nakayama, Emi E; Tobita, Satoshi; Yokoyama, Masaru; Seki, Yohei; Saito, Akatsuki; Nomaguchi, Masako; Adachi, Akio; Akari, Hirofumi; Sato, Hironori; Shioda, Tatsuo
2016-04-01
Old World monkey TRIM5α strongly suppresses human immunodeficiency virus type 1 (HIV-1) replication. A fusion protein comprising cynomolgus macaque (CM) TRIM5 and cyclophilin A (CM TRIMCyp) also potently suppresses HIV-1 replication. However, CM TRIMCyp fails to suppress a mutant HIV-1 that encodes a mutant capsid protein containing a SIVmac239-derived loop between α-helices 4 and 5 (L4/5). There are seven amino acid differences between L4/5 of HIV-1 and SIVmac239. Here, we investigated the minimum numbers of amino acid substitutions that would allow HIV-1 to evade CM TRIMCyp-mediated suppression. We performed random PCR mutagenesis to construct a library of HIV-1 variants containing mutations in L4/5, and then we recovered replication-competent viruses from CD4+ MT4 cells that expressed high levels of CM TRIMCyp. CM TRIMCyp-resistant viruses were obtained after three rounds of selection in MT4 cells expressing CM TRIMCyp and these were found to contain four amino acid substitutions (H87R, A88G, P90D and P93A) in L4/5. We then confirmed that these substitutions were sufficient to confer CM TRIMCyp resistance to HIV-1. In a separate experiment using a similar method, we obtained novel CM TRIM5α-resistant HIV-1 strains after six rounds of selection and rescue. Analysis of these mutants revealed that V86A and G116E mutations in the capsid region conferred partial resistance to CM TRIM5α without substantial fitness cost when propagated in MT4 cells expressing CM TRIM5α. These results confirmed and further extended the previous notion that CM TRIMCyp and CM TRIM5α recognize the HIV-1 capsid in different manners. PMID:26795727
NASA Astrophysics Data System (ADS)
Cooper, Colin; Frieze, Alan
The aim of this article is to discuss some of the notions and applications of random walks on finite graphs, especially as they apply to random graphs. In this section we give some basic definitions, in Section 2 we review applications of random walks in computer science, and in Section 3 we focus on walks in random graphs.
NASA Astrophysics Data System (ADS)
Chung, S. H.; Lee-Taylor, J.; Asher, W.; Hodzic, A.; Madronich, S.; Aumont, B.; Pankow, J. F.; Barsanti, K. C.
2012-12-01
A major weakness in current air quality and climate models is the ability to simulate secondary organic aerosol (SOA) levels and physiochemical properties accurately. A new approach to model SOA formation is the carbon number (nc) polarity grid (CNPG) framework. The CNPG framework makes use of a nc vs. polarity grid for representing relevant organic compounds and their time-dependent concentrations. The nc vs polarity grid is well suited for modeling SOA because nc together with some suitable measure of total molecular polarity provides the minimum yet sufficient formation for estimating the parameters required to calculate partitioning coefficients. Furthermore, CNPG allows consideration of the effects of variation in the activity coefficients of the partitioning compounds, variation in the mean molecular weight of the absorbing organic phase, water uptake, and the possibility of phase separation in the organic aerosol phase. In this work, we use the GECKO-A (Generator of Explicit Chemistry and Kinetics of Organics in the Atmosphere) chemistry mechanism to produce the chemical structures of SOA precursor oxidization products and their time-dependent concentrations. The SIMPOL group contribution method is used to calculate the enthalpy of vaporization ΔHvap for each product. The total molecular polarity is then calculated as ΔHvap,diff, the difference between each compound's ΔHvap and that of its carbon-number equivalent straight-chain hydrocarbon. The gas- and particle-phase concentrations of each compound are mapped onto the nc vs polarity grid as a function of time to evaluate the time evolution of SOA-relevant oxidation products and to help guide lumping strategies for reducing complexity. In addition to using ΔHvap,diff, use of other measures of polarity will also be explored. Initial SOA precursor studies include toluene (C7) + n-heptadecane (C17) and α-pinene, under atmospherically relevant conditions. Results will be discussed in the context of the
A Random Variable Transformation Process.
ERIC Educational Resources Information Center
Scheuermann, Larry
1989-01-01
Provides a short BASIC program, RANVAR, which generates random variates for various theoretical probability distributions. The seven variates include: uniform, exponential, normal, binomial, Poisson, Pascal, and triangular. (MVL)
Electrokinetic transport in microchannels with random roughness
Wang, Moran; Kang, Qinjun
2008-01-01
We present a numerical framework to model the electrokinetic transport in microchannels with random roughness. The three-dimensional microstructure of the rough channel is generated by a random generation-growth method with three statistical parameters to control the number density, the total volume fraction, and the anisotropy characteristics of roughness elements. The governing equations for the electrokinetic transport are solved by a high-efficiency lattice Poisson?Boltzmann method in complex geometries. The effects from the geometric characteristics of roughness on the electrokinetic transport in microchannels are therefore modeled and analyzed. For a given total roughness volume fraction, a higher number density leads to a lower fluctuation because of the random factors. The electroosmotic flow rate increases with the roughness number density nearly logarithmically for a given volume fraction of roughness but decreases with the volume fraction for a given roughness number density. When both the volume fraction and the number density of roughness are given, the electroosmotic flow rate is enhanced by the increase of the characteristic length along the external electric field direction but is reduced by that in the direction across the channel. For a given microstructure of the rough microchannel, the electroosmotic flow rate decreases with the Debye length. It is found that the shape resistance of roughness is responsible for the flow rate reduction in the rough channel compared to the smooth channel even for very thin double layers, and hence plays an important role in microchannel electroosmotic flows.
Sunspot random walk and 22-year variation
Love, Jeffrey J.; Rigler, E. Joshua
2012-01-01
We examine two stochastic models for consistency with observed long-term secular trends in sunspot number and a faint, but semi-persistent, 22-yr signal: (1) a null hypothesis, a simple one-parameter random-walk model of sunspot-number cycle-to-cycle change, and, (2) an alternative hypothesis, a two-parameter random-walk model with an imposed 22-yr alternating amplitude. The observed secular trend in sunspots, seen from solar cycle 5 to 23, would not be an unlikely result of the accumulation of multiple random-walk steps. Statistical tests show that a 22-yr signal can be resolved in historical sunspot data; that is, the probability is low that it would be realized from random data. On the other hand, the 22-yr signal has a small amplitude compared to random variation, and so it has a relatively small effect on sunspot predictions. Many published predictions for cycle 24 sunspots fall within the dispersion of previous cycle-to-cycle sunspot differences. The probability is low that the Sun will, with the accumulation of random steps over the next few cycles, walk down to a Dalton-like minimum. Our models support published interpretations of sunspot secular variation and 22-yr variation resulting from cycle-to-cycle accumulation of dynamo-generated magnetic energy.
Sunspot random walk and 22-year variation
NASA Astrophysics Data System (ADS)
Love, Jeffrey J.; Rigler, E. Joshua
2012-05-01
We examine two stochastic models for consistency with observed long-term secular trends in sunspot number and a faint, but semi-persistent, 22-yr signal: (1) a null hypothesis, a simple one-parameter log-normal random-walk model of sunspot-number cycle-to-cycle change, and, (2) an alternative hypothesis, a two-parameter random-walk model with an imposed 22-yr alternating amplitude. The observed secular trend in sunspots, seen from solar cycle 5 to 23, would not be an unlikely result of the accumulation of multiple random-walk steps. Statistical tests show that a 22-yr signal can be resolved in historical sunspot data; that is, the probability is low that it would be realized from random data. On the other hand, the 22-yr signal has a small amplitude compared to random variation, and so it has a relatively small effect on sunspot predictions. Many published predictions for cycle 24 sunspots fall within the dispersion of previous cycle-to-cycle sunspot differences. The probability is low that the Sun will, with the accumulation of random steps over the next few cycles, walk down to a Dalton-like minimum. Our models support published interpretations of sunspot secular variation and 22-yr variation resulting from cycle-to-cycle accumulation of dynamo-generated magnetic energy.
Probabilistic Evaluation of Wind Power Generation
NASA Astrophysics Data System (ADS)
Muhamad Razali, N. M.; Misbah, Muizzuddin
2013-06-01
The power supplied by wind turbine generators (WTG) is widely random following the stochastic nature of weather conditions. For planning and decision making purposes, understanding and evaluation of the behaviour and distribution of WTG's output power are crucial. Monte Carlo simulation enables the realization of artificial futures by generating a huge number of sample paths of outcomes to perform this analysis. The paper presents an algorithm developed for a random wind speed generator governed by the probability density function of Weibull distribution and evaluates the WTG's output by using the power curve of wind turbines. The method may facilitate assessment of suitable turbine site as well as generator selection and sizing.
2013-01-01
Background Our main objective was to evaluate the ability of cranberry phytochemicals to modify immunity, specifically γδ-T cell proliferation, after daily consumption of a cranberry beverage, and its effect on health outcomes related to cold and influenza symptoms. Methods The study was a randomized, double-blind, placebo-controlled, parallel intervention. Subjects drank a low calorie cranberry beverage (450 ml) made with a juice-derived, powdered cranberry fraction (n = 22) or a placebo beverage (n = 23), daily, for 10 wk. PBMC were cultured for six days with autologous serum and PHA-L stimulation. Cold and influenza symptoms were self-reported. Results The proliferation index of γδ-T cells in culture was almost five times higher after 10 wk of cranberry beverage consumption (p <0.001). In the cranberry beverage group, the incidence of illness was not reduced, however significantly fewer symptoms of illness were reported (p = 0.031). Conclusions Consumption of the cranberry beverage modified the ex vivo proliferation of γδ-T cells. As these cells are located in the epithelium and serve as a first line of defense, improving their function may be related to reducing the number of symptoms associated with a cold and flu. Trial registration ClinicalTrials.gov Identifier: NCT01398150. PMID:24330619
On Convergent Probability of a Random Walk
ERIC Educational Resources Information Center
Lee, Y.-F.; Ching, W.-K.
2006-01-01
This note introduces an interesting random walk on a straight path with cards of random numbers. The method of recurrent relations is used to obtain the convergent probability of the random walk with different initial positions.
Experimental evidence of quantum randomness incomputability
Calude, Cristian S.; Dinneen, Michael J.; Dumitrescu, Monica; Svozil, Karl
2010-08-15
In contrast with software-generated randomness (called pseudo-randomness), quantum randomness can be proven incomputable; that is, it is not exactly reproducible by any algorithm. We provide experimental evidence of incomputability--an asymptotic property--of quantum randomness by performing finite tests of randomness inspired by algorithmic information theory.
ERIC Educational Resources Information Center
Swafford, Jane; McGinty, Robert
1978-01-01
A concrete approach to prime numbers is presented using rectangles and triangles to construct a building for each number so that each story represents a pair of factors and the triangular-shaped roof represents the number. (MP)
Ellingson, R.
2010-08-01
The purpose of the project was to develop new design and fabrication techniques for NC solar cells with the goal of demonstrating enhanced photocurrent and efficiency by exploiting multiple exciton generation and to investigate multiple exciton generation and charge carrier dynamics in semiconductor NC films used in NC-based solar cells.
USER S GUIDE FOR THE RANDOM DRUG SCREENING SYSTEM
McNeany, Karen I
2013-12-01
The Random Drug Screening System (RDSS) is a desktop computing application designed to assign nongameable drug testing dates to each member in a population of employees, within a specific time line. The program includes reporting capabilities, test form generation, unique test ID number assignment, and the ability to flag high-risk employees for a higher frequency of drug testing than the general population.
Blocked randomization with randomly selected block sizes.
Efird, Jimmy
2011-01-01
When planning a randomized clinical trial, careful consideration must be given to how participants are selected for various arms of a study. Selection and accidental bias may occur when participants are not assigned to study groups with equal probability. A simple random allocation scheme is a process by which each participant has equal likelihood of being assigned to treatment versus referent groups. However, by chance an unequal number of individuals may be assigned to each arm of the study and thus decrease the power to detect statistically significant differences between groups. Block randomization is a commonly used technique in clinical trial design to reduce bias and achieve balance in the allocation of participants to treatment arms, especially when the sample size is small. This method increases the probability that each arm will contain an equal number of individuals by sequencing participant assignments by block. Yet still, the allocation process may be predictable, for example, when the investigator is not blind and the block size is fixed. This paper provides an overview of blocked randomization and illustrates how to avoid selection bias by using random block sizes. PMID:21318011
Ovchinnikov, O. S.; Jesse, S.; Kalinin, S. V.; Bintacchit, P.; Trolier-McKinstry, S.
2009-10-09
An approach for the direct identification of disorder type and strength in physical systems based on recognition analysis of hysteresis loop shape is developed. A large number of theoretical examples uniformly distributed in the parameter space of the system is generated and is decorrelated using principal component analysis (PCA). The PCA components are used to train a feed-forward neural network using the model parameters as targets. The trained network is used to analyze hysteresis loops for the investigated system. The approach is demonstrated using a 2D random-bond-random-field Ising model, and polarization switching in polycrystalline ferroelectric capacitors.
NASA Astrophysics Data System (ADS)
De Gregorio, Alessandro; Orsingher, Enzo
2015-09-01
We consider random flights in reflecting on the surface of a sphere with center at the origin and with radius R, where reflection is performed by means of circular inversion. Random flights studied in this paper are motions where the orientation of the deviations are uniformly distributed on the unit-radius sphere . We obtain the explicit probability distributions of the position of the moving particle when the number of changes of direction is fixed and equal to . We show that these distributions involve functions which are solutions of the Euler-Poisson-Darboux equation. The unconditional probability distributions of the reflecting random flights are obtained by suitably randomizing n by means of a fractional-type Poisson process. Random flights reflecting on hyperplanes according to the optical reflection form are considered and the related distributional properties derived.
Moving along the Mental Number Line: Interactions between Whole-Body Motion and Numerical Cognition
ERIC Educational Resources Information Center
Hartmann, Matthias; Grabherr, Luzia; Mast, Fred W.
2012-01-01
Active head turns to the left and right have recently been shown to influence numerical cognition by shifting attention along the mental number line. In the present study, we found that passive whole-body motion influences numerical cognition. In a random-number generation task (Experiment 1), leftward and downward displacement of participants…
NASA Astrophysics Data System (ADS)
Shin, Philip
Number relativity 1.Every equation of the relativity is just the way to understand through to solve one question of the math problem. We just add the hypothesis into the number. 2. Sequence of number is the machine physics for software(computer) as the number order is program equation as calculator. 3. When zero is denominator, it is not existing as it is doing something by nothing. So nothing means time as we put zero denominator into time. My personal physics imagine.
ERIC Educational Resources Information Center
Rich, Andrew
2008-01-01
The leftist number system consists of numbers with decimal digits arranged in strings to the left, instead of to the right. This system fails to be a field only because it contains zerodivisors. The same construction with prime base yields the p-adic numbers.
NASA Astrophysics Data System (ADS)
Jung, P.; Talkner, P.
2010-09-01
A simple way to convert a purely random sequence of events into a signal with a strong periodic component is proposed. The signal consists of those instants of time at which the length of the random sequence exceeds an integer multiple of a given number. The larger this number the more pronounced the periodic behavior becomes.
Clauser-Horne Bell test with imperfect random inputs
NASA Astrophysics Data System (ADS)
Yuan, Xiao; Zhao, Qi; Ma, Xiongfeng
2015-08-01
The Bell test is one of the most important tools in quantum information science. On the one hand, it enables fundamental tests of the basic physics laws of nature, and on the other hand, it can also be applied in a variety of device-independent tasks such as quantum key distribution and random number generation. In practice, loopholes existing in experimental demonstrations of Bell tests may affect the validity of the conclusions. In this work, we focus on the randomness (freewill) loophole and investigate the randomness requirement in a well-known Bell test, the Clauser-Horne test, under various conditions. We explicitly bound the Bell value for all local hidden variable models by optimizing over all classical strategies exploiting the knowledge of the partially random inputs. Our result thus provides input randomness requirements on the Clauser-Horne test under varieties of practical scenarios. The employed analysis technique can also be generalized to other Bell inequalities.
Modelling Of Random Vertical Irregularities Of Railway Tracks
NASA Astrophysics Data System (ADS)
Podwórna, M.
2015-08-01
The study presents state-of-the-art in analytical and numerical modelling of random vertical irregularities of continuously welded ballasted railway tracks. The common model of railway track irregularity vertical profiles is applied, in the form of a stationary and ergodic Gaussian process in space. Random samples of track irregularity vertical profiles are generated with the Monte-Carlo method. Based on the numerical method developed in the study, the minimum and recommended sampling number required in the random analysis of railway bridges and number of frequency increments (harmonic components) in track irregularity vertical profiles simulation are determined. The lower and upper limits of wavelengths are determined based on the literature studies. The approach yields track irregularity random samples close to reality. The track irregularity model developed in the study can be used in the dynamic analysis of railway bridge / track structure / highspeed train systems.
NASA Astrophysics Data System (ADS)
Cohen, Graeme L.
2009-03-01
Let tau(n) denote the number of positive divisors of a natural number n>1 and let sigma(n) denote their sum. Then n is superharmonic if sigma(n)mid n^ktau(n) for some positive integer k . We deduce numerous properties of superharmonic numbers and show in particular that the set of all superharmonic numbers is the first nontrivial example that has been given of an infinite set that contains all perfect numbers but for which it is difficult to determine whether there is an odd member.
ERIC Educational Resources Information Center
Nagasawa, Yoshinori; Demura, Shinichi
2011-01-01
This study examined age-group corresponding relationships of the controlled force exertion based on sinusoidal and quasi-random waveforms in 175 right-handed male adults aged 20 to 86 years. The subjects were divided into 3 groups based on age-level: 53 young (mean age 24.6, SD = 3.3 years), 71 middle aged (mean age 44.3, SD = 8.7 years), and 51…
Randomness versus nonlocality and entanglement.
Acín, Antonio; Massar, Serge; Pironio, Stefano
2012-03-01
The outcomes obtained in Bell tests involving two-outcome measurements on two subsystems can, in principle, generate up to 2 bits of randomness. However, the maximal violation of the Clauser-Horne-Shimony-Holt inequality guarantees the generation of only 1.23 bits of randomness. We prove here that quantum correlations with arbitrarily little nonlocality and states with arbitrarily little entanglement can be used to certify that close to the maximum of 2 bits of randomness are produced. Our results show that nonlocality, entanglement, and randomness are inequivalent quantities. They also imply that device-independent quantum key distribution with an optimal key generation rate is possible by using almost-local correlations and that device-independent randomness generation with an optimal rate is possible with almost-local correlations and with almost-unentangled states. PMID:22463395