Low-order spatially-distinct latin squares

The order three to five spatially-distinct Latin squares, and the order three to six spatially-distinct Latin square treatment designs are listed. Some statistical results are given. Designs for 4, 5 and 6 treatments that were found previously to be robust to a linear by linear interacrion are shown to be optimal. Designs with good neighbour balanced are also considered.     

On balanced incomplete Latin square designs

Recently, balanced incomplete Latin square designs are introduced in the literature. We propose three methods of constructions of balanced incomplete Latin square designs. Particular classes of Latin squares namely Knut Vik designs, semi Knut Vik designs, and crisscross Latin squares play a key role in the construction.     

EQUINEIGHBOURED XPERIMENTAL DESIGNS

This paper introduces a new class of designs called equi-neighboured designs. An equineighboured design has the property that every unordered pair of treatments occurs as nearest neighbours equally frequently at every level. These designs are defined in Section 4 and shown to be balanced when neighbouring observations are correlated. Some equineighboured designs are constructed using a complete set of orthogonal Latin squares. Cyclic equineighboured designs are also defined.     

Crossover designs in the presence of carry-over effects from two factors

Experiments, used in the telecommunications industry and elsewhere, are considered that involve the simultaneous application of levels of two unrelated factors, treatments and stimuli, to each of several subjects in a succession of time periods. The existence is suspected of carry-over effects of treatments and stimuli, in the period immediately following the period of their application. Methods are given for the construction of separate sequences of treatments and of stimuli; these methods are based on the Latin squares of Williams and of Russell. In the resulting designs, the treatments and stimuli are either orthogonal or nearly orthogonal, and the coincidence of the direct and carry-over effects of each factor is either balanced or nearly balanced. The efficiencies of the designs are assessed by comparing the average variances of elementary contrasts in the levels of each factor with appropriate lower bounds.     

Systematic latin squares

In order to properly utilize restricted randomization in the selection of t × t Latin squares it is necessary to have some idea of the various types of systematic Latin squares that should be removed from the admissible sets. The best known systematic squares are the diagonal squares and the Knut Vik squares. When t is not a prime number there are various other types of diagonal and balanced Latin squares. Eleven types of 4 × 4 Latin squares, each of them being systematic, are identified, displayed, and their properties indicated. Eight types of systematic 6 × 6 Latin squares are also identified and displayed. The effect of removing systematic squares from the admissible sets of Latin squares is discussed. Recommendations are made on when a restricted randomization procedure is to be preferred to a full randomization procedure in the selection of a random t × t Latin square.     

Nested Latin Hypercube Designs with Sliced Structures

In computer experiments, space-filling designs with a sliced structure or nested structure have received much recent interest and been studied separately. However, it is likely that designs with both structures are needed in some situations, but there are no suitable designs so far. In this paper, we construct a special class of nested Latin hypercube designs with sliced structures, in such a design, a small sliced Latin hypercube design is nested within a large one. The construction method is easy to implement and the number of factors is flexible. Numerical simulations show the usefulness of the newly proposed designs.     

Minimum variance rectangular designs for U-statistics

We consider a certain class of rectangular designs for incomplete U-statistics based on Latin squares and show it to be optimal with respect to the minimal variance criterion. We also show it to be asymptotically efficient when compared with the corresponding complete statistics, as well as uniformly more efficient than the random subset selection. We provide the necessary and sufficient conditions for the existence of our design and give some examples of applications.     

Nearly optimal orthogonally blocked desings for a quadratic mixture model with q components

In experiments with mixtures involving process variables, orthogonal block designs may be used to allow estimation of the parameters of the mixture components independently of estimation of the parameters of the process variables. In the class of orthogonally blocked designs based on pairs of suitably chosen Latin squares, the optimal designs consist primarily of binary blends of the mixture components, regardless of how many ingredients are available for the mixture. This paper considers ways of modifying these optimal designs so that some or all of the runs used in the experiment include a minimum proportion of each mixture ingredient. The designs considered are nearly optimal in the sense that the experimental points are chosen to follow ridges of maxima in the optimality criteria. Specific designs are discussed for mixtures involving three and four components and distinctions are identified for different designs with the same optimality properties. The ideas presented for these specific designs are readily extended to mixtures with q>4 components.     

