A Convenient Algorithm for Drawing a Simple Random Sample

Abstract

JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact support@jstor.org.

Development and partial validation of a mouse model for predicting drug hypersensitivity reactions

“…Specifically, a re-sampling technique was adopted to assess positivity of a drug for a given random sample of drugs (McLeod & Bellhouse, 1983). Briefly, the data were randomly sampled without replacement in a way such that there was exactly one animal for each drug (consequently, there were 18 animals/sample).…”

Reservoir Sampling over Memory-Limited Stream Joins

“…The conventional reservoir sampling [25] selects a uniform random sample of a fixed size, without replacement, from an input stream of an unknown size (see Algorithm 1). …”

“…A sampled tuple replaces a randomly selected tuple in the reservoir. This way, the reservoir always holds a uniform random sample of all the tuples seen from the beginning [25].…”

“…return 23: end if 24: end while 25: release δ memory units from the join buffer and allocate the released memory to the reservoir. 26: flip a biased coin to decide on x and y (Equation 3) 27: randomly evict r − x sample tuples from the reservoir 28: get y sample tuples out of m using Algorithm 1 29: continue sampling the input stream using Algorithm 1 k is an index of the original join output tuples that would be generated from the join.…”

“…A natural solution to keep a uniform random sample of the join output stream is to use reservoir sampling [25] [33]. Reservoir sampling selects a uniform random sample of a fixed size from an input stream of an unknown size.…”