This study examines the efficiency of EPI cluster sampling in assessing the prevalence of diarrhoea and dysentery. A computer was used to simulate fieldwork carried out by a survey taker. The bias and variance of prevalence estimates obtained using EPI cluster sampling were compared with those obtained using simple random sampling and cluster (stratified random) sampling. Efficiency ratios, cal...

One problem caused by cycles of choice functions is indecisiveness—decision makers will be paralyzed when they face choice sets with more than two options. We investigate the procedure of “random sampling” where the alternatives are random variables. When comparing any two alternatives, the decision maker samples each of the alternatives once and ranks them according to the comparison between t...

A sequential random search method for the global minimization of a continuous function is proposed. The algorithm gradually concentrates the random search effort on areas neighboring the global minima. A modification is included for the case that the function cannot be exactly evaluated. The global convergence and the asymptotical optimality of the sequential sampling procedure are proved for b...

List of included articles [1] H. Rauhut. Random sampling of sparse trigonometric polynomials. Appl. Comput. [2] S. Kunis and H. Rauhut. Random sampling of sparse trigonometric polynomials II-orthogonal matching pursuit versus basis pursuit. [3] H. Rauhut. Stability results for random sampling of sparse trigonometric polynomi-als. [4] H. Rauhut. On the impossibility of uniform sparse reconstruct...

Random sampling is an important tool in the design of parallel algorithms. Using random sampling it is possible to obtain simple parallel algorithms which are e cient in practice. We will focus on the use of random sampling in fundamental problems such as sorting, selection, list ranking and graph connectivity.