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.     

The analysis of mixed and random effects models for equireplicate variance-balanced block designs

Equirephcate variance-balanced block designs possess many desirable properties and include several important subclasses of designs, such as balanced incomplete block designs. However, while attention has been paid to the derivation of properties and the construction of these designs, methods of analyzing experiments using these designs have not been developed completely. Thus, we consider models appropriate to these designs, construct test statistics for basic hypotheses and derive the distributions for these statistics. Four additive models that include all of the possible combinations of fixed and random effects are examined. The analyses are generalizations of the analyses for balanced incomplete block designs, and include the intra-block, intra-treatment and inter-block analyses, Estimators of fixed treatment effects and their distributions also are given.     

Constructions of Nested Pairwise Efficiency and Variance Balanced Designs

ABSTRACT

Nested pairwise efficiency and variance balanced designs form a new class of block designs. In this article, two methods of constructing such designs from a symmetric balanced incomplete block design are proposed with some illustrations.     

Three methods of constructing pbib designs

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

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 CONSTRUCTION OF GENERALIZED GROUP DIVISIBLE DESIGNS WITH TWO GROUPS

ABSTRACT

Many simple and general methods of construction, using α-resolvable balanced incomplete block designs, for generalized group divisible designs with two groups (GGDD(2)) are given. The E-optimality of all constructed designs is also discussed.     

On totally balanced block designs for competition effects

Competition between neighbouring units in field experiments is a serious source of bias. The study of a competing situation needs construction of an environment in which it can happen and the competing units have to appear in a predetermined pattern. This paper describes methods of constructing incomplete block designs balanced for neighbouring competition effects. The designs obtained are totally balanced in the sense that all the effects, direct and neighbours, are estimated with the same variance. The efficiency of these designs has been computed as compared to a complete block design balanced for neighbours and a catalogue has also been prepared.     

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.     

RANDOMIZED SEARCH STRATEGIES FOR FINDING OPTIMAL OR NEAR OPTIMAL BLOCK AND ROW-COLUMN DESIGNS

We consider a family of effective and efficient strategies for generating experimental designs of several types with high efficiency. These strategies employ randomized search directions and at some stages allow the possibility of taking steps in a direction of decreasing efficiency in an effort to avoid local optima. Hence our strategies have some affinity with the simulated annealing algorithm of combinatorial optimization. The methods work well and compare favourably with other search strategies. We have implemented them for incomplete block designs, optionally resolvable, and for row-column designs.     

Designing field experiments which are subject to representation bias

The term 'representation bias' is used to describe the disparities that exist between treatment effects estimated from field experiments, and those effects that would be seen if treatments were used in the field. In this paper we are specifically concerned with representation bias caused by disease inoculum travelling between plots, or out of the experimental area altogether. The scope for such bias is maximized in the case of airborne spread diseases. This paper extends the work of Deardon et al. (2004), using simulation methods to explore the relationship between design and representation bias. In doing so, we illustrate the importance of plot size and spacing, as well as treatment-to-plot allocation. We examine a novel class of designs, incomplete column designs, to develop an understanding of the mechanisms behind representation bias. We also introduce general methods of designing field trials, which can be used to limit representation bias by carefully controlling treatment to block allocation in both incomplete column and incomplete randomized block designs. Finally, we show how the commonly used practice of sampling from the centres of plots, rather than entire plots, can also help to control representation bias.     

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.     

BALANCED ARRAYS AND WEIGHING DESIGNS

Dey (19711, Saha (1975), Kageyama & Saha (1983) and others have shown how optimum chemical balance weighing designs can be constructed from the incidence matrices of balanced incomplete block (BIB) designs. In this paper, it is shown that weighing designs can be constructed from some suitably chosen two-symbol balanced arrays of strength two, which need not always be incidence matrices of BIB designs. The findings lead us to construct new optimum chemical balance weighing designs from incidence matrices of BIB designs.     

Optimal k-circulant supersaturated designs

Optimal k-circulant supersaturated designs have been constructed in literature using computer intensive methods. A systematic method of construction for multi-level experiments based on balanced incomplete block designs is presented in this paper. The method is also applicable to two-level experiments. Illustrative examples are also given.     

Pseudo-Youden designs balanced for intersection

If the row-column intersections of a row-column design A form a balanced incomplete block design, then A is said to be balanced for intersection. This property was originally defined for triple arrays by McSorley et al. (2005a), Section 8, where an example was presented and questions of existence were raised and discussed. We give sufficient conditions for the class of balanced grids in order to be balanced for intersection, and prove that a family of binary pseudo-Youden designs has this property.     

The Construction of Optimal Imcomplete Block Designs When Observations Within a Block are Correlated

An algorithmic method is described for the construction of optimal incomplete block designs when a known correlation structure is assumed for observations from plots in the same block. The method is applicable to a wide class of designs and correlation structures. Some examples are given to illustrate the procedure.     

A new special class of peb designs

A new class of partially efficiency-balanced designs is introduced from a practical point of view. This new design includes all equireplicated incomplete block designs available in literature as special cases. The fundamental properties of the design are clarified with relation to other block designs.     

Linear Integer Programming Approach to Construction of Balanced Incomplete Block Designs

This article proposes a linear integer programming-based algorithm to construct balanced incomplete block designs. Working of the algorithm is illustrated with the help of an example. The algorithm is able to generate balanced incomplete block designs very fast in most of the cases. The performance of the proposed algorithm is compared with other algorithms proposed in the literature. It is demonstrated that the proposed algorithm is competitive with the existing algorithms.     

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.     

EFFICIENT BLOCK DESIGNS FOR CORRELATED OBSERVATIONS

Current methods for the design of efficient incomplete block experiments when the observations within a block are dependent usually involve computer searches of binary designs. These searches give little insight into the features that lead to efficiency, and can miss more efficient designs. This paper aims to develop some approximations which give some insight into the features of a design that lead to high efficiency under a generalized least-squares analysis for a known dependence structure, and to show that non-binary designs can be more efficient for some dependence structures. In particular, we show how neighbour balance and end plot balance are related to the design efficiency for low-order autoregressions, and that under moderate positive dependence, replication at lag two can sometimes increase efficiency.     

A NOTE ON THE ANALYSIS OF COVARIANCE IN BALANCED INCOMPLETE BLOCK DESIGNS

The Williams & Ratcliff (1980) and Zelen (1957) methods for the analysis of covariance in incomplete block designs with recovery of inter-block information are compared using data from a balanced incomplete block design. The former is shown to be more efficient. Other advantages of the Williams & Ratcliff formulation are also presented.