Equivalence of factorial designs with qualitative and quantitative factors

Two symmetric fractional factorial designs with qualitative and quantitative factors are equivalent if the design matrix of one can be obtained from the design matrix of the other by row and column permutations, relabeling of the levels of the qualitative factors and reversal of the levels of the quantitative factors. In this paper, necessary and sufficient methods of determining equivalence of any two symmetric designs with both types of factors are given. An algorithm used to check equivalence or non-equivalence is evaluated. If two designs are equivalent the algorithm gives a set of permutations which map one design to the other. Fast screening methods for non-equivalence are considered. Extensions of results to asymmetric fractional factorial designs with qualitative and quantitative factors are discussed.     

The construction of multi-factor crossover designs in animal husbandry studies

For ethical reasons it is important to try to obtain as much useful information as possible from an animal experiment whilst minimizing the number of animals used. Crossover designs, where applicable, provide an ideal framework for achieving this. If two or more treatment factors are included in the crossover design then the reduction in total animal usage can be considerable. In this paper we consider such designs, defined as multi-factor crossover designs. The designs are applicable when there are several different treatment factors, each at t levels, to be applied to the experimental units. The motivation for investigating these designs was a study conducted at GlaxoSmithKline to determine the preference of male and female dogs for t=5 different types of bed and t=5 different bedding conditions. A construction method is given for forming universally optimal designs for t not too large. Also given is an example for the special case where the number of treatment levels t=6.     

Combining multi‐observer information in partially rank‐ordered judgment post‐stratified and ranked set samples

This paper develops two sampling designs to create artificially stratified samples. These designs use a small set of experimental units to determine their relative ranks without measurement. In each set, the units are ranked by all available observers (rankers), with ties whenever the units cannot be ranked with high confidence. The rankings from all the observers are then combined in a meaningful way to create a single weight measure. This weight measure is used to create judgment strata in both designs. The first design constructs the strata through judgment post‐stratification after the data has been collected. The second design creates the strata before any measurements are made on the experimental units. The paper constructs estimators and confidence intervals, and develops testing procedures for the mean and median of the underlying distribution based on these sampling designs. We show that the proposed sampling designs provide a substantial improvement over their competitor designs in the literature. The Canadian Journal of Statistics 41: 304–324; 2013 © 2013 Statistical Society of Canada     

An algorithmic approach to construct D-optimal saturated designs for logistic model

In this paper, locally D-optimal saturated designs for a logistic model with one and two continuous input variables have been constructed by modifying the famous Fedorov exchange algorithm. A saturated design not only ensures the minimum number of runs in the design but also simplifies the row exchange computation. The basic idea is to exchange a design point with a point from the design space. The algorithm performs the best row exchange between design points and points form a candidate set representing the design space. Naturally, the resultant designs depend on the candidate set. For gain in precision, intuitively a candidate set with a larger number of points and the low discrepancy is desirable, but it increases the computational cost. Apart from the modification in row exchange computation, we propose implementing the algorithm in two stages. Initially, construct a design with a candidate set of affordable size and then later generate a new candidate set around the points of design searched in the former stage. In order to validate the optimality of constructed designs, we have used the general equivalence theorem. Algorithms for the construction of optimal designs have been implemented by developing suitable codes in R.     

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.     

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.     

Combinatorial Equivalence of Fractional Factorial Designs

Two symmetrical fractional factorial designs are said to be combinatorially equivalent if one design can be obtained from another by reordering the runs, relabeling the factors and relabeling the levels of one or more factors. This article presents concepts of ordered distance frequency matrix, distance frequency vector, and reduced distance frequency vector for a design. Necessary conditions for two designs to be combinatorial equivalent based on these concepts are presented. A new algorithm based on the results obtained is proposed to check combinatorial non-equivalence of two factorial designs and several illustrating examples are provided.     

An Optimality Probability Index for Correlated Multiple Responses

In the real problems, there are many cases which have correlated quality characteristics so multiple response optimization can be more realistic if we can consider correlation structure of responses. In this study we propose a new method which uses multivariate normal probability to find the optimal treatment in an experimental design. Moreover, a heuristic method is used to find better factors’ level in all possible combinations in the designs with large number of controllable factors and their levels. Some simulated numerical examples and a real case were studied by the proposed approach and the comparison of the results with previous methods show efficiency of the proposed method.     

