A REVIEW OF BOUNDS FOR THE EFFICIENCY FACTOR OF BLOCK DESIGNS

This paper draws together bounds for the efficiency factor of block designs, starting with the papers of Conniffe & Stone (1974) and Williams & Patterson (1977). By extending the methods of Jarrett (1983), firstly to cover supercomplete block designs and then to cover resolvable designs, a set of bounds is obtained which provides the best current bounds for any block design with equal replication and equal block size, including resolvable designs and two-replicate resolvable designs as special cases. The bounds given for non-resolvable designs apply strictly only to designs which are either regular-graph (John & Mitchell, 1977) or whose duals are regular-graph. It is conjectured (John & Williams, 1982) that they are in fact global bounds. Similar qualifications apply to the bounds for resolvable designs.     

The General Multivariate Gauss—Markov Model of the Incomplete Block Design

The aim of the paper is to generalize testing and estimation for the multivariate standard incomplete block model (Rao & Mitra, 1971a) to the general multivariate Gauss—Markov incomplete block model with singular covariance matrix. The results of this paper can be applied to particular cases of the multivariate Gauss—Markov incomplete block model, including the Zyskind—Martin model.     

COMPUTER-AIDED CONSTRUCTION OF SMALL (M, S)-OPTIMAL INCOMPLETE BLOCK DESIGNS

A new exchange algorithm for the construction of (M, S)-optimal incomplete block designs (IBDS) is developed. This exchange algorithm is used to construct 973 (M, S)-optimal IBDs (v, k, b) for v= 4,…,12 (varieties) with arbitrary v, k (block size) and b (number of blocks). The efficiencies of the “best” (M, S)-optimal IBDs constructed by this algorithm are compared with the efficiencies of the corresponding nearly balanced incomplete block designs (NBIBDs) of Cheng(1979), Cheng & Wu (1981) and Mitchell & John(1976).     

A CONDITIONAL DERIVATION OF RESIDUAL MAXIMUM LIKELIHOOD

Patterson & Thompson (1971) introduced residual maximum likelihood estimation in the case of unbalanced incomplete block designs. Harville (1974) and Cooper & Thompson (1977) give alternative derivations of the likelihood function. The purpose of this note is to provide another derivation of the likelihood function which may be useful in teaching.     

An algorithm for constructing optimal resolvable incomplete block designs

This paper describes an efficient algorithm for the construction of optimal or near-optimal resolvable incomplete block designs (IBDs) for any number of treatments v < 100. The performance of this algorithm is evaluated against known lattice designs and the 414 or-designs of Patterson & Williams [36]. For the designs under study, it appears that our algorithm is about equally effective as the simulated annealing algorithm of Venables & Eccleston [42]. An example of the use of our algorithm to construct the row (or column) components of resolvable row-column designs is given.     

ON THE DESIGN OF FIELD EXPERIMENTS UNDER A ONE-DIMENSIONAL NEIGHBOUR MODEL

This paper examines the effect of randomisation restrictions, either to satisfy conditions for a balanced incomplete block design or to attain a higher level of partial neighbour balance, on the average variance of pair-wise treatment contrasts under a neighbour model discussed by Gleeson & Cullis (1987). Results suggest that smaller average pairwise variances can be obtained by ignoring requirements for incomplete block designs and concentrating on achieving a higher level of partial neighbour balance. Field layout of the design, although often determined by practical constraints, e.g. size, shape of site, minimum plot size and experimental husbandry, may markedly affect average pairwise variance. For the one-dimensional (row-wise) neighbour model considered here, investigation of three different layouts suggests that for a rectangular array of plots, smaller average pairwise variances can generally be obtained from layouts with fewer rows and more plots per row.     

Mixture designs with orthogonal blocks

Constructions of blocked mixture designs are considered in situations where BLUEs of the block effect contrasts are orthogonal to the BLUEs of the regression coefficients. Orthogonal arrays (OA), Balanced Arrays (BAs), incidence matrices of balanced incomplete block designs (BIBDs), and partially balanced incomplete block designs (PBIBDs) are used. Designs with equal and unequal block sizes are considered. Also both cases where the constants involved in the orthogonality conditions depend and do not depend on the factors have been taken into account. Some standard (already available) designs can be obtained as particular cases of the designs proposed here.     

Existence of nested designs with block size five

The block designs considered here are nested in the unified sense of Preece (Biometrika 54 (1967) 479–486) and Federer (in: T.A. Baneroft (Ed.), Statistical Papers in Honor of George W. Snedecor, 1972, pp. 91–114), that is, each block of the larger balanced incomplete block design contains several distinguished families of mutually disjoint sub-blocks, the sub-blocks of the same family belonging to the same system, such that each system forms the collection of blocks of some balanced incomplete block design. In this paper, it is shown that the necessary conditions for the existence of such designs are also sufficient for block size 5 and sub-block sizes 2 and 3. This, together with known results, implies the entire existence of such designs with block size 5 in general.     

