On E(s)-optimal supersaturated designs

A popular measure to assess 2-level supersaturated designs is the E(s²)$E(s^2)$ criterion. In this paper, improved lower bounds on E(s²)$E(s^2)$ are obtained. The same improvement has recently been established by Ryan and Bulutoglu [2007. E(s²)$E(s^2)$-optimal supersaturated designs with good minimax properties. J. Statist. Plann. Inference 137, 2250–2262]. However, our analysis provides more details on precisely when an improvement is possible, which is lacking in Ryan and Bulutoglu [2007. E(s²)$E(s^2)$-optimal supersaturated designs with good minimax properties. J. Statist. Plann. Inference 137, 2250–2262]. The equivalence of the bounds obtained by Butler et al. [2001. A general method of constructing E(s²)$E(s^2)$-optimal supersaturated designs. J. Roy. Statist. Soc. B 63, 621–632] (in the cases where their result applies) and those obtained by Bulutoglu and Cheng [2004. Construction of E(s²)$E(s^2)$-optimal supersaturated designs. Ann. Statist. 32, 1662–1678] is established. We also give two simple methods of constructing E(s²)$E(s^2)$-optimal designs.     

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.     

A general construction of E(fNOD)-optimal multi-level supersaturated designs

The present paper deals with E(f_NOD)-optimal multi-level supersaturated designs. We present a new technique for the construction of supplementary difference sets. Based on the new supplementary difference sets, we also provide E(f_NOD)-optimal multi-level supersaturated designs with a large number of columns when compared with other designs. Moreover, these designs retain the equal occurrence property.     

Search designs for 2m factorials derived from balanced arrays of strength 2(l+1) and ad-optimal search designs

We consider a search design for the 2^m type such that at most knonnegative effects can be searched among (l+1)-factor interactions and estimated along with the effects up to l- factor interactions, provided (l+1)-factor and higher order interactions are negligible except for the k effects. We investigate some properties of a search design which is yielded by a balanced 2^m design of resolution 2l+1 derived from a balanced array of strength 2(l+1). A necessary and sufficient condition for the balanced design of resolution 2l+1 to be a search design for k=1 is given. Optimal search designs for k=1 in the class of the balanced 2^m designs of resolution V (l=2), with respect to the AD-optimality criterion given by Srivastava (1977), with N assemblies are also presented, where the range of (m,N) is (m=6; 28≤N≤41), (m=7; 35≤N≤63) and (m=8; 44≤N≤74).     

On the robustness of the optimum balanced 2m factorial designs of resolution v (given by Srivastava and Chopra) in the presence of outliers

In this paper we study the sensitivity of the optimum balanced resolution V plans for 2^m factorials, to outliers, using the measure suggested by Box and Drapper (1975). We observe that the designs are robust, i.e., have low sensitivity.     

A note on the estimation of the integral of ⨍2(x)

The estimation of $\text{γ=∫}{}^{\mathrm{\infty }}{}_{\mathrm{?\infty }}\text{?}{}^2\text{(x)dx}$, important in nonparametric inference, is discussed. Methods, based on either density estimators or on the lengths of nonparametric confidence intervals, are compared. We conclude that density type estimators have advantages over the estimators based on confidence intervals.