Related papers: An Algorithm for Verifying Some Norm Identities in…
We present a novel and well automatable approach to formal verification of C programs with underspecified semantics, i.e., a language semantics that leaves open the order of certain evaluations. First, we reduce this problem to…
Neural networks are ubiquitous. However, they are often sensitive to small input changes. Hence, to prevent unexpected behavior in safety-critical applications, their formal verification -- a notoriously hard problem -- is necessary. Many…
We study properties of Cartesian products of digital images for which adjacencies based on the normal product adjacency are used. We show that the use of such adjacencies lets us obtain many "product properties" for which the analogous…
Local robustness verification can verify that a neural network is robust wrt. any perturbation to a specific input within a certain distance. We call this distance Robustness Radius. We observe that the robustness radii of correctly…
An identity involving symmetric sums of regularized multiple zeta-star values of harmonic type was proved by Hoffman. In this paper, we prove an identity of shuffle type. We use Bell polynomials appearing in the study of set partitions to…
Subsampling algorithms are a natural approach to reduce data size before fitting models on massive datasets. In recent years, several works have proposed methods for subsampling rows from a data matrix while maintaining relevant information…
We generalize Menon's identity by considering sums representing arithmetical functions of several variables. As an application, we give a formula for the number of cyclic subgroups of the direct product of several cyclic groups of arbitrary…
We study spaces of realisations of linkages (weighted graphs) whose underlying graph is a series parallel graph. In particular, we describe an algorithm for determining whether or not such spaces are connected.
The purposes of this work are to construct a class of homogeneous vertex representations of $C_l^{(1)} \ (l\geq2)$, and to derive a series of product-sum identities. These identities have fine interpretation in number theory.
Testing remains the primary method to evaluate the accuracy of neural network perception systems. Prior work on the formal verification of neural network perception models has been limited to notions of local adversarial robustness for…
We propose sublinear algorithms for probabilistic testing of the discrete and continuous Fr\'echet distance - a standard similarity measure for curves. We assume the algorithm is given access to the input curves via a query oracle: a query…
We consider online strategies for discriminating between symmetric pure states with zero error when $n$ copies of the states are provided. Optimized online strategies involve local, possibly adaptive measurements on each copy and are…
Binary classification is widely used in ML production systems. Monitoring classifiers in a constrained event space is well known. However, real world production systems often lack the ground truth these methods require. Privacy concerns may…
Two types of finite series of products of harmonic numbers involving nonnegative integer powers are evaluated, also yielding two other important harmonic number identities. The recursion formulas for these sums are derived, which are easily…
A first step in exploring population structure in crop plants and other organisms is to define the number of subpopulations that exist for a given data set. The genetic marker data sets being generated have become increasingly large over…
This paper presents a novel application to detect counterfeit identity documents forged by a scan-printing operation. Texture analysis approaches are proposed to extract validation features from security background that is usually printed…
Homomorphic encryption, which enables the execution of arithmetic operations directly on ciphertexts, is a promising solution for protecting privacy of cloud-delegated computations on sensitive data. However, the correctness of the…
Runtime Verification deals with the question of whether a run of a system adheres to its specification. This paper studies runtime verification in the presence of partial knowledge about the observed run, particularly where input values may…
Aligning partially overlapping point sets where there is no prior information about the value of the transformation is a challenging problem in computer vision. To achieve this goal, we first reduce the objective of the robust point…
In applied probability, the normal approximation is often used for the distribution of data with assumed additive structure. This tradition is based on the central limit theorem for sums of (independent) random variables. However, it is…