U-type and column-orthogonal designs for computer experiments

U-type designs and orthogonal Latin hypercube designs (OLHDs) have been used extensively for performing computer experiments. Both have good spaced filling properties in one-dimension. U-type designs may not have low correlations among the main effects, quadratic effects and two-factor interactions. On the other hand, OLHDs are hard to be found due to their large number of levels for each factor. Recently, alternative classes of U-type designs with zero or low correlations among the effects of interest appear in the literature. In this paper, we present new classes of U-type or quantitative \(3\) -orthogonal designs for computer experiments. The proposed designs are constructed by combining known combinatorial structures and they have their main effects pairwise orthogonal, orthogonal to the mean effect, and orthogonal to both quadratic effects and two-factor interactions.     

Construction of mixed-level supersaturated design

Supersaturated design is a form of fractional factorial design in which the number of columns is greater than the number of experimental runs. Construction methods of supersaturated design have been mainly focused on two levels cases. Much practical experience, however, indicates that two-level may sometimes be inadequate. This paper proposed a construction method of mixed-level supersaturated designs consisting of two-level and three-level columns. The χ² statistic is used for a measure of dependency of the design columns. The dependency properties for the newly constructed designs are derived and discussed. It is shown that these new designs have low dependencies and thus can be useful for practical uses.     

Some orthogonal arrays with 32 runs and their projection properties

Screening designs are useful for situations where a large number of factors are examined but only a few, k, of them are expected to be important. Traditionally orthogonal arrays such as Hadamard matrices and Plackett Burman designs have been studied for this purpose. It is therefore of practical interest for a given k to know all the classes of inequivalent projections of the design into the k dimensions that have certain statistical properties. In this paper we present 15 inequivalent Hadamard matrices of order n=32 constructed from circulant cores. We study their projection properties using several well-known statistical criteria and we provide minimum generalized aberration 2 level designs with 32 runs and up to seven factors that are embedded into these Hadamard matrices. A concept of generalized projectivity and design selection of such designs is also discussed.AMS Subject Classification: Primary 62K15, Secondary 05B20     

Two ge neral classes of search designs for factor screening experiments with factors at three levels

In this paper, we are presenting general classes of factor screening designs for identifying a few important factors from a list of m (≥ 3) factors each at three levels. A design is a subset of 3^m possible runs. The problem of finding designs with small number of runs is considered here. A main effect plan requires at least (2m + 1) runs for estimating the general mean, linear and quadratic effects of m factors. An orthogonal main effect plan requires, in addition, the number of runs as a multiple of 9. For example, when m=5, a main effect plan requires at least 11 runs and an orthogonal main effect plan requires 18 runs. Two general factor screening designs presented here are nonorthogonal designs with (2m− 1) runs. These designs, called search designs permit us to search for and identify at most two important factors out of m factors under the search linear model introduced in Srivastava (1975). For example, when m=5, the two new plans given in this paper have 9 runs, which is a significant improvement over an orthogonal main effect plan with 18 runs in terms of the number of runs and an improvement over a main effect plan with at least 11 runs. We compare these designs, for 4≤m≤ 10, using arithmetic and geometric means of the determinants, traces, and maximum characteristic roots of certain matrices. Two designs D1 and D2 are identical for m=3 and this design is an optimal design in the class of all search designs under the six criteria discussed above. Designs D1 and D2 are also identical for m=4 under some row and column permutations. Consequently, D1 and D2 are equally good for searching and identifying one important factor out of m factors when m=4. The design D1 is marginally better than the design D2 for searching and identifying one important factor out of m factors when m=5, … , 10. The design D1 is marginally better than the D2 for searching and identifying two important factors out of m factors when m=5, 7, 9. The design D2 is somewhat better than the design D1 for m=6, 8. For m=10, D1 is marginally better than D2 w.r.t. the geometric mean and D2 is marginally better than D1 w.r.t. the arithmetic mean of the maximum characteristic roots.     

The Optimality of Single-group Designs for Certain Mixed Models

