Related papers: Reducing the number of redundant pair-wise interac…
We implement an Augmented Lagrangian method to minimize a constrained least-squares cost function designed to find polyadic decompositions of the matrix multiplication tensor. We use this method to obtain new discrete decompositions and…
Redundancy identification is an important step of the design flow that typically follows logic synthesis and optimization. In addition to reducing circuit area, power consumption, and delay, redundancy removal also improves testability. All…
Recent advances in random linear systems on finite fields have paved the way for the construction of constant-time data structures representing static functions and minimal perfect hash functions using less space with respect to existing…
We propose a hybrid tree algorithm for reducing calculation and communication cost of collision-less N-body simulations. The concept of our algorithm is that we split interaction force into two parts: hard-force from neighbor particles and…
Mutually connected components (MCCs) play an important role as a measure of resilience in the study of interdependent networks. Despite their importance, an efficient algorithm to obtain the statistics of all MCCs during the removal of…
This paper presents novel approaches to parallelizing particle interactions on a GPU when there are few particles per cell and the interactions are limited by a cutoff distance. The paper surveys classical algorithms and then introduces two…
It is increasingly realized that taking stochastic effects into account is important in order to study biological cells. However, the corresponding mathematical formulation, the chemical master equation (CME), suffers from the curse of…
Hydrodynamic interactions in a suspension of spherical particles confined between two parallel planar walls are studied under creeping-flow conditions. The many-particle friction matrix in this system is evaluated using our novel numerical…
We present an analytical calculation of the hydrodynamic interaction between two spherical particles near an elastic interface such as a cell membrane. The theory predicts the frequency dependent self- and pair-mobilities accounting for the…
Smoothed Particle Hydrodynamics is a multidimensional Lagrangian method of numerical hydrodynamics that has been used to tackle a wide variety of problems in astrophysics. Here we develop the basic equations of the SPH scheme, and we…
Mesh plays an indispensable role in dense real-time reconstruction essential in robotics. Efforts have been made to maintain flexible data structures for 3D data fusion, yet an efficient incremental framework specifically designed for…
We propose a fast method for the calculation of short-range interactions in molecular dynamics simulations. The so-called random-batch list method is a stochastic version of the classical neighbor-list method to avoid the construction of a…
Lagrangian coherent structures (LCS) in fluid flows appear as co-dimension one ridges of the finite time Lyapunov exponent (FTLE) field. In three- dimensions this means two-dimensional ridges. A fast algorithm is presented here to locate…
We propose an efficient method to perform on-shell matching calculations in effective field theories. The standard off-shell approach to matching requires the use of a Green's basis that includes redundant and evanescent operators. The…
A novel particle merging algorithm for rarefied gas dynamics simulations is proposed that can conserve arbitrary velocity and spatial moments of the particle distribution via solving a non-negative least squares problem. An extension that…
This work considers a short-term, continuous time setting characterized by a coupled power supply system controlled exclusively by a single provider and comprising a cascade of hydropower systems (dams), fossil fuel power stations, and a…
This article introduces a highly parallel algorithm for molecular dynamics simulations with short-range forces on single node multi- and many-core systems. The algorithm is designed to achieve high parallel speedups for strongly…
Multi-index fusion has demonstrated impressive performances in retrieval task by integrating different visual representations in a unified framework. However, previous works mainly consider propagating similarities via neighbor structure,…
Dual decomposition is a powerful technique for deriving decomposition schemes for convex optimization problems with separable structure. Although the Augmented Lagrangian is computationally more stable than the ordinary Lagrangian, the…
Learning-based hashing methods are widely used for nearest neighbor retrieval, and recently, online hashing methods have demonstrated good performance-complexity trade-offs by learning hash functions from streaming data. In this paper, we…