General upper bound for the number of blocks having a given number of treatments common with a given block

The purpose of this paper is systematically to derive the general upper bound for the number of blocks having a given number of treatments common with a given block of certain incomplete block designs. The approach adopted here is based on the spectral decomposition of N′N for the incidence matrix N of a design, where N' is the transpose of the matrix N. This approach will lead us to upper bounds for incomplete block designs, in particular for a large number of partially balanced incomplete block (PBIB) designs, which are not covered with the standard approach (Shah 1964, 1966), Kapadia (1966)) of using well known relations between blocks of the designs and their association schemes. Several results concerning block structure of block designs are also derived from the main theorem. Finally, further generalizations of the main theorem are discussed with some illustrations.     

Supersaturated designs with high searching probability

A supersaturated design is essentially a fractional factorial design whose number of experimental variables is greater than or equal to its number of experimental runs. Under the effect sparsity assumption, a supersaturated design can be very cost-effective. In this paper, our prime objective is to compare the existing two-level supersaturated designs for the noisy case through the probability of correct searching—a powerful criterion proposed by Shirakura et al. [1996. Searching probabilities for nonzeroeffects in search designs for the noisy case. Ann. Statist. 24, 2560–2568]. An algorithm is proposed to construct supersaturated designs with high probability of correct searching. Examples are given for illustration.     

Some Utilizations of Lambert W Function in Distribution Theory

We introduce a new class of positive infinitely divisible probability laws calling them 𝔏_γ distributions. Their cumulant-generating functions (cgf) are expressed in terms of the principal branch of the Lambert W function. The probability density functions (pdfs) of 𝔏_γ laws are bounded resembling pdf of a Lévy stable distribution. The exponential dispersion model constructed starting from an 𝔏_γ distribution admits the inverse Gaussian approximation. The natural exponential family constructed starting from an 𝔏_γ distribution constitutes the reciprocal of the natural exponential family generated by a spectrally negative stable law with α = 1. We derive new results on 𝔏_γ laws and the related exponential dispersion models, including their convolution and scaling closure properties. We generate another exponential dispersion model starting from an exponentially compounded 𝔏_γ law. This distribution emerges in the Poisson mixture representation of a generalized Poisson law. We extend the Poisson approximation for the scaled Neyman type A exponential dispersion model. We derive saddlepoint-type approximations for some of these exponential dispersion models. The role of the Lambert W function is emphasized.     

A Bayesian criterion for selecting super saturated screening designs

Super-saturated designs in which the number of factors under investigation exceeds the number of experimental runs have been suggested for screening experiments initiated to identify important factors for future study. Most of the designs suggested in the literature are based on natural but ad hoc criteria. The “average s²” criteria introduced by Booth and Cox (Technometrics 4 (1962) 489) is a popular choice. Here, a decision theoretic approach is pursued leading to an optimality criterion based on misclassification probabilities in a Bayesian model. In certain cases, designs optimal under the average s² criterion are also optimal for the new criterion. Necessary conditions for this to occur are presented. In addition, the new criterion often provides a strict preference between designs tied under the average s² criterion, which is advantageous in numerical search as it reduces the number of local minima.     

Comparison of Four New General Classes of Search Designs

A factor screening experiment identifies a few important factors from a large list of factors that potentially influence the response. If a list consists of m factors each at three levels, a design is a subset of all possible 3 ^m runs. This paper considers the problem of finding designs with small numbers of runs, using the search linear model introduced in Srivastava (1975). The paper presents four new general classes of these 'search designs', each with 2 m −1 runs, which permit, at most, two important factors out of m factors to be searched for and identified. The paper compares the designs for 4 ≤ m ≤ 10, using arithmetic and geometric means of the determinants, traces and maximum characteristic roots of particular matrices. Two of the designs are found to be superior in all six criteria studied. The four designs are identical for m = 3 and this design is an optimal design in the class of all search designs under the six criteria. The four designs are also identical for m = 4 under some row and column permutations.     

A general method of constructing E(s2)-optimal supersaturated designs

