Related papers: Testing Coverage Functions
We investigate uniqueness problems for an entire function that shares two small functions of finite order with their difference operators. In particular, we give a generalization of a result in $[2]$.
In the paper a construction of central elements in $U(\mathfrak{o}_N)$ and $U(\mathfrak{g}_2)$ based on invariant theory is given. New function of matrix elements that appear in description of the center of $U(\mathfrak{g}_2)$ are defined.
Motivated by questions arising in the study of the spectral theory of models of aperiodic order, we investigate sums of functions of semibounded closed subsets of the real line. We show that under suitable thickness assumptions on the sets…
Function graphs are graphs representable by intersections of continuous real-valued functions on the interval [0,1] and are known to be exactly the complements of comparability graphs. As such they are recognizable in polynomial time.…
The goal of unbounded program verification is to discover an inductive invariant that safely over-approximates all possible program behaviors. Functional languages featuring higher order and recursive functions become more popular due to…
The idea behind universal coating is to have a thin layer of a specific substance covering an object of any shape so that one can measure a certain condition (like temperature or cracks) at any spot on the surface of the object without…
We study unitary property testing, where a quantum algorithm is given query access to a black-box unitary and has to decide whether it satisfies some property. In addition to containing the standard quantum query complexity model (where the…
We study the problem of generating a test sequence that achieves maximal coverage for a reactive system under test. We formulate the problem as a repeated game between the tester and the system, where the system state space is partitioned…
We characterize the inclusions of weighted classes of entire functions in terms of the defining weights resp. weight systems. First we treat weights defined in terms of a so-called associated weight function where the weight(system) is…
The paper reports on computation of verified enclosures for the Titchmarsh-Weyl m-function. It examines some cases in which Lohner's AWA algorithm must be suplimented by mathematical analysis.
Some aspects of the result of applying unit resolution on a CNF formula can be formalized as functions with domain a set of partial truth assignments. We are interested in two ways for computing such functions, depending on whether the…
This paper examines performance evaluation criteria for basic vision tasks involving sets of objects namely, object detection, instance-level segmentation and multi-object tracking. The rankings of algorithms by an existing criterion can…
In submodular covering problems, we are given a monotone, nonnegative submodular function $f: 2^N \rightarrow\mathbb{R}_+$ and wish to find the min-cost set $S\subseteq N$ such that $f(S)=f(N)$. This captures SetCover when $f$ is a coverage…
Testing software is often costly due to the need of mass-producing test cases and providing a test oracle for it. This is often referred to as the oracle problem. One method that has been proposed in order to alleviate the oracle problem is…
Automated theorem provers (ATPs) can disprove conjectures by saturating a set of clauses, but the resulting saturated sets are opaque certificates. In the unit equational fragment, a saturated set can in fact be read as a convergent rewrite…
We study functional clones, which are sets of non-negative pseudo-Boolean functions (functions $\{0,1\}^k\to\mathbb{R}_{\geq 0}$) closed under (essentially) multiplication, summation and limits. Functional clones naturally form a lattice…
We study filters in the partition lattice formed by restricting to partitions by type. The M\"obius function is determined in terms of the easier-to-compute descent set statistics on permutations and the M\"obius function of filters in the…
Given a posimodular function $f: 2^V \to \mathbb{R}$ on a finite set $V$, we consider the problem of finding a nonempty subset $X$ of $V$ that minimizes $f(X)$. Posimodular functions often arise in combinatorial optimization such as…
The relative performance of competing point forecasts is usually measured in terms of loss or scoring functions. It is widely accepted that these scoring function should be strictly consistent in the sense that the expected score is…
Optical Coherence Tomography (OCT) has become an indispensable tool for investigating mesoscopic features in soft matter and fluid mechanics. Its ability to provide high-resolution, non-invasive measurements in both spatial and temporal…