Addition of runs to a two-level supersaturated design

The purpose of this article is to introduce a new class of extended E(s²)-optimal two level supersaturated designs obtained by adding runs to an existing E(s²)-optimal two level supersaturated design. The extended design is a union of two optimal SSDs belonging to different classes. New lower bound to E(s²) has been obtained for the extended supersaturated designs. Some examples and a small catalogue of E(s²)-optimal SSDs are also included.     

Note on Draper and Lin's article “capacity considerations for two-level fractional factorial designs”

In Table 4 of Draper and Lin (1990) the authors present eleven 2^{k − p}_R designs for which doubt is expressed as to whether they are saturated. This note removes doubt on nine of these designs indicating that they are indeed saturated. Some observations are made in terms of the resolution of a design for the remaining two designs among the 11. The conclusions are derived by properly interpreting an updated table of binary linear codes of Verhoeff (1987).     

Optimal mixed-level k-circulant supersaturated designs

Supersaturated designs (SSDs) offer a potentially useful way to investigate many factors with only few experiments in the preliminary stages of experimentation. This paper explores how to construct E(_fNOD)$E(f_{\mathrm{NOD}})$-optimal mixed-level SSDs using k-cyclic generators. The necessary and sufficient conditions for the existence of mixed-level k-circulant SSDs with the equal occurrence property are provided. Properties of the mixed-level k  -circulant SSDs are investigated, in particular, the sufficient condition under which the generator vector produces an E(_fNOD)$E(f_{\mathrm{NOD}})$-optimal SSD is obtained. Moreover, many new E(_fNOD)$E(f_{\mathrm{NOD}})$-optimal mixed-level SSDs are constructed and listed. The method here generalizes the one proposed by Liu and Dean [2004. k$k$-circulant supersaturated designs. Technometrics 46, 32–43] for two-level SSDs and the one due to Georgiou and Koukouvinos [2006. Multi-level k-circulant supersaturated designs. Metrika 64, 209–220] for the multi-level case.     

Minimum aberration majorization in non-isomorphic saturated designs

In this paper we propose a new criterion, minimum aberration majorization, for comparing non-isomorphic saturated designs. This criterion is based on the generalized word-length pattern proposed by Ma and Fang (Metrika 53 (2001) 85) and Xu and Wu (Ann. Statist. 29 (2001) 1066) and majorization theory. The criterion has been successfully applied to check non-isomorphism and rank order saturated designs. Examples are given through five non-isomorphic L₁₆(2¹⁵) designs and two L₂₇(3¹³) designs.     

On the orthogonal designs of order 40

Using a new method we construct all 17 remaining (unresolved for over 20 years) full orthogonal designs of order 40 in three variables. This implies that all full orthogonal designs OD(2^t5;x,y, 2^t5−x−y) exist for all t⩾3. The last two remaining orthogonal designs of order 40 in 2 variables are obtained as a special case of two of these designs.     

Some new factor screening designs using the search linear model

Factor screening designs for searching two and three effective factors using the search linear model are discussed. The construction of such factor screening designs involved finding a fraction with small number of treatments of a 2^m factorial experiment having the property P_2t (no 2t columns are linearly dependent) for t=2 and 3. A ‘Packing Problem’ is introduced in this connection. A complete solution of the problem in one case and partial solutions for the other cases are presented. Many practically useful new designs are listed.     

Uniformity in factorial designs with mixed levels

The uniformity can be utilized as a measure for comparing factorial designs. Fang and Mukerjee (Biometrika 87 (2000) 193–198) and Fang et al. (in: K.T. Fang, F.J. Hickernell, H. Niederreiter (Eds.), Monte Carlo and Quasi-Monte Carlo Methods 2000, Springer, Berlin, 2002) found links among uniformity in terms of some non-uniformity measures, orthogonality and aberration for regular symmetric factorials. In this paper we extend their results to asymmetric factorials by considering a so-called wrap-around L₂-discrepancy to evaluate the uniformity of factorials. Furthermore, a lower bound of wrap-around L₂-discrepancy is obtained for asymmetric factorials and two new ways of construction of factorial designs with mixed levels are proposed.     

Some determinant optimality aspects of main effect fold-over designs

