Some as-optimal designs and their a-efficiencies

For polynomial regression over spherical regions, the d-th order As-optimal designs for γ-th order models are derived for 4 ≥ d > γ≥l. Efficiencies of these designs with respect to the γ-th order A-optimal designs are obtained. Furthermore, the effects of estimating intermediate m-th order models on these efficiencies are examined for d > m > γ     

Robustness group divisible designs

Robustness of group divisible (GD) designs is investigated, when one block is lost, in terms of efficiency of the residual design. The exact evaluation of the efficiency can be made for singular GD and semi-regular GD designs as ell as regular GD designs with λ₁ = 0. In a regular GD design with λ₁ > 0, the efficiency may depend upon the lost block and sharp upper and lower bounds on the efficiency are presented. The investigation shows that GD designs are fairly robust in terms of efficiency. As a special case, we can also show the robustness of balanced incomplete block design when one block is lost.     

Lois limites pour les statistiques d'ordre dans le cas non identiquement distribue

Let X₁, X₂,… be a sequence of independent random variables with distribution functions F₁, where 1 ≤ i ≤ n, and for each n ≥ 1 let X_1,n ≤… ≤ X_n,n denote the order statistics of the first n random variables. Under suitable hypotheses about the F₁, we characterize the limit distribution functions H(x) for which P(X_k,n ? a_nx + b_n) → H(x), where a_n > 0 and b_n are real constants. We consider the cases where κ = κ(n) satisfies √n {κ(n)/n — λ} → 0 and √n {κ(n)/n — λ} → ∞ separately.     

More bounds for moments of some rank statistics

Let X₁,…,X₇ be i.i.d. random variables with a common continuous distribution F, Two parameters, μ(F) = P(X₁ < X₅ and X₁+X₄ < X₂+X₃) and λ(F) = P(X₁+X₄ < X₂+X₃ and X₁+X₇ < X₅+X₆), which appear in the moments of some rank statistics have been studied by several authors. It is shown that the existing lower bound, 3/10 ≤ μ(F) can be improved to 3/10 < μ(F) and that no further improvement is possible. It is also shown that the existing upper bounds μ(F) ≤ (2^1/2+6)/24 ≈ 0.30893 and λ(F) ≤ 7/24 ≈ 0.29167 can be improved to [14+(2/3)^1/2]/48 ≈ 0.30868 and {7 ? [1 ? (2/3)^1/2]²/4}/24 ≈ 0.29132.     

Regular group divisible designs and Bhaskar Rao designs with block size three

Some recursive constructions are given for Bhaskar Rao designs. Using examples of these designs found by Shyam J. Singh, Rakesh Vyas and new ones given here we show the necessary conditions λ≡0 (mod 2), λυ(υ?1)≡0 (mod 24) are sufficient for the existence of Bhaskar Rao designs with one association class and block size 3. This result is used with a result of Street and Rodger to obtain regular partially balanced block designs with 2υ treatments, block size 3, λ₁=0, group size 2 and υ groups.     

Optimal design results for 2n factorial paired comparison experiments

Four general classes of partially balanced designs for 2ⁿ factorials, corresponding to four different forms of a general null hypothesis H on factorial effects, are presented. For the typical design in each class, the simplified form of the non-centrality parameter λ² of the asymptotic chi-square distribution of the likelihood ratio statistic for testing the corresponding form of H₀ is derived under defined local alternatives. Optimal designs d₁ maximizing λ² in the i-th class and minimizing the trace, determinant and largest eigenvalue of a defined covariance matrix, i =1,…,4, are determined.     

Families of regular designs based on geometries

Recently Bush and Ostrom (1979) settled most of the open questions with respect to inequivalent solutions of a class of semiregular (SR) designs which can be constructed from nets. This paper is a study of the same nature for two families of regular (R) designs derived from finite projective planes. One family presents no problems, but the other which is a ‘double’ family with two parameters is much more difficult. In fact it is here solved only for designs based on planes of orders 3, 4, 5 and 8. Certain general methods exist which are indicated, but we were unable to resolve even the case 7 using this technique.Basically we show the existence of either inequivalent solutions or show there is but one solution settling a number of open cases. In particular for the case λ₁ = 2, λ₂ = 1 we give new solutions to a number of D(2) designs or group divisible designs with two associate classes which have no repeated blocks in contrast with the published solutions which have this undesirable property for a number of applications.     