Response surface design evaluation and comparison

Designing an experiment to fit a response surface model typically involves selecting among several candidate designs. There are often many competing criteria that could be considered in selecting the design, and practitioners are typically forced to make trade-offs between these objectives when choosing the final design. Traditional alphabetic optimality criteria are often used in evaluating and comparing competing designs. These optimality criteria are single-number summaries for quality properties of the design such as the precision with which the model parameters are estimated or the uncertainty associated with prediction. Other important considerations include the robustness of the design to model misspecification and potential problems arising from spurious or missing data. Several qualitative and quantitative properties of good response surface designs are discussed, and some of their important trade-offs are considered. Graphical methods for evaluating design performance for several important response surface problems are discussed and we show how these techniques can be used to compare competing designs. These graphical methods are generally superior to the simplistic summaries of alphabetic optimality criteria. Several special cases are considered, including robust parameter designs, split-plot designs, mixture experiment designs, and designs for generalized linear models.     

Approximate and exact optimal designs for paired comparisons of partial profiles when there are two groups of factors

For paired comparison experiments involving pairs of multifactor options differing in a specified number of factors the problem of finding optimal designs is considered, when only main effects are to be estimated. It is presumed that the set of factors can be partitioned into two groups such that the number of levels is constant within each group. The optimal designs for this frequently encountered case are also optimal for the corresponding choice experiments under the hypothesis that the parameters in the multinomial logit model are equal to zero.     

Split-plot designs for robust product experimentation

Genichi Taguchi has emphasized the use of designed experiments in several novel and important applications. In this paper we focus on the use of statistical experimental designs in designingproducts to be robust to environmental conditions. The engineering concept of robust product design is very important because it is frequently impossible or prohibitively expensive to control or eliminate variation resulting from environmental conditions. Robust product design enablesthe experimenter to discover how to modify the design of the product to minimize the effect dueto variation from environmental sources. In experiments of this kind, Taguchi's total experimental arrangement consists of a cross-product of two experimental designs:an inner array containing the design factors and an outer array containing the environmental factors. Except in situations where both these arrays are small, this arrangement may involve a prohibitively large amount of experimental work. One of the objectives of this paper is to show how this amount of work can be reduced. In this paper we investigate the applicability of split-plot designs for thisparticular experimental situation. Consideration of the efficiency of split-plot designs and anexamination of several variants of split-plot designs indicates that experiments conductedin a split-plot mode can be of tremendous value in robust product design since they not only enable the contrasts of interest to be estimated efficiently but also the experiments can be considerably easier to conduct than the designs proposed by Taguchi.     

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.     

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.     

Adaptive grid semidefinite programming for finding optimal designs

We find optimal designs for linear models using a novel algorithm that iteratively combines a semidefinite programming (SDP) approach with adaptive grid techniques. The proposed algorithm is also adapted to find locally optimal designs for nonlinear models. The search space is first discretized, and SDP is applied to find the optimal design based on the initial grid. The points in the next grid set are points that maximize the dispersion function of the SDP-generated optimal design using nonlinear programming. The procedure is repeated until a user-specified stopping rule is reached. The proposed algorithm is broadly applicable, and we demonstrate its flexibility using (i) models with one or more variables and (ii) differentiable design criteria, such as A-, D-optimality, and non-differentiable criterion like E-optimality, including the mathematically more challenging case when the minimum eigenvalue of the information matrix of the optimal design has geometric multiplicity larger than 1. Our algorithm is computationally efficient because it is based on mathematical programming tools and so optimality is assured at each stage; it also exploits the convexity of the problems whenever possible. Using several linear and nonlinear models with one or more factors, we show the proposed algorithm can efficiently find optimal designs.     

A Variable Selection Method for Analyzing Supersaturated Designs

Supersaturated designs are a large class of factorial designs which can be used for screening out the important factors from a large set of potentially active variables. The huge advantage of these designs is that they reduce the experimental cost drastically, but their critical disadvantage is the confounding involved in the statistical analysis. In this article, we propose a method for analyzing data using several types of supersaturated designs. Modifications of widely used information criteria are given and applied to the variable selection procedure for the identification of the active factors. The effectiveness of the proposed method is depicted via simulated experiments and comparisons.     

