MULTI-FACTOR BALANCED BLOCK DESIGNS WITH COMPLETE ADJUSTED ORTHOGONALITY FOR ALL PAIRS OF TREATMENT FACTORS

A new series of multi-factor balanced block designs is introduced. Each of these designs has the following properties: (i) each of its k– 1 treatment factors is disposed in a cyclic or multi-cyclic balanced incomplete block design with parameters (v,b,r,k,Λ) = (a(k-l) + 1,a²(k-1) +a, ak, k, k) (a > 1); (ii) the incidence of any one of the treatment factors on any other is balanced; and (iii) after adjustment for blocks only, the relationship between any two of the treatment factors is that of adjusted orthogonality. The treatment factors are thus orthogonal to one another in the within-blocks stratum of the analysis of variance. The designs provide a benchmark with which other designs may be compared.     

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.     

UPPER BOUNDS FOR LATINIZED DESIGNS

Upper bounds axe derived for the efficiency factor of a class of resolvable incomplete block designs known as latinized designs. These designs are particularly useful in glasshouse and field trials, and can be readily extended to two-dimensional blocking structures. Existing bounds for resolvable designs axe also reviewed and a comparison is made between the third moment bounds discussed by Jarrett (1989) and the second moment bounds of Tjur (1990).     

THE USE OF A CLASS OF FOLDOVER DESIGNS AS SEARCH DESIGNS

It is shown that members of a class of two-level nonorthogonal resolution IV designs with n factors are strongly resolvable search designs when k, the maximum number of two-factor interactions thought possible, equals one; weakly resolvable when k = 2 except when the number of factors is 6; and may not be weakly resolvable when k≥ 3.     

SOME PROPERTIES OF A FOLDOVER DESIGN

The foldover design of the 12-run Plackett-Burman design is shown to give a 2⁴and 2^4-1design in every set of four factors, and to be resolution V in every set of five factors. In addition, the design allows the search and estimation of up to two non-zero interactions.     

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

ADJUSTED ORTHOGONAL NESTED ROW-COLUMN DESIGNS

Adjusted orthogonality in nested row-column designs is defined and a sufficient condition established for its existence. It is shown that the properties of an adjusted orthogonal nested row-column design are directly related to those of its separate row and column component designs. A method for constructing efficient adjusted orthogonal designs involving a single replicate of every treatment in each of two blocks is given.     

A NEW MEASURE OF ROTATABILITY OF RESPONSE SURFACE DESIGNS

This paper proposes a new measure of rotatability of a response surface design. It is based on a comparison between the design moments of a given design and the design moments of a rotatable design closest to the given design in the least squares sense. This measure is easier to calculate than Khur?s measure. An alternative easier non-geometrical way of deriving Khuri's measure is also presented. Both measures are calculated to illustrate some designs considered by Khuri.     

CONSTRUCTION OF RESOLVABLE ROW-COLUMN DESIGNS USING SIMULATED ANNEALING

The paper describes an algorithm which constructs optimal or near optimal resolvable row-column designs. Its performance is assessed against available tables of two-replicate designs.     

Partially efficiency-balanced designs-II

efficiency balanced (£R) and partially efficiency balanced (PEB) designs were studied hy Calinski (1971) and Puri and Higam (1971, 1977a). In tais paper we have studied the dual desinas of two classes of PEB designs. It is shown that the dual of any symmetrical PCS design with HN'=N'H is again a PEB design. Also the dual of a PEB(S) with μ₁ = 0 μ₂ = 0and is shown to the again a PEB(S). The relations between PEB designs and linked and partially linked blocks have heen established. As a conseguence, the analysis of linked Mock and partially linkei block designs can he sinrlififid. Sore useful classes of supplencntcd block designs having simple analysis have also been discussed.     

CONSTRUCTION OF RESOLVABLE ROW-COLUMN DESIGNS BASED ON CONTRACTIONS

This paper defines the contraction of a resolvable row‐column design for more than two replicates. It shows that the (M,S)‐optimality criterion for the row‐column designs can be expressed simply in terms of the elements of the row and column incidence matrices of the contraction. This allows the development of a very fast algorithm to construct optimal or near‐optimal resolvable row‐column designs. The performance of such an algorithm is compared with an existing algorithm.     

Some new constructions of circular balanced repeated measurements designs

Repeated measurements designs are widely used in medicine, pharmacology, animal sciences, and psychology. In this article, some infinite series are developed to generate the balanced repeated measurements designs for p (periods) even. For p odd, construction procedures are also described. Catalogues of the proposed designs are also presented for p = 5, 7, 9, when v ≤ 100.     

Minimal circular strongly balanced repeated measurements designs in periods of three different sizes

Repeated measurements designs (RMD) are widely used in medicine, pharmacology, animal sciences, and psychology. If there is a restriction on the total number of treatments, some experimental units can receive on the total length of time while some experimental units can remain in the trial, then RMD in periods of unequal sizes should be used. In this article, some infinite series are developed to generate the minimal circular strongly balanced RMD in periods of three different sizes p₁, p₂, and p₃, where 2 ≤ p₃ < p₂ ≤ 10.     

A METHOD FOR DETERMINING THE ASYMPTOTIC EFFICIENCY OF SOME SEQUENTIAL PROBABILITY RATIO TESTS

This paper gives a method for decomposing many sequential probability ratio tests into smaller independent components called “modules”. A function of some characteristics of modules can be used to determine the asymptotically most efficient of a set of statistical tests in which a, the probability of type I error equals β, the probability of type II error. The same test is seen also to give the asymptotically most efficient of the corresponding set of tests in which a is not equal to β. The “module” method is used to give an explanation for the super-efficiency of the play-the-winner and play-the-loser rules in two-sample binomial sampling. An example showing how complex cases can be analysed numerically using this method is also given.     

Non binary partially neighbor balanced designs for circular blocks

ABSTRACT

Neighbor designs are recommended for the cases where the performance of treatment is affected by the neighboring treatments as in biometrics and agriculture. In this paper we have constructed two new series of non binary partially neighbor balanced designs for v = 2n and v = 2n+1 number of treatments, respectively. The blocks in the design are non binary and circular but no treatment is ever a neighbor to itself. The designs proposed here are partially balanced in terms of nearest neighbors. No such series are known in the literature.     

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

A NEW UPPER BOUND FOR THE EFFICIENCY FACTOR OF A BLOCK DESIGN

An upper bound for the efficiency factor of a block design, which in many cases is tighter than those reported by other authors, is derived. The bound is based on a lower bound for E(1/X) in terms of E(X) and var(X) for a random variable X on the unit interval. For the special case of resolvable designs, an improved bound is given which also competes with known bounds for resolvable designs in some cases.