General upper bound for the number of blocks having a given number of treatments common with a given block

The purpose of this paper is systematically to derive the general upper bound for the number of blocks having a given number of treatments common with a given block of certain incomplete block designs. The approach adopted here is based on the spectral decomposition of N′N for the incidence matrix N of a design, where N' is the transpose of the matrix N. This approach will lead us to upper bounds for incomplete block designs, in particular for a large number of partially balanced incomplete block (PBIB) designs, which are not covered with the standard approach (Shah 1964, 1966), Kapadia (1966)) of using well known relations between blocks of the designs and their association schemes. Several results concerning block structure of block designs are also derived from the main theorem. Finally, further generalizations of the main theorem are discussed with some illustrations.     

On a paper by kageyama and mohan

Kageyama Mohan (1984) have presented three methods of constructing new incomplete block designs from balanced incomplete block designs, They raise questions about the designs which come from each of their methods, These questions are answered, Another series of group divisible designs is derived as a special case of their second method.     

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.     

Balanced and partially balanced incomplete block designs with autocorrelation errors

The paper aims to find variance balanced and variance partially balanced incomplete block designs when observations within blocks are autocorrelated and we call them BIBAC and PBIBAC designs. Orthogonal arrays of type I and type II when used as BIBAC designs have smaller average variance of elementary contrasts of treatment effects compared to the corresponding Balanced Incomplete Block (BIB) designs with homoscedastic, uncorrelated errors. The relative efficiency of BIB designs compared to BIBAC designs depends on the block size k and the autocorrelation ρ and is independent of the number of treatments. Further this relative efficiency increases with increasing k. Partially balanced incomplete block designs with autocorrelated errors are introduced using partially balanced incomplete block designs and orthogonal arrays of type I and type II.     

Characterization of certain incomplete block designs

It is shown that certain inequalities known for partially balanced incomplete block (PBIB) designs remain valid for general incomplete block designs. Some conditions for attaining their bounds are also given. Furthermore, the various types of PBIB designs are characterized by relating blocks of designs with association schemes. The approach here is based on the spectral expansion of NN' for the incidence matrix N of an incomplete block design.     

Three methods of constructing pbib designs

Three construction methods of two- or three-associate partially balanced incomplete block (PBIB) designs are presented.     

The Construction of Optimal Balanced Incomplete Block Designs When Adjacent Observations are Correlated

An algorithm is described for the optimal rearrangement of the treatments within each block of a Balanced Incomplete Block Design when a specified “nearest neighbour” correlation structure exists among observations from plots in the same block. The procedure uses results obtained by Kiefer & Wynn (1981). Designs obtained using the algorithm are found to compare favourably with those produced by combinatorial methods given in Cheng (1983). The algorithm produces optimal designs for all BIBD parameter sets, including those not covered by the results of Kiefer & Wynn or Cheng.     

Remark on Construction of Efficiency-Balanced Designs

In this note, all the efficiency-balanced block designs constructed by utilizing two methods of Dey & Singh (1980) are completely presented within a practical range of parameters.     

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.     

Polygonal designs: some existence and non-existence results

Polygonal designs are introduced as a generalization of balanced incomplete block designs and as a specialization of partially balanced incomplete block designs. As in the case of balanced incomplete block designs, there is no hope of deciding the values of the parameters for which polygonal designs exist. We develop enough theory to reveal the structure, and thus, to resolve the existence problem for small polygonal designs, and derive necessary conditions for general cases. © 1998 Elsevier Science B.V. All rights reserved.     

Incomplete block designs for complete diallel crosses and their analysis

A large number of incomplete block designs for Griffing's complete diallel cross-systems I, II and III, involving from five to 12 lines, are suggested, using two-associate triangular partially balanced incomplete block designs. Analysis of incomplete block designs for complete diallel cross-systems has been carried out assuming the most appropriate model for genetic yield, as advocated by Hinklemnann. This includes estimation of the general combining ability, specific combining ability and reciprocal cross- effects. An illustration of the design for each system is presented.     

Block designs robust against the presence of positional effects

The problem considered is to find optimum designs for treatment effects in a block design (BD) setup, when positional effects are also present besides treatment and block effects, but they are ignored while formulating the model. In the class of symmetric balanced incomplete block designs, the Youden square design is shown to be optimal in the sense of minimizing the bias term in the mean squared error (MSE) of the best linear unbiased estimators of the full set of orthonormal treatment contrasts, irrespective of the value of the positional effects.