Some partially variance balanced structurally incomplete row-column designs

Earlier results by the authors are used to provide the intrablock analysis for row-column designs that have observations at nodes of the row-column lattice, the design being structurally incomplete when some nodes are empty. Construction, properties, and intrablock analyses of some special b× b row-column designs with b empty nodes taken along the principal diagonal of the lattice are developed. The designs discussed have m > 1 associate classes and are said to be partially variance balanced. The special designs fall in two classes and are shown to be nearly optimal in a specified class of designs. A small catalog of designs constructed is provided and they should be useful when empty nodes do not represent wasted experimental units, perhaps because the row and column assignments of treatments are sequenced.     

Interblock information in multidimensional block designs

In many experimental situations, d-way heterogeneity among experimental units may be controlled through use of multiple blocking criteria. In some cases it is reasonable to regard some or all of the block effects as random. Then the model is mixed and observations within blocks are correlated. Very general estimators of treatment effects and their dispersion matrix with recovery of interblock information are provided. They apply to designs with d > 1 blocking criteria that may be crossed, nested, or a combination thereof. These general results may be specialized to provide analyses of new classes of MBD's or used directly for numerical analyses of designs in the general class, perhaps through use as the basis for very general computer programs. Estimation of variance components is discussed, and an example is provided to illustrate adaptation of the general results.     

On constructing general minimum lower order confounding two-level block designs

In practice, to reduce systematic variation and increase precision of effect estimation, a practical design strategy is then to partition the experimental units into homogeneous groups, known as blocks. It is an important issue to study the optimal way on blocking the experimental units. Blocked general minimum lower order confounding (B¹-GMC) is a new criterion for selecting optimal block designs. The paper considers the construction of optimal two-level block designs with respect to the B¹-GMC criterion. By utilizing doubling theory and MaxC2 design, some optimal block designs with respect to the B¹-GMC criterion are obtained.     

Optimal blocking and foldover plans for nonregular two-level designs

This paper discusses the issue of choosing optimal designs when both blocking and foldover techniques are simultaneously employed to nonregular two-level fractional factorial designs. By using the indicator function, the treatment and block generalized wordlength patterns of the combined blocked design under a general foldover plan are defined. Some general properties of combined block designs are also obtained. Our results extend the findings of Ai et al. (2010) from regular designs to nonregular designs. Based on these theoretical results, a catalog of optimal blocking and foldover plans in terms of the generalized aberration criterion for nonregular initial design with 12, 16 and 20 runs is tabulated, respectively.     

Designs for two-colour microarray experiments

Summary.  Designs for two-colour microarray experiments can be viewed as block designs with two treatments per block. Explicit formulae for the A- and D-criteria are given for the case that the number of blocks is equal to the number of treatments. These show that the A- and D-optimality criteria conflict badly if there are 10 or more treatments. A similar analysis shows that designs with one or two extra blocks perform very much better, but again there is a conflict between the two optimality criteria for moderately large numbers of treatments. It is shown that this problem can be avoided by slightly increasing the number of blocks. The two colours that are used in each block effectively turn the block design into a row–column design. There is no need to use a design in which every treatment has each colour equally often: rather, an efficient row–column design should be used. For odd replication, it is recommended that the row–column design should be based on a bipartite graph, and it is proved that the optimal such design corresponds to an optimal block design for half the number of treatments. Efficient row–column designs are given for replications 3–6. It is shown how to adapt them for experiments in which some treatments have replication only 2.     

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.     

Balanced incomplete Latin square designs

Latin squares have been widely used to design an experiment where the blocking factors and treatment factors have the same number of levels. For some experiments, the size of blocks may be less than the number of treatments. Since not all the treatments can be compared within each block, a new class of designs called balanced incomplete Latin squares (BILS) is proposed. A general method for constructing BILS is proposed by an intelligent selection of certain cells from a complete Latin square via orthogonal Latin squares. The optimality of the proposed BILS designs is investigated. It is shown that the proposed transversal BILS designs are asymptotically optimal for all the row, column and treatment effects. The relative efficiencies of a delete-one-transversal BILS design with respect to the optimal designs for both cases are also derived; it is shown to be close to 100%, as the order becomes large.     

Optimal partially balanced nested row-column designs

