Related papers: HOP: A New Group-Finding Algorithm for N-body Simu…
Choosing a committee with independent members in social networks can be named as a problem in group selection and independence in the committee is considered as the main criterion of this selection. Independence is calculated based on the…
The envelope theory is a method to compute approximate eigensolutions of quantum $N$-body Hamiltonians with a quite general structure in $D$ dimensions. The advantages of the method are that it is easy to implement and that $N$ is treated…
We present a method which extends Monte Carlo studies to situations that require a large dynamic range in particle number. The underlying idea is that, in order to calculate the collisional evolution of a system, some particle interactions…
Three halo finder algorithms - hierarchical friends-of-friends, bound density maxima, and 6D minimum spanning tree - are discussed.
In this paper, we consider the problem of noiseless non-adaptive group testing under the for-each recovery guarantee, also known as probabilistic group testing. In the case of $n$ items and $k$ defectives, we provide an algorithm attaining…
An instance of a group testing problem is a set of objects $\cO$ and an unknown subset $P$ of $\cO$. The task is to determine $P$ by using queries of the type ``does $P$ intersect $Q$'', where $Q$ is a subset of $\cO$. This problem occurs…
Best subset of groups selection (BSGS) is the process of selecting a small part of non-overlapping groups to achieve the best interpretability on the response variable. It has attracted increasing attention and has far-reaching applications…
Discrete simulation methods are efficient tools to investigate the complex behaviors of complex fluids made of either dry granular materials or dilute suspensions. By contrast, materials made of soft and/or concentrated units (emulsions,…
The "gravitational million-body problem," to model the dynamical evolution of a self-gravitating, collisional N-body system with ~10^6 particles over many relaxation times, remains a major challenge in computational astrophysics.…
In the first part of a series of two papers, we present in considerable detail a collision-driven molecular dynamics algorithm for a system of nonspherical particles, within a parallelepiped simulation domain, under both periodic or…
We present a method to numerically estimate the densities of a discretely sampled data based on binary space partitioning tree. We start with a root node containing all the particles and then recursively divide each node into two nodes each…
We propose a new algorithm for numerical path tracking in polynomial homotopy continuation. The algorithm is `robust' in the sense that it is designed to prevent path jumping and in many cases, it can be used in (only) double precision…
Given a graph where every node has certain attributes associated with it and some nodes have labels associated with them, Collective Classification (CC) is the task of assigning labels to every unlabeled node using information from the node…
A shadow of a numerical solution to a chaotic system is an_exact_ solution to the equations of motion that remains close to the numerical solution for a long time. In a collisionless n-body system, we know that particle motion is governed…
This paper introduces a new dynamic neighborhood network for particle swarm optimization. In the proposed Clubs-based Particle Swarm Optimization (C-PSO) algorithm, each particle initially joins a default number of what we call 'clubs'.…
The subjects and key questions faced by computational astrophysics using N-body simulations are discussed in the fields of globular star cluster dynamics, galactic nuclei and cosmological structure formation. After a comparison of the…
We present a systematic performance analysis of first-principles basin-hopping (BH) runs, with the target to identify all low-energy isomers of small Si and Cu clusters described within density-functional theory. As representative and…
Rapid and reliable robot bin picking is a critical challenge in automating warehouses, often measured in picks-per-hour (PPH). We explore increasing PPH using faster motions based on optimizing over a set of candidate grasps. The source of…
We introduce a new particle-based hybrid code for planetary accretion. The code uses an $N$-body routine for interactions with planetary embryos while it can handle a large number of planetesimals using a super-particle approximation, in…
We review the recent optimizations of gravitational $N$-body kernels for running them on graphics processing units (GPUs), on single hosts and massive parallel platforms. For each of the two main $N$-body techniques, direct summation and…