Related papers: Leader Election And Local Identifiers For 3D Progr…
We investigate the steady-state organisation of active particles residing on an interface. Particle activity induces interface deformations, while the local shape of the interface guides particle movement. We consider multiple species of…
Optically addressable spin defects are excellent candidate platform for quantum sensing and quantum network. Nuclear spins coupled to color centers naturally enable long lived quantum memories and local qubits registers. To fully leverage…
In the calculation of thermodynamic properties and three dimensional structures of macromolecules, such as proteins, it is important to have a good algorithm for computing solvent accessible surface area of macromolecules. Here we propose a…
An election is a pair $(C,V)$ of candidates and voters. Each vote is a ranking (permutation) of the candidates. An election is $d$-Euclidean if there is an embedding of both candidates and voters into $\mathbb{R}^d$ such that voter $v$…
Keeping a vehicle well-localized within a prebuilt-map is at the core of any autonomous vehicle navigation system. In this work, we show that both standard SIR sampling and rejection-based optimal sampling are suitable for efficient (10 to…
Clustering has become an increasingly important task in analysing huge amounts of data. Traditional applications require that all data has to be located at the site where it is scrutinized. Nowadays, large amounts of heterogeneous, complex…
This paper studies the problem of decentralized continuum deformation coordination of multi-agent systems aided by cooperative localization. We treat agents as particles inside a triangular continuum (deformable body) in a2-D motion space…
Quantum computing can be realized with numerous different hardware platforms and computational protocols. A highly promising approach to foster scalability is to apply a photonic platform combined with a measurement-induced quantum…
The broad applicability of Quadratic Unconstrained Binary Optimization (QUBO) constitutes a general-purpose modeling framework for combinatorial optimization problems and are a required format for gate array and quantum annealing computers.…
We investigate algorithmic control of a large swarm of mobile particles (such as robots, sensors, or building material) that move in a 2D workspace using a global input signal (such as gravity or a magnetic field). We show that a maze of…
Postulating that spacetime is discrete, we assume that physical space is described by a 3-dimensional cubic lattice.The corresponding symmetry group of rotations has order 24 and motivates the introduction of a cubic shaped graph with 27…
Clustering is one of the major tasks in data mining. In the last few years, Clustering of spatial data has received a lot of research attention. Spatial databases are components of many advanced information systems like geographic…
A novel hybrid design based electronic voting system is proposed, implemented and analyzed. The proposed system uses two voter verification techniques to give better results in comparison to single identification based systems. Finger print…
We examine nanoparticles (NPs) forming polyhedral sections of the ideal cubic lattice, simple (sc), body centered (bcc), and face centered (fcc) cubic, which are confined by facets characterized by densest and second densest {h k l}…
Online data assimilation in time series models over a large spatial extent is an important problem in both geosciences and robotics. Such models are intrinsically high-dimensional, rendering traditional particle filter algorithms…
Diffusion-Limited Aggregation (DLA) is a cluster-growth model that consists in a set of particles that are sequentially aggregated over a two-dimensional grid. In this paper, we introduce a biased version of the DLA model, in which…
In a digital quantum simulator, basic two-qubit interactions are manipulated by means of fast local control operations to establish a desired target Hamiltonian. Here we consider a quantum simulator based on logical systems, i.e. where…
A linear-time algorithm is presented for the construction of the Gibbs distribution of configurations in the Ising model, on a quantum computer. The algorithm is designed so that each run provides one configuration with a quantum…
Our main contribution is the introduction of the map of elections framework. A map of elections consists of three main elements: (1) a dataset of elections (i.e., collections of ordinal votes over given sets of candidates), (2) a way of…
In this paper, a new iterative two-level algorithm is presented for solving the finite element discretization for nonsymmetric or indefinite elliptic problems. The iterative two-level algorithm uses the same coarse space as the traditional…