相关论文: Xorshift random number generators from primitive p…

The pseudo-random number generators (PRNGs), sampling algorithms, and algorithms for generating random integers in some common statistical packages and programming languages are unnecessarily inaccurate, by an amount that may matter for…

Capacity is an important tool in decision-making under risk and uncertainty and multi-criteria decision-making. When learning a capacity-based model, it is important to be able to generate uniformly a capacity. Due to the monotonicity…

The paper develops techniques in order to construct computer programs, pseudorandom number generators (PRNG), that produce uniformly distributed sequences. The paper exploits an approach that treats standard processor instructions…

Conventional random number generators provide the speed but not necessarily the high quality output streams needed for large-scale stochastic simulations. Cryptographically-based generators, on the other hand, provide superior quality…

The authors of [Primitive orthogonal idempotents for R-trivial monoids, Journal of Algebra] provide an algorithm for finding a complete system of primitive orthogonal idempotents for CM, where M is any finite R-trivial monoid. Their method…

We combine the design of two \emph{random number generators}, \emph{Mersenne Twister} and \emph{Xorgens}, to obtain a new class of generators with heavy-weight characteristic polynomials (exceeded only by the {\sc well} generators) and high…

We consider the classical problem of invariant generation for programs with polynomial assignments and focus on synthesizing invariants that are a conjunction of strict polynomial inequalities. We present a sound and semi-complete method…

Hybrid quantum-classical algorithms appear to be the most promising approach for near-term quantum applications. An important bottleneck is the classical optimization loop, where the multiple local minima and the emergence of barren…

We use the order complex corresponding to a symmetric matrix (defined by Giusti et al in 2015). In this note, we use it to define a class of models of random graphs, and show some surprising experimental results, showing sharp phase…

We introduce the Collatz-Weyl Generators, a family of uniform pseudorandom number generators (PRNGs) which are based on generalized Collatz mappings, derived from the Collatz conjecture and Weyl sequences. The high-quality statistical…

We propose an approach for fast random number generation based on homemade optical physical unclonable functions (PUFs). The optical PUF is illuminated with input laser wavefront of continuous modulation to obtain different speckle…

The advent of fault-tolerant quantum computers marks a significant milestone, yet the development of practical quantum algorithms remains a critical challenge. Effective quantum algorithms are essential for leveraging the power of quantum…

Quantum random number generation (QRNG) harnesses the intrinsic randomness of quantum mechanical phenomena. Demonstrations of such processes have, however, been limited to probabilistic sources, for instance, spontaneous parametric…

We describe a straightforward method to generate a random prime q such that the multiplicative group GF(q)* also has a random large prime-order subgroup. The described algorithm also yields this order p as well as a p'th primitive root of…

The restarted primal-dual hybrid gradient method (rPDHG) is a first-order method that has recently received significant attention for its computational effectiveness in solving linear program (LP) problems. Despite its impressive practical…

In 2009, Sol\'{e} and Zinoviev (\emph{Eur. J. Combin.}, vol. 30, no. 2, pp. 458-467, 2009) proposed an open problem of arithmetic interest to study the period of the inversive pseudorandom number generators (IPRNGs) and to give conditions…

Although it is well-known that the complex cobordism ring is a polynomial ring $\Omega_{*}^{U}\cong\mathbb{Z}\left[\alpha_{1},\alpha_{2},\ldots\right]$, an explicit description for convenient generators $\alpha_{1},\alpha_{2},\ldots$ has…

Algorithms to generate various combinatorial structures find tremendous importance in computer science. In this paper, we begin by reviewing an algorithm proposed by Rohl that generates all unique permutations of a list of elements which…

A random number generator is proposed based on a theorem about existence of chaos in fixed point iteration of x= cot2(x). Digital computer simulation of this function iteration exhibits random behavior. A method is proposed to extract…

A major problem in using iterative number generators of the form x_i=f(x_{i-1}) is that they can enter unexpectedly short cycles. This is hard to analyze when the generator is designed, hard to detect in real time when the generator is…