In this paper optimal designs for the estimation of the fixed effects (population parameters) in a certain class of mixed models are investigated. Two classes of designs are compared: the class of single-group designs, where all individuals are observed under the same approximate design, and the class of more-group designs with the same mean number of observations per individual as before, where each individual can be observed under a different approximate design. It is shown that any design that is Φ-optimal in the class of single-group designs is also Φ-optimal in the larger class of more-group designs. The considered optimality criteria only have to satisfy mild assumptions, which is eg the case for the D-criterion and all linear criteria.     

A new approach in constructing orthogonal and nearly orthogonal arrays

Orthogonal arrays have been constructed by a number of mathematical tools such as orthogonal Latin squares, Hadamard matrices, group theory and finite fields. Wang and Wu (1992) proposed the concept of a nearly orthogonal array and found a number of such arrays with high efficiency. In this paper we propose some criteria for non-orthogonality and two algorithms for the construction of orthogonal and nearly orthogonal arrays evincing higher efficiency than that obtained by Wang and Wu. Received: September 1999     

Multi-level k-circulant Supersaturated Designs

In this paper we present a new method for constructing multi-level supersaturated designs with n rows, m columns and the equal occurrence property. We investigate the existence of multi-level supersaturated designs using a single generator vector and its k-cyclic permutations as rows. We find the conditions needed, in order this vector to generate a balanced supersaturated design. These conditions are simplified for the case of three level supersaturated designs. By using the proposed method three level supersaturated designs are constructed and explored. Moreover, many new, optimal and near optimal, multi-level supersaturated designs are provided as well.     

18-run nonisomorphic three level orthogonal arrays

In this paper we construct all possible orthogonal arrays OA(18,q, 3,2) with 18 runs and 3 ≤ q ≤ 7 columns and present those that are nonisomorphic. A discussion on the novelty and the superiority of many of the designs found in terms of isomorphism and generalized minimum aberration has been made.      

Asymmetrical Factorial Designs Containing Clear Effects

The asymmetrical or mixed-level factorial design is a kind of important design in practice. There is a natural problem on how to choose an optimal (s ²)s ⁿ design for the practical need, where s is any prime or prime power. This paper considers the clear effects criterion for selecting good designs. It answers the questions of when an (s ²)s ⁿ design with fixed number of runs contains clear two-factor interaction (in brief 2fi) components and when it contains clear main effects or clear 2fis. It further gives the complete classification of (s ²)s ⁿ designs according to the clear 2fi components, main effects and 2fis they have.     

Blocked factor aliased effect-number pattern and column rank of blocked regular designs

In factorial experiments, estimation precision of specific factor effects depends not only on design selection but also on factor assignments to columns of selected designs. Usually, different columns in a design play different roles when estimating factor effects. Zhou et al. (Can J Stat 41:540-555, 2013) introduced a factor aliased effect-number pattern (F-AENP) and proposed a column ranking scheme for all the GMC \(2^{n-m}\) designs with \(5N/16+1\le n\le N-1\), where \(N=2^{n-m}\). In this paper, we first introduce a blocked factor aliased effect-number pattern (B-F-AENP) for blocked regular designs as an extension of the F-AENP. Then, by using the B-F-AENP, we propose a column ranking scheme for all the B\(^1\)-GMC \(2^{n-m}:2^s\) designs with \(5N/16+1\le n\le N-1\), as well as an assignment strategy for important factors.     

A COMPARISON OF THE POWERS OF A GENERALIZED FRIEDMAN'S RANK TEST AND AN ALIGNED RANK PROCEDURE BASED ON SIMULATION

This paper presents the results of an experimental determination by Monte Carlo techniques of the power functions of a generalized Friedman's rank test based on "standardized" ranks and a proposed test procedure based on aligned ranks for orthogonal designs. The simulation is carried out for five orthogonal designs and a number of Normal location alternatives and gives some information about the difference in power of the two test procedures for some orthogonal designs.     

Optimality results on orthogonal arrays plus <Emphasis Type="Italic">p</Emphasis> runs for <Emphasis Type="Italic">s</Emphasis><Superscript><Emphasis Type="Italic">m</Emphasis></Superscript> factorial experiments

