{"id":{"repo_id":"texas-state","oai_identifier":"oai:digital.library.txst.edu:10877/17808"},"canonical_url":"https://search.dev.ndltd.org/etd/texas-state/oai:digital.library.txst.edu:10877/17808","repository":{"repo_id":"texas-state","name":"Texas State University","base_url":"https://digital.library.txst.edu/server/oai/request"},"display":{"title":"Random Number Generators","abstract":"This paper is about pseudo-random number generators. In particular it is about pseudo-random number generators for the 16 bit computers. These machines include the IBM PC, XT, and AT. Thus this class comprises a large share of the PC market. The aim of the paper is to find a fast implementation of the prime modulus linear congruential style generator. The paper includes an historical introduction to the subject of random number generators and a discussion of the theoretical foundations for the prime modulus linear congruential generator. Sixteen bit arithmetic is a consequence of the goal of speed and much of the paper is devoted to schemes for dealing with partial results that exceed the available sixteen bits. This paper does not pretend to be the final word on pseudorandom number generators, its goals are much more modest. But within the chosen framework a fast and statistically sound generator is found.","abstract_html":"This paper is about pseudo-random number generators. In particular it is about pseudo-random number generators for the 16 bit computers. These machines include the IBM PC, XT, and AT. Thus this class comprises a large share of the PC market. The aim of the paper is to find a fast implementation of the prime modulus linear congruential style generator. The paper includes an historical introduction to the subject of random number generators and a discussion of the theoretical foundations for the prime modulus linear congruential generator. Sixteen bit arithmetic is a consequence of the goal of speed and much of the paper is devoted to schemes for dealing with partial results that exceed the available sixteen bits. This paper does not pretend to be the final word on pseudorandom number generators, its goals are much more modest. But within the chosen framework a fast and statistically sound generator is found.","abstract_has_math":false,"creators":["Sieben, John Thomas"],"institution":"Southwest Texas State University","degree_name":"Master of Science","degree_level":"Masters","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":1993,"date_issued":"1993-05","date_published":"1993-05","updated_at":"2026-07-27T21:22:43Z","subjects":["random number generators","IBM microcomputers"],"languages":["en"],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/10877/17808","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Sieben, John Thomas"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2023-12-19T23:45:50Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2023-12-19T23:45:50Z"]},{"key":"dc:date.issued","label":"Date","values":["1993-05"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Masters"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Southwest Texas State University"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["random number generators","IBM microcomputers"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/10877/17808"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["This paper is about pseudo-random number generators. In particular it is about pseudo-random number generators for the 16 bit computers. These machines include the IBM PC, XT, and AT. Thus this class comprises a large share of the PC market. The aim of the paper is to find a fast implementation of the prime modulus linear congruential style generator. The paper includes an historical introduction to the subject of random number generators and a discussion of the theoretical foundations for the prime modulus linear congruential generator. Sixteen bit arithmetic is a consequence of the goal of speed and much of the paper is devoted to schemes for dealing with partial results that exceed the available sixteen bits. This paper does not pretend to be the final word on pseudorandom number generators, its goals are much more modest. But within the chosen framework a fast and statistically sound generator is found."]},{"key":"dc:format","label":"Dc Format","values":["Text"]},{"key":"dc:format.medium","label":"Dc Format Medium","values":["1 file (.pdf)"]},{"key":"dc:title","label":"Title","values":["Random Number Generators"]}]}],"canonical_facts":{"dc:creator":["Sieben, John Thomas"],"dc:date.accessioned":["2023-12-19T23:45:50Z"],"dc:date.available":["2023-12-19T23:45:50Z"],"dc:date.issued":["1993-05"],"dc:description.abstract":["This paper is about pseudo-random number generators. In particular it is about pseudo-random number generators for the 16 bit computers. These machines include the IBM PC, XT, and AT. Thus this class comprises a large share of the PC market. The aim of the paper is to find a fast implementation of the prime modulus linear congruential style generator. The paper includes an historical introduction to the subject of random number generators and a discussion of the theoretical foundations for the prime modulus linear congruential generator. Sixteen bit arithmetic is a consequence of the goal of speed and much of the paper is devoted to schemes for dealing with partial results that exceed the available sixteen bits. This paper does not pretend to be the final word on pseudorandom number generators, its goals are much more modest. But within the chosen framework a fast and statistically sound generator is found."],"dc:format":["Text"],"dc:format.medium":["1 file (.pdf)"],"dc:identifier.uri":["https://hdl.handle.net/10877/17808"],"dc:language.iso":["en"],"dc:subject":["random number generators","IBM microcomputers"],"dc:title":["Random Number Generators"],"dc:type":["Thesis"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Masters"],"thesis:degree_name":["Master of Science"],"thesis:institution_name":["Southwest Texas State University"]},"updated_at":"2026-07-27T21:22:43Z"}