Lower bound of average centered L2-discrepancy for U-type designs

Uniform designs are widely used in various scientific investigations and industrial applications. By considering all possible level permutation of the factors, a connection between average centered L₂-discrepancy and generalized wordlength pattern for asymmetrical fractional factorial designs is derived. Moreover, we present new lower bounds to the average centered L₂-discrepancy for symmetrical and asymmetrical U-type designs. For illustration of the theoretical results, the lower bounds for symmetrical and asymmetrical U-type designs are tabulated, and numerical results indicate that our lower bounds behave well and can be recommended for use in practice.     

A new look on optimal foldover plans in terms of uniformity criteria

In this paper, we develop a new mechanism for finding the optimal foldover plans (OFPs) which is based on the uniformity criteria measured by Lee discrepancy, wrap-around L₂-discrepancy, and centered L₂-discrepancy. For three-level fractional factorials as the original designs, general foldover plans and combined designs are defined, and lower bounds of these three discrepancies of combined designs under general foldover plans are also obtained, which can be used as benchmarks for searching OFPs. Illustrative examples with a comparison study between the foldover plans under these discrepancies are provided. Our results provide a theoretical justification for OFPs of three-level designs in terms of uniformity criteria.     

Minimum aberration majorization in non-isomorphic saturated designs

In this paper we propose a new criterion, minimum aberration majorization, for comparing non-isomorphic saturated designs. This criterion is based on the generalized word-length pattern proposed by Ma and Fang (Metrika 53 (2001) 85) and Xu and Wu (Ann. Statist. 29 (2001) 1066) and majorization theory. The criterion has been successfully applied to check non-isomorphism and rank order saturated designs. Examples are given through five non-isomorphic L₁₆(2¹⁵) designs and two L₂₇(3¹³) designs.     

Robust designs for experiments with blocks

ABSTRACT

For experiments running in field plots or over time, the observations are often correlated due to spatial or serial correlation, which leads to correlated errors in a linear model analyzing the treatment means. Without knowing the exact correlation matrix of the errors, it is not possible to compute the generalized least-squares estimator for the treatment means and use it to construct optimal designs for the experiments. In this paper, we propose to use neighborhoods to model the covariance matrix of the errors, and apply a modified generalized least-squares estimator to construct robust designs for experiments with blocks. A minimax design criterion is investigated, and a simulated annealing algorithm is developed to find robust designs. We have derived several theoretical results, and representative examples are presented.     

Optimal blocking and foldover plans for nonregular two-level designs

This paper discusses the issue of choosing optimal designs when both blocking and foldover techniques are simultaneously employed to nonregular two-level fractional factorial designs. By using the indicator function, the treatment and block generalized wordlength patterns of the combined blocked design under a general foldover plan are defined. Some general properties of combined block designs are also obtained. Our results extend the findings of Ai et al. (2010) from regular designs to nonregular designs. Based on these theoretical results, a catalog of optimal blocking and foldover plans in terms of the generalized aberration criterion for nonregular initial design with 12, 16 and 20 runs is tabulated, respectively.     

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.     

Generalized Youden designs: construction and tables

Generalized Youden Designs are generalizations of the class of two-way balanced block designs which include Latin squares and Youden squares. They are used for the same purposes and in the same way that these classical designs are used, and satisfy most of the common criteria of design optimality.We explicitly display or give detailed instructions for constructing all these designs within a practical range: when υ, the number of treatments, is ?25; and b₁ and b₂, the dimensions of the design array, are each ?50.     

A new extension strategy on three-level factorials under wrap-around L2-discrepancy

Sequential experiment is an indispensable strategy and is applied immensely to various fields of science and engineering. In such experiments, it is desirable that a given design should retain the properties as much as possible when few runs are added to it. The designs based on sequential experiment strategy are called extended designs. In this paper, we have studied theoretical properties of such experimental strategies using uniformity measure. We have also derived a lower bound of extended designs under wrap-around L₂-discrepancy measure. Moreover, we have provided an algorithm to construct uniform (or nearly uniform) extended designs. For ease of understanding, some examples are also presented and a lot of sequential strategies for a 27-run original design are tabulated for practice.     

Lower bounds of the wrap-around -discrepancy and relationships between MLHD and uniform design with a large size

The wrap-around (WD) L₂-discrepancy has been commonly used in experimental designs. In this paper, some lower bounds of the WD L₂-discrepancy for asymmetrical U-type designs are given and the expectation and variance of midpoint Latin hypercube designs (LHD) are also obtained. Relationships between midpoint LHD and uniform designs for symmetrical and asymmetrical cases are discussed in the sense of comparing the lower bound and the expectation of squared wrap-around L₂-discrepancy of U-type designs. Some comparisons between simple random sampling and the lower bounds of U-type designs are given.     

Generalized neighbor designs with block size 3

A generalized neighbor design relaxes the equality condition on the number of times two treatments as neighbors in the design. In this article, we have considered the construction of some classes of generalized neighbor designs with block size k=3 by using the method of cyclic shifts. The distinguishing feature of this construction method is that the properties of a design can easily be obtained from the sets of shifts instead of constructing the actual blocks of the design. A catalog of generalized neighbor designs with block size k=3 is compiled for v∈{5,6,…,18} treatments and for different replications. We provide the reader with a simpler method of construction, and in general the catalog that gives an open choice to the experimenter for selecting any class of neighbor designs.     

