Results 181 to 190 of about 11,341,287 (236)
Some of the next articles are maybe not open access.

Analysis of Logistic Map for Pseudorandom Number Generation in Game Development

arXiv.org
Many popular video games use pseudorandom number generators to create randomly distributed locations for game objects as highly unpredictable as possible.
Chen-Xiao Zhou
semanticscholar   +1 more source

Fast Gaussian Distributed Pseudorandom Number Generation in Java via the Ziggurat Algorithm

arXiv.org
We report on experiments with the ziggurat algorithm for generating Gaussian distributed random numbers. The study utilizes our open source Java implementation that was introduced originally for Java 11 at a time when the Java API only provided the much ...
Vincent A. Cicirello
semanticscholar   +1 more source

Enhanced Pseudorandom Number Generation using Mersenne-LFSR Fusion

2024 5th International Conference on Communication, Computing & Industry 6.0 (C2I6)
Pseudorandom number generators (PRNGs) are fundamental tools in various applications, including cryptography, simulation and statistical sampling. Traditional PRNGs often face challenges related to periodicity, randomness quality, and computational ...
Girish Kumar, S. Hegde, Veena M. B.
semanticscholar   +1 more source

Poster: Using Generative Adversarial Networks for Secure Pseudorandom Number Generation

Conference on Computer and Communications Security, 2019
Generation of secure random numbers has always been a challenging issue in design and development of secure computer systems. Random numbers have important applications in the field of cryptography where the security of the scheme relies upon the random ...
Rajvardhan Oak   +2 more
semanticscholar   +1 more source

A pseudorandom number generator

SIMULATION, 1985
A simple deterministic algorithm produces a finite sequence which exhibits three iniportant statistical properties. This algo rithm should prove to be useful in simulating some random processes.
openaire   +1 more source

Pseudorandom Number Generators

2017
In this chapter, the author considers existing methods and means of forming pseudo-random sequences of numbers and also are described the main characteristics of random and pseudorandom sequences of numbers. The main theoretical aspects of the construction of pseudo-random number generators are considered.
openaire   +1 more source

Pseudorandom Number Generation by Nonlinear Methods

International Statistical Review / Revue Internationale de Statistique, 1995
A survey paper on some properties of low discrepancy sequences (LDS). The paper summarises results on LDS based on inversive congruential sequences \((y_n)\), \(y_n = \text{inv}(a^*n + b)\), \(\text{inv}(x) = x^{p + 2} \text{mod } p\), \(p\) is a prime greater than 5.
Jürgen Eichenauer-Herrmann   +1 more
openaire   +2 more sources

Lower bounds for pseudorandom number generators

30th Annual Symposium on Foundations of Computer Science, 1989
Computational resources necessary to generate pseudorandom strings are studied. In particular, lower bounds are proved for pseudorandom number generators, whereas previous research concentrated on upper bounds. The idea of separation of machine-based complexity classes on the basis of their ability (or inability) to generate pseudorandom strings is ...
Michael Kharitonov   +2 more
openaire   +2 more sources

Teaching labs on pseudorandom number generation

Proceedings of the 17th ACM annual conference on Innovation and technology in computer science education, 2012
This presentation describes our approach to teaching pseudorandom number generation (PRNG) in CS labs. We use PRNG at two universities as an example of an application of sequential circuitry in our digital logic courses. Our goal is for our students to have meaningful assignments, and to relate digital logic not only to the larger CS curriculum, but to
openaire   +1 more source

Dynamic Creation of Pseudorandom Number Generators

2000
We propose a new scheme Dynamic Creation (DC) of pseudorandom number generators (PRNG) for large scale Monte Carlo simulations in parallel or distributed systems. DC receives user’s specification such as word size, period, size of working area, together with a process ID (or a set of IDs).
Matsumoto, M., Nishimura, T.
openaire   +2 more sources

Home - About - Disclaimer - Privacy