Results 1  10
of
128,523
On the decomposistion of orthogonal arrays
, 1999
"... When an orthogonal array is projected on a small number of factors, as is done in screening experiments, the question of interest is the structure of the projected design, by which we mean its decomposition in terms of smaller arrays of the same strength. In this paper we investigate the decompositi ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
When an orthogonal array is projected on a small number of factors, as is done in screening experiments, the question of interest is the structure of the projected design, by which we mean its decomposition in terms of smaller arrays of the same strength. In this paper we investigate
Orthogonal arrays of strength 3 and small run sizes
 J. Stat. Plann. Infer
"... Abstract. All mixed (or asymmetric) orthogonal arrays of strength 3 with run size at most 64 are determined. 1. ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Abstract. All mixed (or asymmetric) orthogonal arrays of strength 3 with run size at most 64 are determined. 1.
On Construction Of Orthogonal And Nearly Orthogonal Arrays
"... In the past orthogonal arrays were constructed by a number of mathematical tools such as orthogonal Latin squares, Hadamard matrices, group theory and finite fields. Wang and Wu (1992) proposed the concept of nearly orthogonal array and found a number of nearly orthogonal arrays with high efficiency ..."
Abstract
 Add to MetaCart
In the past orthogonal arrays were constructed by a number of mathematical tools such as orthogonal Latin squares, Hadamard matrices, group theory and finite fields. Wang and Wu (1992) proposed the concept of nearly orthogonal array and found a number of nearly orthogonal arrays with high
Orthogonal Arrays of Strength 3
, 1996
"... A new construction for orthogonal arrays of strength 3 is given. 1 Introduction An orthogonal array of size N , degree k, order s and strength t is a k by N array with entries from a set of s 2 symbols, having the property that in every t by N subarray, every t by 1 column array appears the same n ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
A new construction for orthogonal arrays of strength 3 is given. 1 Introduction An orthogonal array of size N , degree k, order s and strength t is a k by N array with entries from a set of s 2 symbols, having the property that in every t by N subarray, every t by 1 column array appears the same
AN ALGORITHMIC APPROACH TO CONSTRUCTING ORTHOGONAL AND NEARORTHOGONAL ARRAYS∗
, 2006
"... Due to run size constraints, nearorthogonal arrays (nearOAs) and supersaturated designs, a special case of nearOA, are considered good alternatives to OAs. This paper shows (i) a combinatorial relationship between a mixedlevel array and a nonresolvable incomplete block design (IBD) with varyin ..."
Abstract
 Add to MetaCart
Due to run size constraints, nearorthogonal arrays (nearOAs) and supersaturated designs, a special case of nearOA, are considered good alternatives to OAs. This paper shows (i) a combinatorial relationship between a mixedlevel array and a nonresolvable incomplete block design (IBD
ON THE CONSTRUCTION OF ORTHOGONAL ARRAYS
"... In this study, the geometric representation of an Orthogonal Array is obtained using ¯nite analytic projective geometry of the Galois ¯eld GF(s) of tdimensions, which can be denoted by PG(t; s), where s is a prime or a power of a prime number. We give relations between the parameters of Orthogonal ..."
Abstract
 Add to MetaCart
In this study, the geometric representation of an Orthogonal Array is obtained using ¯nite analytic projective geometry of the Galois ¯eld GF(s) of tdimensions, which can be denoted by PG(t; s), where s is a prime or a power of a prime number. We give relations between the parameters of Orthogonal
The Lattice of NRun Orthogonal Arrays
, 2000
"... If the number of runs in a (mixedlevel) orthogonal array of strength 2 is specified, what numbers of levels and factors are possible? The collection of possible sets of parameters for orthogonal arrays with N runs has a natural lattice structure, induced by the "expansive replacement" con ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
" construction method. In particular the dual atoms in this lattice are the most important parameter sets, since any other parameter set for an Nrun orthogonal array can be constructed from them. To get a sense for the number of dual atoms, and to begin to understand the lattice as a function of N , we
Orthogonally Persistent Object Systems
 VLDB JOURNAL
, 1995
"... Persistent Application Systems (PASs) are of increasing social and economic importance. They have the potential to be longlived, concurrently accessed and consist of large bodies of data and programs. Typical examples of PASs are CAD/CAM systems, office automation, CASE tools, software engineer ..."
Abstract

Cited by 156 (26 self)
 Add to MetaCart
engineering environments and patientcare support systems in hospitals. Orthogonally persistent object systems are intended to provide improved support for the design, construction, maintenance and operation of PASs. The persistence abstraction allows the creation and manipulation of data in a manner
Equivalence of Decoupling Schemes and Orthogonal Arrays
, 2004
"... We consider the problem of switching off unwanted interactions in a given multipartite Hamiltonian. This is known to be an important primitive in quantum information processing and several schemes have been presented in the literature to achieve this task. A method to construct decoupling schemes fo ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
for quantum systems of pairwise interacting qubits was introduced by M. Stollsteimer and G. Mahler and is based on orthogonal arrays. Another approach based on triples of Hadamard matrices that are closed under pointwise multiplication was proposed by D. Leung. In this paper, we show that both methods lead
Results 1  10
of
128,523