Regular group divisible designs and Bhaskar Rao designs with block size three

Some recursive constructions are given for Bhaskar Rao designs. Using examples of these designs found by Shyam J. Singh, Rakesh Vyas and new ones given here we show the necessary conditions λ≡0 (mod 2), λυ(υ?1)≡0 (mod 24) are sufficient for the existence of Bhaskar Rao designs with one association class and block size 3. This result is used with a result of Street and Rodger to obtain regular partially balanced block designs with 2υ treatments, block size 3, λ₁=0, group size 2 and υ groups.     

Some bounds on balanced block designs

Bounds on the latest root of the C-matrix and the number of blocks for a variance-balanced block design are given. These results contain the well-known results as special cases.     

Orthogonal Latin hypercube designs from generalized orthogonal designs

Latin hypercube designs is a class of experimental designs that is important when computer simulations are needed to study a physical process. In this paper, we proposed some general criteria for evaluating Latin hypercube designs through their alias matrices. Moreover, a general method is proposed for constructing orthogonal Latin hypercube designs. In particular, links between orthogonal designs (ODs), generalized orthogonal designs (GODs) and orthogonal Latin hypercube designs are established. The generated Latin hypercube designs have some favorable properties such as uniformity, orthogonality of the first and some second order terms, and optimality under the defined criteria.     

Generalized Bhaskar Rao designs of block size three

We show that the necessary conditions

$\text{λ≡0 (}\text{mod}\text{|G|)}$

,

$\text{λ(υ?1)≡0 (}\text{mod}\text{2)}$

,

$\text{λυ(υ?1)≡}\text{0 (}\text{mod}\text{6)}\text{for}\text{|G|}\text{odd}\text{,}\text{0 (}\text{mod}\text{24)}\text{for}\text{|G|}\text{even}$

, are sufficient for the existence of a generalized Bhaskar Rao design GBRD(υ,b,r,3,λ;G) for the elementary abelian group G, of each order |G|.     

A construction for generalized hadamard matrices

We prove that if p^r and p^r ? 1 are both prime powers then there is a generalized Hadamard matrix of order p^r(p^r ? 1) with elements from the elementary abelian group Z_p x?x Z_p. This result was motivated by results of Rajkundia on BIBD's. This result is then used to produce p^r ? 1 mutually orthogonal F-squares F(p^r(p^r ? 1); p^r ? 1).     

Interaction balance for symmetrical factorial designs with generalized minimum aberration

There are two different systems of contrast parameterization when analyzing the interaction effects among the factors with more than two levels, i.e., linear-quadratic system and orthogonal components system. Based on the former system and an ANOVA model, Xu and Wu (2001) introduced the generalized wordlength pattern for general factorial designs. This paper shows that the generalized wordlength pattern exactly measures the balance pattern of interaction columns of a symmetrical design ground on the orthogonal components system, and thus an alternative angle to look at the generalized minimum aberration criterion is given. This work is partially supported by NNSF of China grant No. 10231030.     

D-optimal block designs with at most six varieties

For given positive integers v, b, and k (all of them ≥2) a block design is a k × b array of the variety labels 1,…,v with blocks as columns. For the usual one-way heterogeneity model in standard form the problem is studied of finding a D-optimal block design for estimating the variety contrasts, when no balanced block design (BBD) exists. The paper presents solutions to this problem for v≤6. The results on D-optimality are derived from a graph-theoretic context. Block designs can be considered as multigraphs, and a block design is D-optimal iff its multigraph has greatest complexity (=number of spanning trees).     

On the block structure of proper block designs

In this paper we consider proper block designs and derive an upper bound for the number of blocks which can have a fixed number of symbols common with a given block of the design. To arrive at the desired bound, a generalization of an integer programming theorem due to Bush (1976) is first obtained. The integer programming theorem is then used to derive the main result of this paper. The bound given here is then compared with a similar bound obtained by Kageyama and Tsuji (1977).     

Characterization of minimum aberration mixed factorials in terms of consulting designs

In this paper, by introducing a concept of consulting design and based on the connection between factorial design theory and coding theory, we obtain combinatorial identities that relate the wordlength pattern of a regular mixed factorial design to that of its consulting design. According to these identities, we further-more establish the general and unified rules for identifying minimum aberration mixed factorial designs through their consulting designs. It is an improvement and generalization of the results in Mukerjee and Wu (2001). This paper is supported by NNSF of China grant No. 10171051 and RFDP grant No. 1999005512.     

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.     

