comparison src/DLD-FUNCTIONS/rand.cc @ 7171:9bc096bc59d4

[project @ 2007-11-13 18:02:51 by jwe]
author jwe
date Tue, 13 Nov 2007 18:02:52 +0000
parents 81bed50b9feb
children 1c7b3e1fda19 a4d0680f4dda
comparison
equal deleted inserted replaced
7170:9f38c6293317 7171:9bc096bc59d4
344 To compute the psuedo-random sequence, @code{rand} uses the Mersenne\n\ 344 To compute the psuedo-random sequence, @code{rand} uses the Mersenne\n\
345 Twister with a period of 2^19937-1 (See M. Matsumoto and T. Nishimura,\n\ 345 Twister with a period of 2^19937-1 (See M. Matsumoto and T. Nishimura,\n\
346 ``Mersenne Twister: A 623-dimensionally\n\ 346 ``Mersenne Twister: A 623-dimensionally\n\
347 equidistributed uniform pseudorandom number generator'', ACM Trans. on\n\ 347 equidistributed uniform pseudorandom number generator'', ACM Trans. on\n\
348 Modeling and Computer Simulation Vol. 8, No. 1, January pp.3-30 1998,\n\ 348 Modeling and Computer Simulation Vol. 8, No. 1, January pp.3-30 1998,\n\
349 @url{http://www.math.keio.ac.jp/~matumoto/emt.html}).\n\ 349 @url{http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/emt.html}).\n\
350 Do @strong{not} use for cryptography without securely hashing\n\ 350 Do @strong{not} use for cryptography without securely hashing\n\
351 several returned values together, otherwise the generator state\n\ 351 several returned values together, otherwise the generator state\n\
352 can be learned after reading 624 consecutive values.\n\ 352 can be learned after reading 624 consecutive values.\n\
353 \n\ 353 \n\
354 Older versions of Octave used a different random number generator.\n\ 354 Older versions of Octave used a different random number generator.\n\