On the equivalence of definitions for regular fractions of mixed-level factorial designs

The notion of regularity for fractional factorial designs was originally defined only for two-level factorial designs. Recently, rather different definitions for regular fractions of mixed-level factorial designs have been proposed by Collombier [1996. Plans d’Expérience Factoriels. Springer, Berlin], Wu and Hamada [2000. Experiments. Wiley, New York] and Pistone and Rogantin [2008. Indicator function and complex coding for mixed fractional factorial designs. J. Statist. Plann. Inference 138, 787–802]. In this paper we prove that, surprisingly, these definitions are equivalent. The proof of equivalence relies heavily on the character theory of finite Abelian groups. The group-theoretic framework provides a unified approach to deal with mixed-level factorial designs and treat symmetric factorial designs as a special case. We show how within this framework each regular fraction is uniquely characterized by a defining relation as for two-level factorial designs. The framework also allows us to extend the result that every regular fraction is an orthogonal array of a strength that is related to its resolution, as stated in Dey and Mukerjee [1999. Fractional Factorial Plans. Wiley, New York] to mixed-level factorial designs.     

Irregular Four-level Response Surface Designs

Four-level response surface designs based on regular two-level fractional factorial designs were introduced by Edmondson (1991). Here, the methods are extended to include designs based on irregular two-level fractional factorials. These designs allow orthogonal blocking and require fewer experimental units than the regular designs.     

Classification of efficient two-level fractional factorial designs of resolution IV or more

Two-level fractional factorial designs that are efficient in terms of aberration or other aliasing properties are classified into four types of designs of resolution IV or more: the half-fraction designs, the even designs, the five-column designs and the join designs. The designs are shown to have concise grid representations which provide simple interpretations of their aliasing structure. New efficient 128-run designs are presented and blocking of the designs is considered.     

Fractional Factorial Designs for the Detection of Interactions between Design and Noise Factors

In industrial experiments on both design (control) factors and noise factors aimed at improving the quality of manufactured products, designs are needed which afford independent estimation of all design×noise interactions in as few runs as possible, while allowing aliasing between those factorial effects of less interest. An algorithm for generating orthogonal fractional factorial designs of this type is described for factors at two levels. The generated designs are appropriate for experimenting on individual factors or for experimentation involving group screening of factors.     

Algorithm for determining whether various two-level fractional factorial split-plot row–column designs are non-isomorphic

The confounding and aliasing scheme for fractional factorial split-plot designs with the units within each wholeplot arranged in rows and columns is described and illustrated. Isomorphism for this design type is described, together with a procedure which considers extensions of the concepts of wordlength patterns and letter patterns that can be used to test isomorphism between designs. Using in part this isomorphism testing procedure, a construction algorithm that may be used to obtain a complete set of such non-isomorphic two-level designs is described. Software based on this construction algorithm was used to obtain a complete set of non-isomorphic designs for up to five wholeplot factors, five subplot factors and up to 64 runs, which is presented as a table of designs. To aid the experimenter in distinguishing between competing designs, the estimation capacity sequence for each design is presented.     

A search of maximum generalized resolution quaternary-code designs via integer linear programming

Quaternary-code (QC) designs, an attractive class of nonregular fractional factorial designs, have received much attention due to their theoretical elegance and practical applicability. Some recent works of QC designs revealed their good properties over their regular counterparts under commonly used criteria. We develop an optimization tool that can maximize the generalized resolution of a QC design of a given size. The problem can be recast as an integer linear programming (ILP) problem through a linear simplification that combines the \(k\)- and \(a\)-equations, even though the generalized resolution does not linearly depend on the aliasing indexes. The ILP surprisingly improves a class of \((1/16)\)th-fraction QC designs with higher generalized resolutions. It also applies to obtain some \((1/64)\)th-fraction QC designs with maximum generalized resolutions, and these QC designs generally have higher generalized resolutions than the regular designs of the same size.     

Minimum aberration blocking of regular mixed factorial designs