Designs for two-colour microarray experiments

Summary.  Designs for two-colour microarray experiments can be viewed as block designs with two treatments per block. Explicit formulae for the A- and D-criteria are given for the case that the number of blocks is equal to the number of treatments. These show that the A- and D-optimality criteria conflict badly if there are 10 or more treatments. A similar analysis shows that designs with one or two extra blocks perform very much better, but again there is a conflict between the two optimality criteria for moderately large numbers of treatments. It is shown that this problem can be avoided by slightly increasing the number of blocks. The two colours that are used in each block effectively turn the block design into a row–column design. There is no need to use a design in which every treatment has each colour equally often: rather, an efficient row–column design should be used. For odd replication, it is recommended that the row–column design should be based on a bipartite graph, and it is proved that the optimal such design corresponds to an optimal block design for half the number of treatments. Efficient row–column designs are given for replications 3–6. It is shown how to adapt them for experiments in which some treatments have replication only 2.     

Pairwise orthogonal F-rectangle designs

The concept of pairwise orthogonal Latin square design is applied to r row by c column experiment designs which are called pairwise orthogonal F-rectangle designs. These designs are useful in designing successive and/or simulataneous experiments on the same set of rc experimental units, in constructing codes, and in constructing orthogonal arrays. A pair of orthogonal F-rectangle designs exists for any set of v treatment (symbols), whereas no pair of orthogonal Latin square designs of order two and six exists; one of the two construction methods presented does not rely on any previous knowledge about the existence of a pair of orthogonal Latin square designs, whereas the second one does. It is shown how to extend the methods to r=pv row by c=qv column designs and how to obtain t pairwise orthogonal F-rectangle design. When the maximum possible number of pairwise orthogonal F-rectangle designs is attained the set is said to be complete. Complete sets are obtained for all v for which v is a prime power. The construction method makes use of the existence of a complete set of pairwise orthogonal Latin square designs and of an orthogonal array with vⁿ columns, (vⁿ−1)/(v−1) rows, v symbols, and of strength two.     

Generalized Youden designs: construction and tables

Generalized Youden Designs are generalizations of the class of two-way balanced block designs which include Latin squares and Youden squares. They are used for the same purposes and in the same way that these classical designs are used, and satisfy most of the common criteria of design optimality.We explicitly display or give detailed instructions for constructing all these designs within a practical range: when υ, the number of treatments, is ?25; and b₁ and b₂, the dimensions of the design array, are each ?50.     

Randomization of neighbour balanced generalized Youden designs

If a crossover design with more than two treatments is carryover balanced, then the usual randomization of experimental units and periods would destroy the neighbour structure of the design. As an alternative, Bailey [1985. Restricted randomization for neighbour-balanced designs. Statist. Decisions Suppl. 2, 237–248] considered randomization of experimental units and of treatment labels, which leaves the neighbour structure intact. She has shown that, if there are no carryover effects, this randomization validates the row–column model, provided the starting design is a generalized Latin square. We extend this result to generalized Youden designs where either the number of experimental units is a multiple of the number of treatments or the number of periods is equal to the number of treatments. For the situation when there are carryover effects we show for so-called totally balanced designs that the variance of the estimates of treatment differences does not change in the presence of carryover effects, while the estimated variance of this estimate becomes conservative.     

An easy method of constructing latin square designs balanced for the immediate residual and other order effects

Bradley (1958) proposed a very simple procedure for constructing latin square designs to counterbalance the immediate sequential effect for an even number of treatments. When the number of treatments is odd, balance in a single latin square is not possible. In the present note we have developed an analogous method for the construction of such designs which may be used for an even or odd number of treatments. A proof has also been offered to assure the general validity of the procedure.     

Missing values in replicated Latin squares

