Results 1  10
of
180
Random Testing
 Encyclopedia of Software Engineering
, 1994
"... this technical sense; however, it is certainly not the most used method.) If the technical meaning contrasts "random" with "systematic," it is in the sense that fluctuations in physical measurements are random (unpredictable or chaotic) vs. systematic (causal or lawful). Why is i ..."
Abstract

Cited by 95 (7 self)
 Add to MetaCart
is it desirable to be "unsystematic" on purpose in selecting test data for a program? (1) Because there are efficient methods of selecting random points algorithmically, by computing pseudorandom numbers; thus a vast number of tests can be easily defined. (2) Because statistical independence among test
Evolving a Computer Program to Generate Random Numbers Using the Genetic Programming Paradigm
, 1991
"... This paper demonstrates that it is possible to genetically breed a computer program that is considered difficult to write, namely, a randomizer that converts a sequence of consecutive integers into pseudorandom bits with near maximal entropy. ..."
Abstract

Cited by 40 (5 self)
 Add to MetaCart
This paper demonstrates that it is possible to genetically breed a computer program that is considered difficult to write, namely, a randomizer that converts a sequence of consecutive integers into pseudorandom bits with near maximal entropy.
The discrete logarithm modulo a composite hides O(n) bits
 JOURNAL OF COMPUTER AND SYSTEM SCIENCES
, 1993
"... In this paper we consider the oneway function fg�N(X) =g X (modN), where N is a Blum integer. We prove that under the commonly assumed intractability of factoring Blum integers, all its bits are individually hard, and the lower as well as upper halves of them are simultaneously hard. As a result, f ..."
Abstract

Cited by 33 (1 self)
 Add to MetaCart
In this paper we consider the oneway function fg�N(X) =g X (modN), where N is a Blum integer. We prove that under the commonly assumed intractability of factoring Blum integers, all its bits are individually hard, and the lower as well as upper halves of them are simultaneously hard. As a result
SIMDoriented fast Mersenne twister: A 128bit pseudorandom number generator
 and QuasiMonte Carlo Methods 2006
, 2007
"... Summary. Mersenne Twister (MT) is a widelyused fast pseudorandom number generator (PRNG) with a long period of 2 19937 − 1, designed 10 years ago based on 32bit operations. In this decade, CPUs for personal computers have acquired new features, such as Single Instruction Multiple Data (SIMD) opera ..."
Abstract

Cited by 47 (4 self)
 Add to MetaCart
Summary. Mersenne Twister (MT) is a widelyused fast pseudorandom number generator (PRNG) with a long period of 2 19937 − 1, designed 10 years ago based on 32bit operations. In this decade, CPUs for personal computers have acquired new features, such as Single Instruction Multiple Data (SIMD
Uniformly distributed sequences of padic integers
 Math. Appl
, 2002
"... Abstract. The paper describes ergodic (with respect to the Haar measure) functions in the class of all functions that are defined on (and take values in) the ring Zp of padic integers, and satisfy (at least, locally) the Lipschitz condition with coefficient 1. Equiprobable (in particular, measurep ..."
Abstract

Cited by 35 (9 self)
 Add to MetaCart
Abstract. The paper describes ergodic (with respect to the Haar measure) functions in the class of all functions that are defined on (and take values in) the ring Zp of padic integers, and satisfy (at least, locally) the Lipschitz condition with coefficient 1. Equiprobable (in particular, measure
On entry, argument
"... nag_rand_sample (g05ndc) selects a pseudorandom sample without replacement from an integer vector. ..."
Abstract
 Add to MetaCart
nag_rand_sample (g05ndc) selects a pseudorandom sample without replacement from an integer vector.
NAG C Library Function Document nag_rngs_permute (g05nac)
"... nag_rngs_permute (g05nac) performs a pseudorandom permutation of a vector of integers. ..."
Abstract
 Add to MetaCart
nag_rngs_permute (g05nac) performs a pseudorandom permutation of a vector of integers.
PseudoRandom Functions and Factoring
 Proc. 32nd ACM Symp. on Theory of Computing
, 2000
"... The computational hardness of factoring integers is the most established assumption on which cryptographic primitives are based. This work presents an efficient construction of pseudorandom functions whose security is based on the intractability of factoring. In particular, we are able to constru ..."
Abstract

Cited by 18 (3 self)
 Add to MetaCart
The computational hardness of factoring integers is the most established assumption on which cryptographic primitives are based. This work presents an efficient construction of pseudorandom functions whose security is based on the intractability of factoring. In particular, we are able
Extensible Lattice Sequences For QuasiMonte Carlo Quadrature
 SIAM Journal on Scientific Computing
, 1999
"... Integration lattices are one of the main types of low discrepancy sets used in quasiMonte Carlo methods. However, they have the disadvantage of being of fixed size. This article describes the construction of an infinite sequence of points, the first b m of which form a lattice for any nonnegative ..."
Abstract

Cited by 35 (11 self)
 Add to MetaCart
negative integer m. Thus, if the quadrature error using an initial lattice is too large, the lattice can be extended without discarding the original points. Generating vectors for extensible lattices are found by minimizing a loss function based on some measure of discrepancy or nonuniformity of the lattice
P A INVERSIVE CONGRUENTIAL GENERATOR WITH A VARIABLE SHIFT OF PSEUDORANDOM POINTS OVER THE COMPLEX PLANE
, 2015
"... Abstract: Consider the generator of pseudorandom points on unit square produced by the inversive congruential recursion over the ring of Gaussian integers. Study the exponential sums on sequences of these points. ..."
Abstract
 Add to MetaCart
Abstract: Consider the generator of pseudorandom points on unit square produced by the inversive congruential recursion over the ring of Gaussian integers. Study the exponential sums on sequences of these points.
Results 1  10
of
180