It is known by Zhang and Park (J. Statist. Plann. Inference 91 (2000) 107) that there are no minimum aberration (MA) designs with respect to both treatments and blocks for blocked regular mixed-level factorial designs. So it should be compromised between the block wordlength pattern and treatment wordlength pattern. Two methods are considered in this article. The first is MA blocking scheme of an MA design. The other is to combine the components of the two wordlength pattern vectors into one combined wordlength pattern according to the modified hierarchical assumptions and an appropriate ordering of the numbers of alias or confounding relations. The relationship between the two types of optimal blocked designs is investigated. A complete catalogue of optimal blocked regular mixed factorial designs of the above two types with 16 or 32 runs is given.     

De-aliasing effects using semifoldover techniques

Semifoldover designs, obtained by semifolding a regular two-level factorial design, have been discussed recently in the literature. In this article, with the use of indicator functions, we investigate various semifoldover designs that are obtained from a general two-level factorial design. We discuss when a main factor or a two-factor interaction can be de-aliased from their aliased two-factor interactions, and extend some of the existing results from regular designs to non-regular designs. Finally, we present some examples to illustrate the results developed here.     

Catalogue of small runs nonregular designs from hadamard matrices with generalized minimum aberration

Fries and Hunter ( 1980 ) proposed the Minimum Aberration criterion (MA) for selecting regular designs. The regular designs with MA are msot commonly used because they are considered as the best designs. How ever, as pointed out by Chen, Sun and Wu ( 1993 ), there are situations that other designs may better meet the design need. Therefore, they catalogued some two-level and three-level fractional factorial regular designs with small (16,27,32,64) runs. For nonregular designs, such as the ones taken from Hadamard matrices, the MA criterion is not appUcable. Deng and Tang ( 1999 ) introduced Generalized Minimum Aberration Criterion (GMA) as a natural extension to the MA criterion. Similar to the case in the regular designs, other designs may better meet practical need, In this paper, we use the GMA criterion to give a catalogue of nonregular designs with smaU (16,20,24) runs.     

Theory of optimal blocking of nonregular factorial designs

The authors introduce the notion of split generalized wordlength pattern (GWP), i.e., treatment GWP and block GWP, for a blocked nonregular factorial design. They generalize the minimum aberration criterion to suit this type of design. Connections between factorial design theory and coding theory allow them to obtain combinatorial identities that govern the relationship between the split GWP of a blocked factorial design and that of its blocked consulting design. These identities work for regular and nonregular designs. Furthermore, the authors establish general rules for identifying generalized minimum aberration (GMA) blocked designs through their blocked consulting designs. Finally they tabulate and compare some GMA blocked designs from Hall's orthogonal array OA(16,2¹5,2) of type III.     

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.     

Optimal blocking and foldover plans for nonregular two-level designs

This paper discusses the issue of choosing optimal designs when both blocking and foldover techniques are simultaneously employed to nonregular two-level fractional factorial designs. By using the indicator function, the treatment and block generalized wordlength patterns of the combined blocked design under a general foldover plan are defined. Some general properties of combined block designs are also obtained. Our results extend the findings of Ai et al. (2010) from regular designs to nonregular designs. Based on these theoretical results, a catalog of optimal blocking and foldover plans in terms of the generalized aberration criterion for nonregular initial design with 12, 16 and 20 runs is tabulated, respectively.     

(M,S)-optimality in selecting factorial designs

Use of the (M,S) criterion to select and classify factorial designs is proposed and studied. The criterion is easy to deal with computationally and it is independent of the choice of treatment contrasts. It can be applied to two-level designs as well as multi-level symmetrical and asymmetrical designs. An important connection between the (M,S) and minimum aberration criteria is derived for regular fractional factorial designs. Relations between the (M,S) criterion and generalized minimum aberration criteria on nonregular designs are also discussed. The (M,S) criterion is then applied to study the projective properties of some nonregular designs.     

Designs for cropping systems research

The present article establishes equivalence between extended group divisible (EGD) designs and designs for crop sequence experiments. This equivalence has encouraged the agricultural experimenters to use EGD designs for their experimentation. Some real life applications of EGD designs have been given. It has also been shown that several existing association schemes are special cases of EGD association scheme. Some methods of construction of EGD designs are also given. A catalogue of EGD designs obtainable through methods of construction along with efficiency factors of various factorial effects is also presented. In some crop sequence experiments that are conducted to develop suitable integrated nutrient supply system of a crop sequence, the treatments do not comprise of a complete factorial structure. The experimenter is interested in estimating the residual and direct effect of the treatments along with their cumulative effects. For such experimental settings block designs with two sets of treatments applied in succession are the appropriate designs. The correspondence established between row–column designs and block designs for two stage experiments by Parsad et al. [2003. Structurally incomplete row–column designs. Comm. Statist. Theory Methods 32(1), 239–261] has been exploited in obtaining designs for such experimental situations. Some open problems related to designing of crop sequence experiments are also given.     

