The decomposability of simple orthogonal arrays
نویسنده
چکیده
It is well-known that all orthogonal arrays of the form OA(N, t+1, 2, t) are decomposable into λ orthogonal arrays of strength t and index 1. While the same is not generally true when s = 3, we will show that all simple orthogonal arrays of the form OA(N, t + 1, 3, t) are also decomposable into orthogonal arrays of strength t and index 1.
منابع مشابه
β-galactosidase Production by Aspergillus niger ATCC 9142 Using Inexpensive Substrates in Solid-State Fermentation: Optimization by Orthogonal Arrays Design
Background: Enzymatic hydrolysis of lactose is one of the most important biotechnological processes in the food industry, which is accomplished by enzyme β-galactosidase (β-gal, β-D-galactoside galactohydrolase, EC 3.2.1.23), trivial called lactase. Orthogonal arrays design is an appropriate option for the optimization of biotechnological processes for the production of microbial...
متن کاملAn Algorithm for Constructing Orthogonal and Nearly-Orthogonal Arrays With Mixed Levels and Small Runs
Orthogonal arrays are used widely in manufacturing and high-technology industries for quality and productivity improvement experiments. For reasons of run size economy or flexibility, nearly orthogonal arrays are also used. The construction of orthogonal or nearly orthogonal arrays can be quite challenging. Most existing methods are complex and produce limited types of arrays. This article desc...
متن کاملEulerian Polynomials as Moments, via Exponential Riordan Arrays
Using the theory of exponential Riordan arrays and orthogonal polynomials, we demonstrate that the Eulerian polynomials and the shifted Eulerian polynomials are moment sequences for a simple family of orthogonal polynomials. The coefficient arrays of these families of orthogonal polynomials are shown to be exponential Riordan arrays. Using the theory of orthogonal polynomials we are then able t...
متن کاملA Simple Method for Constructing Orthogonal Arrays By the Kronecker Sum
In this article, we propose a new general approach to constructing asymmetrical orthogonal arrays, namely the Kronecker sum. It is interesting since a lot of new mixed-level orthogonal arrays can be obtained by this method.
متن کاملA Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...
متن کامل