
	Where results make sense

Topic: Pseudorandom number sequence

Related Topics

Random number

Pseudorandom number generator

Pseudonoise

Uniform distribution

In the News (Mon 21 Dec 09)

Northern Trust

Marvin Harrison

Peter Chernin

Gary Locke

Match Play

Penelope Cruz

Mickey Rourke

AR Rahman

Danny Boyle

Hugh Jackman

	NationMaster - Encyclopedia: Pseudorandom number sequence
		A Pseudorandom number sequence is a sequence of numbers that has been computed by some defined arithmetic process but is effectively a random number sequence for the purpose for which it is required.
		This sequence is known as a chip and the inverse of its period as chip rate.
		Pseudorandom noise is used in some electronic musical instruments, either by itself or as an input to subtractive synthesis.
	www.nationmaster.com /encyclopedia/Pseudorandom-number-sequence (193 words)

	Definition: pseudorandom number sequence
		An ordered set of numbers that has been determined by some defined arithmetic process but is effectively a random number sequence for the purpose for which it is required.
		A sequence of numbers that satisfies one or more of the standard tests for statistical randomness.
		Note: Although a pseudorandom number sequence appears to lack any definite pattern, it will repeat after a very long time interval or after a very long sequence of numbers.
	www.atis.org /tg2k/_pseudorandom_number_sequence.html (111 words)

	Pseudorandom noise - Wikipedia, the free encyclopedia
		In cryptography, pseudorandom noise (PRN) is a signal similar to noise which satisfies one or more of the standard tests for statistical randomness.
		This sequence is known as a chip and the inverse of its period as chip rate.
		Pseudorandom noise is used in some electronic musical instruments, either by itself or as an input to subtractive synthesis.
	en.wikipedia.org /wiki/Chip_rate (166 words)

	Pseudorandom number generator - LearnThis.Info Enclyclopedia (Site not responding. Last check: 2007-08-31)
		A pseudorandom number generator (PRNG) is an algorithm which generates a sequence of numbers, the elements of which are approximately independent of each other.
		The outputs of pseudorandom number generators are not truly random—they only approximate some of the properties of random numbers.
		However, it is possible to efficiently analyze the output of the Mersenne Twister and recognize the numbers as being non-random (as with the Berlekamp-Massey algorithm or an extension from it, such as the Reed-Sloane algorithm).
	encyclopedia.learnthis.info /p/ps/pseudorandom_number_generator.html (650 words)

	Pseudo-random number sequence generator - Patent 4047008
		A pseudo-random number sequence generator according to claim 1 wherein said logic function generator means comprises means for performing modulo two addition and wherein the result equals the modulo two sum of the first number and the second number.
		A pseudo-random number sequence generator according to claim 1 wherein said control means periodically provides control signals in predetermined timed relationship to enable read and write functions of said random access memory means and for enabling operations of said logic function generator means according to a preselected sequence.
		A pseudo-random number sequence generator according to claim 4 further comprising a clock source having a rate NR, where R is the desired output bit rate, a divide by N counter having parallel output stages and an input connected to said clock source, and wherein said control means comprises a read only memory.
	www.freepatentsonline.com /4047008.html (3247 words)

	Pseudorandom number sequence: Definition and Links by Encyclopedian.com - All about Pseudorandom number sequence
		A sequence of numbers that has been computed by some defined arithmetic process but is effectively a random number sequence for the purpose for which it is required.
		Note: Although a pseudorandom number sequence in this sense often appears to lack any definite pattern, any pseudorandom number generator with a finite internal state will repeat after a very long sequence of numbers.
		A sequence of numbers that satisfies one or more of the standard tests for statistical randomness.
	www.encyclopedian.com /ps/Pseudorandom-number-sequence.html (140 words)

	RANDOM NUMBERS
		Random number sequences are also used in the design of complex systems such as a new highway.
		A particularly useful random number sequence is the uniform random number sequence.
		Because a random number sequence is supposed to be random, there cannot be any computer algorithm that iteratively computes truly random numbers.
	home.earthlink.net /~ddruml/random2.htm (958 words)

	Television deghosting apparatus using pseudorandom sequence detector - Patent 5280355
		Apparatus for detecting the presence of a pseudorandom number (PRN) sequence used in a television receiver for reducing multipath interference such as image ghosts includes a multiplier responsive to a video signal containing the PRN sequence test signal component, and to a delayed version of such video signal.
		Specifically, a pseudorandom sequence training signal is incorporated in a horizontal line within a vertical blanking interval of a broadcast television signal.
		The presence of a pseudorandom sequence causes the correlator output to exceed a threshold, whereby the video signal portion (e.g., line) containing the pseudorandom sequence is selected for processing to develop coefficients for configuring a filter so as to cancel multipath effects such as image ghosts.
	www.freepatentsonline.com /5280355.html (2528 words)

	Pseudorandom noise - FreeEncyclopedia (Site not responding. Last check: 2007-08-31)
		Pseudorandom noise is noise that satisfies one or more of the standard tests for statistical randomness.
		Although it seems to lack any definite pattern, pseudorandom noise consists of a sequence of pulses that will usually repeat itself, albeit after a long time or a long sequence of pulses.
		For example, in spread-spectrum systems, modulated carrier transmissions appear as pseudorandom noise to a receiver (a) that is not locked on the transmitter frequencies or (b) that is incapable of correlating a locally generated pseudorandom code with the received signal.
	openproxy.ath.cx /ps/Pseudorandom_noise.html (104 words)

	Inverse transform sampling method - Wikipédia
		The inverse transform sampling method is a method of sampling a number at random from any probability distribution, given its cumulative distribution function (cdf).
		Generate a random number from the standard uniform distribution; call this u.
		to be the random number drawn from the distribution described by d(x).
	su.wikipedia.org /wiki/Inverse_transform_sampling_method (193 words)

	Hardware random number generators
		A hardware random number generator uses a physical phenomenon such as electrical noise from a resistor or semiconductor diode or the decay of a radioactive material for the initial source of randomness.
		The present day hardware random number generators are really too slow for routine use in statistical simulations although it might be very sensible to use them for cross-checking simulations using pseudo-random number generators.
		A hardware random number generator is different from a pseudo-random number generator, which uses a formula for generating the numbers.
	www.robertnz.net /hwrng.htm (4444 words)

	Pseudorandom Number Generator - Programs - Brian's Casio Calculator Corner
		One class of pseudorandom number generators that has stood the test of time as both simple and “good enough” for a great many purposes are the linear congruential generators.
		Multiplying the [0,1) pseudorandom number by b-a would result in a [0,b-a) pseudorandom number, and adding a would then result in a [a,b) pseudorandom number.
		Pseudorandom numbers from any other desired distribution may be generated from the [0,1) real uniformly distributed pseudorandom numbers by applying the inverse cumulative distribution function of the distribution required.
	www.brianhetrick.com /casio/gmrandom.html (1175 words)

	Directory - Computers: Algorithms: Pseudorandom Numbers (Site not responding. Last check: 2007-08-31)
		NIST: Random Number Generation and Testing · cached · Project to develop a battery of statistical tests to detect nonrandomness in binary sequences, to produce documentation and a software implementation of these tests, and to provide guidance in the use of these tests.
		HENKOS Pseudorandom Number Generator · iweb · cached · Presents and evaluates this generator, intended for use as a key generator for a one-time pad cipher.
		UNURAN · cached · Universal Non-Uniform RANdom number generators: a GPL library of C functions to generate nonuniform random numbers, by Josef Leydold and Wolfgang Hoermann of the University of Economics, Vienna.
	www.incywincy.com /default?p=452539 (377 words)

	Inverse transform sampling method - Wikipedia, the free encyclopedia
		We want to generate values of x which are distributed according to this distribution.
		Many programming languages have the ability to generate pseudo-random numbers which are effectively distributed according to the standard uniform distribution.
		If a random variable has that distribution, then the probability of its falling within any subinterval (a, b) of the interval from 0 to 1 is just the length b - a of that subinterval.
	www.wikipedia.com /wiki/Inversetransform_sampling_method (202 words)

	Pseudorandom Number Sequence Test Program
		The program is useful for evaluating pseudorandom number generators for encryption and statistical sampling applications, compression algorithms, and other applications where the information density of a file is of interest.
		The chi-square distribution is calculated for the stream of bytes in the file and expressed as an absolute number and a percentage which indicates how frequently a truly random sequence would exceed the value calculated.
		Percentages between 90% and 95% and 5% and 10% indicate the sequence is “almost suspect”.
	ftp.fourmilab.ch /random (1341 words)

	Thread-safety and POSIX.1
		function is required to synchronize (that is, serialize) calls to itself, so that a thread is forced to "finish" acquiring one pseudorandom number in a sequence before another thread can begin to acquire the next number in the sequence.
		to generate a "reliable" process-wide pseudorandom number sequence (that is, a sequence without replicates).
		to generate an arbitrary number of uncorrelated sequences of pseudorandom numbers (each sequence governed by a distinct seed), which could prove to be useful in Monte Carlo simulations and other similar applications.
	www.unix.org /whitepapers/reentrant.html (1313 words)

	Pseudorandom number generators
		In principal there exist as many algorithms for generating a sequence of N PRNs as there exist sequences since any enumeration of N PRNs actually is an algorithmic description of this sequence.
		Without doubt, the sequence will, in almost all cases, not be what we would like to call an pseudorandom sequence of numbers in the sense of the definition given in the last section.
		A very interesting approach in order to get longer sequences, the so-called compound method which uses some basic generators of the type LCG, EICG or ICG and adds their output modulo one, will not be discussed in this paper.
	random.mat.sbg.ac.at /~ste/dipl/node13.html (658 words)

	Tools
		(A Pseudorandom Number Sequence Test Program developed by John Walker) which applies various tests to sequences of bytes generated by the GNU Crypto library pseudo-random number generator implementations.
		It is useful for those evaluating pseudorandom number generators for encryption and statistical sampling applications, compression algorithms, and other applications where the various computed indices are of interest.
		Thechi-square distribution is calculated for the stream of bits in the file and expressed as an absolute number and a percentage which indicates how frequently a truly random sequence would exceed the value calculated.
	www.gnu.org /software/gnu-crypto/tools.html (651 words)

	Visual Directory
		Project to develop a battery of statistical tests to detect nonrandomness in binary sequences, to produce documentation and a software implementation of these tests, and to provide guidance in the use of these tests.
		Random number generators and pointers to software at the National HPCC Software Exchange for generating and testing pseudo-random numbers on high-performance computers.
		Universal Non-Uniform RANdom number generators: a GPL library of C functions to generate nonuniform random numbers, by Josef Leydold and Wolfgang Hoermann of the University of Economics, Vienna.
	interbank-ny.com /dir.php?c=/Computers/Algorithms/Pseudorandom_Numbers (341 words)

	Studies of Random Numbers - Ilpo Vattulainen (Site not responding. Last check: 2007-08-31)
		Random numbers are used in various numerical techniques such as the Monte Carlo (MC) method and Langevin dynamics, in which random numbers serve to introduce the stochastic dynamics to these methods.
		Although it is obvious that these pseudorandom number sequences can be ``random'' only in some limited sense, their imitation of truly random behavior is often good enough for cases in which a very high quality of random numbers is not an essential requirement.
		Here the idea is to consider a number of diffusing random walkers, each of which is governed by a distinct random number sequence, and study their mutual correlations.
	www.physics.helsinki.fi /~vattulai/rngs.html (484 words)

	SSL 3.0 Specification
		In either case the length declares the number of bytes, not the number of elements, in the vector.
		In stream cipher encryption, the plaintext is exclusive-ORed with an identical amount of output generated from a cryptographically-secure keyed pseudorandom number generator.
		Sequence numbers are of type uint64 and may not exceed 2
	wp.netscape.com /eng/ssl3/3-SPEC.HTM (7165 words)

	Open Directory - Computers: Algorithms: Pseudorandom Numbers
		HENKOS Pseudorandom Number Generator - Presents and evaluates this generator, intended for use as a key generator for a one-time pad cipher.
		NIST: Random Number Generation and Testing - Project to develop a battery of statistical tests to detect nonrandomness in binary sequences, to produce documentation and a software implementation of these tests, and to provide guidance in the use of these tests.
		UNURAN - Universal Non-Uniform RANdom number generators: a GPL library of C functions to generate nonuniform random numbers, by Josef Leydold and Wolfgang Hoermann of the University of Economics, Vienna.
	www.dmoz.org /Computers/Algorithms/Pseudorandom_Numbers (421 words)

	RANDOM NUMBER GENERATION (LUC DEVROYE) (Site not responding. Last check: 2007-08-31)
		A C++ library for generating sequences of random numbers from a wide variety of distributions.
		The "Workshop on random number generators and highly uniform point sets", to be hel June 17-28, 2002, at the CRM in Montreal.
		Has links, lists of researchers, and generic implementations of the linear congruential, inversive congruential, and explicit inversive congruential random number generators in ANSI C. pLab is an object oriented system for generating and testing random numbers written in C++.
	cgm.cs.mcgill.ca /~luc/rng.html (1485 words)

	5. Random Generators and Distributions
		Currently the default pseudorandom number generator Random is an instance of the class Ran002 which currently seems to be reliable, although it is not the fastest one (for faster and possibly better generators see below).
		The basic pseudorandom numbers are generated using the method of the given pseudorandom generator ran and transformed to the given probability distribution.
		In this section pseudorandom number generators are described, which do not fit into our nice scheme, but which are too important to be omitted.
	www.cip.physik.tu-muenchen.de /~gammel/matpack/html/LibDoc/Numbers/Random.html (4385 words)

	Pseudorandom number sequence - Encyclopedia, History, Geography and Biography (Site not responding. Last check: 2007-08-31)
		Pseudorandom number sequence - Encyclopedia, History, Geography and Biography
		This page was last modified 19:37, 8 Jun 2005.
		This encyclopedia, history, geography and biography article about Pseudorandom number sequence contains research on
	www.arikah.net /encyclopedia/Pseudorandom_number_sequence (122 words)

	Random Number Generators >> Literature
		For those who want to understand the goals and the limitations of empirical testing of random number generators (and why undefined notions like "independence of random numbers", and "statistical properties of numbers" should be avoided), there is a Master's thesis dedicated to these questions, written by Stefan Wegenkittl.
		The theory of uniform distribution of sequences, a sub field of number-theory, is not concerned with randomness but provides highly useful tools to construct theoretical "figures of merit" for random number generators.
		Niederreiter, H. and Shparlinski, I.~E.: On the distribution and lattice structure of nonlinear congruential pseudorandom numbers.
	random.mat.sbg.ac.at /literature (1846 words)

	RngPack: High-Quality Random Numbers for Java
		RngPack 1.1a fixes a number of serious bugs in RngPack 1.0 including an incorrect coefficient in the Ranecu implementation and an off-by-one error in the choice() method.
		RngPack is a pseudorandom number generator package for Java.
		Pseudorandom means that the "random" numbers are generated by a deterministic mathematical process, not by a fundamentally random physical process such as radioactive decay or Johnson noise.
	www.honeylocust.com /RngPack (521 words)

	HotBits: Genuine Random Numbers
		Computer-generated “random” numbers are more properly referred to as pseudorandom numbers, and pseudorandom sequences of such numbers.
		A variety of clever algorithms have been developed which generate sequences of numbers which pass every statistical test used to distinguish random sequences from those containing some pattern or internal order.
		A test program is available at this site which applies such tests to sequences of bytes and reports how random they appear to be, and if you run this program on data generated by a high-quality pseudorandom sequence generator, you'll find it generates data that are indistinguishable from a sequence of bytes chosen at random.
	www.fourmilab.ch /hotbits (396 words)

Try your search on: Qwika (all wikis)