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.     

Algebraic statistics of level codings for fractional factorial designs

We discuss the applications of algebraic statistics to fractional factorial design with special emphasis on the choice of level coding. In particular, we deal with the theory of Bayley's level codings in that framework.     

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.     

On some optimal fractional 2m factorial designs of resolution V

This paper presents the trace of the covariance matrix of the estimates of effects based on a fractional 2^m factorial (2^m-FF) design T of resolution V for the following two cases: One is the case where T is constructed by adding some restricted assemblies to an orthogonal array. The other is one where T is constructed by removing some restricted assemblies from an orthogonal array of index unity. In the class of 2^m-FF designs of resolution V considered here, optimal designs with respect to the trace criterion, i.e. A-optimal, are presented for m = 4, 5, and 6 and for a range of practical values of N (the total number of assemblies). Some of them are better than the corresponding A-optimal designs in the class of balanced fractional 2^m factorial designs of resolution V obtained by Srivastava and Chopra (1971b) in such a sense that the trace of the covariance matrix of the estimates is small.     

Bayesian optimal blocking of factorial designs

The presence of block effects makes the optimal selection of fractional factorial designs a difficult task. The existing frequentist methods try to combine treatment and block wordlength patterns and apply minimum aberration criterion to find the optimal design. However, ambiguities exist in combining the two wordlength patterns and therefore, the optimality of such designs can be challenged. Here we propose a Bayesian approach to overcome this problem. The main technique is to postulate a model and a prior distribution to satisfy the common assumptions in blocking and then, to develop an optimal design criterion for the efficient estimation of treatment effects. We apply our method to develop regular, nonregular, and mixed-level blocked designs. Several examples are presented to illustrate the advantages of the proposed method.     

On the problem of augmented fractional factorial designs

Let D be a saturated fractional factorial design of the general K₁ x K₂ ...x K_t factorial such that it consists of m distinct treatment combinations and it is capable of providing an unbiased estimator of a subvector of m factorial parameters under the assumption that the remaining k-m,t (k = H it ) factorial parameters are negligible. Such a design will not provide an unbiased estimator of the varianceσ² Suppose that D is an optimal design with respect to some optimality criterion (e.g. d-optimality, a-optimality or e-optimality) and it is desirable to augment D with c treatmentcombinations with the aim to estimate ² Suppose that D is an optimal design with respect to some optimality criterion (e.g. d-optimality, a-optimality or e-optimality) and it is desirable to augment D with c treatment combinations with the aim to estimate σ² unbiasedly. The problem then is how to select the c treatment combinations such that the augmented design D retains its optimality property. This problem, in all its generality is extremely complex. The objective of this paper is to provide some insight in the problem by providing a partial answer in the case of the 2^tfactorial, using the d-optimality criterion.     

One-eighth- and one-sixteenth-fraction quaternary code designs with high resolution

The development of a general methodology for the construction of good two-level nonregular designs has received significant attention over the last 10 years. Recent works by Phoa and Xu (2009) and Zhang et al. (2011) indicate that quaternary code (QC) designs are very promising in this regard. This paper explores a systematic construction for 1/8th and 1/16th fraction QC designs with high resolution for any number of factors. The 1/8th fraction QC designs often have larger resolution than regular designs of the same size. A majority of the 1/16th fraction QC designs also have larger resolution than comparable two-level regular designs.     

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.     

Existence conditions for balanced fractional 3m factorial designs of resolution R({00, 10, 01, 20, 11})

We consider a fractional 3^m factorial design derived from a simple array (SA) such that the non negligible factorial effects are the general mean, the linear and the quadratic components of the main effect, and the linear-by-linear and the linear-by-quadratic components of the two-factor interaction. If these effects are estimable, then a design is said to be of resolution R({00, 10, 01, 20, 11}). In this paper, we give a necessary and sufficient condition for an SA to be a balanced fractional 3^m factorial design of resolution R({00, 10, 01, 20, 11}). Such a design is concretely characterized by the suffixes of the indices of an SA.     

On the construction of orthogonal factorial designs of resolution 11

A new method of construction of orthogonal resolution IV designs for symmetrical and asymmetrical factorials has been presented. Many new series of orthogonal factorial designs of resolution IV can be obtained by the above general method.     

Lower bounds of various criteria in experimental designs

Criterion is essential for measuring the goodness of an experimental design. In this paper, lower bounds of various criteria in experimental designs will be reviewed according to methodology of their construction. The criteria include most well-known ones which are frequently used as benchmarks for orthogonal array, uniform design, supersaturated design and other types of designs. To derive the lower bounds of these criteria, five different approaches are explored. Some new results are given. Throughout the paper, some relationships among different types of lower bounds are also discussed.     

On sum composition of fractional factorial designs

Combinatorial extension and composition methods have been extensively used in the construction of block designs. One of the composition methods, namely the direct product or Kronecker product method was utilized by Chakravarti [1956] to produce certain types of fractional factorial designs. The present paper shows how the direct sum operation can be utilized in obtaining from initial fractional factorial designs for two separate symmetrical factorials a fractional factorial design for the corresponding asymmetrical factorial. Specifically, we provide some results which are useful in the construction of non-singular fractional factorial designs via the direct sum composition method. In addition a modified direct sum method is discussed and the consequences of imposing orthogonality are explored.     

Orthogonal three-level parallel flats designs for user-specified resolution