There has been much recent interest in supersaturated designs and their application in factor screening experiments. Supersaturated designs have mainly been constructed by using the E ( s ²)-optimality criterion originally proposed by Booth and Cox in 1962. However, until now E ( s ²)-optimal designs have only been established with certainty for n experimental runs when the number of factors m is a multiple of n-1 , and in adjacent cases where m = q ( n -1) + r (| r | 2, q an integer). A method of constructing E ( s ²)-optimal designs is presented which allows a reasonably complete solution to be found for various numbers of runs n including n ,=8 12, 16, 20, 24, 32, 40, 48, 64.     

New 3-level response surface designs constructed from incomplete block designs

Box and Behnken [1958. Some new three level second-order designs for surface fitting. Statistical Technical Research Group Technical Report No. 26. Princeton University, Princeton, NJ; 1960. Some new three level designs for the study of quantitative variables. Technometrics 2, 455–475.] introduced a class of 3-level second-order designs for fitting the second-order response surface model. These 17 Box–Behnken designs (BB designs) are available for 3–12 and 16 factors. Although BB designs were developed nearly 50 years ago, they and the central-composite designs of Box and Wilson [1951. On the experimental attainment of optimum conditions. J. Royal Statist. Soc., Ser. B 13, 1–45.] are still the most often recommended response surface designs. Of the 17 aforementioned BB designs, 10 were constructed from balanced incomplete block designs (BIBDs) and seven were constructed from partially BIBDs (PBIBDs). In this paper we show that these seven BB designs constructed from PBIBDs can be improved in terms of rotatability as well as average prediction variance, D$D$- and G$G$-efficiency. In addition, we also report new orthogonally blocked solutions for 5, 8, 9, 11 and 13 factors. Note that an 11-factor BB design is available but cannot be orthogonally blocked. All new designs can be found at http://www.math.montana.edu/∼$\sim$jobo/bbd/.     

Application domains for the Delta method

The Delta method uses truncated Lagrange expansions of statistics to obtain approximations to their distributions. In this paper, we consider statistics Y=g(μ+X), where X is any random vector. We obtain domains 𝒟 such that, when μ∈𝒟, we may apply the distribution derived from the Delta method. Namely, we will consider an application on the normal case to illustrate our approach.     

Three‐level regular designs with general minimum lower‐order confounding

In this paper, we extend the general minimum lower‐order confounding (GMC) criterion to the case of three‐level designs. First, we review the relationship between GMC and other criteria. Then we introduce an aliased component‐number pattern (ACNP) and a three‐level GMC criterion via the consideration of component effects, and obtain some results on the new criterion. All the 27‐run GMC designs, 81‐run GMC designs with factor numbers $n=5,\ldots,20$ and 243‐run GMC designs with resolution $IV$ or higher are tabulated. The Canadian Journal of Statistics 41: 192–210; 2013 © 2012 Statistical Society of Canada     

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.     

Multilevel Augmented Pairs Second-Order Response Surface Designs and Their Robustness to Missing Data

Missing observations can occur even in a well-planned experiment. The effect of missing observations can be much more serious when the design is saturated or near saturated. The levels of factor settings that make a design more robust to missing observations are of great importance in the sense that the loss for missing observations becomes minimum. In this study, new augmented pairs minimax loss designs are constructed, which are more robust to one missing design point than the augmented pairs designs presented by Morris (2000 Morris , M. D. ( 2000 ). A class of three-level experimental designs for response surface modeling . Technometrics 42 : 111 – 121 .[Taylor & Francis Online], [Web of Science ®] , [Google Scholar]). New designs are compared with augmented pairs designs, central composite designs, and small composite designs under generalized scaled standard deviations. The model used is also studied for the regression coefficient estimates.     

Projection Properties of Certain Three-Level Main Effect Plans with Quantitative Factors

ABSTRACT

Orthogonal arrays are used as screening designs to identify active main effects, after which the properties of the subdesign for estimating these effects and possibly their interactions become important. Such a subdesign is known as a “projection design”. In this article, we have identified all the geometric non isomorphic projection designs of an OA(27,13,3,2), an OA(18,7,3,2) and an OA(36,13,3,2) into k = 3,4, and 5 factors when they are used for screening out active quantitative experimental factors, with regard to the prior selection of the middle level of factors. We use the popular D-efficiency criterion to evaluate the ability of each design found in estimating the parameters of a second order model.     