Selection and screening procedures to determine optimal product designs

To compare several promising product designs, manufacturers must measure their performance under multiple environmental conditions. In many applications, a product design is considered to be seriously flawed if its performance is poor for any level of the environmental factor. For example, if a particular automobile battery design does not function well under temperature extremes, then a manufacturer may not want to put this design into production. Thus, this paper considers the measure of a product's quality to be its worst performance over the levels of the environmental factor. We develop statistical procedures to identify (a near) optimal product design among a given set of product designs, i.e., the manufacturing design that maximizes the worst product performance over the levels of the environmental variable. We accomplish this by intuitive procedures based on the split-plot experimental design (and the randomized complete block design as a special case); split-plot designs have the essential structure of a product array and the practical convenience of local randomization. Two classes of statistical procedures are provided. In the first, the δ-best formulation of selection problems, we determine the number of replications of the basic split-plot design that are needed to guarantee, with a given confidence level, the selection of a product design whose minimum performance is within a specified amount, δ, of the performance of the optimal product design. In particular, if the difference between the quality of the best and second best manufacturing designs is δ or more, then the procedure guarantees that the best design will be selected with specified probability. For applications where a split-plot experiment that involves several product designs has been completed without the planning required of the δ-best formulation, we provide procedures to construct a ‘confidence subset’ of the manufacturing designs; the selected subset contains the optimal product design with a prespecified confidence level. The latter is called the subset selection formulation of selection problems. Examples are provided to illustrate the procedures.     

D-optimal minimax design criterion for two-level fractional factorial designs

A D-optimal minimax design criterion is proposed to construct two-level fractional factorial designs, which can be used to estimate a linear model with main effects and some specified interactions. D-optimal minimax designs are robust against model misspecification and have small biases if the linear model contains more interaction terms. When the D-optimal minimax criterion is compared with the D-optimal design criterion, we find that the D-optimal design criterion is quite robust against model misspecification. Lower and upper bounds derived for the loss functions of optimal designs can be used to estimate the efficiencies of any design and evaluate the effectiveness of a search algorithm. Four algorithms to search for optimal designs for any run size are discussed and compared through several examples. An annealing algorithm and a sequential algorithm are particularly effective to search for optimal designs.     

Efficient estimators for adaptive stratified sequential sampling

In stratified sampling, methods for the allocation of effort among strata usually rely on some measure of within-stratum variance. If we do not have enough information about these variances, adaptive allocation can be used. In adaptive allocation designs, surveys are conducted in two phases. Information from the first phase is used to allocate the remaining units among the strata in the second phase. Brown et al. [Adaptive two-stage sequential sampling, Popul. Ecol. 50 (2008), pp. 239–245] introduced an adaptive allocation sampling design – where the final sample size was random – and an unbiased estimator. Here, we derive an unbiased variance estimator for the design, and consider a related design where the final sample size is fixed. Having a fixed final sample size can make survey-planning easier. We introduce a biased Horvitz–Thompson type estimator and a biased sample mean type estimator for the sampling designs. We conduct two simulation studies on honey producers in Kurdistan and synthetic zirconium distribution in a region on the moon. Results show that the introduced estimators are more efficient than the available estimators for both variable and fixed sample size designs, and the conventional unbiased estimator of stratified simple random sampling design. In order to evaluate efficiencies of the introduced designs and their estimator furthermore, we first review some well-known adaptive allocation designs and compare their estimator with the introduced estimators. Simulation results show that the introduced estimators are more efficient than available estimators of these well-known adaptive allocation designs.     

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.     

Analysis of a supersaturated design using Entropy Prior Complexity for binary responses via generalized linear models

A supersaturated design is a factorial design in which the number of effects to be estimated is greater than the available number of experimental runs. It is used in many experiments for screening purposes, i.e., for studying a large number of factors and then identifying the active ones. The goal with such a design is to identify just a few of the factors under consideration, that have dominant effects and to do this at minimum cost. While most of the literature on supersaturated designs has focused on the construction of designs and their optimality, the data analysis of such designs remains still at an early stage. In this paper, we incorporate the parameter model complexity into the supersaturated design analysis process, by assuming generalized linear models for a Bernoulli response, for analyzing main effects designs and discovering simultaneously the effects that are significant.