Related papers: A complementary design theory for doubling
We develop two analytic approaches to solve D-optimal approximate designs under generalized linear models. The first approach provides analytic D-optimal allocations for generalized linear models with two factors, which include as a special…
Define the middle layer graph as the graph whose vertex set consists of all bitstrings of length $2n+1$ that have exactly $n$ or $n+1$ entries equal to 1, with an edge between any two vertices for which the corresponding bitstrings differ…
Feature selection has attracted significant attention in data mining and machine learning in the past decades. Many existing feature selection methods eliminate redundancy by measuring pairwise inter-correlation of features, whereas the…
We give some new explicit examples of putatively optimal projective spherical designs. i.e., ones for which there is numerical evidence that they are of minimal size. These form continuous families, and so have little apparent symmetry in…
Standard optimality criteria (e.g. A-, D-optimality criterion, etc.) have been commonly used for obtaining optimal designs. For a given statistical model, standard criteria assume the error variance is known at the design stage. However, in…
This paper investigates the connections between combinatorial design theory and the creation of new forms of poetry through a specific combinatorial structure called Steiner triple systems. We introduce five original poems constructed using…
Wu [10] proposed a method for constructing two-level supersaturated designs by using a Hadamard design with n runs and n-1 columns as a staring design and by supplementing it with two-column interactions, as long as they are partially…
Legendre discovered that the continued fraction expansion of $\sqrt N$ having odd period leads directly to an explicit representation of $N$ as the sum of two squares. In this vein, it was recently observed that the continued fraction…
In this article, an adaption of an algorithm for the creation of experimental designs by Lekivetz and Jones (2015) is suggested, dealing with constraints around randomization. Split-plot design of experiments is used, when the levels of…
We demonstrate that a modification of the classical index calculus algorithm can be used to factor integers. More generally, we reduce the factoring problem to finding an overdetermined system of multiplicative relations in any factor base…
New types of designs called nested space-filling designs have been proposed for conducting multiple computer experiments with different levels of accuracy. In this article, we develop several approaches to constructing such designs. The…
This work presents several new results concerning the analysis of the convergence of binary, univariate, and linear subdivision schemes, all related to the {\it contractivity factor} of a convergent scheme. First, we prove that a convergent…
Linear complementary dual (LCD) codes can provide an optimum linear coding solution for the two-user binary adder channel. LCD codes also can be used to against side-channel attacks and fault non-invasive attacks. Let $d_{LCD}(n, k)$ denote…
The construction of self-dual codes over small fields such that their minimum distances are as large as possible is a long-standing challenging problem in the coding theory. In 2009, a family of binary self-dual cyclic codes with lengths…
We consider the problem of obtaining D-optimal designs for factorial experiments with a binary response and $k$ qualitative factors each at two levels. We obtain a characterization for a design to be locally D-optimal. Based on this…
We introduce and investigate binary $(k,k)$-designs -- combinatorial structures which are related to binary orthogonal arrays. We derive general linear programming bound and propose as a consequence a universal bound on the minimum possible…
This is the first paper that provides a systematic treatment of the $r$-dimensional PTE problem in additive number theory, abbreviated by PTE$_r$, through its connection with combinatorial design theory, the branch of combinatorial…
The concept of formal duality was proposed by Cohn, Kumar and Sch\"urmann, which reflects a remarkable symmetry among energy-minimizing periodic configurations. This formal duality was later translated into a purely combinatorial property…
Pseudo-geometric designs are combinatorial designs which share the same parameters as a finite geometry design, but which are not isomorphic to that design. As far as we know, many pseudo-geometric designs have been constructed by the…
One of the very first results about designs over finite fields, by S. Thomas, is the existence of a cyclic 2-$(n,3,7)$ design over $\mathbb{F}_{2}$ for every integer $n$ coprime with 6. Here, by means of difference methods, we reprove and…