Related papers: Tolerance to Asynchrony in Algorithms for Multipli…
Synchronization phenomena have been recently reported in the quantum realm at atomic level due to collective dissipation. In this work we propose a dimer lattice of trapped atoms realizing a dissipative spin model where quantum…
We give in this paper a convergence result concerning parallel asynchronous algorithm with bounded delays to solve a nonlinear fixed point problems. This result is applied to calculate the solution of a strongly monotone operator. Special…
We propose a methodology for automatic generation of divide-and-conquer parallel implementations of sequential nested loops. We focus on a class of loops that traverse read-only multidimensional collections (lists or arrays) and compute a…
A lattice is a set of all the integer linear combinations of certain linearly independent vectors. One of the most important concepts on lattice is the successive minima which is of vital importance from both theoretical and practical…
We propose and analyze magnetic traps and lattices for electrons in semiconductors. We provide a general theoretical framework and show that thermally stable traps can be generated by magnetically driving the particle's internal spin…
We introduce LAMP: the Linear Additive Markov Process. Transitions in LAMP may be influenced by states visited in the distant history of the process, but unlike higher-order Markov processes, LAMP retains an efficient parametrization. LAMP…
The Simplex tableau has been broadly used and investigated in the industry and academia. With the advent of the big data era, ever larger problems are posed to be solved in ever larger machines whose architecture type did not exist in the…
Since the spatially extended periodic parity-time (PT) symmetric potential can possess certain unique properties compared to a single PT cell (with only a pair of coupled gain-loss components), various schemes have been proposed to realize…
We show that the threshold of complete synchronization in a lattice of coupled non-smooth chaotic maps is determined by linear stability along the directions transversal to the synchronization subspace. As a result, the numerically…
It has been recently observed that the dynamical properties of mass action systems arising from many models of biochemical reaction networks can be derived by considering the corresponding properties of a related generalized mass action…
We study fully synchronized (coherent) states in complex networks of chaotic oscillators, reviewing the analytical approach of determining the stability conditions for synchronizability and comparing them with numerical criteria. As an…
The emergence of synchronization in a network of coupled oscillators is a fascinating topic in various scientific disciplines. A coupled oscillator network is characterized by a population of heterogeneous oscillators and a graph describing…
Numerical analysis for linear constant-coefficients Finite Difference schemes was developed approximately fifty years ago. It relies on the assumption of scheme stability and in particular -- for the $L^2$ setting -- on the absence of…
Furthering our understanding of many of today's interesting problems in plasma physics---including plasma based acceleration and magnetic reconnection with pair production due to quantum electrodynamic effects---requires large-scale kinetic…
In this paper we analyze, evaluate, and improve the performance of training generalized linear models on modern CPUs. We start with a state-of-the-art asynchronous parallel training algorithm, identify system-level performance bottlenecks,…
Concurrent synchronization is a regime where diverse groups of fully synchronized dynamic systems stably coexist. We study global exponential synchronization and concurrent synchronization in the context of Lagrangian systems control. In a…
A syntactic model is presented for the specification of finite-state synchronous digital logic systems with complex input/output interfaces, which control the flow of data between opaque computational elements, and for the composition of…
We give structured proofs for five mathematical propositions governing synchronous peer-to-peer computation on a finite grid graph embedded in $\mathbb{Z}^2$. Proposition 1 gives three lower bounds: a transport-work bound $\sum_i a_i \ell_i…
Matching pursuit algorithms are an important class of algorithms in signal processing and machine learning. We present a blended matching pursuit algorithm, combining coordinate descent-like steps with stronger gradient descent steps, for…
In this paper we design and analyze algorithms for asynchronously solving linear programs using nonlinear signal processing structures. In particular, we discuss a general procedure for generating these structures such that a fixed-point of…