Related papers: New plans orthogonal through the block factor
The component-by-component construction is the standard method of finding good lattice rules or polynomial lattice rules for numerical integration. Several authors have reported that in numerical experiments the generating vector sometimes…
In this paper we present algorithms for collective construction systems in which a large number of autonomous mobile robots trans- port modular building elements to construct a desired structure. We focus on building block structures…
In this paper we extend the polynomial time integration framework to include exponential integration for both partitioned and unpartitioned initial value problems. We then demonstrate the utility of the exponential polynomial framework by…
Fractional factorial designs are widely used for designing screening experiments. Nonregular fractional factorial designs can have better properties than regular designs, but their construction is challenging. Current research on the…
We describe fast algorithms for approximating the connection coefficients between a family of orthogonal polynomials and another family with a polynomially or rationally modified measure. The connection coefficients are computed via…
Recent researches on designs for computer experiments with both qualitative and quantitative factors have advocated the use of marginally coupled designs. This paper proposes a general method of constructing such designs for which the…
We determine the probability, structure dependent, that the block Wiedemann algorithm correctly computes leading invariant factors. This leads to a tight lower bound for the probability, structure independent. We show, using block size…
Let G = (V, E) be a planar triangulated graph (PTG) having every face triangular. A rectilinear dual or an orthogonal floor plan (OFP) of G is obtained by partitioning a rectangle into \mid V \mid rectilinear regions (modules) where two…
In this paper we study the behavior of the fractions of a factorial design under permutations of the factor levels. We focus on the notion of regular fraction and we introduce methods to check whether a given symmetric orthogonal array can…
The obvious way to construct a GDD (group-divisible design) recursively is to use Wilson's Fundamental Construction for GDDs (WFC). Then a PBD (pairwise balanced design) is often obtained by adding a new point to each group of the GDD.…
We show how to use the method of orthogonal polynomials for integrating, in the planar approximation, the partition function of one-matrix models with a potential with even or odd vertices, or any combination of them.
A collection of subroutines and examples of their uses, as well as the underlying numerical methods, are described for generating orthogonal polynomials relative to arbitrary weight functions. The object of these routines is to produce the…
In this paper, we give algorithms and methods of construction of self-dual codes over finite fields using orthogonal matrices. Randomization in the orthogonal group, and code extension are the main tools. Some optimal, almost MDS, and MDS…
Constrained orthogonal polynomials have been recently introduced in the study of the Hohenberg-Kohn functional to provide basis functions satisfying particle number conservation for an expansion of the particle density. More generally, we…
We present a new application of multi-orbit cyclic subspace codes to construct large optical orthogonal codes, with the aid of the multiplicative structure of finite fields extensions. This approach is different from earlier approaches…
Orthogonal Arrays allow us to test various levels of each factor and balance the different factors so that we can estimate interactions as well as first order effects. There is a trade-off between how well we can sample different levels of…
We present a geometric interpretation of the integration-by-parts formula on an arbitrary vector bundle. As an application we give a new geometric formulation of higher-order variational calculus.
Orthogonal Fractional Factorial Designs and in particular Orthogonal Arrays are frequently used in many fields of application, including medicine, engineering and agriculture. In this paper we present a methodology and an algorithm to find…
Orthogonal minimally aliased response surface (OMARS) designs permit the study of quantitative factors at three levels using an economical number of runs. In these designs, the linear effects of the factors are neither aliased with each…
Factorial clustering methods have been developed in recent years thanks to the improving of computational power. These methods perform a linear transformation of data and a clustering on transformed data optimizing a common criterion.…