REDUCED RESIDUE CLASSES CYCLIC PBIB DESIGNS

A new general class of m-class cyclic association scheme is defined for v treatments, where v is a composite number. A simple method of construction of PBIB designs having this association scheme using more than one initial block and some methods using only one initial block are proposed. A complete analysis of this type of PBIB designs is given. Also given is a list of 39 useful PBIB designs of this type having v≤15 and r≤10 and having only three associate classes together with their efficiency factors for all types of comparisons and over all efficiency factors.     

On the construction of m-associate pbib designs II

Some series of m-associate triangular PBIB designs have been constructed. A table of now three associate designs in the range b, v ≦ 100; r, k ≦ 10 with their average efficiencies has been given. These designs with (v, b, r, k) are new in the sense that the existence of two associate PBIB designs (e.f. Clatworthy (1973), John & Turner (1977), Dey (1978)) with these parameters are not known. The constructions presented herein also yield partially balanced weighing designs, nested PBIB designs and PBIB designs for m11111 response exoeriments.     

m-Associate PBIB designs using Youden-m squares

In this paper, we have proposed a type of arrangement that we call Youden-m square and is similar to the usual Youden square but generates PBIB designs instead of BIB designs when its columns are taken as blocks. We have also discussed its construction methodologies, introduced two new m-associate class association schemes, and also constructed some series of Youden-m square type PBIB designs.     

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.     

Some families of group divisible designs

Generalizing methods of constructions of Hadamard group divisible designs due to Bush (1979), some new families of semi-regular or regular group divisible designs are produced. Furthermore, new nonisomorphic solutions for some known group divisible designs are given, together with useful group divisible designs not listed in Clatworthy (1973).     

Some new group divisible designs

The paper lists fourteen new group divisible PBIB/2 designs, which were obtained using the computer program described in John (1976).     

Construction of incomplete Sudoku square and partially balanced incomplete block designs

Abstract

The present article deals with the study of association among the elements of a Sudoku square. In this direction, we have defined an association scheme and constructed incomplete Sudoku square designs which are capable of studying four explanatory variables and also happen to be the designs for two-way elimination of heterogeneity. Some series of Partially Balanced Incomplete Block (PBIB) designs have also been obtained.     

A class of new pbib designs

Two series of PBIB designs, one with three associate classes and theother with four associate classes ars developed. Efficiency factors for two designs are computed.     

Three methods of constructing pbib designs

Three construction methods of two- or three-associate partially balanced incomplete block (PBIB) designs are presented.     

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 RESOLVABLE INCOMPLETE BLOCK DESIGNS1

A method of constructing resolvable incomplete block designs for v(=ks, 2 ≤ k ≤ s - 1) treatments in blocks of size k using mutually orthogonal Latin squares is proposed. It has been seen in particular that when the number of replications is s — 1 (or s), which is feasible if s is a prime or a prime power, the method gives PBIB (3) (or semi-regular GD) designs. The analysis of such designs has also been discussed.     

Connectedness of PBIB designs

A necessary and sufficient condition for the connectedness of an m-associate-class PBIB design is derived in a form, and using an approach, different from those in Ogawa, Ikeda, and Kageyama (1984) and Saha and Kageyama (1984). The applicability of this condition is shown in the context of group-divisible m-associate-class PBIB designs.     

Patterned constructions of partially ballvced incomplete block design

Starting from the incidence matrix of a BIB design, we obtain PBIB designs with two or three associate classes following certain patterns for their block structures .     

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.     

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.     

A bidimensional class of optimality criteria involving φp and characteristic criteria

A new biparametric class of criteria for Optimal Experimental Design generalizing the families of φ_p and Characteristic Criteria is presented. Some properties of the Characteristic Criteria are provided: in particular, differentiability, monotonicity and convexity. A statistical interpretation is also offered. Optimal designs with respect to Characteristic Criteria are obtained for polynomial and compartmental models and an extension of the Michaelis-Menten model. A thorough discussion for the trigonometric model is given. The computed optimal designs are shown to be quite efficient for A-, D- and D_s -optimality. Thus, some of them appear as a natural compromise between different optimality criteria. A simulation in multiple linear regression confirms the quality of Characteristic designs for discovering significant differences between parameters.     

Some New Series of Partially Balanced Residual Treatment Effects Designs

Blaisdell and Raghavarao (1980 Blaisdell , E. A. , Raghavarao , D. ( 1980 ). Partially balanced change-over designs based on m-associate class PBIB designs . JRSS B 42 : 334 – 338 . [Google Scholar] 1985 Blaisdell , E. A. , Raghavarao , D. ( 1985 ). Efficiency bounds for partially balanced change-over designs based on m-associate class PBIB designs . JRSS B 47 : 132 – 135 . [Google Scholar]) introduced partially balanced residual treatment effects designs and gave methods of construction of these designs. They also gave efficiencies for the estimated direct and residual elementary treatment contrasts of these designs. In this paper, we construct some new series of partially balanced residual treatment effects designs and also give their efficiencies for the estimated direct and residual elementary treatment contrasts.     

On a class of partially balanced incomplete block designs

Bose and Clatworthy (1955) showed that the parameters of a two-class balanced incomplete block design with λ1=1,λ2=0 and satisfying r <k can be expressed in terms of just three parameters r,k,t. Later Bose (1963) showed that such a design is a partial geometry (r,k,t). Bose, Shrikhande and Singhi (1976) have defined partial geometric designs (r,k,t,c), which reduce to partial geometries when c=0. In this note we prove that any two class partially balanced (PBIB) design with r <k, is a partial geometric design for suitably chosen r,k,t,c and express the parameters of the PBIB design in terms of r,k,t,c and λ2. We also show that such PBIB designs belong to the class of special partially balanced designs (SPBIB) studied by Bridges and Shrikhande (1974).     

Constructions of group divisible designs and related combinatorial structures

Several methods of constructing group divisible (GD) designs are given by use of rectangular designs and nested balanced incomplete block designs. The GD designs obtained here are rather large, but as series they appear to be new. In the process, some series of rectangular designs, balanced arrays, and orthogonal arrays are also provided.     

Pseudo New Modified Latin Square (NML m (m)) Type PBIB Designs

A New Modified Latin square [NML _i (m)] association scheme with i constraints for v = m ² treatments was introduced by Garg (2008 Garg , D. K. ( 2008 ). New modified Latin square (NMLi) type PBIB designs . J. Math. Syst. Sci. 1 ( 4 ): 83 – 89 . [Google Scholar]). In this article, a new association scheme known as Pseudo New Modified Latin square [Pseudo NML _m (m)] type association scheme is defined. The parameters of Pseudo NML _m (m) association scheme turned out to be parameters of NML _i (m) association scheme by taking i = m in NML _i (m) association scheme. The Pseudo NML _m (m) association scheme will be the usual NML _m (m) association scheme when m is a prime or a prime power. The PBIB designs following Pseudo NML _m (m) association scheme will be called the Pseudo NML _m (m) type PBIB designs. Analysis of Pseudo NML _m (m) designs along with a construction method of these designs is also given in this article.