A general method of constructing E(s2)-optimal supersaturated designs

There has been much recent interest in supersaturated designs and their application in factor screening experiments. Supersaturated designs have mainly been constructed by using the E ( s ²)-optimality criterion originally proposed by Booth and Cox in 1962. However, until now E ( s ²)-optimal designs have only been established with certainty for n experimental runs when the number of factors m is a multiple of n-1 , and in adjacent cases where m = q ( n -1) + r (| r | 2, q an integer). A method of constructing E ( s ²)-optimal designs is presented which allows a reasonably complete solution to be found for various numbers of runs n including n ,=8 12, 16, 20, 24, 32, 40, 48, 64.     

On E(s)-optimal supersaturated designs

A popular measure to assess 2-level supersaturated designs is the E(s²)$E(s^2)$ criterion. In this paper, improved lower bounds on E(s²)$E(s^2)$ are obtained. The same improvement has recently been established by Ryan and Bulutoglu [2007. E(s²)$E(s^2)$-optimal supersaturated designs with good minimax properties. J. Statist. Plann. Inference 137, 2250–2262]. However, our analysis provides more details on precisely when an improvement is possible, which is lacking in Ryan and Bulutoglu [2007. E(s²)$E(s^2)$-optimal supersaturated designs with good minimax properties. J. Statist. Plann. Inference 137, 2250–2262]. The equivalence of the bounds obtained by Butler et al. [2001. A general method of constructing E(s²)$E(s^2)$-optimal supersaturated designs. J. Roy. Statist. Soc. B 63, 621–632] (in the cases where their result applies) and those obtained by Bulutoglu and Cheng [2004. Construction of E(s²)$E(s^2)$-optimal supersaturated designs. Ann. Statist. 32, 1662–1678] is established. We also give two simple methods of constructing E(s²)$E(s^2)$-optimal designs.     

Optimum covariate designs in split-plot and strip-plot design set-ups

The problem considered is that of finding optimum covariate designs for estimation of covariate parameters in standard split-plot and strip-plot design set-ups with the levels of the whole-plot factor in r randomised blocks. Also an extended version of a mixed orthogonal array has been introduced, which is used to construct such optimum covariate designs. Hadamard matrices, as usual, play the key role for such construction.     

Optimal fractional factorial designs and their construction

Optimal symmetrical fractional factorial designs with n$n$ runs and m$m$ factors of s$s$ levels each are constructed. We consider only designs such that no two factors are aliases. The minimum moment aberration criterion proposed by Xu (2003) is used to judge the optimality of the designs. The minimum moment aberration criterion is equivalent to the popular generalized minimum aberration criterion proposed by Xu and Wu (2001), but the minimum moment criterion is simpler to formulate and employ computationally. Some optimal designs are constructed by using generalized Hadamard matrices.     

Split-plot designs with mirror image pairs as sub-plots

In this article we investigate two-level split-plot designs where the sub-plots consist of only two mirror image trials. Assuming third and higher order interactions negligible, we show that these designs divide the estimated effects into two orthogonal sub-spaces, separating sub-plot main effects and sub-plot by whole-plot interactions from the rest. Further we show how to construct split-plot designs of projectivity P≥3. We also introduce a new class of split-plot designs with mirror image pairs constructed from non-geometric Plackett-Burman designs. The design properties of such designs are very appealing with effects of major interest free from full aliasing assuming that 3rd and higher order interactions are negligible.     

Two-level minimum aberration designs in N =2 (mod 4) runs

For two-level factorials, we consider designs in N=2 (mod 4) runs as obtained by adding two runs, with a certain coincidence pattern, to an orthogonal array of strength two. These designs are known to be optimal main effect plans in a very broad sense in the absence of interactions. Among them, we explore the ones having minimum aberration, with a view to ensuring maximum model robustness even when interactions are possibly present. This is done by sequentially minimizing a measure of the bias caused by interactions of successively higher orders.     

Cyclic designs for a covariate model