A partially balanced nested row-column design, referred to as PBNRC, is defined as an arrangement of v treatments in b p × q blocks for which, with the convention that p q, the information matrix for the estimation of treatment parameters is equal to that of the column component design which is itself a partially balanced incomplete block design. In this paper, previously known optimal incomplete block designs, and row-column and nested row-column designs are utilized to develop some methods of constructing optimal PBNRC designs. In particular, it is shown that an optimal group divisible PBNRC design for v = mn kn treatments in p × q blocks can be constructed whenever a balanced incomplete block design for m treatments in blocks of size k each and a group divisible PBNRC design for kn treatments in p × q blocks exist. A simple sufficient condition is given under which a group divisible PBNRC is Ψ_f-better for all f> 0 than the corresponding balanced nested row-column designs having binary blocks. It is also shown that the construction techniques developed particularly for group divisible designs can be generalized to obtain PBNRC designs based on rectangular association schemes.     

Comparison of Four New General Classes of Search Designs

A factor screening experiment identifies a few important factors from a large list of factors that potentially influence the response. If a list consists of m factors each at three levels, a design is a subset of all possible 3 ^m runs. This paper considers the problem of finding designs with small numbers of runs, using the search linear model introduced in Srivastava (1975). The paper presents four new general classes of these 'search designs', each with 2 m −1 runs, which permit, at most, two important factors out of m factors to be searched for and identified. The paper compares the designs for 4 ≤ m ≤ 10, using arithmetic and geometric means of the determinants, traces and maximum characteristic roots of particular matrices. Two of the designs are found to be superior in all six criteria studied. The four designs are identical for m = 3 and this design is an optimal design in the class of all search designs under the six criteria. The four designs are also identical for m = 4 under some row and column permutations.     

Minimum breakdown designs in blocks of size two

In scientific investigations, there are many situations where each two experimental units have to be grouped into a block of size two. For planning such experiments, the variance-based optimality criteria like A-, D- and E-criterion are typically employed to choose efficient designs, if the estimation efficiency of treatment contrasts is primarily concerned. Alternatively, if there are observations which tend to become lost during the experimental period, the robustness criteria against the unavailability of data should be strongly recommended for selecting the planning scheme. In this study, a new criterion, called minimum breakdown criterion, is proposed to quantify the robustness of designs in blocks of size two. Based on the proposed criterion, a new class of robust designs, called minimum breakdown designs, is defined. When various numbers of blocks are missing, the minimum breakdown designs provide the highest probabilities that all the treatment contrasts are estimable. An exhaustive search procedure is proposed to generate such designs. In addition, two classes of uniformly minimum breakdown designs are theoretically verified.     

Optimal Circular Block Designs for Neighbouring Competition Effects

Competition or interference occurs when the responses to treatments in experimental units are affected by the treatments in neighbouring units. This may contribute to variability in experimental results and lead to substantial losses in efficiency. The study of a competing situation needs designs in which the competing units appear in a predetermined pattern. This paper deals with optimality aspects of circular block designs for studying the competition among treatments applied to neighbouring experimental units. The model considered is a four-way classified model consisting of direct effect of the treatment applied to a particular plot, the effect of those treatments applied to the immediate left and right neighbouring units and the block effect. Conditions have been obtained for the block design to be universally optimal for estimating direct and neighbour effects. Some classes of balanced and strongly balanced complete block designs have been identified to be universally optimal for the estimation of direct, left and right neighbour effects and a list of universally optimal designs for v<20 and r<100 has been prepared.     

A note on the robustness of PBIBD(2)s against breakdown in the event of observation loss

Robustness against design breakdown following observation loss is investigated for Partially Balanced Incomplete Block Designs with two associate classes (PBIBD(2)s). New results are obtained which add to the body of knowledge on PBIBD(2)s. In particular, using an approach based on the E‐value of a design, all PBIBD(2)s with triangular and Latin square association schemes are established as having optimal block breakdown number. Furthermore, for group divisible designs not covered by existing results in the literature, a sufficient condition for optimal block breakdown number establishes that all members of some design sub‐classes have this property.     

Nearly optimal orthogonally blocked desings for a quadratic mixture model with q components

