On the optimality of a class of minimal covering designs

It is shown that the minimal covering designs for v=6t+5 treatments in blocks of size 3 are optimal w.r.t. a large class of optimality criteria. This class of optimality criteria includes the well-known criteria of A-, D- and E-optimality. It is conjectured that these designs are also optimal w.r.t. other criteria suggested by Takeuchi (1961).     

On uniform approximation of Poisson variates by normal ones

In this paper the accuracy of the normal approximation to the Poisson is treated from the viewpoint of direct approximation of Poisson variables by normal ones. The conclusions that are derived on the accuracy of this approximation lead (among others) to very useful results on confidence limits for the mean of a linear combination of independent Poisson variables; these latter are employed in precise determination of the composition of a mixture of radioactive isotopes by means of a scintillation counter.     

A quest for certain linear spaces on thirty points

We investigate the structure of linear spaces on 30 points which have no lines of sizes 2, 3, 6, 30.     

Rank-order tests for the parallelism of several regression surfaces

For testing the hypothesis that several (s?2) linear regression surfaces X_ki=α_k+β_kc_ki+Z_ki (k=1,…,s) are parallel to one another, i.e., β₁=?=β_s, a class of rank-order tests are considered. The tests are shown to be asymptotically distribution-free, and their asymptotic efficiency relative to the general likelihood ratio test is derived. Asymptotic optimality in the sense of Wald is also discussed.     

Scrambled randomized response methods for obtaining sensitive quantitative data

We study a multiplicative randomized response method for obtaining responses to sensitive questions when the answers are quantitative. The method involves the respondent multiplying his sensitive answer by a random number from a known distribution, and giving the product to the interviewer, who does not know the value of the random number and thus receives a scrambled response. Some particular distributions for the random scrambling number are proposed and studied, and ways of generating the scrambling numbers are discussed. Some modifications for increasing the efficiency of the method are proposed, and numerical results are given that show the scrambled response method is generally superior to the previously used method of randomizing questions.     

Binary-image restoration

We consider the problem of binary-image restoration. The image being restored is not random, and we make no assumption about the nature of its contents. The estimate of the colour at each site is a fixed (the same for all sites) function of the data available in a neighbourhood of that site. Under this restriction, the estimate minimizing the overall mean squared error of prediction is the conditional expectation of the true colour given the observations in the neighbourhood of a site. The computation of this conditional expectation leads to the formal definition of the local characteristics of an image, namely, the frequency with which each pattern appears in the true unobserved image. When the “true” distribution of the patterns is unknown, it can be estimated from the records. The conditional expectation described above can then be evaluated using the estimated distribution of the patterns, and this procedure leads to a very natural estimate of the colour at each site. We propose two unbiased and consistent estimates for the distribution of patterns when the noise is a Gaussian white noise. Since the size of realistic images is very large, the estimated pattern distribution is usually close to the true one. This suggests that the estimated conditional expectation can be expected to be nearly optimal. An interesting feature of the proposed restoration methods is that they do not require prior knowledge of the local or global properties of the true underlying image. Several examples based on synthetic images show that the new methods perform fairly well for a variety of images with different degrees of colour continuity or textures.     

Estimating the distribution of one-dimensional discrete scan statistics viewed as extremes of 1-dependent stationary sequences

Discrete one-dimensional scan statistics can be viewed as extremes of 1-dependent stationary sequences. A result of Haiman [1999. First passage time for some stationary processes. Stochastic Process. Appl. 80, 231–248] provides approximations of the distributions of extremes of 1-dependent stationary sequences together with sharp bounds for the corresponding errors. We apply this result to scan statistics generated by Bernoulli r.v.'s and to the charge problem.     

Inference about permutation parameter in large samples

The estimation problem of a permutation parameter on the basis of a random sample of increasing size is considered. A necessary and sufficient condition for the existence of an estimator, asymptotically fully efficient for two different distributions families, is derived. We also study the application of this result to cyclic groups of order two and three.     

A note on the asymptotic optimality of a two population sequential probability ratio test

It is shown that a two population sequential probability ratio test studied by a number of recent authors in the context of sequential medical trials is asymptotically optimal.     

Complete designs with blocks of maximal multiplicity

The set of distinct blocks of a block design is known as its support. We construct complete designs with parameters v(?7), k=3, λ=v ? 2 which contain a block of maximal multiplicity and with support size $\text{b}{}^1\text{= (}{}^{\mathrm{v}}{}_3\text{) ? 4(v ? 2)}$. Any complete design which contains such a block, and has parameters v, k, λ as above, must be supported on at most (^v₃) ? 4(v ? 2) blocks. Attention is given to complete designs because of their direct relationship to simple random sampling.