Pseudo-random number generatorStandard normal distribution37M2511K4562E99In (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, ...
The criteria are somewhat different than those customary in pseudorandom number generation in other applications such as Monte Carlo methods. The methods described in this paper are computationally efficient and provide independence between X n and X n + τ for a very large range of τ ....
On the Approximate Variance of a Nonlinear Function of Random Variables (H Neudecker & G Trenkler) Probabilistic Models in Economics and Finance: When ... P Brown,S Liu,D Sharma 被引量: 13发表: 2015年 The complex architecture of primes and natural numbers Natural numbers can be divided in ...
The inverse of the star-discrepancy problem and the generation of pseudo-random numbers Josef Dick,Friedrich Pillichshammer Full-Text Cite this paper Add to My Lib Abstract: The inverse of the star-discrepancy problem asks for point sets $P_{N,s}$ of size $N$ in the $s$-dimensional...
Random number generation is a key element of stochastic simulations. It has been widely studied for sequential applications purposes, enabling us to reliably use pseudo-random numbers in this case. Unfortunately, we cannot be so enthusiastic when dealing with parallel stochastic simulations. Many applic...
Journal of the ACM Oct 1967 17被引用 0笔记 摘要原文 Pseudo-random number generators of the power residue (sometimes called congruential or multiplicative) type are discussed and results of statistical tests performed on specific examples of this type are presented. Tests were patterned after the met...
Two new pseudorandom number generators, based on iterated function systems (IFS), are introduced. An IFS is created based on an arbitrary seed and a set is constructed using the deterministic iteration algorithm (DIA). From this set pseudo random numbers have been constructed. The generators have...
In the MDI scenario, a user in need of random numbers possesses a characterised state preparation device (P) but has to use an untrusted measurement device (M) (Fig. 2a). This scenario has become of upmost practical relevance nowadays, as a side-channel attack to the detectors is the ...
Deep understanding of the generation process and strict reproducibility of any application involving the "random" numbers is more important. We often emphasize this perspective by the word "pseudorandom", although almost anytime we use a phrase similar to "generation of random numbers", we refer ...
A modified version of Mueller's algorithm for generating K ∗ n bit long pseudo-random numbers by shuffling and concatenating the output of K micros (or generators), each with n bit long data word, is presented. The implementation of the algorithm on microcomputers is illustrated by ...