Related papers: Examination of saturation coverage of short polyme…
Given a set of samples, a few of them being possibly saturated, we propose an efficient algorithm in order to cancel saturation while reconstructing band-limited signals. Our method satisfies a minimum-loss constraint and relies on…
We discuss the adsorption of semiflexible polymers to a planar attractive wall and focus on the questions of the adsorption threshold for polymers of {\it finite} length and their loop and tail distributions using both Monte-Carlo…
We study the problem of aggregating polygons by covering them with disjoint representative regions, thereby inducing a clustering of the polygons. Our objective is to minimize a weighted sum of the total area and the total perimeter of the…
The subject of this work is the adsorption transition of a long flexible self-avoiding polymer chain onto a rigid thin rod. The rod is represented by a cylinder of radius R with a short-ranged attractive surface potential for the chain…
Randomized algorithms can be used to speed up the analysis of large datasets. In this paper, we develop a unified methodology for statistical inference via randomized sketching or projections in two of the most fundamental problems in…
DNA data storage systems encode digital data into DNA strands, enabling dense and durable storage. Efficient data retrieval depends on coverage depth, a key performance metric. We study the random access coverage depth problem and focus on…
We prove two tight bounds on the behavior of a model of self-assembling particles introduced by Dabby and Chen (SODA 2013), called insertion systems, where monomers insert themselves into the middle of a growing linear polymer. First, we…
We develop Monte Carlo simulations for uniformly charged polymers and machine learning algorithm to interpret the intra-polymer structure factor of the charged polymer system, which can be obtained from small-angle scattering experiments.…
An active system consisting of many self-spinning dimers is simulated, and a distinct local rotational jamming transition is observed as the density increases. In the low density regime, the system stays in an absorbing state, in which each…
We consider set covering problems where the underlying set system satisfies a particular replacement property w.r.t. a given partial order on the elements: Whenever a set is in the set system then a set stemming from it via the replacement…
We study several variations of line segment covering problem with axis-parallel unit squares in $I\!\!R^2$. A set $S$ of $n$ line segments is given. The objective is to find the minimum number of axis-parallel unit squares which cover at…
The irreversible adsorption of polymers to a two-dimensional solid surface is studied. An operator formalism is introduced for chemisorption from a polydisperse solution of polymers which transforms the analysis of the adsorption process to…
Kernel ridge regression (KRR), also known as the least-squares support vector machine, is a fundamental method for learning functions from finite samples. While most existing analyses focus on the noisy setting with constant-level label…
Achieving the very special condition of perfect absorption (PA) in a complex scattering enclosure promises to enable a wealth of applications in secure communication, precision sensing, wireless power transfer, analog signal processing and…
The acoustic properties of a porous sheet of medium resistivity backed by a rigid plate in which are embedded a periodic set of circular inclusions is investigated. Such a structure behaves like a multi-component diffraction gratings.…
The problem of imaging extended targets (sources or scatterers) is formulated in the framework of compressed sensing with emphasis on subwavelength resolution. The proposed formulation of the problems of inverse source/scattering is…
We resolve the space complexity of single-pass streaming algorithms for approximating the classic set cover problem. For finding an $\alpha$-approximate set cover (for any $\alpha= o(\sqrt{n})$) using a single-pass streaming algorithm, we…
The structure of flexible polymers endgrafted in cylindrical pores of diameter D is studied as a function of chain length N and grafting density \sigma, assuming good solvent conditions. A phenomenological scaling theory, describing the…
We consider the reversible random sequential adsorption of line segments on a one-dimensional lattice. Line segments of length $l \geq 2$ adsorb on the lattice with a adsorption rate $K_a$, and leave with a desorption rate $K_d$. We…
We investigate fully asynchronous unsourced random access (URA), and propose a high-performing scheme that employs on-off division multiple access (ODMA). In this scheme, active users distribute their data over the transmit block based on a…