In experiments with mixtures involving process variables, orthogonal block designs may be used to allow estimation of the parameters of the mixture components independently of estimation of the parameters of the process variables. In the class of orthogonally blocked designs based on pairs of suitably chosen Latin squares, the optimal designs consist primarily of binary blends of the mixture components, regardless of how many ingredients are available for the mixture. This paper considers ways of modifying these optimal designs so that some or all of the runs used in the experiment include a minimum proportion of each mixture ingredient. The designs considered are nearly optimal in the sense that the experimental points are chosen to follow ridges of maxima in the optimality criteria. Specific designs are discussed for mixtures involving three and four components and distinctions are identified for different designs with the same optimality properties. The ideas presented for these specific designs are readily extended to mixtures with q>4 components.     

The construction of multi-factor crossover designs in animal husbandry studies

For ethical reasons it is important to try to obtain as much useful information as possible from an animal experiment whilst minimizing the number of animals used. Crossover designs, where applicable, provide an ideal framework for achieving this. If two or more treatment factors are included in the crossover design then the reduction in total animal usage can be considerable. In this paper we consider such designs, defined as multi-factor crossover designs. The designs are applicable when there are several different treatment factors, each at t levels, to be applied to the experimental units. The motivation for investigating these designs was a study conducted at GlaxoSmithKline to determine the preference of male and female dogs for t=5 different types of bed and t=5 different bedding conditions. A construction method is given for forming universally optimal designs for t not too large. Also given is an example for the special case where the number of treatment levels t=6.     

Optimal regular graph designs

A typical problem in optimal design theory is finding an experimental design that is optimal with respect to some criteria in a class of designs. The most popular criteria include the A- and D-criteria. Regular graph designs occur in many optimality results, and if the number of blocks is large enough, an A-optimal (or D-optimal) design is among them (if any exist). To explore the landscape of designs with a large number of blocks, we introduce extensions of regular graph designs. These are constructed by adding the blocks of a balanced incomplete block design repeatedly to the original design. We present the results of an exact computer search for the best regular graph designs and the best extended regular graph designs with up to 20 treatments v, block size \(k \le 10\) and replication r \(\le 10\) and \(r(k-1)-(v-1)\lfloor r(k-1)/(v-1)\rfloor \le 9\).     

Sweeping,alignment and the analysis of unbalanced data

The terms sweeping and alignment refer to the same process. Sweeping/alignment is used by data analysts as a technique for describing the effects of a model factor (e.g., treatments in a randomized block design) after the effects of nuisance parameters (e.g., blocks) have been removed from the data. In this paper sweeping/alignment is used as the basis for developing tests of factors in unbalanced experimental design models. Formulas are presented for treatment effects in randomized block designs with missing observations, and for interaction and main effects in unbalanced two-way factorial designs with empty cells.     

Generalized neighbor designs with block size 3

A generalized neighbor design relaxes the equality condition on the number of times two treatments as neighbors in the design. In this article, we have considered the construction of some classes of generalized neighbor designs with block size k=3 by using the method of cyclic shifts. The distinguishing feature of this construction method is that the properties of a design can easily be obtained from the sets of shifts instead of constructing the actual blocks of the design. A catalog of generalized neighbor designs with block size k=3 is compiled for v∈{5,6,…,18} treatments and for different replications. We provide the reader with a simpler method of construction, and in general the catalog that gives an open choice to the experimenter for selecting any class of neighbor designs.     

Cutting Experimental Designs into Blocks

Most experimental material in agriculture and industry is heterogeneous in nature and therefore its statistical analysis benefits from blocking. Many experiments are restricted in time or space, and again blocking is useful. This paper adopts the idea of orthogonal blocking of Box & Hunter (1957) and applies it to optimal blocking designs. This approach is then compared with the determinant-based approach described in the literature for constructing block designs.     

PARTIALLY EQUINEIGHBOURED DESIGNS

This paper presents further results on a class of designs called equineighboured designs, ED. These designs are intended for field and related experiments, especially whenever there is evidence that observations in the same block are correlated. An ED has the property that every unordered pair of treatments occurs as nearest neighbours equally frequently at each level. Ipinyomi (1986) has defined and shown that ED are balanced designs when neighbouring observations are correlated. He has also presented ED as a continuation of the development of optimal block designs. An ED would often require many times the number of experimental materials needed for the construction of an ordinary balanced incomplete block, BIB, design for the same number of treatments and block sizes. Thus for a relatively large number of treatments and block sizes the required minimum number of blocks may be excessively large for practical use of ED. In this paper we shall define and examine partially equineighboured designs with n concurrences, PED (n), as alternatives where ED are practically unachievable. Particular attention will be given to designs with smaller numbers of blocks and for which only as little balance as possible may be lost.     

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.