Designs for cropping systems research

The present article establishes equivalence between extended group divisible (EGD) designs and designs for crop sequence experiments. This equivalence has encouraged the agricultural experimenters to use EGD designs for their experimentation. Some real life applications of EGD designs have been given. It has also been shown that several existing association schemes are special cases of EGD association scheme. Some methods of construction of EGD designs are also given. A catalogue of EGD designs obtainable through methods of construction along with efficiency factors of various factorial effects is also presented. In some crop sequence experiments that are conducted to develop suitable integrated nutrient supply system of a crop sequence, the treatments do not comprise of a complete factorial structure. The experimenter is interested in estimating the residual and direct effect of the treatments along with their cumulative effects. For such experimental settings block designs with two sets of treatments applied in succession are the appropriate designs. The correspondence established between row–column designs and block designs for two stage experiments by Parsad et al. [2003. Structurally incomplete row–column designs. Comm. Statist. Theory Methods 32(1), 239–261] has been exploited in obtaining designs for such experimental situations. Some open problems related to designing of crop sequence experiments are also given.     

A unified theory for generalized cyclic designs

Properties of abelian groups are used to unify the construction of cyclic and generalized cyclic designs. Necessary and sufficient conditions are obtained for the generation of fractional sets of blocks, and also for the generation of resolvable designs. It is shown how to apply these results in conjunction with efficiency arguments to obtain useful designs.     

Optimal saturated block designs when observations are correlated

A- and MV-optimal block designs are identified in the class of minimally connected designs when the observations within blocks are spatially correlated. All connected designs are shown to be D-equal regardless of the correlation structure, and a sufficient condition for E-optimality is presented. Earlier results for the uncorrelated case are strengthened.     

Addition of runs to a two-level supersaturated design

The purpose of this article is to introduce a new class of extended E(s²)-optimal two level supersaturated designs obtained by adding runs to an existing E(s²)-optimal two level supersaturated design. The extended design is a union of two optimal SSDs belonging to different classes. New lower bound to E(s²) has been obtained for the extended supersaturated designs. Some examples and a small catalogue of E(s²)-optimal SSDs are also included.     

Optimum covariate designs in partially balanced incomplete block (PBIB) design set-ups

The use of covariates in block designs is necessary when the covariates cannot be controlled like the blocking factor in the experiment. In this paper, we consider the situation where there is some flexibility for selection in the values of the covariates. The choice of values of the covariates for a given block design attaining minimum variance for estimation of each of the parameters has attracted attention in recent times. Optimum covariate designs in simple set-ups such as completely randomised design (CRD), randomised block design (RBD) and some series of balanced incomplete block design (BIBD) have already been considered. In this paper, optimum covariate designs have been considered for the more complex set-ups of different partially balanced incomplete block (PBIB) designs, which are popular among practitioners. The optimum covariate designs depend much on the methods of construction of the basic PBIB designs. Different combinatorial arrangements and tools such as orthogonal arrays, Hadamard matrices and different kinds of products of matrices viz. Khatri–Rao product, Kronecker product have been conveniently used to construct optimum covariate designs with as many covariates as possible.     

Variance of the difference between two estimated responses

Minimization of the maximum and average variance of the difference between estimated responses are taken as design criteria for univariate polynomial regression models. An optimal design under the first criterion is derived for the second-order model and a class of designs nearly optimal under the second criterion is obtained for the general polynomial models.     

D‐optimal minimax fractional factorial designs

The D‐optimal minimax criterion is proposed to construct fractional factorial designs. The resulting designs are very efficient, and robust against misspecification of the effects in the linear model. The criterion was first proposed by Wilmut & Zhou (2011); their work is limited to two‐level factorial designs, however. In this paper we extend this criterion to designs with factors having any levels (including mixed levels) and explore several important properties of this criterion. Theoretical results are obtained for construction of fractional factorial designs in general. This minimax criterion is not only scale invariant, but also invariant under level permutations. Moreover, it can be applied to any run size. This is an advantage over some other existing criteria. The Canadian Journal of Statistics 41: 325–340; 2013 © 2013 Statistical Society of Canada     

A survey and evaluation of methods for determination of combinatorial equivalence of factorial designs

Equivalent factorial designs have identical statistical properties for estimation of factorial contrasts and for model fitting. Non-equivalent designs, however, may have the same statistical properties under one particular model but different properties under a different model. In this paper, we describe known methods for the determination of equivalence or non-equivalence of two-level factorial designs, whether they be regular factorial designs, non-regular orthogonal arrays, or have no particular structure. In addition, we evaluate a number of potential fast screening methods for detecting non-equivalence of designs. Although the paper concentrates mainly on symmetric designs with factors at two levels, we also evaluate methods of determining combinatorial equivalence and non-equivalence of three-level designs and indicate extensions to larger numbers of levels and to asymmetric designs.     

Confounded row–column designs

Confounded row–column designs for factorial experiments are considered and a simple method of construction using the classical method of confounding is described. Partially confounded designs are also studied and a method for generating Rao's (1946) designs is presented.     

Approximate and exact optimal designs for paired comparisons of partial profiles when there are two groups of factors

For paired comparison experiments involving pairs of multifactor options differing in a specified number of factors the problem of finding optimal designs is considered, when only main effects are to be estimated. It is presumed that the set of factors can be partitioned into two groups such that the number of levels is constant within each group. The optimal designs for this frequently encountered case are also optimal for the corresponding choice experiments under the hypothesis that the parameters in the multinomial logit model are equal to zero.     

Characterization of minimum aberration mixed factorials in terms of consulting designs

