Author: Frederick W. Kuehl
Publisher:
ISBN:
Category : Random number generators
Languages : en
Pages : 36
Book Description
Evaluation of a Multiplicative Generator of Pseudo-random Numbers
Author: Frederick W. Kuehl
Publisher:
ISBN:
Category : Random number generators
Languages : en
Pages : 36
Book Description
Publisher:
ISBN:
Category : Random number generators
Languages : en
Pages : 36
Book Description
Evaluation of a Multiplicative Generator of Pseudo-random Numbers
Author: Frederick W. Kuehl
Publisher:
ISBN:
Category :
Languages : en
Pages : 30
Book Description
The present study reports on the development and testing of a pseudo-random number generator which would be able to rapidly supply the SIMPO-I entity models with numbers meeting essential tests for random qualities. The generator developed by BESRL is a power residue or multiplicative generator, the simplest of the many generators based on the linear congruential method. In addition to an acceptable generator, the work accomplished resulted in a compilation of statistical tests which have wider application for evaluating generators used on other computer systems. The tests are described, and essential mathematical formulations are presented. (Author).
Publisher:
ISBN:
Category :
Languages : en
Pages : 30
Book Description
The present study reports on the development and testing of a pseudo-random number generator which would be able to rapidly supply the SIMPO-I entity models with numbers meeting essential tests for random qualities. The generator developed by BESRL is a power residue or multiplicative generator, the simplest of the many generators based on the linear congruential method. In addition to an acceptable generator, the work accomplished resulted in a compilation of statistical tests which have wider application for evaluating generators used on other computer systems. The tests are described, and essential mathematical formulations are presented. (Author).
Evaluation of a Multiplicative Generator of Pseudo-random Numbers
Author:
Publisher:
ISBN:
Category :
Languages : en
Pages : 0
Book Description
The present study reports on the development and testing of a pseudo-random number generator which would be able to rapidly supply the SIMPO-I entity models with numbers meeting essential tests for random qualities. The generator developed by BESRL is a power residue or multiplicative generator, the simplest of the many generators based on the linear congruential method. In addition to an acceptable generator, the work accomplished resulted in a compilation of statistical tests which have wider application for evaluating generators used on other computer systems. The tests are described, and essential mathematical formulations are presented. (Author).
Publisher:
ISBN:
Category :
Languages : en
Pages : 0
Book Description
The present study reports on the development and testing of a pseudo-random number generator which would be able to rapidly supply the SIMPO-I entity models with numbers meeting essential tests for random qualities. The generator developed by BESRL is a power residue or multiplicative generator, the simplest of the many generators based on the linear congruential method. In addition to an acceptable generator, the work accomplished resulted in a compilation of statistical tests which have wider application for evaluating generators used on other computer systems. The tests are described, and essential mathematical formulations are presented. (Author).
Calculations with Pseudo-Random Numbers
Author: SYSTEM DEVELOPMENT CORP SANTA MONICA CALIF.
Publisher:
ISBN:
Category :
Languages : en
Pages : 1
Book Description
Two pseudo-random number generators are considered, the multiplicative congruential method and the mixed congruential method. Some properties of the generated sequences ar derived, and several algorithms are developed for the evaluation of x sub i = f(i) and i = f to the minus 1 power (x sub i), where x sub i is the i'th element of a pseudo-random number sequence. (Author).
Publisher:
ISBN:
Category :
Languages : en
Pages : 1
Book Description
Two pseudo-random number generators are considered, the multiplicative congruential method and the mixed congruential method. Some properties of the generated sequences ar derived, and several algorithms are developed for the evaluation of x sub i = f(i) and i = f to the minus 1 power (x sub i), where x sub i is the i'th element of a pseudo-random number sequence. (Author).
A Statistical Evaluation of Algorithms for Independently Seeding Pseudo-Random Number Generators of Type Multiplicative Congruential (Lehmer-Class).
Author:
Publisher:
ISBN:
Category :
Languages : en
Pages :
Book Description
To be effective, a linear congruential random number generator (LCG) should produce values that are (a) uniformly distributed on the unit interval (0,1) excluding endpoints and (b) substantially free of serial correlation. It has been found that many statistical methods produce inflated Type I error rates for correlated observations. Theoretically, independently seeding an LCG under the following conditions attenuates serial correlation: (a) simple random sampling of seeds, (b) non-replicate streams, (c) non-overlapping streams, and (d) non-adjoining streams. Accordingly, 4 algorithms (each satisfying at least 1 condition) were developed: (a) zero-leap, (b) fixed-leap, (c) scaled random-leap, and (d) unscaled random-leap. Note that the latter satisfied all 4 independent seeding conditions. To assess serial correlation, univariate and multivariate simulations were conducted at 3 equally spaced intervals for each algorithm (N=24) and measured using 3 randomness tests: (a) the serial correlation test, (b) the runs up test, and (c) the white noise test. A one-way balanced multivariate analysis of variance (MANOVA) was used to test 4 hypotheses: (a) omnibus, (b) contrast of unscaled vs. others, (c) contrast of scaled vs. others, and (d) contrast of fixed vs. others. The MANOVA assumptions of independence, normality, and homogeneity were satisfied. In sum, the seeding algorithms did not differ significantly from each other (omnibus hypothesis). For the contrast hypotheses, only the fixed-leap algorithm differed significantly from all other algorithms. Surprisingly, the scaled random-leap offered the least difference among the algorithms (theoretically this algorithm should have produced the second largest difference). Although not fully supported by the research design used in this study, it is thought that the unscaled random-leap algorithm is the best choice for independently seeding the multiplicative congruential random number generator. Accordingly, suggestions for f.
Publisher:
ISBN:
Category :
Languages : en
Pages :
Book Description
To be effective, a linear congruential random number generator (LCG) should produce values that are (a) uniformly distributed on the unit interval (0,1) excluding endpoints and (b) substantially free of serial correlation. It has been found that many statistical methods produce inflated Type I error rates for correlated observations. Theoretically, independently seeding an LCG under the following conditions attenuates serial correlation: (a) simple random sampling of seeds, (b) non-replicate streams, (c) non-overlapping streams, and (d) non-adjoining streams. Accordingly, 4 algorithms (each satisfying at least 1 condition) were developed: (a) zero-leap, (b) fixed-leap, (c) scaled random-leap, and (d) unscaled random-leap. Note that the latter satisfied all 4 independent seeding conditions. To assess serial correlation, univariate and multivariate simulations were conducted at 3 equally spaced intervals for each algorithm (N=24) and measured using 3 randomness tests: (a) the serial correlation test, (b) the runs up test, and (c) the white noise test. A one-way balanced multivariate analysis of variance (MANOVA) was used to test 4 hypotheses: (a) omnibus, (b) contrast of unscaled vs. others, (c) contrast of scaled vs. others, and (d) contrast of fixed vs. others. The MANOVA assumptions of independence, normality, and homogeneity were satisfied. In sum, the seeding algorithms did not differ significantly from each other (omnibus hypothesis). For the contrast hypotheses, only the fixed-leap algorithm differed significantly from all other algorithms. Surprisingly, the scaled random-leap offered the least difference among the algorithms (theoretically this algorithm should have produced the second largest difference). Although not fully supported by the research design used in this study, it is thought that the unscaled random-leap algorithm is the best choice for independently seeding the multiplicative congruential random number generator. Accordingly, suggestions for f.
Graphical Analysis of Some Pseudo-Random Number Generators
Author:
Publisher:
ISBN:
Category :
Languages : en
Pages : 0
Book Description
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 with the DOS operating system. This latter pseudo-random number generator is completely defective. Simple graphical methods for initial screening of pseudo-random number generators are given, and the problems which arise with bad pseudo-random number generators are detailed with graphics. Finally, recent work on obtaining even better pseudo-random number generators is discussed.
Publisher:
ISBN:
Category :
Languages : en
Pages : 0
Book Description
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 with the DOS operating system. This latter pseudo-random number generator is completely defective. Simple graphical methods for initial screening of pseudo-random number generators are given, and the problems which arise with bad pseudo-random number generators are detailed with graphics. Finally, recent work on obtaining even better pseudo-random number generators is discussed.
Graphical Analysis of Some Pseudo-Random Number Generators
Author: Peter A. Lewis
Publisher:
ISBN:
Category :
Languages : en
Pages : 21
Book Description
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 with the DOS operating system. This latter pseudo-random number generator is completely defective. Simple graphical methods for initial screening of pseudo-random number generators are given, and the problems which arise with bad pseudo-random number generators are detailed with graphics. Finally, recent work on obtaining even better pseudo-random number generators is discussed.
Publisher:
ISBN:
Category :
Languages : en
Pages : 21
Book Description
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 with the DOS operating system. This latter pseudo-random number generator is completely defective. Simple graphical methods for initial screening of pseudo-random number generators are given, and the problems which arise with bad pseudo-random number generators are detailed with graphics. Finally, recent work on obtaining even better pseudo-random number generators is discussed.
Abstracts of BESRL Research Publications
Author: Emma E. Brown
Publisher:
ISBN:
Category : Psychology
Languages : en
Pages : 68
Book Description
Publisher:
ISBN:
Category : Psychology
Languages : en
Pages : 68
Book Description
Monthly Catalogue, United States Public Documents
Author:
Publisher:
ISBN:
Category : Government publications
Languages : en
Pages : 1730
Book Description
Publisher:
ISBN:
Category : Government publications
Languages : en
Pages : 1730
Book Description
Random Signal Analysis in Engineering Systems
Author: John Komo
Publisher: Elsevier
ISBN: 0323156274
Category : Technology & Engineering
Languages : en
Pages : 317
Book Description
Random Signal Analysis in Engineering Systems
Publisher: Elsevier
ISBN: 0323156274
Category : Technology & Engineering
Languages : en
Pages : 317
Book Description
Random Signal Analysis in Engineering Systems