A note on the nonexistence of the constant block-sum balanced incomplete block designs

Abstract

Due to important practical applications and considerations in biomedical clinical trials, fixed block-sum designs are of interest. We show that in general, the constant block-sum balanced incomplete block designs do not exist.     

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.     

An evolutionary algorithm for A-optimal incomplete block designs

Evolutionary algorithms are heuristic stochastic search and optimization techniques with principles taken from natural genetics. They are procedures mimicking the evolution process of an initial population through genetic transformations. This paper is concerned with the problem of finding A-optimal incomplete block designs for multiple treatment comparisons represented by a matrix of contrasts. An evolutionary algorithm for searching optimal, or nearly optimal, incomplete block designs is described in detail. Various examples regarding the application of the algorithm to some well-known problems illustrate the good performance of the algorithm     

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.     

The Parshvanath yantram yields a constant-sum partially balanced incomplete block design

Yantrams have been used to generate mixture designs in the interior of a simplex. In this note, we show a connection between Parshvanath yantram and a particular partially balanced incomplete block design. This block design is rather special and somewhat unexpected due to the feature that sum of the treatment symbols in any block is constant.     

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.     

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.     

A note on circular neighbor balanced designs

ABSTRACT

This paper describes some methods of constructing circular neighbor balanced and circular partially neighbor balanced block designs for estimation of direct and neighbor effects of the treatments. A class of circular neighbor balanced block designs with unequal block sizes is also proposed.     

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.     

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.     

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.     

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.     

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.     

Application of PBIB designs in CDC Method IV

In this paper we propose the use of some partially balanced incomplete block designs for blocking in complete diallel cross Method IV (Griffing, 1956) to deal with the situation when it is not desirable for all crosses to be accommodated in the block of a traditional randomized block design. A method is also proposed to analyse the MatingEnvironment designs for estimating the general combining ability effect of lines.     

Generalized Youden designs: construction and tables

Generalized Youden Designs are generalizations of the class of two-way balanced block designs which include Latin squares and Youden squares. They are used for the same purposes and in the same way that these classical designs are used, and satisfy most of the common criteria of design optimality.We explicitly display or give detailed instructions for constructing all these designs within a practical range: when υ, the number of treatments, is ?25; and b₁ and b₂, the dimensions of the design array, are each ?50.     

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.     

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.     

PARTIALLY EQUINEIGHBOURED DESIGNS

This paper presents further results on a class of designs called equineighboured designs, ED. These designs are intended for field and related experiments, especially whenever there is evidence that observations in the same block are correlated. An ED has the property that every unordered pair of treatments occurs as nearest neighbours equally frequently at each level. Ipinyomi (1986) has defined and shown that ED are balanced designs when neighbouring observations are correlated. He has also presented ED as a continuation of the development of optimal block designs. An ED would often require many times the number of experimental materials needed for the construction of an ordinary balanced incomplete block, BIB, design for the same number of treatments and block sizes. Thus for a relatively large number of treatments and block sizes the required minimum number of blocks may be excessively large for practical use of ED. In this paper we shall define and examine partially equineighboured designs with n concurrences, PED (n), as alternatives where ED are practically unachievable. Particular attention will be given to designs with smaller numbers of blocks and for which only as little balance as possible may be lost.     

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.     

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.