The optimality of designs obtained by adding p runs to an orthogonal array is studied for experiments involving m factors each at s levels. The optimality criterion used here, is the Type 1 criterion due to Cheng (1978) which is an extension of Kiefer (1975) universal optimality criterion. Unlike what happens with orthogonal array plus one run designs, the behavior of designs obtained via augmentation of an orthogonal array by p runs depends on the particular runs added.     

A class of non binary unequally replicatedE-optimal designs

In a situation where the given set of parameters (b, k andv) precludes the existence of any known optimal block designs, but an optimal block design is known to exist with parametersb, k andv*>v, a new design is shown to be useful. This (b, k, v) design is obtained from the (b, k, v*) optimal design by collapsing the classes of a suitable paritition of the treatment set (of the latter design) to treatments (of the former). We call the new design a quotient of the original design. Although the quotient is non binary and unequally replicated, it turns out to beE-optimal within the class of all proper and connected designs withb, k andv, provided the replication number of the optimal design we start with is not too large.     

A note on the uniform distribution on the arcsin points

In his book Pukelsheim [8] pointed out that designs supported at the arcsin points are very efficient for the statistical inference in a polynomial regression model. In this note we determine the canonical moments of a class of distributions which have nearly equal weights at the arcsin points. The class contains theD-optimal arcsin support design and theD ₁-optimal design for a polynomial regression. The results allow explicit representations ofD-, andD ₁-efficiencies of these designs in all polynomial models with a degree less than the number of support points of the design.     

SomeE andMV-optimal row-column designs having equal numbers of rows and columns

In this paper we consider experimental situations in whichv treatments are to be tested using a row-column design consisting ofb columns andb rows and wherev does not divideb ². Some sufficient conditions are obtained for a design to beE orMV-optimal in such an experimental setting and methods for constructing row-column designs satisfying the sufficient conditions obtained are also given. This research was supported by NSF Grant No. DMS-8401943.     

Robustness of Williams Square change-over designs

In literature, Williams Square change-over designs balanced for first residual effects of treatments have been proved to be universally optimal. Here, an attempt has been made to show that these designs are robust against missing of last α [≤v−1; v being the number of periods in the design for v treatments] observations from an experimental unit. Received May 2000     

Bayesian robust designs for linear models with possible bias and correlated errors

Consider the design problem for the approximately linear model with serially correlated errors. The correlated structure is the qth degree moving average process, MA(q), especially for q = 1, 2. The optimal design is derived by using Bayesian approach. The Bayesian designs derived with various priors are compared with the classical designs with respect to some specific correlated structures. The results show that any prior knowledge about the sign of the MA(q) process parameters leads to designs that are considerately more efficient than the classical ones based on homoscedastic assumptions.     

TypeS designs with nested rows and columns

Summary Supplemented balance in block designs with nested rows and columns is considered, under the name of typeS designs with nested rows and columns. Analysis and construction of such designs are also discussed.     

Robust row-column designs for complete diallel cross experiments

This paper investigates the robustness of variance-balanced row-column designs for complete diallel cross experiments for estimating the comparisons among the general combining ability parameters against the loss of observations. A necessary and sufficient condition of robustness as per connectedness criterion is obtained. The robustness of optimal row-column designs of Gupta and Choi (1998) has been investigated for the loss of any m(≥1) observations in a column and for the loss of any two observations in the design. The study of robustness has also been conducted as per A-efficiency criterion.     

A note on the robustness of Box-Behnken designs to the unavailability of data

Box-Behnken designs and central composite designs are efficient designs for fitting second order polynomials to response surfaces, because they use relatively small numbers of observations to estimate the parameters. In this paper we investigate the robustness of Box-Behnken designs to the unavailability of observations, in the sense of finding t _max , the maximum number of arbitrary rows in the design matrix that can be removed and still leave all of the parameters of interest estimable. The results are compared to the known results for the central composite designs found in MacEachern, Notz, Whittinghill & Zhu (1995). The blocked Box-Behnken designs are equally as robust as those that are not blocked. Received December 1997