A commonly used uniform random-number generator is examined in light of a genetic-simulation problem. Although this generator is often useful, it proves defective in this case. The author suggests that any proposed generator be checked for the properties needed by the simulation problem at hand.
Gaussian random number generators
β Scribed by Thomas, David B.; Luk, Wayne; Leong, Philip H.W.; Villasenor, John D.
- Book ID
- 111653733
- Publisher
- Association for Computing Machinery
- Year
- 2007
- Tongue
- English
- Weight
- 417 KB
- Volume
- 39
- Category
- Article
- ISSN
- 0360-0300
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We present a random number generator that is useful for serious computations and can be implemented easily in any language that has 32-bit signed integers, for example C, C ++ and FORTRAN. This combination generator has a cycle length that would take two millennia to compute on widely used desktop c
Up to now biometric methods have been used in cryptography for authentication purposes. In this paper we propose to use biological data for generating sequences of random bits. We point out that this new approach could be particularly useful to generate seeds for pseudo-random number generators and
Monte Carlo computations are considered easy to parallelize. However, the results can be adversely affected by defects in the parallel pseudorandom number generator used. A parallel pseudorandom number generator must be tested for two types of correlations--(i) intrastream correlation, as for any se