Orthogonal factorial and fractional factorial designs are very popular in many experimental studies, particularly the two-level and three-level designs used in screening experiments. When an experimenter is able to specify the set of possibly nonnegligible factorial effects, it is sometimes possible to obtain an orthogonal design belonging to the class of parallel flats designs, that has a smaller run-size than a suitable design from the class of classical fractional factorial designs belonging to the class of single flat designs. Sri-vastava and Li (1996) proved a fundamental theorem of orthogonal s-level, s being a prime, designs of parallel flats type for the user-specified resolution. They also tabulated a series of orthogonal designs for the two-level case. No orthogonal designs for three-level case are available in their paper. In this paper, we present a simple proof for the theorem given in Srivastava and Li (1996) for the three-level case. We also give a dual form of the theorem, which is more useful for developing an algorithm for construction of orthogonal designs. Some classes of three-level orthogonal designs with practical run-size are given in the paper.     

D‐optimal minimax fractional factorial designs

The D‐optimal minimax criterion is proposed to construct fractional factorial designs. The resulting designs are very efficient, and robust against misspecification of the effects in the linear model. The criterion was first proposed by Wilmut & Zhou (2011); their work is limited to two‐level factorial designs, however. In this paper we extend this criterion to designs with factors having any levels (including mixed levels) and explore several important properties of this criterion. Theoretical results are obtained for construction of fractional factorial designs in general. This minimax criterion is not only scale invariant, but also invariant under level permutations. Moreover, it can be applied to any run size. This is an advantage over some other existing criteria. The Canadian Journal of Statistics 41: 325–340; 2013 © 2013 Statistical Society of Canada     

Generalized modulus-ratio tests for analysis of factorial designs with zero degrees of freedom for error

A method of statistical analysis of single replicate and fractional factorial designs requiring no estimate of error variance is given. By comparison of the relative magnitudes of independent effect .estimates, effects corresponding to relatively large effect estimates may be asserted to be nonzero. The procedure maintains a prespecified experimentwise error rate for a general class of modulus-ratio statistics.     

Minimum cost linear trend-free 12-run fractional factorial designs

Time trend resistant fractional factorial experiments have often been based on regular fractionated designs where several algorithms exist for sequencing their runs in minimum number of factor-level changes (i.e. minimum cost) such that main effects and/or two-factor interactions are orthogonal to and free from aliasing with the time trend, which may be present in the sequentially generated responses. On the other hand, only one algorithm exists for sequencing runs of the more economical non-regular fractional factorial experiments, namely Angelopoulos et al. [1 P. Angelopoulos, H. Evangelaras, and C. Koukouvinos, Run orders for efficient two-level experimental plans with minimum factor level changes robust to time trends, J. Statist. Plann. Inference 139 (2009), pp. 3718–3724. doi: 10.1016/j.jspi.2009.05.002[Crossref], [Web of Science ®] , [Google Scholar]]. This research studies sequential factorial experimentation under non-regular fractionated designs and constructs a catalog of 8 minimum cost linear trend-free 12-run designs (of resolution III) in 4 up to 11 two-level factors by applying the interactions-main effects assignment technique of Cheng and Jacroux [3 C.S. Cheng and M. Jacroux, The construction of trend-free run orders of two-level factorial designs, J. Amer. Statist. Assoc. 83 (1988), pp. 1152–1158. doi: 10.1080/01621459.1988.10478713[Taylor &; Francis Online], [Web of Science ®] , [Google Scholar]] on the standard 12-run Plackett–Burman design, where factor-level changes between runs are minimal and where main effects are orthogonal to the linear time trend. These eight 12-run designs are non-orthogonal but are more economical than the linear trend-free designs of Angelopoulos et al. [1 P. Angelopoulos, H. Evangelaras, and C. Koukouvinos, Run orders for efficient two-level experimental plans with minimum factor level changes robust to time trends, J. Statist. Plann. Inference 139 (2009), pp. 3718–3724. doi: 10.1016/j.jspi.2009.05.002[Crossref], [Web of Science ®] , [Google Scholar]], where they can accommodate larger number of two-level factors in smaller number of experimental runs. These non-regular designs are also more economical than many regular trend-free designs. The following will be provided for each proposed systematic design:

• (1) The run order in minimum number of factor-level changes.

• (2) The total number of factor-level changes between the 12 runs (i.e. the cost).

• (3) The closed-form least-squares contrast estimates for all main effects as well as their closed-form variance–covariance structure.

In addition, combined designs of each of these 8 designs that can be generated by either complete or partial foldover allow for the estimation of two-factor interactions involving one of the factors (i.e. the most influential).     

Characterization of information matrices for balanced two-level fractional factorial designs of odd resolution derived from two-symbol simple arrays

We consider a balanced fractional 2^m factorial design of resolution 2?+1 which permits estimation of all factorial effects up through ?-factor interactions under the situation in which all (?+1)-factor and higher order interactions are to be negligible for an integer satisfying [m/2]<lE;?m, where [x] denotes the greatest integer not exceeding x. This paper investigates algebraic structure of the information matrix of such a design derived from a simple array through that of an atomic array. We obtain an explicit expression for the irreducible matrix representation based on the above design and its algebraic properties. The results in this paper will be useful to characterize the designs under consideration.     

Results for two-level fractional factorial designs of resolution IV or more

The main theorem of this paper shows that foldover designs are the only (regular or nonregular) two-level factorial designs of resolution IV (strength 3) or more for n   runs and n/3?m?n/2$n/3?m?n/2$ factors. This theorem is a generalization of a coding theory result of Davydov and Tombak [1990. Quasiperfect linear binary codes with distance 4 and complete caps in projective geometry. Problems Inform. Transmission 25, 265–275] which, under translation, effectively states that foldover (or even) designs are the only regular two-level factorial designs of resolution IV or more for n   runs and 5n/16?m?n/2$5n/16?m?n/2$ factors. This paper also contains other theorems including an alternative proof of Davydov and Tombak's result.