{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:39:21Z","timestamp":1750307961146,"version":"3.41.0"},"reference-count":17,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2007,9,1]],"date-time":"2007-09-01T00:00:00Z","timestamp":1188604800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Model. Comput. Simul."],"published-print":{"date-parts":[[2007,9]]},"abstract":"<jats:p>We demonstrate that a majority of modern random number generators, such as the newest version of rand.c, ranlux, and combined multiple recursive generators, have some manifest correlations in their outputs if the initial state is filled up using another linear recurrence with similar modulus. Among 58 available generators in the GNU scientific library, 40 show such defects. This is not because of the recursion, but because of carelessly chosen initialization schemes in the implementations. A good initialization scheme eliminates this phenomenon.<\/jats:p>","DOI":"10.1145\/1276927.1276928","type":"journal-article","created":{"date-parts":[[2007,9,26]],"date-time":"2007-09-26T17:18:32Z","timestamp":1190827112000},"page":"15","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":31,"title":["Common defects in initialization of pseudorandom number generators"],"prefix":"10.1145","volume":"17","author":[{"given":"Makoto","family":"Matsumoto","sequence":"first","affiliation":[{"name":"Hiroshima University, Hiroshima, Japan"}]},{"given":"Isaku","family":"Wada","sequence":"additional","affiliation":[{"name":"Tempstaff Technologies"}]},{"given":"Ai","family":"Kuramoto","sequence":"additional","affiliation":[{"name":"Kumamoto University, Kumamoto, Japan"}]},{"given":"Hyo","family":"Ashihara","sequence":"additional","affiliation":[{"name":"Kumamoto University, Kumamoto, Japan"}]}],"member":"320","published-online":{"date-parts":[[2007,9]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00630563"},{"key":"e_1_2_1_2_1","unstructured":"GNU. 2004. GNU scientific library version 1.6. http:\/\/www.gnu.org\/software\/gsl\/.  GNU. 2004. GNU scientific library version 1.6. http:\/\/www.gnu.org\/software\/gsl\/."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0010-4655(94)90233-X"},{"key":"e_1_2_1_4_1","unstructured":"Knuth D. E. 1997. The Art of Computer Programming vol. 2. Seminumerical Algorithms 3rd ed. Addison-Wesley Reading MA.   Knuth D. E. 1997. The Art of Computer Programming vol. 2. Seminumerical Algorithms 3rd ed. Addison-Wesley Reading MA."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.44.5.816"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/167293.167354"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/169702.169698"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.50.6.1073.358"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-4754(97)00052-9"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0010-4655(94)90232-1"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2004.06.001"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/358407.358427"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/188307.188366"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/272991.272995"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-4754(02)00227-6"},{"key":"e_1_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Matsumoto M. and Nishimura T. 2000. The dynamic creation of pseudorandom number generators. In Monte Carlo and Quasi-Monte Carlo Methods. Springer 56--69.  Matsumoto M. and Nishimura T. 2000. The dynamic creation of pseudorandom number generators. In Monte Carlo and Quasi-Monte Carlo Methods. Springer 56--69.","DOI":"10.1007\/978-3-642-59657-5_3"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/159737.159749"}],"container-title":["ACM Transactions on Modeling and Computer Simulation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1276927.1276928","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1276927.1276928","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:58:04Z","timestamp":1750258684000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1276927.1276928"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,9]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2007,9]]}},"alternative-id":["10.1145\/1276927.1276928"],"URL":"https:\/\/doi.org\/10.1145\/1276927.1276928","relation":{},"ISSN":["1049-3301","1558-1195"],"issn-type":[{"type":"print","value":"1049-3301"},{"type":"electronic","value":"1558-1195"}],"subject":[],"published":{"date-parts":[[2007,9]]},"assertion":[{"value":"2007-09-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}