A linear model with one treatment at V levels and first order regression on K continuous covariates with values on a K-cube is considered. We restrict our attention to classes of designs d for which the number of observations N to be taken is a multiple of V, i.e. N = V × R with R ≥2, and each treatment level is observed R times. Among these designs, called here equireplicated, there is a subclass characterized by the following: the allocation matrix of each treatment level (for short, allocation matrix) is obtained through cyclic permutation of the columns of the allocation matrix of the first treatment level. We call these designs cyclic. Besides having easy representation, the most efficient cyclic designs are often D-optimal in the class of equireplicated designs. A known upper bound for the determinant of the information matrix M(d) of a design, in the class of equireplicated ones, depends on the congruences of N and V modulo 4. For some combinations of parameter moduli, we give here methods of constructing families of D-optimal cyclic designs. Moreover, for some sets of parameters (N, V,K = V), where the upper bound on ∣M(d)∣ (for that specific combination of moduli) is not attainable, it is also possible to construct highly D-efficient cyclic designs. Finally, for N≤24 and V≤6, computer search was used to determine the most efficient design in the class of cyclic ones. They are presented, together with their respective efficiency in the class of equireplicated designs.     

Balanced Treatment incomplete block (BTIB) designs for comparing treatments with a control: minimal complete sets of generator designs for k = 3, p = 3(1)10

Bechhofer and Tamhane (1981) proposed a new class of incomplete block designs called BTIB designs for comparing p ≥ 2 test treatments with a control treatment in blocks of equal size k < p + 1. All BTIB designs for given (p,k) can be constructed by forming unions of replications of a set of elementary BTIB designs called generator designs for that (p,k). In general, there are many generator designs for given (p,k) but only a small subset (called the minimal complete set) of these suffices to obtain all admissible BTIB designs (except possibly any equivalent ones). Determination of the minimal complete set of generator designs for given (p,k) was stated as an open problem in Bechhofer and Tamhane (1981). In this paper we solve this problem for k = 3. More specifically, we give the minimal complete sets of generator designs for k = 3, p = 3(1)10; the relevant proofs are given only for the cases p = 3(1)6. Some additional combinatorial results concerning BTIB designs are also given.     

An infinite class of PBIB designs

In this paper, an infinite class of partially balanced incomplete block (PBIB) designs of m+1 associate classes is constructed through the use of a series of row-orthogonal matrices known as partially balanced orthogonal designs (PBOD) of m-associate classes. For the purpose, a series of PBOD is obtained through a method described herein. An infinite class of regular GD designs is also reported.     

On the non-existence of generalised Hadamard matrices

The determinant of a generalized Hadamard matrix over its group ring factored out by the relation Σ_gεG G = 0 is shown to have certain number theoretic properties. These are exploited to prove the non-existence of many generalised Hadamard matrices for groups whose orders are divisible by 3, 5 or 7. For example the GH(15, C₁₅), GH(15, C₃) and GH(15, C₅) do not exist. Also for certain n and G we find the set of determinants of the GH(n, G) matrices.     

Optimal designs for covariates’ models

A linear model with one treatment at V levels and first order regression on K continuous covariates with values on a K-cube is considered. The D-criterion is used to judge the ‘goodness’ of any design for estimating the parameters of this model. Since this criterion is based on the determinant of the information matrix M(d) of a design d, upper bounds for |M(d)| yield lower bounds for the D-efficiency of any design d in estimating the vector of parameters in the model. We consider here only classes of designs d for which the number N of observations to be taken is a multiple of V, that is, there exists R≥2 such that N=V×R.Under these conditions, we determine the maximum of |M(d)|, and conditions under which the maximum is attained. These conditions include R being even, each treatment level being observed the same number of times, that is, R times, and N being a multiple of four. For the other cases of congruence of N (modulo 4) we further determine upper bounds on |M (d)| for equireplicated designs, i.e. for designs with equal number of observations per treatment level. These upper bounds are shown to depend also on the congruence of V (modulo 4). For some triples (N,V,K), the upper bounds determined are shown to be attained.Construction methods yielding families of designs which attain the upper bounds of |M(d)| are presented, for each of the sixteen cases of congruence of N and V.We also determine the upper bound for D-optimal designs for estimating only the treatment parameters, when first order regression on one continuous covariate is present.     

