WorldWideScience

Sample records for random number technique

  1. [Intel random number generator-based true random number generator].

    Science.gov (United States)

    Huang, Feng; Shen, Hong

    2004-09-01

    To establish a true random number generator on the basis of certain Intel chips. The random numbers were acquired by programming using Microsoft Visual C++ 6.0 via register reading from the random number generator (RNG) unit of an Intel 815 chipset-based computer with Intel Security Driver (ISD). We tested the generator with 500 random numbers in NIST FIPS 140-1 and X(2) R-Squared test, and the result showed that the random number it generated satisfied the demand of independence and uniform distribution. We also compared the random numbers generated by Intel RNG-based true random number generator and those from the random number table statistically, by using the same amount of 7500 random numbers in the same value domain, which showed that the SD, SE and CV of Intel RNG-based random number generator were less than those of the random number table. The result of u test of two CVs revealed no significant difference between the two methods. Intel RNG-based random number generator can produce high-quality random numbers with good independence and uniform distribution, and solves some problems with random number table in acquisition of the random numbers.

  2. Pseudo-random number generator for the Sigma 5 computer

    Science.gov (United States)

    Carroll, S. N.

    1983-01-01

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

  3. Evidence of significant bias in an elementary random number generator

    International Nuclear Information System (INIS)

    Borgwaldt, H.; Brandl, V.

    1981-03-01

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

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

    Science.gov (United States)

    Danesh, Iraj

    1991-01-01

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

  5. New Trends in Pseudo-Random Number Generation

    Science.gov (United States)

    Gutbrod, F.

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

  6. Self-correcting random number generator

    Science.gov (United States)

    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.

  7. Random number generation

    International Nuclear Information System (INIS)

    Coveyou, R.R.

    1974-01-01

    The subject of random number generation is currently controversial. Differing opinions on this subject seem to stem from implicit or explicit differences in philosophy; in particular, from differing ideas concerning the role of probability in the real world of physical processes, electronic computers, and Monte Carlo calculations. An attempt is made here to reconcile these views. The role of stochastic ideas in mathematical models is discussed. In illustration of these ideas, a mathematical model of the use of random number generators in Monte Carlo calculations is constructed. This model is used to set up criteria for the comparison and evaluation of random number generators. (U.S.)

  8. Quantum random number generator

    Science.gov (United States)

    Soubusta, Jan; Haderka, Ondrej; Hendrych, Martin

    2001-03-01

    Since reflection or transmission of a quantum particle on a beamsplitter is inherently random quantum process, a device built on this principle does not suffer from drawbacks of neither pseudo-random computer generators or classical noise sources. Nevertheless, a number of physical conditions necessary for high quality random numbers generation must be satisfied. Luckily, in quantum optics realization they can be well controlled. We present an easy random number generator based on the division of weak light pulses on a beamsplitter. The randomness of the generated bit stream is supported by passing the data through series of 15 statistical test. The device generates at a rate of 109.7 kbit/s.

  9. DNA-based random number generation in security circuitry.

    Science.gov (United States)

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

    2010-06-01

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

  10. Quantum random number generator

    Science.gov (United States)

    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.

  11. Random number generation and creativity.

    Science.gov (United States)

    Bains, William

    2008-01-01

    A previous paper suggested that humans can generate genuinely random numbers. I tested this hypothesis by repeating the experiment with a larger number of highly numerate subjects, asking them to call out a sequence of digits selected from 0 through 9. The resulting sequences were substantially non-random, with an excess of sequential pairs of numbers and a deficit of repeats of the same number, in line with previous literature. However, the previous literature suggests that humans generate random numbers with substantial conscious effort, and distractions which reduce that effort reduce the randomness of the numbers. I reduced my subjects' concentration by asking them to call out in another language, and with alcohol - neither affected the randomness of their responses. This suggests that the ability to generate random numbers is a 'basic' function of the human mind, even if those numbers are not mathematically 'random'. I hypothesise that there is a 'creativity' mechanism, while not truly random, provides novelty as part of the mind's defence against closed programming loops, and that testing for the effects seen here in people more or less familiar with numbers or with spontaneous creativity could identify more features of this process. It is possible that training to perform better at simple random generation tasks could help to increase creativity, through training people to reduce the conscious mind's suppression of the 'spontaneous', creative response to new questions.

  12. On the number of subgraphs of the Barabasi-Albert random graph

    Energy Technology Data Exchange (ETDEWEB)

    Ryabchenko, Aleksandr A; Samosvat, Egor A [Moscow Institute of Physics and Technology (State University), Dolgoprudnyi, Moscow Region, Russian Frderation (Russian Federation)

    2012-06-30

    We study a model of a random graph of the type of the Barabasi-Albert preferential attachment model. We develop a technique that makes it possible to estimate the mathematical expectation for a fairly wide class of random variables in the model under consideration. We use this technique to prove a theorem on the asymptotics of the mathematical expectation of the number of subgraphs isomorphic to a certain fixed graph in the random graphs of this model.

  13. Non-periodic pseudo-random numbers used in Monte Carlo calculations

    Science.gov (United States)

    Barberis, Gaston E.

    2007-09-01

    The generation of pseudo-random numbers is one of the interesting problems in Monte Carlo simulations, mostly because the common computer generators produce periodic numbers. We used simple pseudo-random numbers generated with the simplest chaotic system, the logistic map, with excellent results. The numbers generated in this way are non-periodic, which we demonstrated for 1013 numbers, and they are obtained in a deterministic way, which allows to repeat systematically any calculation. The Monte Carlo calculations are the ideal field to apply these numbers, and we did it for simple and more elaborated cases. Chemistry and Information Technology use this kind of simulations, and the application of this numbers to quantum Monte Carlo and cryptography is immediate. I present here the techniques to calculate, analyze and use these pseudo-random numbers, show that they lack periodicity up to 1013 numbers and that they are not correlated.

  14. Non-periodic pseudo-random numbers used in Monte Carlo calculations

    International Nuclear Information System (INIS)

    Barberis, Gaston E.

    2007-01-01

    The generation of pseudo-random numbers is one of the interesting problems in Monte Carlo simulations, mostly because the common computer generators produce periodic numbers. We used simple pseudo-random numbers generated with the simplest chaotic system, the logistic map, with excellent results. The numbers generated in this way are non-periodic, which we demonstrated for 10 13 numbers, and they are obtained in a deterministic way, which allows to repeat systematically any calculation. The Monte Carlo calculations are the ideal field to apply these numbers, and we did it for simple and more elaborated cases. Chemistry and Information Technology use this kind of simulations, and the application of this numbers to quantum Monte Carlo and cryptography is immediate. I present here the techniques to calculate, analyze and use these pseudo-random numbers, show that they lack periodicity up to 10 13 numbers and that they are not correlated

  15. Random Numbers and Quantum Computers

    Science.gov (United States)

    McCartney, Mark; Glass, David

    2002-01-01

    The topic of random numbers is investigated in such a way as to illustrate links between mathematics, physics and computer science. First, the generation of random numbers by a classical computer using the linear congruential generator and logistic map is considered. It is noted that these procedures yield only pseudo-random numbers since…

  16. Testing random number generators for Monte Carlo applications

    International Nuclear Information System (INIS)

    Sim, L.H.

    1992-01-01

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

  17. Monte Carlo learning/biasing experiment with intelligent random numbers

    International Nuclear Information System (INIS)

    Booth, T.E.

    1985-01-01

    A Monte Carlo learning and biasing technique is described that does its learning and biasing in the random number space rather than the physical phase-space. The technique is probably applicable to all linear Monte Carlo problems, but no proof is provided here. Instead, the technique is illustrated with a simple Monte Carlo transport problem. Problems encountered, problems solved, and speculations about future progress are discussed. 12 refs

  18. Fast integration using quasi-random numbers

    International Nuclear Information System (INIS)

    Bossert, J.; Feindt, M.; Kerzel, U.

    2006-01-01

    Quasi-random numbers are specially constructed series of numbers optimised to evenly sample a given s-dimensional volume. Using quasi-random numbers in numerical integration converges faster with a higher accuracy compared to the case of pseudo-random numbers. The basic properties of quasi-random numbers are introduced, various generators are discussed and the achieved gain is illustrated by examples

  19. Fast integration using quasi-random numbers

    Science.gov (United States)

    Bossert, J.; Feindt, M.; Kerzel, U.

    2006-04-01

    Quasi-random numbers are specially constructed series of numbers optimised to evenly sample a given s-dimensional volume. Using quasi-random numbers in numerical integration converges faster with a higher accuracy compared to the case of pseudo-random numbers. The basic properties of quasi-random numbers are introduced, various generators are discussed and the achieved gain is illustrated by examples.

  20. Random numbers from vacuum fluctuations

    International Nuclear Information System (INIS)

    Shi, Yicheng; Kurtsiefer, Christian; Chng, Brenda

    2016-01-01

    We implement a quantum random number generator based on a balanced homodyne measurement of vacuum fluctuations of the electromagnetic field. The digitized signal is directly processed with a fast randomness extraction scheme based on a linear feedback shift register. The random bit stream is continuously read in a computer at a rate of about 480 Mbit/s and passes an extended test suite for random numbers.

  1. Random numbers from vacuum fluctuations

    Energy Technology Data Exchange (ETDEWEB)

    Shi, Yicheng; Kurtsiefer, Christian, E-mail: christian.kurtsiefer@gmail.com [Department of Physics, National University of Singapore, 2 Science Drive 3, Singapore 117542 (Singapore); Center for Quantum Technologies, National University of Singapore, 3 Science Drive 2, Singapore 117543 (Singapore); Chng, Brenda [Center for Quantum Technologies, National University of Singapore, 3 Science Drive 2, Singapore 117543 (Singapore)

    2016-07-25

    We implement a quantum random number generator based on a balanced homodyne measurement of vacuum fluctuations of the electromagnetic field. The digitized signal is directly processed with a fast randomness extraction scheme based on a linear feedback shift register. The random bit stream is continuously read in a computer at a rate of about 480 Mbit/s and passes an extended test suite for random numbers.

  2. Investigating the Randomness of Numbers

    Science.gov (United States)

    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…

  3. The MIXMAX random number generator

    Science.gov (United States)

    Savvidy, Konstantin G.

    2015-11-01

    In this paper, we study the randomness properties of unimodular matrix random number generators. Under well-known conditions, these discrete-time dynamical systems have the highly desirable K-mixing properties which guarantee high quality random numbers. It is found that some widely used random number generators have poor Kolmogorov entropy and consequently fail in empirical tests of randomness. These tests show that the lowest acceptable value of the Kolmogorov entropy is around 50. Next, we provide a solution to the problem of determining the maximal period of unimodular matrix generators of pseudo-random numbers. We formulate the necessary and sufficient condition to attain the maximum period and present a family of specific generators in the MIXMAX family with superior performance and excellent statistical properties. Finally, we construct three efficient algorithms for operations with the MIXMAX matrix which is a multi-dimensional generalization of the famous cat-map. First, allowing to compute the multiplication by the MIXMAX matrix with O(N) operations. Second, to recursively compute its characteristic polynomial with O(N2) operations, and third, to apply skips of large number of steps S to the sequence in O(N2 log(S)) operations.

  4. How random are random numbers generated using photons?

    International Nuclear Information System (INIS)

    Solis, Aldo; Angulo Martínez, Alí M; Ramírez Alarcón, Roberto; Cruz Ramírez, Hector; U’Ren, Alfred B; Hirsch, Jorge G

    2015-01-01

    Randomness is fundamental in quantum theory, with many philosophical and practical implications. In this paper we discuss the concept of algorithmic randomness, which provides a quantitative method to assess the Borel normality of a given sequence of numbers, a necessary condition for it to be considered random. We use Borel normality as a tool to investigate the randomness of ten sequences of bits generated from the differences between detection times of photon pairs generated by spontaneous parametric downconversion. These sequences are shown to fulfil the randomness criteria without difficulties. As deviations from Borel normality for photon-generated random number sequences have been reported in previous work, a strategy to understand these diverging findings is outlined. (paper)

  5. Quality pseudo-random number generator

    International Nuclear Information System (INIS)

    Tarasiuk, J.

    1996-01-01

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

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

    International Nuclear Information System (INIS)

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

    2011-01-01

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

  7. Digital random-number generator

    Science.gov (United States)

    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.

  8. Application of quasi-random numbers for simulation

    International Nuclear Information System (INIS)

    Kazachenko, O.N.; Takhtamyshev, G.G.

    1985-01-01

    Application of the Monte-Carlo method for multidimensional integration is discussed. The main goal is to check the statement that the application of quasi-random numbers instead of regular pseudo-random numbers provides more rapid convergency. The Sobol, Richtmayer and Halton algorithms of quasi-random sequences are described. Over 50 tests to compare these quasi-random numbers as well as pseudo-random numbers were fulfilled. In all cases quasi-random numbers have clearly demonstrated a more rapid convergency as compared with pseudo-random ones. Positive test results on quasi-random trend in Monte-Carlo method seem very promising

  9. Analysis of android random number generator

    OpenAIRE

    Sarıtaş, Serkan

    2013-01-01

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

  10. On the number of subgraphs of the Barabási-Albert random graph

    International Nuclear Information System (INIS)

    Ryabchenko, Aleksandr A; Samosvat, Egor A

    2012-01-01

    We study a model of a random graph of the type of the Barabási-Albert preferential attachment model. We develop a technique that makes it possible to estimate the mathematical expectation for a fairly wide class of random variables in the model under consideration. We use this technique to prove a theorem on the asymptotics of the mathematical expectation of the number of subgraphs isomorphic to a certain fixed graph in the random graphs of this model.

  11. The RANDOM computer program: A linear congruential random number generator

    Science.gov (United States)

    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.

  12. Random numbers spring from alpha decay

    International Nuclear Information System (INIS)

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

    1980-05-01

    Congruential random number generators, which are widely used in Monte Carlo simulations, are deficient in that the number they generate are concentrated in a relatively small number of hyperplanes. While this deficiency may not be a limitation in small Monte Carlo studies involving a few variables, it introduces a significant bias in large simulations requiring high resolution. This bias was recognized and assessed during preparations for an accident analysis study of nuclear power plants. This report describes a random number device based on the radioactive decay of alpha particles from a 235 U source in a high-resolution gas proportional counter. The signals were fed to a 4096-channel analyzer and for each channel the frequency of signals registered in a 20,000-microsecond interval was recorded. The parity bits of these frequency counts (0 for an even count and 1 for an odd count) were then assembled in sequence to form 31-bit binary random numbers and transcribed to a magnetic tape. This cycle was repeated as many times as were necessary to create 3 million random numbers. The frequency distribution of counts from the present device conforms to the Brockwell-Moyal distribution, which takes into account the dead time of the counter (both the dead time and decay constant of the underlying Poisson process were estimated). Analysis of the count data and tests of randomness on a sample set of the 31-bit binary numbers indicate that this random number device is a highly reliable source of truly random numbers. Its use is, therefore, recommended in Monte Carlo simulations for which the congruential pseudorandom number generators are found to be inadequate. 6 figures, 5 tables

  13. True random numbers from amplified quantum vacuum.

    Science.gov (United States)

    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.

  14. Source-Independent Quantum Random Number Generation

    Science.gov (United States)

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

    2016-01-01

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

  15. Microcomputer-Assisted Discoveries: Random Numbers.

    Science.gov (United States)

    Kimberling, Clark

    1983-01-01

    A programing contest was designed to promote interest in mathematical randomness. Student-developed programs making clever uses of random numbers are presented. Modifications users might make are suggested. (MNS)

  16. An integrable low-cost hardware random number generator

    Science.gov (United States)

    Ranasinghe, Damith C.; Lim, Daihyun; Devadas, Srinivas; Jamali, Behnam; Zhu, Zheng; Cole, Peter H.

    2005-02-01

    A hardware random number generator is different from a pseudo-random number generator; a pseudo-random number generator approximates the assumed behavior of a real hardware random number generator. Simple pseudo random number generators suffices for most applications, however for demanding situations such as the generation of cryptographic keys, requires an efficient and a cost effective source of random numbers. Arbiter-based Physical Unclonable Functions (PUFs) proposed for physical authentication of ICs exploits statistical delay variation of wires and transistors across integrated circuits, as a result of process variations, to build a secret key unique to each IC. Experimental results and theoretical studies show that a sufficient amount of variation exits across IC"s. This variation enables each IC to be identified securely. It is possible to exploit the unreliability of these PUF responses to build a physical random number generator. There exists measurement noise, which comes from the instability of an arbiter when it is in a racing condition. There exist challenges whose responses are unpredictable. Without environmental variations, the responses of these challenges are random in repeated measurements. Compared to other physical random number generators, the PUF-based random number generators can be a compact and a low-power solution since the generator need only be turned on when required. A 64-stage PUF circuit costs less than 1000 gates and the circuit can be implemented using a standard IC manufacturing processes. In this paper we have presented a fast and an efficient random number generator, and analysed the quality of random numbers produced using an array of tests used by the National Institute of Standards and Technology to evaluate the randomness of random number generators designed for cryptographic applications.

  17. Source-Independent Quantum Random Number Generation

    Directory of Open Access Journals (Sweden)

    Zhu Cao

    2016-02-01

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

  18. All-optical fast random number generator.

    Science.gov (United States)

    Li, Pu; Wang, Yun-Cai; Zhang, Jian-Zhong

    2010-09-13

    We propose a scheme of all-optical random number generator (RNG), which consists of an ultra-wide bandwidth (UWB) chaotic laser, an all-optical sampler and an all-optical comparator. Free from the electric-device bandwidth, it can generate 10Gbit/s random numbers in our simulation. The high-speed bit sequences can pass standard statistical tests for randomness after all-optical exclusive-or (XOR) operation.

  19. Generation of pseudo-random numbers

    Science.gov (United States)

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

    1982-01-01

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

  20. Pseudo-Random Number Generators

    Science.gov (United States)

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

    1984-01-01

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

  1. Unbiased All-Optical Random-Number Generator

    Science.gov (United States)

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

    2017-10-01

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

  2. Program pseudo-random number generator for microcomputers

    International Nuclear Information System (INIS)

    Ososkov, G.A.

    1980-01-01

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

  3. A hybrid-type quantum random number generator

    Science.gov (United States)

    Hai-Qiang, Ma; Wu, Zhu; Ke-Jin, Wei; Rui-Xue, Li; Hong-Wei, Liu

    2016-05-01

    This paper proposes a well-performing hybrid-type truly quantum random number generator based on the time interval between two independent single-photon detection signals, which is practical and intuitive, and generates the initial random number sources from a combination of multiple existing random number sources. A time-to-amplitude converter and multichannel analyzer are used for qualitative analysis to demonstrate that each and every step is random. Furthermore, a carefully designed data acquisition system is used to obtain a high-quality random sequence. Our scheme is simple and proves that the random number bit rate can be dramatically increased to satisfy practical requirements. Project supported by the National Natural Science Foundation of China (Grant Nos. 61178010 and 11374042), the Fund of State Key Laboratory of Information Photonics and Optical Communications (Beijing University of Posts and Telecommunications), China, and the Fundamental Research Funds for the Central Universities of China (Grant No. bupt2014TS01).

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

    Directory of Open Access Journals (Sweden)

    L. Yu. Barash

    2012-01-01

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

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

    International Nuclear Information System (INIS)

    Chakraborty, Brahmananda

    2009-01-01

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

  6. Graphical analysis of some pseudo-random number generators

    OpenAIRE

    Lewis, Peter A. W.

    1986-01-01

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

  7. Employing online quantum random number generators for generating truly random quantum states in Mathematica

    Science.gov (United States)

    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

  8. Pseudo-Random Number Generator Based on Coupled Map Lattices

    Science.gov (United States)

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

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

  9. A Method of Erasing Data Using Random Number Generators

    OpenAIRE

    井上,正人

    2012-01-01

    Erasing data is an indispensable step for disposal of computers or external storage media. Except physical destruction, erasing data means writing random information on entire disk drives or media. We propose a method which erases data safely using random number generators. These random number generators create true random numbers based on quantum processes.

  10. Random number generation based on digital differential chaos

    KAUST Repository

    Zidan, Mohammed A.

    2012-07-29

    In this paper, we present a fully digital differential chaos based random number generator. The output of the digital circuit is proved to be chaotic by calculating the output time series maximum Lyapunov exponent. We introduce a new post processing technique to improve the distribution and statistical properties of the generated data. The post-processed output passes the NIST Sp. 800-22 statistical tests. The system is written in Verilog VHDL and realized on Xilinx Virtex® FPGA. The generator can fit into a very small area and have a maximum throughput of 2.1 Gb/s.

  11. Statistical Theory of the Vector Random Decrement Technique

    DEFF Research Database (Denmark)

    Asmussen, J. C.; Brincker, Rune; Ibrahim, S. R.

    1999-01-01

    decays. Due to the speed and/or accuracy of the Vector Random Decrement technique, it was introduced as an attractive alternative to the Random Decrement technique. In this paper, the theory of the Vector Random Decrement technique is extended by applying a statistical description of the stochastic...

  12. Semi-device-independent random-number expansion without entanglement

    International Nuclear Information System (INIS)

    Li Hongwei; Yin Zhenqiang; Wu Yuchun; Zou Xubo; Wang Shuang; Chen Wei; Guo Guangcan; Han Zhengfu

    2011-01-01

    By testing the classical correlation violation between two systems, true random numbers can be generated and certified without applying classical statistical method. In this work, we propose a true random-number expansion protocol without entanglement, where the randomness can be guaranteed only by the two-dimensional quantum witness violation. Furthermore, we only assume that the dimensionality of the system used in the protocol has a tight bound, and the whole protocol can be regarded as a semi-device-independent black-box scenario. Compared with the device-independent random-number expansion protocol based on entanglement, our protocol is much easier to implement and test.

  13. Analysis of random number generators in abnormal usage conditions

    International Nuclear Information System (INIS)

    Soucarros, M.

    2012-01-01

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

  14. Testing, Selection, and Implementation of Random Number Generators

    National Research Council Canada - National Science Library

    Collins, Joseph C

    2008-01-01

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

  15. Reconstruction of photon number conditioned states using phase randomized homodyne measurements

    International Nuclear Information System (INIS)

    Chrzanowski, H M; Assad, S M; Bernu, J; Hage, B; Lam, P K; Symul, T; Lund, A P; Ralph, T C

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

  16. Extracting random numbers from quantum tunnelling through a single diode.

    Science.gov (United States)

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

    2017-12-19

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

  17. Uniform random number generators

    Science.gov (United States)

    Farr, W. R.

    1971-01-01

    Methods are presented for the generation of random numbers with uniform and normal distributions. Subprogram listings of Fortran generators for the Univac 1108, SDS 930, and CDC 3200 digital computers are also included. The generators are of the mixed multiplicative type, and the mathematical method employed is that of Marsaglia and Bray.

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

    Science.gov (United States)

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

    2012-06-01

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

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

    International Nuclear Information System (INIS)

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

    2012-01-01

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

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

    Science.gov (United States)

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

    2017-12-01

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

  1. Towards a high-speed quantum random number generator

    Science.gov (United States)

    Stucki, Damien; Burri, Samuel; Charbon, Edoardo; Chunnilall, Christopher; Meneghetti, Alessio; Regazzoni, Francesco

    2013-10-01

    Randomness is of fundamental importance in various fields, such as cryptography, numerical simulations, or the gaming industry. Quantum physics, which is fundamentally probabilistic, is the best option for a physical random number generator. In this article, we will present the work carried out in various projects in the context of the development of a commercial and certified high speed random number generator.

  2. Microcomputer Unit: Generating Random Numbers.

    Science.gov (United States)

    Haigh, William E.

    1986-01-01

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

  3. Search for a perfect generator of random numbers

    International Nuclear Information System (INIS)

    Musyck, E.

    1977-01-01

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

  4. Effects of changing the random number stride in Monte Carlo calculations

    International Nuclear Information System (INIS)

    Hendricks, J.S.

    1991-01-01

    This paper reports on a common practice in Monte Carlo radiation transport codes which is to start each random walk a specified number of steps up the random number sequence from the previous one. This is called the stride in the random number sequence between source particles. It is used for correlated sampling or to provide tree-structured random numbers. A new random number generator algorithm for the major Monte Carlo code MCNP has been written to allow adjustment of the random number stride. This random number generator is machine portable. The effects of varying the stride for several sample problems are examined

  5. Quantum random number generation for loophole-free Bell tests

    Science.gov (United States)

    Mitchell, Morgan; Abellan, Carlos; Amaya, Waldimar

    2015-05-01

    We describe the generation of quantum random numbers at multi-Gbps rates, combined with real-time randomness extraction, to give very high purity random numbers based on quantum events at most tens of ns in the past. The system satisfies the stringent requirements of quantum non-locality tests that aim to close the timing loophole. We describe the generation mechanism using spontaneous-emission-driven phase diffusion in a semiconductor laser, digitization, and extraction by parity calculation using multi-GHz logic chips. We pay special attention to experimental proof of the quality of the random numbers and analysis of the randomness extraction. In contrast to widely-used models of randomness generators in the computer science literature, we argue that randomness generation by spontaneous emission can be extracted from a single source.

  6. Pseudo random number generator based on quantum chaotic map

    Science.gov (United States)

    Akhshani, A.; Akhavan, A.; Mobaraki, A.; Lim, S.-C.; Hassan, Z.

    2014-01-01

    For many years dissipative quantum maps were widely used as informative models of quantum chaos. In this paper, a new scheme for generating good pseudo-random numbers (PRNG), based on quantum logistic map is proposed. Note that the PRNG merely relies on the equations used in the quantum chaotic map. The algorithm is not complex, which does not impose high requirement on computer hardware and thus computation speed is fast. In order to face the challenge of using the proposed PRNG in quantum cryptography and other practical applications, the proposed PRNG is subjected to statistical tests using well-known test suites such as NIST, DIEHARD, ENT and TestU01. The results of the statistical tests were promising, as the proposed PRNG successfully passed all these tests. Moreover, the degree of non-periodicity of the chaotic sequences of the quantum map is investigated through the Scale index technique. The obtained result shows that, the sequence is more non-periodic. From these results it can be concluded that, the new scheme can generate a high percentage of usable pseudo-random numbers for simulation and other applications in scientific computing.

  7. Microcomputer-Assisted Discoveries: Generate Your Own Random Numbers.

    Science.gov (United States)

    Kimberling, Clark

    1984-01-01

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

  8. A Repetition Test for Pseudo-Random Number Generators

    OpenAIRE

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

    2017-01-01

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

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

    Science.gov (United States)

    Campbell, C. W.

    1983-01-01

    An efficient algorithm for generating random number pairs from a bivariate normal distribution was developed. Any desired value of the two means, two standard deviations, and correlation coefficient can be selected. Theoretically the technique is exact and in practice its accuracy is limited only by the quality of the uniform distribution random number generator, inaccuracies in computer function evaluation, and arithmetic. A FORTRAN routine was written to check the algorithm and good accuracy was obtained. Some small errors in the correlation coefficient were observed to vary in a surprisingly regular manner. A simple model was developed which explained the qualities aspects of the errors.

  10. RANDOMNUMBERS, Random Number Sequence Generated from Gas Ionisation Chamber Data

    International Nuclear Information System (INIS)

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

    1989-01-01

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

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

    Science.gov (United States)

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

    2011-02-01

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

  12. Random walk of the baryon number

    International Nuclear Information System (INIS)

    Kazaryan, A.M.; Khlebnikov, S.Y.; Shaposhnikov, M.E.

    1989-01-01

    A new approach is suggested for the anomalous nonconservation of baryon number in the electroweak theory at high temperatures. Arguments are presented in support of the idea that the baryon-number changing reactions may be viewed as random Markov processes. Making use of the general theory of Markov processes, the Fokker--Planck equation for the baryon-number distribution density is obtained and kinetic coefficients are calculated

  13. Key-space analysis of double random phase encryption technique

    Science.gov (United States)

    Monaghan, David S.; Gopinathan, Unnikrishnan; Naughton, Thomas J.; Sheridan, John T.

    2007-09-01

    We perform a numerical analysis on the double random phase encryption/decryption technique. The key-space of an encryption technique is the set of possible keys that can be used to encode data using that technique. In the case of a strong encryption scheme, many keys must be tried in any brute-force attack on that technique. Traditionally, designers of optical image encryption systems demonstrate only how a small number of arbitrary keys cannot decrypt a chosen encrypted image in their system. However, this type of demonstration does not discuss the properties of the key-space nor refute the feasibility of an efficient brute-force attack. To clarify these issues we present a key-space analysis of the technique. For a range of problem instances we plot the distribution of decryption errors in the key-space indicating the lack of feasibility of a simple brute-force attack.

  14. Motzkin numbers out of Random Domino Automaton

    Energy Technology Data Exchange (ETDEWEB)

    Białecki, Mariusz, E-mail: bialecki@igf.edu.pl [Institute of Geophysics, Polish Academy of Sciences, ul. Ks. Janusza 64, 01-452 Warszawa (Poland)

    2012-10-01

    Motzkin numbers are derived from a special case of Random Domino Automaton – recently proposed a slowly driven system being a stochastic toy model of earthquakes. It is also a generalisation of 1D Drossel–Schwabl forest-fire model. A solution of the set of equations describing stationary state of Random Domino Automaton in inverse-power case is presented. A link with Motzkin numbers allows to present explicit form of asymptotic behaviour of the automaton. -- Highlights: ► Motzkin numbers are derived from stochastic cellular automaton with avalanches. ► Explicit solution of toy model of earthquakes is presented. ► Case with inverse-power distribution of avalanches is found.

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

    Science.gov (United States)

    Bhattacharjee, Kamalika; Paul, Dipanjyoti; Das, Sukanta

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

  16. Parallel random number generator for inexpensive configurable hardware cells

    Science.gov (United States)

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

    2001-11-01

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

  17. GASPRNG: GPU accelerated scalable parallel random number generator library

    Science.gov (United States)

    Gao, Shuang; Peterson, Gregory D.

    2013-04-01

    Graphics processors represent a promising technology for accelerating computational science applications. Many computational science applications require fast and scalable random number generation with good statistical properties, so they use the Scalable Parallel Random Number Generators library (SPRNG). We present the GPU Accelerated SPRNG library (GASPRNG) to accelerate SPRNG in GPU-based high performance computing systems. GASPRNG includes code for a host CPU and CUDA code for execution on NVIDIA graphics processing units (GPUs) along with a programming interface to support various usage models for pseudorandom numbers and computational science applications executing on the CPU, GPU, or both. This paper describes the implementation approach used to produce high performance and also describes how to use the programming interface. The programming interface allows a user to be able to use GASPRNG the same way as SPRNG on traditional serial or parallel computers as well as to develop tightly coupled programs executing primarily on the GPU. We also describe how to install GASPRNG and use it. To help illustrate linking with GASPRNG, various demonstration codes are included for the different usage models. GASPRNG on a single GPU shows up to 280x speedup over SPRNG on a single CPU core and is able to scale for larger systems in the same manner as SPRNG. Because GASPRNG generates identical streams of pseudorandom numbers as SPRNG, users can be confident about the quality of GASPRNG for scalable computational science applications. Catalogue identifier: AEOI_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEOI_v1_0.html Program obtainable from: CPC Program Library, Queen’s University, Belfast, N. Ireland Licensing provisions: UTK license. No. of lines in distributed program, including test data, etc.: 167900 No. of bytes in distributed program, including test data, etc.: 1422058 Distribution format: tar.gz Programming language: C and CUDA. Computer: Any PC or

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

    Science.gov (United States)

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

    2012-02-01

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

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

    International Nuclear Information System (INIS)

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

    1995-02-01

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

  20. Quantifiers for randomness of chaotic pseudo-random number generators.

    Science.gov (United States)

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

    2009-08-28

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

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

    Science.gov (United States)

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

    1998-01-01

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

  2. Generalized hardware post-processing technique for chaos-based pseudorandom number generators

    KAUST Repository

    Barakat, Mohamed L.

    2013-06-01

    This paper presents a generalized post-processing technique for enhancing the pseudorandomness of digital chaotic oscillators through a nonlinear XOR-based operation with rotation and feedback. The technique allows full utilization of the chaotic output as pseudorandom number generators and improves throughput without a significant area penalty. Digital design of a third-order chaotic system with maximum function nonlinearity is presented with verified chaotic dynamics. The proposed post-processing technique eliminates statistical degradation in all output bits, thus maximizing throughput compared to other processing techniques. Furthermore, the technique is applied to several fully digital chaotic oscillators with performance surpassing previously reported systems in the literature. The enhancement in the randomness is further examined in a simple image encryption application resulting in a better security performance. The system is verified through experiment on a Xilinx Virtex 4 FPGA with throughput up to 15.44 Gbit/s and logic utilization less than 0.84% for 32-bit implementations. © 2013 ETRI.

  3. Correlations of pseudo-random numbers of multiplicative sequence

    International Nuclear Information System (INIS)

    Bukin, A.D.

    1989-01-01

    An algorithm is suggested for searching with a computer in unit n-dimensional cube the sets of planes where all the points fall whose coordinates are composed of n successive pseudo-random numbers of multiplicative sequence. This effect should be taken into account in Monte-Carlo calculations with definite constructive dimension. The parameters of these planes are obtained for three random number generators. 2 refs.; 2 tabs

  4. A random-matrix theory of the number sense.

    Science.gov (United States)

    Hannagan, T; Nieder, A; Viswanathan, P; Dehaene, S

    2017-02-19

    Number sense, a spontaneous ability to process approximate numbers, has been documented in human adults, infants and newborns, and many other animals. Species as distant as monkeys and crows exhibit very similar neurons tuned to specific numerosities. How number sense can emerge in the absence of learning or fine tuning is currently unknown. We introduce a random-matrix theory of self-organized neural states where numbers are coded by vectors of activation across multiple units, and where the vector codes for successive integers are obtained through multiplication by a fixed but random matrix. This cortical implementation of the 'von Mises' algorithm explains many otherwise disconnected observations ranging from neural tuning curves in monkeys to looking times in neonates and cortical numerotopy in adults. The theory clarifies the origin of Weber-Fechner's Law and yields a novel and empirically validated prediction of multi-peak number neurons. Random matrices constitute a novel mechanism for the emergence of brain states coding for quantity.This article is part of a discussion meeting issue 'The origins of numerical abilities'. © 2017 The Author(s).

  5. Number-conserving random phase approximation with analytically integrated matrix elements

    International Nuclear Information System (INIS)

    Kyotoku, M.; Schmid, K.W.; Gruemmer, F.; Faessler, A.

    1990-01-01

    In the present paper a number conserving random phase approximation is derived as a special case of the recently developed random phase approximation in general symmetry projected quasiparticle mean fields. All the occurring integrals induced by the number projection are performed analytically after writing the various overlap and energy matrices in the random phase approximation equation as polynomials in the gauge angle. In the limit of a large number of particles the well-known pairing vibration matrix elements are recovered. We also present a new analytically number projected variational equation for the number conserving pairing problem

  6. On contact numbers in random rod packings

    NARCIS (Netherlands)

    Wouterse, A.; Luding, Stefan; Philipse, A.P.

    2009-01-01

    Random packings of non-spherical granular particles are simulated by combining mechanical contraction and molecular dynamics, to determine contact numbers as a function of density. Particle shapes are varied from spheres to thin rods. The observed contact numbers (and packing densities) agree well

  7. Study on random number generator in Monte Carlo code

    International Nuclear Information System (INIS)

    Oya, Kentaro; Kitada, Takanori; Tanaka, Shinichi

    2011-01-01

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

  8. A generator for unique quantum random numbers based on vacuum states

    DEFF Research Database (Denmark)

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

    2010-01-01

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

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

    Science.gov (United States)

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

    2013-11-01

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

  10. Estimation of Correlation Functions by the Random DEC Technique

    DEFF Research Database (Denmark)

    Brincker, Rune; Krenk, Steen; Jensen, Jakob Laigaard

    The Random Dec Technique is a versatile technique for characterization of random signals in the time domain. In this paper a short review of the most important properties of the technique is given. The review is mainly based on recently achieved results that are still unpublished, or that has just...

  11. The intermittency of vector fields and random-number generators

    Science.gov (United States)

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

    2017-09-01

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

  12. Estimation of Correlation Functions by the Random Decrement Technique

    DEFF Research Database (Denmark)

    Brincker, Rune; Krenk, Steen; Jensen, Jakob Laigaard

    responses simulated by two SDOF ARMA models loaded by the same bandlimited white noise. The speed and the accuracy of the RDD technique is compared to the Fast Fourier Transform (FFT) technique. The RDD technique does not involve multiplications, but only additions. Therefore, the technique is very fast......The Random Decrement (RDD) Technique is a versatile technique for characterization of random signals in the time domain. In this paper a short review of the theoretical basis is given, and the technique is illustrated by estimating auto-correlation functions and cross-correlation functions on modal...

  13. Estimation of Correlation Functions by the Random Decrement Technique

    DEFF Research Database (Denmark)

    Brincker, Rune; Krenk, Steen; Jensen, Jacob Laigaard

    1991-01-01

    responses simulated by two SDOF ARMA models loaded by the same band-limited white noise. The speed and the accuracy of the RDD technique is compared to the Fast Fourier Transform (FFT) technique. The RDD technique does not involve multiplications, but only additions. Therefore, the technique is very fast......The Random Decrement (RDD) Technique is a versatile technique for characterization of random signals in the time domain. In this paper a short review of the theoretical basis is given, and the technique is illustrated by estimating auto-correlation functions and cross-correlation functions on modal...

  14. Estimation of Correlation Functions by the Random Decrement Technique

    DEFF Research Database (Denmark)

    Brincker, Rune; Krenk, Steen; Jensen, Jakob Laigaard

    1992-01-01

    responses simulated by two SDOF ARMA models loaded by the same bandlimited white noise. The speed and the accuracy of the RDD technique is compared to the Fast Fourier Transform (FFT) technique. The RDD technique does not involve multiplications, but only additions. Therefore, the technique is very fast......The Random Decrement (RDD) Technique is a versatile technique for characterization of random signals in the time domain. In this paper a short review of the theoretical basis is given, and the technique is illustrated by estimating auto-correlation functions and cross-correlation functions on modal...

  15. Generating random numbers by means of nonlinear dynamic systems

    Science.gov (United States)

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

    2018-07-01

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

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

    Energy Technology Data Exchange (ETDEWEB)

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

    2016-03-15

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

  17. Drawing a random number

    DEFF Research Database (Denmark)

    Wanscher, Jørgen Bundgaard; Sørensen, Majken Vildrik

    2006-01-01

    Random numbers are used for a great variety of applications in almost any field of computer and economic sciences today. Examples ranges from stock market forecasting in economics, through stochastic traffic modelling in operations research to photon and ray tracing in graphics. The construction...... distributions into others with most of the required characteristics. In essence, a uniform sequence which is transformed into a new sequence with the required distribution. The subject of this article is to consider the well known highly uniform Halton sequence and modifications to it. The intent is to generate...

  18. Simulation of a directed random-walk model: the effect of pseudo-random-number correlations

    OpenAIRE

    Shchur, L. N.; Heringa, J. R.; Blöte, H. W. J.

    1996-01-01

    We investigate the mechanism that leads to systematic deviations in cluster Monte Carlo simulations when correlated pseudo-random numbers are used. We present a simple model, which enables an analysis of the effects due to correlations in several types of pseudo-random-number sequences. This model provides qualitative understanding of the bias mechanism in a class of cluster Monte Carlo algorithms.

  19. Brain potentials index executive functions during random number generation.

    Science.gov (United States)

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

    2004-06-01

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

  20. Chaos-based Pseudo-random Number Generation

    KAUST Repository

    Barakat, Mohamed L.

    2014-04-10

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

  1. Chaos-based Pseudo-random Number Generation

    KAUST Repository

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

    2014-01-01

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

  2. Recoverable Random Numbers in an Internet of Things Operating System

    Directory of Open Access Journals (Sweden)

    Taeill Yoo

    2017-03-01

    Full Text Available Over the past decade, several security issues with Linux Random Number Generator (LRNG on PCs and Androids have emerged. The main problem involves the process of entropy harvesting, particularly at boot time. An entropy source in the input pool of LRNG is not transferred into the non-blocking output pool if the entropy counter of the input pool is less than 192 bits out of 4098 bits. Because the entropy estimation of LRNG is highly conservative, the process may require more than one minute for starting the transfer. Furthermore, the design principle of the estimation algorithm is not only heuristic but also unclear. Recently, Google released an Internet of Things (IoT operating system called Brillo based on the Linux kernel. We analyze the behavior of the random number generator in Brillo, which inherits that of LRNG. In the results, we identify two features that enable recovery of random numbers. With these features, we demonstrate that random numbers of 700 bytes at boot time can be recovered with the success probability of 90% by using time complexity for 5.20 × 2 40 trials. Therefore, the entropy of random numbers of 700 bytes is merely about 43 bits. Since the initial random numbers are supposed to be used for sensitive security parameters, such as stack canary and key derivation, our observation can be applied to practical attacks against cryptosystem.

  3. Standard random number generation for MBASIC

    Science.gov (United States)

    Tausworthe, R. C.

    1976-01-01

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

  4. Security of Semi-Device-Independent Random Number Expansion Protocols.

    Science.gov (United States)

    Li, Dan-Dan; Wen, Qiao-Yan; Wang, Yu-Kun; Zhou, Yu-Qian; Gao, Fei

    2015-10-27

    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.

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

    Science.gov (United States)

    Persaud, Navindra

    2005-01-01

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

  6. The average crossing number of equilateral random polygons

    International Nuclear Information System (INIS)

    Diao, Y; Dobay, A; Kusner, R B; Millett, K; Stasiak, A

    2003-01-01

    In this paper, we study the average crossing number of equilateral random walks and polygons. We show that the mean average crossing number ACN of all equilateral random walks of length n is of the form (3/16)n ln n + O(n). A similar result holds for equilateral random polygons. These results are confirmed by our numerical studies. Furthermore, our numerical studies indicate that when random polygons of length n are divided into individual knot types, the for each knot type K can be described by a function of the form = a(n-n 0 )ln(n-n 0 ) + b(n-n 0 ) + c where a, b and c are constants depending on K and n 0 is the minimal number of segments required to form K. The profiles diverge from each other, with more complex knots showing higher than less complex knots. Moreover, the profiles intersect with the profile of all closed walks. These points of intersection define the equilibrium length of K, i.e., the chain length n e (K) at which a statistical ensemble of configurations with given knot type K-upon cutting, equilibration and reclosure to a new knot type K'-does not show a tendency to increase or decrease . This concept of equilibrium length seems to be universal, and applies also to other length-dependent observables for random knots, such as the mean radius of gyration g >

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

    Science.gov (United States)

    Ghersi, Dario; Parakh, Abhishek; Mezei, Mihaly

    2017-12-05

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

  8. Learning Random Numbers: A Matlab Anomaly

    Czech Academy of Sciences Publication Activity Database

    Savický, Petr; Robnik-Šikonja, M.

    2008-01-01

    Roč. 22, č. 3 (2008), s. 254-265 ISSN 0883-9514 R&D Projects: GA AV ČR 1ET100300517 Institutional research plan: CEZ:AV0Z10300504 Keywords : random number s * machine learning * classification * attribute evaluation * regression Subject RIV: BA - General Mathematics Impact factor: 0.795, year: 2008

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

    Science.gov (United States)

    Bonelli, Antonio; Ruffo, Stefano

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

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

    Science.gov (United States)

    Yang, Yu-Guang; Zhao, Qian-Qian

    2016-02-01

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

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

    Science.gov (United States)

    Yang, Yu-Guang; Zhao, Qian-Qian

    2016-02-04

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

  12. Solution-Processed Carbon Nanotube True Random Number Generator.

    Science.gov (United States)

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

    2017-08-09

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

  13. Properties making a chaotic system a good Pseudo Random Number Generator

    OpenAIRE

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

    2005-01-01

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

  14. Recommendations and illustrations for the evaluation of photonic random number generators

    Science.gov (United States)

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

    2017-09-01

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

  15. Recommendations and illustrations for the evaluation of photonic random number generators

    Directory of Open Access Journals (Sweden)

    Joseph D. Hart

    2017-09-01

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

  16. Fully Digital Chaotic Oscillators Applied to Pseudo Random Number Generation

    KAUST Repository

    Mansingka, Abhinav S.

    2012-05-01

    adapted for pseudo random number generation by truncating statistically defective bits. Finally, a novel post-processing technique using the Fibonacci series is proposed and implemented with a non-autonomous driven hyperchaotic system to provide pseudo random number generators with high nonlinear complexity and controllable period length that enables full utilization of all branches of the chaotic output as statistically secure pseudo random output.

  17. Using Random Numbers in Science Research Activities.

    Science.gov (United States)

    Schlenker, Richard M.; And Others

    1996-01-01

    Discusses the importance of science process skills and describes ways to select sets of random numbers for selection of subjects for a research study in an unbiased manner. Presents an activity appropriate for grades 5-12. (JRH)

  18. Realistic noise-tolerant randomness amplification using finite number of devices

    Science.gov (United States)

    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.

  19. Spectral Estimation by the Random Dec Technique

    DEFF Research Database (Denmark)

    Brincker, Rune; Jensen, Jacob L.; Krenk, Steen

    1990-01-01

    This paper contains an empirical study of the accuracy of the Random Dec (RDD) technique. Realizations of the response from a single-degree-of-freedom system loaded by white noise are simulated using an ARMA model. The Autocorrelation function is estimated using the RDD technique and the estimated...

  20. Spectral Estimation by the Random DEC Technique

    DEFF Research Database (Denmark)

    Brincker, Rune; Jensen, J. Laigaard; Krenk, S.

    This paper contains an empirical study of the accuracy of the Random Dec (RDD) technique. Realizations of the response from a single-degree-of-freedom system loaded by white noise are simulated using an ARMA model. The Autocorrelation function is estimated using the RDD technique and the estimated...

  1. Random Number Generation for High Performance Computing

    Science.gov (United States)

    2015-01-01

    number streams, a quality metric for the parallel random number streams. * * * * * Atty. Dkt . No.: 5660-14400 Customer No. 35690 Eric B. Meyertons...responsibility to ensure timely payment of maintenance fees when due. Pagel of3 PTOL-85 (Rev. 02/11) Atty. Dkt . No.: 5660-14400 Page 1 Meyertons...with each subtask executed by a separate thread or process (henceforth, process). Each process has Atty. Dkt . No.: 5660-14400 Page 2 Meyertons

  2. Random Generators and Normal Numbers

    OpenAIRE

    Bailey, David H.; Crandall, Richard E.

    2002-01-01

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

  3. Random Numbers and Monte Carlo Methods

    Science.gov (United States)

    Scherer, Philipp O. J.

    Many-body problems often involve the calculation of integrals of very high dimension which cannot be treated by standard methods. For the calculation of thermodynamic averages Monte Carlo methods are very useful which sample the integration volume at randomly chosen points. After summarizing some basic statistics, we discuss algorithms for the generation of pseudo-random numbers with given probability distribution which are essential for all Monte Carlo methods. We show how the efficiency of Monte Carlo integration can be improved by sampling preferentially the important configurations. Finally the famous Metropolis algorithm is applied to classical many-particle systems. Computer experiments visualize the central limit theorem and apply the Metropolis method to the traveling salesman problem.

  4. Generative Learning Objects Instantiated with Random Numbers Based Expressions

    Directory of Open Access Journals (Sweden)

    Ciprian Bogdan Chirila

    2015-12-01

    Full Text Available The development of interactive e-learning content requires special skills like programming techniques, web integration, graphic design etc. Generally, online educators do not possess such skills and their e-learning products tend to be static like presentation slides and textbooks. In this paper we propose a new interactive model of generative learning objects as a compromise betweenstatic, dull materials and dynamic, complex software e-learning materials developed by specialized teams. We find that random numbers based automatic initialization learning objects increases content diversity, interactivity thus enabling learners’ engagement. The resulted learning object model is at a limited level of complexity related to special e-learning software, intuitive and capable of increasing learners’ interactivity, engagement and motivation through dynamic content. The approach was applied successfully on several computer programing disciplines.

  5. A scatter-corrected list-mode reconstruction and a practical scatter/random approximation technique for dynamic PET imaging

    International Nuclear Information System (INIS)

    Cheng, J-C; Rahmim, Arman; Blinder, Stephan; Camborde, Marie-Laure; Raywood, Kelvin; Sossi, Vesna

    2007-01-01

    We describe an ordinary Poisson list-mode expectation maximization (OP-LMEM) algorithm with a sinogram-based scatter correction method based on the single scatter simulation (SSS) technique and a random correction method based on the variance-reduced delayed-coincidence technique. We also describe a practical approximate scatter and random-estimation approach for dynamic PET studies based on a time-averaged scatter and random estimate followed by scaling according to the global numbers of true coincidences and randoms for each temporal frame. The quantitative accuracy achieved using OP-LMEM was compared to that obtained using the histogram-mode 3D ordinary Poisson ordered subset expectation maximization (3D-OP) algorithm with similar scatter and random correction methods, and they showed excellent agreement. The accuracy of the approximated scatter and random estimates was tested by comparing time activity curves (TACs) as well as the spatial scatter distribution from dynamic non-human primate studies obtained from the conventional (frame-based) approach and those obtained from the approximate approach. An excellent agreement was found, and the time required for the calculation of scatter and random estimates in the dynamic studies became much less dependent on the number of frames (we achieved a nearly four times faster performance on the scatter and random estimates by applying the proposed method). The precision of the scatter fraction was also demonstrated for the conventional and the approximate approach using phantom studies

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

    International Nuclear Information System (INIS)

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

    2009-01-01

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

  7. Increased certification of semi-device independent random numbers using many inputs and more post-processing

    International Nuclear Information System (INIS)

    Mironowicz, Piotr; Tavakoli, Armin; Hameedi, Alley; Marques, Breno; Bourennane, Mohamed; Pawłowski, Marcin

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

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

    Science.gov (United States)

    Grauer, Jared A.

    2017-01-01

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

  9. Experimentally Generated Random Numbers Certified by the Impossibility of Superluminal Signaling

    Science.gov (United States)

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

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

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

    International Nuclear Information System (INIS)

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

    2015-01-01

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

  11. The average inter-crossing number of equilateral random walks and polygons

    International Nuclear Information System (INIS)

    Diao, Y; Dobay, A; Stasiak, A

    2005-01-01

    In this paper, we study the average inter-crossing number between two random walks and two random polygons in the three-dimensional space. The random walks and polygons in this paper are the so-called equilateral random walks and polygons in which each segment of the walk or polygon is of unit length. We show that the mean average inter-crossing number ICN between two equilateral random walks of the same length n is approximately linear in terms of n and we were able to determine the prefactor of the linear term, which is a = 3ln2/8 ∼ 0.2599. In the case of two random polygons of length n, the mean average inter-crossing number ICN is also linear, but the prefactor of the linear term is different from that of the random walks. These approximations apply when the starting points of the random walks and polygons are of a distance ρ apart and ρ is small compared to n. We propose a fitting model that would capture the theoretical asymptotic behaviour of the mean average ICN for large values of ρ. Our simulation result shows that the model in fact works very well for the entire range of ρ. We also study the mean ICN between two equilateral random walks and polygons of different lengths. An interesting result is that even if one random walk (polygon) has a fixed length, the mean average ICN between the two random walks (polygons) would still approach infinity if the length of the other random walk (polygon) approached infinity. The data provided by our simulations match our theoretical predictions very well

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

    OpenAIRE

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

    2011-01-01

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

  13. Accelerating Pseudo-Random Number Generator for MCNP on GPU

    Science.gov (United States)

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

    2010-09-01

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

  14. A fast random number generator for the Intel Paragon supercomputer

    Science.gov (United States)

    Gutbrod, F.

    1995-06-01

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

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

    International Nuclear Information System (INIS)

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

    2016-01-01

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

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

    Science.gov (United States)

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

    2012-02-13

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

  17. Calculation of large Reynolds number two-dimensional flow using discrete vortices with random walk

    International Nuclear Information System (INIS)

    Milinazzo, F.; Saffman, P.G.

    1977-01-01

    The numerical calculation of two-dimensional rotational flow at large Reynolds number is considered. The method of replacing a continuous distribution of vorticity by a finite number, N, of discrete vortices is examined, where the vortices move under their mutually induced velocities plus a random component to simulate effects of viscosity. The accuracy of the method is studied by comparison with the exact solution for the decay of a circular vortex. It is found, and analytical arguments are produced in support, that the quantitative error is significant unless N is large compared with a characteristic Reynolds number. The mutually induced velocities are calculated by both direct summation and by the ''cloud in cell'' technique. The latter method is found to produce comparable error and to be much faster

  18. Development of fuel number reader by ultrasonic imaging techniques

    International Nuclear Information System (INIS)

    Omote, T.; Yoshida, T.

    1991-01-01

    This paper reports on a spent fuel ID number reader using ultrasonic imaging techniques that has been developed to realize efficient and automatic verification of fuel numbers, thereby to reduce mental load and radiation exposure for operators engaged in the verification task. The ultrasonic imaging techniques for automatic fuel number recognition are described. High-speed and high reliability imaging of the spent fuel ID number are obtained by using linear array type ultrasonic probe. The ultrasonic wave is scanned by switching array probe in vertical direction, and scanned mechanically in horizontal direction. Time for imaging of spent fuel ID number on assembly was confirmed less than three seconds by these techniques. And it can recognize spent fuel ID number even if spent fuel ID number can not be visualized by an optical method because of depositing fuel number regions by soft card. In order to recognize spent fuel ID number more rapidly and more reliably, coded fuel number expressed by plural separate recesses form is developed. Every coded fuel number consists of six small holes (about 1 mm dia.) and can be marked adjacent to the existing fuel number expressed by letters and numbers

  19. Pólya number and first return of bursty random walk: Rigorous solutions

    Science.gov (United States)

    Wan, J.; Xu, X. P.

    2012-03-01

    The recurrence properties of random walks can be characterized by Pólya number, i.e., the probability that the walker has returned to the origin at least once. In this paper, we investigate Pólya number and first return for bursty random walk on a line, in which the walk has different step size and moving probabilities. Using the concept of the Catalan number, we obtain exact results for first return probability, the average first return time and Pólya number for the first time. We show that Pólya number displays two different functional behavior when the walk deviates from the recurrent point. By utilizing the Lagrange inversion formula, we interpret our findings by transferring Pólya number to the closed-form solutions of an inverse function. We also calculate Pólya number using another approach, which corroborates our results and conclusions. Finally, we consider the recurrence properties and Pólya number of two variations of the bursty random walk model.

  20. High-speed true random number generation based on paired memristors for security electronics

    Science.gov (United States)

    Zhang, Teng; Yin, Minghui; Xu, Changmin; Lu, Xiayan; Sun, Xinhao; Yang, Yuchao; Huang, Ru

    2017-11-01

    True random number generator (TRNG) is a critical component in hardware security that is increasingly important in the era of mobile computing and internet of things. Here we demonstrate a TRNG using intrinsic variation of memristors as a natural source of entropy that is otherwise undesirable in most applications. The random bits were produced by cyclically switching a pair of tantalum oxide based memristors and comparing their resistance values in the off state, taking advantage of the more pronounced resistance variation compared with that in the on state. Using an alternating read scheme in the designed TRNG circuit, the unbiasedness of the random numbers was significantly improved, and the bitstream passed standard randomness tests. The Pt/TaO x /Ta memristors fabricated in this work have fast programming/erasing speeds of ˜30 ns, suggesting a high random number throughput. The approach proposed here thus holds great promise for physically-implemented random number generation.

  1. Private random numbers produced by entangled ions and certified by Bell's theorem

    Science.gov (United States)

    Hayes, David; Matsukevich, Dzmitry; Maunz, Peter; Monroe, Chris; Olmschenk, Steven

    2010-03-01

    It has been shown that entangled particles can be used to generate numbers whose privacy and randomness are guaranteed by the violation of a Bell inequality [1,2]. The authenticity of the bit stream produced is guaranteed when the system used can close the detection loophole and when the entangled particles are non-interacting. We report the use of remotely located trapped ions with near perfect state detection efficiency as a private random number generator. By entangling the ions through photon interference and choosing the measurement settings using a pseudo-random number generator, we measure a CHSH correlation function that is more than seven standard deviations above the classical limit. With a total of 3016 events, we are able to certify the generation of 42 new random numbers with 99% confidence. [1] S. Pironio et al.(submitted to Nature, arXiv:0911.3427) [2] Colbeck, R. PhD Dissertation (2007)

  2. Astronomical random numbers for quantum foundations experiments

    Science.gov (United States)

    Leung, Calvin; Brown, Amy; Nguyen, Hien; Friedman, Andrew S.; Kaiser, David I.; Gallicchio, Jason

    2018-04-01

    Photons from distant astronomical sources can be used as a classical source of randomness to improve fundamental tests of quantum nonlocality, wave-particle duality, and local realism through Bell's inequality and delayed-choice quantum eraser tests inspired by Wheeler's cosmic-scale Mach-Zehnder interferometer gedanken experiment. Such sources of random numbers may also be useful for information-theoretic applications such as key distribution for quantum cryptography. Building on the design of an astronomical random number generator developed for the recent cosmic Bell experiment [Handsteiner et al. Phys. Rev. Lett. 118, 060401 (2017), 10.1103/PhysRevLett.118.060401], in this paper we report on the design and characterization of a device that, with 20-nanosecond latency, outputs a bit based on whether the wavelength of an incoming photon is greater than or less than ≈700 nm. Using the one-meter telescope at the Jet Propulsion Laboratory Table Mountain Observatory, we generated random bits from astronomical photons in both color channels from 50 stars of varying color and magnitude, and from 12 quasars with redshifts up to z =3.9 . With stars, we achieved bit rates of ˜1 ×106Hz/m 2 , limited by saturation of our single-photon detectors, and with quasars of magnitudes between 12.9 and 16, we achieved rates between ˜102 and 2 ×103Hz /m2 . For bright quasars, the resulting bitstreams exhibit sufficiently low amounts of statistical predictability as quantified by the mutual information. In addition, a sufficiently high fraction of bits generated are of true astronomical origin in order to address both the locality and freedom-of-choice loopholes when used to set the measurement settings in a test of the Bell-CHSH inequality.

  3. A new simple technique for improving the random properties of chaos-based cryptosystems

    Science.gov (United States)

    Garcia-Bosque, M.; Pérez-Resa, A.; Sánchez-Azqueta, C.; Celma, S.

    2018-03-01

    A new technique for improving the security of chaos-based stream ciphers has been proposed and tested experimentally. This technique manages to improve the randomness properties of the generated keystream by preventing the system to fall into short period cycles due to digitation. In order to test this technique, a stream cipher based on a Skew Tent Map algorithm has been implemented on a Virtex 7 FPGA. The randomness of the keystream generated by this system has been compared to the randomness of the keystream generated by the same system with the proposed randomness-enhancement technique. By subjecting both keystreams to the National Institute of Standards and Technology (NIST) tests, we have proved that our method can considerably improve the randomness of the generated keystreams. In order to incorporate our randomness-enhancement technique, only 41 extra slices have been needed, proving that, apart from effective, this method is also efficient in terms of area and hardware resources.

  4. Random number generation based on digital differential chaos

    KAUST Repository

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

    2012-01-01

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

  5. PERL-2 and LAVR-2 programs for Monte Carlo calculation of reactivity disturbances with trajectory correlation using random numbers

    International Nuclear Information System (INIS)

    Kamaeva, O.B.; Polevoj, V.B.

    1983-01-01

    Realization of BESM-6 computer of a technique is described for calculating a wide class of reactivity disturbances by plotting trajectories in undisturbed and disturbed systems using one sequence of random numbers. The technique was realized on the base of earlier created programs of calculation of widespreed (PERL) and local (LAVR) reactivity disturbances. The efficiency of the technique and programs is demonstrated by calculation of change of effective neutron-multiplication factor when absorber is substituted for fuel element in a BFS-40 critical assembly and by calculation of control drum characteristics

  6. Analysis of entropy extraction efficiencies in random number generation systems

    Science.gov (United States)

    Wang, Chao; Wang, Shuang; Chen, Wei; Yin, Zhen-Qiang; Han, Zheng-Fu

    2016-05-01

    Random numbers (RNs) have applications in many areas: lottery games, gambling, computer simulation, and, most importantly, cryptography [N. Gisin et al., Rev. Mod. Phys. 74 (2002) 145]. In cryptography theory, the theoretical security of the system calls for high quality RNs. Therefore, developing methods for producing unpredictable RNs with adequate speed is an attractive topic. Early on, despite the lack of theoretical support, pseudo RNs generated by algorithmic methods performed well and satisfied reasonable statistical requirements. However, as implemented, those pseudorandom sequences were completely determined by mathematical formulas and initial seeds, which cannot introduce extra entropy or information. In these cases, “random” bits are generated that are not at all random. Physical random number generators (RNGs), which, in contrast to algorithmic methods, are based on unpredictable physical random phenomena, have attracted considerable research interest. However, the way that we extract random bits from those physical entropy sources has a large influence on the efficiency and performance of the system. In this manuscript, we will review and discuss several randomness extraction schemes that are based on radiation or photon arrival times. We analyze the robustness, post-processing requirements and, in particular, the extraction efficiency of those methods to aid in the construction of efficient, compact and robust physical RNG systems.

  7. Superparamagnetic perpendicular magnetic tunnel junctions for true random number generators

    Science.gov (United States)

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

    2018-05-01

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

  8. A pseudo-random number generator and its spectral test

    International Nuclear Information System (INIS)

    Wang Lai

    1998-01-01

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

  9. The linking number and the writhe of uniform random walks and polygons in confined spaces

    International Nuclear Information System (INIS)

    Panagiotou, E; Lambropoulou, S; Millett, K C

    2010-01-01

    Random walks and polygons are used to model polymers. In this paper we consider the extension of the writhe, self-linking number and linking number to open chains. We then study the average writhe, self-linking and linking number of random walks and polygons over the space of configurations as a function of their length. We show that the mean squared linking number, the mean squared writhe and the mean squared self-linking number of oriented uniform random walks or polygons of length n, in a convex confined space, are of the form O(n 2 ). Moreover, for a fixed simple closed curve in a convex confined space, we prove that the mean absolute value of the linking number between this curve and a uniform random walk or polygon of n edges is of the form O(√n). Our numerical studies confirm those results. They also indicate that the mean absolute linking number between any two oriented uniform random walks or polygons, of n edges each, is of the form O(n). Equilateral random walks and polygons are used to model polymers in θ-conditions. We use numerical simulations to investigate how the self-linking and linking number of equilateral random walks scale with their length.

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

    Science.gov (United States)

    Lee, Michael J

    2008-09-01

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

  11. Identification of System Parameters by the Random Decrement Technique

    DEFF Research Database (Denmark)

    Brincker, Rune; Kirkegaard, Poul Henning; Rytter, Anders

    1991-01-01

    -Walker equations and finally, least-square fitting of the theoretical correlation function. The results are compared to the results of fitting an Auto Regressive Moving Average (ARMA) model directly to the system output from a single-degree-of-freedom system loaded by white noise.......The aim of this paper is to investigate and illustrate the possibilities of using correlation functions estimated by the Random Decrement Technique as a basis for parameter identification. A two-stage system identification system is used: first, the correlation functions are estimated by the Random...... Decrement Technique, and then the system parameters are identified from the correlation function estimates. Three different techniques are used in the parameter identification process: a simple non-parametric method, estimation of an Auto Regressive (AR) model by solving an overdetermined set of Yule...

  12. On the Periods of the {ranshi} Random Number Generator

    Science.gov (United States)

    Gutbrod, F.

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

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

    Science.gov (United States)

    2010-04-01

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

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

    Science.gov (United States)

    Kalle, Claus; Wansleben, Stephan

    1984-10-01

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

  15. Building Kindergartners' Number Sense: A Randomized Controlled Study.

    Science.gov (United States)

    Jordan, Nancy C; Glutting, Joseph; Dyson, Nancy; Hassinger-Das, Brenna; Irwin, Casey

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

  16. Quantum random number generator based on quantum tunneling effect

    OpenAIRE

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

    2017-01-01

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

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

    International Nuclear Information System (INIS)

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

    2007-01-01

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

  18. Identification of System Parameters by the Random Decrement Technique

    DEFF Research Database (Denmark)

    Brincker, Rune; Kirkegaard, Poul Henning; Rytter, Anders

    -Walker equations and finally least square fitting of the theoretical correlation function. The results are compared to the results of fitting an Auto Regressive Moving Average(ARMA) model directly to the system output. All investigations are performed on the simulated output from a single degree-off-freedom system......The aim of this paper is to investigate and illustrate the possibilities of using correlation functions estimated by the Random Decrement Technique as a basis for parameter identification. A two-stage system identification method is used: first the correlation functions are estimated by the Random...... Decrement technique and then the system parameters are identified from the correlation function estimates. Three different techniques are used in the parameters identification process: a simple non-paramatic method, estimation of an Auto Regressive(AR) model by solving an overdetermined set of Yule...

  19. Hardware implementation of a GFSR pseudo-random number generator

    Science.gov (United States)

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

    1989-12-01

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

  20. An investigation of the uniform random number generator

    Science.gov (United States)

    Temple, E. C.

    1982-01-01

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

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

    International Nuclear Information System (INIS)

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

    2014-01-01

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

  2. Ultrafast quantum random number generation based on quantum phase fluctuations.

    Science.gov (United States)

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

    2012-05-21

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

  3. Cellular Automata-Based Parallel Random Number Generators Using FPGAs

    Directory of Open Access Journals (Sweden)

    David H. K. Hoe

    2012-01-01

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

  4. Building Kindergartners’ Number Sense: A Randomized Controlled Study

    Science.gov (United States)

    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

  5. On the number of spanning trees in random regular graphs

    DEFF Research Database (Denmark)

    Greenhill, Catherine; Kwan, Matthew; Wind, David Kofoed

    2014-01-01

    Let d >= 3 be a fixed integer. We give an asympotic formula for the expected number of spanning trees in a uniformly random d-regular graph with n vertices. (The asymptotics are as n -> infinity, restricted to even n if d is odd.) We also obtain the asymptotic distribution of the number of spanning...

  6. On Random Numbers and Design

    Science.gov (United States)

    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…

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

    Science.gov (United States)

    Stipčević, Mario; Ursin, Rupert

    2015-06-09

    Random numbers are essential for our modern information based society e.g. in cryptography. Unlike frequently used pseudo-random generators, physical random number generators do not depend on complex algorithms but rather on a physical process to provide true randomness. Quantum random number generators (QRNG) do rely on a process, which can be described by a probabilistic theory only, even in principle. Here we present a conceptually simple implementation, which offers a 100% efficiency of producing a random bit upon a request and simultaneously exhibits an ultra low latency. A careful technical and statistical analysis demonstrates its robustness against imperfections of the actual implemented technology and enables to quickly estimate randomness of very long sequences. Generated random numbers pass standard statistical tests without any post-processing. The setup described, as well as the theory presented here, demonstrate the maturity and overall understanding of the technology.

  8. Covariance of the number of real zeros of a random trigonometric polynomial

    Directory of Open Access Journals (Sweden)

    K. Farahmand

    2006-01-01

    Full Text Available For random coefficients aj and bj we consider a random trigonometric polynomial defined as Tn(θ=∑j=0n{ajcos⁡jθ+bjsin⁡jθ}. The expected number of real zeros of Tn(θ in the interval (0,2π can be easily obtained. In this note we show that this number is in fact n/3. However the variance of the above number is not known. This note presents a method which leads to the asymptotic value for the covariance of the number of real zeros of the above polynomial in intervals (0,π and (π,2π. It can be seen that our method in fact remains valid to obtain the result for any two disjoint intervals. The applicability of our method to the classical random trigonometric polynomial, defined as Pn(θ=∑j=0naj(ωcos⁡jθ, is also discussed. Tn(θ has the advantage on Pn(θ of being stationary, with respect to θ, for which, therefore, a more advanced method developed could be used to yield the results.

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

    Science.gov (United States)

    Molotkov, S. N.

    2017-03-01

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

  10. Raw and Central Moments of Binomial Random Variables via Stirling Numbers

    Science.gov (United States)

    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…

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

    Science.gov (United States)

    2010-07-01

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

  12. Determining the Number of Factors in P-Technique Factor Analysis

    Science.gov (United States)

    Lo, Lawrence L.; Molenaar, Peter C. M.; Rovine, Michael

    2017-01-01

    Determining the number of factors is a critical first step in exploratory factor analysis. Although various criteria and methods for determining the number of factors have been evaluated in the usual between-subjects R-technique factor analysis, there is still question of how these methods perform in within-subjects P-technique factor analysis. A…

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

    International Nuclear Information System (INIS)

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

    2009-01-01

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

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

    International Nuclear Information System (INIS)

    Fu-Lai, Wang

    2010-01-01

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

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

    Science.gov (United States)

    Wang, Fu-Lai

    2010-09-01

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

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

    Directory of Open Access Journals (Sweden)

    Han Shuangshuang

    2013-07-01

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

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

    Science.gov (United States)

    Sibidanov, Alexei

    2017-12-01

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

  18. Note on Marsaglia\\'s Xorshift Random Number Generators

    Directory of Open Access Journals (Sweden)

    Richard P. Brent

    2004-08-01

    Full Text Available Marsaglia (2003 has described a class of Xorshift random number generators (RNGs with periods 2n - 1 for n = 32, 64, etc. We show that the sequences generated by these RNGs are identical to the sequences generated by certain linear feedback shift register (LFSR generators using "exclusive or" (xor operations on n-bit words, with a recurrence defined by a primitive polynomial of degree n.

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

    Energy Technology Data Exchange (ETDEWEB)

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

    2014-02-03

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

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

    Science.gov (United States)

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

    2016-12-27

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

  1. A random number generator for continuous random variables

    Science.gov (United States)

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

    1972-01-01

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

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

    Science.gov (United States)

    Sun, Shi-Hai; Xu, Feihu

    2017-12-01

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

  3. Pseudo-random number generator based on asymptotic deterministic randomness

    Science.gov (United States)

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

    2008-06-01

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

  4. Pseudo-random number generator based on asymptotic deterministic randomness

    International Nuclear Information System (INIS)

    Wang Kai; Pei Wenjiang; Xia Haishan; Cheung Yiuming

    2008-01-01

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

  5. Multiuser Random Coding Techniques for Mismatched Decoding

    OpenAIRE

    Scarlett, Jonathan; Martinez, Alfonso; Guillén i Fàbregas, Albert

    2016-01-01

    This paper studies multiuser random coding techniques for channel coding with a given (possibly suboptimal) decoding rule. For the mismatched discrete memoryless multiple-access channel, an error exponent is obtained that is tight with respect to the ensemble average, and positive within the interior of Lapidoth's achievable rate region. This exponent proves the ensemble tightness of the exponent of Liu and Hughes in the case of maximum-likelihood decoding. An equivalent dual form of Lapidoth...

  6. Pseudo-Random Number Generators for Vector Processors and Multicore Processors

    DEFF Research Database (Denmark)

    Fog, Agner

    2015-01-01

    Large scale Monte Carlo applications need a good pseudo-random number generator capable of utilizing both the vector processing capabilities and multiprocessing capabilities of modern computers in order to get the maximum performance. The requirements for such a generator are discussed. New ways...

  7. Random Number Simulations Reveal How Random Noise Affects the Measurements and Graphical Portrayals of Self-Assessed Competency

    Directory of Open Access Journals (Sweden)

    Edward Nuhfer

    2016-01-01

    Full Text Available Self-assessment measures of competency are blends of an authentic self-assessment signal that researchers seek to measure and random disorder or "noise" that accompanies that signal. In this study, we use random number simulations to explore how random noise affects critical aspects of self-assessment investigations: reliability, correlation, critical sample size, and the graphical representations of self-assessment data. We show that graphical conventions common in the self-assessment literature introduce artifacts that invite misinterpretation. Troublesome conventions include: (y minus x vs. (x scatterplots; (y minus x vs. (x column graphs aggregated as quantiles; line charts that display data aggregated as quantiles; and some histograms. Graphical conventions that generate minimal artifacts include scatterplots with a best-fit line that depict (y vs. (x measures (self-assessed competence vs. measured competence plotted by individual participant scores, and (y vs. (x scatterplots of collective average measures of all participants plotted item-by-item. This last graphic convention attenuates noise and improves the definition of the signal. To provide relevant comparisons across varied graphical conventions, we use a single dataset derived from paired measures of 1154 participants' self-assessed competence and demonstrated competence in science literacy. Our results show that different numerical approaches employed in investigating and describing self-assessment accuracy are not equally valid. By modeling this dataset with random numbers, we show how recognizing the varied expressions of randomness in self-assessment data can improve the validity of numeracy-based descriptions of self-assessment.

  8. Recurrence and Polya Number of General One-Dimensional Random Walks

    International Nuclear Information System (INIS)

    Zhang Xiaokun; Wan Jing; Lu Jingju; Xu Xinping

    2011-01-01

    The recurrence properties of random walks can be characterized by Polya number, i.e., the probability that the walker has returned to the origin at least once. In this paper, we consider recurrence properties for a general 1D random walk on a line, in which at each time step the walker can move to the left or right with probabilities l and r, or remain at the same position with probability o (l + r + o = 1). We calculate Polya number P of this model and find a simple expression for P as, P = 1 - Δ, where Δ is the absolute difference of l and r (Δ = |l - r|). We prove this rigorous expression by the method of creative telescoping, and our result suggests that the walk is recurrent if and only if the left-moving probability l equals to the right-moving probability r. (general)

  9. Very high performance pseudo-random number generation on DAP

    Science.gov (United States)

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

    1985-07-01

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

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

    Directory of Open Access Journals (Sweden)

    Marcin Piotr Pawlowski

    2015-10-01

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

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

    Science.gov (United States)

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

    2015-01-01

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

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

    Science.gov (United States)

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

    2015-10-22

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

  13. Long period pseudo random number sequence generator

    Science.gov (United States)

    Wang, Charles C. (Inventor)

    1989-01-01

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

  14. Mathematical conversations multicolor problems, problems in the theory of numbers, and random walks

    CERN Document Server

    Dynkin, E B

    2006-01-01

    Comprises Multicolor Problems, dealing with map-coloring problems; Problems in the Theory of Numbers, an elementary introduction to algebraic number theory; Random Walks, addressing basic problems in probability theory. 1963 edition.

  15. Quantum random number generator based on quantum nature of vacuum fluctuations

    Science.gov (United States)

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

    2017-11-01

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

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

    International Nuclear Information System (INIS)

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

    2014-01-01

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

  17. A Randomized Controlled Trial of Mastication with Complete Dentures Made by a Conventional or an Abbreviated Technique.

    Science.gov (United States)

    Mengatto, Cristiane Machado; Gameiro, Gustavo Hauber; Brondani, Mario; Owen, C Peter; MacEntee, Michael I

    The aim of this randomized clinical trial was to test the hypothesis that there are no statistically significant differences after 3 and 6 months in masticatory performance or chewing ability of people with new complete dentures made by an abbreviated or a conventional technique. The trial included 20 edentulous participants at a dental school in Brazil assigned randomly to receive dentures made by either a conventional technique involving six clinical sessions or by an abbreviated technique involving three clinical sessions. At baseline with old dentures and at 3 and 6 months with new dentures, masticatory performance was measured by counting the number of chewing strokes and the time before participants had an urge to swallow and by calculating the medium particle size of a silicone material after 20 chewing strokes and at the urge to swallow. On each occasion, the participants recorded on visual analog scales their ability to chew five food textures. Statistical significance (P ≤ .05) of changes in masticatory performance and chewing ability during the trial were analyzed with generalized estimating equations. Both techniques improved masticatory performance between baseline and 6 months and the ability to bite and chew all foods apart from hard apples. There were no significant differences in masticatory performance or chewing ability after 6 months between complete dentures made by a conventional or an abbreviated technique.

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

    Directory of Open Access Journals (Sweden)

    Lawnik Marcin

    2018-02-01

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

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

    Science.gov (United States)

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

    2012-03-26

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

  20. Random number generators in support of Monte Carlo problems in physics

    International Nuclear Information System (INIS)

    Dyadkin, I.G.

    1993-01-01

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

  1. Generating log-normally distributed random numbers by using the Ziggurat algorithm

    International Nuclear Information System (INIS)

    Choi, Jong Soo

    2016-01-01

    Uncertainty analyses are usually based on the Monte Carlo method. Using an efficient random number generator(RNG) is a key element in success of Monte Carlo simulations. Log-normal distributed variates are very typical in NPP PSAs. This paper proposes an approach to generate log normally distributed variates based on the Ziggurat algorithm and evaluates the efficiency of the proposed Ziggurat RNG. The proposed RNG can be helpful to improve the uncertainty analysis of NPP PSAs. This paper focuses on evaluating the efficiency of the Ziggurat algorithm from a NPP PSA point of view. From this study, we can draw the following conclusions. - The Ziggurat algorithm is one of perfect random number generators to product normal distributed variates. - The Ziggurat algorithm is computationally much faster than the most commonly used method, Marsaglia polar method

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

    Directory of Open Access Journals (Sweden)

    Dongfang Li

    2015-10-01

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

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

    Science.gov (United States)

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

    2015-10-16

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

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

    Science.gov (United States)

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

    2018-01-01

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

  5. Classification of Phishing Email Using Random Forest Machine Learning Technique

    Directory of Open Access Journals (Sweden)

    Andronicus A. Akinyelu

    2014-01-01

    Full Text Available Phishing is one of the major challenges faced by the world of e-commerce today. Thanks to phishing attacks, billions of dollars have been lost by many companies and individuals. In 2012, an online report put the loss due to phishing attack at about $1.5 billion. This global impact of phishing attacks will continue to be on the increase and thus requires more efficient phishing detection techniques to curb the menace. This paper investigates and reports the use of random forest machine learning algorithm in classification of phishing attacks, with the major objective of developing an improved phishing email classifier with better prediction accuracy and fewer numbers of features. From a dataset consisting of 2000 phishing and ham emails, a set of prominent phishing email features (identified from the literature were extracted and used by the machine learning algorithm with a resulting classification accuracy of 99.7% and low false negative (FN and false positive (FP rates.

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

    Science.gov (United States)

    Strenge, Hans; Niederberger, Uwe

    2008-06-01

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

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

    Science.gov (United States)

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

    2018-02-01

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

  8. Primitive polynomials selection method for pseudo-random number generator

    Science.gov (United States)

    Anikin, I. V.; Alnajjar, Kh

    2018-01-01

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

  9. Sugar Cane Genome Numbers Assumption by Ribosomal DNA FISH Techniques

    NARCIS (Netherlands)

    Thumjamras, S.; Jong, de H.; Iamtham, S.; Prammanee, S.

    2013-01-01

    Conventional cytological method is limited for polyploidy plant genome study, especially sugar cane chromosomes that show unstable numbers of each cultivar. Molecular cytogenetic as fluorescent in situ hybridization (FISH) techniques were used in this study. A basic chromosome number of sugar cane

  10. Analyzing indirect effects in cluster randomized trials. The effect of estimation method, number of groups and group sizes on accuracy and power.

    Directory of Open Access Journals (Sweden)

    Joop eHox

    2014-02-01

    Full Text Available Cluster randomized trials assess the effect of an intervention that is carried out at the group or cluster level. Ajzen’s theory of planned behaviour is often used to model the effect of the intervention as an indirect effect mediated in turn by attitude, norms and behavioural intention. Structural equation modelling (SEM is the technique of choice to estimate indirect effects and their significance. However, this is a large sample technique, and its application in a cluster randomized trial assumes a relatively large number of clusters. In practice, the number of clusters in these studies tends to be relatively small, e.g. much less than fifty. This study uses simulation methods to find the lowest number of clusters needed when multilevel SEM is used to estimate the indirect effect. Maximum likelihood estimation is compared to Bayesian analysis, with the central quality criteria being accuracy of the point estimate and the confidence interval. We also investigate the power of the test for the indirect effect. We conclude that Bayes estimation works well with much smaller cluster level sample sizes such as 20 cases than maximum likelihood estimation; although the bias is larger the coverage is much better. When only 5 to 10 clusters are available per treatment condition even with Bayesian estimation problems occur.

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

    International Nuclear Information System (INIS)

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

    2016-01-01

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

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

    Energy Technology Data Exchange (ETDEWEB)

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

    2016-07-15

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

  13. Theoretical and empirical convergence results for additive congruential random number generators

    Science.gov (United States)

    Wikramaratna, Roy S.

    2010-03-01

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

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

    Science.gov (United States)

    Demchik, Vadim

    2011-03-01

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

  15. Generating Random Samples of a Given Size Using Social Security Numbers.

    Science.gov (United States)

    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)

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

    Directory of Open Access Journals (Sweden)

    Zahra Bisadi

    2018-02-01

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

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

    International Nuclear Information System (INIS)

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

    2012-01-01

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

  18. Comparison between ultrasound guided technique and digital palpation technique for radial artery cannulation in adult patients: An updated meta-analysis of randomized controlled trials.

    Science.gov (United States)

    Bhattacharjee, Sulagna; Maitra, Souvik; Baidya, Dalim K

    2018-03-22

    Possible advantages and risks associated with ultrasound guided radial artery cannulation in-comparison to digital palpation guided method in adult patients are not fully known. We have compared ultrasound guided radial artery cannulation with digital palpation technique in this meta-analysis. Meta-analysis of randomized controlled trials. Trials conducted in operating room, emergency department, cardiac catheterization laboratory. PubMed and Cochrane Central Register of Controlled Trials (CENTRAL) were searched (from 1946 to 20th November 2017) to identify prospective randomized controlled trials in adult patients. Two-dimensional ultrasound guided radial artery catheterization versus digital palpation guided radial artery cannulation. Overall cannulation success rate, first attempt success rate, time to cannulation and mean number of attempts to successful cannulation. Odds ratio (OR) and standardized mean difference (SMD) or mean difference (MD) with 95% confidence interval (CI) were calculated for categorical and continuous variables respectively. Data of 1895 patients from 10 studies have been included in this meta- analysis. Overall cannulation success rate was similar between ultrasound guided technique and digital palpation [OR (95% CI) 2.01 (1.00, 4.06); p = 0.05]. Ultrasound guided radial artery cannulation is associated with higher first attempt success rate of radial artery cannulation in comparison to digital palpation [OR (95% CI) 2.76 (186, 4.10); p guided technique with palpation technique. Radial artery cannulation by ultrasound guidance may increase the first attempt success rate but not the overall cannulation success when compared to digital palpation technique. However, results of this meta-analysis should be interpreted with caution due presence of heterogeneity. Copyright © 2018. Published by Elsevier Inc.

  19. Similarity and number of alternatives in the random-dot motion paradigm

    NARCIS (Netherlands)

    van Maanen, L.; Grasman, R.P.P.P.; Forstmann, B.U.; Keuken, M.C.; Brown, S.D.; Wagenmakers, E.-J.

    2012-01-01

    The popular random-dot motion (RDM) task has recently been applied to multiple-choice perceptual decisionmaking. However, changes in the number of alternatives on an RDM display lead to changes in the similarity between the alternatives, complicating the study of multiple-choice effects. To

  20. Learning Binomial Probability Concepts with Simulation, Random Numbers and a Spreadsheet

    Science.gov (United States)

    Rochowicz, John A., Jr.

    2005-01-01

    This paper introduces the reader to the concepts of binomial probability and simulation. A spreadsheet is used to illustrate these concepts. Random number generators are great technological tools for demonstrating the concepts of probability. Ideas of approximation, estimation, and mathematical usefulness provide numerous ways of learning…

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

    Science.gov (United States)

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

    1982-01-01

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

  2. The optimal injection technique for the osteoarthritic ankle: A randomized, cross-over trial

    NARCIS (Netherlands)

    Witteveen, Angelique G. H.; Kok, Aimee; Sierevelt, Inger N.; Kerkhoffs, Gino M. M. J.; van Dijk, C. Niek

    2013-01-01

    Background: To optimize the injection technique for the osteoarthritic ankle in order to enhance the effect of intra-articular injections and minimize adverse events. Methods: Randomized cross-over trial. Comparing two injection techniques in patients with symptomatic ankle osteoarthritis. Patients

  3. Blocked Randomization with Randomly Selected Block Sizes

    Directory of Open Access Journals (Sweden)

    Jimmy Efird

    2010-12-01

    Full Text Available 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.

  4. Piezoelectric Versus Conventional Rotary Techniques for Impacted Third Molar Extraction: A Meta-analysis of Randomized Controlled Trials.

    Science.gov (United States)

    Jiang, Qian; Qiu, Yating; Yang, Chi; Yang, Jingyun; Chen, Minjie; Zhang, Zhiyuan

    2015-10-01

    Impacted third molars are frequently encountered in clinical work. Surgical removal of impacted third molars is often required to prevent clinical symptoms. Traditional rotary cutting instruments are potentially injurious, and piezosurgery, as a new osteotomy technique, has been introduced in oral and maxillofacial surgery. No consistent conclusion has been reached regarding whether this new technique is associated with fewer or less severe postoperative sequelae after third molar extraction.The aim of this study was to compare piezosurgery with rotary osteotomy techniques, with regard to surgery time and the severity of postoperative sequelae, including pain, swelling, and trismus.We conducted a systematic literature search in the Cochrane Library, PubMed, Embase, and Google Scholar.The eligibility criteria of this study included the following: the patients were clearly diagnosed as having impacted mandibular third molars; the patients underwent piezosurgery osteotomy, and in the control group rotary osteotomy techniques, for removing impacted third molars; the outcomes of interest include surgery time, trismus, swelling or pain; the studies are randomized controlled trials.We used random-effects models to calculate the difference in the outcomes, and the corresponding 95% confidence interval. We calculated the weighted mean difference if the trials used the same measurement, and a standardized mean difference if otherwise.A total of seven studies met the eligibility criteria and were included in our analysis. Compared with rotary osteotomy, patients undergoing piezosurgery experienced longer surgery time (mean difference 4.13 minutes, 95% confidence interval 2.75-5.52, P piezosurgery groups.The number of included randomized controlled trials and the sample size of each trial were relatively small, double blinding was not possible, and cost analysis was unavailable due to a lack of data.Our meta-analysis indicates that although patients undergoing piezosurgery

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

    Science.gov (United States)

    Wikramaratna, R. S.

    1989-07-01

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

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

    Science.gov (United States)

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

    2017-10-01

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

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

    Science.gov (United States)

    Boonsathorn, Wasita; Charoen, Danuvasin; Dryver, Arthur L.

    2014-01-01

    E-Learning brings access to a powerful but often overlooked teaching tool: random number generation. Using random number generation, a practically infinite number of quantitative problem-solution sets can be created. In addition, within the e-learning context, in the spirit of the mastery of learning, it is possible to assign online quantitative…

  8. Strong Laws of Large Numbers for Arrays of Rowwise NA and LNQD Random Variables

    Directory of Open Access Journals (Sweden)

    Jiangfeng Wang

    2011-01-01

    Full Text Available Some strong laws of large numbers and strong convergence properties for arrays of rowwise negatively associated and linearly negative quadrant dependent random variables are obtained. The results obtained not only generalize the result of Hu and Taylor to negatively associated and linearly negative quadrant dependent random variables, but also improve it.

  9. Quantum Statistical Testing of a Quantum Random Number Generator

    Energy Technology Data Exchange (ETDEWEB)

    Humble, Travis S [ORNL

    2014-01-01

    The unobservable elements in a quantum technology, e.g., the quantum state, complicate system verification against promised behavior. Using model-based system engineering, we present methods for verifying the opera- tion of a prototypical quantum random number generator. We begin with the algorithmic design of the QRNG followed by the synthesis of its physical design requirements. We next discuss how quantum statistical testing can be used to verify device behavior as well as detect device bias. We conclude by highlighting how system design and verification methods must influence effort to certify future quantum technologies.

  10. Low-wave-number statistics of randomly advected passive scalars

    International Nuclear Information System (INIS)

    Kerstein, A.R.; McMurtry, P.A.

    1994-01-01

    A heuristic analysis of the decay of a passive scalar field subject to statistically steady random advection, predicts two low-wave-number spectral scaling regimes analogous to the similarity states previously identified by Chasnov [Phys. Fluids 6, 1036 (1994)]. Consequences of their predicted coexistence in a single flow are examined. The analysis is limited to the idealized case of narrow band advection. To complement the analysis, and to extend the predictions to physically more realistic advection processes, advection diffusion is simulated using a one-dimensional stochastic model. An experimental test of the predictions is proposed

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

    Science.gov (United States)

    Ossola, Giovanni; Sokal, Alan D

    2004-08-01

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

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

    Science.gov (United States)

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

    2014-08-12

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

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

    International Nuclear Information System (INIS)

    Procassini, R J; Beck, B R

    2004-01-01

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

  14. Validation of the k-filtering technique for a signal composed of random-phase plane waves and non-random coherent structures

    Directory of Open Access Journals (Sweden)

    O. W. Roberts

    2014-12-01

    Full Text Available Recent observations of astrophysical magnetic fields have shown the presence of fluctuations being wave-like (propagating in the plasma frame and those described as being structure-like (advected by the plasma bulk velocity. Typically with single-spacecraft missions it is impossible to differentiate between these two fluctuations, due to the inherent spatio-temporal ambiguity associated with a single point measurement. However missions such as Cluster which contain multiple spacecraft have allowed for temporal and spatial changes to be resolved, using techniques such as k filtering. While this technique does not assume Taylor's hypothesis it requires both weak stationarity of the time series and that the fluctuations can be described by a superposition of plane waves with random phases. In this paper we test whether the method can cope with a synthetic signal which is composed of a combination of non-random-phase coherent structures with a mean radius d and a mean separation λ, as well as plane waves with random phase.

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

    Science.gov (United States)

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

    2017-10-01

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

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

    Science.gov (United States)

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

    2008-08-01

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

  17. The additive congruential random number generator--A special case of a multiple recursive generator

    Science.gov (United States)

    Wikramaratna, Roy S.

    2008-07-01

    This paper considers an approach to generating uniformly distributed pseudo-random numbers which works well in serial applications but which also appears particularly well-suited for application on parallel processing systems. Additive Congruential Random Number (ACORN) generators are straightforward to implement for arbitrarily large order and modulus; if implemented using integer arithmetic, it becomes possible to generate identical sequences on any machine. Previously published theoretical analysis has demonstrated that a kth order ACORN sequence approximates to being uniformly distributed in up to k dimensions, for any given k. ACORN generators can be constructed to give period lengths exceeding any given number (for example, with period length in excess of 230p, for any given p). Results of empirical tests have demonstrated that, if p is greater than or equal to 2, then the ACORN generator can be used successfully for generating double precision uniform random variates. This paper demonstrates that an ACORN generator is a particular case of a multiple recursive generator (and, therefore, also a special case of a matrix generator). Both these latter approaches have been widely studied, and it is to be hoped that the results given in the present paper will lead to greater confidence in using the ACORN generators.

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

    Science.gov (United States)

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

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

  19. Expected number of real roots for random linear combinations of orthogonal polynomials associated with radial weights

    OpenAIRE

    Bayraktar, Turgay

    2017-01-01

    In this note, we obtain asymptotic expected number of real zeros for random polynomials of the form $$f_n(z)=\\sum_{j=0}^na^n_jc^n_jz^j$$ where $a^n_j$ are independent and identically distributed real random variables with bounded $(2+\\delta)$th absolute moment and the deterministic numbers $c^n_j$ are normalizing constants for the monomials $z^j$ within a weighted $L^2$-space induced by a radial weight function satisfying suitable smoothness and growth conditions.

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

    CERN Document Server

    Tlelo-Cuautle, Esteban; de la Fraga, Luis Gerardo

    2016-01-01

    This book offers readers a clear guide to implementing engineering applications with FPGAs, from the mathematical description to the hardware synthesis, including discussion of VHDL programming and co-simulation issues. Coverage includes FPGA realizations such as: chaos generators that are described from their mathematical models; artificial neural networks (ANNs) to predict chaotic time series, for which a discussion of different ANN topologies is included, with different learning techniques and activation functions; random number generators (RNGs) that are realized using different chaos generators, and discussions of their maximum Lyapunov exponent values and entropies. Finally, optimized chaotic oscillators are synchronized and realized to implement a secure communication system that processes black and white and grey-scale images. In each application, readers will find VHDL programming guidelines and computer arithmetic issues, along with co-simulation examples with Active-HDL and Simulink. Readers will b...

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

    International Nuclear Information System (INIS)

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

    2011-01-01

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

  2. Estimation of the Coefficient of Restitution of Rocking Systems by the Random Decrement Technique

    DEFF Research Database (Denmark)

    Brincker, Rune; Demosthenous, Milton; Manos, George C.

    1994-01-01

    The aim of this paper is to investigate the possibility of estimating an average damping parameter for a rocking system due to impact, the so-called coefficient of restitution, from the random response, i.e. when the loads are random and unknown, and the response is measured. The objective...... is to obtain an estimate of the free rocking response from the measured random response using the Random Decrement (RDD) Technique, and then estimate the coefficient of restitution from this free response estimate. In the paper this approach is investigated by simulating the response of a single degree...

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

    Science.gov (United States)

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

    2014-04-01

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

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

    Science.gov (United States)

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

    1998-08-01

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

  5. A comparison of direct technique with the liquid stylet technique of radial artery cannulation in patients presenting for coronary artery bypass grafting

    International Nuclear Information System (INIS)

    Younus, U.; Ahmed, I.

    2012-01-01

    To compare direct technique with the liquid stylet technique of radial artery cannulation in patients undergoing coronary artery byroms grouping. We hypothesized that liquid stylet technique would lead to fewer attempts and save vital time. Study Design: Randomized controlled Trial (RCT). Place and Duration of Study: Department of Anaesthesia and Intensive Care, Armed Forces Institute of Cardiology and National Institute of Heart Diseases, [AFIC-NIHD] Rawalpindi, between 1 July 2007 to 31 Dec 2007. Patients and Methods: One hundred patients of either sex scheduled for CABG were included and were randomized to 2 groups using random number table. Fifty patients in the direct technique group and 50 in the liquid stylet group. Results: These two groups comparable with respect to age, gender and weight were studied. The number of attempts in group 1 were 1.7+-0.5 vs 3.6+-1.6 in groups 2, (p=0.021). The time consumed in group was 3.3 +- 2.2 minutes while in groups 2 it was 8.0 +- 3.6 (p=0.022). Conclusion: We concluded that the liquid stylet technique is safe, quick and is associated with lesser number of attempts at cannulation. Secondly it can be done without fancy guide wires and other technology especially in a developing country like Pakistan. (author)

  6. Random number generators tested on quantum Monte Carlo simulations.

    Science.gov (United States)

    Hongo, Kenta; Maezono, Ryo; Miura, Kenichi

    2010-08-01

    We have tested and compared several (pseudo) random number generators (RNGs) applied to a practical application, ground state energy calculations of molecules using variational and diffusion Monte Carlo metheds. A new multiple recursive generator with 8th-order recursion (MRG8) and the Mersenne twister generator (MT19937) are tested and compared with the RANLUX generator with five luxury levels (RANLUX-[0-4]). Both MRG8 and MT19937 are proven to give the same total energy as that evaluated with RANLUX-4 (highest luxury level) within the statistical error bars with less computational cost to generate the sequence. We also tested the notorious implementation of linear congruential generator (LCG), RANDU, for comparison. (c) 2010 Wiley Periodicals, Inc.

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

    OpenAIRE

    Chen, Jiageng; Miyaji, Atsuko; Su, Chunhua

    2014-01-01

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

  8. Statistical evaluation of PACSTAT random number generation capabilities

    Energy Technology Data Exchange (ETDEWEB)

    Piepel, G.F.; Toland, M.R.; Harty, H.; Budden, M.J.; Bartley, C.L.

    1988-05-01

    This report summarizes the work performed in verifying the general purpose Monte Carlo driver-program PACSTAT. The main objective of the work was to verify the performance of PACSTAT's random number generation capabilities. Secondary objectives were to document (using controlled configuration management procedures) changes made in PACSTAT at Pacific Northwest Laboratory, and to assure that PACSTAT input and output files satisfy quality assurance traceability constraints. Upon receipt of the PRIME version of the PACSTAT code from the Basalt Waste Isolation Project, Pacific Northwest Laboratory staff converted the code to run on Digital Equipment Corporation (DEC) VAXs. The modifications to PACSTAT were implemented using the WITNESS configuration management system, with the modifications themselves intended to make the code as portable as possible. Certain modifications were made to make the PACSTAT input and output files conform to quality assurance traceability constraints. 10 refs., 17 figs., 6 tabs.

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

    International Nuclear Information System (INIS)

    Luescher, M.

    1993-09-01

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

  10. Eliciting illegal migration rates through list randomization

    NARCIS (Netherlands)

    McKenzie, D.; Siegel, M.

    2013-01-01

    Most migration surveys do not ask about the legal status of migrants due to concerns about the sensitivity of this question. List randomization is a technique that has been used in a number of other social science applications to elicit sensitive information. We trial this technique by adding it to

  11. Surgical timing after chemoradiotherapy for rectal cancer, analysis of technique (STARRCAT): results of a feasibility multi-centre randomized controlled trial.

    Science.gov (United States)

    Foster, J D; Ewings, P; Falk, S; Cooper, E J; Roach, H; West, N P; Williams-Yesson, B A; Hanna, G B; Francis, N K

    2016-10-01

    The optimal time of rectal resection after long-course chemoradiotherapy (CRT) remains unclear. A feasibility study was undertaken for a multi-centre randomized controlled trial evaluating the impact of the interval after chemoradiotherapy on the technical complexity of surgery. Patients with rectal cancer were randomized to either a 6- or 12-week interval between CRT and surgery between June 2012 and May 2014 (ISRCTN registration number: 88843062). For blinded technical complexity assessment, the Observational Clinical Human Reliability Analysis technique was used to quantify technical errors enacted within video recordings of operations. Other measured outcomes included resection completeness, specimen quality, radiological down-staging, tumour cell density down-staging and surgeon-reported technical complexity. Thirty-one patients were enrolled: 15 were randomized to 6 and 16-12 weeks across 7 centres. Fewer eligible patients were identified than had been predicted. Of 23 patients who underwent resection, mean 12.3 errors were observed per case at 6 weeks vs. 10.7 at 12 weeks (p = 0.401). Other measured outcomes were similar between groups. The feasibility of measurement of operative performance of rectal cancer surgery as an endpoint was confirmed in this exploratory study. Recruitment of sufficient numbers of patients represented a challenge, and a proportion of patients did not proceed to resection surgery. These results suggest that interval after CRT may not substantially impact upon surgical technical performance.

  12. Classification of Phishing Email Using Random Forest Machine Learning Technique

    OpenAIRE

    Akinyelu, Andronicus A.; Adewumi, Aderemi O.

    2013-01-01

    Phishing is one of the major challenges faced by the world of e-commerce today. Thanks to phishing attacks, billions of dollars have been lost by many companies and individuals. In 2012, an online report put the loss due to phishing attack at about $1.5 billion. This global impact of phishing attacks will continue to be on the increase and thus requires more efficient phishing detection techniques to curb the menace. This paper investigates and reports the use of random forest machine learnin...

  13. Random Numbers Demonstrate the Frequency of Type I Errors: Three Spreadsheets for Class Instruction

    Science.gov (United States)

    Duffy, Sean

    2010-01-01

    This paper describes three spreadsheet exercises demonstrating the nature and frequency of type I errors using random number generation. The exercises are designed specifically to address issues related to testing multiple relations using correlation (Demonstration I), t tests varying in sample size (Demonstration II) and multiple comparisons…

  14. Exploring pseudo- and chaotic random Monte Carlo simulations

    Science.gov (United States)

    Blais, J. A. Rod; Zhang, Zhan

    2011-07-01

    Computer simulations are an increasingly important area of geoscience research and development. At the core of stochastic or Monte Carlo simulations are the random number sequences that are assumed to be distributed with specific characteristics. Computer-generated random numbers, uniformly distributed on (0, 1), can be very different depending on the selection of pseudo-random number (PRN) or chaotic random number (CRN) generators. In the evaluation of some definite integrals, the resulting error variances can even be of different orders of magnitude. Furthermore, practical techniques for variance reduction such as importance sampling and stratified sampling can be applied in most Monte Carlo simulations and significantly improve the results. A comparative analysis of these strategies has been carried out for computational applications in planar and spatial contexts. Based on these experiments, and on some practical examples of geodetic direct and inverse problems, conclusions and recommendations concerning their performance and general applicability are included.

  15. Comparison of four techniques of nasogastric tube insertion in anaesthetised, intubated patients: A randomized controlled trial

    Directory of Open Access Journals (Sweden)

    Mohan Chandra Mandal

    2014-01-01

    Full Text Available Background and Aims: Insertion of nasogastric tubes (NGTs in anaesthetised, intubated patients with a conventional method is sometimes difficult. Different techniques of NGT insertion have been tried with varying degree of success. The aim of this prospective, randomised, open-label study was to evaluate three modified techniques of NGT insertion comparing with the conventional method in respect of success rate, time taken for insertion and the adverse events. Methods: In the operation theatre of general surgery, the patients were randomly allocated into four groups: Group C (control group, n = 54, Group W (ureteral guide wire group, n = 54, Group F (neck flexion with lateral pressure, n = 54 and Group R (reverse Sellick′s manoeuvre, n = 54. The number of attempts for successful NGT insertion, time taken for insertion and adverse events were noted. Results: All the three modified techniques were found more successful than the conventional method on the first attempt. The least time taken for insertion was noted in the reverse Sellick′s method. However, on intergroup analysis, neck flexion and reverse Sellick′s methods were comparable but significantly faster than the other two methods with respect to time taken for insertion. Conclusion: Reverse Sellick′s manoeuver, neck flexion with lateral neck pressure and guide wire-assisted techniques are all better alternatives to the conventional method for successful, quick and reliable NGT insertion with permissible adverse events in anaesthetised, intubated adult patients. Further studies after eliminating major limitations of the present study are warranted to establish the superiority of any one of these modified techniques.

  16. Inflation in random Gaussian landscapes

    Energy Technology Data Exchange (ETDEWEB)

    Masoumi, Ali; Vilenkin, Alexander; Yamada, Masaki, E-mail: ali@cosmos.phy.tufts.edu, E-mail: vilenkin@cosmos.phy.tufts.edu, E-mail: Masaki.Yamada@tufts.edu [Institute of Cosmology, Department of Physics and Astronomy, Tufts University, Medford, MA 02155 (United States)

    2017-05-01

    We develop analytic and numerical techniques for studying the statistics of slow-roll inflation in random Gaussian landscapes. As an illustration of these techniques, we analyze small-field inflation in a one-dimensional landscape. We calculate the probability distributions for the maximal number of e-folds and for the spectral index of density fluctuations n {sub s} and its running α {sub s} . These distributions have a universal form, insensitive to the correlation function of the Gaussian ensemble. We outline possible extensions of our methods to a large number of fields and to models of large-field inflation. These methods do not suffer from potential inconsistencies inherent in the Brownian motion technique, which has been used in most of the earlier treatments.

  17. Hypoalgesic effects of three different manual therapy techniques on cervical spine and psychological interaction: A randomized clinical trial.

    Science.gov (United States)

    Alonso-Perez, Jose Luis; Lopez-Lopez, Almudena; La Touche, Roy; Lerma-Lara, Sergio; Suarez, Emilio; Rojas, Javier; Bishop, Mark D; Villafañe, Jorge Hugo; Fernández-Carnero, Josué

    2017-10-01

    The purpose of this study was to evaluate the extent to which psychological factors interact with a particular manual therapy (MT) technique to induce hypoalgesia in healthy subjects. Seventy-five healthy volunteers (36 female, 39 males), were recruited in this double-blind, controlled and parallel study. Subjects were randomly assigned to receive: High velocity low amplitude technique (HVLA), joint mobilization, or Cervical Lateral glide mobilization (CLGM). Pressure pain threshold (PPT) over C7 unilaterally, trapezius muscle and lateral epicondyle bilaterally, were measured prior to single technique MT was applied and immediately after to applied MT. Pain catastrophizing, depression, anxiety and kinesiophobia were evaluated before treatment. The results indicate that hypoalgesia was observed in all groups after treatment in the neck and elbow region (P < 0.05), but mobilization induces more hypoalgesic effects. Catastrophizing interacted with change over time in PPT, for changes in C7 and in manipulation group. All the MT techniques studied produced local and segmental hypoalgesic effects, supporting the results of previous studies studying the individual interventions. Interaction between catastrophizing and HVLA technique suggest that whether catastrophizing level is low or medium, the chance of success is high, but high levels of catastrophizing may result in poor outcome after HVLA intervention. ClinicalTrials.gov Registration Number: NCT02782585. Copyright © 2016 Elsevier Ltd. All rights reserved.

  18. Dental Students' Perceptions of Digital and Conventional Impression Techniques: A Randomized Controlled Trial.

    Science.gov (United States)

    Zitzmann, Nicola U; Kovaltschuk, Irina; Lenherr, Patrik; Dedem, Philipp; Joda, Tim

    2017-10-01

    The aim of this randomized controlled trial was to analyze inexperienced dental students' perceptions of the difficulty and applicability of digital and conventional implant impressions and their preferences including performance. Fifty undergraduate dental students at a dental school in Switzerland were randomly divided into two groups (2×25). Group A first took digital impressions in a standardized phantom model and then conventional impressions, while the procedures were reversed for Group B. Participants were asked to complete a VAS questionnaire (0-100) on the level of difficulty and applicability (user/patient-friendliness) of both techniques. They were asked which technique they preferred and perceived to be more efficient. A quotient of "effective scan time per software-recorded time" (TRIOS) was calculated as an objective quality indicator for intraoral optical scanning (IOS). The majority of students perceived IOS as easier than the conventional technique. Most (72%) preferred the digital approach using IOS to take the implant impression to the conventional method (12%) or had no preference (12%). Although total work was similar for males and females, the TRIOS quotient indicated that male students tended to use their time more efficiently. In this study, dental students with no clinical experience were very capable of acquiring digital tools, indicating that digital impression techniques can be included early in the dental curriculum to help them catch up with ongoing development in computer-assisted technologies used in oral rehabilitation.

  19. A secure cyclic steganographic technique for color images using randomization

    International Nuclear Information System (INIS)

    Muhammad, K.; Ahmad, J.; Rehman, N.U.

    2014-01-01

    Information Security is a major concern in today's modern era. Almost all the communicating bodies want the security, confidentiality and integrity of their personal data. But this security goal cannot be achieved easily when we are using an open network like internet. Steganography provides one of the best solutions to this problem. This paper represents a new Cyclic Steganographic Technique (CST) based on Least Significant Bit (LSB) for true color (RGB) images. The proposed method hides the secret data in the LSBs of cover image pixels in a randomized cyclic manner. The proposed technique is evaluated using both subjective and objective analysis using histograms changeability, Peak Signal-to-Noise Ratio (PSNR) and Mean Square Error (MSE). Experimentally it is found that the proposed method gives promising results in terms of security, imperceptibility and robustness as compared to some existent methods and vindicates this new algorithm. (author)

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

    Science.gov (United States)

    Bosch, Holger; Steinkamp, Fiona; Boller, Emil

    2006-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Bilan Stepan

    2017-01-01

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

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

    Science.gov (United States)

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

    2009-08-01

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

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

    Science.gov (United States)

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

    2017-02-01

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

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

    Science.gov (United States)

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

    2011-08-01

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

  5. Kombinasi RSA-CRT dengan Random LSB untuk Keamanan Data di Kanwil Kementerian Agama Prov. Sumatera Utara

    Directory of Open Access Journals (Sweden)

    Niti Ravika Nasution

    2017-04-01

    Full Text Available In this study the authors use Cryptographic Algorithms Rivest Shamir Adleman Chinese Remainder Theorem (RSA-CRT and steganography technique Random Least Significant Bits (LSB. RSA-CRT is basically the same as usual, but utilizing RSA CRT theorem to shorten the bit size decryption exponent d by hiding d on congruent systems that accelerate time decryption, the difference in the key generation process and the decryption process. Cryptographic algorithm RSA-CRT produce ciphertext stored into a picture (image using Steganography technique Random Least Significant Bits (LSB. The workings of Random LSB is storing the message (ciphertext in the first bit or the second bit random key for use random number generator Pseudo Random Number Generator (PRNG with Linear Congruential Generator (LCG method. Ciphertext stored in a picture  (image has extracted key re-use random number generator at the time of inserting the message. Then the ciphertext is decrypted back by the algorithm RSA-CRT to produce the original text (plaintext. Merging Cryptographic Algorithm RSA-CRT with Steganography Technique Simple  LSB than with Random LSB generate higher PSNR and MSE is lower, which means better level of data security and more resistant to attack. Has more difficult to find a secret message by cryptanalysis and steganalyst.

  6. Effects of Number of Repetitions and Number of Hours of Shaping Practice during Constraint-Induced Movement Therapy: A Randomized Controlled Trial

    Directory of Open Access Journals (Sweden)

    Auwal Abdullahi

    2018-01-01

    Full Text Available Background. Constraint-induced movement therapy (CIMT is effective in improving motor outcomes after stroke. However, its existing protocols are resource-intensive and difficult to implement. The aim of this study is to design an easier CIMT protocol using number of repetitions of shaping practice. Method. The study design was randomized controlled trial. Participants within 4 weeks after stroke were recruited at Murtala Muhammad Specialist Hospital. They were randomly assigned to groups A, B, C, and D. Group A received 3 hours of traditional therapy. Groups B, C, and D received modified CIMT consisting of 3 hours of shaping practice per session, 300 repetitions of shaping practice in 3 sessions, and 600 repetitions of shaping practice in 3 sessions per day, respectively, and constraint for 90% of the waking hours. All treatment protocols were administered 5 times per week for 4 weeks. The primary outcome was measured using upper limb Fugl-Meyer assessment, while the secondary outcome was measured using motor activity log, Wolf Motor Function Test, and upper limb self-efficacy test at baseline, 2 weeks, and 4 weeks after intervention. Result. There were 48 participants 4 weeks after intervention. The result showed that there was no significant difference between groups at baseline (p>0.05. Within-group improvements attained minimal clinically important difference (MCID in modified CIMT and 300 repetitions and 600 repetitions groups. Conclusion. Number of repetitions of shaping practice significantly improved motor function, real-world arm use, and upper limb self-efficacy after stroke. Therefore, it seems to be a simple alternative for the use of number of hours. Trial Registration. This trial is registered with Pan African Clinical Trial Registry (registration number: PACTR201610001828172 (date of registration: 21/10/2016.

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

    Science.gov (United States)

    Sen, S. K.; Shaykhian, Gholam Ali

    2007-01-01

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

  8. Law of large numbers and central limit theorem for randomly forced PDE's

    CERN Document Server

    Shirikyan, A

    2004-01-01

    We consider a class of dissipative PDE's perturbed by an external random force. Under the condition that the distribution of perturbation is sufficiently non-degenerate, a strong law of large numbers (SLLN) and a central limit theorem (CLT) for solutions are established and the corresponding rates of convergence are estimated. It is also shown that the estimates obtained are close to being optimal. The proofs are based on the property of exponential mixing for the problem in question and some abstract SLLN and CLT for mixing-type Markov processes.

  9. Reduction of the number of parameters needed for a polynomial random regression test-day model

    NARCIS (Netherlands)

    Pool, M.H.; Meuwissen, T.H.E.

    2000-01-01

    Legendre polynomials were used to describe the (co)variance matrix within a random regression test day model. The goodness of fit depended on the polynomial order of fit, i.e., number of parameters to be estimated per animal but is limited by computing capacity. Two aspects: incomplete lactation

  10. The distribution of the number of node neighbors in random hypergraphs

    International Nuclear Information System (INIS)

    López, Eduardo

    2013-01-01

    Hypergraphs, the generalization of graphs in which edges become conglomerates of r nodes called hyperedges of rank r ⩾ 2, are excellent models to study systems with interactions that are beyond the pairwise level. For hypergraphs, the node degree ℓ (number of hyperedges connected to a node) and the number of neighbors k of a node differ from each other in contrast to the case of graphs, where counting the number of edges is equivalent to counting the number of neighbors. In this paper, I calculate the distribution of the number of node neighbors in random hypergraphs in which hyperedges of uniform rank r have a homogeneous (equal for all hyperedges) probability p to appear. This distribution is equivalent to the degree distribution of ensembles of graphs created as projections of hypergraph or bipartite network ensembles, where the projection connects any two nodes in the projected graph when they are also connected in the hypergraph or bipartite network. The calculation is non-trivial due to the possibility that neighbor nodes belong simultaneously to multiple hyperedges (node overlaps). From the exact results, the traditional asymptotic approximation to the distribution in the sparse regime (small p) where overlaps are ignored is rederived and improved; the approximation exhibits Poisson-like behavior accompanied by strong fluctuations modulated by power-law decays in the system size N with decay exponents equal to the minimum number of overlapping nodes possible for a given number of neighbors. It is shown that the dense limit cannot be explained if overlaps are ignored, and the correct asymptotic distribution is provided. The neighbor distribution requires the calculation of a new combinatorial coefficient Q r−1 (k, ℓ), which counts the number of distinct labeled hypergraphs of k nodes, ℓ hyperedges of rank r − 1, and where every node is connected to at least one hyperedge. Some identities of Q r−1 (k, ℓ) are derived and applied to the

  11. IMAGE SEGMENTATION BASED ON MARKOV RANDOM FIELD AND WATERSHED TECHNIQUES

    Institute of Scientific and Technical Information of China (English)

    纳瑟; 刘重庆

    2002-01-01

    This paper presented a method that incorporates Markov Random Field(MRF), watershed segmentation and merging techniques for performing image segmentation and edge detection tasks. MRF is used to obtain an initial estimate of x regions in the image under process where in MRF model, gray level x, at pixel location i, in an image X, depends on the gray levels of neighboring pixels. The process needs an initial segmented result. An initial segmentation is got based on K-means clustering technique and the minimum distance, then the region process in modeled by MRF to obtain an image contains different intensity regions. Starting from this we calculate the gradient values of that image and then employ a watershed technique. When using MRF method it obtains an image that has different intensity regions and has all the edge and region information, then it improves the segmentation result by superimpose closed and an accurate boundary of each region using watershed algorithm. After all pixels of the segmented regions have been processed, a map of primitive region with edges is generated. Finally, a merge process based on averaged mean values is employed. The final segmentation and edge detection result is one closed boundary per actual region in the image.

  12. Efficacy and complications associated with a modified inferior alveolar nerve block technique. A randomized, triple-blind clinical trial.

    Science.gov (United States)

    Montserrat-Bosch, Marta; Figueiredo, Rui; Nogueira-Magalhães, Pedro; Arnabat-Dominguez, Josep; Valmaseda-Castellón, Eduard; Gay-Escoda, Cosme

    2014-07-01

    To compare the efficacy and complication rates of two different techniques for inferior alveolar nerve blocks (IANB). A randomized, triple-blind clinical trial comprising 109 patients who required lower third molar removal was performed. In the control group, all patients received an IANB using the conventional Halsted technique, whereas in the experimental group, a modified technique using a more inferior injection point was performed. A total of 100 patients were randomized. The modified technique group showed a significantly higher onset time in the lower lip and chin area, and was frequently associated to a lingual electric discharge sensation. Three failures were recorded, 2 of them in the experimental group. No relevant local or systemic complications were registered. Both IANB techniques used in this trial are suitable for lower third molar removal. However, performing an inferior alveolar nerve block in a more inferior position (modified technique) extends the onset time, does not seem to reduce the risk of intravascular injections and might increase the risk of lingual nerve injuries.

  13. A homodyne detector integrated onto a photonic chip for measuring quantum states and generating random numbers

    Science.gov (United States)

    Raffaelli, Francesco; Ferranti, Giacomo; Mahler, Dylan H.; Sibson, Philip; Kennard, Jake E.; Santamato, Alberto; Sinclair, Gary; Bonneau, Damien; Thompson, Mark G.; Matthews, Jonathan C. F.

    2018-04-01

    Optical homodyne detection has found use as a characterisation tool in a range of quantum technologies. So far implementations have been limited to bulk optics. Here we present the optical integration of a homodyne detector onto a silicon photonics chip. The resulting device operates at high speed, up 150 MHz, it is compact and it operates with low noise, quantified with 11 dB clearance between shot noise and electronic noise. We perform on-chip quantum tomography of coherent states with the detector and show that it meets the requirements for characterising more general quantum states of light. We also show that the detector is able to produce quantum random numbers at a rate of 1.2 Gbps, by measuring the vacuum state of the electromagnetic field and applying off-line post processing. The produced random numbers pass all the statistical tests provided by the NIST test suite.

  14. Comparison of different anesthesia techniques during esophagogastroduedenoscopy in children: a randomized trial.

    Science.gov (United States)

    Patino, Mario; Glynn, Susan; Soberano, Mark; Putnam, Philip; Hossain, Md Monir; Hoffmann, Clifford; Samuels, Paul; Kibelbek, Michael J; Gunter, Joel

    2015-10-01

    Esophagogastroduedenoscopy (EGD) in children is usually performed under general anesthesia. Anesthetic goals include minimization of airway complications while maximizing operating room (OR) efficiency. Currently, there is no consensus on which anesthetic technique best meets these goals. We performed a prospective randomized study comparing three different anesthetic techniques. To evaluate the incidence of respiratory complications (primary aim) and institutional efficiency (secondary aim) among three different anesthetic techniques in children undergoing EGD. Subjects received a standardized inhalation induction of anesthesia followed by randomization to one of the three groups: Group intubated, sevoflurane (IS), Group intubated, propofol (IP), and Group native airway, nonintubated, propofol (NA). Respiratory complications included minor desaturation (SpO2 between 94% and 85%), severe desaturation (SpO2 < 85%), apnea, airway obstruction/laryngospasm, aspiration, and/or inadequate anesthesia during the endoscopy. Evaluation of institutional efficiency was determined by examining the time spent during the different phases of care (anesthesia preparation, procedure, OR stay, recovery, and total perioperative care). One hundred and seventy-nine children aged 1-12 years (median 7 years; 4.0, 10.0) were enrolled (Group IS N = 60, Group IP N = 59, Group NA N = 61). The incidence of respiratory complications was higher in the Group NA (0.459) vs Group IS (0.033) or Group IP (0.086) (P < 0.0001). The most commonly observed complications were desaturation, inadequate anesthesia, and apnea. There were no differences in institutional efficiency among the three groups. Respiratory complications were more common in Group NA. The use of native airway with propofol maintenance during EGD does not offer advantages with respect to respiratory complications or institutional efficiency. © 2015 John Wiley & Sons Ltd.

  15. On the strong law of large numbers for $\\varphi$-subgaussian random variables

    OpenAIRE

    Zajkowski, Krzysztof

    2016-01-01

    For $p\\ge 1$ let $\\varphi_p(x)=x^2/2$ if $|x|\\le 1$ and $\\varphi_p(x)=1/p|x|^p-1/p+1/2$ if $|x|>1$. For a random variable $\\xi$ let $\\tau_{\\varphi_p}(\\xi)$ denote $\\inf\\{a\\ge 0:\\;\\forall_{\\lambda\\in\\mathbb{R}}\\; \\ln\\mathbb{E}\\exp(\\lambda\\xi)\\le\\varphi_p(a\\lambda)\\}$; $\\tau_{\\varphi_p}$ is a norm in a space $Sub_{\\varphi_p}=\\{\\xi:\\;\\tau_{\\varphi_p}(\\xi)1$) there exist positive constants $c$ and $\\alpha$ such that for every natural number $n$ the following inequality $\\tau_{\\varphi_p}(\\sum_{i=1...

  16. Analysis of random point images with the use of symbolic computation codes and generalized Catalan numbers

    Science.gov (United States)

    Reznik, A. L.; Tuzikov, A. V.; Solov'ev, A. A.; Torgov, A. V.

    2016-11-01

    Original codes and combinatorial-geometrical computational schemes are presented, which are developed and applied for finding exact analytical formulas that describe the probability of errorless readout of random point images recorded by a scanning aperture with a limited number of threshold levels. Combinatorial problems encountered in the course of the study and associated with the new generalization of Catalan numbers are formulated and solved. An attempt is made to find the explicit analytical form of these numbers, which is, on the one hand, a necessary stage of solving the basic research problem and, on the other hand, an independent self-consistent problem.

  17. FPRandom: Randomizing core browser objects to break advanced device fingerprinting techniques

    OpenAIRE

    Laperdrix , Pierre; Baudry , Benoit; Mishra , Vikas

    2017-01-01

    International audience; The rich programming interfaces (APIs) provided by web browsers can be diverted to collect a browser fingerprint. A small number of queries on these interfaces are sufficient to build a fingerprint that is statistically unique and very stable over time. Consequently, the fingerprint can be used to track users. Our work aims at mitigating the risk of browser fingerprinting for users privacy by 'breaking' the stability of a fingerprint over time. We add randomness in the...

  18. RANDOMNESS of Numbers DEFINITION(QUERY:WHAT? V HOW?) ONLY Via MAXWELL-BOLTZMANN CLASSICAL-Statistics(MBCS) Hot-Plasma VS. Digits-Clumping Log-Law NON-Randomness Inversion ONLY BOSE-EINSTEIN QUANTUM-Statistics(BEQS) .

    Science.gov (United States)

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

  19. Effectiveness of a Treatment Involving Soft Tissue Techniques and/or Neural Mobilization Techniques in the Management of Tension-Type Headache: A Randomized Controlled Trial.

    Science.gov (United States)

    Ferragut-Garcías, Alejandro; Plaza-Manzano, Gustavo; Rodríguez-Blanco, Cleofás; Velasco-Roldán, Olga; Pecos-Martín, Daniel; Oliva-Pascual-Vaca, Jesús; Llabrés-Bennasar, Bartomeu; Oliva-Pascual-Vaca, Ángel

    2017-02-01

    To evaluate the effects of a protocol involving soft tissue techniques and/or neural mobilization techniques in the management of patients with frequent episodic tension-type headache (FETTH) and those with chronic tension-type headache (CTTH). Randomized, double-blind, placebo-controlled before and after trial. Rehabilitation area of the local hospital and a private physiotherapy center. Patients (N=97; 78 women, 19 men) diagnosed with FETTH or CTTH were randomly assigned to groups A, B, C, or D. (A) Placebo superficial massage; (B) soft tissue techniques; (C) neural mobilization techniques; (D) a combination of soft tissue and neural mobilization techniques. The pressure pain threshold (PPT) in the temporal muscles (points 1 and 2) and supraorbital region (point 3), the frequency and maximal intensity of pain crisis, and the score in the Headache Impact Test-6 (HIT-6) were evaluated. All variables were assessed before the intervention, at the end of the intervention, and 15 and 30 days after the intervention. Groups B, C, and D had an increase in PPT and a reduction in frequency, maximal intensity, and HIT-6 values in all time points after the intervention as compared with baseline and group A (P<.001 for all cases). Group D had the highest PPT values and the lowest frequency and HIT-6 values after the intervention. The application of soft tissue and neural mobilization techniques to patients with FETTH or CTTH induces significant changes in PPT, the characteristics of pain crisis, and its effect on activities of daily living as compared with the application of these techniques as isolated interventions. Copyright © 2016 American Congress of Rehabilitation Medicine. Published by Elsevier Inc. All rights reserved.

  20. Approximation of Quantities of Interest in Stochastic PDEs by the Random Discrete L^2 Projection on Polynomial Spaces

    KAUST Repository

    Migliorati, G.

    2013-05-30

    In this work we consider the random discrete L^2 projection on polynomial spaces (hereafter RDP) for the approximation of scalar quantities of interest (QOIs) related to the solution of a partial differential equation model with random input parameters. In the RDP technique the QOI is first computed for independent samples of the random input parameters, as in a standard Monte Carlo approach, and then the QOI is approximated by a multivariate polynomial function of the input parameters using a discrete least squares approach. We consider several examples including the Darcy equations with random permeability, the linear elasticity equations with random elastic coefficient, and the Navier--Stokes equations in random geometries and with random fluid viscosity. We show that the RDP technique is well suited to QOIs that depend smoothly on a moderate number of random parameters. Our numerical tests confirm the theoretical findings in [G. Migliorati, F. Nobile, E. von Schwerin, and R. Tempone, Analysis of the Discrete $L^2$ Projection on Polynomial Spaces with Random Evaluations, MOX report 46-2011, Politecnico di Milano, Milano, Italy, submitted], which have shown that, in the case of a single uniformly distributed random parameter, the RDP technique is stable and optimally convergent if the number of sampling points is proportional to the square of the dimension of the polynomial space. Here optimality means that the weighted $L^2$ norm of the RDP error is bounded from above by the best $L^\\\\infty$ error achievable in the given polynomial space, up to logarithmic factors. In the case of several random input parameters, the numerical evidence indicates that the condition on quadratic growth of the number of sampling points could be relaxed to a linear growth and still achieve stable and optimal convergence. This makes the RDP technique very promising for moderately high dimensional uncertainty quantification.

  1. Techniques of lumbar-sacral spine fusion in spondylosis: systematic literature review and meta-analysis of randomized clinical trials.

    Science.gov (United States)

    Umeta, Ricardo S G; Avanzi, Osmar

    2011-07-01

    Spine fusions can be performed through different techniques and are used to treat a number of vertebral pathologies. However, there seems to be no consensus regarding which technique of fusion is best suited to treat each distinct spinal disease or group of diseases. To study the effectiveness and complications of the different techniques used for spinal fusion in patients with lumbar spondylosis. Systematic literature review and meta-analysis. Randomized clinical studies comparing the most commonly performed surgical techniques for spine fusion in lumbar-sacral spondylosis, as well as those reporting patient outcome were selected. Identify which technique, if any, presents the best clinical, functional, and radiographic outcome. Systematic literature review and meta-analysis based on scientific articles published and indexed to the following databases: PubMed (1966-2009), Cochrane Collaboration-CENTRAL, EMBASE (1980-2009), and LILACS (1982-2009). The general search strategy focused on the surgical treatment of patients with lumbar-sacral spondylosis. Eight studies met the inclusion criteria and were selected with a total of 1,136 patients. Meta-analysis showed that patients who underwent interbody fusion presented a significantly smaller blood loss (p=.001) and a greater rate of bone fusion (p=.02). Patients submitted to fusion using the posterolateral approach had a significantly shorter operative time (p=.007) and less perioperative complications (p=.03). No statistically significant difference was found for the other studied variables (pain, functional impairment, and return to work). The most commonly used techniques for lumbar spine fusion in patients with spondylosis were interbody fusion and posterolateral approach. Both techniques were comparable in final outcome, but the former presented better rates of fusion and the latter the less complications. Copyright © 2011 Elsevier Inc. All rights reserved.

  2. Machine-learning techniques for family demography: an application of random forests to the analysis of divorce determinants in Germany

    OpenAIRE

    Arpino, Bruno; Le Moglie, Marco; Mencarini, Letizia

    2018-01-01

    Demographers often analyze the determinants of life-course events with parametric regression-type approaches. Here, we present a class of nonparametric approaches, broadly defined as machine learning (ML) techniques, and discuss advantages and disadvantages of a popular type known as random forest. We argue that random forests can be useful either as a substitute, or a complement, to more standard parametric regression modeling. Our discussion of random forests is intuitive and...

  3. Effects of pushing techniques in birth on mother and fetus: a randomized study.

    Science.gov (United States)

    Yildirim, Gulay; Beji, Nezihe Kizilkaya

    2008-03-01

    The Valsalva pushing technique is used routinely in the second stage of labor in many countries, and it is accepted as standard obstetric management in Turkey. The purpose of this study was to determine the effects of pushing techniques on mother and fetus in birth in this setting. This randomized study was conducted between July 2003 and June 2004 in Bakirkoy Maternity and Children's Teaching Hospital in Istanbul, Turkey. One hundred low-risk primiparas between 38 and 42 weeks' gestation, who expected a spontaneous vaginal delivery, were randomized to either a spontaneous pushing group or a Valsalva-type pushing group. Spontaneous pushing women were informed during the first stage of labor about spontaneous pushing technique (open glottis pushing while breathing out) and were supported in pushing spontaneously in the second stage of labor. Similarly, Valsalva pushing women were informed during the first stage of labor about the Valsalva pushing technique (closed glottis pushing while holding their breath) and were supported in using Valsalva pushing in the second stage of labor. Perineal tears, postpartum hemorrhage, and hemoglobin levels were evaluated in mothers; and umbilical artery pH, Po(2) (mmHg), and Pco(2) (mmHg) levels and Apgar scores at 1 and 5 minutes were evaluated in newborns in both groups. No significant differences were found between the two groups in their demographics, incidence of nonreassuring fetal surveillance patterns, or use of oxytocin. The second stage of labor and duration of the expulsion phase were significantly longer with Valsalva-type pushing. Differences in the incidence of episiotomy, perineal tears, or postpartum hemorrhage were not significant between the groups. The baby fared better with spontaneous pushing, with higher 1- and 5-minute Apgar scores, and higher umbilical cord pH and Po(2) levels. After the birth, women expressed greater satisfaction with spontaneous pushing. Educating women about the spontaneous pushing

  4. A Comparative Analysis of Techniques for PAPR Reduction of OFDM Signals

    Directory of Open Access Journals (Sweden)

    M. Janjić

    2014-06-01

    Full Text Available In this paper the problem of high Peak-to-Average Power Ratio (PAPR in Orthogonal Frequency-Division Multiplexing (OFDM signals is studied. Besides describing three techniques for PAPR reduction, SeLective Mapping (SLM, Partial Transmit Sequence (PTS and Interleaving, a detailed analysis of the performances of these techniques for various values of relevant parameters (number of phase sequences, number of interleavers, number of phase factors, number of subblocks depending on applied technique, is carried out. Simulation of these techniques is run in Matlab software. Results are presented in the form of Complementary Cumulative Distribution Function (CCDF curves for PAPR of 30000 randomly generated OFDM symbols. Simulations are performed for OFDM signals with 32 and 256 subcarriers, oversampled by a factor of 4. A detailed comparison of these techniques is made based on Matlab simulation results.

  5. Boosting the FM-Index on the GPU: Effective Techniques to Mitigate Random Memory Access.

    Science.gov (United States)

    Chacón, Alejandro; Marco-Sola, Santiago; Espinosa, Antonio; Ribeca, Paolo; Moure, Juan Carlos

    2015-01-01

    The recent advent of high-throughput sequencing machines producing big amounts of short reads has boosted the interest in efficient string searching techniques. As of today, many mainstream sequence alignment software tools rely on a special data structure, called the FM-index, which allows for fast exact searches in large genomic references. However, such searches translate into a pseudo-random memory access pattern, thus making memory access the limiting factor of all computation-efficient implementations, both on CPUs and GPUs. Here, we show that several strategies can be put in place to remove the memory bottleneck on the GPU: more compact indexes can be implemented by having more threads work cooperatively on larger memory blocks, and a k-step FM-index can be used to further reduce the number of memory accesses. The combination of those and other optimisations yields an implementation that is able to process about two Gbases of queries per second on our test platform, being about 8 × faster than a comparable multi-core CPU version, and about 3 × to 5 × faster than the FM-index implementation on the GPU provided by the recently announced Nvidia NVBIO bioinformatics library.

  6. Comparison of the efficacy of two anesthetic techniques of mandibular primary first molar: A randomized clinical trial

    Directory of Open Access Journals (Sweden)

    Davood Ghasemi Tudeshchoie

    2013-01-01

    Full Text Available Background: The most common technique to anesthetize mandibular primary teeth is inferior alveolar (I.A nerve block injection which induces a relatively sustained anesthesia and in turn may potentially traumatize soft-tissues. Therefore, the need of having an alternative technique of anesthesia with a shorter term but the same efficacy is reasonable. The aim of this study was a comparison of the efficacy of two anesthetic techniques of mandibular primary first molar. Materials and Methods: In this randomized crossover clinical trial, 40 children with ages ranged from 5 years to 8 years whose mandibular primary first molars were eligible for pulpotomy, were selected and divided randomly into two groups. The right and left mandibular first molars of group A were anesthetized with infiltration and I. A nerve block techniques in the first and second sessions respectively. The left and right mandibular first molars of group B were anesthetized with I.A nerve block and infiltration techniques in the first and second sessions respectively. The severity of pain were measured and recorded according to sound-eye-motor scale by a certain person. Data was analyzed using Wilcoxon Signed Rank and Mann-Whitney U tests (P < 0.05. Results: The severity of pain was lower in infiltration technique versus I.A nerve block. There were no significant differences between the severities of pain on pulpal exposure of two techniques. Conclusion: It seems that infiltration technique is more favorable to anesthetize the mandibular primary first molar compared to I.A nerve block.

  7. A smart rotary technique versus conventional pulpectomy for primary teeth: A randomized controlled clinical study.

    Science.gov (United States)

    Mokhtari, Negar; Shirazi, Alireza-Sarraf; Ebrahimi, Masoumeh

    2017-11-01

    Techniques with adequate accuracy of working length determination along with shorter duration of treatment in pulpectomy procedure seems to be essential in pediatric dentistry. The aim of the present study was to evaluate the accuracy of root canal length measurement with Root ZX II apex locator and rotary system in pulpectomy of primary teeth. In this randomized control clinical trial complete pulpectomy was performed on 80 mandibular primary molars in 80, 4-6-year-old children. The study population was randomly divided into case and control groups. In control group conventional pulpectomy was performed and in the case group working length was determined by electronic apex locator Root ZXII and instrumented with Mtwo rotary files. Statistical evaluation was performed using Mann-Whitney and Chi-Square tests ( P <0.05). There were no significant differences between electronic apex locator Root ZXII and conventional method in accuracy of root canal length determination. However significantly less time was needed for instrumenting with rotary files ( P =0.000). Considering the comparable results in accuracy of root canal length determination and the considerably shorter instrumentation time in Root ZXII apex locator and rotary system, it may be suggested for pulpectomy in primary molar teeth. Key words: Rotary technique, conventional technique, pulpectomy, primary teeth.

  8. Effect of joint mobilization techniques for primary total knee arthroplasty: Study protocol for a randomized controlled trial.

    Science.gov (United States)

    Xu, Jiao; Zhang, Juan; Wang, Xue-Qiang; Wang, Xuan-Lin; Wu, Ya; Chen, Chan-Cheng; Zhang, Han-Yu; Zhang, Zhi-Wan; Fan, Kai-Yi; Zhu, Qiang; Deng, Zhi-Wei

    2017-12-01

    Total knee arthroplasty (TKA) has become the most preferred procedure by patients for the relief of pain caused by knee osteoarthritis. TKA patients aim a speedy recovery after the surgery. Joint mobilization techniques for rehabilitation have been widely used to relieve pain and improve joint mobility. However, relevant randomized controlled trials showing the curative effect of these techniques remain lacking to date. Accordingly, this study aims to investigate whether joint mobilization techniques are valid for primary TKA. We will manage a single-blind, prospective, randomized, controlled trial of 120 patients with unilateral TKA. Patients will be randomized into an intervention group, a physical modality therapy group, and a usual care group. The intervention group will undergo joint mobilization manipulation treatment once a day and regular training twice a day for a month. The physical modality therapy group will undergo physical therapy once a day and regular training twice a day for a month. The usual care group will perform regular training twice a day for a month. Primary outcome measures will be based on the visual analog scale, the knee joint Hospital for Special Surgery score, range of motion, surrounded degree, and adverse effect. Secondary indicators will include manual muscle testing, 36-Item Short Form Health Survey, Berg Balance Scale function evaluation, Pittsburgh Sleep Quality Index, proprioception, and muscle morphology. We will direct intention-to-treat analysis if a subject withdraws from the trial. The important features of this trial for joint mobilization techniques in primary TKA are randomization procedures, single-blind, large sample size, and standardized protocol. This study aims to investigate whether joint mobilization techniques are effective for early TKA patients. The result of this study may serve as a guide for TKA patients, medical personnel, and healthcare decision makers. It has been registered at http

  9. Effects of a modified technique for TVT-O positioning on postoperative pain: single-blind randomized study.

    Science.gov (United States)

    Tommaselli, Giovanni A; Formisano, Carmen; Di Carlo, Costantino; Fabozzi, Annamaria; Nappi, Carmine

    2012-09-01

    One of the most frequent and distressing complications of the tension-free vaginal tape obturator (TVT-O) procedure for stress urinary incontinence (SUI) is groin pain, which may be related to the surgical technique or to the tape. The aim of this study was to evaluate the impact of a more limited dissection and a more medial trocar trajectory in TVT-O positioning on postoperative pain. Seventy-two SUI patients were randomized to undergo TVT-O either with the traditional technique (group A) or a modified procedure (reduced paraurethral dissection and a more medial trocar trajectory) (group B). Visual analog scale pain scores 12 h, 24 h, and 1 month after the procedure, number of analgesic vials, objective cure rate, and patient functional and quality of life scores 6 months after the procedure were evaluated. Data were analyzed by the Student's t test for parametric variables, the Mann-Whitney U and Wilcoxon tests for nonparametric variables, and Fisher's exact test for categorical variables. Pain scores were significantly lower in group B compared with group A 24 h after surgery (P = 0.01). Pain scores significantly decreased from 12-24 h postoperatively to 1 month follow-up in both groups (P TVT-O seem to reduce postoperative groin pain at 24 h after the procedure, but not the analgesic requirement.

  10. Random number generation as an index of controlled processing.

    Science.gov (United States)

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

    2006-07-01

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

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

    Science.gov (United States)

    Lawnik, Marcin

    2018-01-01

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

  12. Peyton's four-step approach for teaching complex spinal manipulation techniques - a prospective randomized trial.

    Science.gov (United States)

    Gradl-Dietsch, Gertraud; Lübke, Cavan; Horst, Klemens; Simon, Melanie; Modabber, Ali; Sönmez, Tolga T; Münker, Ralf; Nebelung, Sven; Knobe, Matthias

    2016-11-03

    The objectives of this prospective randomized trial were to assess the impact of Peyton's four-step approach on the acquisition of complex psychomotor skills and to examine the influence of gender on learning outcomes. We randomly assigned 95 third to fifth year medical students to an intervention group which received instructions according to Peyton (PG) or a control group, which received conventional teaching (CG). Both groups attended four sessions on the principles of manual therapy and specific manipulative and diagnostic techniques for the spine. We assessed differences in theoretical knowledge (multiple choice (MC) exam) and practical skills (Objective Structured Practical Examination (OSPE)) with respect to type of intervention and gender. Participants took a second OSPE 6 months after completion of the course. There were no differences between groups with respect to the MC exam. Students in the PG group scored significantly higher in the OSPE. Gender had no additional impact. Results of the second OSPE showed a significant decline in competency regardless of gender and type of intervention. Peyton's approach is superior to standard instruction for teaching complex spinal manipulation skills regardless of gender. Skills retention was equally low for both techniques.

  13. Comparison of analgesic efficacy of levobupivacaine, levobupivacaine and clonidine, and levobupivacaine and dexmedetomidine in wound infiltration technique for abdominal surgeries: A prospective randomized controlled study

    Directory of Open Access Journals (Sweden)

    B Jyothi

    2017-01-01

    Full Text Available Background: This study was designed to evaluate the postoperative analgesic efficacy of levobupivacaine (L alone and its combination with clonidine (C or dexmedetomidine (D in wound infiltration technique for abdominal surgeries. Materials and Methods: After ethical committee approval, a double-blind randomized controlled study was conducted on 90 patients (power of study 80%, physical status American Society of Anesthesiologists Grade I and II, aged 18–60 years scheduled for abdominal surgeries over 1 year duration. A standard general anesthetic technique was used. Patients were randomly allocated into three groups, by computer-generated random number table. Patients received wound infiltration during wound closure. Group L received 29 ml of 0.25% levobupivacaine plus 1 ml 0.9% normal saline, Group LC received 29 ml of 0.25% levobupivacaine with 1 ml (3 mcg/kg clonidine, and Group LD received 29 ml of 0.25% levobupivacaine with 1 ml (2 mcg/kg dexmedetomidine. Postoperative rescue analgesia was provided with injection tramadol. Statistical analysis for duration of analgesia was determined by one-way analysis of variance and side effects by Chi-square test. Results: The total duration of analgesia in LD group was 23.4 h, when compared to LC group 20.9 h and L group 11.65 h (P = 0.0001 with excellent to good quality of analgesia in adjuvant group (P < 0.001 and incidence of minimal side effects such as sedation, nausea, and vomiting. Conclusion: Clonidine and dexmedetomidine were the effective adjuvants to levobupivacaine for single shot wound infiltration analgesic technique; however, dexmedetomidine was found to be superior to clonidine.

  14. Randomized clinical trial comparing control of maxillary anchorage with 2 retraction techniques.

    Science.gov (United States)

    Xu, Tian-Min; Zhang, Xiaoyun; Oh, Hee Soo; Boyd, Robert L; Korn, Edward L; Baumrind, Sheldon

    2010-11-01

    The objective of this pilot randomized clinical trial was to investigate the relative effectiveness of anchorage conservation of en-masse and 2-step retraction techniques during maximum anchorage treatment in patients with Angle Class I and Class II malocclusions. Sixty-four growing subjects (25 boys, 39 girls; 10.2-15.9 years old) who required maximum anchorage were randomized to 2 treatment techniques: en-masse retraction (n = 32) and 2-step retraction (n = 32); the groups were stratified by sex and starting age. Each patient was treated by a full-time clinic instructor experienced in the use of both retraction techniques at the orthodontic clinic of Peking University School of Stomatology in China. All patients used headgear, and most had transpalatal appliances. Lateral cephalograms taken before treatment and at the end of treatment were used to evaluate treatment-associated changes. Differences in maxillary molar mesial displacement and maxillary incisor retraction were measured with the before and after treatment tracings superimposed on the anatomic best fit of the palatal structures. Differences in mesial displacement of the maxillary first molar were compared between the 2 treatment techniques, between sexes, and between different starting-age groups. Average mesial displacement of the maxillary first molar was slightly less in the en-masse group than in the 2-step group (mean, -0.36 mm; 95% CI, -1.42 to 0.71 mm). The average mesial displacement of the maxillary first molar for both treatment groups pooled (n = 63, because 1 patient was lost to follow-up) was 4.3 ± 2.1 mm (mean ± standard deviation). Boys had significantly more mesial displacement than girls (mean difference, 1.3 mm; P <0.03). Younger adolescents had significantly more mesial displacement than older adolescents (mean difference, 1.3 mm; P <0.02). Average mesial displacement of the maxillary first molar with 2-step retraction was slightly greater than that for en-masse retraction, but the

  15. Using random matrix theory to determine the number of endmembers in a hyperspectral image

    CSIR Research Space (South Africa)

    Cawse, K

    2010-06-01

    Full Text Available apply our method to synthetic images, including a standard test image developed by Chein-I Chang, with good results for Gaussian independent noise. Index Terms— Hyperspectral Unmixing, Random Ma- trix Theory, Linear Mixture Model, Virtual Dimension... function, and K is the number of endmembers. We assume Gaussian noise following the methods of [1] [5]. The first step in unmixing the image is to determine how many endmembers or constituents are contained in the scene. This is known as the Virtual...

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

    Energy Technology Data Exchange (ETDEWEB)

    Coronel B, H.F.; Hernandez M, A.R.; Jimenez M, M.A. [Facultad de Fisica e Inteligencia Artificial, Universidad Veracruzana, A.P. 475, Xalapa, Veracruz (Mexico); Mora F, L.E. [CIMAT, A.P. 402, 36000 Guanajuato (Mexico)]. e-mail: hcoronel@uv.mx

    2007-07-01

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

  17. Effect of novel inhaler technique reminder labels on the retention of inhaler technique skills in asthma: a single-blind randomized controlled trial.

    Science.gov (United States)

    Basheti, Iman A; Obeidat, Nathir M; Reddel, Helen K

    2017-02-09

    Inhaler technique can be corrected with training, but skills drop off quickly without repeated training. The aim of our study was to explore the effect of novel inhaler technique labels on the retention of correct inhaler technique. In this single-blind randomized parallel-group active-controlled study, clinical pharmacists enrolled asthma patients using controller medication by Accuhaler [Diskus] or Turbuhaler. Inhaler technique was assessed using published checklists (score 0-9). Symptom control was assessed by asthma control test. Patients were randomized into active (ACCa; THa) and control (ACCc; THc) groups. All patients received a "Show-and-Tell" inhaler technique counseling service. Active patients also received inhaler labels highlighting their initial errors. Baseline data were available for 95 patients, 68% females, mean age 44.9 (SD 15.2) years. Mean inhaler scores were ACCa:5.3 ± 1.0; THa:4.7 ± 0.9, ACCc:5.5 ± 1.1; THc:4.2 ± 1.0. Asthma was poorly controlled (mean ACT scores ACCa:13.9 ± 4.3; THa:12.1 ± 3.9; ACCc:12.7 ± 3.3; THc:14.3 ± 3.7). After training, all patients had correct technique (score 9/9). After 3 months, there was significantly less decline in inhaler technique scores for active than control groups (mean difference: Accuhaler -1.04 (95% confidence interval -1.92, -0.16, P = 0.022); Turbuhaler -1.61 (-2.63, -0.59, P = 0.003). Symptom control improved significantly, with no significant difference between active and control patients, but active patients used less reliever medication (active 2.19 (SD 1.78) vs. control 3.42 (1.83) puffs/day, P = 0.002). After inhaler training, novel inhaler technique labels improve retention of correct inhaler technique skills with dry powder inhalers. Inhaler technique labels represent a simple, scalable intervention that has the potential to extend the benefit of inhaler training on asthma outcomes. REMINDER LABELS IMPROVE INHALER TECHNIQUE: Personalized

  18. Random-Access Technique for Self-Organization of 5G Millimeter-Wave Cellular Communications

    Directory of Open Access Journals (Sweden)

    Jasper Meynard Arana

    2016-01-01

    Full Text Available The random-access (RA technique is a key procedure in cellular networks and self-organizing networks (SONs, but the overall processing time of this technique in millimeter-wave (mm-wave cellular systems with directional beams is very long because RA preambles (RAPs should be transmitted in all directions of Tx and Rx beams. In this paper, two different types of preambles (RAP-1 and RAP-2 are proposed to reduce the processing time in the RA stage. After analyzing the correlation property, false-alarm probability, and detection probability of the proposed RAPs, we perform simulations to show that the RAP-2 is suitable for RA in mm-wave cellular systems with directional beams because of the smaller processing time and high detection probability in multiuser environments.

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

    Science.gov (United States)

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

    2018-05-01

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

  20. Generation of pseudo-random sequences for spread spectrum systems

    Science.gov (United States)

    Moser, R.; Stover, J.

    1985-05-01

    The characteristics of pseudo random radio signal sequences (PRS) are explored. The randomness of the PSR is a matter of artificially altering the sequence of binary digits broadcast. Autocorrelations of the two sequences shifted in time, if high, determine if the signals are the same and thus allow for position identification. Cross-correlation can also be calculated between sequences. Correlations closest to zero are obtained with large volume of prime numbers in the sequences. Techniques for selecting optimal and maximal lengths for the sequences are reviewed. If the correlations are near zero in the sequences, then signal channels can accommodate multiple users. Finally, Gold codes are discussed as a technique for maximizing the code lengths.

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

    Science.gov (United States)

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

    2016-01-01

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

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

    Science.gov (United States)

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

    2016-01-01

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

  3. New technique for number-plate recognition

    Science.gov (United States)

    Guo, Jie; Shi, Peng-Fei

    2001-09-01

    This paper presents an alternative algorithm for number plate recognition. The algorithm consists of three modules. Respectively, they are number plate location module, character segmentation module and character recognition module. Number plate location module extracts the number plate from the detected car image by analyzing the color and the texture properties. Different from most license plate location methods, the algorithm has fewer limits to the car size, the car position in the image and the image background. Character segmentation module applies connected region algorithm both to eliminate noise points and to segment characters. Touching characters and broken characters can be processed correctly. Character recognition module recognizes characters with HHIC (Hierarchical Hybrid Integrated Classifier). The system has been tested with 100 images obtained from crossroad and parking lot, etc, where the cars have different size, position, background and illumination. Successful recognition rate is about 92%. The average processing time is 1.2 second.

  4. Random number generators and the Metropolis algorithm: application to various problems in physics and mechanics as an introduction to computational physics

    International Nuclear Information System (INIS)

    Calvayrac, Florent

    2005-01-01

    We present known and new applications of pseudo random numbers and of the Metropolis algorithm to phenomena of physical and mechanical interest, such as the search of simple clusters isomers with interactive visualization, or vehicle motion planning. The progression towards complicated problems was used with first-year graduate students who wrote most of the programs presented here. We argue that the use of pseudo random numbers in simulation and extrema research programs in teaching numerical methods in physics allows one to get quick programs and physically meaningful and demonstrative results without recurring to the advanced numerical analysis methods

  5. A modified random decrement technique for modal identification from nonstationary ambient response data only

    International Nuclear Information System (INIS)

    Lin, Chang Sheng; Chiang, Dar Yun

    2012-01-01

    Modal identification is considered from response data of structural system under nonstationary ambient vibration. In a previous paper, we showed that by assuming the ambient excitation to be nonstationary white noise in the form of a product model, the nonstationary response signals can be converted into free-vibration data via the correlation technique. In the present paper, if the ambient excitation can be modeled as a nonstationary white noise in the form of a product model, then the nonstationary cross random decrement signatures of structural response evaluated at any fixed time instant are shown theoretically to be proportional to the nonstationary cross-correlation functions. The practical problem of insufficient data samples available for evaluating nonstationary random decrement signatures can be approximately resolved by first extracting the amplitude-modulating function from the response and then transforming the nonstationary responses into stationary ones. Modal-parameter identification can then be performed using the Ibrahim time-domain technique, which is effective at identifying closely spaced modes. The theory proposed can be further extended by using the filtering concept to cover the case of nonstationary color excitations. Numerical simulations confirm the validity of the proposed method for identification of modal parameters from nonstationary ambient response data

  6. Properties and simulation of α-permanental random fields

    DEFF Research Database (Denmark)

    Møller, Jesper; Rubak, Ege Holger

    An α-permanental random field is briefly speaking a model for a collection of random variables with positive associations, where α is a positive number and the probability generating function is given in terms of a covariance or more general function so that density and moment expressions are given...... by certain α-permanents. Though such models possess many appealing probabilistic properties, many statisticians seem unaware of  α-permanental random fields and their potential applications. The purpose of this paper is first to summarize useful probabilistic results using the simplest possible setting......, and second to study stochastic constructions and simulation techniques, which should provide a useful basis for discussing the statistical aspects in future work. The paper also discusses some examples of  α-permanental random fields....

  7. Community assessment techniques and the implications for rarefaction and extrapolation with Hill numbers.

    Science.gov (United States)

    Cox, Kieran D; Black, Morgan J; Filip, Natalia; Miller, Matthew R; Mohns, Kayla; Mortimor, James; Freitas, Thaise R; Greiter Loerzer, Raquel; Gerwing, Travis G; Juanes, Francis; Dudas, Sarah E

    2017-12-01

    Diversity estimates play a key role in ecological assessments. Species richness and abundance are commonly used to generate complex diversity indices that are dependent on the quality of these estimates. As such, there is a long-standing interest in the development of monitoring techniques, their ability to adequately assess species diversity, and the implications for generated indices. To determine the ability of substratum community assessment methods to capture species diversity, we evaluated four methods: photo quadrat, point intercept, random subsampling, and full quadrat assessments. Species density, abundance, richness, Shannon diversity, and Simpson diversity were then calculated for each method. We then conducted a method validation at a subset of locations to serve as an indication for how well each method captured the totality of the diversity present. Density, richness, Shannon diversity, and Simpson diversity estimates varied between methods, despite assessments occurring at the same locations, with photo quadrats detecting the lowest estimates and full quadrat assessments the highest. Abundance estimates were consistent among methods. Sample-based rarefaction and extrapolation curves indicated that differences between Hill numbers (richness, Shannon diversity, and Simpson diversity) were significant in the majority of cases, and coverage-based rarefaction and extrapolation curves confirmed that these dissimilarities were due to differences between the methods, not the sample completeness. Method validation highlighted the inability of the tested methods to capture the totality of the diversity present, while further supporting the notion of extrapolating abundances. Our results highlight the need for consistency across research methods, the advantages of utilizing multiple diversity indices, and potential concerns and considerations when comparing data from multiple sources.

  8. Comparison of Paravertebral Block by Anatomic Landmark Technique to Ultrasound-Guided Paravertebral Block for Breast Surgery Anesthesia: A Randomized Controlled Trial.

    Science.gov (United States)

    Patnaik, Rupali; Chhabra, Anjolie; Subramaniam, Rajeshwari; Arora, Mahesh K; Goswami, Devalina; Srivastava, Anurag; Seenu, Vuthaluru; Dhar, Anita

    2018-05-01

    Paravertebral block (PVB) is an established technique for providing anesthesia for breast surgery. The primary objective was to compare anatomical landmark technique (ALT) to the ultrasound-guided (USG) PVB block for providing surgical anesthesia. Secondary objectives included comparison of perioperative analgesia and complications. This randomized, controlled, observer-blinded study included 72 females, aged 18 to 65 years, American Society of Anesthesiologists physical status I or II, undergoing elective unilateral breast surgery. Study participants were randomized to the ALT group or USG group. Ipsilateral PVB was performed with the respective technique from T1 to T6. Five milliliters of local anesthetic mixture (0.5% ropivacaine, 5 μg/mL adrenaline, 1 μg/kg clonidine) was administered at each level. Paravertebral catheter was inserted at T4/T3 level. After confirming sensory loss, patients were taken up for surgery with propofol sedation (20-50 μg/kg per minute). More patients in the USG group (34/36 [94.44%]) had a successful block as compared with the ALT group (26/36 [72.22%]) (P = 0.024). Difference in proportion was 18.1 (95% confidence interval, 0.15-36.0) (P = 0.024) after adjustment for age. More dermatomes were blocked in the USG group (P = 0.0018) with less sparing of upper T2 and T3 dermatomes (P = 0.003, P = 0.006, respectively). Median time to first postoperative analgesic requirement was 502.5 minutes (range, 195-1440 minutes) in the USG group versus 377.5 minutes (range, 215-1440 minutes) in the ALT group. Pain at rest and movement 2 and 4 hours postoperatively and number of catheter top-ups in 24 hours postoperatively were lesser in the USG group (P = 0.012). Complications were comparable. Ultrasound-guided PVB provided better anesthesia and perioperative analgesia than the landmark technique for breast surgery. The trial was registered retrospectively at the Clinical Trial Registry of India, CTRI/2015/05/005774.

  9. Combined-stent covered technique and single covered stent technique for transjugular intrahepatic porto-systemic shunt: a prospective randomized controlled study

    International Nuclear Information System (INIS)

    Wang Changming; Li Xuan; Fu Jun; Lu Xianjun; Luan Jingyuan; Li Tianrun; Zhao Jun; Dong Guoxiang

    2014-01-01

    Objective: To compare the technique of combined stents with that of single stent-graft for the construction of transjugular intrahepatic porto-systemic shunt (TIPS) and to discuss their clinical outcomes. Methods: During the period from April 2011 to Dec. 2012, a total of 30 patients with upper gastrointestinal bleeding due to portal hypertension were admitted to the hospital. TIPS procedure was carried out in all the 30 patients. The patients were randomly allocated into either combined-stent group (n=17) or stent-graft group (control group, n=13) on the basis of a computer-generated randomization sequence. The PSC quality control, the patency rate of portal vein branches and the shunts, the incidence of encephalopathy and the survival rate of the two groups were documented and analyzed. Results: Technical success rate was 100%. After the treatment, in both groups the PSG became significantly lower than the PSG determined before the treatment (P<0.000). According to quality control chart, the of combined stents was superior to stent-graft technique in effectively controlling PSG. Five days after TIPS, the ammonia level in the combined- stent group was significantly decreased (P=0.029), while in the control group the ammonia level showed no significant changes (P=0.065). One patient died shortly after TIPS. The median follow- up time was 181 days. During the follow-up period death occurred in 3 cases in each group. The difference in the survival rate between the two groups was no significant (P=0.906). Of the three patients who developed encephalopathy, two were in the combined-stent group and one was in the control group. After medication the symptoms of encephalopathy were relieved. The patency rate of the shunts was 100% and the re-bleeding rate was 0% for both groups. The patency rate of portal vein branches was significantly higher in the combined-stent group than that in the control group (P=0.039). Conclusion: For the construction of TIPS, the technique of

  10. Do bacterial cell numbers follow a theoretical Poisson distribution? Comparison of experimentally obtained numbers of single cells with random number generation via computer simulation.

    Science.gov (United States)

    Koyama, Kento; Hokunan, Hidekazu; Hasegawa, Mayumi; Kawamura, Shuso; Koseki, Shigenobu

    2016-12-01

    We investigated a bacterial sample preparation procedure for single-cell studies. In the present study, we examined whether single bacterial cells obtained via 10-fold dilution followed a theoretical Poisson distribution. Four serotypes of Salmonella enterica, three serotypes of enterohaemorrhagic Escherichia coli and one serotype of Listeria monocytogenes were used as sample bacteria. An inoculum of each serotype was prepared via a 10-fold dilution series to obtain bacterial cell counts with mean values of one or two. To determine whether the experimentally obtained bacterial cell counts follow a theoretical Poisson distribution, a likelihood ratio test between the experimentally obtained cell counts and Poisson distribution which parameter estimated by maximum likelihood estimation (MLE) was conducted. The bacterial cell counts of each serotype sufficiently followed a Poisson distribution. Furthermore, to examine the validity of the parameters of Poisson distribution from experimentally obtained bacterial cell counts, we compared these with the parameters of a Poisson distribution that were estimated using random number generation via computer simulation. The Poisson distribution parameters experimentally obtained from bacterial cell counts were within the range of the parameters estimated using a computer simulation. These results demonstrate that the bacterial cell counts of each serotype obtained via 10-fold dilution followed a Poisson distribution. The fact that the frequency of bacterial cell counts follows a Poisson distribution at low number would be applied to some single-cell studies with a few bacterial cells. In particular, the procedure presented in this study enables us to develop an inactivation model at the single-cell level that can estimate the variability of survival bacterial numbers during the bacterial death process. Copyright © 2016 Elsevier Ltd. All rights reserved.

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

    International Nuclear Information System (INIS)

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

    2010-01-01

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

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

    Science.gov (United States)

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

    2010-03-01

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

  13. Random Forest as an Imputation Method for Education and Psychology Research: Its Impact on Item Fit and Difficulty of the Rasch Model

    Science.gov (United States)

    Golino, Hudson F.; Gomes, Cristiano M. A.

    2016-01-01

    This paper presents a non-parametric imputation technique, named random forest, from the machine learning field. The random forest procedure has two main tuning parameters: the number of trees grown in the prediction and the number of predictors used. Fifty experimental conditions were created in the imputation procedure, with different…

  14. Random sampling technique for ultra-fast computations of molecular opacities for exoplanet atmospheres

    Science.gov (United States)

    Min, M.

    2017-10-01

    Context. Opacities of molecules in exoplanet atmospheres rely on increasingly detailed line-lists for these molecules. The line lists available today contain for many species up to several billions of lines. Computation of the spectral line profile created by pressure and temperature broadening, the Voigt profile, of all of these lines is becoming a computational challenge. Aims: We aim to create a method to compute the Voigt profile in a way that automatically focusses the computation time into the strongest lines, while still maintaining the continuum contribution of the high number of weaker lines. Methods: Here, we outline a statistical line sampling technique that samples the Voigt profile quickly and with high accuracy. The number of samples is adjusted to the strength of the line and the local spectral line density. This automatically provides high accuracy line shapes for strong lines or lines that are spectrally isolated. The line sampling technique automatically preserves the integrated line opacity for all lines, thereby also providing the continuum opacity created by the large number of weak lines at very low computational cost. Results: The line sampling technique is tested for accuracy when computing line spectra and correlated-k tables. Extremely fast computations ( 3.5 × 105 lines per second per core on a standard current day desktop computer) with high accuracy (≤1% almost everywhere) are obtained. A detailed recipe on how to perform the computations is given.

  15. Root coverage with connective tissue graft associated with coronally advanced flap or tunnel technique: a randomized, double-blind, mono-centre clinical trial

    NARCIS (Netherlands)

    Azaripour, Adriano; Kissinger, Maren; Farina, Vittorio Siro Leone; van Noorden, Cornelis J. F.; Gerhold-Ay, Aslihan; Willershausen, Brita; Cortellini, Pierpaolo

    2016-01-01

    Aim: The aim of this randomized clinical trial was to compare the coronally advanced flap (CAF) with the modified microsurgical tunnel technique (MMTT) for treatment of Miller class I and II recessions. Material and Methods: Forty patients with 71 gingival recessions were recruited and randomly

  16. Evaluation of the Gow-Gates and Vazirani-Akinosi techniques in patients with symptomatic irreversible pulpitis: a prospective randomized study.

    Science.gov (United States)

    Click, Vivian; Drum, Melissa; Reader, Al; Nusstein, John; Beck, Mike

    2015-01-01

    Few studies have evaluated the effectiveness of the Gow-Gates and Vazirani-Akinosi techniques in patients presenting with symptomatic irreversible pulpitis. Therefore, the purpose of this prospective, randomized study was to evaluate the anesthetic efficacy of the Gow-Gates and Vazirani-Akinosi techniques using 3.6 mL 2% lidocaine with 1:100,000 epinephrine in mandibular posterior teeth in patients presenting with symptomatic irreversible pulpitis. One hundred twenty-five emergency patients diagnosed with symptomatic irreversible pulpitis randomly received either a Gow-Gates or Vazirani-Akinosi injection using 3.6 mL 2% lidocaine with 1:100,000 epinephrine to block the inferior alveolar nerve before endodontic access. Subjective lip numbness was recorded. Pulpal anesthetic success of the injection was defined as no pain or mild pain upon endodontic access and instrumentation as measured on a visual analog scale. Subjective lip numbness was obtained 92% of the time with the Gow-Gates technique and 63% of the time with the Vazirani-Akinosi technique. The difference was statistically significant (P = .0001). For the patients achieving lip numbness, successful pulpal anesthesia was obtained 35% of the time with the Gow-Gates technique and 16% of the time with the Vazirani-Akinosi technique. The difference was statistically significant (P = .0381). We concluded that for patients who achieved lip numbness neither the Gow-Gates technique nor the Vazirani-Akinosi technique provided adequate pulpal anesthesia for mandibular posterior teeth in patients presenting with symptomatic irreversible pulpitis. Both injections would require supplemental anesthesia. Copyright © 2015 American Association of Endodontists. Published by Elsevier Inc. All rights reserved.

  17. Effectiveness of three different oral hygiene techniques on Viridans streptococci: A randomized controlled trial

    Directory of Open Access Journals (Sweden)

    N Naveen

    2016-01-01

    Full Text Available Introduction: Tongue cleaning is an important aspect of oral hygiene maintenance along with other mechanical and chemical aids. These methods have an influence on microorganism count in saliva. Aim: To assess the effectiveness of three different oral hygiene techniques on Viridans streptococci. Materials and Methods: This was a randomized controlled trial with 45 study subjects aged between 14 and 16 years and were randomly allocated into three groups: Group A - plastic tongue scraper, Group B - chlorhexidine mouthwash along with plastic tongue scraper, and Group C - chlorhexidine mouthwash. Unstimulated salivary samples were collected on the 1st, 7th, and 15th day before routine oral hygiene practices. Saliva samples were collected and incubated for 48 h on itis Salivarius(MS agar. Streptococcus mitis, Streptococcus mutans, and Streptococcus salivarius were counted. Data were analyzed using descriptive and inferential statistics. Results: The mean count of S. mitis, S. mutans, and S. salivarius for Group A, B, and C was found to be significant (P < 0.001 when compared between 1st, 7th, and 15th day. Between-groups comparisons revealed a significant difference between Groups A and C, B and C (P < 0.001. Conclusion: There was a significant reduction in bacterial count in all the participants indicating that all the three methods are useful in improving oral hygiene. Combination technique was found to be most effective.

  18. Effects of pushing techniques during the second stage of labor: A randomized controlled trial.

    Science.gov (United States)

    Koyucu, Refika Genç; Demirci, Nurdan

    2017-10-01

    Spontaneous pushing is a method that is used in the management of the second stage of labor and suggested to be more physiological for the mother and infant. The present study aims to evaluate the effects of pushing techniques on the mother and newborn. This randomized prospective study was performed between June 2013-March 2014 in a tertiary maternity clinic in Istanbul. 80 low risk, nulliparous cases were randomized to pushing groups. Valsalva pushing group was told to hold their breath while pushing. No visual-verbal instructions were given to spontaneous pushing group and they were encouraged to push without preventing respiration. Demographic data, second stage period, perineal laceration rates, fetal heart rate patterns, presence of meconium stained amniotic liquid, newborn APGAR scores, POP-Q examination and Q-tip test results were evaluated in these cases. The second stage of labor was significantly longer with spontaneous pushing. Decrease in Hb levels in valsalva pushing group was determined to be higher than spontaneous pushing group. An increased urethral mobility was observed in valsalva pushing group. Although the duration of the second stage of labor was longer compared to valsalva pushing technique, women were able to give birth without requiring any verbal or visual instruction, without exceeding the limit value of two hours and without affecting fetal wellness and neonatal results. Copyright © 2017. Published by Elsevier B.V.

  19. Stream cipher based on pseudorandom number generation using optical affine transformation

    Science.gov (United States)

    Sasaki, Toru; Togo, Hiroyuki; Tanida, Jun; Ichioka, Yoshiki

    2000-07-01

    We propose a new stream cipher technique for 2D image data which can be implemented by iterative optical transformation. The stream cipher uses a pseudo-random number generator (PRNG) to generate pseudo-random bit sequence. The proposed method for the PRNG is composed of iterative operation of 2D affine transformation achieved by optical components, and modulo-n addition of the transformed images. The method is expected to be executed efficiently by optical parallel processing. We verify performance of the proposed method in terms of security strength and clarify problems on optical implementation by the optical fractal synthesizer.

  20. Random Decrement Based FRF Estimation

    DEFF Research Database (Denmark)

    Brincker, Rune; Asmussen, J. C.

    to speed and quality. The basis of the new method is the Fourier transformation of the Random Decrement functions which can be used to estimate the frequency response functions. The investigations are based on load and response measurements of a laboratory model of a 3 span bridge. By applying both methods...... that the Random Decrement technique is based on a simple controlled averaging of time segments of the load and response processes. Furthermore, the Random Decrement technique is expected to produce reliable results. The Random Decrement technique will reduce leakage, since the Fourier transformation...

  1. Random Decrement Based FRF Estimation

    DEFF Research Database (Denmark)

    Brincker, Rune; Asmussen, J. C.

    1997-01-01

    to speed and quality. The basis of the new method is the Fourier transformation of the Random Decrement functions which can be used to estimate the frequency response functions. The investigations are based on load and response measurements of a laboratory model of a 3 span bridge. By applying both methods...... that the Random Decrement technique is based on a simple controlled averaging of time segments of the load and response processes. Furthermore, the Random Decrement technique is expected to produce reliable results. The Random Decrement technique will reduce leakage, since the Fourier transformation...

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

    Science.gov (United States)

    Czernik, Pawel

    2013-10-01

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

  3. Postoperative ileus - an update on preventive techniques

    DEFF Research Database (Denmark)

    Kehlet, H.

    2008-01-01

    This article reviews techniques currently used to prevent or reduce the duration of postoperative ileus (POI), which is considered an undesirable stress response to major abdominal surgery that leads to discomfort, morbidity and prolonged hospital stay. In several randomized studies, a number...... institution of oral feeding and laparoscopic surgery might also be effective, but there is less clear evidence available to support their use. When some of these techniques are combined as part of the concept of multimodal postoperative rehabilitation (fast-track surgery), the duration of POI after open...

  4. Double random phase spread spectrum spread space technique for secure parallel optical multiplexing with individual encryption key

    Science.gov (United States)

    Hennelly, B. M.; Javidi, B.; Sheridan, J. T.

    2005-09-01

    A number of methods have been recently proposed in the literature for the encryption of 2-D information using linear optical systems. In particular the double random phase encoding system has received widespread attention. This system uses two Random Phase Keys (RPK) positioned in the input spatial domain and the spatial frequency domain and if these random phases are described by statistically independent white noises then the encrypted image can be shown to be a white noise. Decryption only requires knowledge of the RPK in the frequency domain. The RPK may be implemented using a Spatial Light Modulators (SLM). In this paper we propose and investigate the use of SLMs for secure optical multiplexing. We show that in this case it is possible to encrypt multiple images in parallel and multiplex them for transmission or storage. The signal energy is effectively spread in the spatial frequency domain. As expected the number of images that can be multiplexed together and recovered without loss is proportional to the ratio of the input image and the SLM resolution. Many more images may be multiplexed with some loss in recovery. Furthermore each individual encryption is more robust than traditional double random phase encoding since decryption requires knowledge of both RPK and a lowpass filter in order to despread the spectrum and decrypt the image. Numerical simulations are presented and discussed.

  5. A comparison of machine learning techniques for predicting downstream acid mine drainage

    CSIR Research Space (South Africa)

    van Zyl, TL

    2014-07-01

    Full Text Available windowing approach over historical values to generate a prediction for the current value. We evaluate a number of Machine Learning techniques as regressors including Support Vector Regression, Random Forests, Stochastic Gradient Decent Regression, Linear...

  6. Specific music therapy techniques in the treatment of primary headache disorders in adolescents: a randomized attention-placebo-controlled trial.

    Science.gov (United States)

    Koenig, Julian; Oelkers-Ax, Rieke; Kaess, Michael; Parzer, Peter; Lenzen, Christoph; Hillecke, Thomas Karl; Resch, Franz

    2013-10-01

    Migraine and tension-type headache have a high prevalence in children and adolescents. In addition to common pharmacologic and nonpharmacologic interventions, music therapy has been shown to be efficient in the prophylaxis of pediatric migraine. This study aimed to assess the efficacy of specific music therapy techniques in the treatment of adolescents with primary headache (tension-type headache and migraine). A prospective, randomized, attention-placebo-controlled parallel group trial was conducted. Following an 8-week baseline, patients were randomized to either music therapy (n = 40) or a rhythm pedagogic program (n = 38) designed as an "attention placebo" over 6 sessions within 8 weeks. Reduction of both headache frequency and intensity after treatment (8-week postline) as well as 6 months after treatment were taken as the efficacy variables. Treatments were delivered in equal dose and frequency by the same group of therapists. Data analysis of subjects completing the protocol showed that neither treatment was superior to the other at any point of measurement (posttreatment and follow-up). Intention-to-treat analysis revealed no impact of drop-out on these results. Both groups showed a moderate mean reduction of headache frequency posttreatment of about 20%, but only small numbers of responders (50% frequency reduction). Follow-up data showed no significant deteriorations or improvements. This article presents a randomized placebo-controlled trial on music therapy in the treatment of adolescents with frequent primary headache. Music therapy is not superior to an attention placebo within this study. These results draw attention to the need of providing adequate controls within therapeutic trials in the treatment of pain. Copyright © 2013 American Pain Society. Published by Elsevier Inc. All rights reserved.

  7. A Pragmatic Randomized Controlled Trial of 6-Step vs 3-Step Hand Hygiene Technique in Acute Hospital Care in the United Kingdom.

    Science.gov (United States)

    Reilly, Jacqui S; Price, Lesley; Lang, Sue; Robertson, Chris; Cheater, Francine; Skinner, Kirsty; Chow, Angela

    2016-06-01

    OBJECTIVE To evaluate the microbiologic effectiveness of the World Health Organization's 6-step and the Centers for Disease Control and Prevention's 3-step hand hygiene techniques using alcohol-based handrub. DESIGN A parallel group randomized controlled trial. SETTING An acute care inner-city teaching hospital (Glasgow). PARTICIPANTS Doctors (n=42) and nurses (n=78) undertaking direct patient care. INTERVENTION Random 1:1 allocation of the 6-step (n=60) or the 3-step (n=60) technique. RESULTS The 6-step technique was microbiologically more effective at reducing the median log10 bacterial count. The 6-step technique reduced the count from 3.28 CFU/mL (95% CI, 3.11-3.38 CFU/mL) to 2.58 CFU/mL (2.08-2.93 CFU/mL), whereas the 3-step reduced it from 3.08 CFU/mL (2.977-3.27 CFU/mL) to 2.88 CFU/mL (-2.58 to 3.15 CFU/mL) (P=.02). However, the 6-step technique did not increase the total hand coverage area (98.8% vs 99.0%, P=.15) and required 15% (95% CI, 6%-24%) more time (42.50 seconds vs 35.0 seconds, P=.002). Total hand coverage was not related to the reduction in bacterial count. CONCLUSIONS Two techniques for hand hygiene using alcohol-based handrub are promoted in international guidance, the 6-step by the World Health Organization and 3-step by the Centers for Disease Control and Prevention. The study provides the first evidence in a randomized controlled trial that the 6-step technique is superior, thus these international guidance documents should consider this evidence, as should healthcare organizations using the 3-step technique in practice. Infect Control Hosp Epidemiol 2016;37:661-666.

  8. Improvement of the Gravitational Search Algorithm by means of Low-Discrepancy Sobol Quasi Random-Number Sequence Based Initialization

    Directory of Open Access Journals (Sweden)

    ALTINOZ, O. T.

    2014-08-01

    Full Text Available Nature-inspired optimization algorithms can obtain the optima by updating the position of each member in the population. At the beginning of the algorithm, the particles of the population are spread into the search space. The initial distribution of particles corresponds to the beginning points of the search process. Hence, the aim is to alter the position for each particle beginning with this initial position until the optimum solution will be found with respect to the pre-determined conditions like maximum iteration, and specific error value for the fitness function. Therefore, initial positions of the population have a direct effect on both accuracy of the optima and the computational cost. If any member in the population is close enough to the optima, this eases the achievement of the exact solution. On the contrary, individuals grouped far away from the optima might yield pointless efforts. In this study, low-discrepancy quasi-random number sequence is preferred for the localization of the population at the initialization phase. By this way, the population is distributed into the search space in a more uniform manner at the initialization phase. The technique is applied to the Gravitational Search Algorithm and compared via the performance on benchmark function solutions.

  9. Velocity-Resolved LES (VR-LES) technique for simulating turbulent transport of high Schmidt number passive scalars

    Science.gov (United States)

    Verma, Siddhartha; Blanquart, Guillaume; P. K. Yeung Collaboration

    2011-11-01

    Accurate simulation of high Schmidt number scalar transport in turbulent flows is essential to studying pollutant dispersion, weather, and several oceanic phenomena. Batchelor's theory governs scalar transport in such flows, but requires further validation at high Schmidt and high Reynolds numbers. To this end, we use a new approach with the velocity field fully resolved, but the scalar field only partially resolved. The grid used is fine enough to resolve scales up to the viscous-convective subrange where the decaying slope of the scalar spectrum becomes constant. This places the cutoff wavenumber between the Kolmogorov scale and the Batchelor scale. The subgrid scale terms, which affect transport at the supergrid scales, are modeled under the assumption that velocity fluctuations are negligible beyond this cutoff wavenumber. To ascertain the validity of this technique, we performed a-priori testing on existing DNS data. This Velocity-Resolved LES (VR-LES) technique significantly reduces the computational cost of turbulent simulations of high Schmidt number scalars, and yet provides valuable information of the scalar spectrum in the viscous-convective subrange.

  10. Preoperative warm-up the key to improved resident technique: a randomized study.

    Science.gov (United States)

    Moran-Atkin, Erin; Abdalla, Gamal; Chen, Grace; Magnuson, Thomas H; Lidor, Anne O; Schweitzer, Michael A; Steele, Kimberley E

    2015-05-01

    The ACGME has required that a skills lab be incorporated into the surgical residency curriculum. While the value of warm-up is generally accepted in other areas requiring complex motor skills, there is little evidence to support the benefits of warm-up prior to performing surgery. We are conducting this study in an attempt to identify whether a warm-up period prior to operating impacts operative technique. All general surgery residents and MIS fellows were included in this IRB-approved randomized study. Participants were randomized to either warm-up or no warm-up groups. Participants randomized to the warm-up group completed a 10 min practice session in the simulation lab within 1 h of starting the case, using an FLS training box. At the conclusion of the operation, the participant was evaluated by the attending surgeon using the validated global rating scales of Reznick and Vassiliou. The attending surgeons were blinded to the use of pre-procedure warm-up. The results of the questionnaire were analyzed using student's t test with p warm-up (19) or no warm-up (21). There was a statistically significant improvement in depth perception (p = 0.02), bimanual dexterity (p = 0.01), and efficiency of movements (p = 0.03) for those randomized to warm-up. There was statistical improvement when we preformed a composite scoring of the attending evaluations for each of the Reznick (p = 0.008) and the Vassiliou (p = 0.01) global rating scales. Preoperative warm-up significantly improves depth perception, bimanual dexterity, and efficiency of movements, as well as improvement in composite scores as judged by the attending surgeon. The lack of self-perceived improvement by the residents may be a reflection of the high standards and intense self-critique that is common among surgical trainees. We believe that our findings, while preliminary, reflect that surgical performance can be enhanced through structured warm-up activities.

  11. Questions and Questioning Techniques: A View of Indonesian Students’ Preferences

    Directory of Open Access Journals (Sweden)

    Debora Tri Ragawanti

    2009-01-01

    Full Text Available This study investigated students’ preference on teacher’s questions and questionings techniques and more importantly on how they could facilitate or impede their learning. The results on teacher’s questioning techniques showed that random nomination was more preferred than pre-arranged format nomination. In addition, techniques of nominating volunteering students and of giving wait-time were disliked by most student-respondents. As for types of question, the yes/no question was favored by most of the respondents. Different from the yes/no question, the number of respondents leaning forward to the analysis question, questions about fact of life, and questions to state opinion did not show a significant difference from the number of those leaning against the same questions.

  12. Large-scale inverse model analyses employing fast randomized data reduction

    Science.gov (United States)

    Lin, Youzuo; Le, Ellen B.; O'Malley, Daniel; Vesselinov, Velimir V.; Bui-Thanh, Tan

    2017-08-01

    When the number of observations is large, it is computationally challenging to apply classical inverse modeling techniques. We have developed a new computationally efficient technique for solving inverse problems with a large number of observations (e.g., on the order of 107 or greater). Our method, which we call the randomized geostatistical approach (RGA), is built upon the principal component geostatistical approach (PCGA). We employ a data reduction technique combined with the PCGA to improve the computational efficiency and reduce the memory usage. Specifically, we employ a randomized numerical linear algebra technique based on a so-called "sketching" matrix to effectively reduce the dimension of the observations without losing the information content needed for the inverse analysis. In this way, the computational and memory costs for RGA scale with the information content rather than the size of the calibration data. Our algorithm is coded in Julia and implemented in the MADS open-source high-performance computational framework (http://mads.lanl.gov). We apply our new inverse modeling method to invert for a synthetic transmissivity field. Compared to a standard geostatistical approach (GA), our method is more efficient when the number of observations is large. Most importantly, our method is capable of solving larger inverse problems than the standard GA and PCGA approaches. Therefore, our new model inversion method is a powerful tool for solving large-scale inverse problems. The method can be applied in any field and is not limited to hydrogeological applications such as the characterization of aquifer heterogeneity.

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

    OpenAIRE

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

    2014-01-01

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

  14. The relationship between randomness and power-law distributed move lengths in random walk algorithms

    Science.gov (United States)

    Sakiyama, Tomoko; Gunji, Yukio-Pegio

    2014-05-01

    Recently, we proposed a new random walk algorithm, termed the REV algorithm, in which the agent alters the directional rule that governs it using the most recent four random numbers. Here, we examined how a non-bounded number, i.e., "randomness" regarding move direction, was important for optimal searching and power-law distributed step lengths in rule change. We proposed two algorithms: the REV and REV-bounded algorithms. In the REV algorithm, one of the four random numbers used to change the rule is non-bounded. In contrast, all four random numbers in the REV-bounded algorithm are bounded. We showed that the REV algorithm exhibited more consistent power-law distributed step lengths and flexible searching behavior.

  15. Dorsal onlay (Barbagli technique) versus dorsal inlay (Asopa technique) buccal mucosal graft urethroplasty for anterior urethral stricture: a prospective randomized study.

    Science.gov (United States)

    Aldaqadossi, Hussein; El Gamal, Samir; El-Nadey, Mohamed; El Gamal, Osama; Radwan, Mohamed; Gaber, Mohamed

    2014-02-01

    To compare both the dorsal onlay technique of Barbagli and the dorsal inlay technique of Asopa for the management of long anterior urethral stricture. From January 2010 to May 2012, a total of 47 patients with long anterior urethral strictures were randomized into two groups. The first group included 25 patients who were managed by dorsal onlay buccal mucosal graft urethroplasty. The second group included 22 patients who were managed by dorsal inlay buccal mucosal graft urethroplasty. Different clinical parameters, postoperative complications and success rates were compared between both groups. The overall success rate in the dorsal onlay group was 88%, whereas in the dorsal inlay group the success rate was 86.4% during the follow-up period. The mean operative time was significantly longer in the dorsal onlay urethroplasty group (205 ± 19.63 min) than in the dorsal inlay urethroplasty group (128 ± 4.9 min, P-value <0.0001). The average blood loss was significantly higher in the dorsal onlay urethroplasty group (228 ± 5.32 mL) than in the dorsal inlay urethroplasty group (105 ± 12.05 mL, P-value <0.0001). The dorsal onlay technique of Barbagli and the dorsal inlay technique of Asopa buccal mucosal graft urethroplasty provide similar success rates. The Asopa technique is easy to carry out, provides shorter operative time and less blood loss, and it is associated with fewer complications for anterior urethral stricture repair. © 2013 The Japanese Urological Association.

  16. Non-compact random generalized games and random quasi-variational inequalities

    OpenAIRE

    Yuan, Xian-Zhi

    1994-01-01

    In this paper, existence theorems of random maximal elements, random equilibria for the random one-person game and random generalized game with a countable number of players are given as applications of random fixed point theorems. By employing existence theorems of random generalized games, we deduce the existence of solutions for non-compact random quasi-variational inequalities. These in turn are used to establish several existence theorems of noncompact generalized random ...

  17. Application of Vector Triggering Random Decrement

    DEFF Research Database (Denmark)

    Asmussen, J. C.; Ibrahim, S. R.; Brincker, Rune

    result is a Random Decrement function from each measurement. In traditional Random Decrement estimation the triggering condition is a scalar condition, which should only be fulfilled in a single measurement. In vector triggering Random Decrement the triggering condition is a vector condition......This paper deals with applications of the vector triggering Random Decrement technique. This technique is new and developed with the aim of minimizing estimation time and identification errors. The theory behind the technique is discussed in an accompanying paper. The results presented...... in this paper should be regarded as a further documentation of the technique. The key point in Random Decrement estimation is the formulation of a triggering condition. If the triggering condition is fulfilled a time segment from each measurement is picked out and averaged with previous time segments. The final...

  18. Application of Vector Triggering Random Decrement

    DEFF Research Database (Denmark)

    Asmussen, J. C.; Ibrahim, S. R.; Brincker, Rune

    1997-01-01

    result is a Random Decrement function from each measurement. In traditional Random Decrement estimation the triggering condition is a scalar condition, which should only be fulfilled in a single measurement. In vector triggering Random Decrement the triggering condition is a vector condition......This paper deals with applications of the vector triggering Random Decrement technique. This technique is new and developed with the aim of minimizing estimation time and identification errors. The theory behind the technique is discussed in an accompanying paper. The results presented...... in this paper should be regarded as a further documentation of the technique. The key point in Random Decrement estimation is the formulation of a triggering condition. If the triggering condition is fulfilled a time segment from each measurement is picked out and averaged with previous time segments. The final...

  19. One Model Fits All: Explaining Many Aspects of Number Comparison within a Single Coherent Model-A Random Walk Account

    Science.gov (United States)

    Reike, Dennis; Schwarz, Wolf

    2016-01-01

    The time required to determine the larger of 2 digits decreases with their numerical distance, and, for a given distance, increases with their magnitude (Moyer & Landauer, 1967). One detailed quantitative framework to account for these effects is provided by random walk models. These chronometric models describe how number-related noisy…

  20. Vicious random walkers in the limit of a large number of walkers

    International Nuclear Information System (INIS)

    Forrester, P.J.

    1989-01-01

    The vicious random walker problem on a line is studied in the limit of a large number of walkers. The multidimensional integral representing the probability that the p walkers will survive a time t (denoted P t (p) ) is shown to be analogous to the partition function of a particular one-component Coulomb gas. By assuming the existence of the thermodynamic limit for the Coulomb gas, one can deduce asymptotic formulas for P t (p) in the large-p, large-t limit. A straightforward analysis gives rigorous asymptotic formulas for the probability that after a time t the walkers are in their initial configuration (this event is termed a reunion). Consequently, asymptotic formulas for the conditional probability of a reunion, given that all walkers survive, are derived. Also, an asymptotic formula for the conditional probability density that any walker will arrive at a particular point in time t, given that all p walkers survive, is calculated in the limit t >> p

  1. A time-series approach to random number generation: Using recurrence quantification analysis to capture executive behavior

    Directory of Open Access Journals (Sweden)

    Wouter eOomens

    2015-06-01

    Full Text Available The concept of executive functions plays a prominent role in contemporary experimental and clinical studies on cognition. One paradigm used in this framework is the random number generation (RNG task, the execution of which demands aspects of executive functioning, specifically inhibition and working memory. Data from the RNG task are best seen as a series of successive events. However, traditional RNG measures that are used to quantify executive functioning are mostly summary statistics referring to deviations from mathematical randomness. In the current study, we explore the utility of recurrence quantification analysis (RQA, a nonlinear method that keeps the entire sequence intact, as a better way to describe executive functioning compared to traditional measures. To this aim, 242 first- and second-year students completed a non-paced RNG task. Principal component analysis of their data showed that traditional and RQA measures convey more or less the same information. However, RQA measures do so more parsimoniously and have a better interpretation.

  2. Peyton’s four-step approach for teaching complex spinal manipulation techniques – a prospective randomized trial

    Directory of Open Access Journals (Sweden)

    Gertraud Gradl-Dietsch

    2016-11-01

    Full Text Available Abstract Background The objectives of this prospective randomized trial were to assess the impact of Peyton’s four-step approach on the acquisition of complex psychomotor skills and to examine the influence of gender on learning outcomes. Methods We randomly assigned 95 third to fifth year medical students to an intervention group which received instructions according to Peyton (PG or a control group, which received conventional teaching (CG. Both groups attended four sessions on the principles of manual therapy and specific manipulative and diagnostic techniques for the spine. We assessed differences in theoretical knowledge (multiple choice (MC exam and practical skills (Objective Structured Practical Examination (OSPE with respect to type of intervention and gender. Participants took a second OSPE 6 months after completion of the course. Results There were no differences between groups with respect to the MC exam. Students in the PG group scored significantly higher in the OSPE. Gender had no additional impact. Results of the second OSPE showed a significant decline in competency regardless of gender and type of intervention. Conclusions Peyton’s approach is superior to standard instruction for teaching complex spinal manipulation skills regardless of gender. Skills retention was equally low for both techniques.

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

    Energy Technology Data Exchange (ETDEWEB)

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

    2016-04-15

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

  4. Random walk of passive tracers among randomly moving obstacles

    OpenAIRE

    Gori, Matteo; Donato, Irene; Floriani, Elena; Nardecchia, Ilaria; Pettini, Marco

    2016-01-01

    Background: This study is mainly motivated by the need of understanding how the diffusion behaviour of a biomolecule (or even of a larger object) is affected by other moving macromolecules, organelles, and so on, inside a living cell, whence the possibility of understanding whether or not a randomly walking biomolecule is also subject to a long-range force field driving it to its target. Method: By means of the Continuous Time Random Walk (CTRW) technique the topic of random walk in random en...

  5. Experimental analysis of the flow near the boundary of random porous media

    Science.gov (United States)

    Wu, Zhenxing; Mirbod, Parisa

    2018-04-01

    The aim of this work is to experimentally examine flow over and near random porous media. Different porous materials were chosen to achieve porosity ranging from 0.95 to 0.99. In this study, we report the detailed velocity measurements of the flow over and near random porous material inside a rectangular duct using a planar particle image velocimetry (PIV) technique. By controlling the flow rate, two different Reynolds numbers were achieved. We determined the slip velocity at the interface between the porous media and free flow. Values of the slip velocity normalized either by the maximum flow velocity or by the shear rate at the interface and the screening distance K1/2 were found to depend on porosity. It was also shown that the depth of penetration inside the porous material was larger than the screening length using Brinkman's prediction. Moreover, we examined a model for the laminar coupled flow over and inside porous media and analyzed the permeability of a random porous medium. This study provided detailed analysis of flow over and at the interface of various specific random porous media using the PIV technique. This analysis has the potential to serve as a first step toward using random porous media as a new passive technique to control the flow over smooth surfaces.

  6. A P-N Sequence Generator Using LFSR with Dual Edge Trigger Technique

    Directory of Open Access Journals (Sweden)

    Naghwal Nitin Kumar

    2016-01-01

    Full Text Available This paper represents the design and implementation of a low power 4-bit LFSR using Dual edge triggered flip flop. A linear feedback shift register (LFSR is assembled by N number of flip flops connected in series and a combinational logic generally xor gate. An LFSR can generate random number sequence which acts as cipher in cryptography. A known text encrypted over long PN sequence, in order to improve security sequence made longer ie 128 bit; require long chain of flip flop leads to more power consumption. In this paper a novel circuit of random sequence generator using dual edge triggered flip flop has been proposed. Data has been generated on every edge of flip flop instead of single edge. A DETFF-LFSR can generate random number require with less number of clock cycle, it minimizes the number of flip flop result in power saving. In this paper we concentrates on the designing of power competent Test Pattern Generator (TPG using four dual edge triggered flip-flops as the basic building block, overall there is reduction of power around 25% by using these techniques.

  7. Monomer-dimer problem on random planar honeycomb lattice

    Energy Technology Data Exchange (ETDEWEB)

    Ren, Haizhen [School of Mathematical Sciences, Xiamen University, Xiamen 361005, Fujian (China); Department of Mathematics, Qinghai Normal University, Xining 810008, Qinghai (China); Zhang, Fuji; Qian, Jianguo, E-mail: jqqian@xmu.edu.cn [School of Mathematical Sciences, Xiamen University, Xiamen 361005, Fujian (China)

    2014-02-15

    We consider the monomer-dimer (MD) problem on a random planar honeycomb lattice model, namely, the random multiple chain. This is a lattice system with non-periodic boundary condition, whose generating process is inspired by the growth of single walled zigzag carbon nanotubes. By applying algebraic and combinatorial techniques we establish a calculating expression of the MD partition function for bipartite graphs, which corresponds to the permanent of a matrix. Further, by using the transfer matrix argument we show that the computing problem of the permanent of high order matrix can be converted into some lower order matrices for this family of lattices, based on which we derive an explicit recurrence formula for evaluating the MD partition function of multiple chains and random multiple chains. Finally, we analyze the expectation of the number of monomer-dimer arrangements on a random multiple chain and the asymptotic behavior of the annealed MD entropy when the multiple chain becomes infinite in width and length, respectively.

  8. Measuring gas-residence times in large municipal incinerators, by means of a pseudo-random binary signal tracer technique

    International Nuclear Information System (INIS)

    Nasserzadeh, V.; Swithenbank, J.; Jones, B.

    1995-01-01

    The problem of measuring gas-residence time in large incinerators was studied by the pseudo-random binary sequence (PRBS) stimulus tracer response technique at the Sheffield municipal solid-waste incinerator (35 MW plant). The steady-state system was disturbed by the superimposition of small fluctuations in the form of a pseudo-random binary sequence of methane pulses, and the response of the incinerator was determined from the CO 2 concentration in flue gases at the boiler exit, measured with a specially developed optical gas analyser with a high-frequency response. For data acquisition, an on-line PC computer was used together with the LAB Windows software system; the output response was then cross-correlated with the perturbation signal to give the impulse response of the incinerator. There was very good agreement between the gas-residence time for the Sheffield MSW incinerator as calculated by computational fluid dynamics (FLUENT Model) and gas-residence time at the plant as measured by the PRBS tracer technique. The results obtained from this research programme clearly demonstrate that the PRBS stimulus tracer response technique can be successfully and economically used to measure gas-residence times in large incinerator plants. It also suggests that the common commercial practice of characterising the incinerator operation by a single-residence-time parameter may lead to a misrepresentation of the complexities involved in describing the operation of the incineration system. (author)

  9. Neural tension technique is no different from random passive movements in reducing spasticity in patients with traumatic brain injury

    DEFF Research Database (Denmark)

    Lorentzen, Jakob; Nielsen, Dorthe; Holm, Karl

    2012-01-01

    Purpose: Neural tension technique (NTT) is a therapy believed to reduce spasticity and to increase range of motion (ROM). This study compared the ability of NTT and random passive movements (RPMs) to reduce spasticity in the knee flexors in 10 spastic patients with brain injury. Methods: An RCT...

  10. THE APPLICATION OF JIGSAW AND NUMBERED HEADS TOGETHER TECHNIQUES IN IMPROVING STUDENTS’ ABILITY IN SPEAKING SKILL

    Directory of Open Access Journals (Sweden)

    Siti Aimah

    2017-04-01

    Full Text Available This research was aimed to investigate how the study of speaking was developed through Jigsaw and Numbered Heads Together techniques and find out the improvement of students’ ability in speaking. For this purpose, 14 students of the second semester students were taken in the academic year of 2012/2013. A classroom action research was conducted in which consisted of two cycles through the stages of planning, action, observation, and reflection. The speaking tests, the observation note, and the questionnaire were taken as the data. The result of this research showed the students’ ability in speaking improved significantly. They were more enthusiastic in joining the class. They could learn together with their team in understanding the material and conveying it to the others well. They were also dared to tell what they wanted to tell the others without any pressuring from anyone else. They tried to snatch away each others in conveying their idea based on the number mentioned by the lecturer. In some cases, they even argued their argumentation attractively. While from the questionnaire which was distributed showed that more than 75% students felt the application of Jigsaw and Numbered Heads Together techniques helped them easily in developing their ability in speaking skill. And more than 80% students agreed those techniques facilitated them on having the accountability in understanding and conveying the material that they had learnt easily to the others. Studying in a team proved that the students enjoyed more in joining the English class. So it is suggested that the English lecturers should use the types of cooperative learning in teaching language skills.

  11. Stable and efficient retrospective 4D-MRI using non-uniformly distributed quasi-random numbers

    Science.gov (United States)

    Breuer, Kathrin; Meyer, Cord B.; Breuer, Felix A.; Richter, Anne; Exner, Florian; Weng, Andreas M.; Ströhle, Serge; Polat, Bülent; Jakob, Peter M.; Sauer, Otto A.; Flentje, Michael; Weick, Stefan

    2018-04-01

    The purpose of this work is the development of a robust and reliable three-dimensional (3D) Cartesian imaging technique for fast and flexible retrospective 4D abdominal MRI during free breathing. To this end, a non-uniform quasi random (NU-QR) reordering of the phase encoding (k y –k z ) lines was incorporated into 3D Cartesian acquisition. The proposed sampling scheme allocates more phase encoding points near the k-space origin while reducing the sampling density in the outer part of the k-space. Respiratory self-gating in combination with SPIRiT-reconstruction is used for the reconstruction of abdominal data sets in different respiratory phases (4D-MRI). Six volunteers and three patients were examined at 1.5 T during free breathing. Additionally, data sets with conventional two-dimensional (2D) linear and 2D quasi random phase encoding order were acquired for the volunteers for comparison. A quantitative evaluation of image quality versus scan times (from 70 s to 626 s) for the given sampling schemes was obtained by calculating the normalized mutual information (NMI) for all volunteers. Motion estimation was accomplished by calculating the maximum derivative of a signal intensity profile of a transition (e.g. tumor or diaphragm). The 2D non-uniform quasi-random distribution of phase encoding lines in Cartesian 3D MRI yields more efficient undersampling patterns for parallel imaging compared to conventional uniform quasi-random and linear sampling. Median NMI values of NU-QR sampling are the highest for all scan times. Therefore, within the same scan time 4D imaging could be performed with improved image quality. The proposed method allows for the reconstruction of motion artifact reduced 4D data sets with isotropic spatial resolution of 2.1  ×  2.1  ×  2.1 mm3 in a short scan time, e.g. 10 respiratory phases in only 3 min. Cranio-caudal tumor displacements between 23 and 46 mm could be observed. NU-QR sampling enables for stable 4D

  12. Use of communication techniques by Maryland dentists.

    Science.gov (United States)

    Maybury, Catherine; Horowitz, Alice M; Wang, Min Qi; Kleinman, Dushanka V

    2013-12-01

    Health care providers' use of recommended communication techniques can increase patients' adherence to prevention and treatment regimens and improve patient health outcomes. The authors conducted a survey of Maryland dentists to determine the number and type of communication techniques they use on a routine basis. The authors mailed a 30-item questionnaire to a random sample of 1,393 general practice dentists and all 169 members of the Maryland chapter of the American Academy of Pediatric Dentistry. The overall response rate was 38.4 percent. Analysis included descriptive statistics, analysis of variance and ordinary least squares regression analysis to examine the association of dentists' characteristics with the number of communication techniques used. They set the significance level at P communication techniques and 3.6 of the seven basic techniques, whereas pediatric dentists reported using a mean of 8.4 and 3.8 of those techniques, respectively. General dentists who had taken a communication course outside of dental school were more likely than those who had not to use the 18 techniques (P communication course outside of dental school were more likely than those who had not to use the 18 techniques (P communication techniques that dentists used routinely varied across the 18 techniques and was low for most techniques. Practical Implications. Professional education is needed both in dental school curricula and continuing education courses to increase use of recommended communication techniques. Specifically, dentists and their team members should consider taking communication skills courses and conducting an overall evaluation of their practices for user friendliness.

  13. MUP, CEC-DES, STRADE. Codes for uncertainty propagation, experimental design and stratified random sampling techniques

    International Nuclear Information System (INIS)

    Amendola, A.; Astolfi, M.; Lisanti, B.

    1983-01-01

    The report describes the how-to-use of the codes: MUP (Monte Carlo Uncertainty Propagation) for uncertainty analysis by Monte Carlo simulation, including correlation analysis, extreme value identification and study of selected ranges of the variable space; CEC-DES (Central Composite Design) for building experimental matrices according to the requirements of Central Composite and Factorial Experimental Designs; and, STRADE (Stratified Random Design) for experimental designs based on the Latin Hypercube Sampling Techniques. Application fields, of the codes are probabilistic risk assessment, experimental design, sensitivity analysis and system identification problems

  14. Stimulus number, duration and intensity encoding in randomly connected attractor networks with synaptic depression

    Directory of Open Access Journals (Sweden)

    Paul eMiller

    2013-05-01

    Full Text Available Randomly connected recurrent networks of excitatory groups of neurons can possess a multitude of attractor states. When the internal excitatory synapses of these networks are depressing, the attractor states can be destabilized with increasing input. This leads to an itinerancy, where with either repeated transient stimuli, or increasing duration of a single stimulus, the network activity advances through sequences of attractor states. We find that the resulting network state, which persists beyond stimulus offset, can encode the number of stimuli presented via a distributed representation of neural activity with non-monotonic tuning curves for most neurons. Increased duration of a single stimulus is encoded via different distributed representations, so unlike an integrator, the network distinguishes separate successive presentations of a short stimulus from a single presentation of a longer stimulus with equal total duration. Moreover, different amplitudes of stimulus cause new, distinct activity patterns, such that changes in stimulus number, duration and amplitude can be distinguished from each other. These properties of the network depend on dynamic depressing synapses, as they disappear if synapses are static. Thus short-term synaptic depression allows a network to store separately the different dynamic properties of a spatially constant stimulus.

  15. Methodology for attainment of density and effective atomic number through dual energy technique using microtomographic images

    International Nuclear Information System (INIS)

    Alves, H.; Lima, I.; Lopes, R.T.

    2014-01-01

    Dual energy technique for computerized microtomography shows itself as a promising method for identification of mineralogy on geological samples of heterogeneous composition. It can also assist with differentiating very similar objects regarding the attenuation coefficient, which are usually not separable during image processing and analysis of microtomographic data. Therefore, the development of a feasible and applicable methodology of dual energy in the analysis of microtomographic images was sought. - Highlights: • Dual energy technique is promising for identification of distribution of minerals. • A feasible methodology of dual energy in analysis of tomographic images was sought. • The dual energy technique is efficient for density and atomic number identification. • Simulation showed that the proposed methodology agrees with theoretical data. • Nondestructive characterization of distribution of density and chemical composition

  16. Random Decrement

    DEFF Research Database (Denmark)

    Asmussen, J.C.; Ibrahim, S.R.; Brincker, Rune

    Abstraet Thispaper demansirates how to use the Random Decrement (RD) technique for identification o flinear structures subjected to ambient excitation. The theory behind the technique will be presented and guidelines how to choose the different variables will be given. This is done by introducing...

  17. Percutaneous Sacroiliac Screw Placement: A Prospective Randomized Comparison of Robot-assisted Navigation Procedures with a Conventional Technique

    Science.gov (United States)

    Wang, Jun-Qiang; Wang, Yu; Feng, Yun; Han, Wei; Su, Yong-Gang; Liu, Wen-Yong; Zhang, Wei-Jun; Wu, Xin-Bao; Wang, Man-Yi; Fan, Yu-Bo

    2017-01-01

    Background: Sacroiliac (SI) screw fixation is a demanding technique, with a high rate of screw malposition due to the complex pelvic anatomy. TiRobot™ is an orthopedic surgery robot which can be used for SI screw fixation. This study aimed to evaluate the accuracy of robot-assisted placement of SI screws compared with a freehand technique. Methods: Thirty patients requiring posterior pelvic ring stabilization were randomized to receive freehand or robot-assisted SI screw fixation, between January 2016 and June 2016 at Beijing Jishuitan Hospital. Forty-five screws were placed at levels S1 and S2. In both methods, the primary end point screw position was assessed and classified using postoperative computed tomography. Fisher's exact probability test was used to analyze the screws’ positions. Secondary end points, such as duration of trajectory planning, surgical time after reduction of the pelvis, insertion time for guide wire, number of guide wire attempts, and radiation exposure without pelvic reduction, were also assessed. Results: Twenty-three screws were placed in the robot-assisted group and 22 screws in the freehand group; no postoperative complications or revisions were reported. The excellent and good rate of screw placement was 100% in the robot-assisted group and 95% in the freehand group. The P value (0.009) showed the same superiority in screw distribution. The fluoroscopy time after pelvic reduction in the robot-assisted group was significantly shorter than that in the freehand group (median [Q1, Q3]: 6.0 [6.0, 9.0] s vs. median [Q1, Q3]: 36.0 [21.5, 48.0] s; χ2 = 13.590, respectively, P < 0.001); no difference in operation time after reduction of the pelvis was noted (χ2 = 1.990, P = 0.158). Time for guide wire insertion was significantly shorter for the robot-assisted group than that for the freehand group (median [Q1, Q3]: 2.0 [2.0, 2.7] min vs. median [Q1, Q3]: 19.0 [15.5, 45.0] min; χ2 = 20.952, respectively, P < 0.001). The number of guide

  18. Randomization in clinical trials: stratification or minimization? The HERMES free simulation software.

    Science.gov (United States)

    Fron Chabouis, Hélène; Chabouis, Francis; Gillaizeau, Florence; Durieux, Pierre; Chatellier, Gilles; Ruse, N Dorin; Attal, Jean-Pierre

    2014-01-01

    Operative clinical trials are often small and open-label. Randomization is therefore very important. Stratification and minimization are two randomization options in such trials. The first aim of this study was to compare stratification and minimization in terms of predictability and balance in order to help investigators choose the most appropriate allocation method. Our second aim was to evaluate the influence of various parameters on the performance of these techniques. The created software generated patients according to chosen trial parameters (e.g., number of important prognostic factors, number of operators or centers, etc.) and computed predictability and balance indicators for several stratification and minimization methods over a given number of simulations. Block size and proportion of random allocations could be chosen. A reference trial was chosen (50 patients, 1 prognostic factor, and 2 operators) and eight other trials derived from this reference trial were modeled. Predictability and balance indicators were calculated from 10,000 simulations per trial. Minimization performed better with complex trials (e.g., smaller sample size, increasing number of prognostic factors, and operators); stratification imbalance increased when the number of strata increased. An inverse correlation between imbalance and predictability was observed. A compromise between predictability and imbalance still has to be found by the investigator but our software (HERMES) gives concrete reasons for choosing between stratification and minimization; it can be downloaded free of charge. This software will help investigators choose the appropriate randomization method in future two-arm trials.

  19. Random Decrement

    DEFF Research Database (Denmark)

    Asmussen, J. C.; Ibrahim, S. R.; Brincker, Rune

    This paper demonstrates how to use the Random Decrement (RD) technique for identification of linear structures subjected to ambient excitation. The theory behind the technique will be presented and guidelines how to choose the different variables will be given. This is done by introducing a new...

  20. Random Decrement

    DEFF Research Database (Denmark)

    Asmussen, J. C.; Ibrahim, R.; Brincker, Rune

    1998-01-01

    This paper demonstrates how to use the Random Decrement (RD) technique for identification of linear structures subjected to ambient excitation. The theory behind the technique will be presented and guidelines how to choose the different variables will be given. This is done by introducing a new...

  1. Direct progeny detection techniques and random epidemiology

    International Nuclear Information System (INIS)

    Mayya, Y.S.; Mishra, Rosaline; Sapra, B.K.

    2015-01-01

    Over the past 40 years, there has been considerable progress in the measurements methods and their application to the estimates of risks due to radon among general populations. The previous decade saw major development in this regard. It was the direct estimate of indoor radon risk from epidemiological studies in Europe and North America. These were important findings that demonstrated the presence of lung cancer risks at residential radon levels supplementing the generally used risks estimates at high exposures obtained from uranium miner's data. The residential radon epidemiological studies largely used radon concentration as a measure of exposure. The exposure to decay products, which are primarily the dose givers, are assumed to be proportional to the measured gas concentrations. Also, the presence of thoron was neglected in these studies. Although several corrections have appeared to these assessments, the question of variability of actual decay product exposures has largely remained unaddressed. In order to circumvent this limitation, passive techniques were developed to estimate the decay product concentrations directly using deposition monitors. These are based on detecting the alpha particles from decay products deposited on an absorber mounted LR-115 detectors. Known as Direct radon, and Thoron Progeny sensors (DRPS/DTPS), these have been further refined to separate fine fraction from the coarse fraction by wire-mesh capping techniques. Large number environmental calibration exercises and field data generation has been carried out on the progeny concentrations in Indian and some European environments. The development of progeny sensors offers a new tool for future epidemiology. Since in the Indian context, there exist no radon related epidemiological estimates of risk, it is time one conducts large scale studies to seek possible correlations between DRPS/DTPS data and lung cancer risks. While epidemiological studies in High background radiation areas

  2. Acupuncture-Related Techniques for Psoriasis: A Systematic Review with Pairwise and Network Meta-Analyses of Randomized Controlled Trials.

    Science.gov (United States)

    Yeh, Mei-Ling; Ko, Shu-Hua; Wang, Mei-Hua; Chi, Ching-Chi; Chung, Yu-Chu

    2017-12-01

    There has be a large body of evidence on the pharmacological treatments for psoriasis, but whether nonpharmacological interventions are effective in managing psoriasis remains largely unclear. This systematic review conducted pairwise and network meta-analyses to determine the effects of acupuncture-related techniques on acupoint stimulation for the treatment of psoriasis and to determine the order of effectiveness of these remedies. This study searched the following databases from inception to March 15, 2016: Medline, PubMed, Cochrane Central Register of Controlled Trials, EBSCO (including Academic Search Premier, American Doctoral Dissertations, and CINAHL), Airiti Library, and China National Knowledge Infrastructure. Randomized controlled trials (RCTs) on the effects of acupuncture-related techniques on acupoint stimulation as intervention for psoriasis were independently reviewed by two researchers. A total of 13 RCTs with 1,060 participants were included. The methodological quality of included studies was not rigorous. Acupoint stimulation, compared with nonacupoint stimulation, had a significant treatment for psoriasis. However, the most common adverse events were thirst and dry mouth. Subgroup analysis was further done to confirm that the short-term treatment effect was superior to that of the long-term effect in treating psoriasis. Network meta-analysis identified acupressure or acupoint catgut embedding, compared with medication, and had a significant effect for improving psoriasis. It was noted that acupressure was the most effective treatment. Acupuncture-related techniques could be considered as an alternative or adjuvant therapy for psoriasis in short term, especially of acupressure and acupoint catgut embedding. This study recommends further well-designed, methodologically rigorous, and more head-to-head randomized trials to explore the effects of acupuncture-related techniques for treating psoriasis.

  3. Random assay in radioimmunoassay: Feasibility and application compared with batch assay

    Energy Technology Data Exchange (ETDEWEB)

    Lee, Jung Min; Lee, Hwan Hee; Park, Sohyun; Kim, Tae Sung; Kim, Seok Ki [Dept. of Nuclear MedicineNational Cancer Center, Goyang (Korea, Republic of)

    2016-12-15

    The batch assay has been conventionally used for radioimmunoassay (RIA) because of its technical robustness and practical convenience. However, it has limitations in terms of the relative lag of report time due to the necessity of multiple assays in a small number of samples compared with the random assay technique. In this study, we aimed to verify whether the random assay technique can be applied in RIA and is feasible in daily practice. The coefficients of variation (CVs) of eight standard curves within a single kit were calculated in a CA-125 immunoradiometric assay (IRMA) for the reference of the practically ideal CV of the CA-125 kit. Ten standard curves of 10 kits from 2 prospectively collected lots (pLot) and 85 standard curves of 85 kits from 3 retrospectively collected lots (Lot) were obtained. Additionally, the raw measurement data of both 170 control references and 1123 patients' sera were collected retrospectively between December 2015 and January 2016. A standard curve of the first kit of each lot was used as a master standard curve for a random assay. The CVs of inter-kits were analyzed in each lot, respectively. All raw measurements were normalized by decay and radioactivity. The CA-125 values from control samples and patients' sera were compared using the original batch assay and random assay. In standard curve analysis, the CVs of inter-kits in pLots and Lots were comparable to those within a single kit. The CVs from the random assay with normalization were similar to those from the batch assay in the control samples (CVs % of low/high concentration; Lot1 2.71/1.91, Lot2 2.35/1.83, Lot3 2.83/2.08 vs. Lot1 2.05/1.21, Lot2 1.66/1.48, Lot3 2.41/2.14). The ICCs between the batch assay and random assay using patients' sera were satisfactory (Lot1 1.00, Lot2 0.999, Lot3 1.00). The random assay technique could be successfully applied to the conventional CA-125 IRMA kits. The random assay showed strong agreement with the batch assay. The

  4. STATISTICAL LANDMARKS AND PRACTICAL ISSUES REGARDING THE USE OF SIMPLE RANDOM SAMPLING IN MARKET RESEARCHES

    Directory of Open Access Journals (Sweden)

    CODRUŢA DURA

    2010-01-01

    Full Text Available The sample represents a particular segment of the statistical populationchosen to represent it as a whole. The representativeness of the sample determines the accuracyfor estimations made on the basis of calculating the research indicators and the inferentialstatistics. The method of random sampling is part of probabilistic methods which can be usedwithin marketing research and it is characterized by the fact that it imposes the requirementthat each unit belonging to the statistical population should have an equal chance of beingselected for the sampling process. When the simple random sampling is meant to be rigorouslyput into practice, it is recommended to use the technique of random number tables in order toconfigure the sample which will provide information that the marketer needs. The paper alsodetails the practical procedure implemented in order to create a sample for a marketingresearch by generating random numbers using the facilities offered by Microsoft Excel.

  5. Pseudo-Random Number Generation in Children with High-Functioning Autism and Asperger's Disorder: Further Evidence for a Dissociation in Executive Functioning?

    Science.gov (United States)

    Rinehart, Nicole J.; Bradshaw, John L.; Moss, Simon A.; Brereton, Avril V.; Tonge, Bruce J.

    2006-01-01

    The repetitive, stereotyped and obsessive behaviours, which are core diagnostic features of autism, are thought to be underpinned by executive dysfunction. This study examined executive impairment in individuals with autism and Asperger's disorder using a verbal equivalent of an established pseudo-random number generating task. Different patterns…

  6. Performance of medical residents in sterile techniques during central vein catheterization: randomized trial of efficacy of simulation-based training.

    Science.gov (United States)

    Khouli, Hassan; Jahnes, Katherine; Shapiro, Janet; Rose, Keith; Mathew, Joseph; Gohil, Amit; Han, Qifa; Sotelo, Andre; Jones, James; Aqeel, Adnan; Eden, Edward; Fried, Ethan

    2011-01-01

    Catheter-related bloodstream infection (CRBSI) is a preventable cause of a potentially lethal ICU infection. The optimal method to teach health-care providers correct sterile techniques during central vein catheterization (CVC) remains unclear. We randomly assigned second- and third-year internal medicine residents trained by a traditional apprenticeship model to simulation-based plus video training or video training alone from December 2007 to January 2008, with a follow-up period to examine CRBSI ending in July 2009. During the follow-up period, a simulation-based training program in sterile techniques during CVC was implemented in the medical ICU (MICU). A surgical ICU (SICU) where no residents received study interventions was used for comparison. The primary outcome measures were median residents' scores in sterile techniques and rates of CRBSI per 1,000 catheter-days. Of the 47 enrolled residents, 24 were randomly assigned to the simulation-based plus video training group and 23 to the video training group. Median baseline scores in both groups were equally poor: 12.5 to 13 (52%-54%) out of maximum score of 24 (P = .95; median difference, 0; 95% CI, 0.2-2.0). After training, median score was significantly higher for the simulation-based plus video training group: 22 (92%) vs 18 (75%) for the video training group (P training in sterile techniques during CVC is superior to traditional training or video training alone and is associated with decreased rate of CRBSI. Simulation-based training in CVC should be routinely used to reduce iatrogenic risk. ClinicalTrials.gov; No.: NCT00612131; URL: clinicaltrials.gov.

  7. Combinatorial techniques

    CERN Document Server

    Sane, Sharad S

    2013-01-01

    This is a basic text on combinatorics that deals with all the three aspects of the discipline: tricks, techniques and theory, and attempts to blend them. The book has several distinctive features. Probability and random variables with their interconnections to permutations are discussed. The theme of parity has been specially included and it covers applications ranging from solving the Nim game to the quadratic reciprocity law. Chapters related to geometry include triangulations and Sperner's theorem, classification of regular polytopes, tilings and an introduction to the Eulcidean Ramsey theory. Material on group actions covers Sylow theory, automorphism groups and a classification of finite subgroups of orthogonal groups. All chapters have a large number of exercises with varying degrees of difficulty, ranging from material suitable for Mathematical Olympiads to research.

  8. AFLP fragment isolation technique as a method to produce random sequences for single nucleotide polymorphism discovery in the green turtle, Chelonia mydas.

    Science.gov (United States)

    Roden, Suzanne E; Dutton, Peter H; Morin, Phillip A

    2009-01-01

    The green sea turtle, Chelonia mydas, was used as a case study for single nucleotide polymorphism (SNP) discovery in a species that has little genetic sequence information available. As green turtles have a complex population structure, additional nuclear markers other than microsatellites could add to our understanding of their complex life history. Amplified fragment length polymorphism technique was used to generate sets of random fragments of genomic DNA, which were then electrophoretically separated with precast gels, stained with SYBR green, excised, and directly sequenced. It was possible to perform this method without the use of polyacrylamide gels, radioactive or fluorescent labeled primers, or hybridization methods, reducing the time, expense, and safety hazards of SNP discovery. Within 13 loci, 2547 base pairs were screened, resulting in the discovery of 35 SNPs. Using this method, it was possible to yield a sufficient number of loci to screen for SNP markers without the availability of prior sequence information.

  9. Directed self-avoiding walks in random media

    International Nuclear Information System (INIS)

    Santra, S. B.; Seitz, W. A.; Klein, D. J.

    2001-01-01

    Two types of directed self-avoiding walks (SAW's), namely, three-choice directed SAW and outwardly directed SAW, have been studied on infinite percolation clusters on the square lattice in two dimensions. The walks on the percolation clusters are generated via a Monte Carlo technique. The longitudinal extension R N and the transverse fluctuation W N have been measured as a function of the number of steps N. Slight swelling is observed in the longitudinal direction on the random lattices. A crossover from shrinking to swelling of the transverse fluctuations is found at a certain length N c of the walks. The exponents related to the transverse fluctuations are seen to be unchanged in the random media even as the percolation threshold is reached. The scaling function form of the extensions are verified

  10. Estimation of Correlation Functions by Random Decrement

    DEFF Research Database (Denmark)

    Asmussen, J. C.; Brincker, Rune

    This paper illustrates how correlation functions can be estimated by the random decrement technique. Several different formulations of the random decrement technique, estimating the correlation functions are considered. The speed and accuracy of the different formulations of the random decrement...... and the length of the correlation functions. The accuracy of the estimates with respect to the theoretical correlation functions and the modal parameters are both investigated. The modal parameters are extracted from the correlation functions using the polyreference time domain technique....

  11. Vasectomy occlusion techniques for male sterilization.

    Science.gov (United States)

    Cook, L A; Vliet, H; Pun, A; Gallo, M F

    2004-01-01

    Vasectomy is an increasingly popular and effective family planning method. A variety of vasectomy techniques are used worldwide including various vas occlusion techniques (excision and ligation, thermal or electrocautery, and mechanical and chemical occlusion methods), vas irrigation and fascial interposition. Vasectomy guidelines largely rely on information from observational studies. Ideally, the choice of vasectomy techniques should be based on the best available evidence from randomized controlled trials. The objective of this review was to compare the effectiveness, safety, acceptability and costs of vasectomy techniques for male sterilization. We searched the computerized databases the Cochrane Central Register of Controlled Trials (CENTRAL), MEDLINE, EMBASE, Popline and LILACS. In addition, we searched the reference lists of relevant articles and book chapters. We included randomized controlled trials and controlled clinical trials comparing vasectomy techniques. We assessed all titles and abstracts located in the literature searches and two reviewers independently extracted articles identified for inclusion. Data were presented in the text of the review. Outcome measures include contraceptive efficacy, safety, discontinuation, and acceptability. Two trials compared vas occlusion with clips versus a conventional vasectomy technique; both were of poor quality. Neither trial found a difference between the two groups with regard to the primary outcome of failure to reach azoospermia. Four trials examined vas irrigation: three compared water irrigation with no irrigation and one compared water irrigation with euflavine. All of the trials were of poor quality. None of the trials found a significant difference between the groups with respect to the primary outcome of time to azoospermia. However, one trial found that the median number of ejaculations to azoospermia was significantly lower in the euflavine group compared to the water irrigation group. The one trial

  12. Method and apparstus for determining random coincidence count rate in a scintillation counter utilizing the coincidence technique

    International Nuclear Information System (INIS)

    Horrocks, D.L.

    1980-01-01

    A method and apparatus for the reliable determination of a random coincidence count attributable to chance coincidences of single-photon events which are each detected in only a single detector of a scintillation counter utilizing two detectors in a coincidence counting technique are described. A firstdelay device is employed to delay output pulses from one detector, and then the delayed signal is compared with the undelayed signal from the other detector in a coincidence circuit, to obtain an approximate random coincidence count. The output of the coincidence circuit is applied to an anti-coincidence circuit, where it is corrected by elimination of pulses coincident with, and attributable to, conventionally detected real coincidences, and by elimination of pulses coincident with, and attributable to, real coincidences that have been delayed by a second delay device having the same time parameter as the first. 8 claims

  13. Multiplex Ligation-Dependent Probe Amplification Technique for Copy Number Analysis on Small Amounts of DNA Material

    DEFF Research Database (Denmark)

    Sørensen, Karina; Andersen, Paal; Larsen, Lars

    2008-01-01

    The multiplex ligation-dependent probe amplification (MLPA) technique is a sensitive technique for relative quantification of up to 50 different nucleic acid sequences in a single reaction, and the technique is routinely used for copy number analysis in various syndromes and diseases. The aim...... of the study was to exploit the potential of MLPA when the DNA material is limited. The DNA concentration required in standard MLPA analysis is not attainable from dried blood spot samples (DBSS) often used in neonatal screening programs. A novel design of MLPA probes has been developed to permit for MLPA...... analysis on small amounts of DNA. Six patients with congenital adrenal hyperplasia (CAH) were used in this study. DNA was extracted from both whole blood and DBSS and subjected to MLPA analysis using normal and modified probes. Results were analyzed using GeneMarker and manual Excel analysis. A total...

  14. Measuring techniques in emission computed tomography

    International Nuclear Information System (INIS)

    Jordan, K.; Knoop, B.

    1988-01-01

    The chapter reviews the historical development of the emission computed tomography and its basic principles, proceeds to SPECT and PET, special techniques of emission tomography, and concludes with a comprehensive discussion of the mathematical fundamentals of the reconstruction and the quantitative activity determination in vivo, dealing with radon transformation and the projection slice theorem, methods of image reconstruction such as analytical and algebraic methods, limiting conditions in real systems such as limited number of measured data, noise enhancement, absorption, stray radiation, and random coincidence. (orig./HP) With 111 figs., 6 tabs [de

  15. Special quasirandom structures for binary/ternary group IV random alloys

    KAUST Repository

    Chroneos, Alexander I.

    2010-06-01

    Simulation of defect interactions in binary/ternary group IV semiconductor alloys at the density functional theory level is difficult due to the random distribution of the constituent atoms. The special quasirandom structures approach is a computationally efficient way to describe the random nature. We systematically study the efficacy of the methodology and generate a number of special quasirandom cells for future use. In order to demonstrate the applicability of the technique, the electronic structures of E centers in Si1-xGex and Si1-x -yGexSny alloys are discussed for a range of nearest neighbor environments. © 2010 Elsevier B.V. All rights reserved.

  16. Influence of the fast-processing technique on the number of the occlusal contacts and occlusal vertical dimension of complete dentures.

    Science.gov (United States)

    Atashrazm, Parsa; Alavijeh, Leila Zamani; Afshar, Maryam Sadat Sadrzadeh

    2011-03-01

    Occlusal errors during acryl processing affect the retention and stability of complete dentures. The aim of the present study was to assess the influence of a short curing technique on the number of occlusal contacts and the occlusal vertical dimension (OVD) of complete dentures. Complete dentures were prepared. The number of occlusal contacts was recorded in centric relation (CR) using 60 µ articulation paper. The OVD was recorded with the waxed trial denture in place. Dentures were then invested and processed with compression molding and short cure water bath technique. The number of occlusal contacts was recorded again. The amount of pin opening was measured for all of the complete dentures on the articulator. Data were analyzed with paired t-test to determine the alterations. The mean number of occlusal contacts before and after processing was 10.9 ± 2.4 and 6.3 ± 3.1 respectively (4.7 ± 1.9 decrease; p negative effect on the morphologic pattern of artificial teeth of complete dentures and thus should be used carefully.

  17. Synthesis of Polystyrene-Based Random Copolymers with Balanced Number of Basic or Acidic Functional Groups

    DEFF Research Database (Denmark)

    Dimitrov, Ivaylo; Jankova Atanasova, Katja; Hvilsted, Søren

    2010-01-01

    for the functionalization were applied. The first one involved direct functionalization of the template backbone through alkylation of the phenolic groups with suitable reagents. The second modification approach was based on "click" chemistry, where the introduction of alkyne groups onto the template backbone was followed......Pairs of polystyrene-based random copolymers with balanced number of pendant basic or acidic groups were synthesized utilizing the template strategy. The same poly[(4-hydroxystyrene)-ran-styrene] was used as a template backbone for modification. Two different synthetic approaches...... by copper-catalyzed 1,3 cycloaddition of aliphatic sulfonate- or amine-contaning azides. Both synthetic approaches proved to be highly efficient as evidenced by H-1-NMR analyses. The thermal properties were evaluated by differential scanning calorimetry and thermal gravimetric analyses and were influenced...

  18. Random forest predictive modeling of mineral prospectivity with small number of prospects and data with missing values in Abra (Philippines)

    Science.gov (United States)

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

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

    Directory of Open Access Journals (Sweden)

    Nicholas J. Sexton

    2014-07-01

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

  20. Use of Random and Site-Directed Mutagenesis to Probe Protein Structure-Function Relationships: Applied Techniques in the Study of Helicobacter pylori.

    Science.gov (United States)

    Whitmire, Jeannette M; Merrell, D Scott

    2017-01-01

    Mutagenesis is a valuable tool to examine the structure-function relationships of bacterial proteins. As such, a wide variety of mutagenesis techniques and strategies have been developed. This chapter details a selection of random mutagenesis methods and site-directed mutagenesis procedures that can be applied to an array of bacterial species. Additionally, the direct application of the techniques to study the Helicobacter pylori Ferric Uptake Regulator (Fur) protein is described. The varied approaches illustrated herein allow the robust investigation of the structural-functional relationships within a protein of interest.

  1. Anosov C-systems and random number generators

    Science.gov (United States)

    Savvidy, G. K.

    2016-08-01

    We further develop our previous proposal to use hyperbolic Anosov C-systems to generate pseudorandom numbers and to use them for efficient Monte Carlo calculations in high energy particle physics. All trajectories of hyperbolic dynamical systems are exponentially unstable, and C-systems therefore have mixing of all orders, a countable Lebesgue spectrum, and a positive Kolmogorov entropy. These exceptional ergodic properties follow from the C-condition introduced by Anosov. This condition defines a rich class of dynamical systems forming an open set in the space of all dynamical systems. An important property of C-systems is that they have a countable set of everywhere dense periodic trajectories and their density increases exponentially with entropy. Of special interest are the C-systems defined on higher-dimensional tori. Such C-systems are excellent candidates for generating pseudorandom numbers that can be used in Monte Carlo calculations. An efficient algorithm was recently constructed that allows generating long C-system trajectories very rapidly. These trajectories have good statistical properties and can be used for calculations in quantum chromodynamics and in high energy particle physics.

  2. Effect of manual therapy techniques on headache disability in patients with tension-type headache. Randomized controlled trial.

    Science.gov (United States)

    Espí-López, G V; Rodríguez-Blanco, C; Oliva-Pascual-Vaca, A; Benítez-Martínez, J C; Lluch, E; Falla, D

    2014-12-01

    Tension-type headache (TTH) is the most common type of primary headache however there is no clear evidence as to which specific treatment is most effective or whether combined treatment is more effective than individual treatments. To assess the effectiveness of manual therapy techniques, applied to the suboccipital region, on aspects of disability in a sample of patients with tension-type headache. Randomized Controlled Trial. Specialized centre for headache treatment. Seventy-six (62 women) patients (age: 39.9 ± 10.9 years) with episodic chronic TTH. Patients were randomly divided into four treatment groups: 1) suboccipital soft tissue inhibition; 2) occiput-atlas-axis manipulation; 3) combined treatment of both techniques; 4) control. Four sessions were applied over 4 weeks and disability was assessed before and after treatment using the Headache Disability Inventory (HDI). Headache frequency, severity and the functional and emotional subscales of the questionnaire were assessed. Photophobia, phonophobia and pericranial tenderness were also monitored. Headache frequency was significantly reduced with the manipulative and combined treatment (Ptreatment groups (Ptreatment also reduced the score on the emotional subscale of the HDI (Ptreatments were combined, effectiveness was noted for all aspects of disability and other symptoms including photophobia, phonophobia and pericranial tenderness. Although individual manual therapy treatments showed a positive change in headache features, measures of photophobia, photophobia and pericranial tenderness only improved in the group that received the combined treatment suggesting that combined treatment is the most appropriate for symptomatic relief of TTH.

  3. Decompounding random sums: A nonparametric approach

    DEFF Research Database (Denmark)

    Hansen, Martin Bøgsted; Pitts, Susan M.

    Observations from sums of random variables with a random number of summands, known as random, compound or stopped sums arise within many areas of engineering and science. Quite often it is desirable to infer properties of the distribution of the terms in the random sum. In the present paper we...... review a number of applications and consider the nonlinear inverse problem of inferring the cumulative distribution function of the components in the random sum. We review the existing literature on non-parametric approaches to the problem. The models amenable to the analysis are generalized considerably...

  4. Effect of apical clearing technique on the treatment outcome of teeth with asymptomatic apical periodontitis: A randomized clinical trial

    OpenAIRE

    Priya Mittal; Ajay Logani; Naseem Shah; R M Pandey

    2016-01-01

    Aim: This study aims to compare the periapical healing of teeth with asymptomatic apical periodontitis treated either by conventional apical preparation (CAP) or apical clearing technique (ACT). Materials and Methods: T wenty subjects with bilateral nonvital similar teeth exhibiting comparable periapical index (PAI) score were enrolled and randomly allocated. Group I (CAP, n = 20): Apical preparation three sizes greater (master apical file [MAF]) than the first binding file at the establis...

  5. Pseudo Random Coins Show More Heads Than Tails

    OpenAIRE

    Bauke, Heiko; Mertens, Stephan

    2003-01-01

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

  6. Simulation and study of small numbers of random events

    Science.gov (United States)

    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.

  7. Comparison of sampling techniques for use in SYVAC

    International Nuclear Information System (INIS)

    Dalrymple, G.J.

    1984-01-01

    The Stephen Howe review (reference TR-STH-1) recommended the use of a deterministic generator (DG) sampling technique for sampling the input values to the SYVAC (SYstems Variability Analysis Code) program. This technique was compared with Monte Carlo simple random sampling (MC) by taking a 1000 run case of SYVAC using MC as the reference case. The results show that DG appears relatively inaccurate for most values of consequence when used with 11 sample intervals. If 22 sample intervals are used then DG generates cumulative distribution functions that are statistically similar to the reference distribution. 400 runs of DG or MC are adequate to generate a representative cumulative distribution function. The MC technique appears to perform better than DG for the same number of runs. However, the DG predicts higher doses and in view of the importance of generating data in the high dose region this sampling technique with 22 sample intervals is recommended for use in SYVAC. (author)

  8. Counting problems for number rings

    NARCIS (Netherlands)

    Brakenhoff, Johannes Franciscus

    2009-01-01

    In this thesis we look at three counting problems connected to orders in number fields. First we study the probability that for a random polynomial f in Z[X] the ring Z[X]/f is the maximal order in Q[X]/f. Connected to this is the probability that a random polynomial has a squarefree

  9. The electron transport problem sampling by Monte Carlo individual collision technique

    International Nuclear Information System (INIS)

    Androsenko, P.A.; Belousov, V.I.

    2005-01-01

    The problem of electron transport is of most interest in all fields of the modern science. To solve this problem the Monte Carlo sampling has to be used. The electron transport is characterized by a large number of individual interactions. To simulate electron transport the 'condensed history' technique may be used where a large number of collisions are grouped into a single step to be sampled randomly. Another kind of Monte Carlo sampling is the individual collision technique. In comparison with condensed history technique researcher has the incontestable advantages. For example one does not need to give parameters altered by condensed history technique like upper limit for electron energy, resolution, number of sub-steps etc. Also the condensed history technique may lose some very important tracks of electrons because of its limited nature by step parameters of particle movement and due to weakness of algorithms for example energy indexing algorithm. There are no these disadvantages in the individual collision technique. This report presents some sampling algorithms of new version BRAND code where above mentioned technique is used. All information on electrons was taken from Endf-6 files. They are the important part of BRAND. These files have not been processed but directly taken from electron information source. Four kinds of interaction like the elastic interaction, the Bremsstrahlung, the atomic excitation and the atomic electro-ionization were considered. In this report some results of sampling are presented after comparison with analogs. For example the endovascular radiotherapy problem (P2) of QUADOS2002 was presented in comparison with another techniques that are usually used. (authors)

  10. Comparison of two extracorporeal shock wave therapy techniques for the treatment of painful subcalcaneal spur. A randomized controlled study.

    Science.gov (United States)

    Tornese, Davide; Mattei, Enrico; Lucchesi, Giampaolo; Bandi, Marco; Ricci, Gabriele; Melegati, Gianluca

    2008-09-01

    To describe and compare two extracorporeal shock wave therapy techniques for the treatment of painful subcalcaneal spur. Random assignment to two groups of treatment with two and eight months follow-up. The data were collected in outpatients. Forty-five subjects with a history of at least six months of heel pain were studied. Each subject received a three-session ultrasound-guided extracorporeal shock wave therapy (performed weekly). Perpendicular technique was used in group A (n=22, mean age 59.3 +/- 12 years) and tangential technique was used in group B (n= 23, mean age 58.8 +/- 12.3 years). Mayo Clinical Scoring System was used to evaluate each subject before the treatment and at two and eight months follow-up. Mayo Clinical Scoring System pretreatment scores were homogeneous between the groups (group A 55.2 +/-18.7; group B 53.5 +/- 20; P>0.05). In both groups there was a significant (Pwave therapy. The tangential technique was found to be better tolerated as regards treatment-induced pain, allowing higher energy dosages to be used.

  11. Discrete least squares polynomial approximation with random evaluations - application to PDEs with Random parameters

    KAUST Repository

    Nobile, Fabio

    2015-01-01

    the parameter-to-solution map u(y) from random noise-free or noisy observations in random points by discrete least squares on polynomial spaces. The noise-free case is relevant whenever the technique is used to construct metamodels, based on polynomial

  12. Reduced feedback opportunistic and layered random beamforming for MIMO-OFDMA systems

    OpenAIRE

    Han, C; Nicolaou, M; Doufexi, A; Armour, SMD

    2007-01-01

    This paper considers a number of techniques employed in opportunistic and layered random beamforming OFDMA schemes that aim to reduce the feedback required to perform scheduling whilst also minimising the throughput degradations resulting from this reduced throughput (due to the lack of full CSI at the Base Station (BS). Frequency response correlation among subcarriers can be exploited to group adjacent subcarriers into clusters which can then be treated as a single unit for feedback purposes...

  13. Topological relics of symmetry breaking: winding numbers and scaling tilts from random vortex–antivortex pairs

    International Nuclear Information System (INIS)

    Zurek, W H

    2013-01-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 〈W 2 〉 inversely proportional to ξ-hat , the typical size of the domain that can break symmetry in unison. (The dependence of ξ-hat on quench rate is predicted by KZM from critical exponents of the phase transition.) Thus, according to KZM, the dispersion √ 2 > scales as √(C/ ξ-hat ) for large W. 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 C (i.e., √ 2 > ∼ C). Scaling of the dispersion of W as well as of the probability of detection of non-zero W with C and ξ-hat 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/√( ξ-hat ), but as 1/ ξ-hat , which results in a doubling of the scaling of dispersion with the quench rate when compared to the large |W| regime. Moreover, the probability of trapping of non-zero W becomes approximately equal to 〈W 2 〉, and scales as 1/ ξ-hat 2 . This quadruples—as compared with √ 2 > ≃ √C/ξ-circumflex valid for large W—the exponent in the power law dependence of the frequency of trapping of |W| = 1 on ξ-hat when the probability of |W| > 1 is negligible. This change of the power law exponent by a factor of four—from 1/√( ξ-hat ) for the dispersion of large W to 1/ ξ-hat 2 for the frequency of non-zero W when |W| > 1 is negligibly rare—is of paramount importance for experimental tests of KZM. (paper)

  14. Exact simulation of Brown-Resnick random fields at a finite number of locations

    DEFF Research Database (Denmark)

    Dieker, Ton; Mikosch, Thomas Valentin

    2015-01-01

    We propose an exact simulation method for Brown-Resnick random fields, building on new representations for these stationary max-stable fields. The main idea is to apply suitable changes of measure.......We propose an exact simulation method for Brown-Resnick random fields, building on new representations for these stationary max-stable fields. The main idea is to apply suitable changes of measure....

  15. Effect of inter-crystal scatter on estimation methods for random coincidences and subsequent correction

    International Nuclear Information System (INIS)

    Torres-Espallardo, I; Spanoudaki, V; Ziegler, S I; Rafecas, M; McElroy, D P

    2008-01-01

    Random coincidences can contribute substantially to the background in positron emission tomography (PET). Several estimation methods are being used for correcting them. The goal of this study was to investigate the validity of techniques for random coincidence estimation, with various low-energy thresholds (LETs). Simulated singles list-mode data of the MADPET-II small animal PET scanner were used as input. The simulations have been performed using the GATE simulation toolkit. Several sources with different geometries have been employed. We evaluated the number of random events using three methods: delayed window (DW), singles rate (SR) and time histogram fitting (TH). Since the GATE simulations allow random and true coincidences to be distinguished, a comparison between the number of random coincidences estimated using the standard methods and the number obtained using GATE was performed. An overestimation in the number of random events was observed using the DW and SR methods. This overestimation decreases for LETs higher than 255 keV. It is additionally reduced when the single events which have undergone a Compton interaction in crystals before being detected are removed from the data. These two observations lead us to infer that the overestimation is due to inter-crystal scatter. The effect of this mismatch in the reconstructed images is important for quantification because it leads to an underestimation of activity. This was shown using a hot-cold-background source with 3.7 MBq total activity in the background region and a 1.59 MBq total activity in the hot region. For both 200 keV and 400 keV LET, an overestimation of random coincidences for the DW and SR methods was observed, resulting in approximately 1.5% or more (at 200 keV LET: 1.7% for DW and 7% for SR) and less than 1% (at 400 keV LET: both methods) underestimation of activity within the background region. In almost all cases, images obtained by compensating for random events in the reconstruction

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

    Science.gov (United States)

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

    2016-11-01

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

  17. Asymptotic Properties of Multistate Random Walks. II. Applications to Inhomogeneous Periodic and Random Lattices

    NARCIS (Netherlands)

    Roerdink, J.B.T.M.; Shuler, K.E.

    1985-01-01

    The previously developed formalism for the calculation of asymptotic properties of multistate random walks is used to study random walks on several inhomogeneous periodic lattices, where the periodically repeated unit cell contains a number of inequivalent sites, as well as on lattices with a random

  18. Randomized Item Response Theory Models

    NARCIS (Netherlands)

    Fox, Gerardus J.A.

    2005-01-01

    The randomized response (RR) technique is often used to obtain answers on sensitive questions. A new method is developed to measure latent variables using the RR technique because direct questioning leads to biased results. Within the RR technique is the probability of the true response modeled by

  19. Reduction of shunt obstructions by using a peel-away sheath technique? A multicenter prospective randomized trial.

    Science.gov (United States)

    Kehler, Uwe; Langer, Niels; Gliemroth, Jan; Meier, Ullrich; Lemcke, Johannes; Sprung, Christian; Schlosser, Hans-Georg; Kiefer, Michael; Eymann, Regina; Heese, Oliver

    2012-05-01

    Shunt obstructions may partly be caused by brain debris, which intrude into the ventricular catheter during ventricle puncture. Avoiding contact between the catheter and brain tissue, by using a peel-away sheath, should reduce the number of shunt failures caused by obstruction. To test this hypothesis, we conducted a randomized, prospective multicenter study. 201 patients from 6 different neurosurgical centers in Germany receiving a ventriculo-peritoneal shunt were included in this study. Of these, 177 patients completed a 1-year follow-up period. Surgery was randomized in a 1 to 1 fashion, such that out of 177 procedures, 91 were performed using a peel-away sheath and 86 were performed without. The rate of surgical re-interventions and shunt obstructions within a 12-month period was recorded. Within 1 year post-surgery, 17 shunt obstructions (9.6%) leading to shunt revisions were recorded. However, no difference was found between surgeries performed using a peel-away sheath (9.9%) or not (9.3%). The overall shunt infection rate was 2.8% and the shunt revision rate for overdrainage was 3.9%. The theoretical advantages attributed to the use of a peel-away sheath to introduce a ventricular catheter could not be confirmed in this randomized study, suggesting that the proposed role of brain debris in shunt obstructions may be overestimated. Copyright © 2011 Elsevier B.V. All rights reserved.

  20. The transverse spin-1 Ising model with random interactions

    Energy Technology Data Exchange (ETDEWEB)

    Bouziane, Touria [Department of Physics, Faculty of Sciences, University of Moulay Ismail, B.P. 11201 Meknes (Morocco)], E-mail: touria582004@yahoo.fr; Saber, Mohammed [Department of Physics, Faculty of Sciences, University of Moulay Ismail, B.P. 11201 Meknes (Morocco); Dpto. Fisica Aplicada I, EUPDS (EUPDS), Plaza Europa, 1, San Sebastian 20018 (Spain)

    2009-01-15

    The phase diagrams of the transverse spin-1 Ising model with random interactions are investigated using a new technique in the effective field theory that employs a probability distribution within the framework of the single-site cluster theory based on the use of exact Ising spin identities. A model is adopted in which the nearest-neighbor exchange couplings are independent random variables distributed according to the law P(J{sub ij})=p{delta}(J{sub ij}-J)+(1-p){delta}(J{sub ij}-{alpha}J). General formulae, applicable to lattices with coordination number N, are given. Numerical results are presented for a simple cubic lattice. The possible reentrant phenomenon displayed by the system due to the competitive effects between exchange interactions occurs for the appropriate range of the parameter {alpha}.

  1. Heat transfer in an axisymmetric stagnation flow at high Reynolds numbers on a cylinder using perturbation techniques

    International Nuclear Information System (INIS)

    Rahimi, A. B.

    2003-01-01

    Although there are many papers on the subject of heat transfer in an axisymmetric stagnation flow on a cylinder, the available knowledge is mainly for low Reynolds numbers and not much information exists for the same problem at large Reynolds numbers. In this work, the problem of heat transfer in an axisymmetric stagnation flow on a cylinder is solved at large Reynolds numbers using perturbation techniques. Starting from Navier-Stokes equations within a boundary layer approximation and using similarity transformations, the governing equations are obtained in the form of differential equations. The inverse of the Reynolds number is introduced as the perturbation parameter. This parameter appears in front of the highest-order terms and, as it tends to zero, reduces the order of the governing equations and produces singularities. In this paper, the flow field is divided into two regions; rapid changes in the region near wall and slow changes away from the wall. Thus, the flow is found to have dual-layer characteristics. Using inner and outer expansion produces uniform values of the relevant quantities

  2. Photon number projection using non-number-resolving detectors

    International Nuclear Information System (INIS)

    Rohde, Peter P; Webb, James G; Huntington, Elanor H; Ralph, Timothy C

    2007-01-01

    Number-resolving photo-detection is necessary for many quantum optics experiments, especially in the application of entangled state preparation. Several schemes have been proposed for approximating number-resolving photo-detection using non-number-resolving detectors. Such techniques include multi-port detection and time-division multiplexing. We provide a detailed analysis and comparison of different number-resolving detection schemes, with a view to creating a useful reference for experimentalists. We show that the ideal architecture for projective measurements is a function of the detector's dark count and efficiency parameters. We also describe a process for selecting an appropriate topology given actual experimental component parameters

  3. Variances in the projections, resulting from CLIMEX, Boosted Regression Trees and Random Forests techniques

    Science.gov (United States)

    Shabani, Farzin; Kumar, Lalit; Solhjouy-fard, Samaneh

    2017-08-01

    The aim of this study was to have a comparative investigation and evaluation of the capabilities of correlative and mechanistic modeling processes, applied to the projection of future distributions of date palm in novel environments and to establish a method of minimizing uncertainty in the projections of differing techniques. The location of this study on a global scale is in Middle Eastern Countries. We compared the mechanistic model CLIMEX (CL) with the correlative models MaxEnt (MX), Boosted Regression Trees (BRT), and Random Forests (RF) to project current and future distributions of date palm ( Phoenix dactylifera L.). The Global Climate Model (GCM), the CSIRO-Mk3.0 (CS) using the A2 emissions scenario, was selected for making projections. Both indigenous and alien distribution data of the species were utilized in the modeling process. The common areas predicted by MX, BRT, RF, and CL from the CS GCM were extracted and compared to ascertain projection uncertainty levels of each individual technique. The common areas identified by all four modeling techniques were used to produce a map indicating suitable and unsuitable areas for date palm cultivation for Middle Eastern countries, for the present and the year 2100. The four different modeling approaches predict fairly different distributions. Projections from CL were more conservative than from MX. The BRT and RF were the most conservative methods in terms of projections for the current time. The combination of the final CL and MX projections for the present and 2100 provide higher certainty concerning those areas that will become highly suitable for future date palm cultivation. According to the four models, cold, hot, and wet stress, with differences on a regional basis, appears to be the major restrictions on future date palm distribution. The results demonstrate variances in the projections, resulting from different techniques. The assessment and interpretation of model projections requires reservations

  4. Random walk of passive tracers among randomly moving obstacles.

    Science.gov (United States)

    Gori, Matteo; Donato, Irene; Floriani, Elena; Nardecchia, Ilaria; Pettini, Marco

    2016-04-14

    This study is mainly motivated by the need of understanding how the diffusion behavior of a biomolecule (or even of a larger object) is affected by other moving macromolecules, organelles, and so on, inside a living cell, whence the possibility of understanding whether or not a randomly walking biomolecule is also subject to a long-range force field driving it to its target. By means of the Continuous Time Random Walk (CTRW) technique the topic of random walk in random environment is here considered in the case of a passively diffusing particle among randomly moving and interacting obstacles. The relevant physical quantity which is worked out is the diffusion coefficient of the passive tracer which is computed as a function of the average inter-obstacles distance. The results reported here suggest that if a biomolecule, let us call it a test molecule, moves towards its target in the presence of other independently interacting molecules, its motion can be considerably slowed down.

  5. Analysis and Optimization of Sparse Random Linear Network Coding for Reliable Multicast Services

    DEFF Research Database (Denmark)

    Tassi, Andrea; Chatzigeorgiou, Ioannis; Roetter, Daniel Enrique Lucani

    2016-01-01

    Point-to-multipoint communications are expected to play a pivotal role in next-generation networks. This paper refers to a cellular system transmitting layered multicast services to a multicast group of users. Reliability of communications is ensured via different random linear network coding (RLNC......) techniques. We deal with a fundamental problem: the computational complexity of the RLNC decoder. The higher the number of decoding operations is, the more the user's computational overhead grows and, consequently, the faster the battery of mobile devices drains. By referring to several sparse RLNC...... techniques, and without any assumption on the implementation of the RLNC decoder in use, we provide an efficient way to characterize the performance of users targeted by ultra-reliable layered multicast services. The proposed modeling allows to efficiently derive the average number of coded packet...

  6. Assessment of Random Assignment in Training and Test Sets using Generalized Cluster Analysis Technique

    Directory of Open Access Journals (Sweden)

    Sorana D. BOLBOACĂ

    2011-06-01

    Full Text Available Aim: The properness of random assignment of compounds in training and validation sets was assessed using the generalized cluster technique. Material and Method: A quantitative Structure-Activity Relationship model using Molecular Descriptors Family on Vertices was evaluated in terms of assignment of carboquinone derivatives in training and test sets during the leave-many-out analysis. Assignment of compounds was investigated using five variables: observed anticancer activity and four structure descriptors. Generalized cluster analysis with K-means algorithm was applied in order to investigate if the assignment of compounds was or not proper. The Euclidian distance and maximization of the initial distance using a cross-validation with a v-fold of 10 was applied. Results: All five variables included in analysis proved to have statistically significant contribution in identification of clusters. Three clusters were identified, each of them containing both carboquinone derivatives belonging to training as well as to test sets. The observed activity of carboquinone derivatives proved to be normal distributed on every. The presence of training and test sets in all clusters identified using generalized cluster analysis with K-means algorithm and the distribution of observed activity within clusters sustain a proper assignment of compounds in training and test set. Conclusion: Generalized cluster analysis using the K-means algorithm proved to be a valid method in assessment of random assignment of carboquinone derivatives in training and test sets.

  7. Analytical system availability techniques

    NARCIS (Netherlands)

    Brouwers, J.J.H.; Verbeek, P.H.J.; Thomson, W.R.

    1987-01-01

    Analytical techniques are presented to assess the probability distributions and related statistical parameters of loss of production from equipment networks subject to random failures and repairs. The techniques are based on a theoretical model for system availability, which was further developed

  8. Ultrasound-Guided Out-of-Plane vs. In-Plane Interscalene Catheters: A Randomized, Prospective Study.

    Science.gov (United States)

    Schwenk, Eric S; Gandhi, Kishor; Baratta, Jaime L; Torjman, Marc; Epstein, Richard H; Chung, Jaeyoon; Vaghari, Benjamin A; Beausang, David; Bojaxhi, Elird; Grady, Bernadette

    2015-12-01

    Continuous interscalene blocks provide excellent analgesia after shoulder surgery. Although the safety of the ultrasound-guided in-plane approach has been touted, technical and patient factors can limit this approach. We developed a caudad-to-cephalad out-of-plane approach and hypothesized that it would decrease pain ratings due to better catheter alignment with the brachial plexus compared to the in-plane technique in a randomized, controlled study. To compare an out-of-plane interscalene catheter technique to the in-plane technique in a randomized clinical trial. Eighty-four patients undergoing open shoulder surgery were randomized to either the in-plane or out-of-plane ultrasound-guided continuous interscalene technique. The primary outcome was VAS pain rating at 24 hours. Secondary outcomes included pain ratings in the recovery room and at 48 hours, morphine consumption, the incidence of catheter dislodgments, procedure time, and block difficulty. Procedural data and all pain ratings were collected by blinded observers. There were no differences in the primary outcome of median VAS pain rating at 24 hours between the out-of-plane and in-plane groups (1.50; IQR, [0 - 4.38] vs. 1.25; IQR, [0 - 3.75]; P = 0.57). There were also no differences, respectively, between out-of-plane and in-plane median PACU pain ratings (1.0; IQR, [0 - 3.5] vs. 0.25; IQR, [0 - 2.5]; P = 0.08) and median 48-hour pain ratings (1.25; IQR, [1.25 - 2.63] vs. 0.50; IQR, [0 - 1.88]; P = 0.30). There were no differences in any other secondary endpoint. Our out-of-plane technique did not provide superior analgesia to the in-plane technique. It did not increase the number of complications. Our technique is an acceptable alternative in situations where the in-plane technique is difficult to perform.

  9. Comparative evaluation of gingival depigmentation by tetrafluroethane cryosurgery and surgical scalpel technique. A randomized clinical study

    Directory of Open Access Journals (Sweden)

    Suraj D Narayankar

    2017-01-01

    Full Text Available Introduction: Importance of good smile cannot be underestimated in enhancement of beauty, self-confidence and personality of a person. Health and appearance of gingiva is an essential part of attractive smile. Gingival pigmentation gives rise to unesthetic smile line. In present world, with increasing awareness to esthetic, people have become highly concerned about black gums. Various treatment modalities like abrasion, scrapping, scalpel technique, cryosurgery, electrosurgery and laser are available for treatment of gingival pigmentation. The present study was conducted with an objective of comparing efficacy of gingival depigmentation by cryosurgery and scalpel technique. Method: A Randomized control split mouth study was conducted for 25 patients with gingival pigmentation. Gingival pigmentation Index (GPI for pigmentation and Visual Analoug Scale (VAS for pain was evaluated for both test (Cryosurgery and control sites (Scalpel technique at baseline, 1month, 3months and 6 months. Results: GPI score was 3 and 2 for 21/25 and 4/25 control sites and was 22/25 and 3/25 test sites respectively at baseline. Both the groups showed significant reduction in GPI score i.e., 0 at 1 and 3 months interval after treatment. GPI score increased to 1 for 5/25 sites treated with scalpel technique and 2/25 sites treated with cryosurgery at 6 months interval (P=0.0691. This indicates recurrence rate for pigmentation is higher after scalpel treatment. VAS Score was 3 for 10/25 sites treated with scalpel and was 2 for 12/25 sites treated with cryosurgery (P<0.001. Conclusion: It can be concluded that cryosurgery can be effectively and efficiently used for depigmentation by keeping patients acceptance and comfort in mind and also the long term results and ease of use when compared to scalpel technique.

  10. The electron transport problem sampling by Monte Carlo individual collision technique

    Energy Technology Data Exchange (ETDEWEB)

    Androsenko, P.A.; Belousov, V.I. [Obninsk State Technical Univ. of Nuclear Power Engineering, Kaluga region (Russian Federation)

    2005-07-01

    The problem of electron transport is of most interest in all fields of the modern science. To solve this problem the Monte Carlo sampling has to be used. The electron transport is characterized by a large number of individual interactions. To simulate electron transport the 'condensed history' technique may be used where a large number of collisions are grouped into a single step to be sampled randomly. Another kind of Monte Carlo sampling is the individual collision technique. In comparison with condensed history technique researcher has the incontestable advantages. For example one does not need to give parameters altered by condensed history technique like upper limit for electron energy, resolution, number of sub-steps etc. Also the condensed history technique may lose some very important tracks of electrons because of its limited nature by step parameters of particle movement and due to weakness of algorithms for example energy indexing algorithm. There are no these disadvantages in the individual collision technique. This report presents some sampling algorithms of new version BRAND code where above mentioned technique is used. All information on electrons was taken from Endf-6 files. They are the important part of BRAND. These files have not been processed but directly taken from electron information source. Four kinds of interaction like the elastic interaction, the Bremsstrahlung, the atomic excitation and the atomic electro-ionization were considered. In this report some results of sampling are presented after comparison with analogs. For example the endovascular radiotherapy problem (P2) of QUADOS2002 was presented in comparison with another techniques that are usually used. (authors)

  11. Generalized hardware post-processing technique for chaos-based pseudorandom number generators

    KAUST Repository

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

    2013-01-01

    reported systems in the literature. The enhancement in the randomness is further examined in a simple image encryption application resulting in a better security performance. The system is verified through experiment on a Xilinx Virtex 4 FPGA

  12. A Novel Randomized Search Technique for Multiple Mobile Robot Paths Planning In Repetitive Dynamic Environment

    Directory of Open Access Journals (Sweden)

    Vahid Behravesh

    2012-08-01

    Full Text Available Presented article is studying the issue of path navigating for numerous robots. Our presented approach is based on both priority and the robust method for path finding in repetitive dynamic. Presented model can be generally implementable and useable: We do not assume any restriction regarding the quantity of levels of freedom for robots, and robots of diverse kinds can be applied at the same time. We proposed a random method and hill-climbing technique in the area based on precedence plans, which is used to determine a solution to a given trajectory planning problem and to make less the extent of total track. Our method plans trajectories for particular robots in the setting-time scope. Therefore, in order to specifying the interval of constant objects similar to other robots and the extent of the tracks which is traversed. For measuring the hazard for robots to conflict with each other it applied a method based on probability of the movements of robots. This algorithm applied to real robots with successful results. The proposed method performed and judged on both real robots and in simulation. We performed sequence of100tests with 8 robots for comparing with coordination method and current performances are effective. However, maximizing the performance is still possible. These performances estimations performed on Windows operating system and 3GHz Intel Pentium IV with and compiles with GCC 3.4. We used our PCGA robot for all experiments.  For a large environment of 19×15m2where we accomplished 40tests, our model is competent to plan high-quality paths in a severely short time (less than a second. Moreover, this article utilized lookup tables to keep expenses the formerly navigated robots made, increasing the number of robots don’t expand computation time.

  13. An algorithm for seeking the optimum value of a function: 'random' method; Un algorithme de recherche de l'optimum d'une fonction: la methode random

    Energy Technology Data Exchange (ETDEWEB)

    Guais, J C [Commissariat a l' Energie Atomique, Saclay (France). Centre d' Etudes Nucleaires

    1967-07-01

    After a brief survey of classical techniques for static optimization, we present a Random seeking method for any function, of an arbitrary number of variables, with constraints. The resulting program is shown and illustrated by some examples. The comparison with classical methods points out the advantages of Random in some cases where analytic procedures fail or require too much calculation time. (author) [French] Apres une rapide revue des differents procedes actuels d'optimisation statique, on expose une methode de recherche aleatoire du minimum (ou du maximum) d'une fonction quelconque, definie sur un nombre theoriquement illimite de parametres independants, avec contraintes. Le programme resultant est presente. Il est illustre par quelques exemples simples et compare a des methodes d'optimisation classiques; Ceci montre en particulier que le programme RANDOM permet une recherche aisee d'extrema dans certains cas ou d'autres programmes ne conduisent pas a des solutions satisfaisantes ou bien demandent un temps calcul prohibitif. (auteur)

  14. A prospective randomized controlled trial of the two-window technique without membrane versus the solo-window technique with membrane over the osteotomy window for maxillary sinus augmentation.

    Science.gov (United States)

    Yu, Huajie; He, Danqing; Qiu, Lixin

    2017-12-01

    Maturation of the grafted volume after lateral sinus elevation is crucial for the long-term survival of dental implants. To compare endo-sinus histomorphometric bone formation between the solo- and two-window maxillary sinus augmentation techniques with or without membrane coverage for the rehabilitation of multiple missing posterior teeth. Patients with severely atrophic posterior maxillae were randomized to receive lateral sinus floor elevation via the solo-window technique with membrane coverage (Control Group) or the two-window technique without coverage (Test Group). Six months after surgery, bone core specimens harvested from the lateral aspect were histomorphometrically analyzed. Ten patients in each group underwent 21 maxillary sinus augmentations. Histomorphometric analysis revealed mean newly formed bone values of 26.08 ± 16.23% and 27.14 ± 18.11%, mean connective tissue values of 59.34 ± 12.42% and 50.03 ± 17.13%, and mean residual graft material values of 14.6 ± 14.56% and 22.78 ± 10.83% in the Test and Control Groups, respectively, with no significant differences. The two-window technique obtained comparative maturation of the grafted volume even without membrane coverage, and is a viable alternative for the rehabilitation of severely atrophic posterior maxillae with multiple missing posterior teeth. © 2017 Wiley Periodicals, Inc.

  15. Teaching aseptic technique for central venous access under ultrasound guidance: a randomized trial comparing didactic training alone to didactic plus simulation-based training.

    Science.gov (United States)

    Latif, Rana K; Bautista, Alexander F; Memon, Saima B; Smith, Elizabeth A; Wang, Chenxi; Wadhwa, Anupama; Carter, Mary B; Akca, Ozan

    2012-03-01

    Our goal was to determine whether simulation combined with didactic training improves sterile technique during ultrasound (US)-guided central venous catheter (CVC) insertion compared with didactic training alone among novices. We hypothesized that novices who receive combined didactic and simulation-based training would perform similarly to experienced residents in aseptic technique, knowledge, and perception of comfort during US-guided CVC insertion on a simulator. Seventy-two subjects were enrolled in a randomized, controlled trial of an educational intervention. Fifty-four novices were randomized into either the didactic group or the simulation combined with didactic group. Both groups received didactic training but the simulation combined with didactic group also received simulation-based CVC insertion training. Both groups were tested by demonstrating US-guided CVC insertion on a simulator. Aseptic technique was scored on 8 steps as "yes/no" and also using a 7-point Likert scale with 7 being "excellent technique" by a rater blinded to subject randomization. After initial testing, the didactic group was offered simulation-based training and retesting. Both groups also took a pre- and posttraining test of knowledge and rated their comfort with US and CVC insertion pre- and posttraining on a 5-point Likert scale. Subsequently, 18 experienced residents also took the test of knowledge, rated their comfort level, and were scored while performing aseptic US-guided CVC insertion using a simulator. The simulation combined with didactic group achieved a 167% (95% confidence interval [CI] 133%-167%) incremental increase in yes/no scores and 115% (CI 112%-127%) incremental increase in Likert scale ratings on aseptic technique compared with novices in the didactic group. Compared with experienced residents, simulation combined with didactic trained novices achieved an increase in aseptic scores with a 33.3% (CI 16.7%-50%) increase in yes/no ratings and a 20% (CI 13

  16. Fully digital jerk-based chaotic oscillators for high throughput pseudo-random number generators up to 8.77Gbits/s

    KAUST Repository

    Mansingka, Abhinav S.

    2014-06-18

    This paper introduces fully digital implementations of four di erent systems in the 3rd order jerk-equation based chaotic family using the Euler approximation. The digitization approach enables controllable chaotic systems that reliably provide sinusoidal or chaotic output based on a selection input. New systems are introduced, derived using logical and arithmetic operations between two system implementations of different bus widths, with up to 100x higher maximum Lyapunov exponent than the original jerkequation based chaotic systems. The resulting chaotic output is shown to pass the NIST sp. 800-22 statistical test suite for pseudorandom number generators without post-processing by only eliminating the statistically defective bits. The systems are designed in Verilog HDL and experimentally verified on a Xilinx Virtex 4 FPGA for a maximum throughput of 15.59 Gbits/s for the native chaotic output and 8.77 Gbits/s for the resulting pseudo-random number generators.

  17. A versatile programmable CAMAC random pulse generator

    International Nuclear Information System (INIS)

    Abdel-Aal, R.E.

    1991-01-01

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

  18. MODIFIED TECHNIQUE OF TOTAL LARYNGECTOMY

    Directory of Open Access Journals (Sweden)

    Predrag Spirić

    2010-12-01

    Full Text Available Surgical technique of total laryngectomy is well presented in many surgical textbooks. Essentially, it has remained the same since Gluck an Soerensen in 1922 described all its details. Generally, it stresses the U shape skin incision with releasing laryngeal structures and removing larynx from up to down. Further, pharyngeal reconstruction is performed with different kinds of sutures in two or more layers and is finished with skin suture and suction drainage. One of worst complications following this surgery is pharyngocutaneous fistula (PF. Modifications proposed in this this article suggests vertical skin incision with larynx removal from below upwards. In pharyngeal reconstruction we used the running locked suture in submucosal plan with „tobacco sac“ at the end on the tongue base instead of traditional T shaped suture. Suction drains were not used.The aim of study was to present the modified surgical technique of total laryingectomy and its impact on hospital stay duration and pharyngocutanous fistula formation. In this randomized study we analyzed 49 patients operated with modified surgical technique compared to 49 patient operated with traditional surgical technique of total laryngectomy. The modified technique of total laryngectomy was presented. Using modified technique we managed to decrease the PF percentage from previous 20,41% to acceptable 8,16% (p=0,0334. Also, the average hospital stay was shortened from 14,96 to 10,63 days (t =-2.9850; p=0.0358.The modified technique of total laryngectomy is safe, short and efficient surgical intervention which decreases the number of pharyngocutaneos fistulas and shortens the hospital stay.

  19. Embedded Platform for Automatic Testing and Optimizing of FPGA Based Cryptographic True Random Number Generators

    Directory of Open Access Journals (Sweden)

    M. Varchola

    2009-12-01

    Full Text Available This paper deals with an evaluation platform for cryptographic True Random Number Generators (TRNGs based on the hardware implementation of statistical tests for FPGAs. It was developed in order to provide an automatic tool that helps to speed up the TRNG design process and can provide new insights on the TRNG behavior as it will be shown on a particular example in the paper. It enables to test sufficient statistical properties of various TRNG designs under various working conditions on the fly. Moreover, the tests are suitable to be embedded into cryptographic hardware products in order to recognize TRNG output of weak quality and thus increase its robustness and reliability. Tests are fully compatible with the FIPS 140 standard and are implemented by the VHDL language as an IP-Core for vendor independent FPGAs. A recent Flash based Actel Fusion FPGA was chosen for preliminary experiments. The Actel version of the tests possesses an interface to the Actel’s CoreMP7 softcore processor that is fully compatible with the industry standard ARM7TDMI. Moreover, identical tests suite was implemented to the Xilinx Virtex 2 and 5 in order to compare the performance of the proposed solution with the performance of already published one based on the same FPGAs. It was achieved 25% and 65% greater clock frequency respectively while consuming almost equal resources of the Xilinx FPGAs. On the top of it, the proposed FIPS 140 architecture is capable of processing one random bit per one clock cycle which results in 311.5 Mbps throughput for Virtex 5 FPGA.

  20. Generating and using truly random quantum states in Mathematica

    Science.gov (United States)

    Miszczak, Jarosław Adam

    2012-01-01

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

  1. Exploratory graph analysis: A new approach for estimating the number of dimensions in psychological research.

    Science.gov (United States)

    Golino, Hudson F; Epskamp, Sacha

    2017-01-01

    The estimation of the correct number of dimensions is a long-standing problem in psychometrics. Several methods have been proposed, such as parallel analysis (PA), Kaiser-Guttman's eigenvalue-greater-than-one rule, multiple average partial procedure (MAP), the maximum-likelihood approaches that use fit indexes as BIC and EBIC and the less used and studied approach called very simple structure (VSS). In the present paper a new approach to estimate the number of dimensions will be introduced and compared via simulation to the traditional techniques pointed above. The approach proposed in the current paper is called exploratory graph analysis (EGA), since it is based on the graphical lasso with the regularization parameter specified using EBIC. The number of dimensions is verified using the walktrap, a random walk algorithm used to identify communities in networks. In total, 32,000 data sets were simulated to fit known factor structures, with the data sets varying across different criteria: number of factors (2 and 4), number of items (5 and 10), sample size (100, 500, 1000 and 5000) and correlation between factors (orthogonal, .20, .50 and .70), resulting in 64 different conditions. For each condition, 500 data sets were simulated using lavaan. The result shows that the EGA performs comparable to parallel analysis, EBIC, eBIC and to Kaiser-Guttman rule in a number of situations, especially when the number of factors was two. However, EGA was the only technique able to correctly estimate the number of dimensions in the four-factor structure when the correlation between factors were .7, showing an accuracy of 100% for a sample size of 5,000 observations. Finally, the EGA was used to estimate the number of factors in a real dataset, in order to compare its performance with the other six techniques tested in the simulation study.

  2. The effect of a 3-month prevention program on the jump-landing technique in basketball: a randomized controlled trial.

    Science.gov (United States)

    Aerts, Inne; Cumps, Elke; Verhagen, Evert; Wuyts, Bram; Van De Gucht, Sam; Meeusen, Romain

    2015-02-01

    In jump-landing sports, the injury mechanism that most frequently results in an injury is the jump-landing movement. Influencing the movement patterns and biomechanical predisposing factors are supposed to decrease injury occurrence. To evaluate the influence of a 3-mo coach-supervised jump-landing prevention program on jump-landing technique using the jump-landing scoring (JLS) system. Randomized controlled trial. On-field. 116 athletes age 15-41 y, with 63 athletes in the control group and 53 athletes in the intervention group. The intervention program in this randomized control trial was administered at the start of the basketball season 2010-11. The jump-landing training program, supervised by the athletic trainers, was performed for a period of 3 mo. The jump-landing technique was determined by registering the jump-landing technique of all athletes with the JLS system, pre- and postintervention. After the prevention program, the athletes of the male and female intervention groups landed with a significantly less erect position than those in the control groups (P < .05). This was presented by a significant improvement in maximal hip flexion, maximal knee flexion, hip active range of motion, and knee active range of motion. Another important finding was that postintervention, knee valgus during landing diminished significantly (P < .05) in the female intervention group compared with their control group. Furthermore, the male intervention group significantly improved (P < .05) the scores of the JLS system from pre- to postintervention. Malalignments such as valgus position and insufficient knee flexion and hip flexion, previously identified as possible risk factors for lower-extremity injuries, improved significantly after the completion of the prevention program. The JLS system can help in identifying these malalignments. Therapy, prevention, level 1b.

  3. A combinatorial approach for analyzing the number of descendants ...

    African Journals Online (AJOL)

    This work is devoted to a study of the number of descendants of node j in random increasing trees, previously treated in [5, 8, 10, 15], and also to a study of the number of descendants of node j in pairs of random trees generated by a certain growth process generalizing the corresponding analysis of various classes of ...

  4. Chocolate Numbers

    OpenAIRE

    Ji, Caleb; Khovanova, Tanya; Park, Robin; Song, Angela

    2015-01-01

    In this paper, we consider a game played on a rectangular $m \\times n$ gridded chocolate bar. Each move, a player breaks the bar along a grid line. Each move after that consists of taking any piece of chocolate and breaking it again along existing grid lines, until just $mn$ individual squares remain. This paper enumerates the number of ways to break an $m \\times n$ bar, which we call chocolate numbers, and introduces four new sequences related to these numbers. Using various techniques, we p...

  5. Benefits of Reiki therapy for a severely neutropenic patient with associated influences on a true random number generator.

    Science.gov (United States)

    Morse, Melvin L; Beem, Lance W

    2011-12-01

    Reiki therapy is documented for relief of pain and stress. Energetic healing has been documented to alter biologic markers of illness such as hematocrit. True random number generators are reported to be affected by energy healers and spiritually oriented conscious awareness. The patient was a then 54-year-old severely ill man who had hepatitis C types 1 and 2 and who did not improve with conventional therapy. He also suffered from obesity, the metabolic syndrome, asthma, and hypertension. He was treated with experimental high-dose interferon/riboviron therapy with resultant profound anemia and neutropenia. Energetic healing and Reiki therapy was administered initially to enhance the patient's sense of well-being and to relieve anxiety. Possible effects on the patient's absolute neutrophil count and hematocrit were incidentally noted. Reiki therapy was then initiated at times of profound neutropenia to assess its possible effect on the patient's absolute neutrophil count (ANC). Reiki and other energetic healing sessions were monitored with a true random number generator (RNG). Statistically significant relationships were documented between Reiki therapy, a quieting of the electronically created white noise of the RNG during healing sessions, and improvement in the patient's ANC. The immediate clinical result was that the patient could tolerate the high-dose interferon regimen without missing doses because of absolute neutropenia. The patient was initially a late responder to interferon and had been given a 5% chance of clearing the virus. He remains clear of the virus 1 year after treatment. The association between changes in the RNG, Reiki therapy, and a patient's ANC is the first to the authors' knowledge in the medical literature. Future studies assessing the effects of energetic healing on specific biologic markers of disease are anticipated. Concurrent use of a true RNG may prove to correlate with the effectiveness of energetic therapy.

  6. Compositions, Random Sums and Continued Random Fractions of Poisson and Fractional Poisson Processes

    Science.gov (United States)

    Orsingher, Enzo; Polito, Federico

    2012-08-01

    In this paper we consider the relation between random sums and compositions of different processes. In particular, for independent Poisson processes N α ( t), N β ( t), t>0, we have that N_{α}(N_{β}(t)) stackrel{d}{=} sum_{j=1}^{N_{β}(t)} Xj, where the X j s are Poisson random variables. We present a series of similar cases, where the outer process is Poisson with different inner processes. We highlight generalisations of these results where the external process is infinitely divisible. A section of the paper concerns compositions of the form N_{α}(tauk^{ν}), ν∈(0,1], where tauk^{ν} is the inverse of the fractional Poisson process, and we show how these compositions can be represented as random sums. Furthermore we study compositions of the form Θ( N( t)), t>0, which can be represented as random products. The last section is devoted to studying continued fractions of Cauchy random variables with a Poisson number of levels. We evaluate the exact distribution and derive the scale parameter in terms of ratios of Fibonacci numbers.

  7. Arbitrary-step randomly delayed robust filter with application to boost phase tracking

    Science.gov (United States)

    Qin, Wutao; Wang, Xiaogang; Bai, Yuliang; Cui, Naigang

    2018-04-01

    The conventional filters such as extended Kalman filter, unscented Kalman filter and cubature Kalman filter assume that the measurement is available in real-time and the measurement noise is Gaussian white noise. But in practice, both two assumptions are invalid. To solve this problem, a novel algorithm is proposed by taking the following four steps. At first, the measurement model is modified by the Bernoulli random variables to describe the random delay. Then, the expression of predicted measurement and covariance are reformulated, which could get rid of the restriction that the maximum number of delay must be one or two and the assumption that probabilities of Bernoulli random variables taking the value one are equal. Next, the arbitrary-step randomly delayed high-degree cubature Kalman filter is derived based on the 5th-degree spherical-radial rule and the reformulated expressions. Finally, the arbitrary-step randomly delayed high-degree cubature Kalman filter is modified to the arbitrary-step randomly delayed high-degree cubature Huber-based filter based on the Huber technique, which is essentially an M-estimator. Therefore, the proposed filter is not only robust to the randomly delayed measurements, but robust to the glint noise. The application to the boost phase tracking example demonstrate the superiority of the proposed algorithms.

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

    International Nuclear Information System (INIS)

    Sagar, B.

    1989-01-01

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

  9. Random On-Board Pixel Sampling (ROPS) X-Ray Camera

    Energy Technology Data Exchange (ETDEWEB)

    Wang, Zhehui [Los Alamos; Iaroshenko, O. [Los Alamos; Li, S. [Los Alamos; Liu, T. [Fermilab; Parab, N. [Argonne (main); Chen, W. W. [Purdue U.; Chu, P. [Los Alamos; Kenyon, G. [Los Alamos; Lipton, R. [Fermilab; Sun, K.-X. [Nevada U., Las Vegas

    2017-09-25

    Recent advances in compressed sensing theory and algorithms offer new possibilities for high-speed X-ray camera design. In many CMOS cameras, each pixel has an independent on-board circuit that includes an amplifier, noise rejection, signal shaper, an analog-to-digital converter (ADC), and optional in-pixel storage. When X-ray images are sparse, i.e., when one of the following cases is true: (a.) The number of pixels with true X-ray hits is much smaller than the total number of pixels; (b.) The X-ray information is redundant; or (c.) Some prior knowledge about the X-ray images exists, sparse sampling may be allowed. Here we first illustrate the feasibility of random on-board pixel sampling (ROPS) using an existing set of X-ray images, followed by a discussion about signal to noise as a function of pixel size. Next, we describe a possible circuit architecture to achieve random pixel access and in-pixel storage. The combination of a multilayer architecture, sparse on-chip sampling, and computational image techniques, is expected to facilitate the development and applications of high-speed X-ray camera technology.

  10. Modal Analysis Based on the Random Decrement Transform

    DEFF Research Database (Denmark)

    Asmussen, J. C.; Brincker, Rune; Ibrahim, S. R.

    of this paper is to present a state-of-the-art description of the Random Decrement technique where the statistical theory is outlined and examples are given. But also new results such as estimation of frequency response functions and quality assessment are introduced. Special attention is given......During the last years several papers utilizing the Random Decrement transform as a basis for extraction of modal parameters from the response of linear systems subjected to unknown ambient loads have been presented. Although the Random Decrement technique was developed in a decade starting from...... the introduktion in 1968 the technique seems still to be attractive. This is probably due to the simplicity and the speed of the algorithm and the fact that the theory of the technique has been extended by introducing statistical measures such as correlation functions or spectral densities. The purpose...

  11. Production of large number of water-cooled excitation coils with improved techniques for multipole magnets of INDUS -2

    International Nuclear Information System (INIS)

    Karmarkar, M.G.; Sreeramulu, K.; Kulshreshta, P.K.

    2003-01-01

    Accelerator multipole magnets are characterized by high field gradients powered with relatively high current excitation coils. Due to space limitations in the magnet core/poles, compact coil geometry is also necessary. The coils are made of several insulated turns using hollow copper conductor. High current densities in these require cooling with low conductivity water. Additionally during operation, these are subjected to thermal fatigue stresses. A large number of coils ( Qty: 650 nos.) having different geometries were required for all multipole magnets like quadrupole (QP), sextupole (SP). Improved techniques for winding, insulation and epoxy consolidation were developed in-house at M D Lab and all coils have been successfully made. Improved technology, production techniques adopted for magnet coils and their inspection are briefly discussed in this paper. (author)

  12. Numbered head together with scientific approach in geometry learning

    Science.gov (United States)

    Indarti, Dwi; Mardiyana; Pramudya, Ikrar

    2017-12-01

    The aim of this research was to find out the influence of learning model implementation toward student’s achievement in mathematics. This research was using quasi-experimental research. The population of the research was all of 7th grade students in Karanganyar. Sample was taken using stratified cluster random sampling technique. The data collection has been conducted based on students’ mathematics achievement test. The results from the data analysis showed that the learning mathematics by using Numbered Head Together (NHT) learning model with scientific approach improved student’s achievement in mathematics rather than direct learning model particularly in learning object of quadrilateral. Implementation of NHT learning model with scientific approach could be used by the teachers in teaching and learning, particularly in learning object of quadrilateral.

  13. Efficacy of Manual Therapy Including Neurodynamic Techniques for the Treatment of Carpal Tunnel Syndrome: A Randomized Controlled Trial.

    Science.gov (United States)

    Wolny, Tomasz; Saulicz, Edward; Linek, Paweł; Shacklock, Michael; Myśliwiec, Andrzej

    2017-05-01

    The purpose of this randomized trial was to compare the efficacy of manual therapy, including the use of neurodynamic techniques, with electrophysical modalities on patients with mild and moderate carpal tunnel syndrome (CTS). The study included 140 CTS patients who were randomly assigned to the manual therapy (MT) group, which included the use of neurodynamic techniques, functional massage, and carpal bone mobilizations techniques, or to the electrophysical modalities (EM) group, which included laser and ultrasound therapy. Nerve conduction, pain severity, symptom severity, and functional status measured by the Boston Carpal Tunnel Questionnaire were assessed before and after treatment. Therapy was conducted twice weekly and both groups received 20 therapy sessions. A baseline assessment revealed group differences in sensory conduction of the median nerve (P < .01) but not in motor conduction (P = .82). Four weeks after the last treatment procedure, nerve conduction was examined again. In the MT group, median nerve sensory conduction velocity increased by 34% and motor conduction velocity by 6% (in both cases, P < .01). There was no change in median nerve sensory and motor conduction velocities in the EM. Distal motor latency was decreased (P < .01) in both groups. A baseline assessment revealed no group differences in pain severity, symptom severity, or functional status. Immediately after therapy, analysis of variance revealed group differences in pain severity (P < .01), with a reduction in pain in both groups (MT: 290%, P < .01; EM: 47%, P < .01). There were group differences in symptom severity (P < .01) and function (P < .01) on the Boston Carpal Tunnel Questionnaire. Both groups had an improvement in functional status (MT: 47%, P < .01; EM: 9%, P < .01) and a reduction in subjective CTS symptoms (MT: 67%, P < .01; EM: 15%, P < .01). Both therapies had a positive effect on nerve conduction, pain reduction, functional status, and subjective symptoms in

  14. Independent random sampling methods

    CERN Document Server

    Martino, Luca; Míguez, Joaquín

    2018-01-01

    This book systematically addresses the design and analysis of efficient techniques for independent random sampling. Both general-purpose approaches, which can be used to generate samples from arbitrary probability distributions, and tailored techniques, designed to efficiently address common real-world practical problems, are introduced and discussed in detail. In turn, the monograph presents fundamental results and methodologies in the field, elaborating and developing them into the latest techniques. The theory and methods are illustrated with a varied collection of examples, which are discussed in detail in the text and supplemented with ready-to-run computer code. The main problem addressed in the book is how to generate independent random samples from an arbitrary probability distribution with the weakest possible constraints or assumptions in a form suitable for practical implementation. The authors review the fundamental results and methods in the field, address the latest methods, and emphasize the li...

  15. Neutron fluctuations in a medium randomly varying in time

    International Nuclear Information System (INIS)

    Lenard, Pal; Imre, Pazsit

    2005-01-01

    The master equation approach, which has traditionally been used for the calculation of neutron fluctuations in zero power systems with constant parameters, is extended to a case when the parameters of the system change randomly in time. We consider a forward type master equation for the probability distribution of the number of particles in a multiplying system whose properties jump randomly between two discrete states, both with and without an external source. The first two factorial moments are calculated, including the covariance. This model can be considered the unification of stochastic methods that were used either in a constant multiplying medium via the master equation technique, or in a fluctuating medium via the Langevin technique. In contrast to these methods, the one presented here can calculate the inherent noise in time-varying systems. The results obtained show a much richer characteristics of the zero power noise than that in constant systems. Even the concept of criticality has to be given a probabilistic interpretation. The asymptotic behaviour of the variance will be also qualitatively different from that in constant systems. The covariance of the neutron number in a subcritical system with a source, and the corresponding power spectrum, shows both the inherent and parametrically induced noise components. The results are relevant in medium power subcritical systems where the zero power noise is still significant, but they also have a bearing on all types of branching processes, such as evolution of biological systems, spreading of epidemics etc., which are set in a time-varying environment. (authors)

  16. Neutron fluctuations in a medium randomly varying in time

    Energy Technology Data Exchange (ETDEWEB)

    Lenard, Pal [KFKI Atomic Energy Research Institute, Budapest (Hungary); Imre, Pazsit [Chalmers Univ. of Technology, Dept. of Nuclear Engineering, SE, Goteborg (Sweden)

    2005-07-01

    The master equation approach, which has traditionally been used for the calculation of neutron fluctuations in zero power systems with constant parameters, is extended to a case when the parameters of the system change randomly in time. We consider a forward type master equation for the probability distribution of the number of particles in a multiplying system whose properties jump randomly between two discrete states, both with and without an external source. The first two factorial moments are calculated, including the covariance. This model can be considered the unification of stochastic methods that were used either in a constant multiplying medium via the master equation technique, or in a fluctuating medium via the Langevin technique. In contrast to these methods, the one presented here can calculate the inherent noise in time-varying systems. The results obtained show a much richer characteristics of the zero power noise than that in constant systems. Even the concept of criticality has to be given a probabilistic interpretation. The asymptotic behaviour of the variance will be also qualitatively different from that in constant systems. The covariance of the neutron number in a subcritical system with a source, and the corresponding power spectrum, shows both the inherent and parametrically induced noise components. The results are relevant in medium power subcritical systems where the zero power noise is still significant, but they also have a bearing on all types of branching processes, such as evolution of biological systems, spreading of epidemics etc., which are set in a time-varying environment. (authors)

  17. Comparison of small-group training with self-directed internet-based training in inhaler techniques.

    Science.gov (United States)

    Toumas, Mariam; Basheti, Iman A; Bosnic-Anticevich, Sinthia Z

    2009-08-28

    To compare the effectiveness of small-group training in correct inhaler technique with self-directed Internet-based training. Pharmacy students were randomly allocated to 1 of 2 groups: small-group training (n = 123) or self-directed Internet-based training (n = 113). Prior to intervention delivery, all participants were given a placebo Turbuhaler and product information leaflet and received inhaler technique training based on their group. Technique was assessed following training and predictors of correct inhaler technique were examined. There was a significant improvement in the number of participants demonstrating correct technique in both groups (small group training, 12% to 63%; p training, 9% to 59%; p groups in the percent change (n = 234, p > 0.05). Increased student confidence following the intervention was a predictor for correct inhaler technique. Self-directed Internet-based training is as effective as small-group training in improving students' inhaler technique.

  18. Variational Infinite Hidden Conditional Random Fields

    NARCIS (Netherlands)

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

    2015-01-01

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

  19. Moving Target Techniques: Cyber Resilience throught Randomization, Diversity, and Dynamism

    Science.gov (United States)

    2017-03-03

    attacks. Simply put, these techniques turn systems into moving targets that will be hard for cyber attackers to compromise. MT techniques leverage...been diversified, they can attack it as if it was not diversified at all. Dynamic Data: Techniques in the dynamic data domain change the format

  20. Microbiological analysis after complete or partial removal of carious dentin using two different techniques in primary teeth: A randomized clinical trial

    Science.gov (United States)

    Singhal, Deepak Kumar; Acharya, Shashidhar; Thakur, Arun Singh

    2016-01-01

    Background: The management of deep carious lesions can be done by various techniques but residual caries dilemma still persists and bacterial reduction in cavities treated by either partial or complete caries removal techniques is debatable. So the objective of the present randomized clinical trial was to compare microbial counts in cavities submitted to complete caries removal and partial caries removal using either hand instruments or burs before and after 3 weeks of restoration. Materials and Methods: Primary molars with acute carious lesions in inner half of dentine and vital pulp were randomly divided into three groups of 14 each: Group A: Partial caries removal using hand instruments atraumatic restorative treatment (ART) only; Group B: Partial caries removal using bur; Group C: Complete caries removal using bur and caries detector dye. Dentine sample obtained after caries removal and 3 weeks after restoration, were subjected to microbial culture and counting (colony-forming units [CFU]/mg of dentine) for total viable bacterial count, Streptococcus spp., mutans streptococci, Lactobacillus spp. Results: Three techniques of caries removal showed significant (P < 0.05) reduction in all microorganisms studied after 3 weeks of evaluation, but there was no statistically significant difference in percentage reduction of microbial count among three groups. Conclusion: Results suggest the use of partial caries removal in a single session as compared to complete caries removal as a part of treatment of deep lesions in deciduous teeth in order to reduce the risk of pulp exposure. Partial caries removal using ART can be preferred for community settings as public health procedure for caries management. PMID:26962313

  1. Comparative short-term effects of two thoracic spinal manipulation techniques in subjects with chronic mechanical neck pain: a randomized controlled trial.

    Science.gov (United States)

    Casanova-Méndez, Amaloha; Oliva-Pascual-Vaca, Angel; Rodriguez-Blanco, Cleofás; Heredia-Rizo, Alberto Marcos; Gogorza-Arroitaonandia, Kristobal; Almazán-Campos, Ginés

    2014-08-01

    Spinal Manipulation (SM) has been purported to decrease pain and improve function in subjects with non-specific neck pain. Previous research has investigated which individuals with non-specific neck pain will be more likely to benefit from SM. It has not yet been proven whether or not the effectiveness of thoracic SM depends on the specific technique being used. This double-blind randomized trial has compared the short-term effects of two thoracic SM maneuvers in subjects with chronic non-specific neck pain. Sixty participants were distributed randomly into two groups. One group received the Dog technique (n = 30), with the subject in supine position, and the other group underwent the Toggle-Recoil technique (n = 30), with the participant lying prone, T4 being the targeted area in both cases. Evaluations were made of self-reported neck pain (Visual Analogue Scale); neck mobility (Cervical Range of Motion); and pressure pain threshold at the cervical and thoracic levels (C4 and T4 spinous process) and over the site described for location of tense bands of the upper trapezius muscle. Measurements were taken before intervention, immediately afterward, and 20 min later. Both maneuvers improved neck mobility and mechanosensitivity and reduced pain in the short term. No major or clinical differences were found between the groups. In the between-groups comparison slightly better results were observed in the Toggle-Recoil group only for cervical extension (p = 0.009), right lateral flexion (p = 0.004) and left rotation (p < 0.05). Copyright © 2014 Elsevier Ltd. All rights reserved.

  2. Random lasing in human tissues

    International Nuclear Information System (INIS)

    Polson, Randal C.; Vardeny, Z. Valy

    2004-01-01

    A random collection of scatterers in a gain medium can produce coherent laser emission lines dubbed 'random lasing'. We show that biological tissues, including human tissues, can support coherent random lasing when infiltrated with a concentrated laser dye solution. To extract a typical random resonator size within the tissue we average the power Fourier transform of random laser spectra collected from many excitation locations in the tissue; we verified this procedure by a computer simulation. Surprisingly, we found that malignant tissues show many more laser lines compared to healthy tissues taken from the same organ. Consequently, the obtained typical random resonator was found to be different for healthy and cancerous tissues, and this may lead to a technique for separating malignant from healthy tissues for diagnostic imaging

  3. Allgöwer-Donati Versus Vertical Mattress Suture Technique Impact on Perfusion in Ankle Fracture Surgery: A Randomized Clinical Trial Using Intraoperative Angiography.

    Science.gov (United States)

    Shannon, Steven F; Houdek, Matthew T; Wyles, Cody C; Yuan, Brandon J; Cross, William W; Cass, Joseph R; Sems, Stephen A

    2017-02-01

    The purpose of this study was to evaluate which primary wound closure technique for ankle fractures affords the most robust perfusion as measured by laser-assisted indocyanine green angiography: Allgöwer-Donati or vertical mattress. Prospective, randomized. Level 1 Academic Trauma Center. Thirty patients undergoing open reduction internal fixation for ankle fractures were prospectively randomized to Allgöwer-Donati (n = 15) or vertical mattress (n = 15) closure. Demographics were similar for both cohorts with respect to age, sex, body mass index, surgical timing, and OTA/AO fracture classification. Skin perfusion (mean incision perfusion and mean perfusion impairment) was quantified in fluorescence units with laser-assisted indocyanine green angiography along the lateral incision as well as anterior and posterior to the incision at 30 separate locations. Minimum follow-up was 3 months with a mean follow-up 4.7 months. Allgöwer-Donati enabled superior perfusion compared with the vertical mattress suture technique. Mean incision perfusion for Allgöwer-Donati was 51 (SD = 13) and for vertical mattress was 28 (SD = 10, P ankle fractures. Theoretically, this may enhance soft tissue healing and decrease the risk of wound complications. Surgeons may take this into consideration when deciding closure techniques for ankle fractures. Therapeutic Level I. See Instructions for Authors for a complete description of levels of evidence.

  4. A randomized controlled trial of nasolaryngoscopy training techniques.

    Science.gov (United States)

    Smith, Matthew E; Leung, Billy C; Sharma, Rishi; Nazeer, Sammar; McFerran, Don J

    2014-09-01

    Flexible nasolaryngoscopy is an essential skill for otolaryngology trainees to develop, but there is a lack of standardized training for this procedure. The aim of this study was to assess whether using training on a realistic human mannequin together with structured video feedback improved trainees' performance at flexible nasolaryngoscopy. Three-armed, single-blinded, randomized controlled study. Thirty-six junior doctors and final-year medical students were randomly allocated to one of three groups. All received a lecture and video presentation on flexible nasolaryngoscopy. One group received additional tuition using a training mannequin. The last group received mannequin training and feedback on their performance using a video recording. The trainees then undertook flexible nasolaryngoscopy on volunteers with these endoscopies recorded. Blinded observers scored the trainees on a range of objective and subjective measures. The volunteers who were also blinded to the candidates' training scored the comfort of the procedure. Adding mannequin training showed a trend toward improvement of performance but did not reach statistical significance. Mannequin training together with video feedback produced significant performance improvement in patient comfort (P = .0065), time to reach the vocal folds (P = .017), and global ability (P = .0006). Inter-rater reliability was excellent with P training using an anatomically correct model of the upper airway together with formalized video-assisted feedback on that training is a simple and effective way to improve endoscopy skills prior to starting flexible nasolaryngoscopy on patients. © 2014 The American Laryngological, Rhinological and Otological Society, Inc.

  5. Collocation methods for uncertainty quanti cation in PDE models with random data

    KAUST Repository

    Nobile, Fabio

    2014-01-06

    In this talk we consider Partial Differential Equations (PDEs) whose input data are modeled as random fields to account for their intrinsic variability or our lack of knowledge. After parametrizing the input random fields by finitely many independent random variables, we exploit the high regularity of the solution of the PDE as a function of the input random variables and consider sparse polynomial approximations in probability (Polynomial Chaos expansion) by collocation methods. We first address interpolatory approximations where the PDE is solved on a sparse grid of Gauss points in the probability space and the solutions thus obtained interpolated by multivariate polynomials. We present recent results on optimized sparse grids in which the selection of points is based on a knapsack approach and relies on sharp estimates of the decay of the coefficients of the polynomial chaos expansion of the solution. Secondly, we consider regression approaches where the PDE is evaluated on randomly chosen points in the probability space and a polynomial approximation constructed by the least square method. We present recent theoretical results on the stability and optimality of the approximation under suitable conditions between the number of sampling points and the dimension of the polynomial space. In particular, we show that for uniform random variables, the number of sampling point has to scale quadratically with the dimension of the polynomial space to maintain the stability and optimality of the approximation. Numerical results show that such condition is sharp in the monovariate case but seems to be over-constraining in higher dimensions. The regression technique seems therefore to be attractive in higher dimensions.

  6. Advantages of Arthroscopic Rotator Cuff Repair With a Transosseous Suture Technique: A Prospective Randomized Controlled Trial.

    Science.gov (United States)

    Randelli, Pietro; Stoppani, Carlo Alberto; Zaolino, Carlo; Menon, Alessandra; Randelli, Filippo; Cabitza, Paolo

    2017-07-01

    Rotator cuff tear is a common finding in patients with painful, poorly functioning shoulders. The surgical management of this disorder has improved greatly and can now be fully arthroscopic. To evaluate clinical and radiological results of arthroscopic rotator cuff repair using 2 different techniques: single-row anchor fixation versus transosseous hardware-free suture repair. Randomized controlled trial; Level of evidence, 1. Sixty-nine patients with rotator cuff tears were enrolled: 35 patients were operated with metal anchors and 34 with standardized transosseous repair. The patients were clinically evaluated before surgery, during the 28 days after surgery, and at least 1 year after the operation by the use of validated rating scores (Constant score, QuickDASH, and numerical rating scale [NRS]). Final follow-up was obtained at more than 3 years by a QuickDASH evaluation to detect any difference from the previous follow-up. During the follow-up, rotator cuff integrity was determined through magnetic resonance imaging and was classified according to the 5 Sugaya categories. Patients operated with the transosseous technique had significantly less pain, especially from the 15th postoperative day: In the third week, the mean NRS value for the anchor group was 3.00 while that for transosseous group was 2.46 ( P = .02); in the fourth week, the values were 2.44 and 1.76, respectively ( P rotator cuff repair integrity, based on Sugaya magnetic resonance imaging classification, no significant difference was found between the 2 techniques in terms of retear rate ( P = .81). No significant differences were found between the 2 arthroscopic repair techniques in terms of functional and radiological results. However, postoperative pain decreased more quickly after the transosseous procedure, which therefore emerges as a possible improvement in the surgical repair of the rotator cuff. Registration: NCT01815177 ( ClinicalTrials.gov identifier).

  7. Determination of the optimal number of components in independent components analysis.

    Science.gov (United States)

    Kassouf, Amine; Jouan-Rimbaud Bouveresse, Delphine; Rutledge, Douglas N

    2018-03-01

    Independent components analysis (ICA) may be considered as one of the most established blind source separation techniques for the treatment of complex data sets in analytical chemistry. Like other similar methods, the determination of the optimal number of latent variables, in this case, independent components (ICs), is a crucial step before any modeling. Therefore, validation methods are required in order to decide about the optimal number of ICs to be used in the computation of the final model. In this paper, three new validation methods are formally presented. The first one, called Random_ICA, is a generalization of the ICA_by_blocks method. Its specificity resides in the random way of splitting the initial data matrix into two blocks, and then repeating this procedure several times, giving a broader perspective for the selection of the optimal number of ICs. The second method, called KMO_ICA_Residuals is based on the computation of the Kaiser-Meyer-Olkin (KMO) index of the transposed residual matrices obtained after progressive extraction of ICs. The third method, called ICA_corr_y, helps to select the optimal number of ICs by computing the correlations between calculated proportions and known physico-chemical information about samples, generally concentrations, or between a source signal known to be present in the mixture and the signals extracted by ICA. These three methods were tested using varied simulated and experimental data sets and compared, when necessary, to ICA_by_blocks. Results were relevant and in line with expected ones, proving the reliability of the three proposed methods. Copyright © 2017 Elsevier B.V. All rights reserved.

  8. Comparison of the effectiveness of three manual physical therapy techniques in a subgroup of patients with low back pain who satisfy a clinical prediction rule: Study protocol of a randomized clinical trial [NCT00257998

    Directory of Open Access Journals (Sweden)

    Childs John D

    2006-02-01

    Full Text Available Abstract Background Recently a clinical prediction rule (CPR has been developed and validated that accurately identifies patients with low back pain (LBP that are likely to benefit from a lumbo-pelvic thrust manipulation. The studies that developed and validated the rule used the identical manipulation procedure. However, recent evidence suggests that different manual therapy techniques may result similar outcomes. The purpose of this study is to investigate the effectiveness of three different manual therapy techniques in a subgroup of patient with low back pain that satisfy the CPR. Methods/Design Consecutive patients with LBP referred to physical therapy clinics in one of four geographical locations who satisfy the CPR will be invited to participate in this randomized clinical trial. Subjects who agree to participate will undergo a standard evaluation and complete a number of patient self-report questionnaires including the Oswestry Disability Index (OSW, which will serve as the primary outcome measure. Following the baseline examination patients will be randomly assigned to receive the lumbopelvic manipulation used in the development of the CPR, an alternative lumbar manipulation technique, or non-thrust lumbar mobilization technique for the first 2 visits. Beginning on visit 3, all 3 groups will receive an identical standard exercise program for 3 visits (visits 3,4,5. Outcomes of interest will be captured by a therapist blind to group assignment at 1 week (3rd visit, 4 weeks (6th visit and at a 6-month follow-up. The primary aim of the study will be tested with analysis of variance (ANOVA using the change in OSW score from baseline to 4-weeks (OSWBaseline – OSW4-weeks as the dependent variable. The independent variable will be treatment with three levels (lumbo-pelvic manipulation, alternative lumbar manipulation, lumbar mobilization. Discussion This trial will be the first to investigate the effectiveness of various manual therapy

  9. Random sets and random fuzzy sets as ill-perceived random variables an introduction for Ph.D. students and practitioners

    CERN Document Server

    Couso, Inés; Sánchez, Luciano

    2014-01-01

    This short book provides a unified view of the history and theory of random sets and fuzzy random variables, with special emphasis on its use for representing higher-order non-statistical uncertainty about statistical experiments. The authors lay bare the existence of two streams of works using the same mathematical ground, but differing form their use of sets, according to whether they represent objects of interest naturally taking the form of sets, or imprecise knowledge about such objects. Random (fuzzy) sets can be used in many fields ranging from mathematical morphology, economics, artificial intelligence, information processing and statistics per se, especially in areas where the outcomes of random experiments cannot be observed with full precision. This book also emphasizes the link between random sets and fuzzy sets with some techniques related to the theory of imprecise probabilities. This small book is intended for graduate and doctoral students in mathematics or engineering, but also provides an i...

  10. Piezoelectric Versus Conventional Rotary Techniques for Impacted Third Molar Extraction

    Science.gov (United States)

    Jiang, Qian; Qiu, Yating; Yang, Chi; Yang, Jingyun; Chen, Minjie; Zhang, Zhiyuan

    2015-01-01

    Abstract Impacted third molars are frequently encountered in clinical work. Surgical removal of impacted third molars is often required to prevent clinical symptoms. Traditional rotary cutting instruments are potentially injurious, and piezosurgery, as a new osteotomy technique, has been introduced in oral and maxillofacial surgery. No consistent conclusion has been reached regarding whether this new technique is associated with fewer or less severe postoperative sequelae after third molar extraction. The aim of this study was to compare piezosurgery with rotary osteotomy techniques, with regard to surgery time and the severity of postoperative sequelae, including pain, swelling, and trismus. We conducted a systematic literature search in the Cochrane Library, PubMed, Embase, and Google Scholar. The eligibility criteria of this study included the following: the patients were clearly diagnosed as having impacted mandibular third molars; the patients underwent piezosurgery osteotomy, and in the control group rotary osteotomy techniques, for removing impacted third molars; the outcomes of interest include surgery time, trismus, swelling or pain; the studies are randomized controlled trials. We used random-effects models to calculate the difference in the outcomes, and the corresponding 95% confidence interval. We calculated the weighted mean difference if the trials used the same measurement, and a standardized mean difference if otherwise. A total of seven studies met the eligibility criteria and were included in our analysis. Compared with rotary osteotomy, patients undergoing piezosurgery experienced longer surgery time (mean difference 4.13 minutes, 95% confidence interval 2.75–5.52, P piezosurgery groups. The number of included randomized controlled trials and the sample size of each trial were relatively small, double blinding was not possible, and cost analysis was unavailable due to a lack of data. Our meta-analysis indicates that although patients

  11. Benford's law and continuous dependent random variables

    Science.gov (United States)

    Becker, Thealexa; Burt, David; Corcoran, Taylor C.; Greaves-Tunnell, Alec; Iafrate, Joseph R.; Jing, Joy; Miller, Steven J.; Porfilio, Jaclyn D.; Ronan, Ryan; Samranvedhya, Jirapat; Strauch, Frederick W.; Talbut, Blaine

    2018-01-01

    Many mathematical, man-made and natural systems exhibit a leading-digit bias, where a first digit (base 10) of 1 occurs not 11% of the time, as one would expect if all digits were equally likely, but rather 30%. This phenomenon is known as Benford's Law. Analyzing which datasets adhere to Benford's Law and how quickly Benford behavior sets in are the two most important problems in the field. Most previous work studied systems of independent random variables, and relied on the independence in their analyses. Inspired by natural processes such as particle decay, we study the dependent random variables that emerge from models of decomposition of conserved quantities. We prove that in many instances the distribution of lengths of the resulting pieces converges to Benford behavior as the number of divisions grow, and give several conjectures for other fragmentation processes. The main difficulty is that the resulting random variables are dependent. We handle this by using tools from Fourier analysis and irrationality exponents to obtain quantified convergence rates as well as introducing and developing techniques to measure and control the dependencies. The construction of these tools is one of the major motivations of this work, as our approach can be applied to many other dependent systems. As an example, we show that the n ! entries in the determinant expansions of n × n matrices with entries independently drawn from nice random variables converges to Benford's Law.

  12. Infinite hidden conditional random fields for human behavior analysis.

    Science.gov (United States)

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

    2013-01-01

    Hidden conditional random fields (HCRFs) are discriminative latent variable models that have been shown to successfully learn the hidden structure of a given classification problem (provided an appropriate validation of the number of hidden states). In this brief, we present the infinite HCRF (iHCRF), which is a nonparametric model based on hierarchical Dirichlet processes and is capable of automatically learning the optimal number of hidden states for a classification task. We show how we learn the model hyperparameters with an effective Markov-chain Monte Carlo sampling technique, and we explain the process that underlines our iHCRF model with the Restaurant Franchise Rating Agencies analogy. We show that the iHCRF is able to converge to a correct number of represented hidden states, and outperforms the best finite HCRFs--chosen via cross-validation--for the difficult tasks of recognizing instances of agreement, disagreement, and pain. Moreover, the iHCRF manages to achieve this performance in significantly less total training, validation, and testing time.

  13. Randomized controlled trial of yogic meditation techniques for patients with obsessive-compulsive disorder.

    Science.gov (United States)

    Shannahoff-Khalsa, D S; Ray, L E; Levine, S; Gallen, C C; Schwartz, B J; Sidorowich, J J

    1999-12-01

    The objective of this study was to compare efficacy of two meditation protocols for treating patients with obsessive-compulsive disorder (OCD). Patients were randomized to two groups-matched for sex, age, and medication status-and blinded to the comparison protocol. They were told the trial would last for 12 months, unless one protocol proved to be more efficacious. If so, groups would merge, and the group that received the less efficacious treatment would also be afforded 12 months of the more effective one. The study was conducted at Children's Hospital, San Diego, Calif. Patients were selected according to Diagnostic and Statistical Manual of Mental Disorders, Third Edition-Revised (DSM-III-R) criteria and recruited by advertisements and referral. At baseline, Group 1 included 11 adults and 1 adolescent, and Group 2 included 10 adults. Group 1 employed a kundalini yoga meditation protocol and Group 2 employed the Relaxation Response plus Mindfulness Meditation technique. Baseline and 3-month interval testing was conducted using the Yale-Brown Obsessive Compulsive Scale (Y-BOCS), Symptoms Checklist-90-Revised Obsessive Compulsive (SCL-90-R OC) and Global Severity Index (SCL-90-R GSI) scales, Profile of Moods scale (POMS), Perceived Stress Scale (PSS), and Purpose in Life (PIL) test. Seven adults in each group completed 3 months of therapy. At 3 months, Group 1 demonstrated greater improvements (Student's independent groups t-test) on the Y-BOCS, SCL-90-R OC and GSI scales, and POMS, and greater but nonsignificant improvements on the PSS and PIL test. An intent-to-treat analysis (Y-BOCS) for the baseline and 3-month tests showed that only Group 1 improved. Within-group statistics (Student's paired t-tests) showed that Group 1 significantly improved on all six scales, but Group 2 had no improvements. Groups were merged for an additional year using Group 1 techniques. At 15 months, the final group (N=11) improved 71%, 62%, 66%, 74%, 39%, and 23%, respectively, on

  14. High-resolution wave number spectrum using multi-point measurements in space – the Multi-point Signal Resonator (MSR technique

    Directory of Open Access Journals (Sweden)

    Y. Narita

    2011-02-01

    Full Text Available A new analysis method is presented that provides a high-resolution power spectrum in a broad wave number domain based on multi-point measurements. The analysis technique is referred to as the Multi-point Signal Resonator (MSR and it benefits from Capon's minimum variance method for obtaining the proper power spectral density of the signal as well as the MUSIC algorithm (Multiple Signal Classification for considerably reducing the noise part in the spectrum. The mathematical foundation of the analysis method is presented and it is applied to synthetic data as well as Cluster observations of the interplanetary magnetic field. Using the MSR technique for Cluster data we find a wave in the solar wind propagating parallel to the mean magnetic field with relatively small amplitude, which is not identified by the Capon spectrum. The Cluster data analysis shows the potential of the MSR technique for studying waves and turbulence using multi-point measurements.

  15. Autonomous Byte Stream Randomizer

    Science.gov (United States)

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

    2013-01-01

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

  16. An unbiased estimator of the variance of simple random sampling using mixed random-systematic sampling

    OpenAIRE

    Padilla, Alberto

    2009-01-01

    Systematic sampling is a commonly used technique due to its simplicity and ease of implementation. The drawback of this simplicity is that it is not possible to estimate the design variance without bias. There are several ways to circumvent this problem. One method is to suppose that the variable of interest has a random order in the population, so the sample variance of simple random sampling without replacement is used. By means of a mixed random - systematic sample, an unbiased estimator o...

  17. Low-Intensity Wheelchair Training in Inactive People with Long-Term Spinal Cord Injury: A Randomized Controlled Trial on Propulsion Technique.

    Science.gov (United States)

    van der Scheer, Jan W; de Groot, Sonja; Vegter, Riemer J K; Hartog, Johanneke; Tepper, Marga; Slootman, Hans; Veeger, DirkJan H E J; van der Woude, Lucas H V

    2015-11-01

    The objective of this study was to investigate the effects of a low-intensity wheelchair training on propulsion technique in inactive people with long-term spinal cord injury. Participants in this multicenter nonblinded randomized controlled trial were inactive manual wheelchair users with spinal cord injury for at least 10 yrs (N = 29), allocated to exercise (n = 14) or no exercise. The 16-wk training consisted of wheelchair treadmill propulsion at 30%-40% heart rate reserve or equivalent in rate of perceived exertion, twice a week, 30 mins per session. Propulsion technique was assessed at baseline as well as after 8, 16, and 42 wks during two submaximal treadmill-exercise blocks using a measurement wheel attached to a participant's own wheelchair. Changes over time between the groups were analyzed using Mann-Whitney U tests on difference scores (P propulsion technique were not found in this group. Perhaps, substantial effects require a higher intensity or frequency. Investigating whether more effective and feasible interventions exist might help reduce the population's risk of upper-body joint damage during daily wheelchair propulsion.

  18. Randomization of inspections

    International Nuclear Information System (INIS)

    Markin, J.T.

    1989-01-01

    As the numbers and complexity of nuclear facilities increase, limitations on resources for international safeguards may restrict attainment of safeguards goals. One option for improving the efficiency of limited resources is to expand the current inspection regime to include random allocation of the amount and frequency of inspection effort to material strata or to facilities. This paper identifies the changes in safeguards policy, administrative procedures, and operational procedures that would be necessary to accommodate randomized inspections and identifies those situations where randomization can improve inspection efficiency and those situations where the current nonrandom inspections should be maintained. 9 refs., 1 tab

  19. The effect of offering different numbers of colorectal cancer screening test options in a decision aid: a pilot randomized trial

    Directory of Open Access Journals (Sweden)

    Brenner Alison RT

    2008-01-01

    Full Text Available Abstract Background Decision aids can improve decision making processes, but the amount and type of information that they should attempt to communicate is controversial. We sought to compare, in a pilot randomized trial, two colorectal cancer (CRC screening decision aids that differed in the number of screening options presented. Methods Adults ages 48–75 not currently up to date with screening were recruited from the community and randomized to view one of two versions of our previously tested CRC screening decision aid. The first version included five screening options: fecal occult blood test (FOBT, sigmoidoscopy, a combination of FOBT and sigmoidoscopy, colonoscopy, and barium enema. The second discussed only the two most frequently selected screening options, FOBT and colonoscopy. Main outcomes were differences in screening interest and test preferences between groups after decision aid viewing. Patient test preference was elicited first without any associated out-of-pocket costs (OPC, and then with the following costs: FOBT-$10, sigmoidoscopy-$50, barium enema-$50, and colonoscopy-$200. Results 62 adults participated: 25 viewed the 5-option decision aid, and 37 viewed the 2-option version. Mean age was 54 (range 48–72, 58% were women, 71% were White, 24% African-American; 58% had completed at least a 4-year college degree. Comparing participants that viewed the 5-option version with participants who viewed the 2-option version, there were no differences in screening interest after viewing (1.8 vs. 1.9, t-test p = 0.76. Those viewing the 2-option version were somewhat more likely to choose colonoscopy than those viewing the 5-option version when no out of pocket costs were assumed (68% vs. 46%, p = 0.11, but not when such costs were imposed (41% vs. 42%, p = 1.00. Conclusion The number of screening options available does not appear to have a large effect on interest in colorectal cancer screening. The effect of offering differing

  20. Effect of Melatonin on the Outcome of Assisted Reproductive Technique Cycles in Women with Diminished Ovarian Reserve: A Double-Blinded Randomized Clinical Trial

    Directory of Open Access Journals (Sweden)

    Bahia Namavar Jahromi

    2017-01-01

    Full Text Available Diminished ovarian reserve (DOR significantly decreases the success rate of the assisted reproductive technique (ART. In this study, we assessed the effect of melatonin on the ART outcomes in women with DOR. A double-blinded, randomized, clinical trial was performed on 80 women with DOR as a pilot study in Shiraz, between 2014 and 2015. DOR was defined as the presence of 2 of the following 3 criteria: 1 anti-Müllerian hormone ≤1, 2 folliclestimulating hormone ≥10, and 3 bilateral antral follicle count ≤6. The women received 3 mg/d melatonin or a placebo since the fifth day of one cycle prior to gonadotropin stimulation and continued the treatment up to the time of ovum pickup. The ART outcomes were compared between the groups using SPSS software. Finally, there were 32 women in the case and 34 in the placebo groups. The mean age and basal ovarian reserve test were the same between the groups. The serum estradiol level on the triggering day was significantly higher in the case group (P=0.005. The mean number of MII oocytes was higher in the case group, but the difference did not reach statistical significance. Number of the patients who had mature MII oocytes (P=0.014, top-quality embryos with grade 1 (P=0.049, and embryos with grades 1 and 2 (P=0.014 was higher among the women who received melatonin. However, the other ART outcomes were not different between the groups. The serum estradiol level was higher and more women with DOR had good-quality oocytes and embryos after receiving melatonin; however, no other outcome was different between the case and control groups. Trial Registration Number: IRCT2014041417264N1

  1. Conditional Monte Carlo randomization tests for regression models.

    Science.gov (United States)

    Parhat, Parwen; Rosenberger, William F; Diao, Guoqing

    2014-08-15

    We discuss the computation of randomization tests for clinical trials of two treatments when the primary outcome is based on a regression model. We begin by revisiting the seminal paper of Gail, Tan, and Piantadosi (1988), and then describe a method based on Monte Carlo generation of randomization sequences. The tests based on this Monte Carlo procedure are design based, in that they incorporate the particular randomization procedure used. We discuss permuted block designs, complete randomization, and biased coin designs. We also use a new technique by Plamadeala and Rosenberger (2012) for simple computation of conditional randomization tests. Like Gail, Tan, and Piantadosi, we focus on residuals from generalized linear models and martingale residuals from survival models. Such techniques do not apply to longitudinal data analysis, and we introduce a method for computation of randomization tests based on the predicted rate of change from a generalized linear mixed model when outcomes are longitudinal. We show, by simulation, that these randomization tests preserve the size and power well under model misspecification. Copyright © 2014 John Wiley & Sons, Ltd.

  2. A RANDOMIZED TRIAL TO STUDY THE COMPARISON OF TRIGGER POINT DRY NEEDLING VERSUS KINESIO TAPING TECHNIQUE IN MYOFASCIAL PAIN SYNDROME DURING A 3-MONTH FOLLOW UP

    Directory of Open Access Journals (Sweden)

    Emrullah Hayta

    2016-10-01

    Full Text Available Background: Managemen of myofascial pain syndrome (MPS is a current research subject since there is a small number of randomized studies comparing different management techniques. Multiple studies attempted to assess various treatment options including trigger point dry needling and kinesiotaping. We compared the effects of trigger point dry needling and kinesiotaping in the management of myofascial pain syndome during a 3-month follow-up period. Methods: In this prospective randomized studyin MPS patients with upper trapezius muscle trigger points, the effects of dry needling (n=28 and kinesiotaping (n=27 was compared with regard to the visual analog scale (VAS, neck disability index (NDI, and Nottingham health profile (NHP scores measured at the weeks 0, 4, and 12. Results: Both dry needling and kinesiotaping comparably reduced VAS scores measured at the weeks 4 and 12 and their efficacies were more remarkable at the week 12 (p<0.05. These interventions significantly reduced the NDI and NHP score and their effects were also more remarkable at the week 12; however, dry needling was found more effective (p<0.05. Conclusion: Overall, in current clinical settings, during the management of MPS, pain can be reduced comparably by both dry needling and kinesiotaping; however, restriction in the range of motionin neck region and quality of life are more remarkably reduced by dry needling. Both dry needling and kinesiotaping can provide an increasing effectiveness up to 12 weeks.

  3. Muscle energy technique compared to eccentric loading exercise in the management of achilles tendinitis: A pilot randomized controlled trial

    Directory of Open Access Journals (Sweden)

    Hariharasudhan Ravichandran

    2017-01-01

    Full Text Available Background: Achilles tendinitis is a common overuse injury among both elite and recreational athletes involved in activities such as repetitive jumping and running. Aim: The aim of this single-blinded randomized study was to compare the efficacy of muscle energy technique (MET and eccentric loading exercise (ELE interventions on improving functional ability and pain reduction among athletes with Achilles tendinitis. Methods: A single-blinded, pilot, randomized study was conducted in the Department of Physical Therapy, Global Hospitals and Health City, India, with 6-week follow-up. A total of 30 patients with Achilles tendinitis were randomly allocated to receive either MET (n = 15 or ELE (n = 15 treatment. Treatment effects were evaluated by pre- and post-treatment assessment of visual analog scale (VAS and Victorian Institute of Sports Assessment-Achilles (VISA-A questionnaire. Measures were performed by single-blinded evaluators at baseline and at 2, 4, and after 6 weeks of treatment. Results: Both groups showed a significant difference in VAS after 6 weeks' ELE group showed a significant improvement during treatment at 2 and 4 weeks in comparison with MET group. The VISA-A scale score significantly improved in both groups. Yet, comparison of VISA scores between groups showed marginally significant difference (P = 0.012. Conclusion: This pilot randomized controlled trial (RCT showed the efficacy of ELE in reducing pain and improving functional ability among patients with Achilles tendinitis. The findings of this study provide the rationale for undertaking a large-scale RCT. A large sized trial is needed to establish evidence for clinical practice of ELE in Achilles tendinitis cases.

  4. Random maintenance policies

    CERN Document Server

    Nakagawa, Toshio

    2014-01-01

    Exploring random maintenance models, this book provides an introduction to the implementation of random maintenance, and it is one of the first books to be written on this subject.  It aims to help readers learn new techniques for applying random policies to actual reliability models, and it provides new theoretical analyses of various models including classical replacement, preventive maintenance and inspection policies. These policies are applied to scheduling problems, backup policies of database systems, maintenance policies of cumulative damage models, and reliability of random redundant systems. Reliability theory is a major concern for engineers and managers, and in light of Japan’s recent earthquake, the reliability of large-scale systems has increased in importance. This also highlights the need for a new notion of maintenance and reliability theory, and how this can practically be applied to systems. Providing an essential guide for engineers and managers specializing in reliability maintenance a...

  5. Physiotherapists use a small number of behaviour change techniques when promoting physical activity: A systematic review comparing experimental and observational studies.

    Science.gov (United States)

    Kunstler, Breanne E; Cook, Jill L; Freene, Nicole; Finch, Caroline F; Kemp, Joanne L; O'Halloran, Paul D; Gaida, James E

    2018-06-01

    Physiotherapists promote physical activity as part of their practice. This study reviewed the behaviour change techniques physiotherapists use when promoting physical activity in experimental and observational studies. Systematic review of experimental and observational studies. Twelve databases were searched using terms related to physiotherapy and physical activity. We included experimental studies evaluating the efficacy of physiotherapist-led physical activity interventions delivered to adults in clinic-based private practice and outpatient settings to individuals with, or at risk of, non-communicable diseases. Observational studies reporting the techniques physiotherapists use when promoting physical activity were also included. The behaviour change techniques used in all studies were identified using the Behaviour Change Technique Taxonomy. The behaviour change techniques appearing in efficacious and inefficacious experimental interventions were compared using a narrative approach. Twelve studies (nine experimental and three observational) were retained from the initial search yield of 4141. Risk of bias ranged from low to high. Physiotherapists used seven behaviour change techniques in the observational studies, compared to 30 behaviour change techniques in the experimental studies. Social support (unspecified) was the most frequently identified behaviour change technique across both settings. Efficacious experimental interventions used more behaviour change techniques (n=29) and functioned in more ways (n=6) than did inefficacious experimental interventions (behaviour change techniques=10 and functions=1). Physiotherapists use a small number of behaviour change techniques. Less behaviour change techniques were identified in observational studies compared to experimental studies, suggesting physiotherapists use less BCTs clinically than experimentally. Copyright © 2017 Sports Medicine Australia. Published by Elsevier Ltd. All rights reserved.

  6. On reflexivity of random walks in a random environment on a metric space

    International Nuclear Information System (INIS)

    Rozikov, U.A.

    2002-11-01

    In this paper, we consider random walks in random environments on a countable metric space when jumps of the walks of the fractions are finite. The transfer probabilities of the random walk from x is an element of G (where G is the considering metric space) are defined by vector p(x) is an element of R k , k>1, where {p(x), x is an element of G} is the set of independent and indentically distributed random vectors. For the random walk, a sufficient condition of nonreflexivity is obtained. Examples for metric spaces Z d free groups and free product of finite numbers cyclic groups of the second order and some other metric spaces are considered. (author)

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

    Science.gov (United States)

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

    2017-10-01

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

  8. Analysis of Discrete L2 Projection on Polynomial Spaces with Random Evaluations

    KAUST Repository

    Migliorati, Giovanni; Nobile, Fabio; von Schwerin, Erik; Tempone, Raul

    2014-01-01

    We analyze the problem of approximating a multivariate function by discrete least-squares projection on a polynomial space starting from random, noise-free observations. An area of possible application of such technique is uncertainty quantification for computational models. We prove an optimal convergence estimate, up to a logarithmic factor, in the univariate case, when the observation points are sampled in a bounded domain from a probability density function bounded away from zero and bounded from above, provided the number of samples scales quadratically with the dimension of the polynomial space. Optimality is meant in the sense that the weighted L2 norm of the error committed by the random discrete projection is bounded with high probability from above by the best L∞ error achievable in the given polynomial space, up to logarithmic factors. Several numerical tests are presented in both the univariate and multivariate cases, confirming our theoretical estimates. The numerical tests also clarify how the convergence rate depends on the number of sampling points, on the polynomial degree, and on the smoothness of the target function. © 2014 SFoCM.

  9. Analysis of Discrete L2 Projection on Polynomial Spaces with Random Evaluations

    KAUST Repository

    Migliorati, Giovanni

    2014-03-05

    We analyze the problem of approximating a multivariate function by discrete least-squares projection on a polynomial space starting from random, noise-free observations. An area of possible application of such technique is uncertainty quantification for computational models. We prove an optimal convergence estimate, up to a logarithmic factor, in the univariate case, when the observation points are sampled in a bounded domain from a probability density function bounded away from zero and bounded from above, provided the number of samples scales quadratically with the dimension of the polynomial space. Optimality is meant in the sense that the weighted L2 norm of the error committed by the random discrete projection is bounded with high probability from above by the best L∞ error achievable in the given polynomial space, up to logarithmic factors. Several numerical tests are presented in both the univariate and multivariate cases, confirming our theoretical estimates. The numerical tests also clarify how the convergence rate depends on the number of sampling points, on the polynomial degree, and on the smoothness of the target function. © 2014 SFoCM.

  10. Typed Linear Chain Conditional Random Fields and Their Application to Intrusion Detection

    Science.gov (United States)

    Elfers, Carsten; Horstmann, Mirko; Sohr, Karsten; Herzog, Otthein

    Intrusion detection in computer networks faces the problem of a large number of both false alarms and unrecognized attacks. To improve the precision of detection, various machine learning techniques have been proposed. However, one critical issue is that the amount of reference data that contains serious intrusions is very sparse. In this paper we present an inference process with linear chain conditional random fields that aims to solve this problem by using domain knowledge about the alerts of different intrusion sensors represented in an ontology.

  11. The clinically-integrated randomized trial: proposed novel method for conducting large trials at low cost

    Directory of Open Access Journals (Sweden)

    Scardino Peter T

    2009-03-01

    Full Text Available Abstract Introduction Randomized controlled trials provide the best method of determining which of two comparable treatments is preferable. Unfortunately, contemporary randomized trials have become increasingly expensive, complex and burdened by regulation, so much so that many trials are of doubtful feasibility. Discussion Here we present a proposal for a novel, streamlined approach to randomized trials: the "clinically-integrated randomized trial". The key aspect of our methodology is that the clinical experience of the patient and doctor is virtually indistinguishable whether or not the patient is randomized, primarily because outcome data are obtained from routine clinical data, or from short, web-based questionnaires. Integration of a randomized trial into routine clinical practice also implies that there should be an attempt to randomize every patient, a corollary of which is that eligibility criteria are minimized. The similar clinical experience of patients on- and off-study also entails that the marginal cost of putting an additional patient on trial is negligible. We propose examples of how the clinically-integrated randomized trial might be applied in four distinct areas of medicine: comparisons of surgical techniques, "me too" drugs, rare diseases and lifestyle interventions. Barriers to implementing clinically-integrated randomized trials are discussed. Conclusion The proposed clinically-integrated randomized trial may allow us to enlarge dramatically the number of clinical questions that can be addressed by randomization.

  12. Random processes in nuclear reactors

    CERN Document Server

    Williams, M M R

    1974-01-01

    Random Processes in Nuclear Reactors describes the problems that a nuclear engineer may meet which involve random fluctuations and sets out in detail how they may be interpreted in terms of various models of the reactor system. Chapters set out to discuss topics on the origins of random processes and sources; the general technique to zero-power problems and bring out the basic effect of fission, and fluctuations in the lifetime of neutrons, on the measured response; the interpretation of power reactor noise; and associated problems connected with mechanical, hydraulic and thermal noise sources

  13. Sampling large random knots in a confined space

    International Nuclear Information System (INIS)

    Arsuaga, J; Blackstone, T; Diao, Y; Hinson, K; Karadayi, E; Saito, M

    2007-01-01

    DNA knots formed under extreme conditions of condensation, as in bacteriophage P4, are difficult to analyze experimentally and theoretically. In this paper, we propose to use the uniform random polygon model as a supplementary method to the existing methods for generating random knots in confinement. The uniform random polygon model allows us to sample knots with large crossing numbers and also to generate large diagrammatically prime knot diagrams. We show numerically that uniform random polygons sample knots with large minimum crossing numbers and certain complicated knot invariants (as those observed experimentally). We do this in terms of the knot determinants or colorings. Our numerical results suggest that the average determinant of a uniform random polygon of n vertices grows faster than O(e n 2 )). We also investigate the complexity of prime knot diagrams. We show rigorously that the probability that a randomly selected 2D uniform random polygon of n vertices is almost diagrammatically prime goes to 1 as n goes to infinity. Furthermore, the average number of crossings in such a diagram is at the order of O(n 2 ). Therefore, the two-dimensional uniform random polygons offer an effective way in sampling large (prime) knots, which can be useful in various applications

  14. Sampling large random knots in a confined space

    Science.gov (United States)

    Arsuaga, J.; Blackstone, T.; Diao, Y.; Hinson, K.; Karadayi, E.; Saito, M.

    2007-09-01

    DNA knots formed under extreme conditions of condensation, as in bacteriophage P4, are difficult to analyze experimentally and theoretically. In this paper, we propose to use the uniform random polygon model as a supplementary method to the existing methods for generating random knots in confinement. The uniform random polygon model allows us to sample knots with large crossing numbers and also to generate large diagrammatically prime knot diagrams. We show numerically that uniform random polygons sample knots with large minimum crossing numbers and certain complicated knot invariants (as those observed experimentally). We do this in terms of the knot determinants or colorings. Our numerical results suggest that the average determinant of a uniform random polygon of n vertices grows faster than O(e^{n^2}) . We also investigate the complexity of prime knot diagrams. We show rigorously that the probability that a randomly selected 2D uniform random polygon of n vertices is almost diagrammatically prime goes to 1 as n goes to infinity. Furthermore, the average number of crossings in such a diagram is at the order of O(n2). Therefore, the two-dimensional uniform random polygons offer an effective way in sampling large (prime) knots, which can be useful in various applications.

  15. Sampling large random knots in a confined space

    Energy Technology Data Exchange (ETDEWEB)

    Arsuaga, J [Department of Mathematics, San Francisco State University, 1600 Holloway Ave, San Francisco, CA 94132 (United States); Blackstone, T [Department of Computer Science, San Francisco State University, 1600 Holloway Ave., San Francisco, CA 94132 (United States); Diao, Y [Department of Mathematics and Statistics, University of North Carolina at Charlotte, Charlotte, NC 28223 (United States); Hinson, K [Department of Mathematics and Statistics, University of North Carolina at Charlotte, Charlotte, NC 28223 (United States); Karadayi, E [Department of Mathematics, University of South Florida, 4202 E Fowler Avenue, Tampa, FL 33620 (United States); Saito, M [Department of Mathematics, University of South Florida, 4202 E Fowler Avenue, Tampa, FL 33620 (United States)

    2007-09-28

    DNA knots formed under extreme conditions of condensation, as in bacteriophage P4, are difficult to analyze experimentally and theoretically. In this paper, we propose to use the uniform random polygon model as a supplementary method to the existing methods for generating random knots in confinement. The uniform random polygon model allows us to sample knots with large crossing numbers and also to generate large diagrammatically prime knot diagrams. We show numerically that uniform random polygons sample knots with large minimum crossing numbers and certain complicated knot invariants (as those observed experimentally). We do this in terms of the knot determinants or colorings. Our numerical results suggest that the average determinant of a uniform random polygon of n vertices grows faster than O(e{sup n{sup 2}}). We also investigate the complexity of prime knot diagrams. We show rigorously that the probability that a randomly selected 2D uniform random polygon of n vertices is almost diagrammatically prime goes to 1 as n goes to infinity. Furthermore, the average number of crossings in such a diagram is at the order of O(n{sup 2}). Therefore, the two-dimensional uniform random polygons offer an effective way in sampling large (prime) knots, which can be useful in various applications.

  16. Direct random insertion mutagenesis of Helicobacter pylori

    NARCIS (Netherlands)

    de Jonge, Ramon; Bakker, Dennis; van Vliet, Arnoud H. M.; Kuipers, Ernst J.; Vandenbroucke-Grauls, Christina M. J. E.; Kusters, Johannes G.

    2003-01-01

    Random insertion mutagenesis is a widely used technique for the identification of bacterial virulence genes. Most strategies for random mutagenesis involve cloning in Escherichia coli for passage of plasmids or for phenotypic selection. This can result in biased selection due to restriction or

  17. Direct random insertion mutagenesis of Helicobacter pylori.

    NARCIS (Netherlands)

    Jonge, de R.; Bakker, D.; Vliet, van AH; Kuipers, E.J.; Vandenbroucke-Grauls, C.M.J.E.; Kusters, J.G.

    2003-01-01

    Random insertion mutagenesis is a widely used technique for the identification of bacterial virulence genes. Most strategies for random mutagenesis involve cloning in Escherichia coli for passage of plasmids or for phenotypic selection. This can result in biased selection due to restriction or

  18. Random Fields

    Science.gov (United States)

    Vanmarcke, Erik

    1983-03-01

    Random variation over space and time is one of the few attributes that might safely be predicted as characterizing almost any given complex system. Random fields or "distributed disorder systems" confront astronomers, physicists, geologists, meteorologists, biologists, and other natural scientists. They appear in the artifacts developed by electrical, mechanical, civil, and other engineers. They even underlie the processes of social and economic change. The purpose of this book is to bring together existing and new methodologies of random field theory and indicate how they can be applied to these diverse areas where a "deterministic treatment is inefficient and conventional statistics insufficient." Many new results and methods are included. After outlining the extent and characteristics of the random field approach, the book reviews the classical theory of multidimensional random processes and introduces basic probability concepts and methods in the random field context. It next gives a concise amount of the second-order analysis of homogeneous random fields, in both the space-time domain and the wave number-frequency domain. This is followed by a chapter on spectral moments and related measures of disorder and on level excursions and extremes of Gaussian and related random fields. After developing a new framework of analysis based on local averages of one-, two-, and n-dimensional processes, the book concludes with a chapter discussing ramifications in the important areas of estimation, prediction, and control. The mathematical prerequisite has been held to basic college-level calculus.

  19. Efficiency of piezosurgery technique in miniscrew supported en-masse retraction: a single-centre, randomized controlled trial.

    Science.gov (United States)

    Tunçer, Nilüfer Irem; Arman-Özçirpici, Ayça; Oduncuoglu, Bahar Füsun; Göçmen, Jülide Sedef; Kantarci, Alpdogan

    2017-11-30

    Piezoelectric surgery is a newly introduced technique for rapid tooth movement. However, the efficiency of this technique has not been investigated on en-masse retraction cases yet. To investigate the efficiency of piezosurgery technique in accelerating miniscrew supported en-masse retraction and study the biological tissue response. In addition, to show if this technique induces a difference in dental, skeletal and soft tissue changes on lateral cephalograms, and in canine and molar rotations, besides intercanine and intermolar widths on dental casts. We conducted a randomized, single-centred, parallel-group, controlled trial, requiring upper right and left first premolar extractions on 30 patients above the minimum age of 14 years at the beginning of retraction. Piezosurgery-assisted versus conventional en-masse retraction anchored from miniscrews placed between second premolars and first molars, bilaterally. The main outcome was the en-masse retraction rate. Secondary outcomes were gingival crevicular fluid (GCF) volume and GCF content of receptor activator of nuclear factor κβ ligand (RANKL), changes regarding cephalometric and dental cast variables, and miniscrew success rates. Accomplished with opaque, sealed envelopes. Applicable for data assessment only. Commenced in February 2013 and ended in October 2014. Thirty-one patients were included in the study and divided into 2 groups of piezosurgery (n = 16) and control (n = 15). After 9.3 months of follow-up, no statistically significant difference was observed between groups for neither retraction rates (P = 0.958) nor GCF parameters (P > 0.05). Changes in lateral cephalometric and dental cast variables, and miniscrew success rates did not show significant differences either. Based on the results of this study, piezosurgery technique was found to be ineffective in accelerating en-masse retraction, and promoting a difference in the studied GCF parameters, skeletal and dental variables. The trial was not

  20. Comparison of randomization techniques for clinical trials with data from the HOMERUS-trial

    NARCIS (Netherlands)

    Verberk, W. J.; Kroon, A. A.; Kessels, A. G. H.; Nelemans, P. J.; van Ree, J. W.; Lenders, J. W. M.; Thien, T.; Bakx, J. C.; van Montfrans, G. A.; Smit, A. J.; Beltman, F. W.; de Leeuw, P. W.

    2005-01-01

    Background. Several methods of randomization are available to create comparable intervention groups in a study. In the HOMERUS-trial, we compared the minimization procedure with a stratified and a non-stratified method of randomization in order to test which one is most appropriate for use in

  1. Comparison of randomization techniques for clinical trials with data from the HOMERUS-trial.

    NARCIS (Netherlands)

    Verberk, W.J.; Kroon, A.A.; Kessels, A.G.H.; Nelemans, P.J.; Ree, J.W. van; Lenders, J.W.M.; Thien, Th.; Bakx, J.C.; Montfrans, G.A. van; Smit, A.J.; Beltman, F.W.; Leeuw, P.W. de

    2005-01-01

    BACKGROUND: Several methods of randomization are available to create comparable intervention groups in a study. In the HOMERUS-trial, we compared the minimization procedure with a stratified and a non-stratified method of randomization in order to test which one is most appropriate for use in

  2. Comparison of Venae Sectio vs. modified Seldinger Technique for Totally Implantable Access Ports; Portas-trial [ISRCTN:52368201

    Directory of Open Access Journals (Sweden)

    Luntz S

    2006-06-01

    Full Text Available Abstract Background The insertion of a Totally Implantable Access Port (TIAP is a routinely employed technique in patients who need a safe and permanent venous access. The number of TIAP implantations is increasing constantly mainly due to advanced treatment options for malignant diseases. Therefore it is important to identify the implantation technique which has the optimal benefit/risk ratio for the patient. Study design A single-centre, randomized, controlled superiority trial to compare two different TIAP implantation techniques. Sample size: 160 patients will be included and randomized intra-operatively. Eligibility criteria: Age equal or older than 18 years, patients scheduled for primary elective implantation of a TIAP in local anaesthesia and a signed informed consent. Primary endpoint: Primary success rate of the randomized technique. Intervention: Venae Sectio in combination with the Seldinger Technique (guide wire and a peel away sheath will be used to place a TIAP. Reference treatment: Conventional Venae Sectio will be used with a direct insertion of the TIAP without guide wire or peel away sheath. Duration of study: Approximately 20 months. Organisation/Responsibility The trial will be conducted in compliance with the protocol and in accordance with the moral, ethical, and scientific principles governing clinical research as set out in the Declaration of Helsinki (1989 and Good Clinical Practice (GCP. The trial will also be carried out in keeping with local and regulatory requirements. The Klinisches Studienzentrum Chirurgie (KSC – Centre of Clinical Trials in Surgery at the Department of Surgery, University Hospital Heidelberg is responsible for planning and conduction of the trial. Documentation of patient's data will be accomplished via electronical Case Report Files (eCRF with MACRO®-Software by the KSC. Randomization, data management, monitoring and biometry are provided by the independent Koordinierungszentrum f

  3. Comparing spatial regression to random forests for large ...

    Science.gov (United States)

    Environmental data may be “large” due to number of records, number of covariates, or both. Random forests has a reputation for good predictive performance when using many covariates, whereas spatial regression, when using reduced rank methods, has a reputation for good predictive performance when using many records. In this study, we compare these two techniques using a data set containing the macroinvertebrate multimetric index (MMI) at 1859 stream sites with over 200 landscape covariates. Our primary goal is predicting MMI at over 1.1 million perennial stream reaches across the USA. For spatial regression modeling, we develop two new methods to accommodate large data: (1) a procedure that estimates optimal Box-Cox transformations to linearize covariate relationships; and (2) a computationally efficient covariate selection routine that takes into account spatial autocorrelation. We show that our new methods lead to cross-validated performance similar to random forests, but that there is an advantage for spatial regression when quantifying the uncertainty of the predictions. Simulations are used to clarify advantages for each method. This research investigates different approaches for modeling and mapping national stream condition. We use MMI data from the EPA's National Rivers and Streams Assessment and predictors from StreamCat (Hill et al., 2015). Previous studies have focused on modeling the MMI condition classes (i.e., good, fair, and po

  4. Vacuum instability in a random electric field

    International Nuclear Information System (INIS)

    Krive, I.V.; Pastur, L.A.

    1984-01-01

    The reaction of the vacuum on an intense spatially homogeneous random electric field is investigated. It is shown that a stochastic electric field always causes a breakdown of the boson vacuum, and the number of pairs of particles which are created by the electric field increases exponentially in time. For the choice of potential field in the form of a dichotomic random process we find in explicit form the dependence of the average number of pairs of particles on the time of the action of the source of the stochastic field. For the fermion vacuum the average number of pairs of particles which are created by the field in the lowest order of perturbation theory in the amplitude of the random field is independent of time

  5. Multi-Index Monte Carlo and stochastic collocation methods for random PDEs

    KAUST Repository

    Nobile, Fabio; Haji Ali, Abdul Lateef; Tamellini, Lorenzo; Tempone, Raul

    2016-01-01

    In this talk we consider the problem of computing statistics of the solution of a partial differential equation with random data, where the random coefficient is parametrized by means of a finite or countable sequence of terms in a suitable expansion. We describe and analyze a Multi-Index Monte Carlo (MIMC) and a Multi-Index Stochastic Collocation method (MISC). the former is both a stochastic version of the combination technique introduced by Zenger, Griebel and collaborators and an extension of the Multilevel Monte Carlo (MLMC) method first described by Heinrich and Giles. Instead of using firstorder differences as in MLMC, MIMC uses mixed differences to reduce the variance of the hierarchical differences dramatically. This in turn yields new and improved complexity results, which are natural generalizations of Giles s MLMC analysis, and which increase the domain of problem parameters for which we achieve the optimal convergence, O(TOL-2). On the same vein, MISC is a deterministic combination technique based on mixed differences of spatial approximations and quadratures over the space of random data. Provided enough mixed regularity, MISC can achieve better complexity than MIMC. Moreover, we show that in the optimal case the convergence rate of MISC is only dictated by the convergence of the deterministic solver applied to a one-dimensional spatial problem. We propose optimization procedures to select the most effective mixed differences to include in MIMC and MISC. Such optimization is a crucial step that allows us to make MIMC and MISC computationally effective. We finally show the effectiveness of MIMC and MISC with some computational tests, including tests with a infinite countable number of random parameters.

  6. Multi-Index Monte Carlo and stochastic collocation methods for random PDEs

    KAUST Repository

    Nobile, Fabio

    2016-01-09

    In this talk we consider the problem of computing statistics of the solution of a partial differential equation with random data, where the random coefficient is parametrized by means of a finite or countable sequence of terms in a suitable expansion. We describe and analyze a Multi-Index Monte Carlo (MIMC) and a Multi-Index Stochastic Collocation method (MISC). the former is both a stochastic version of the combination technique introduced by Zenger, Griebel and collaborators and an extension of the Multilevel Monte Carlo (MLMC) method first described by Heinrich and Giles. Instead of using firstorder differences as in MLMC, MIMC uses mixed differences to reduce the variance of the hierarchical differences dramatically. This in turn yields new and improved complexity results, which are natural generalizations of Giles s MLMC analysis, and which increase the domain of problem parameters for which we achieve the optimal convergence, O(TOL-2). On the same vein, MISC is a deterministic combination technique based on mixed differences of spatial approximations and quadratures over the space of random data. Provided enough mixed regularity, MISC can achieve better complexity than MIMC. Moreover, we show that in the optimal case the convergence rate of MISC is only dictated by the convergence of the deterministic solver applied to a one-dimensional spatial problem. We propose optimization procedures to select the most effective mixed differences to include in MIMC and MISC. Such optimization is a crucial step that allows us to make MIMC and MISC computationally effective. We finally show the effectiveness of MIMC and MISC with some computational tests, including tests with a infinite countable number of random parameters.

  7. Remote and unattended monitoring techniques

    International Nuclear Information System (INIS)

    Abedin-Zadeh, R.; Whichello, J.

    1998-01-01

    In the last years, there has been a tremendous growth in the number of unattended assay and monitoring systems in the field. These systems have enabled reduced presence of inspectors while increasing the verification coverage. As part of the Strengthened safeguards System and in particular as part of the measures to improve the cost-effectiveness of safeguards, the possibility of remote transfer of authenticated and encrypted video surveillance, seals and radiation sensor data via telephone or special satellite links have been demonstrated and the necessary arrangements and infrastructure have been prepared. The evaluation of field trials of the remote monitoring systems have shown that the systems are effective in monitoring events of safeguards relevance in near real times. The systems are competitive from a cost standpoint when compared to current methods. The reduction of inspection efforts can be realized by application of remote monitoring technique with scheduled inspections and more effectively with the short notice or unannounced random inspections. It is expected that, upon completion of the necessary arrangements with the Member States authorities, the safeguards department will implement the technique widely before the year 2000

  8. Experimentally generated randomness certified by the impossibility of superluminal signals.

    Science.gov (United States)

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

    2018-04-01

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

  9. An automated technique for most-probable-number (MPN) analysis of densities of phagotrophic protists with lux-AB labelled bacteria as growth medium

    DEFF Research Database (Denmark)

    Ekelund, Flemming; Christensen, Søren; Rønn, Regin

    1999-01-01

    An automated modification of the most-probable-number (MPN) technique has been developed for enumeration of phagotrophic protozoa. The method is based on detection of prey depletion in micro titre plates rather than on presence of protozoa. A transconjugant Pseudomonas fluorescens DR54 labelled w...

  10. The Effect of a Physical Activity Program on the Total Number of Primary Care Visits in Inactive Patients: A 15-Month Randomized Controlled Trial.

    Directory of Open Access Journals (Sweden)

    Maria Giné-Garriga

    Full Text Available Effective promotion of exercise could result in substantial savings in healthcare cost expenses in terms of direct medical costs, such as the number of medical appointments. However, this is hampered by our limited knowledge of how to achieve sustained increases in physical activity.To assess the effectiveness of a Primary Health Care (PHC based physical activity program in reducing the total number of visits to the healthcare center among inactive patients, over a 15-month period.Randomized controlled trial.Three hundred and sixty-two (n = 362 inactive patients suffering from at least one chronic condition were included. One hundred and eighty-three patients (n = 183; mean (SD; 68.3 (8.8 years; 118 women were randomly allocated to the physical activity program (IG. One hundred and seventy-nine patients (n = 179; 67.2 (9.1 years; 106 women were allocated to the control group (CG. The IG went through a three-month standardized physical activity program led by physical activity specialists and linked to community resources.The total number of medical appointments to the PHC, during twelve months before and after the program, was registered. Self-reported health status (SF-12 version 2 was assessed at baseline (month 0, at the end of the intervention (month 3, and at 12 months follow-up after the end of the intervention (month 15.The IG had a significantly reduced number of visits during the 12 months after the intervention: 14.8 (8.5. The CG remained about the same: 18.2 (11.1 (P = .002.Our findings indicate that a 3-month physical activity program linked to community resources is a short-duration, effective and sustainable intervention in inactive patients to decrease rates of PHC visits.ClinicalTrials.gov NCT00714831.

  11. The Random-Map Technique: Enhancing Mind-Mapping with a Conceptual Combination Technique to Foster Creative Potential

    Science.gov (United States)

    Malycha, Charlotte P.; Maier, Günter W.

    2017-01-01

    Although creativity techniques are highly recommended in working environments, their effects have been scarcely investigated. Two cognitive processes are often considered to foster creative potential and are, therefore, taken as a basis for creativity techniques: knowledge activation and conceptual combination. In this study, both processes were…

  12. Improving oral hygiene skills by computer-based training: a randomized controlled comparison of the modified Bass and the Fones techniques.

    Directory of Open Access Journals (Sweden)

    Daniela Harnacke

    Full Text Available BACKGROUND: Gingivitis and other plaque-associated diseases have a high prevalence in western communities even though the majority of adults report daily oral hygiene. This indicates a lack of oral hygiene skills. Currently, there is no clear evidence as to which brushing technique would bring about the best oral hygiene skills. While the modified Bass technique is often recommended by dentists and in textbooks, the Fones technique is often recommended in patient brochures. Still, standardized comparisons of the effectiveness of teaching these techniques are lacking. METHODOLOGY/PRINCIPAL FINDINGS: In a final sample of n = 56 students, this multidisciplinary, randomized, examiner-blinded, controlled study compared the effects of parallel and standardized interactive computer presentations teaching either the Fones or the modified Bass technique. A control group was taught the basics of tooth brushing alone. Oral hygiene skills (remaining plaque after thorough oral hygiene and gingivitis were assessed at baseline and 6, 12, and 28 weeks after the intervention. We found a significant group×time interaction for gingivitis (F(4/102 = 3.267; p = 0.016; ε = 0.957; η(2 = 0.114 and a significant main effect of group for oral hygiene skills (F(2/51 = 7.088; p = 0.002; η(2 = 0.218. Fones was superior to Bass; Bass did not differ from the control group. Group differences were most prominent after 6 and 12 weeks. CONCLUSIONS/SIGNIFICANCE: The present trial indicates an advantage of teaching the Fones as compared to the modified Bass technique with respect to oral hygiene skills and gingivitis. Future studies are needed to analyze whether the disadvantage of teaching the Bass technique observed here is restricted to the teaching method employed. TRIAL REGISTRATION: German Clinical Trials Register DRKS00003488.

  13. Dynamical correlations for circular ensembles of random matrices

    International Nuclear Information System (INIS)

    Nagao, Taro; Forrester, Peter

    2003-01-01

    Circular Brownian motion models of random matrices were introduced by Dyson and describe the parametric eigenparameter correlations of unitary random matrices. For symmetric unitary, self-dual quaternion unitary and an analogue of antisymmetric Hermitian matrix initial conditions, Brownian dynamics toward the unitary symmetry is analyzed. The dynamical correlation functions of arbitrary number of Brownian particles at arbitrary number of times are shown to be written in the forms of quaternion determinants, similarly as in the case of Hermitian random matrix models

  14. A Solution Method for Linear and Geometrically Nonlinear MDOF Systems with Random Properties subject to Random Excitation

    DEFF Research Database (Denmark)

    Micaletti, R. C.; Cakmak, A. S.; Nielsen, Søren R. K.

    structural properties. The resulting state-space formulation is a system of ordinary stochastic differential equations with random coefficient and deterministic initial conditions which are subsequently transformed into ordinary stochastic differential equations with deterministic coefficients and random......A method for computing the lower-order moments of randomly-excited multi-degree-of-freedom (MDOF) systems with random structural properties is proposed. The method is grounded in the techniques of stochastic calculus, utilizing a Markov diffusion process to model the structural system with random...... initial conditions. This transformation facilitates the derivation of differential equations which govern the evolution of the unconditional statistical moments of response. Primary consideration is given to linear systems and systems with odd polynomial nonlinearities, for in these cases...

  15. Prime Numbers Comparison using Sieve of Eratosthenes and Sieve of Sundaram Algorithm

    Science.gov (United States)

    Abdullah, D.; Rahim, R.; Apdilah, D.; Efendi, S.; Tulus, T.; Suwilo, S.

    2018-03-01

    Prime numbers are numbers that have their appeal to researchers due to the complexity of these numbers, many algorithms that can be used to generate prime numbers ranging from simple to complex computations, Sieve of Eratosthenes and Sieve of Sundaram are two algorithm that can be used to generate Prime numbers of randomly generated or sequential numbered random numbers, testing in this study to find out which algorithm is better used for large primes in terms of time complexity, the test also assisted with applications designed using Java language with code optimization and Maximum memory usage so that the testing process can be simultaneously and the results obtained can be objective

  16. Random linear codes in steganography

    Directory of Open Access Journals (Sweden)

    Kamil Kaczyński

    2016-12-01

    Full Text Available Syndrome coding using linear codes is a technique that allows improvement in the steganographic algorithms parameters. The use of random linear codes gives a great flexibility in choosing the parameters of the linear code. In parallel, it offers easy generation of parity check matrix. In this paper, the modification of LSB algorithm is presented. A random linear code [8, 2] was used as a base for algorithm modification. The implementation of the proposed algorithm, along with practical evaluation of algorithms’ parameters based on the test images was made.[b]Keywords:[/b] steganography, random linear codes, RLC, LSB

  17. Beurling generalized numbers

    CERN Document Server

    Diamond, Harold G; Cheung, Man Ping

    2016-01-01

    "Generalized numbers" is a multiplicative structure introduced by A. Beurling to study how independent prime number theory is from the additivity of the natural numbers. The results and techniques of this theory apply to other systems having the character of prime numbers and integers; for example, it is used in the study of the prime number theorem (PNT) for ideals of algebraic number fields. Using both analytic and elementary methods, this book presents many old and new theorems, including several of the authors' results, and many examples of extremal behavior of g-number systems. Also, the authors give detailed accounts of the L^2 PNT theorem of J. P. Kahane and of the example created with H. L. Montgomery, showing that additive structure is needed for proving the Riemann hypothesis. Other interesting topics discussed are propositions "equivalent" to the PNT, the role of multiplicative convolution and Chebyshev's prime number formula for g-numbers, and how Beurling theory provides an interpretation of the ...

  18. Random vibrations theory and practice

    CERN Document Server

    Wirsching, Paul H; Ortiz, Keith

    1995-01-01

    Random Vibrations: Theory and Practice covers the theory and analysis of mechanical and structural systems undergoing random oscillations due to any number of phenomena— from engine noise, turbulent flow, and acoustic noise to wind, ocean waves, earthquakes, and rough pavement. For systems operating in such environments, a random vibration analysis is essential to the safety and reliability of the system. By far the most comprehensive text available on random vibrations, Random Vibrations: Theory and Practice is designed for readers who are new to the subject as well as those who are familiar with the fundamentals and wish to study a particular topic or use the text as an authoritative reference. It is divided into three major sections: fundamental background, random vibration development and applications to design, and random signal analysis. Introductory chapters cover topics in probability, statistics, and random processes that prepare the reader for the development of the theory of random vibrations a...

  19. The Theory of Random Laser Systems

    International Nuclear Information System (INIS)

    Xunya Jiang

    2002-01-01

    Studies of random laser systems are a new direction with promising potential applications and theoretical interest. The research is based on the theories of localization and laser physics. So far, the research shows that there are random lasing modes inside the systems which is quite different from the common laser systems. From the properties of the random lasing modes, they can understand the phenomena observed in the experiments, such as multi-peak and anisotropic spectrum, lasing mode number saturation, mode competition and dynamic processes, etc. To summarize, this dissertation has contributed the following in the study of random laser systems: (1) by comparing the Lamb theory with the Letokhov theory, the general formulas of the threshold length or gain of random laser systems were obtained; (2) they pointed out the vital weakness of previous time-independent methods in random laser research; (3) a new model which includes the FDTD method and the semi-classical laser theory. The solutions of this model provided an explanation of the experimental results of multi-peak and anisotropic emission spectra, predicted the saturation of lasing modes number and the length of localized lasing modes; (4) theoretical (Lamb theory) and numerical (FDTD and transfer-matrix calculation) studies of the origin of localized lasing modes in the random laser systems; and (5) proposal of using random lasing modes as a new path to study wave localization in random systems and prediction of the lasing threshold discontinuity at mobility edge

  20. Generation and Analysis of Constrained Random Sampling Patterns

    DEFF Research Database (Denmark)

    Pierzchlewski, Jacek; Arildsen, Thomas

    2016-01-01

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