Experimentation order with good properties for 2 k factorial designs

Randomizing the order of experimentation in a factorial design does not always achieve the desired effect of neutralizing the influence of unknown factors. In fact, with some very reasonable assumptions, an important proportion of random orders achieve the same degree of protection as that obtained by experimenting in the design matrix standard order. In addition, randomization can induce a large number of changes in factor levels and thus make experimentation expensive and difficult. De Leon et al. [Experimentation order in factorial designs with 8 or 16 runs, J. Appl. Stat. 32 (2005), pp. 297–313] proposed experimentation orders for designs with eight or 16 runs that combine an excellent level of protection against the influence of unknown factors, with the minimum number of changes in factor levels. This article presents a new methodology to obtain experimentation orders with the desired properties for designs with any number of runs.     

Lee discrepancy on mixed two- and three-level uniform augmented designs

Follow-up experiment is widely applied to various fields such as science and engineering, since it is an indispensable strategy, especially when some additional resources or information become available after the initial design of experiment is carried out. Moreover, some extra factors may be added in the follow-up experiment. One may augment the number of runs and/or factors for the purpose of application. In this paper, the issue of the uniform row augmented designs and column augmented designs with mixed two- and three-level is investigated. The uniformity of augmented designs is discussed under the Lee discrepancy, some lower bounds of Lee discrepancy for the augmented designs are obtained. The construction algorithm of the uniform augmented designs is given. Some numerical examples indicate that uniform augmented designs can be constructed with high efficiency.     

NESTING OPTIMAL MAIN EFFECTS PLANS AND OPTIMAL FOLDOVER DESIGNS

ABSTRACT

Optimal main effects plans (MEPs) and optimal foldover designs can often be performed as a series of nested optimal designs. Then, if the experiment cannot be completed due to time or budget constraints, the fraction already performed may still be an optimal design. We show that the optimal MEP for 4t factors in 4t + 4 points does not contain the optimal MEP for 4t factors in 4t + 2 points nested within it. In general, the optimal MEP for 4t factors in 4t + 4 points does not contain the optimal MEPs for 4t factors in 4t + 1, 4t + 2, or 4t + 3 points and the optimal MEP for 4t + 1 factors in 4t + 4 points does not contain the optimal MEPs for 4t + 1 factors in 4t + 2 or 4t + 3 points. We also show that the runs in an orthogonal design for 4t factors in 4t + 4 points, and the optimal foldover designs obtained by folding, should be performed in a certain sequence in order to avoid the possibility of a singular X'X matrix.     

Constructing optimal projection designs

ABSTRACT

The early stages of many real-life experiments involve a large number of factors among which only a few factors are active. Unfortunately, the optimal full-dimensional designs of those early stages may have bad low-dimensional projections and the experimenters do not know which factors turn out to be important before conducting the experiment. Therefore, designs with good projections are desirable for factor screening. In this regard, significant questions are arising such as whether the optimal full-dimensional designs have good projections onto low dimensions? How experimenters can measure the goodness of a full-dimensional design by focusing on all of its projections?, and are there linkages between the optimality of a full-dimensional design and the optimality of its projections? Through theoretical justifications, this paper tries to provide answers to these interesting questions by investigating the construction of optimal (average) projection designs for screening either nominal or quantitative factors. The main results show that: based on the aberration and orthogonality criteria the full-dimensional design is optimal if and only if it is optimal projection design; the full-dimensional design is optimal via the aberration and orthogonality if and only if it is uniform projection design; there is no guarantee that a uniform full-dimensional design is optimal projection design via any criterion; the projection design is optimal via the aberration, orthogonality and uniformity criteria if it is optimal via any criterion of them; and the saturated orthogonal designs have the same average projection performance.     

A method for constructing supersaturated designs and its Es2 optimality

A lower bound for the Es² value of an arbitrary supersaturated design is derived. A general method for constructing supersaturated designs is proposed and shown to produce designs with n runs and m = k(n — 1) factors that achieve the lower bound for Es² and are thus optimal with respect to the Es² criterion. Within the class of designs given by the construction method, further discrimination can be made by minimizing the pairwise correlations and using the generalized D and A criteria proposed by Wu (1993). Efficient designs of 12, 16, 20 and 24 runs are constructed by following this approach.     

Optimal blocked main effects plans

In this paper, we consider the construction of optimal blocked main effects designs where m two-level factors are to be studied in N runs which are partitioned into b blocks of equal size. For N ≡ 2±od4 sufficient conditions are derived for a design to be Φ _f optimal among all designs having main effects occurring equally often at their high and low levels within blocks and then this result is extended to the class of all designs for the case when the block size is two. Methods of constructing designs satisfying the sufficient conditions derived are also given.     

Construction of Efficient Multi-Level k-Circulant Supersaturated Designs