Group screening method for the statistical analysis of -optimal mixed-level supersaturated designs

In this paper, we propose the application of group screening methods for analyzing data using E(f_NOD)-optimal mixed-level supersaturated designs possessing the equal occurrence property. 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 high degree of confounding among factorial effects. Based on the idea of the group screening methods, the f factors are sub-divided into g “group-factors”. The “group-factors” are then studied using the penalized likelihood statistical analysis methods at a factorial design with orthogonal or near-orthogonal columns. All factors in groups found to have a large effect are then studied in a second stage of experiments. A comparison of the Type I and Type II error rates of various estimation methods via simulation experiments is performed. The results are presented in tables and discussion follows.     

A variable-neighbourhood search algorithm for finding optimal run orders in the presence of serial correlation

The responses obtained from response surface designs that are run sequentially often exhibit serial correlation or time trends. The order in which the runs of the design are performed then has an impact on the precision of the parameter estimators. This article proposes the use of a variable-neighbourhood search algorithm to compute run orders that guarantee a precise estimation of the effects of the experimental factors. The importance of using good run orders is demonstrated by seeking D-optimal run orders for a central composite design in the presence of an AR(1) autocorrelation pattern.     

Combined array approach for optimal designs

Robust parameter design, originally proposed by Taguchi ( 1987 ) is an offline production technique for reducing variation and improving product's quality To achieve this objective Taguchi proposed the use of product arrays. However. the product array approach, results in an exorbitant number of runs To overcome the drawbacks of the product array Welch, Wu, Kang and Sacks ( 1990 ), Shoemaker, Tsui and Wu ( 1991 ) and Montgomery ( 1991a ) proposed the use of combined arrays, where the control factors and noise factors are combined in a single array. In this paper we study the concept of combined array for an intermediate class of designs where n = 1 (mod4), n = 2 (mod4) and n = 3 (mod4). The designs presented in this paper, though not orthogonal, offer a great reduction in the run-size.     

Some adjusted orthogonal,variance balanced,multidimensional block designs

A multidimensional block design (MBD) is an experimental design with d > 1 blocking criteria geometrically represented as a d-dimensional lattice with treatment varieties assigned to some or all nodes of the lattice. Intrablock analysis of variance tables for some special classes of two- and three-dimensional block designs with some empty nodes are given. Design plans and efficiencies for 31 two-dimensional designs, each universally optimal in defined classes of designs, and 7 three-dimensional designs, each nearly optimal in defined classes of designs, are listed in the appendices. A need for such designs is apparent when the blocking criteria are implemented successively and empty nodes do not represent wasted experimental units.     

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.     

2<Superscript><Emphasis Type="Italic">m</Emphasis></Superscript>4<Superscript>1</Superscript> designs with minimum aberration or weak minimum aberration

For measuring the goodness of 2 ^m 4¹ designs, Wu and Zhang (1993) proposed the minimum aberration (MA) criterion. MA 2 ^m 4¹ designs have been constructed using the idea of complementary designs when the number of two-level factors, m, exceeds n/2, where n is the total number of runs. In this paper, the structures of MA 2 ^m 4¹ designs are obtained when m>5n/16. Based on these structures, some methods are developed for constructing MA 2 ^m 4¹ designs for 5n/16<m<n/2 as well as for n/2≤m<n. When m≤5n/16, there is no general method for constructing MA 2 ^m 4¹ designs. In this case, we obtain lower bounds for A ₃₀ and A ₃₁, where A ₃₀ and A ₃₁ are the numbers of type 0 and type 1 words with length three respectively. And a method for constructing weak minimum aberration (WMA) 2 ^m 4¹ designs (A ₃₀ and A ₃₁ achieving the lower bounds) is demonstrated. Some MA or WMA 2 ^m 4¹ designs with 32 or 64 runs are tabulated for practical use, which supplement the tables in Wu and Zhang (1993), Zhang and Shao (2001) and Mukerjee and Wu (2001).     

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.     

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.