Saha and Mohanty (1970) presented a main effect fold-over design consisting of 14 treatment combinations of the 24×33 factorial, which had the nice property of being even balanced. Calling this design DSM, this paper establishes the following specific results: (i) DSM is not d-optimal in the subclass Δe of all 14 point even balanced main effect fold-over designs of the 24×33 factorial; (ii) DSM is not d-optimal in the subclass $\text{Δ}{}^1\text{?Δ}{}^{\mathrm{e}}$ of all 14 point even and odd balanced main effect fold-over designs of the 24×33 factorial; (iii) DSM is even optimal in $\text{Δ}{}^1$ and Δe. In addition to these results two 14 point designs in $\text{Δ}{}^1$ are presented which are d-optimal and via a counter example it is shown that these designs are not odd optimal. Finally, several general matrix algebra results are given which should be useful in resolving d-optimality problems of fold-over designs of the kn11×kn22 factorial.     

Optimal selection and ordering of columns in supersaturated designs

Two methods to select columns for assigning factors to work on supersaturated designs are proposed. The focus of interest is the degree of non-orthogonality between the selected columns. One method is the exhaustive enumeration of selections of p columns from all k columns to find the exact optimality, while the other is intended to find an approximate solution by applying techniques used in the corresponding analysis, aiming for ease of use as well as a reduction in the large computing time required for large k with the first method. Numerical illustrations for several typical design matrices reveal that the resulting “approximately” optimal assignments of factors to their columns are exactly optimal for any p. Ordering the columns in E(s²)-optimal designs results in promising new findings including a large number of E(s²)-optimal designs.     

Construction of group divisible designs and rectangular designs from resolvable and almost resolvable balanced incomplete block designs

In this paper, we present a general construction of group divisible designs and rectangular designs by utilising resolvable and “almost resolvable” balanced incomplete block designs. As special cases, we obtain the following E-optimal designs: (a) Group divisible (GD) designs with λ₂=λ₁+1 and (b) Rectangular designs with 2 rows and having λ₃=λ₂−1=λ₁+1. Many of the GD designs are optimal among binary designs with regard to all type 1 criteria.     

One-factor-at-a-time designs of resolution V

Two classes of designs of resolution V are constructed using one-factor-at-a-time techniques. They facilitate sequential learning and are more economical in run size than regular 2_V^k−p designs. Comparisons of D efficiency with other designs are given to assess the suitability of the proposed designs. Their D_s efficiencies can be dramatically improved with the addition of a few runs.     

Computer-aided unbalanced supersaturated designs involving interactions

Supersaturated designs (SSDs) are defined as fractional factorial designs whose experimental run size is smaller than the number of main effects to be estimated. While most of the literature on SSDs has focused only on main effects designs, the construction and analysis of such designs involving interactions has not been developed to a great extent. In this paper, we propose a backward elimination design-driven optimization (BEDDO) method, with one main goal in mind, to eliminate the factors which are identified to be fully aliased or highly partially aliased with each other in the design. Under the proposed BEDDO method, we implement and combine correlation-based statistical measures taken from classical test theory and design of experiments field, and we also present an optimality criterion which is a modified form of Cronbach's alpha coefficient. In this way, we provide a new class of computer-aided unbalanced SSDs involving interactions, that derive directly from BEDDO optimization.     

Sure independence screening for analyzing supersaturated designs

ABSTRACT

Supersaturated designs (SSDs) constitute a large class of fractional factorial designs which can be used for screening out the important factors from a large set of potentially active ones. A major advantage of these designs is that they reduce the experimental cost dramatically, but their crucial disadvantage is the confounding involved in the statistical analysis. Identification of active effects in SSDs has been the subject of much recent study. In this article we present a two-stage procedure for analyzing two-level SSDs assuming a main-effect only model, without including any interaction terms. This method combines sure independence screening (SIS) with different penalty functions; such as Smoothly Clipped Absolute Deviation (SCAD), Lasso and MC penalty achieving both the down-selection and the estimation of the significant effects, simultaneously. Insights on using the proposed methodology are provided through various simulation scenarios and several comparisons with existing approaches, such as stepwise in combination with SCAD and Dantzig Selector (DS) are presented as well. Results of the numerical study and real data analysis reveal that the proposed procedure can be considered as an advantageous tool due to its extremely good performance for identifying active factors.     

Balanced fractional factorial designs of resolution 2l+1 for interesting effects orthogonal to some nuisance parameters: 2m1+m2 series

