[Cryptech Tech] fyi: pcg-random.org: A Family of Better Random Number Generator

[=JeffH]

[ I saw this go by yesterday -- see pcg-random.org for paper and code ]


              Stanford EE Computer Systems Colloquium

                4:15PM, Wednesday, February 18, 2015
      NEC Auditorium, Gates Computer Science Building Room B3
                    http://ee380.stanford.edu[1]

>>>> PLEASE NOTE THE CORRECTED DATE -- Feb 18th.

Topic:    A Family of Better Random Number Generator

Speaker:  Melissa O'Neill
           Harvey Mudd College

About the talk:

Algorithmic random number generators are everywhere, used for all
kinds of tasks, from simulation to computational creativity.

Yet most people haven't given much thought to the random number
generators they use. Is the RNG you're using a good source of
randomness? What does it even mean to be a good RNG?

In this talk, we will examine the desirable properties of a
random number generator including performance, correctness,
uniformity, and unpredictability, as well as sound mathematical
grounding.

We will observe how the RNGs in widespread use lack desirable
properties (most commonly failing statistical tests for
randomness).

Then we will show how a simple twist on a venerable-but-flawed
RNG technique can provide all the properties we desire, resulting
in the PCG family of RNGs.

Slides:

There is no downloadable version of the slides for this talk
available at this time.

Videos:

Join the live presentation.[2] Wednesday January 14, 4:15-5:30. Â Requires
Microsoft Windows Media player.
View video by lecture sequence. [3] Winter 2015 only, HTML5.
Available after 8PM on the days of the lecture.
View Video on YouTube about 24 hours after the day of the
lecture.

About the speaker:

[speaker photo] Melissa O'Neill is a Professor of Computer
Science at Harvey Mudd College, where she has been a member of
the faculty since July, 2001. She was born in England, but did
her graduate work in Canada with F. Warren Burton at SFU. O'Neill
has broad interests in computer science, with contributions in
the areas of functional programming, memory management, parallel
and concurrent computing, genetic programming, random number
generation, and computer science education. She is perhaps best
known on the Internet for her JFP paper, The Genuine Sieve of
Eratosthenes [4], which showed that a simple example that had
been enjoyed by the functional programming community for more
than 30 years wasn't quite what it appeared to be. Her website is
www.cs.hmc.edu/~oneill[5] and the PCG website is
www.pcg-random.org[6].

Contact information:

Melissa O'Neill
Computer Science
Harvey Mudd College
oneill+pcgtalk at cs.hmc.edu [7]


Embedded Links:
[ 1 ]    http://ee380.stanford.edu
[ 2 ]    http://coursematerials.stanford.edu/live/ee380.asx
[ 3 ]    https://mvideos.stanford.edu/graduate#/SeminarDetail/Winter/2015/EE/380
[ 4 ]    http://www.cs.hmc.edu/~oneill/papers/Sieve-JFP.pdf
[ 5 ]    http://www.cs.hmc.edu/~oneill
[ 6 ]    http://www.pcg-random.org
[ 7 ]    mailto:oneill+pcgtalk at cs.hmc.edu


ABOUT THE COLLOQUIUM:

See the Colloquium website, http://ee380.stanford.edu, for scheduled
speakers, FAQ, and additional information.  Stanford and SCPD students
can enroll in EE380 for one unit of credit.  Anyone is welcome to attend;
talks are webcast live and archived for on-demand viewing over the web.

MAILING LIST INFORMATION:

This announcement is sent to multiple mailing lists. If you are signed
up on our private EE380 list you can remove yourself using the widget
at the upper left hand corner of the Colloquium web page. Other lists
have other management protocols.