Related papers: Line-Recovery by Programmable Particles
We present design and implementation of a chain of particles that can be programmed to fold the chain into a given curve. The particles guide an external force to fold, therefore the particles are simple and amenable for miniaturization. A…
We present here a semi-analytical solution of the problem of particle acceleration at non-linear shock waves with a free escape boundary at some location upstream. This solution, besides allowing us to determine the spectrum of particles…
Suppose a graph $G$ is stochastically created by uniformly sampling vertices along a line segment and connecting each pair of vertices with a probability that is a known decreasing function of their distance. We ask if it is possible to…
This paper provides an analysis of the linearized inverse problem in multifrequency electrical impedance tomography. We consider an isotropic conductivity distribution with a finite number of unknown inclusions with different frequency…
Imagine coating buildings and bridges with smart particles (also coined smart paint) that monitor structural integrity and sense and report on traffic and wind loads, leading to technology that could do such inspection jobs faster and…
Solution and analysis of mathematical programming problems may be simplified when these problems are symmetric under appropriate linear transformations. In particular, a knowledge of the symmetries may help reduce the problem dimension, cut…
The alternating direction method of multipliers within a shape optimization framework is developed for solving geometric inverse problems, focusing on a cavity identification problem from the perspective of non-destructive testing and…
Reliance on external localization infrastructure and centralized coordination are main limiting factors for formation flying of vehicles in large numbers and in unprepared environments. While solutions using onboard localization address the…
Leader election is a fundamental problem in distributed computing, particularly within programmable matter systems, where coordination among simple computational entities is crucial for solving complex tasks. In these systems, particles…
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…
Starting with far field data of time-harmonic acoustic or electromagnetic waves radiated by a collection of compactly supported sources in two-dimensional free space, we develop criteria and algorithms for the recovery of the far field…
This paper concerns a fast, one-step iterative technique of imaging extended perfectly conducting cracks with Dirichlet boundary condition. In order to reconstruct the shape of cracks from scattered field data measured at the boundary, we…
In the \emph{trace reconstruction problem}, an unknown source string $x \in \{0,1\}^n$ is transmitted through a probabilistic \emph{deletion channel} which independently deletes each bit with some fixed probability $\delta$ and concatenates…
The restoration lemma by Afek, Bremler-Barr, Kaplan, Cohen, and Merritt [Dist. Comp. '02] proves that, in an undirected unweighted graph, any replacement shortest path avoiding a failing edge can be expressed as the concatenation of two…
The task of establishing correspondences between two 3D shapes is a long-standing challenge in computer vision. While numerous studies address full-full and partial-full 3D shape matching, only a limited number of works have explored the…
It is well known that the modulus of the far-field pattern (or phaseless far-field pattern) is invariant under translations of the scattering obstacle if only one plane wave is used as the incident field, so the shape but not the location…
Many forms of programmable matter have been proposed for various tasks. We use an abstract model of self-organizing particle systems for programmable matter which could be used for a variety of applications, including smart paint and…
We provide details on the implementation of a machine-learning based particle flow algorithm for CMS. The standard particle flow algorithm reconstructs stable particles based on calorimeter clusters and tracks to provide a global event…
A numerical framework based on network partition and operator splitting is developed to solve nonlinear differential equations of large-scale dynamic processes encountered in physics, chemistry and biology. Under the assumption that those…
We propose a multi-objective global pattern search algorithm for the task of locating and quantifying damage in flexible mechanical structures. This is achieved by identifying eigenfrequencies and eigenmodes from measurements and matching…