Results 271 to 280 of about 64,724 (310)
Some of the next articles are maybe not open access.

Compound Orthogonal Arrays

Technometrics, 1999
Compound orthogonal arrays have recently been introduced as an alternative to Taguchi's direct product arrays for studying location and dispersion effects simultaneously. In this article, we provide a catalog of two-level compound orthogonal arrays for parameters of most practical interest. The arrays presented possess the maximum possible strength for
A. S. Hedayat, John Stufken
openaire   +1 more source

Column-orthogonal strong orthogonal arrays and sliced strong orthogonal arrays

Statistica Sinica, 2015
A strong orthogonal array of strength t can achieve uniformity on finer grids when projected onto any g dimensions for any g less than t. It can be regarded as a kind of uniform space-filling design. Meanwhile, orthogonality is also desir- able for space-filling designs.
Haiyan Liu, Min-Qian Liu
openaire   +1 more source

Nearly orthogonal arrays mappable into fully orthogonal arrays

Biometrika, 2014
We develop a method for construction of arrays which are nearly orthogonal, in the sense that each column is orthogonal to a large proportion of the other columns, and which are convertible to fully orthogonal arrays via a mapping of the symbols in each column to a possibly smaller set of symbols.
Rahul Mukerjee, Fasheng Sun, Boxin Tang
openaire   +2 more sources

On Distance Distributions of Orthogonal Arrays

Problems of Information Transmission, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Incomplete orthogonal arrays and idempotent orthogonal arrays

Graphs and Combinatorics, 1996
The author introduces a notion of idempotency of orthogonal arrays (OA) of index unity, and the notion of incomplete OA. Denote by \(\text{OA}_\lambda(t,r,s)\) an array with \(r\) rows and \(\lambda s^t\) columns, with entries taken from an \(s\)-set \(E\), such that in each set of \(t\) rows every \(t\)-tuple of entries occurs precisely \(\lambda ...
openaire   +1 more source

On Covering Radius of Orthogonal Arrays

2020 Algebraic and Combinatorial Coding Theory (ACCT), 2020
We obtain analytically upper bounds for the covering radius of orthogonal arrays (OAs) by investigations of the set of all feasible distance distributions of the corresponding OAs. We apply a procedure for reduction of the possible distance distributions of OA to improve the bound by 1 under certain assumptions.
Silvia P. Boumova   +2 more
openaire   +1 more source

On Construction of Mappable Nearly Orthogonal Arrays with Column-Orthogonality

Communications in Mathematics and Statistics, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Haiyan Liu   +3 more
openaire   +2 more sources

Constructions of Nested Orthogonal Arrays

Journal of Combinatorial Designs, 2013
AbstractA symmetric nested orthogonal array, denoted by NOA, is an OA which contains an OA as a subarray, where . Nested orthogonal arrays are useful in designing an experimental setup consisting of two experiments, the expensive one of higher accuracy being nested in a relatively less expensive one of lower accuracy.
Wang, Kun, Li, Yang
openaire   +2 more sources

On the construction of orthogonal arrays

2001
Summary: The geometric representation of an orthogonal array is obtained using finite analytic projective geometry of the Galois field \(\text{GF}(s)\) of \(t\) dimensions, which can be denoted by \(\text{PG}(t, s)\), where \(s\) is a prime or a power of a prime number. We give relations between the parameters of orthogonal arrays and properties of the
BAYRAK, Hülya, ALHAN, Aslıhan
openaire   +2 more sources

A new approach in constructing orthogonal and nearly orthogonal arrays

Metrika, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ma, Chang-Xing   +2 more
openaire   +1 more source

Home - About - Disclaimer - Privacy