Graph based isomorph-free generation of two-level regular fractional factorial designs

We provide a new necessary and sufficient check for testing the isomorphism of two 2-level regular fractional factorial designs. The approach is based on modeling fractional factorial designs as bipartite graphs. We employ an efficient canonical graph labeling approach to compare two designs for isomorphism. We then improve upon the existing non-isomorphic fractional factorial design generation algorithm by reducing the number of candidate designs from which isomorphs need to be removed. Not only does our method generate non-isomorphic designs much faster, it is also able to generate designs with run sizes of 2048 and 4096 runs, which were not generated by the existing methods.     

Partially replicated two-level fractional factorial designs via semifoldover

Most fractional factorial designs have no replicated points and thus do not provide a reliable estimate for experimental error. The objective of this paper is to study the issue of partially replicated two-level fractional factorial (FF) designs, thereby allowing for the unbiased estimation of the experimental error while maintaining the orthogonality of the main effects. Through the tool of indicator function and the idea of semifoldover, we propose two simple and effective techniques to produce designs with partially replicated points in general two-level FF designs, whether they are regular or not. The related properties of constructed partially replicated designs are investigated. Our results indicate that partially replicated FF are competitive in practice.     

Balanced arrays and main-effect plans from regular group-divisible designs

A method of constructing balanced arrays of strength two and corresponding main-effect fractional factorial plans from some regular group-divisible designs is presented. Main-effect fractional factorial plans for three-level factorial experiments are constructed. The plans have reasonably high efficiencies for different single degree of freedom effects.     

Isomorphism check in fractional factorial designs via letter interaction pattern matrix

Two fractional factorial designs are considered isomorphic if one can be obtained from the other by relabeling the factors, reordering the runs, and/or switching the levels of factors. To identify the isomorphism of two designs is known as an NP hard problem. In this paper, we propose a three-dimensional matrix named the letter interaction pattern matrix (LIPM) to characterize the information contained in the defining contrast subgroup of a regular two-level design. We first show that an LIPM could uniquely determine a design under isomorphism and then propose a set of principles to rearrange an LIPM to a standard form. In this way, we can significantly reduce the computational complexity in isomorphism check, which could only take O(2^p)+O(3k³)+O(2^k) operations to check two 2^k−p designs in the worst case. We also find a sufficient condition for two designs being isomorphic to each other, which is very simple and easy to use. In the end, we list some designs with the maximum numbers of clear or strongly clear two-factor interactions which were not found before.     

Saturated main-effect designs for factorial experiments

The results of a computer search for saturated designs for 2ⁿ factorial experiments with n runs is reported, (where n = 2 mod 4). A complete search of the design space is avoided by focussing on designs constructed from cyclic generators. A method of searching quickly for the best generators is given. The resulting designs are as good as, and sometimes better than, designs obtained via search algorithms reported in the literature. The addition of a further factor having three levels is also considered. Here, too, a complete search is avoided by restricting attention to the most efficient part of the design space under p-efficiency.     

A survey and evaluation of methods for determination of combinatorial equivalence of factorial designs

Equivalent factorial designs have identical statistical properties for estimation of factorial contrasts and for model fitting. Non-equivalent designs, however, may have the same statistical properties under one particular model but different properties under a different model. In this paper, we describe known methods for the determination of equivalence or non-equivalence of two-level factorial designs, whether they be regular factorial designs, non-regular orthogonal arrays, or have no particular structure. In addition, we evaluate a number of potential fast screening methods for detecting non-equivalence of designs. Although the paper concentrates mainly on symmetric designs with factors at two levels, we also evaluate methods of determining combinatorial equivalence and non-equivalence of three-level designs and indicate extensions to larger numbers of levels and to asymmetric designs.