Row-column designs with minimal units

A new class of row-column designs is proposed. These designs are saturated in terms of eliminating two-way heterogeneity with an additive model. The proposed designs are treatment-connected, i.e., all paired comparisons of treatments in the designs are estimable in spite of the existence of row and column effects. The connectedness of the designs is justified from two perspectives: linear model and contrast estimability. Comparisons with other designs are studied in terms of A-, D-, E-efficiencies as well as design balance.     

Row-column designs for comparing treatments with a control

This paper considers the problem of the design and analysis of experiments for comparing several treatments with a control when heterogeneity is to be eliminated in two directions. A class of row-column designs which are balanced for treatment vs. control comparisons (referred to as the balanced treatment vs. control row-column or BTCRC designs) is proposed. These designs are analogs of the so-called BTIB designs proposed by Bechhofer and Tamhane (Technometrics 23 (1981) 45–57) for eliminating heterogeneity in one direction. Some methods of analysis and construction of these designs are given. A measure of efficiency of BTCRC designs in terms of the A-optimality criterion is derived and illustrated by several examples.     

Neighbor-Balanced Row-column Designs

In this article, row-column designs incorporating directional neighbor effects have been studied. A row-column design is said to be neighbor balanced if every treatment has all other treatments appearing as a neighbor a constant number of times. We considered here three different situations under row-column setup incorporating neighbor effects viz., row-column design with one-sided neighbor effect, two-sided neighbor effect, and four-sided neighbor effect. The information matrices for all the situations for estimating the direct and neighbor effects of treatments have been derived. Methods of constructing neighbor-balanced row-column designs have been developed and its characterization properties have been studied.     

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.     

Equineighboured balanced nested row-column designs

This paper presents equineighboured balanced nested row-column designs for v treatments arranged in b blocks each comprising pq units further grouped into p rows and q columns. These are two-dimensional designs with the property that all pairs of treatments are neighbours equally frequently at all levels in both rows and columns. Methods of construction are given both for designs based on Latin squares and those where pq≤v. Cyclic equineighboured designs are defined and tabulated for 5≤v≤10, p≤3, q≤5, where r=bpq/v is the number of replications of each treatment.     

THE ROBUSTNESS OF BINARY AND NON-BINARY BALANCED NESTED ROW-COLUMN DESIGNS UNDER THE UNAVAILABILITY OF BLOCKS: A COMPARISON

In cases where both exist, the balanced, binary nested row-column designs are known to be inferior to a class of balanced non-binary designs. However, if it is possible for blocks of observations to become unavailable after an experiment has commenced, a binary nested row-column design may possibly be better than a non-binary one. This paper investigates the robustness of binary and non-binary variance-balanced nested row-column designs to the unavailability of one or more blocks of observations. Robustness is measured through the C-matrices of the designs resulting from removing blocks, using optimality criteria such as A-, D-, E- and MV-optimality.     

On a robustness property of PBIBD

In this paper we study a robustness property of partially balanced incomplete block designs based on association schemes with m classes (PBIBD(m)) against the unavailability of data in the sense that, when any t (a positive integer) observations are unavailable the design remains connected w.r.t. treatment. We characterize the robustness property of PBIBD(m) completely for m=2 and partially for m=3.     

Search designs for 2m factorials derived from balanced arrays of strength 2(l+1) and ad-optimal search designs

We consider a search design for the 2^m type such that at most knonnegative effects can be searched among (l+1)-factor interactions and estimated along with the effects up to l- factor interactions, provided (l+1)-factor and higher order interactions are negligible except for the k effects. We investigate some properties of a search design which is yielded by a balanced 2^m design of resolution 2l+1 derived from a balanced array of strength 2(l+1). A necessary and sufficient condition for the balanced design of resolution 2l+1 to be a search design for k=1 is given. Optimal search designs for k=1 in the class of the balanced 2^m designs of resolution V (l=2), with respect to the AD-optimality criterion given by Srivastava (1977), with N assemblies are also presented, where the range of (m,N) is (m=6; 28≤N≤41), (m=7; 35≤N≤63) and (m=8; 44≤N≤74).     

The combinatorial characterization of certain connected 2×j×k three-way layouts

This paper gives a complete combinatorial solution to classifying connected three-way layouts of a particular kind namely those with 2 rows J columns and K treatments but only one treatment in every row-column cell. Such a design is connected if a certain simple property holds for a graph derived easily from the design.     

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.     

On the norm of alias matrices in balanced fractional 2m factorial designs of resolution 2l + 1

The norm $\text{6A6 = {tr(A′A)}}{}^{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}$ of the alias matrix A of a design can be used as a measure for selecting a design. In this paper, an explicit expression for 6A6 will be given for a balanced fractional 2^m factorial design of resolution 2l + 1 which obtained from a simple array with parameters (m; λ₀, λ₁,…, λ_m). This array is identical with a balanced array of strength m, m constraints and index set {λ₀, λ₁,…, λ_m}. In the class of the designs of resolution V (l = 2) obtained from S-arrays, ones which minimize 6A6 will be presented for any fixed N assemblies satisfying (i) m = 4, 11 ? N ? 16, (ii) m = 5, 16 ? N ? 32, and (iii) m = 6, 22 ? N ? 40.     

