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 note on the robustness of PBIBD(2)s against breakdown in the event of observation loss

Robustness against design breakdown following observation loss is investigated for Partially Balanced Incomplete Block Designs with two associate classes (PBIBD(2)s). New results are obtained which add to the body of knowledge on PBIBD(2)s. In particular, using an approach based on the E‐value of a design, all PBIBD(2)s with triangular and Latin square association schemes are established as having optimal block breakdown number. Furthermore, for group divisible designs not covered by existing results in the literature, a sufficient condition for optimal block breakdown number establishes that all members of some design sub‐classes have this property.     

Comparisons of search designs using search probabilities

Search designs are considered for searching and estimating one nonzero interaction from the two and three factor interactions under the search linear model. We compare three 12-run search designs D1, D2, and D3, and three 11-run search designs D4, D5, and D6, for a 2⁴ factorial experiment. Designs D2 and D3 are orthogonal arrays of strength 2, D1 and D4 are balanced arrays of full strength, D5 is a balanced array of strength 2, and D6 is obtained from D3 by deleting the duplicate run. Designs D4 and D5 are also obtained by deleting a run from D1 and D2, respectively. Balanced arrays and orthogonal arrays are commonly used factorial designs in scientific experiments. “Search probabilities” are calculated for the comparison of search designs. Three criteria based on search probabilities are presented to determine the design which is most likely to identify the nonzero interaction. The calculation of these search probabilities depends on an unknown parameter ρ which has a signal-to-noise ratio form. For a given value of ρ, Criteria I and II are newly proposed in this paper and Criteria III is given in Shirakura et al. (Ann. Statist. 24 (6) (1996) 2560). We generalize Criteria I–III for all values of ρ so that the comparison of search designs can be made without requiring a specific value of ρ. We have developed simplified methods for comparing designs under these three criteria for all values of ρ. We demonstrate, under all three criteria, that the balanced array D1 is more likely to identify the nonzero interaction than the orthogonal arrays D2 and D3, and the design D4 is more likely to identify the nonzero interaction than the designs D5 and D6.The methods of comparing designs developed in this paper are applicable to other factorial experiments for searching one nonzero interaction of any order.     

Computer experiment designs for accurate prediction

Computer experiments using deterministic simulators are sometimes used to replace or supplement physical system experiments. This paper compares designs for an initial computer simulator experiment based on empirical prediction accuracy; it recommends designs for producing accurate predictions. The basis for the majority of the designs compared is the integrated mean squared prediction error (IMSPE) that is computed assuming a Gaussian process model with a Gaussian correlation function. Designs that minimize the IMSPE with respect to a fixed set of correlation parameters as well as designs that minimize a weighted IMSPE over the correlation parameters are studied. These IMSPE-based designs are compared with three widely-used space-filling designs. The designs are used to predict test surfaces representing a range of stationary and non-stationary functions. For the test conditions examined in this paper, the designs constructed under IMSPE-based criteria are shown to outperform space-filling Latin hypercube designs and maximum projection designs when predicting smooth functions of stationary appearance, while space-filling and maximum projection designs are superior for test functions that exhibit strong non-stationarity.     

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.     

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.     

Some Restricted randomization rules in sequential designs

This paper presents a new class of designs (Big Stick Designs) for sequentially assigning experimental units to treatments, when only the time covariate is considered. By prescribing the degree of imbalance which the experimenters can tolerate, complete randomization is used as long as the imbalance of the treatment allocation does not exceed the prescribed value. Once it reaches the value, a deterministic assignment is made to lower the imbalance. Such designs can be easily implemented with no programming and little personnel support. They compare favorably with the Biased Coin Designs, the Permuted Black Designs, and the Urn Designs, as far as the accidental bias and selection bias are concerned. Generalizations of these designs are considered to achieve various purposes, e.g., avoidance of deterministic assignments, early balance, etc.     

Balanced incomplete Latin square designs

Latin squares have been widely used to design an experiment where the blocking factors and treatment factors have the same number of levels. For some experiments, the size of blocks may be less than the number of treatments. Since not all the treatments can be compared within each block, a new class of designs called balanced incomplete Latin squares (BILS) is proposed. A general method for constructing BILS is proposed by an intelligent selection of certain cells from a complete Latin square via orthogonal Latin squares. The optimality of the proposed BILS designs is investigated. It is shown that the proposed transversal BILS designs are asymptotically optimal for all the row, column and treatment effects. The relative efficiencies of a delete-one-transversal BILS design with respect to the optimal designs for both cases are also derived; it is shown to be close to 100%, as the order becomes large.     

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.     

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.     

Incomplete block designs through orthogonal and incomplete orthogonal arrays

The concept of an Incomplete Orthogonal Array (IOA) is extended to that of a Group Incomplete Orthogonal Array, abbreviated as GIOA. A few results are proved regarding the existence of some GIOA's. It is shown how Orthogonal Arrays and GIOA's can be exploited to construct new series of Balanced Incomplete Block (BIB) Designs and Partially Balanced Incomplete Block (PBIB) Designs with two or more associate classes.     

Some new third order designs robust to one missing observation

Abstract

In real experimentation, we often face situations where observations are lost, ignored or unavailable due to some accident or high cost experiments. Missing observations can make the results of a response surface experiment quite misleading. Therefore minimaxloss designs for Augmented Box-Behnken Designs (ABBDs) and Augmented Fractional Box-Behnken Designs (AFBBDs) are formulated under a minimaxloss criterion. These minimaxloss designs are considered to be robust to one missing observation and the investigation has been made in this article. Then G-efficiencies and Relative D-efficiencies of minimaxloss ABBDs and AFBBDs have been discussed.     

