Constructions of efficiency-balanced designs

We present a number of methods of constructing efficiency-balanced binary block designs which are design patterns for simplification of statistical analysis. Furthermore, a method of construction of an efficiency-balanced block design with v+1 treatments from one with v treatments is generally characterized.     

A new special class of peb designs

A new class of partially efficiency-balanced designs is introduced from a practical point of view. This new design includes all equireplicated incomplete block designs available in literature as special cases. The fundamental properties of the design are clarified with relation to other block designs.     

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.     

A note on generalized binary proper efficiency-balanced block designs

Some methods of construction of generalized binary proper efficiency-balanced block (GB-EB) designs with two different replications are derived and the solution of the unknown designs given by Das and Kageyama (1991) are obtained.     

Remark on Construction of Efficiency-Balanced Designs

In this note, all the efficiency-balanced block designs constructed by utilizing two methods of Dey & Singh (1980) are completely presented within a practical range of parameters.     

The efficiency and optimality characterization of certain six-Treatment incomplete-Block designs emanating from some quasi-Semi-Latin squares

Incomplete-block designs were constructed from three types of three-factor block-structured combinatorial designs which are not necessarily semi-Latin squares but whose treatments are ab initio arranged as in the semi-Latin square. The basic consideration for the construction involves the exploitation of the different block structures of the experimental units of the Quasi-semi-Latin Squares (QSLS) for the same treatments. All the emanating designs are found to be connected, only the designs in nine blocks are both variance- and efficiency-balanced and offer gain in efficiency but lead to about 46 percent loss of information.     

Some adjusted orthogonal,variance balanced,multidimensional block designs

A multidimensional block design (MBD) is an experimental design with d > 1 blocking criteria geometrically represented as a d-dimensional lattice with treatment varieties assigned to some or all nodes of the lattice. Intrablock analysis of variance tables for some special classes of two- and three-dimensional block designs with some empty nodes are given. Design plans and efficiencies for 31 two-dimensional designs, each universally optimal in defined classes of designs, and 7 three-dimensional designs, each nearly optimal in defined classes of designs, are listed in the appendices. A need for such designs is apparent when the blocking criteria are implemented successively and empty nodes do not represent wasted experimental units.     

OPTIMUM SINGULAR SPRING BALANCE WEIGHING DESIGNS WITH NON-HOMOGENEITY OF THE VARIANCES OF ERRORS FOR ESTIMATING THE TOTAL WEIGHT

The problem of estimation of the total weight of objects using a singular spring balance weighing design with non-homogeneity of the variances of errors has been dealt with in this paper. Based on a theorem by Katulska (1984) giving a lower bound for the variance of the estimated total weight, a necessary and sufficient condition for this lower bound to be attained is obtained. It is shown that weighing designs for which the the lower bound is attainable, can be constructed from the incidence matrices of (α₁,.,α_t)-resolvable block designs, α-resolvable block designs, singular group divisible designs, and semi-regular group divisible designs.     

Balanced block designs

In the present paper an attempt has been made to characterize and unify the three different concepts of balancing in incomplete block designs, namely (i) variance balance, (ii) efficiency balance and (iii) pairwise balance. Simple characterizations of variance balance and efficiency balance have been given using the P matrix. A method of constructing efficiency balanced (EB) and variance balanced designs has also been presented.     

Proper generalized neighbor designs in circular blocks

Generalized neighbor designs relax the condition of constancy on the number of times two treatments occur as neighbors in a design. In this paper, we constructed generalized neighbor designs in circular blocks of equal size. Catalogs of these designs for block size 5, 7 and 9 are also compiled. All the designs given here are binary.     

On the optimalizes of the mbgdd's under mixed effects model

In the present paper, under the assumption of a mixed effects model with random block effects, the type 1 optimality of the most balanced group divisible designs of type 1 has been established within the general class of all proper and connected block designs with k<v.     

BALANCED ARRAYS AND WEIGHING DESIGNS

Dey (19711, Saha (1975), Kageyama & Saha (1983) and others have shown how optimum chemical balance weighing designs can be constructed from the incidence matrices of balanced incomplete block (BIB) designs. In this paper, it is shown that weighing designs can be constructed from some suitably chosen two-symbol balanced arrays of strength two, which need not always be incidence matrices of BIB designs. The findings lead us to construct new optimum chemical balance weighing designs from incidence matrices of BIB designs.     

Generalized neighbor designs with block size 3

A generalized neighbor design relaxes the equality condition on the number of times two treatments as neighbors in the design. In this article, we have considered the construction of some classes of generalized neighbor designs with block size k=3 by using the method of cyclic shifts. The distinguishing feature of this construction method is that the properties of a design can easily be obtained from the sets of shifts instead of constructing the actual blocks of the design. A catalog of generalized neighbor designs with block size k=3 is compiled for v∈{5,6,…,18} treatments and for different replications. We provide the reader with a simpler method of construction, and in general the catalog that gives an open choice to the experimenter for selecting any class of neighbor designs.     

A REVIEW OF BOUNDS FOR THE EFFICIENCY FACTOR OF BLOCK DESIGNS

This paper draws together bounds for the efficiency factor of block designs, starting with the papers of Conniffe & Stone (1974) and Williams & Patterson (1977). By extending the methods of Jarrett (1983), firstly to cover supercomplete block designs and then to cover resolvable designs, a set of bounds is obtained which provides the best current bounds for any block design with equal replication and equal block size, including resolvable designs and two-replicate resolvable designs as special cases. The bounds given for non-resolvable designs apply strictly only to designs which are either regular-graph (John & Mitchell, 1977) or whose duals are regular-graph. It is conjectured (John & Williams, 1982) that they are in fact global bounds. Similar qualifications apply to the bounds for resolvable designs.     

Optimal block designs comparing treatments with a control when the errors are correlated

The efficient design of experiments for comparing a control with v new treatments when the data are dependent is investigated. We concentrate on generalized least-squares estimation for a known covariance structure. We consider block sizes k equal to 3 or 4 and approximate designs. This method may lead to exact optimal designs for some v, b, k, but usually will only indicate the structure of an efficient design for any particular v, b, k, and yield an efficiency bound, usually unattainable. The bound and the structure can then be used to investigate efficient finite designs.     

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.     

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.     

On the Construction of Nearest–Neighbour Balanced Row–Column Designs

Nearest–neighbour balance is considered a desirable property for an experiment to possess in situations where experimental units are influenced by their neighbours. This paper introduces a measure of the degree of nearest–neighbour balance of a design. The measure is used in an algorithm which generates nearest–neighbour balanced designs and is readily modified to obtain designs with various types of nearest–neighbour balance. Nearest–neighbour balanced designs are produced for a wide class of parameter settings, and in particular for those settings for which such designs cannot be found by existing direct combinatorial methods. In addition, designs with unequal row and column sizes, and designs with border plots are constructed using the approach presented here.     

On the existence of linear trend free block designs

We present a class of counerexamples for a conjecture on the existence or linear trend free block designs we will also prove a considerably weakened version of this conjecture which will determine all combinations of designs parmetres for which the class of linear trend free block designs is non empty.     

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.