Balanced and partially balanced incomplete block designs with autocorrelation errors

The paper aims to find variance balanced and variance partially balanced incomplete block designs when observations within blocks are autocorrelated and we call them BIBAC and PBIBAC designs. Orthogonal arrays of type I and type II when used as BIBAC designs have smaller average variance of elementary contrasts of treatment effects compared to the corresponding Balanced Incomplete Block (BIB) designs with homoscedastic, uncorrelated errors. The relative efficiency of BIB designs compared to BIBAC designs depends on the block size k and the autocorrelation ρ and is independent of the number of treatments. Further this relative efficiency increases with increasing k. Partially balanced incomplete block designs with autocorrelated errors are introduced using partially balanced incomplete block designs and orthogonal arrays of type I and type II.     

A formula for a missing plot in a general incomplete block design,when recovery of interblock information is used

In this paper, Yate's missing plot technique is used to derive the formula for substitution in a missing plot in a general incomplete block design, where blocks are assumed to be independent normal. The use of penalized normal equations, using BLUPS, makes this task simpler.     

Experimental designs and their efficiencies for spatially correlated observations in two dimensions

Optimality of experimental designs for spatially correlated observations is investigated.come two dimensional correlation structures are discussed and an attempt has been made to find optimal or nearly optimal design for each sitution.The solution lend to designs similar to that used for repeated measurements.The relative efficiency of the proposed designs in comparison to randomized latin square designs is tabulated for some cases.     

Construction of New Three-Level Response Surface Designs

Response surface methodology is widely used for developing, improving, and optimizing processes in various fields. In this article, we present a method for constructing three-level designs in order to explore and optimize response surfaces combining orthogonal arrays and covering arrays in a particular manner. The produced designs achieve the properties of rotatability, predictive performance and efficiency for the estimation of a second-order model.     

Taguchi methods: linear graphs of high resolution

An important reason behind the success of the Taguchi methodology in qual- ity assurance has been the use of statistical methods, presented in a way that is accessible to the nonexpert user. Among the tools used to simplify the sta- tistical design of experiments has been the linear graph, apparently introduced by Taguchi. However, he did not consider the resolution of the corresponding designs (the higher the resolution, the more accurate the conclusions). For example, it will be shown that half of the linear graphs given by Taguchi for the L₁₆(2¹⁵) orthogonal array correspond to designs of resolution III, when designs of resolution IV are available (with the same lines in the linear graphs but with different assignments to the columns of the orthogonal array). A nontraditional but very straightforward method is presented for obtaining the alias chains and the linear graphs corresponding to an orthogonal array. The procedure can be easily understood and employed by nonstatisticians to find an experimental design of the highest possible resolution. The design can be used to obtain products or processes that are robust to variation.     

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.     

Decompositions of λ K v

In a series of 2 papers, Kang, Du and Tian solved the existence problem for G-decomposition of λ K _n when G is any simple graph with 6 vertices and 7 edges, except when G is the graph T=K ₄∪K ₂. Notice that a T-decomposition can be considered to be a Pairwise Balanced Design in which each block of size 4 has been matched to a block of size 2. In this paper we remove this exception for all λ≥2. The case when λ=1 is also addressed. This paper is written in honor of Frank Hwang on the occasion of his 65th birthday.     

A generating algorithm for linear trend-free and nearly linear trend-free block designs

The theory and properties of trend-free (TF) and nearly trend-free (NTF) block designs are wel1 developed. Applications have been hampered because a methodology for design construction has not been available.

This article begins with a short review of concepts and properties of TF and NTF block designs. The major contribution is provision of an algorithm for the construction of linear and nearly linear TF block designs. The algorithm is incorporated in a computer program in FORTRAN 77 provided in an appendix for the IBM PC or compatible microcomputer, a program adaptable also to other computers. Three sets of block designs generated by the program are given as examples.

A numerical example of analysis of a linear trend-free balanced incomplete block design is provided.     

Admissible minimum bias estimation of response surfaces

The minimum bias estimator was introduced as an alternative to the least squares estimator for approximating response functions by low-order polynomials. Here we show how to obtain an admissible estimator with smaller squared bias.     

A method for obtaining randomized block designs in preclinical studies with multiple quantitative blocking variables

A method is proposed for block randomization of treatments to experimental units that can accommodate both multiple quantitative blocking variables and unbalanced designs. Hierarchical clustering in conjunction with leaf‐order optimization is used to block experimental units in multivariate space. The method is illustrated in the context of a diabetic mouse assay. A simulation study is presented to explore the utility of the proposed randomization method relative to that of a completely randomized approach, both in the presence and absence of covariate adjustment. An example R function is provided to illustrate the implementation of the method. Copyright © 2010 John Wiley & Sons, Ltd.