Optimal designs for approximating the path of a stochastic process

We consider a centered stochastic process {X(t):t ∈ T} with known and continuous covariance function. On the basis of observations X(t₁), …, X(t_n) we approximate the whole path by orthogonal projection and measure the performance of the chosen design d = (t₁, …, t_n)′ by the corresponding mean squared L²-distance. For covariance functions on T² = [0, 1]², which satisfy a generalized Sacks-Ylvisaker regularity condition of order zero, we construct asymptotically optimal sequences of designs. Moreover, we characterize the achievement of a lower error bound, given by Micchelli and Wahba (1981), and study the question of whether this bound can be attained.     

Optimal block designs comparing treatments with a control when the errors are correlated

The efficient design of experiments for comparing a control with v new treatments when the data are dependent is investigated. We concentrate on generalized least-squares estimation for a known covariance structure. We consider block sizes k equal to 3 or 4 and approximate designs. This method may lead to exact optimal designs for some v, b, k, but usually will only indicate the structure of an efficient design for any particular v, b, k, and yield an efficiency bound, usually unattainable. The bound and the structure can then be used to investigate efficient finite designs.     

Generalized Bhaskar Rao designs

Generalized Bhaskar Rao designs with non-zero elements from an abelian group G are constructed. In particular this paper shows that the necessary conditions are sufficient for the existence of generalized Bhaskar Rao designs with k=3 for the following groups: ?G? is odd, G=Z^r₂, and G=Z^r₂×H where 3? ?H? and r?1. It also constructs generalized Bhaskar Rao designs with υ=k, which is equivalent to υ rows of a generalized Hadamard matrix of order n where υ?n.     

Randomization of neighbour balanced generalized Youden designs

If a crossover design with more than two treatments is carryover balanced, then the usual randomization of experimental units and periods would destroy the neighbour structure of the design. As an alternative, Bailey [1985. Restricted randomization for neighbour-balanced designs. Statist. Decisions Suppl. 2, 237–248] considered randomization of experimental units and of treatment labels, which leaves the neighbour structure intact. She has shown that, if there are no carryover effects, this randomization validates the row–column model, provided the starting design is a generalized Latin square. We extend this result to generalized Youden designs where either the number of experimental units is a multiple of the number of treatments or the number of periods is equal to the number of treatments. For the situation when there are carryover effects we show for so-called totally balanced designs that the variance of the estimates of treatment differences does not change in the presence of carryover effects, while the estimated variance of this estimate becomes conservative.     

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.     

Lower Bounds on the Symmetric L 2-Discrepancy and Their Application

The role of uniformity measured by the symmetric L ₂-discrepancy given in Hickernell (1998 Hickernell , F. J. (1998). A generalized discrepancy and quadrature error bound. Math. Computat. 67:299–322.[Crossref], [Web of Science ®] , [Google Scholar]) has been studied in fractional factorial designs. The issue of lower bounds on the symmetric L ₂-discrepancy is crucial in the construction of uniform designs. This article reports some new lower bounds on the symmetric L ₂-discrepancy for symmetric fractional factorials and for a set of asymmetric fractional factorials. It is valuable to use these lower bounds to measure uniformity of given designs.     

Some theory and practical uses of trimmed L-moments

Trimmed L-moments, defined by Elamir and Seheult [2003. Trimmed L-moments. Comput. Statist. Data Anal. 43, 299–314], summarize the shape of probability distributions or data samples in a way that remains viable for heavy-tailed distributions, even those for which the mean may not exist. We derive some further theoretical results concerning trimmed L-moments: a relation with the expansion of the quantile function as a weighted sum of Jacobi polynomials; the bounds that must be satisfied by trimmed L-moments; recurrences between trimmed L-moments with different degrees of trimming; and the asymptotic distributions of sample estimators of trimmed L-moments. We also give examples of how trimmed L-moments can be used, analogously to L-moments, in the analysis of heavy-tailed data. Examples include identification of distributions using a trimmed L-moment ratio diagram, shape parameter estimation for the generalized Pareto distribution, and fitting generalized Pareto distributions to a heavy-tailed data sample of computer network traffic.     

ON CONSTRUCTION OF GENERALIZED GROUP DIVISIBLE DESIGNS WITH TWO GROUPS

ABSTRACT

Many simple and general methods of construction, using α-resolvable balanced incomplete block designs, for generalized group divisible designs with two groups (GGDD(2)) are given. The E-optimality of all constructed designs is also discussed.     

Some new lower bounds to various discrepancies on combined designs

The foldover is a useful technique in construction of two-level factorial designs. A foldover design is the follow-up experiment generated by reversing the sign(s) of one or more factors in the initial design. The full design obtained by joining the runs in the foldover design to those of the initial design is called the combined design. In this article, some new lower bounds of various discrepancies of combined designs, such as the centered, symmetric, and wrap-around L₂-discrepancies, are obtained, which can be used as a better benchmark for searching optimal foldover plans. Our results provide a theoretical justification for optimal foldover plans in terms of uniformity criterion.