This article proposes an algorithm to construct efficient balanced multi-level k-circulant supersaturated designs with m factors and n runs. The algorithm generates efficient balanced multi-level k-circulant supersaturated designs very fast. Using the proposed algorithm many balanced multi-level supersaturated designs are constructed and cataloged. A list of many optimal and near optimal, multi-level supersaturated designs is also provided for m ≤ 60 and number of levels (q) ≤10. The algorithm can be used to generate two-level k-circulant supersaturated designs also and some large optimal two-level supersaturated designs are presented. An upper bound to the number of factors in a balanced multi-level supersaturated design such that no two columns are fully aliased is also provided.     

Design selection for strong orthogonal arrays

Strong orthogonal arrays (SOAs) were recently introduced and studied as a class of space‐filling designs for computer experiments. An important problem that has not been addressed in the literature is that of design selection for such arrays. In this article, we conduct a systematic investigation into this problem, and we focus on the most useful SOA(n,m,4,2 + )s and SOA(n,m,4,2)s. This article first addresses the problem of design selection for SOAs of strength 2+ by examining their three‐dimensional projections. Both theoretical and computational results are presented. When SOAs of strength 2+ do not exist, we formulate a general framework for the selection of SOAs of strength 2 by looking at their two‐dimensional projections. The approach is fruitful, as it is applicable when SOAs of strength 2+ do not exist and it gives rise to them when they do. The Canadian Journal of Statistics 47: 302–314; 2019 © 2019 Statistical Society of Canada     

Some new lower bounds to various discrepancies on combined designs

The foldover is a useful technique in construction of two-level factorial designs. A foldover design is the follow-up experiment generated by reversing the sign(s) of one or more factors in the initial design. The full design obtained by joining the runs in the foldover design to those of the initial design is called the combined design. In this article, some new lower bounds of various discrepancies of combined designs, such as the centered, symmetric, and wrap-around L₂-discrepancies, are obtained, which can be used as a better benchmark for searching optimal foldover plans. Our results provide a theoretical justification for optimal foldover plans in terms of uniformity criterion.     

Supersaturated design including an orthogonal base

Recently, many supersaturated designs have been proposed. A supersaturated design is a fractional factorial design in which the number of factors is greater than the number of experimental runs. The main thrust of the previous studies has been to generate more columns while avoiding large values of squared inner products among all design columns. These designs would be appropriate if the probability for each factor being active is uniformly distributed. When factors can be partitioned into two groups, namely, with high and low probabilities of each factor being active, it is desirable to maintain orthogonality among columns to be assigned to the factors in the high-probability group. We discuss a supersaturated design including an orthogonal base which is suitable for this common situation. Mathematical results on the existence of the supersaturated designs are shown, and the construction of supersaturated designs is presented. We next discuss some properties of the proposed supersaturated designs based on the squared inner products.     

Some robust parameter designs from orthogonal arrays

Robust parameter design, originally proposed by Taguchi [System of Experimental Design, Vols. I and II, UNIPUB, New York, 1987], is an offline production technique for reducing variation and improving a product's quality by using product arrays. However, the use of the product arrays results in an exorbitant number of runs. To overcome this drawback, several scientists proposed the use of combined arrays, where the control and noise factors are combined in a single array. In this paper, we use non-isomorphic orthogonal arrays as combined arrays, in order to identify a model that contains all the main effects (control and noise), their control-by-noise interactions and their control-by-control interactions with high efficiency. Some cases where the control-by-control-noise are of interest are also considered.     

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.     

Some extremal problems in designing discriminating experiments

This paper is devoted to some properties of local T-optimaj. designs fox discriminating between two rival regression models. It is demonstrated that the problem of searching for an optimal design is closely connected with the problem of searching for a Tchebycheff extremal basis. The question raised concerns the number of supporting points in an optimal design.     

Efficient arrangements of two-level orthogonal arrays in two and four blocks

When orthogonal arrays are used in practical applications, it is often difficult to perform all the designed runs of the experiment under homogeneous conditions. The arrangement of factorial runs into blocks is usually an action taken to overcome such obstacles. However, an arbitrary configuration might lead to spurious analysis results. In this work, the nice properties of two-level orthogonal arrays are taken into consideration and an effective method for arranging experimental runs into two and four blocks of the same size is proposed. This method is based on the so-called J-characteristics of the corresponding array. General theoretical results are given for studying up to four experimental factors in two blocks, as well as for studying up to three experimental factors in four blocks. Finally, we provide best blocking arrangements when the number of the factors of interest is larger, by exploiting the known lists of non-isomorphic orthogonal arrays with two levels and various run sizes.     

Model-robust supersaturated and partially supersaturated designs