In this paper, by introducing a concept of consulting design and based on the connection between factorial design theory and coding theory, we obtain combinatorial identities that relate the wordlength pattern of a regular mixed factorial design to that of its consulting design. According to these identities, we further-more establish the general and unified rules for identifying minimum aberration mixed factorial designs through their consulting designs. It is an improvement and generalization of the results in Mukerjee and Wu (2001). This paper is supported by NNSF of China grant No. 10171051 and RFDP grant No. 1999005512.     

Some methods for constructing efficiency-balanced block designs

Three methods are presented for constructing connected efficiency-balanced block designs from other block designs with the same properties. The resulting designs differ from the original ones in the number of blocks and/or in the number of experimental units and their arrangement, while the number of treatments remains unaltered. Some remarks on the proposed methods of construction refer also to variance-balanced block designs.     

Orthogonally blocked three-level second order designs

Using balanced incomplete block designs with two plots per block, new three-level second order designs involving an arbitrary number of factors are obtained. These designs can easily be blocked orthogonally into blocks of reasonable sizes and are seen to have high D$D$-efficiencies. Orthogonally blocked augmented pairs designs with at most six factors are also constructed.     

A note on the connection between uniformity and generalized minimum aberration

Discrete discrepancy has been utilized as a uniformity measure for comparing and evaluating factorial designs. In this paper, for asymmetrical factorials, we give some linkages between uniformity measured by the discrete discrepancy and other criteria, such as generalized minimum aberration (Xu and Wu, 2001) and minimum projection variance (Ai and Zhang, 2004). These close linkages show a significant justification for the discrete discrepancy used to measure uniformity of factorial designs, and provide an additional rationale for using uniform designs. This research was partially supported by the NNSF of China (No. 10441001), the Key Project of Chinese Ministry of Education (No. 105119) and the Project-sponsored by SRF for ROCS (SEM) (No. [2004]176).     

Some sufficient conditions for establishing (M,S)-optimality

Two sufficient conditions are given for an incomplete block design to be (M,S- optimal. For binary designs the conditions are (i) that the elements in each row, excluding the diagonal element, of the association matrix differ by at most one, and (ii) that the off-diagonal elements of the block characteristic matrix differ by at most one. It is also shown how the conditions can be utilized for nonbinary designs and that for blocks of size two the sufficient condition in terms of the association matrix can be attained.     

Optimal crossover designs when carryover effects are proportional to direct effects

Crossover designs are used for a variety of different applications. While these designs have a number of attractive features, they also induce a number of special problems and concerns. One of these is the possible presence of carryover effects. Even with the use of washout periods, which are for many applications widely accepted as an indispensable component, the effect of a treatment from a previous period may not be completely eliminated. A model that has recently received renewed attention in the literature is the model in which first-order carryover effects are assumed to be proportional to direct treatment effects. Under this model, assuming that the constant of proportionality is known, we identify optimal and efficient designs for the direct effects for different values of the constant of proportionality. We also consider the implication of these results for the case that the constant of proportionality is not known.     

Optimal discrimination designs for exponential regression models

We investigate optimal designs for discriminating between exponential regression models of different complexity, which are widely used in the biological sciences; see, e.g., Landaw [1995. Robust sampling designs for compartmental models under large prior eigenvalue uncertainties. Math. Comput. Biomed. Appl. 181–187] or Gibaldi and Perrier [1982. Pharmacokinetics. Marcel Dekker, New York]. We discuss different approaches for the construction of appropriate optimality criteria, and find sharper upper bounds on the number of support points of locally optimal discrimination designs than those given by Caratheodory's Theorem. These results greatly facilitate the numerical construction of optimal designs. Various examples of optimal designs are then presented and compared to different other designs. Moreover, to protect the experiment against misspecifications of the nonlinear model parameters, we adapt the design criteria such that the resulting designs are robust with respect to such misspecifications and, again, provide several examples, which demonstrate the advantages of our approach.     

Efficient experimental designs for sigmoidal growth models

For the Weibull- and Richards-regression model robust designs are determined by maximizing a minimum of D  - or _D1$D_1$-efficiencies, taken over a certain range of the non-linear parameters. It is demonstrated that the derived designs yield a satisfactory solution of the optimal design problem for this type of model in the sense that these designs are efficient and robust with respect to misspecification of the unknown parameters. Moreover, the designs can also be used for testing the postulated form of the regression model against a simplified sub-model.     

Minimum projection uniformity for computer experiment with quantitative factors

Computer experiments involving quantitative factors at high levels are becoming more and more important in the study of complex experiments arising in the area of science and engineering. Uniform designs are found to be widely applicable in computer experiments in the form of space-filling designs. In this paper, the projection uniformity for quantitative designs is studied under wrap-around $L_2$-discrepancy. A lower bound of uniformity pattern for general asymmetric designs is provided, which can be used to serve as a benchmark for both comparing different designs and also to determine the optimal design. As a byproduct, a lower bound of wrap-around $L_2$-discrepancy measure for the asymmetric design is also obtained. Some illustrative examples and numerical comparisons are also provided for supporting our theoretical results.     

Some sufficient conditions for the type 1 optimality of block designs

In this paper, we investigate the problem of determining block designs which are optimal under type 1 optimality criteria within various classes of designs having υ treatments arranged in b blocks of size k. The solutions to two optimization problems are given which are related to a general result obtained by Cheng (1978) and which are useful in this investigation. As one application of the solutions obtained, the definition of a regular graph design given in Mitchell and John (1977) is extended to that of a semi-regular graph design and some sufficient conditions are derived for the existence of a semi-regular graph design which is optimal under a given type 1 criterion. A result is also given which shows how the sufficient conditions derived can be used to establish the optimality under a specific type 1 criterion of some particular types of semi- regular graph designs having both equal and unequal numbers of replicates. Finally,some sufficient conditions are obtained for the dual of an A- or D-optimal design to be A- or D-optimal within an appropriate class of dual designs.