A construction of repeated measurements designs with balance for residual effects

Families of Repeated Measurements Designs balanced for residual effects are constructed (whenever the divisibility conditions allow), under the assumption that the number of periods is less than the number of treatments and that each treatment precedes each other treatment once. These designs are then shown to be connected for both residual and direct treatment effects.     

A characterization of a universally optimal design within a class of block designs

It is shown that within the class of connected binary designs with arbitrary block sizes and arbitrary replications only a symmetic balanced incomplete block design produces a completely symmetric information matrix for the treatment effects whenever the number of blocks is equal to the number of treatments and the number of experimental units is an integer multiple of the number of treatments. Such a design is known to be universally optimal.     

Construction of some classes of balanced cross-over designs from terraces

5 and 6 have recently introduced power-sequence terraces. In this paper we have used these terraces for the construction of some new families of balanced cross-over designs of first and second order which are variance-balanced. We have also used them for the construction of some new families of balanced ternary cross-over designs.     

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.     

A construction for generalized hadamard matrices GH(4q, EA(q))

We give a construction for a generalized Hadamard matrix GH(4q, EA(q)) as a 4 × 4 matrix of q × q blocks, for q an odd prime power other than 3 or 5. Each block is a GH(q, EA(q)) and certain combinations of 4 blocks form GH(2q, EA(q)) matrices. Hence a GH(4q, EA(q)) matrix exists for every prime power q.     

Optimum designs in complete two-way layouts

In the usual two-way layout of ANOVA (interactions are admitted) let nij ? 1 be the number of observations for the factor-level combination(i, j). For testing the hypothesis that all main effects of the first factor vanish numbers $\text{n}{}^1\text{ij}$ are given such that the power function of the F-test is uniformly maximized (U-optimality), if one considers only designs (nij) for which the row-sums ni are prescribed. Furthermore, in the (larger) set of all designs for which the total number of observations is given, all D-optimum designs are constructed.     

Projection estimation capacity of Hadamard designs

In a screening design, often only a few factors among a large number of potential factors are significantly important. Usually, it is not known which factors will be important ones. Thus, it is of practical interest to know if each projection of a design onto a small subset of factors is able to entertain and estimate all two-factor-interactions along with its main effects, assuming higher order interactions are negligible. In this paper, we investigate the estimation capacity of projections of Hadamard designs with run size up to 60. Possible applications of our results to robust parameter designs are also discussed.     

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.     

On some optimal fractional 2m factorial designs of resolution V

This paper presents the trace of the covariance matrix of the estimates of effects based on a fractional 2^m factorial (2^m-FF) design T of resolution V for the following two cases: One is the case where T is constructed by adding some restricted assemblies to an orthogonal array. The other is one where T is constructed by removing some restricted assemblies from an orthogonal array of index unity. In the class of 2^m-FF designs of resolution V considered here, optimal designs with respect to the trace criterion, i.e. A-optimal, are presented for m = 4, 5, and 6 and for a range of practical values of N (the total number of assemblies). Some of them are better than the corresponding A-optimal designs in the class of balanced fractional 2^m factorial designs of resolution V obtained by Srivastava and Chopra (1971b) in such a sense that the trace of the covariance matrix of the estimates is small.     

Search designs for 2m factorials derived from balanced arrays of strength 2(l+1) and ad-optimal search designs

We consider a search design for the 2^m type such that at most knonnegative effects can be searched among (l+1)-factor interactions and estimated along with the effects up to l- factor interactions, provided (l+1)-factor and higher order interactions are negligible except for the k effects. We investigate some properties of a search design which is yielded by a balanced 2^m design of resolution 2l+1 derived from a balanced array of strength 2(l+1). A necessary and sufficient condition for the balanced design of resolution 2l+1 to be a search design for k=1 is given. Optimal search designs for k=1 in the class of the balanced 2^m designs of resolution V (l=2), with respect to the AD-optimality criterion given by Srivastava (1977), with N assemblies are also presented, where the range of (m,N) is (m=6; 28≤N≤41), (m=7; 35≤N≤63) and (m=8; 44≤N≤74).