Data structures for efficient sampling from a set of weighted items are an important building block many applications. However, few parallel solutions known. We close these gaps. give efficient, fast, and practicable distributed algorithms data that support single (alias tables, compressed structures). This also yields simplified more space-efficient sequential algorithm alias table constructio...

The experiments were conducted for monitoring crop area by spatial sampling methods in a winter wheat main production region with a size of 42Km×42Km in Hengshui City, Hebei Province in China to optimize designs of the frameworks and elements (sample size, sample-square dimension), based on Remote Sensing (RS) and Geographical Information System (GIS) techniques. 5 sample-square dimension level...

We give a simple analysis of the competitive ratio of the random sampling auction from [10]. The random sampling auction was first shown to be worst-case competitive in [9] (with a bound of 7600 on its competitive ratio); our analysis improves the bound to 15. In support of the conjecture that random sampling auction is in fact 4-competitive, we show that on the equal revenue input, where any s...

| In this paper, we present new statistical sampling techniques for performing power estimation at the circuit level. These techniques rst transform the power estimation problem to a survey sampling problem, then apply stratiied random sampling to improve the eeciency of sampling. The stratiication is based on a low-cost predic-tor, such as zero delay power estimates. We also propose a two-stag...

The purpose of this paper is to find the estimate of the parameters of k and g   distribution for ranked set sample by numerically maximizing the likelihood function. The estimates named as numerical maximum likelihood estimate, and corresponding mean square error and relative efficiency compared to simple random sampling are computed using a computer simulation. Ranked set sampling is seen t...

We consider the design and analysis of algorithms to retrieve simple random samples from databases. Specifically, we examine simple random sampling from B+ tree files. Existing methods of sampling from B+ trees, require the use of auxiliary rank information in the nodes of the tree. Such modified B+ tree files are called “ranked B+ trees”. We compare sampling from ranked Bt tree files, with new...

Balanced acceptance sampling is a relatively new sampling scheme that has potential to improve the efficiency of spatial studies. There are two drawbacks of the design, it can have low entropy and some of the unbiased estimates can not be calculated. In this paper, such shortcomings have been addressed by integrating simple random sampling with balanced acceptance sampling. In a simulation stud...