Related papers: SHA-1 and the Strict Avalanche Criterion
Approximate Bayesian computation (ABC) is a widely used inference method in Bayesian statistics to bypass the point-wise computation of the likelihood. In this paper we develop theoretical bounds for the distance between the statistics used…
Security Assurance Cases (SAC) are a form of structured argumentation used to reason about the security properties of a system. After the successful adoption of assurance cases for safety, SACs are getting significant traction in recent…
We consider the problem of shared randomness-assisted multiple access channel (MAC) simulation for product inputs and characterize the one-shot communication cost region via almost-matching inner and outer bounds in terms of the smooth…
Clustering algorithms are fundamental tools across many fields, with density-based methods offering particular advantages in identifying arbitrarily shaped clusters and handling noise. However, their effectiveness is often limited by the…
Cryptographic hash functions for calculating the message digest of a message has been in practical use as an effective measure to maintain message integrity since a few decades. This message digest is unique, irreversible and avoids all…
The Swift AGN and Cluster Survey (SACS) uses 125 deg^2 of Swift XRT serendipitous fields with variable depths surrounding gamma-ray bursts to provide a medium depth (4e-15 erg/s/cm^2) and area survey filling the gap between deep, narrow…
We investigate the possible accuracy that can be reached by analytical models for the matter density power spectrum and correlation function. Using a realistic description of the power spectrum that combines perturbation theory with a halo…
We study the maximum information gain that an adversary may obtain through hacking without being detected. Consider a dynamical process observed by a sensor that transmits a local estimate of the system state to a remote estimator according…
We present an experimental study of the influence of quenched disorder on the distribution of flux avalanches in type-II superconductors. In the presence of much quenched disorder, the avalanche sizes are power-law distributed and show…
We present a new variable-length computation-friendly encoding scheme, named SFDC (Succinct Format with Direct aCcesibility), that supports direct and fast accessibility to any element of the compressed sequence and achieves compression…
Denial Constraint (DC) is a well-established formalism that captures a wide range of integrity constraints commonly encountered, including candidate keys, functional dependencies, and ordering constraints, among others. Given their…
We develop an analytic model for the hierarchical correlation amplitudes S_j(R)= \bxi_j(R)/\bxi_2^{j-1}(R) of density peaks and dark matter halos in the quasi-linear regime. The statistical distribution of density peaks and dark matter…
We document a connection between constraint reasoning and probabilistic reasoning. We present an algorithm, called {em probabilistic arc consistency}, which is both a generalization of a well known algorithm for arc consistency used in…
We present here a status update on the ASCA Hard Serendipitous Survey (HSS), a survey program conducted in the 2-10 keV energy band. In particular we discuss the number-flux relationship, the 2-10 keV spectral properties of the sources and…
Software composition analysis (SCA) denotes the process of identifying open-source software components in an input software application. SCA has been extensively developed and adopted by academia and industry. However, we notice that the…
In real-world applications, observations are often constrained to a small fraction of a system. Such spatial subsampling can be caused by the inaccessibility or the sheer size of the system, and cannot be overcome by longer sampling.…
While classical chaos is defined via a system's sensitive dependence on its initial conditions (SDIC), this notion does not directly extend to quantum systems. Instead, recent works have established defining both quantum and classical chaos…
Clustering short text embeddings is a foundational task in natural language processing, yet remains challenging due to the need to specify the number of clusters in advance. We introduce a scalable spectral method that estimates the number…
When data is scarce or mistakes are costly, average-case metrics fall short. What a practitioner needs is a guarantee: with probability at least $1-\delta$, the learned policy is $\varepsilon$-close to optimal after $N$ episodes. This is…
In high dimensional percolation at parameter $p < p_c$, the one-arm probability $\pi_p(n)$ is known to decay exponentially on scale $(p_c - p)^{-1/2}$. We show the same statement for the ratio $\pi_p(n) / \pi_{p_c}(n)$, establishing a form…