Related papers: Optimal BIBD-extended designs
In \cite{shi2022few-weight}, Shi and Li studied $\mathcal{C}_D$-codes over the ring $\mathcal{R}:=\mathbb{F}_2[x,y]/\langle x^2, y^2, xy-yx\rangle$ and their binary Gray images, where $D$ is derived using certain simplicial complexes. We…
We study point-block incidence structures $(\mathcal{P},\mathcal{B})$ for which the point set $\mathcal{P}$ is an $m\times n$ grid. Cameron and the fourth author showed that each block $B$ may be viewed as a subgraph of a complete bipartite…
A class of nonlinear models combining a pharmacokinetic compartmental model and a pharmacodynamic Emax model is introduced. The locally D-optimal (LD) design for a four-parameter composed model is found to be a saturated four-point uniform…
Computing the exact optimal experimental design has been a longstanding challenge in various scientific fields. This problem, when formulated using a specific information function, becomes a mixed-integer nonlinear programming (MINLP)…
We establish a general theory of optimality for block bootstrap distribution estimation for sample quantiles under a mild strong mixing assumption. In contrast to existing results, we study the block bootstrap for varying numbers of blocks.…
The Stepped Wedge Design (SWD) is a form of cluster randomized trial, usually comparing two treatments, which is divided into time periods and sequences, with clusters allocated to sequences. Typically all sequences start with the standard…
A new [48,16,16] optimal linear binary block code is given. To get this code a general construction is used which is also described in this paper. The construction of this new code settles an conjecture mentioned in a 2008 paper by Janosov…
We efficiently solve the optimal multi-dimensional mechanism design problem for independent bidders with arbitrary demand constraints when either the number of bidders is a constant or the number of items is a constant. In the first…
Given a combinatorial design $\mathcal{D}$ with block set $\mathcal{B}$, the block-intersection graph (BIG) of $\mathcal{D}$ is the graph that has $\mathcal{B}$ as its vertex set, where two vertices $B_{1} \in \mathcal{B}$ and $B_{2} \in…
The problem of graphical model selection is to correctly estimate the graph structure of a Markov random field given samples from the underlying distribution. We analyze the information-theoretic limitations of the problem of graph…
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…
We show an interesting PBD-closure result for the set of lengths of constant-composition codes whose distance and size meet certain conditions. A consequence of this PBD-closure result is that the size of optimal constant-composition codes…
Complex orthogonal design (COD) with parameter $[p, n, k]$ is a combinatorial design used in space-time block codes (STBCs). For STBC, $n$ is the number of antennas, $k/p$ is the rate, and $p$ is the decoding delay. A class of rate $1/2$…
Consider an experiment consisting of a set of independent trials for comparing a set of treatments. In each trial, one treatment is chosen and the mean response of the trial is equal to the effect of the chosen treatment. We examine the…
In this paper we study a certain generalization of combinatorial designs related to almost difference sets, namely the $t$-adesign, which was coined by Cunsheng Ding in 2015. It is clear that $2$-adesigns are a kind of partially balanced…
The subject of this work is multiple group random coefficients regression models with several treatments and one control group. Such models are often used for studies with cluster randomized trials. We investigate A-, D- and E-optimal…
We present new refinement heuristics for the balanced graph partitioning problem that break with an age-old rule. Traditionally, local search only permits moves that keep the block sizes balanced (below a size constraint). In this work, we…
Systems with both quantitative and qualitative responses are widely encountered in many applications. Design of experiment methods are needed when experiments are conducted to study such systems. Classic experimental design methods are…
Beyond-planarity focuses on combinatorial properties of classes of non-planar graphs that allow for representations satisfying certain local geometric or topological constraints on their edge crossings. Beside the study of a specific graph…
Lifted maximum rank distance (MRD) codes, which are constant dimension codes, are considered. It is shown that a lifted MRD code can be represented in such a way that it forms a block design known as a transversal design. A slightly…