Some d-optimal weighing designs for n≡ (mod 4)

A number of D-optimal weighing designs are constructed with the help of block matrices. The D-optimal designs (n,k,s)=(19,13,10), (19,14,7), (19,14,8), (19,15,7), (19,15,8), (19,17,6), (19,18,6), (23,16,8), (23,17,8), (23,18,8), (4n?1,2n+3,(3n+4)/2), (4n?1,2n+4,n+3), (4n?1,2n+4,n+2) where n≡0 mod 4 and a skew H_n exists, (31,24,8), (31,25,8) and many others are constructed. A computer routine leading to locally D-optimal designs is presented.     

Comparison of designs equivalent under one or two criteria

Two designs equivalent under one or two criteria may be compared under other criteria. For certain configurations of eigenvalues of the information matrices, we decide which design is the better of the two for many other such criteria. The relationship to universal optimality (in the case of equivalence under one criterion) is indicated. For two criteria, applications are given to weighing and treatment-with-covariate settings.     

Orthogonal arrays of strength three from regular 3-wise balanced designs

The construction given in Kreher, J Combin Des 4 (1996) 67 is extended to obtain new infinite families of orthogonal arrays of strength 3. Regular 3-wise balanced designs play a central role in this construction.     

On the analysis of multivariate repeated measures designs

The relationship between the mixed-model analysis and multivariate approach to a repeated measures design with multiple responses is presented. It is shown that by taking the trace of the appropriate submatrix of the hypothesis (error) sums of squares and crossproducts (SSCP) matrix obtained from the multivariate approach, one can get the hypothesis (error) SSCP matrix for the mixed-model analysis. Thus, when analyzing data from a multivariate repeated measures design, it is advantageous to use the multivariate approach because the result of the mixed-model analysis can also be obtained without additional computation.     

Balanced e-optimal designs of resolution III for the 2×3 series

We consider the problem of constructing designs which are E-optimal in the class of all balanced resolution III designs for the 2^m×3ⁿ series. The inverse of the information matrix for general resolution III balanced 2^m×3ⁿ designs is obtained. Optimal designs are constructed for the cases (m,n)=(3, 1), (4, 1), (2, 2) and (3, 2) for various numbers of runs in the practical range.     

Convergence properties of sequential Bayesian D-optimal designs

We establish convergence properties of sequential Bayesian optimal designs. In particular, for sequential D-optimality under a general nonlinear location-scale model for binary experiments, we establish posterior consistency, consistency of the design measure, and the asymptotic normality of posterior following the design. We illustrate our results in the context of a particular application in the design of phase I clinical trials, namely a sequential design of Haines et al. [2003. Bayesian optimal designs for phase I clinical trials. Biometrics 59, 591–600] that incorporates an ethical constraint on overdosing.     

Results for two-level fractional factorial designs of resolution IV or more

The main theorem of this paper shows that foldover designs are the only (regular or nonregular) two-level factorial designs of resolution IV (strength 3) or more for n   runs and n/3?m?n/2$n/3?m?n/2$ factors. This theorem is a generalization of a coding theory result of Davydov and Tombak [1990. Quasiperfect linear binary codes with distance 4 and complete caps in projective geometry. Problems Inform. Transmission 25, 265–275] which, under translation, effectively states that foldover (or even) designs are the only regular two-level factorial designs of resolution IV or more for n   runs and 5n/16?m?n/2$5n/16?m?n/2$ factors. This paper also contains other theorems including an alternative proof of Davydov and Tombak's result.     

Methods of constructing group divisible designs with k = 3 and 4

The paper provides methods of construction of group divisible designs with block sizes three and four through balanced incomplete block and partially balanced incomplete block designs of block sizes 3 and 4. Furthermore, four non-isomorphic solutions are given.