Supersaturated designs are an increasingly popular tool for screening factors in the presence of effect sparsity. The advantage of this class of designs over resolution III factorial designs or Plackett–Burman designs is that n, the number of runs, can be substantially smaller than the number of factors, m. A limitation associated with most supersaturated designs produced thus far is that the capability of these designs for estimating g active effects has not been discussed. In addition to exploring this capability, we develop a new class of model-robust supersaturated designs that, for a given n and m, maximizes the number g   of active effects that can be estimated simultaneously. The capabilities of model-robust supersaturated designs for model discrimination are assessed using a model-discrimination criterion, the subspace angle. Finally, we introduce the class of partially supersaturated designs, intended for use when we require a specific subset of _m1$m_1$ core factors to be estimable, and the sparsity of effects principle applies to the remaining (m-_m1$m-m_1$) factors.     

ARL-Design of S Charts with k-of-k Runs Rules

The standard S chart signals an out-of-control condition when one point exceeds a control limit. It can be augmented with runs rules to improve its performance in detecting assignable causes. A commonly used rule signals when k consecutive points exceed a control limit. This rule can be used alone or to supplement the standard chart. In this article we derive ARL expressions for charts with the k-of-k runs rule. We show how to design S charts with this runs rule, compare their ARL performance, and make a control chart recommendation when it is important to monitor for both increases and decreases in process dispersion.     

Effectiveness of a random compound noise strategy for robust parameter design

Robust parameter design has been widely used to improve the quality of products and processes. Although a product array, in which an orthogonal array for control factors is crossed with an orthogonal array for noise factors, is commonly used for parameter design experiments, this may lead to an unacceptably large number of experimental runs. The compound noise strategy proposed by Taguchi [30 G. Taguchi, System of Experimental Design: Engineering Methods to Optimize Quality and Minimize Costs, UNIPUB/Kraus International, White Plains, New York, 1987. [Google Scholar]] can be used to reduce the number of experimental runs. In this strategy, a compound noise factor is formed based on the directionality of the effects of noise factors. However, the directionality is usually unknown in practice. Recently, Singh et al. [28 J. Singh, D.D. Frey, N. Soderborg, and R. Jugulum, Compound noise: Evaluation as a robust parameter design method, Qual. Reliab. Eng. Int. 23 (2007), 387–398. doi: 10.1002/qre.812[Crossref], [Web of Science ®] , [Google Scholar]] proposed a random compound noise strategy, in which a compound noise factor is formed by randomly selecting a setting of the levels of noise factors. The present paper evaluates the random compound noise strategy in terms of the precision of the estimators of the response mean and the response variance. In addition, the variances of the estimators in the random compound noise strategy are compared with those in the n-replication design. The random compound noise strategy is shown to have smaller variances of the estimators than the 2-replication design, especially when the control-by-noise-interactions are strong.     

A note on the minimum size of an orthogonal array

It is an elementary fact that the size of an orthogonal array of strength t on k factors must be a multiple of a certain number, say L_t, that depends on the orders of the factors. Thus L_t is a lower bound on the size of arrays of strength t on those factors, and is no larger than L_k, the size of the complete factorial design. We investigate the relationship between the numbers L_t, and two questions in particular: For what t is L_t < L_k? And when L_t = L_k, is the complete factorial design the only array of that size and strength t? Arrays are assumed to be mixed-level.

We refer to an array of size less than L_k as a proper fraction. Guided by our main result, we construct a variety of mixed-level proper fractions of strength k ? 1 that also satisfy a certain group-theoretic condition.     

On the E-optimality of blocked main effects plans in blocks of different sizes

In this article, we consider experimental situations in which m 2-level factors are to be studied using a main effects plan where n runs are to be partitioned into b blocks having both even and odd sizes. For these cases, we give some simple methods for constructing E-optimal designs.     

Branch and bound algorithms for maximizing expected improvement functions

Deterministic computer simulations are often used as replacement for complex physical experiments. Although less expensive than physical experimentation, computer codes can still be time-consuming to run. An effective strategy for exploring the response surface of the deterministic simulator is the use of an approximation to the computer code, such as a Gaussian process (GP) model, coupled with a sequential sampling strategy for choosing design points that can be used to build the GP model. The ultimate goal of such studies is often the estimation of specific features of interest of the simulator output, such as the maximum, minimum, or a level set (contour). Before approximating such features with the GP model, sufficient runs of the computer simulator must be completed.Sequential designs with an expected improvement (EI) design criterion can yield good estimates of the features with minimal number of runs. The challenge is that the expected improvement function itself is often multimodal and difficult to maximize. We develop branch and bound algorithms for efficiently maximizing the EI function in specific problems, including the simultaneous estimation of a global maximum and minimum, and in the estimation of a contour. These branch and bound algorithms outperform other optimization strategies such as genetic algorithms, and can lead to significantly more accurate estimation of the features of interest.