Designs based on any number of replicated Latin squares are examined for their robustness against the loss of up to three observations randomly scattered throughout the design. The information matrix for the treatment effects is used to evaluate the average variances of the treatment differences for each design in terms of the number of missing values and the size of the design. The resulting average variances are used to assess the overall robustness of the designs. In general, there are 16 different situations for the case of three missing values when there are at least three Latin square replicates in the design. Algebraic expressions may be determined for all possible configurations, but here the best and worst cases are given in detail. Numerical illustrations are provided for the average variances, relative efficiencies, minimum and maximum variances and the frequency counts, showing the effects of the missing values for a range of design sizes and levels of replication.     

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.     

Block-circulant matrices for constructing optimal Latin hypercube designs

Computer simulations are usually needed to study a complex physical process. In this paper, we propose new procedures for constructing orthogonal or low-correlation block-circulant Latin hypercube designs. The basic concept of these methods is to use vectors with a constant periodic autocorrelation function to obtain suitable block-circulant Latin hypercube designs. A general procedure for constructing orthogonal Latin hypercube designs with favorable properties and allowing run sizes being different from a power of 2 (or a power of 2 plus 1), is presented here for the first time. In addition, an expansion of the method is given for constructing Latin hypercube designs with low correlation. This expansion is useful when orthogonal Latin hypercube designs do not exist. The properties of the generated designs are further investigated. Some examples of the new designs, as generated by the proposed procedures, are tabulated. In addition, a brief comparison with the designs that appear in the literature is given.     

Inference Based on General Linear Models for Order Restricted Randomization

This article develops statistical inference for the general linear models in order restricted randomized (ORR) designs. The ORR designs use the heterogeneity among experimental units to induce a negative correlation structure among responses obtained from different treatment regimes. This negative correlation structure acts as a variance reduction technique for treatment contrast. The parameters of the general linear models are estimated and a generalized F-test is constructed for its components. It is shown that the null distribution of the test statistic can be approximated reasonably well with an F-distribution for moderate sample sizes. It is also shown that the empirical power of the proposed test is substantially higher than the powers of its competitors in the literature. The proposed test and estimator are applied to a data set from a clinical trial to illustrate how one can improve such an experiment.     

Optimal partially balanced nested row-column designs

A partially balanced nested row-column design, referred to as PBNRC, is defined as an arrangement of v treatments in b p × q blocks for which, with the convention that p q, the information matrix for the estimation of treatment parameters is equal to that of the column component design which is itself a partially balanced incomplete block design. In this paper, previously known optimal incomplete block designs, and row-column and nested row-column designs are utilized to develop some methods of constructing optimal PBNRC designs. In particular, it is shown that an optimal group divisible PBNRC design for v = mn kn treatments in p × q blocks can be constructed whenever a balanced incomplete block design for m treatments in blocks of size k each and a group divisible PBNRC design for kn treatments in p × q blocks exist. A simple sufficient condition is given under which a group divisible PBNRC is Ψ_f-better for all f> 0 than the corresponding balanced nested row-column designs having binary blocks. It is also shown that the construction techniques developed particularly for group divisible designs can be generalized to obtain PBNRC designs based on rectangular association schemes.     

ON RESOLVABLE INCOMPLETE BLOCK DESIGNS1

A method of constructing resolvable incomplete block designs for v(=ks, 2 ≤ k ≤ s - 1) treatments in blocks of size k using mutually orthogonal Latin squares is proposed. It has been seen in particular that when the number of replications is s — 1 (or s), which is feasible if s is a prime or a prime power, the method gives PBIB (3) (or semi-regular GD) designs. The analysis of such designs has also been discussed.     

Orthogonal Latin hypercube designs for Fourier-polynomial models

Latin hypercube designs (LHDs) are widely used in computer experiments because of their one-dimensional uniformity and other properties. Recently, a number of methods have been proposed to construct LHDs with properties that all linear effects are mutually orthogonal and orthogonal to all second-order effects, i.e., quadratic effects and bilinear interactions. This paper focuses on the construction of LHDs with the above desirable properties under the Fourier-polynomial model. A convenient and flexible algorithm for constructing such orthogonal LHDs is provided. Most of the resulting designs have different run sizes from that of Butler (2001), and thus are new and very suitable for factor screening and building Fourier-polynomial models in computer experiments as discussed in Butler (2001).