Related papers: Precise algorithm to generate random sequential ad…
In this note, we develop a novel algorithm for generating random numbers from a distribution with a probability density function proportional to $\sin^k(x)$, $x \in (0,\pi)$ and $k \geq 1$. Our algorithm is highly efficient and is based on…
With a novel 3D discrete-element method specially developed with adhesive contact mechanics, random loose packings of uniform spherical micron-sized particles are fully investigated. The results show that large velocity, large size or weak…
The densest amorphous packing of rigid particles is known as random close packing. It has long been appreciated that higher densities are achieved by using collections of particles with a variety of sizes. The variety of sizes is often…
Let A be a matrix, c be any linear objective function and x be a fractional vector, say an LP solution to some discrete optimization problem. Then a recurring task in theoretical computer science (and in approximation algorithms in…
With the aim of generalizing histogram statistics to higher dimensional cases, density estimation via discrepancy based sequential partition (DSP) has been proposed to learn an adaptive piecewise constant approximation defined on a binary…
This thesis concerns sequential-access data compression, i.e., by algorithms that read the input one or more times from beginning to end. In one chapter we consider adaptive prefix coding, for which we must read the input character by…
In this paper we study the hard sphere packing problem in the Hamming space by the cavity method. We show that both the replica symmetric and the replica symmetry breaking approximations give maximum rates of packing that are asymptotically…
Recently, a class of algorithms combining classical fixed point iterations with repeated random sparsification of approximate solution vectors has been successfully applied to eigenproblems with matrices as large as $10^{108} \times…
A nonlinear saturation mechanism for reversed shear Alfven eigenmode (RSAE) is proposed and analysed, and is shown to be of relevance to typical reactor parameter region. The saturation is achieved through the generation of high-frequency…
We develop a model to describe the properties of random assemblies of polydisperse hard spheres. We show that the key features to describe the system are (i) the dependence between the free volume of a sphere and the various coordination…
Supervised dimensionality reduction strategies have been of great interest. However, current supervised dimensionality reduction approaches are difficult to scale for situations characterized by large datasets given the high computational…
Widefield stochastic microscopy techniques such as PALM or STORM rely on the progressive accumulation of a large number of frames, each containing a scarce number of super-resolved point images. We justify that the redundancy in the…
The set of 2-dimensional packing problems builds an important class of optimization problems and Strip Packing together with 2-dimensional Bin Packing and 2-dimensional Knapsack is one of the most famous of these problems. Given a set of…
Motivated by the philosophy and phenomenal success of compressed sensing, the problem of reconstructing a matrix from a sampling of its entries has attracted much attention recently. Such a problem can be viewed as an information-theoretic…
We develop a behavioural theory of reflective sequential algorithms (RSAs), i.e. sequential algorithms that can modify their own behaviour. The theory comprises a set of language-independent postulates defining the class of RSAs, an…
Using computed x-ray tomography we determine the three dimensional (3d) structure of binary hard sphere mixtures as a function of composition and size ratio of the particles, q. Using a recently introduced four-point correlation function we…
We consider a random sequential adsorption process on the one-dimensional lattice with nearest-neighbor exclusion. In this model, each site $s \in \mathbb{Z}$ starts empty and we will try to occupy it in time $t_s$, where…
Online contention resolution schemes (OCRSs) are effective rounding techniques for online stochastic combinatorial optimization problems. These schemes randomly and sequentially round a fractional solution to a relaxed problem that can be…
Superballs represent a class of particles whose shapes are defined by ${|x|}^{2p}+{|y|}^{2p}+{|z|}^{2p} \le R^{2p}$, with $p\in(0,\infty)$ being the "deformation parameter". $0<p<0.5$ represents a family of hexapodlike (concave…
In the classic circle packing problem, one asks whether a given set of circles can be packed into a given container. Packing problems like this have been shown to be $\mathsf{NP}$-hard. In this paper, we present new sufficient conditions…