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.     

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.     

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

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.     

Embedding of orthogonal arrays of strength two and deficiency greater than two

Let x ≥ 0 and n ≥ 2 be integers. Suppose there exists an orthogonal array $\text{A(n, q, μ}{}^1\text{)}$ of strength 2 in n symbols with q rows and $\text{n}{}^2\text{μ}{}^1$ columns where $\text{q = q}{}^1\text{? d, q}{}^1\text{= n}{}^2\text{x + n + 1}$, $\text{μ}{}^1\text{= (n ?}\text{1}\text{)x +}\text{1}$ and d is a positive integer. Then d is called the deficiency of the orthogonal array. The question of embedding such an array into a complete array $\text{A(n, q}{}^1\text{, μ}{}^1\text{)}$ is considered for the case d ≥ 3. It is shown that for d = 3 such an embedding is always possible if n ≥ 2(d ? 1)²(2d² ? 2d + 1). Partial results are indicated if d ≥ 4 for the embedding of a related design in a corresponding balanced incomplete block design.     

Some important classes of generalized neighbor designs for linear blocks

In this paper, some infinite series of generalized neighbor designs are constructed for the linear blocks which are useful to balance out the neighbor effects for the cases where (a) one of the v treatments has some neighbor effects with other treatments, while remaining (v – 1) treatments have half of that neighbor effect among selves, (b) some of the v treatments have some neighbor effect with other treatments, while remaining treatments have half of that neighbor effect among themselves, (c) one of the v treatments has some neighbor effect with other treatments, while remaining (v – 1) treatments have double of that effect among themselves, and (d) some of the v treatments have some neighbor effect with other, while remaining treatments have double of it among themselves.     

Super-simple group divisible designs with block size 4 and index 9

A design is said to be super-simple if the intersection of any two blocks has at most two elements. In statistical planning of experiments, super-simple designs are the ones providing samples with maximum intersection as small as possible. Super-simple GDDs are useful in constructing super-simple BIBDs. The existence of super-simple (4,λ)‐GDDs has been determined for λ=2-6. In this paper, we investigate the existence of a super-simple (4,9)-GDD of group type g^u and show that such a design exists if and only if u≥4, g(u−2)≥18 and u(u−1)g²≡0 (mod 4).     

Approximate and exact distributions of rank tests for balanced incomplete block designs

Judges rank k out of t objects according to m replic ations of abasic balanced incomplete block design with bblocks. In Alvo and Cabilio(1991),it is shown that the Durbin test, which is the usual test in this situation, can be written in terms of Spearman correlations between the blocks, and using a Kendall correlation, they generated a new statistic for this situation.This Kendall tau based statistic has a richer support than the Durbin statistic, and is at least as efficient.In the present paper,exact and simulation based tables are generated for both statistics, and various approximations to these null distributions are considered and compared.     

Some new construction of circular weakly balanced repeated measurements designs in periods of two different sizes

Abstract

Balanced repeated measurements designs (RMDs) balance out the residual effects. Williams Latin square designs work as minimal combinatorial balanced as well as variance balanced for RMDs for p (period sizes) = v (number of treatments). If minimal balanced RMDs cannot be constructed for the situations where p must be less than v then weakly balanced RMDs should be preferred. In this article, some generators are developed to generate circular weakly balanced RMDs in periods of two different sizes. To obtain the proposed designs, some construction procedures are also described for some of the cases where we could not develop generators.     

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.     

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.     

Resolvable systems of 8-tuples

Let R be a family of k-element blocks of a v-element set V such that any two elements of V are contained in λ blocks of R and R=R₁∪…∪R_v?1, R_i∩ R_j=? (i≠j) and ?{B_i∈R_j∣i=1,…,v?k}=V (B_i a block in R_j), i.e. R is a resolvable block design RB(v, k, λ). In this paper it will be shown that a sufficient condition for the existence of an RB(v, 8, 7) is that v≡0 (mod 8) and v is nondivisible by 3, 5, 7.     

The connectedness and optimality of a class of row-column designs

Balanced Incomplete Block Designs have been employed as row-column designs by a number of researchers. In this paper necessary and sufficient conditions for the connectedness of such designs are obtained, and methods for their optimisation are presented. The optimal design is shown to be always connected.     

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.     

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.     

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.     

Circular First- and Second-Order Balanced Repeated Measurements Designs

Sharma (1977 Sharma , V. K. ( 1977 ). Change-over designs with complete balance for first and second order residual effect . Canad. J. Statist. 5 : 121 – 132 .[Crossref] , [Google Scholar]) and Aggarwal et al. (2006 Aggarwal , M. L. , Deng , L.-Y. , Jha , M. K. ( 2006 ). Balanced residual treatment effects designs of first and second order . Statist. Probab. Lett. 76 : 597 – 600 .[Crossref], [Web of Science ®] , [Google Scholar]) considered non circular construction of first- and second-order balanced repeated measurements designs. Sharma et al. (2002 Sharma , V. K. , Varghese , C. , Jaggi , S. ( 2002 ). On optimality of change-over designs balanced for first and second order residual effects . Metron 60 : 153 – 162 . [Google Scholar]) constructed circular first- and second-order balanced repeated measurements designs only for a class with parameters (v, p = 3n, n = v ²) and also showed its universal optimality. In this article, we consider circular construction of first- and second-order balanced repeated measurements designs and strongly balanced repeated measurements designs by using the method of cyclic shifts. Some new circular designs with parameters (v, p, n) for cases p = v, p < v and p > v are given.     

Optimal block designs for double cross experiments

ABSTRACT

This paper presents systematic methods of construction of optimal block designs for a double cross experiments for both even and odd values of “p” parental lines. The both even and odd values of designs are derived by using initial block of unreduced balanced incomplete block designs and initial block of row–column designs given by Bose et al. (1953 Bose, R.C., Shrikhande, S.S., Bhattacharya, K.N. (1953). On the construction of group divisible incomplete block design. Ann. Math. Stat. 24:167–195.[Crossref] , [Google Scholar]) and Gupta and Choi (1998 Gupta, S., Choi, K.C. (1998). Optimal row-column designs for complete diallel crosses. Commun. Stat. Theory Methods 27(11):2827–2835.[Taylor & Francis Online], [Web of Science ®] , [Google Scholar]), respectively. In this attempt we have found some new universally optimal block designs for double cross experiments.