For 2^m₁+m₂ factorial designs, this paper investigates balanced fractional 2^m₁ factorial designs of resolution 2l+1 with some nuisance parameters concerning the second factors. They are derivable from partially balanced arrays and further permit estimation of the effects up to the l-factor interactions concerning the first factors orthogonally to the nuisance parameters.     

A new lower bound to A2-optimality measure for multi-level and mixed-level column balanced designs and its applications

In this paper, a new lower bound to A₂-optimality measure is derived and is applied to multi-level and mixed-level column balanced designs. A₂-optimal multi-level and mixed-level designs are obtained by the application of the new lower bound.     

Families of Hadamard group divisible designs

By a family of designs we mean a set of designs whose parameters can be represented as functions of an auxiliary variable t where the design will exist for infinitely many values of t. The best known family is probably the family of finite projective planes with υ = b = t² + t + 1, r = k = t + 1, and λ = 1. In some instances, notably coding theory, the existence of families is essential to provide the degree of precision required which can well vary from one coding problem to another. A natural vehicle for developing binary codes is the class of Hadamard matrices. Bush (1977) introduced the idea of constructing semi-regular designs using Hadamard matrices whereas the present study is concerned mostly with construction of regular designs using Hadamard matrices. While codes constructed from these designs are not optimal in the usual sense, it is possible that they may still have substantial value since, with different values of λ₁ and λ₂, there are different error correcting capabilities.     

An effective construction method for multi-level uniform designs

Uniform designs are widely used in various applications. However, it is computationally intractable to construct uniform designs, even for moderate number of runs, factors and levels. We establish a linear relationship between average squared centered L₂-discrepancy and generalized wordlength pattern, and then based on it, we propose a general method for constructing uniform designs with arbitrary number of levels. The main idea is to choose a generalized minimum aberration design and then permute its levels. We propose a novel stochastic algorithm and obtain many new uniform designs that have smaller centered L₂-discrepancies than the existing ones.     

On the analysis of unbalanced two-level supersaturated designs via generalized linear models

Supersaturated designs (SSDs) are factorial designs in which the number of experimental runs is smaller than the number of parameters to be estimated in the model. While most of the literature on SSDs has focused on balanced designs, the construction and analysis of unbalanced designs has not been developed to a great extent. Recent studies discuss the possible advantages of relaxing the balance requirement in construction or data analysis of SSDs, and that unbalanced designs compare favorably to balanced designs for several optimality criteria and for the way in which the data are analyzed. Moreover, the effect analysis framework of unbalanced SSDs until now is restricted to the central assumption that experimental data come from a linear model. In this article, we consider unbalanced SSDs for data analysis under the assumption of generalized linear models (GLMs), revealing that unbalanced SSDs perform well despite the unbalance property. The examination of Type I and Type II error rates through an extensive simulation study indicates that the proposed method works satisfactorily.     

Construction of main effect plus two plans for 2m factorials

This paper gives a main effect plus two plan (MEP.2 plan) for 2^m factorials (m⩾4) in the same setup as in Mukerjee and Chatterjee (Utilitas Math. 45 (1994) 213) in a smaller number of treatments. For a certain design T₁, combinatorial properties on a design T₂ are presented so that the design T=T₁+T₂ is a MEP.2 plan, where “+” stands for a union of two designs. Our results are more flexible for the choice of T₂ than the results of Mukerjee and Chatterjee (Utilitas Math. 45 (1994) 213).     

Construction of orthogonal Latin hypercube designs with flexible run sizes

Latin hypercube designs (LHDs) have recently found wide applications in computer experiments. A number of methods have been proposed to construct LHDs with orthogonality among main-effects. When second-order effects are present, it is desirable that an orthogonal LHD satisfies the property that the sum of elementwise products of any three columns (whether distinct or not) is 0. The orthogonal LHDs constructed by Ye (1998), Cioppa and Lucas (2007), Sun et al. (2009) and Georgiou (2009) all have this property. However, the run size n of any design in the former three references must be a power of two (n=2^c) or a power of two plus one (n=2^c+1), which is a rather severe restriction. In this paper, we construct orthogonal LHDs with more flexible run sizes which also have the property that the sum of elementwise product of any three columns is 0. Further, we compare the proposed designs with some existing orthogonal LHDs, and prove that any orthogonal LHD with this property, including the proposed orthogonal LHD, is optimal in the sense of having the minimum values of ave(|t|), t_max, ave(|q|) and q_max.