103,355 research outputs found
A new and flexible method for constructing designs for computer experiments
We develop a new method for constructing "good" designs for computer
experiments. The method derives its power from its basic structure that builds
large designs using small designs. We specialize the method for the
construction of orthogonal Latin hypercubes and obtain many results along the
way. In terms of run sizes, the existence problem of orthogonal Latin
hypercubes is completely solved. We also present an explicit result showing how
large orthogonal Latin hypercubes can be constructed using small orthogonal
Latin hypercubes. Another appealing feature of our method is that it can easily
be adapted to construct other designs; we examine how to make use of the method
to construct nearly orthogonal and cascading Latin hypercubes.Comment: Published in at http://dx.doi.org/10.1214/09-AOS757 the Annals of
Statistics (http://www.imstat.org/aos/) by the Institute of Mathematical
Statistics (http://www.imstat.org
Some Constructions for Amicable Orthogonal Designs
Hadamard matrices, orthogonal designs and amicable orthogonal designs have a
number of applications in coding theory, cryptography, wireless network
communication and so on. Product designs were introduced by Robinson in order
to construct orthogonal designs especially full orthogonal designs (no zero
entries) with maximum number of variables for some orders. He constructed
product designs of orders , and and types and ,
respectively. In this paper, we first show that there does not exist any
product design of order , , and type where the notation is used to show that repeats
times. Then, following the Holzmann and Kharaghani's methods, we construct some
classes of disjoint and some classes of full amicable orthogonal designs, and
we obtain an infinite class of full amicable orthogonal designs. Moreover, a
full amicable orthogonal design of order and type is constructed.Comment: 12 pages, To appear in the Australasian Journal of Combinatoric
Decomposition tables for experiments I. A chain of randomizations
One aspect of evaluating the design for an experiment is the discovery of the
relationships between subspaces of the data space. Initially we establish the
notation and methods for evaluating an experiment with a single randomization.
Starting with two structures, or orthogonal decompositions of the data space,
we describe how to combine them to form the overall decomposition for a
single-randomization experiment that is ``structure balanced.'' The
relationships between the two structures are characterized using efficiency
factors. The decomposition is encapsulated in a decomposition table. Then, for
experiments that involve multiple randomizations forming a chain, we take
several structures that pairwise are structure balanced and combine them to
establish the form of the orthogonal decomposition for the experiment. In
particular, it is proven that the properties of the design for such an
experiment are derived in a straightforward manner from those of the individual
designs. We show how to formulate an extended decomposition table giving the
sources of variation, their relationships and their degrees of freedom, so that
competing designs can be evaluated.Comment: Published in at http://dx.doi.org/10.1214/09-AOS717 the Annals of
Statistics (http://www.imstat.org/aos/) by the Institute of Mathematical
Statistics (http://www.imstat.org
Complete enumeration of two-Level orthogonal arrays of strength with constraints
Enumerating nonisomorphic orthogonal arrays is an important, yet very
difficult, problem. Although orthogonal arrays with a specified set of
parameters have been enumerated in a number of cases, general results are
extremely rare. In this paper, we provide a complete solution to enumerating
nonisomorphic two-level orthogonal arrays of strength with
constraints for any and any run size . Our results not only
give the number of nonisomorphic orthogonal arrays for given and , but
also provide a systematic way of explicitly constructing these arrays. Our
approach to the problem is to make use of the recently developed theory of
-characteristics for fractional factorial designs. Besides the general
theoretical results, the paper presents some results from applications of the
theory to orthogonal arrays of strength two, three and four.Comment: Published at http://dx.doi.org/10.1214/009053606000001325 in the
Annals of Statistics (http://www.imstat.org/aos/) by the Institute of
Mathematical Statistics (http://www.imstat.org
On construction of optimal mixed-level supersaturated designs
Supersaturated design (SSD) has received much recent interest because of its
potential in factor screening experiments. In this paper, we provide equivalent
conditions for two columns to be fully aliased and consequently propose methods
for constructing - and -optimal mixed-level SSDs
without fully aliased columns, via equidistant designs and difference matrices.
The methods can be easily performed and many new optimal mixed-level SSDs have
been obtained. Furthermore, it is proved that the nonorthogonality between
columns of the resulting design is well controlled by the source designs. A
rather complete list of newly generated optimal mixed-level SSDs are tabulated
for practical use.Comment: Published in at http://dx.doi.org/10.1214/11-AOS877 the Annals of
Statistics (http://www.imstat.org/aos/) by the Institute of Mathematical
Statistics (http://www.imstat.org
- …