On the choice of transformations of the correlation coefficient with or without an outlier

Five transformations of the correlation coefficient, namely, Fisher's z, Nair's u, Sankaran's v, Ruben's y and Samiuddin's t are compared numerically using confidence intervals. Samiuddin's t_s transformation is close to the exact nominal confidence level for a small sample size ≤ 25 from a bivariate normal density. For a sample size > 25 both Samiuddin's t_s and Fisher's z can be used. In the presence of an outlier (on a minor axis), both Fisher's z and Samiuddin's t_s are not affected as long as |p| ≤ 0.3 but are seriously affected when |p&| > 0.3.     

Multi - sample test of equal gamma distribution scale parameters in presence of unknown common shape parameter

Shiue and Bain proposed an approximate F statistic for testing equality of two gamma distribution scale parameters in presence of a common and unknown shape parameter. By generalizing Shiue and Bain's statistic we develop a new statistic for testing equality of L >= 2 gamma distribution scale parameters. We derive the distribution of the new statistic ESP for L = 2 and equal sample size situation. For other situations distribution of ESP is not known and test based on the ESP statistic has to be performed by using simulated critical values. We also derive a C(α) statistic CML and develop a likelihood ratio statistic, LR, two modified likelihood ratio statistics M and MLB and a quadratic statistic Q. The distribution of each of the statistics CML, LR, M, MLB and Q is asymptotically chi-square with L - 1 degrees of freedom. We then conducted a monte-carlo simulation study to compare the perfor- mance of the statistics ESP, LR, M, MLB, CML and Q in terms of size and power. The statistics LR, M, MLB and Q are in general liberal and do not show power advantage over other statistics. The statistic CML, based on its asymptotic chi-square distribution, in general, holds nominal level well. It is most powerful or nearly most powerful in most situations and is simple to use. Hence, we recommend the statistic CML for use in general. For better power the statistic ESP, based on its empirical distribution, is recommended for the special situation for which there is evidence in the data that λ₁ < … < λ_L and n₁ < … < n_L, where λ₁ …, λ_L are the scale parameters and n₁,…, n_L are the sample sizes.     

The probability distribution and the expected value of a stopping variable associated with one-sided cusum procedures for non-negative integer valued random variables

The structure of a stopping variable N based on one-sided CUSUM procedures is analyzed. Stopping occurs when a Markovian sequence of maxima of partial sums {M } crosses a certain boundary. On the basis of a recursive relationship between the M_n+1 and M_n a recursive equation is derived for the determination of the defective distributions K_n(x) = P{M ≤ x, N ≤n} . This recursive equation yields a recursive algorithm for the determination of P {N > n} . The paper studies the case when the basic random variables are non-negative integers-valued. In these cases the values of P{N > n} and E{N} can be determined by solving proper systems of linear equations.     

Group screening method for the statistical analysis of -optimal mixed-level supersaturated designs

In this paper, we propose the application of group screening methods for analyzing data using E(f_NOD)-optimal mixed-level supersaturated designs possessing the equal occurrence property. Supersaturated designs are a large class of factorial designs which can be used for screening out the important factors from a large set of potentially active variables. The huge advantage of these designs is that they reduce the experimental cost drastically, but their critical disadvantage is the high degree of confounding among factorial effects. Based on the idea of the group screening methods, the f factors are sub-divided into g “group-factors”. The “group-factors” are then studied using the penalized likelihood statistical analysis methods at a factorial design with orthogonal or near-orthogonal columns. All factors in groups found to have a large effect are then studied in a second stage of experiments. A comparison of the Type I and Type II error rates of various estimation methods via simulation experiments is performed. The results are presented in tables and discussion follows.     

Improved bounds for moments of some rank statistics

Improved lower hounds are obtained for two parameters μ(F) and λ(F) which occur in the moments of linear rank statistics studied by Doksum, Hollander, Lehmann and Hsu. IT is shown that if F is a continuous distribution, then μ(F) > 3/10 and λ(F) >= 89/315 - 0.28254. These results decrease the range of possible values of μ(F) and λ(F) by more than 84% and 34%, respectively, over those previously reported.     

