

\subsection{\bf Initialization of}
\subsection{\bf Pseudorandom Numbers}
\begin{slide}
\begin{itemize}
\item The shift register method is unpopular because it is newer and
because it is harder to initialize.  However, Chiu describes a
reasonable way using a congruential generator to get first random
numbers.

\item Typically, a random number package includes a call to a routine
with a name like ranset.  

\begin{description}
\item{$\bullet$} A call ranset (seed) 
\item{$\bullet$} sets $I_0 = $ seed for the congruential method.
\end{description}

\item If you want a truly random start, a standard ``dodge'' is to set
the seed to the binary image (remember $I_0$ is just a (32 bit)
integer) of the system clock.

\item One may wish to redo a calculation with the same initial seed so
use
\begin{description}
\item{} clock (seed)
\item{} print ( in binary form, seed)
\item{} ranset (seed)
\end{description}
\end{itemize}
\end{slide}

