On recursive construction for balanced incomplete block designs with nested rows and columns

This paper presents a recursive method for the construction of balanced incomplete block designs with nested rows and columns.     

Multi-level k-circulant Supersaturated Designs

In this paper we present a new method for constructing multi-level supersaturated designs with n rows, m columns and the equal occurrence property. We investigate the existence of multi-level supersaturated designs using a single generator vector and its k-cyclic permutations as rows. We find the conditions needed, in order this vector to generate a balanced supersaturated design. These conditions are simplified for the case of three level supersaturated designs. By using the proposed method three level supersaturated designs are constructed and explored. Moreover, many new, optimal and near optimal, multi-level supersaturated designs are provided as well.     

SomeE andMV-optimal row-column designs having equal numbers of rows and columns

In this paper we consider experimental situations in whichv treatments are to be tested using a row-column design consisting ofb columns andb rows and wherev does not divideb ². Some sufficient conditions are obtained for a design to beE orMV-optimal in such an experimental setting and methods for constructing row-column designs satisfying the sufficient conditions obtained are also given. This research was supported by NSF Grant No. DMS-8401943.     

On the construction of trend free row-column 2-level factorial experiments

In this paper we consider experimental situations where a complete or fractional factorial experiment having all factors at 2 levels is to be conducted using a 2 ^m × 2 ⁿ row-column design and where there may be an unknown trend effect that can be expressed as a polynomial function of the position in which observations are obtained in the row-column design. Methods are given for allocating the treatments from a complete or fractional 2-level factorial experiment to rows and columns so that the resulting design yields estimates for main effects that have a high level of resistance against trend effects. Research supported by NSF Grant No. DMS-8700945.     

Nested balancedN-ary designs

Nested balancedn-ary designs are introduced. Some methods of construction of such designs are presented with some series of designs.     

A relationship between efficiencies of marginal designs and the product design

We derive theD- andG-efficiencies of product designs in a multifactor experiment in terms of theD- andG-efficiencies of the designs in the marginal models. Work supported by grants Ku 719/2 and 477/645/96 of the Deutsche Forschungsgemeinschaft     

A note on the robustness of Box-Behnken designs to the unavailability of data

Box-Behnken designs and central composite designs are efficient designs for fitting second order polynomials to response surfaces, because they use relatively small numbers of observations to estimate the parameters. In this paper we investigate the robustness of Box-Behnken designs to the unavailability of observations, in the sense of finding t _max , the maximum number of arbitrary rows in the design matrix that can be removed and still leave all of the parameters of interest estimable. The results are compared to the known results for the central composite designs found in MacEachern, Notz, Whittinghill & Zhu (1995). The blocked Box-Behnken designs are equally as robust as those that are not blocked. Received December 1997     

A Lower Bound for the Centered <Emphasis Type="Italic">L</Emphasis><Subscript>2</Subscript>-Discrepancy on Asymmetric Factorials and its Application

The role of uniformity measured by the centered L ₂-discrepancy (Hickernell 1998a) has been studied in fractional factorial designs. The issue of a lower bound for the centered L ₂-discrepancy is crucial in the construction of uniform designs. Fang and Mukerjee (2000) and Fang et al. (2002, 2003b) derived lower bounds for fractions of two- and three-level factorials. In this paper we report some new lower bounds for the centered L ₂-discrepancy for a set of asymmetric fraction factorials. Using these lower bounds helps to measure uniformity of a given design. In addition, as an application of these lower bounds, we propose a method to construct uniform designs or nearly uniform designs with asymmetric factorials.     

Choice of optimal initial designs in sequential experiments

Combined-optimal designs (Li and Lin, 2003) are obviously the best choices for the initial designs if we partition the experiment into two parts with equal size to obtain some information about the process, especially for the case not considering the blocking factor. In this paper, the definition of combined-optimal design is extended to the case when blocking factor is significant, and this new class of designs is called blocked combined-optimal designs. Some general results are obtained which relate 2^k−p_III initial designs with their complementary designs when , where n=2^k−p. By applying these results, we are able to characterize 2^k−p_III combined-optimal designs or blocked combined-optimal designs in terms of their complementary designs. It is also proved that both 2^k−p_III combined-optimal and blocked combined-optimal designs are not minimum aberration designs when and n−1−k > 2. And some combined-optimal and blocked combined-optimal designs with 16 and 32 runs are constructed for illustration. 2000 Mathematics Subject Classifications: 62K15, 62K05     

On Minimally-supported <Emphasis Type="Italic">D</Emphasis>-optimal Designs for Polynomial Regression with Log-concave Weight Function

This paper studies minimally-supported D-optimal designs for polynomial regression model with logarithmically concave (log-concave) weight functions. Many commonly used weight functions in the design literature are log-concave. For example, and exp(−x ²) in Theorem 2.3.2 of Fedorov (Theory of optimal experiments, 1972) are all log-concave. We show that the determinant of information matrix of minimally-supported design is a log-concave function of ordered support points and the D-optimal design is unique. Therefore, the numerically D-optimal designs can be constructed efficiently by cyclic exchange algorithm.     

