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

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

On the recovery of intra- and interblock information in n-ary designs

This note presents an extension of Q-method of analysis for binary designs given by Rao (1956) to n-ary balanced and partially balanced block designs. Here a linked n-ary block (LNB) design is defined as the dual of balanced n-ary (BN) design. Having a note on Yates’ (1939, 1940) method of P-analysis, we further extend the expressions for binary linked block (LB) designs given by Rao (1956) to linked n-ary block (LNB) designs which admit easy estimation of parameters for these type of all n-ary designs.     

Hypercubic designs and applications

In this paper we develop relatively easy methods for constructing hypercubic designs from symmetrical factorial experiments for t=v ^m treatments with v=2, 3. The proposed methods are easy to use and are flexible in terms of choice of possible block sizes.     

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.     

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.     

Construction of neighbor designs of block size 4 for all values of v ≥ 5 by using the method of addition

In this article, a general method of construction of neighbor block designs is given. The designs are constructed using variation of a simple method which we refer to as the method of addition (renamed as the method of cyclic shifts). We give complete solution of neighbor balanced designs for k = 4 for any value of v. We also give many series of generalized neighbor designs (GNDs). In the last section, we have constructed GNDs in a sequential manner (as Did John 1981) for v ≤ 50 and r is multiple of k.     

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.     

Balanced treatment incomplete block designs through integer programming

An algorithm is presented to construct balanced treatment incomplete block (BTIB) designs using a linear integer programming approach. Construction of BTIB designs using the proposed approach is illustrated with an example. A list of efficient BTIB designs for 2 ? v ? 12, v + 1 ? b ? 50, 2 ? k ? min(10, v), r ? 10, r₀ ? 20 is provided. The proposed algorithm is implemented as part of an R package.     

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.     

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.     

Optimal Circular Block Designs for Neighbouring Competition Effects

Competition or interference occurs when the responses to treatments in experimental units are affected by the treatments in neighbouring units. This may contribute to variability in experimental results and lead to substantial losses in efficiency. The study of a competing situation needs designs in which the competing units appear in a predetermined pattern. This paper deals with optimality aspects of circular block designs for studying the competition among treatments applied to neighbouring experimental units. The model considered is a four-way classified model consisting of direct effect of the treatment applied to a particular plot, the effect of those treatments applied to the immediate left and right neighbouring units and the block effect. Conditions have been obtained for the block design to be universally optimal for estimating direct and neighbour effects. Some classes of balanced and strongly balanced complete block designs have been identified to be universally optimal for the estimation of direct, left and right neighbour effects and a list of universally optimal designs for v<20 and r<100 has been prepared.     

Three-factor symmetrical balanced designs with full efficiency for main effects

Some methods for constructing balanced design for 3-factor symmetrical factorial experiments in which all the main effects are completely unconfounded by using balanced arrays and BIB designs are proposed. The method is flexible in terms of selecting block size.     

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.     

On the construction of balanced and orthogonal arrays

Two series of three symbol balanced arrays of strength two are constructed. Using special classes of BIB designs, two classes of two symbol orthogonal arrays of strength three are constructed.     

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.     

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.