Regular group divisible designs and Bhaskar Rao designs with block size three

Some recursive constructions are given for Bhaskar Rao designs. Using examples of these designs found by Shyam J. Singh, Rakesh Vyas and new ones given here we show the necessary conditions λ≡0 (mod 2), λυ(υ?1)≡0 (mod 24) are sufficient for the existence of Bhaskar Rao designs with one association class and block size 3. This result is used with a result of Street and Rodger to obtain regular partially balanced block designs with 2υ treatments, block size 3, λ₁=0, group size 2 and υ groups.     

On the construction of a class of efficient row-column designs

In this paper a method for the construction of a class of row-column designs with good statistical properties and high efficiency is presented. The class of designs produced is shown to exhibit balance, orthogonality and adjusted orthogonality. The efficiencies of these designs are investigated in detail, and they are shown to be very high, and possibly maximal in some cases.     

Generalized Bhaskar Rao designs

Generalized Bhaskar Rao designs with non-zero elements from an abelian group G are constructed. In particular this paper shows that the necessary conditions are sufficient for the existence of generalized Bhaskar Rao designs with k=3 for the following groups: ?G? is odd, G=Z^r₂, and G=Z^r₂×H where 3? ?H? and r?1. It also constructs generalized Bhaskar Rao designs with υ=k, which is equivalent to υ rows of a generalized Hadamard matrix of order n where υ?n.     

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.     

Recent developments in D-optimal designs

In the paper, some issues concerned with the determining spring balance weighing designs satisfying the criterion of D-optimality under the assumption measurement errors are uncorrelated and they have the same variances are discussed. In addition, highly D-efficient spring balance weighing designs are also considered. Some conditions under which any spring balance weighing design is regular D-optimal or highly D-efficient are proved. What is more, new construction methods of regular D-optimal and highly D-efficient spring balance weighing designs are presented.     

Complete designs with blocks of maximal multiplicity

The set of distinct blocks of a block design is known as its support. We construct complete designs with parameters v(?7), k=3, λ=v ? 2 which contain a block of maximal multiplicity and with support size $\text{b}{}^1\text{= (}{}^{\mathrm{v}}{}_3\text{) ? 4(v ? 2)}$. Any complete design which contains such a block, and has parameters v, k, λ as above, must be supported on at most (^v₃) ? 4(v ? 2) blocks. Attention is given to complete designs because of their direct relationship to simple random sampling.     

Some methods for constructing efficiency-balanced block designs

Three methods are presented for constructing connected efficiency-balanced block designs from other block designs with the same properties. The resulting designs differ from the original ones in the number of blocks and/or in the number of experimental units and their arrangement, while the number of treatments remains unaltered. Some remarks on the proposed methods of construction refer also to variance-balanced block designs.     

On the construction of group divisible incomplete block designs

In this paper a method of constructing group-divisible incomplete block designs has been suggested. A series of balanced incomplete block designs has also been obtained.     

Iterative analysis of two- and three-way designs

The iterative analysis of block designs is considered and an iterative method for analysing three-way designs is derived using a well known mathematical result. The results presented are discussed with the help of examples.     

Generalized Bhaskar Rao designs of block size three

We show that the necessary conditions

$\text{λ≡0 (}\text{mod}\text{|G|)}$

,

$\text{λ(υ?1)≡0 (}\text{mod}\text{2)}$

,

$\text{λυ(υ?1)≡}\text{0 (}\text{mod}\text{6)}\text{for}\text{|G|}\text{odd}\text{,}\text{0 (}\text{mod}\text{24)}\text{for}\text{|G|}\text{even}$

, are sufficient for the existence of a generalized Bhaskar Rao design GBRD(υ,b,r,3,λ;G) for the elementary abelian group G, of each order |G|.     

Measures of non orthogonality in block designs

Orthogonality is an important concept in block design. Necessary and sufficient condition for a connected block design to be orthogonal is well known. However, when a design is not orthogonal, it is not clear how much it deviates from orthogonality. In this paper, an attempt has been made to first define the measures of or indices to non orthogonality in block design and then to characterize designs possessing minimum non orthogonality indices. It is shown that a Balanced Incomplete Block Design (BIBD) and a Balanced Block Design (BBD), if exist, possess this property.     

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.     

On Kronecker block designs for factorial experiments

In this paper the use of Kronecker designs for factorial experiments is considered. The two-factor Kronecker design is considered in some detail and the efficiency factors of the main effects and interaction in such a design are derived. It is shown that the efficiency factor of the interaction is at least as large as the product of the efficiency factors of the two main effects and when both the component designs are totally balanced then its efficiency factor will be higher than the efficiency factor of either of the two main effects. If the component designs are nearly balanced then its efficiency factor will be approximately at least as large as the efficiency factor of either of the two main effects. It is argued that these designs are particularly useful for factorial experiments.Extensions to the multi-factor design are given and it is proved that the two-factor Kronecker design will be connected if the component designs are connected.     

Some bounds on balanced block designs

Bounds on the latest root of the C-matrix and the number of blocks for a variance-balanced block design are given. These results contain the well-known results as special cases.     

On some optimal fractional 2m factorial designs of resolution V

This paper presents the trace of the covariance matrix of the estimates of effects based on a fractional 2^m factorial (2^m-FF) design T of resolution V for the following two cases: One is the case where T is constructed by adding some restricted assemblies to an orthogonal array. The other is one where T is constructed by removing some restricted assemblies from an orthogonal array of index unity. In the class of 2^m-FF designs of resolution V considered here, optimal designs with respect to the trace criterion, i.e. A-optimal, are presented for m = 4, 5, and 6 and for a range of practical values of N (the total number of assemblies). Some of them are better than the corresponding A-optimal designs in the class of balanced fractional 2^m factorial designs of resolution V obtained by Srivastava and Chopra (1971b) in such a sense that the trace of the covariance matrix of the estimates is small.     

Block designs with block size two

Algorithms are given for the construction of binary block designs with replications and concurrences differing by at most one. The designs are resolvable and/or connected wherever the parameters permit.     

An infinite class of PBIB designs

In this paper, an infinite class of partially balanced incomplete block (PBIB) designs of m+1 associate classes is constructed through the use of a series of row-orthogonal matrices known as partially balanced orthogonal designs (PBOD) of m-associate classes. For the purpose, a series of PBOD is obtained through a method described herein. An infinite class of regular GD designs is also reported.     

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.     

Incomplete block designs for symmetrical parallel line assays

New series of incomplete block designs for symmetrical parallel lines are proposed. From these designs important contrasts like L_p, L₁ and L′₁ are estimated free from block effects. In addition to these, other odd order contrasts are also estimated orthogonal to block effects. The designs are shown to have simple analysis.     

A note on trend-free block designs

Trend-free and nearly trend-free block designs were developed to eliminate polynomial trends across the plots of experimental designs. Yeh, Bradley and Notz (1985) proved that certain nearly trend-free designs are A- and D-optimal in a subclass of all competing designs. This article extends that result by enlarging the class of designs for which the optimality holds, and by increasing the class of optimality criteria from A- and D-optimality to the class of all Schur-convex nonincreasing functions.