Uniform random numbers : theory and practice
Author(s)
Bibliographic Information
Uniform random numbers : theory and practice
(The Kluwer international series in engineering and computer science, SECS 315 . Discrete event dynamic systems)
Kluwer Academic Publishers, c1995
Available at 29 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Note
Includes bibliographical references (p. [197]-205) and index
Description and Table of Contents
Description
In earlier forewords to the books in this series on Discrete Event Dynamic Systems (DEDS), we have dwelt on the pervasive nature of DEDS in our human-made world. From manufacturing plants to computer/communication networks, from traffic systems to command-and-control, modern civilization cannot function without the smooth operation of such systems. Yet mathemat ical tools for the analysis and synthesis of DEDS are nascent when compared to the well developed machinery of the continuous variable dynamic systems char acterized by differential equations. The performance evaluation tool of choice for DEDS is discrete event simulation both on account of its generality and its explicit incorporation of randomness. As it is well known to students of simulation, the heart of the random event simulation is the uniform random number generator. Not so well known to the practitioners are the philosophical and mathematical bases of generating "random" number sequence from deterministic algorithms. This editor can still recall his own painful introduction to the issues during the early 80's when he attempted to do the first perturbation analysis (PA) experiments on a per sonal computer which, unbeknownst to him, had a random number generator with a period of only 32,768 numbers. It is no exaggeration to say that the development of PA was derailed for some time due to this ignorance of the fundamentals of random number generation.
Table of Contents
Series Foreword by Yu-Chi Ho. Preface. 1: Introduction. 2: Preliminaries from Number Theory. 2.1. Modular Arithmetic. 2.2. Geometry of Numbers. 2.3. Uniform Distribution of Sequences. 3: Linear Congruential Generators. 3.1. Lattice Structure. 3.2. Spectral Test. 3.3. Implementing Long-Period LCGs. 4: Beyond Linear Congruential Generators. 4.1. LCGs Using Polynomial Arithmetic. 4.2. LCGs Using Multiplicative Inversion. 4.3. Random Sequences in Cryptography. 5: Statistical Tests. 5.1. Description of Test Procedures. 5.2. Tests Using Non-Uniform Random Variate Generation. 6: Derandomization. 6.1. Low-Discrepancy Sequences. 6.2. K-wise Independent Random Variables. A: Sample C Routines. References Index.
by "Nielsen BookData"