Related papers: Parallel P3M with exact calculation of short range…
Particles traveling at high velocities through microfluidic channels migrate from their starting streamlines due to inertial lift forces. Theories predict different scaling laws for these forces and there is little experimental evidence by…
We formulate a parity-mixed coupled-cluster (PM-CC) approach for high-precision calculations of parity non-conserving amplitudes in mono-valent atoms. Compared to the conventional formalism which uses parity-proper (PP) one-electron…
The minimum degree algorithm is one of the most widely-used heuristics for reducing the cost of solving large sparse systems of linear equations. It has been studied for nearly half a century and has a rich history of bridging techniques…
In this paper, we present FLiMS, a highly-efficient and simple parallel algorithm for merging two sorted lists residing in banked and/or wide memory. On FPGAs, its implementation uses fewer hardware resources than the state-of-the-art…
Based on statistical approach we described possible formation of spatially inhomogeneous distribution in the system of interacting Fermi particles by long-rage forces, and we demonstrated nonperturbative calculation of the partition…
We design new parallel algorithms for clustering in high-dimensional Euclidean spaces. These algorithms run in the Massively Parallel Computation (MPC) model, and are fully scalable, meaning that the local memory in each machine may be…
Particle-In-Cell codes are widely used for plasma physics simulations. It is often the case that particles within a computational cell need to be split to improve the statistics or, in the case of non-uniform meshes, to avoid the…
The formulae for correlators K2 and K3 of a given particle observable (e.g. energy or transverse momentum) accounting for the track reconstruction efficiency are presented. Similar to the case of an ideal detector, the correlators can be…
In this paper, a fast and practical GPU-based implementation of Fuzzy C-Means(FCM) clustering algorithm for image segmentation is proposed. First, an extensive analysis is conducted to study the dependency among the image pixels in the…
We introduce a class of fourth order symplectic algorithms that are ideal for doing long time integration of gravitational few-body problems. These algorithms have only positive time steps, but require computing the force gradient in…
Efficient design and performance of electrically actuated MEMS devices necessitate accurate estimation of electrostatic forces on the MEMS structures. This in turn requires thorough study of the capacitance of the structures and finally the…
The tremendous advance in computer technology in the past decade has made it possible to achieve the performance of a supercomputer on a very small budget. We have built a multi-CPU cluster of Pentium PC capable of parallel computations…
The issue of computing (co)homology generators of a cell complex is gaining a pivotal role in various branches of science. While this issue can be rigorously solved in polynomial time, it is still overly demanding for large scale problems.…
Bipartite Correlation clustering is the problem of generating a set of disjoint bi-cliques on a set of nodes while minimizing the symmetric difference to a bipartite input graph. The number or size of the output clusters is not constrained…
This study presents two different machine learning approaches for the modeling of hydrodynamic force on particles in a particle-laden multiphase flow. Results from particle-resolved direct numerical simulations (PR-DNS) of flow over a…
Real-time data processing is one of the central processes of particle physics experiments which require large computing resources. The LHCb (Large Hadron Collider beauty) experiment will be upgraded to cope with a particle bunch collision…
As an entry for the 2012 Gordon-Bell performance prize, we report performance results of astrophysical N-body simulations of one trillion particles performed on the full system of K computer. This is the first gravitational trillion-body…
We present an algorithm that computes the multipole coefficients of the galaxy three-point correlation function (3PCF) without explicitly considering triplets of galaxies. Rather, centering on each galaxy in the survey, it expands the…
The pseudo-polar Fourier transform is a specialized non-equally spaced Fourier transform, which evaluates the Fourier transform on a near-polar grid, known as the pseudo-polar grid. The advantage of the pseudo-polar grid over other…
We introduce a `virtual-move' Monte Carlo (VMMC) algorithm for systems of pairwise-interacting particles. This algorithm facilitates the simulation of particles possessing attractions of short range and arbitrary strength and geometry, an…