Factorial experimentation in second-order Latin cubes

A Second-order Latin cube of size n x n x n can be used as the design for an experiment in three space dimensions, with the three sets of layers used as three sets of blocks. The n2 treatments are then orthogonal to the main effects X, Y and Z of the blocking systems. Particular interest attaches to second-order Latin cubes whose treatments are an n x n factorial set, with the main effects A and B of the treatment factors orthogonal to the interactions XY, XZ and YZbetween pairs of blocking systems. This note describes such designs where components of the interaction AB are each totally confounded with one of XY, XZ and YZ. Cubes with n = 4 are then described where components of A, B and AB are each partially confounded. Finally, a defective design with n = 4 is described, to illustrate the need for care in composing designs for three dimensions.     

Construction of repeated measurements designs strongly balanced for residual effects

Abstract

Repeated Measurements Designs have been widely used in agriculture, animal husbandry, education, biology, botany and engineering. Balanced or strongly balanced repeated measurements designs are useful to balance out the residual effects. In this article, some new generators and construction procedures are proposed to obtain circular strongly balanced repeated measurements designs in periods of (a) equal sizes, (b) two different sizes, and (c) three different sizes.     

Computer experiments with functional inputs and scalar outputs by a norm-based approach

A framework for designing and analyzing computer experiments is presented, which is constructed for dealing with functional and scalar inputs and scalar outputs. For designing experiments with both functional and scalar inputs, a two-stage approach is suggested. The first stage consists of constructing a candidate set for each functional input. During the second stage, an optimal combination of the found candidate sets and a Latin hypercube for the scalar inputs is sought. The resulting designs can be considered to be generalizations of Latin hypercubes. Gaussian process models are explored as metamodel. The functional inputs are incorporated into the Kriging model by applying norms in order to define distances between two functional inputs. We propose the use of B-splines to make the calculation of these norms computationally feasible.     

Comparing and generating Latin Hypercube designs in Kriging models

In Computer Experiments (CE), a careful selection of the design points is essential for predicting the system response at untried points, based on the values observed at tried points. In physical experiments, the protocol is based on Design of Experiments, a methodology whose basic principles are questioned in CE. When the responses of a CE are modeled as jointly Gaussian random variables with their covariance depending on the distance between points, the use of the so called space-filling designs (random designs, stratified designs and Latin Hypercube designs) is a common choice, because it is expected that the nearer the untried point is to the design points, the better is the prediction. In this paper we focus on the class of Latin Hypercube (LH) designs. The behavior of various LH designs is examined according to the Gaussian assumption with exponential correlation, in order to minimize the total prediction error at the points of a regular lattice. In such a special case, the problem is reduced to an algebraic statistical model, which is solved using both symbolic algebraic software and statistical software. We provide closed-form computation of the variance of the Gaussian linear predictor as a function of the design, in order to make a comparison between LH designs. In principle, the method applies to any number of factors and any number of levels, and also to classes of designs other than LHs. In our current implementation, the applicability is limited by the high computational complexity of the algorithms involved.     

The connectedness and optimality of a class of row-column designs

Balanced Incomplete Block Designs have been employed as row-column designs by a number of researchers. In this paper necessary and sufficient conditions for the connectedness of such designs are obtained, and methods for their optimisation are presented. The optimal design is shown to be always connected.     

D-Optimal Two-Level Fractional Factorial Designs of Resolution III with Two Dispersion Factors

The problem of finding D-optimal designs, with two dispersion factors, for the estimation of all location main effects is investigated in the class of regular unreplicated two-level fractional factorial designs of resolution III. Designs having length three words involving both of the dispersion factors in the defining relation are shown to be inferior in terms of D-optimality. Tables of factors that are named as the two dispersion factors so that the resulting design is either D-optimal or has the largest determinant of the information matrix are provided. Rank-order of designs is studied when the number of length three words involving either one of the dispersion factors and the number of length four words involving both of the dispersion factors are fixed. Rank-order of designs when the numbers of aforementioned words are less than or equal to ten is given.     

Comparing search and estimation performances of designs based on a compound criterion

Since the introduction of the search design by Srivastava [Designs for searching non-negligible effects. In: Srivastava, editor. A survey of statistical design and linear models. Amsterdam: North-Holland, Elsevier; 1975. p. 507–519], construction of such designs has been considered by many researchers. The efficient performances of constructed search designs in terms of parameter estimation and search ability of parameters have also been investigated by several authors. They have proposed suitable optimality measures such as DD- and AD-optimality for estimation in the early stage of search design construction. Moreover, since 1990s, some criteria have been developed to evaluate search performance of a design. Although these criteria are useful none of them is able to evaluate both estimation and search efficiency of a design simultaneously. In this paper, we propose dual-task criteria to deal with searching and estimating performances of search designs. These compound criteria are weighted multiplication of estimation and search suitable criteria. They will be used for design comparison and the results will be presented.     

Hyper-Graeco-Latin Squares and Fractional Factorial Designs

A Latin square of order s is an arrangement of the s letters in an s × s square so that every letter appears exactly once in every row and exactly once in every column. Copeland and Nelson (2000) used two examples to show that a Latin square can be chosen such that it corresponds to a fractional factorial design. In this article, we are going to study this topic more precisely. Furthermore, we will explore the relationship between fractional factorial designs and hyper-Graeco-Latin squares in general, where s is a prime or a power of a prime.