D-optimal weighing designs and optimal chemical balance weighing designs for estimating the total weight

This paper provides D-optimal spring balance designs for estimating individual weights when the number of objects to be weighed in each weighing, B, is fixed. D-optimal chemical balance designs for estimating total weight under both homogeneous and nonhomogeneous error variances are found when the number of objects weighed in each weighing is ≥ B, a fixed number.

We indicate the restriction used in Chacko & Dey(1978) and Kageyama(1988), i.e. that chemical designs X be restricted to designs in which exactly “a” objects are replaced on the left pan and exactly “b” on the right pan in each of the weighings for a, b > 0, is unnecessary.     

Families of Hadamard group divisible designs

By a family of designs we mean a set of designs whose parameters can be represented as functions of an auxiliary variable t where the design will exist for infinitely many values of t. The best known family is probably the family of finite projective planes with υ = b = t² + t + 1, r = k = t + 1, and λ = 1. In some instances, notably coding theory, the existence of families is essential to provide the degree of precision required which can well vary from one coding problem to another. A natural vehicle for developing binary codes is the class of Hadamard matrices. Bush (1977) introduced the idea of constructing semi-regular designs using Hadamard matrices whereas the present study is concerned mostly with construction of regular designs using Hadamard matrices. While codes constructed from these designs are not optimal in the usual sense, it is possible that they may still have substantial value since, with different values of λ₁ and λ₂, there are different error correcting capabilities.     

Model-robust supersaturated and partially supersaturated designs

Supersaturated designs are an increasingly popular tool for screening factors in the presence of effect sparsity. The advantage of this class of designs over resolution III factorial designs or Plackett–Burman designs is that n, the number of runs, can be substantially smaller than the number of factors, m. A limitation associated with most supersaturated designs produced thus far is that the capability of these designs for estimating g active effects has not been discussed. In addition to exploring this capability, we develop a new class of model-robust supersaturated designs that, for a given n and m, maximizes the number g   of active effects that can be estimated simultaneously. The capabilities of model-robust supersaturated designs for model discrimination are assessed using a model-discrimination criterion, the subspace angle. Finally, we introduce the class of partially supersaturated designs, intended for use when we require a specific subset of _m1$m_1$ core factors to be estimable, and the sparsity of effects principle applies to the remaining (m-_m1$m-m_1$) factors.     

The number of records within a random interval of the current record value

LetX ₁,X ₂, … be a sequence of i.i.d. random variables with some continuous distribution functionF. LetX(n) be then-th record value associated with this sequence and μ _n ⁻ , μ _n ⁺ be the variables that count the number of record values belonging to the random intervals(f−(X(n)), X(n)), (X(n), f+(X(n))), wheref−, f+ are two continuous functions satisfyingf−(x)<x, f+(x)>x. Properties of μ _n ⁻ , μ _n ⁺ are studied in the present paper. Some statistical applications connected with these variables are also provided.     

Some adjusted orthogonal,variance balanced,multidimensional block designs

A multidimensional block design (MBD) is an experimental design with d > 1 blocking criteria geometrically represented as a d-dimensional lattice with treatment varieties assigned to some or all nodes of the lattice. Intrablock analysis of variance tables for some special classes of two- and three-dimensional block designs with some empty nodes are given. Design plans and efficiencies for 31 two-dimensional designs, each universally optimal in defined classes of designs, and 7 three-dimensional designs, each nearly optimal in defined classes of designs, are listed in the appendices. A need for such designs is apparent when the blocking criteria are implemented successively and empty nodes do not represent wasted experimental units.     

Construction of neighbor designs of block size 4 for all values of v ≥ 5 by using the method of addition

In this article, a general method of construction of neighbor block designs is given. The designs are constructed using variation of a simple method which we refer to as the method of addition (renamed as the method of cyclic shifts). We give complete solution of neighbor balanced designs for k = 4 for any value of v. We also give many series of generalized neighbor designs (GNDs). In the last section, we have constructed GNDs in a sequential manner (as Did John 1981) for v ≤ 50 and r is multiple of k.