Optimal variance- and efficiency-balanced designs for one- and two-way elimination of heterogeneity

Summary In this paper, a series ofE-optimal non-binary variance balanced (block or row-column) designs and a series ofE-optimal non-binary efficiency balanced (block or row-column) designs are provided in certain broad classes of competing designs. Furthermore, their high efficiencies by the usualA- andD-optimality criteria are shown.     

On exact D-optimal designs with 2 two-level factors and n autocorrelated observations

In this paper we consider the exact D-optimal designs for estimation of the unknown parameters in the two factors, each at only two-level, main effects model with autocorrelated errors. The vector of the n random errors in the observed responses is assumed to follow a first-order autoregressive model (AR(1)). The exact D-optimal designs seek the optimal combinations of the design levels as well as the optimal run orders, so that the determinant of the information matrix of BLUEs for the unknown parameters is maximized. Bora-Senta and Moyssiadis (1999) gave some conjectures about the exact D-optimal designs based on their experience of several exhaustive searches. In this paper their conjectures are partially proved to be true.Received: January 2003 / Accepted: October 2003Partially supported by the National Science Council of Taiwan, R.O.C. under grant NSC 91-2115-M-008-013.Supported in part by the National Science Council of Taiwan, R.O.C. under grant NSC 89-2118-M-110-003.     

Optimal contest design under reverse-lottery technology

In this paper, we study effort-maximizing contest design under the “reverse” nested lottery contest model of Fu et al. (2014) — which is the “mirror image” of the conventional nested lottery contest of Clark and Riis (1996). We show that under the reverse-lottery technology, a single-stage winner-take-all grand contest dominates all other feasible designs when the contest is sufficiently noisy. This result is in dramatic contrast to the conventional wisdom on the optimality of multistage elimination contests that is grounded under the conventional nested lottery contest technology in the literature. In the framework of a noisy-performance ranking model, the conventional and reverse models differ only in the noise on players’ performance. Our study therefore reveals the important role that the noise term plays in modeling imperfectly discriminatory contests.     

18-run nonisomorphic three level orthogonal arrays

In this paper we construct all possible orthogonal arrays OA(18,q, 3,2) with 18 runs and 3 ≤ q ≤ 7 columns and present those that are nonisomorphic. A discussion on the novelty and the superiority of many of the designs found in terms of isomorphism and generalized minimum aberration has been made.      

Eight-run two-level factorial designs under dependence

Dependent observations commonly arise in factorial experiments. Apart from main-effects two-level designs formed by the Cheng & Steinberg reverse foldover algorithm, which are known to be very efficient designs under dependence using the D-criterion, little is known about other designs, models and criteria, and the range of possible behaviour. In this paper, we investigate in detail 8-run two-level designs. Received February 1998     

Nonregular designs from Hadamard matrices and their estimation capacity

Deng and Tang (1999) proposed the generalized minimum aberration (GMA) criterion to assess fractional factorial designs, and a design with GMA is often regarded as the best. However, there exist situations where some other designs may suit practical needs better. In this article, we propose an algorithm to sequentially examine designs obtained from Hadamard matrices under estimation capacity (EC) and provide designs with maximum or high EC for various combinations of run-size and number-of-factors. The usefulness of maximum or high EC designs is discussed.2000 Mathematics Subject Classification: 62K15, 05B20.Acknowledgements The research of Yingfu Li is supported by a Faculty Research Support Fund through the School of Science and Computer Engineering, University of Houston - Clear Lake. The authors are very grateful to the editor and two referees for their helpful comments that have led to the improvement of the paper.     

Optimality and efficiency of small chessboard designs for correlated errors

Optimal p × q row–column designs are obtained via complete enumeration of all possible designs for two treatments in some fixed effects models with errors specified by a doubly geometric covariance structure. This is done, in part, by a computer search, for a finite set of sizes of the correlation coefficients and in cases where p and q are small enough to make such a search feasible.     

A note on the uniform distribution on the arcsin points

In his book Pukelsheim [8] pointed out that designs supported at the arcsin points are very efficient for the statistical inference in a polynomial regression model. In this note we determine the canonical moments of a class of distributions which have nearly equal weights at the arcsin points. The class contains theD-optimal arcsin support design and theD ₁-optimal design for a polynomial regression. The results allow explicit representations ofD-, andD ₁-efficiencies of these designs in all polynomial models with a degree less than the number of support points of the design.     

$${\phi_p}$$-optimal designs for a linear log contrast model for experiments with mixtures

A mixture experiment is an experiment in which the k ingredients are nonnegative and subject to the simplex restriction on the (k − 1)-dimensional probability simplex S ^k-1. In this work, an essentially complete class of designs under the Kiefer ordering for a linear log contrast model with a mixture experiment is presented. Based on the completeness result, -optimal designs for all p,−∞ ≤ p ≤ 1 including D- and A-optimal are obtained, where the eigenvalues of the design moment matrix are used. By using the approach presented here, we gain insight on how these -optimal designs behave. Mong-Na Lo Huang was supported in part by the National Science Council of Taiwan, ROC under grant NSC 93-2118-M-110-001.