Some determinant optimality aspects of main effect fold-over designs

Saha and Mohanty (1970) presented a main effect fold-over design consisting of 14 treatment combinations of the 24×33 factorial, which had the nice property of being even balanced. Calling this design DSM, this paper establishes the following specific results: (i) DSM is not d-optimal in the subclass Δe of all 14 point even balanced main effect fold-over designs of the 24×33 factorial; (ii) DSM is not d-optimal in the subclass $\text{Δ}{}^1\text{?Δ}{}^{\mathrm{e}}$ of all 14 point even and odd balanced main effect fold-over designs of the 24×33 factorial; (iii) DSM is even optimal in $\text{Δ}{}^1$ and Δe. In addition to these results two 14 point designs in $\text{Δ}{}^1$ are presented which are d-optimal and via a counter example it is shown that these designs are not odd optimal. Finally, several general matrix algebra results are given which should be useful in resolving d-optimality problems of fold-over designs of the kn11×kn22 factorial.     

Designs for balanced observation of plant competition

Symmetric designs, for exploring the effect of competition between two varieties or plant species planted on a triangular lattice of hill plots, are discussed and the class of m-fold symmetric Beehive designs, based on certain symmetry properties of a regular hexagon, is introduced. The designs considered by Martin (1973) and Veevers and Boffey (1975) belong to the family arising when m = 6. Optimal designs for m = 2 and 3 are presented and, although not balanced, improvements in the sense of being nearer to balanced are achieved.Taking an alternative approach, a simple technique for constructing balanced, essentially rectangular, designs of arbitrary size is developed, based upon a set of twelve symmetric elementary arrays which possess a remarkable self-building property. The experimenter is at liberty to choose a balanced design to suit restrictions on space and material or to meet his desired degree of replication whilst the actual planting technique requires only that complete rows of each variety be suitably juxtaposed.     

A new lower bound to A2-optimality measure for multi-level and mixed-level column balanced designs and its applications

In this paper, a new lower bound to A₂-optimality measure is derived and is applied to multi-level and mixed-level column balanced designs. A₂-optimal multi-level and mixed-level designs are obtained by the application of the new lower bound.     

A basic lemma and the analysis of block and Kronecker product designs

In this paper the analysis of the class of block designs whose C matrix can be expressed in terms of the Kronecker product of some elementary matrices is considered. The analysis utilizes a basic result concerning the spectral decomposition of the Kronecker product of symmetric matrices in terms of the spectral decomposition of the component matrices involved in the Kronecker product. The property (A) of Kurkjian and Zelen (1963) is generalised and the analysis of generalised property (A) designs is given. It is proved that a design is balanced factorially if and only if it is a generalised property (A) design. A method of analysis of Kronecker product block designs whose component designs are equi-replicate and proper is also suggested.     

E-optimal design in irregular BIBD settings

When the necessary conditions for a BIBD are satisfied, but no BIBD exists, there is no simple answer for the optimal design problem. This paper identifies the E-optimal information matrices for any such irregular BIBD setting when the number of treatments is no larger than 100. A- and D-optimal designs are typically not E-optimal. An E-optimal design for 15 treatments in 21 blocks of size 5 is found.     

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\).     

On some properties of the dual of a totally balanced block design

In this paper it is shown that the dual of a totally balanced block design with t = b, is also a totally balanced block design. It is shown that Fisher's inequality $\text{b≧t}$ for BIB designs, holds also for a totally balanced block design.     

Multiple comparisons for an unbalanced a × b design under mixed models with interaction

Consider a two-way factorial experiment involving a “treatment” factor A with fixed effects, a “blocking” factor B with random effects, and interaction effects perhaps non-negligible. The degree of balance required for multiple comparison procedures to be applicable for the comparison of the treatment effects using ordinary least-squares estimates is investigated. For main effects to be estimated independently of MSAB, a sufficient condition is that the design consist of identical blocks, a strong condition of proportional frequencies. Surprisingly, under this condition of proportional frequencies, MSAB does not provide an appropriate variance estimate for inferences on each treatment contrast, even though the statistics F = MSA/MSAB is appropriate for testing equality of the treatment effects. In short, when factor B is random, standard methods of multiple comparisons apply using the interaction mean square MSAB as a variance estimator only when the treatment-block incidences n_n are constant. Nevertheless, for designs with identical blocks, appropriate variance estimates can be identified to allow for conservative or approximate multiple comparisons. This is illustrated for certain treatment balanced designs for comparisons with a control.     

Balanced arrays of strength 4 and balanced fractional 3m factorial designs

A connection between a balanced fractional 2^m factorial design of resolution 2l + 1 and a balanced array of strength 2l with index set {μ₀, μ₁,…, μ_2l} was established by Yamamoto, Shirakura and Kuwada (1975). The main purpose of this paper is to give a connection between a balanced fractional 3^m factorial design of resolution V and a balanced array of strength 4, size N, m constraints, 3 levels and index set {λ_l0l1l2}.