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.     

Step-wise group screening with equal prior probabilities and no errors in observations

This paper introduces a screening procedure called step-wise group screening for isolating defective factors from a population consisting of defective (or important) and non-defective     

Optimal repeated measurements designs for comparing test treatments with a control

A-optimal and mv optimal repeated measurments designs for comparing serveral test treatments with a control are considered. the models considered are basically of two types: without preperides and the cirular model. It is shown known that some known strongly balanced uniform repeated measurements designs can be modified to obtain optimal designs for this problem. Some other methods of finding optimal designs are also given.     

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.     

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

Optimal design of complex experiments with qualitative factors of influence

A complex experiment with qualirarive factors influencing the outcome of the experiment can be seen as a general ANOVA setup. A design of such an experiment will be the assignment at which of the possible levels of the factors the actual experiment should be performed. In this paper optimal designs of such experiments will be characterized with respect to three different optimality criteria including the so called uniform optimality of a design. The possible applications of the main optimization result providing these characterizations can be used to more general experiments. The particular results on these generalizations will be indicated at the end of this paper.     

Serial unblocked designs balanced for correlation between neighbours,II

The theory in Part I contained an error that was inferred from the output of a program, written in SAS by Eric P. Smith and David D. Morris. The program produces random BUS designs in accordance with the algorithm of Part I. The theory is here corrected by using a combinatorial argument that involves elementary number theory. The algorithm needs no change but its interpretation is now adjusted.     

Three-stage designs for monitoring clinical trials

Optimal three-stage designs with equal sample sizes at each stage are presented and compared to fixed sample designs, fully sequential designs, designs restricted to use the fixed sample critical value at the final stage, and to modifications of other group sequential designs previously proposed in the literature. Typically, the greatest savings realized with interim analyses are obtained by the first interim look. More than 50% of the savings possible with a fully sequential design can be realized with a simple two-stage design. Three-stage designs can realize as much as 75% of the possible savings. Without much loss in efficiency, the designs can be modified so that the critical value at the final stage equals the usual fixed sample value while maintaining the overall level of significance, alleviating some potential confusion should a final stage be necessary. Some common group sequential designs, modified to allow early acceptance of the null hypothesis, are shown to be nearly optimal in some settings while performing poorly in others. An example is given to illustrate the use of several three-stage plans in the design of clinical trials.     

Construction of minimum aberration blocked two-level regular factorial designs

ABSTRACT

In this article, we consider the construction of minimum aberration 2^{n ? k}: 2^p designs with respect to some existing combined wordlength patterns, where a 2^{n ? k}: 2^p design is a blocked two-level design with n treatment factors, 2^p blocks, and N = 2^q runs with q = n ? k. Two methods are proposed for two situations: n ? 2^{q ? p} ? 1 and n > N/2. These methods enable us to obtain some new minimum aberration 2^{n ? k}: 2^p designs from existing minimum aberration unblocked and blocked designs. Examples are included to illustrate the theory.