相关论文: HOP: A New Group-Finding Algorithm for N-body Simu…
A great deal of research has been conducted in the consideration of meta-heuristic optimisation methods that are able to find global optima in settings that gradient based optimisers have traditionally struggled. Of these, so-called…
Characterizing conformational transitions in physical systems remains a fundamental challenge, as traditional sampling methods struggle with the high-dimensional nature of molecular systems and high-energy barriers between stable states.…
In this paper we deal with pedestrian modeling, aiming at simulating crowd behavior in normal and emergency scenarios, including highly congested mass events. We are specifically concerned with a new agent-based, continuous-in-space,…
Simulating interactions between non-spherical colloidal particles is computationally challenging due to the complex dependency of forces and energies on their geometry. We introduce and evaluate both descriptor-based and end-to-end models…
Next generation galaxy surveys demand the development of massive ensembles of galaxy mocks to model the observables and their covariances, what is computationally prohibitive using $N$-body simulations. COLA is a novel method designed to…
Constrained optimization demands highly efficient solvers which promotes the development of learn-to-optimize (L2O) approaches. As a data-driven method, L2O leverages neural networks to efficiently produce approximate solutions. However, a…
Our recent study of a nation-wide production network uncovered a community structure, namely how firms are connected by supplier-customer links into tightly-knit groups with high density in intra-groups and with lower connectivity in…
Invariance to nuisance transformations is one of the desirable properties of effective representations. We consider transformations that form a \emph{group} and propose an approach based on kernel methods to derive local group invariant…
We present a detailed description and validation of our massively-parallel update to the mass-Peak Patch method, a fully predictive initial-space algorithm to quickly generate dark matter halo catalogues in very large cosmological volumes.…
$N$-body simulations study the dynamics of $N$ particles under the influence of mutual long-distant forces such as gravity. In practice, $N$-body codes will violate Newton's third law if they use either an approximate Poisson solver or…
We consider the problem of sampling and approximately counting an arbitrary given motif $H$ in a graph $G$, where access to $G$ is given via queries: degree, neighbor, and pair, as well as uniform edge sample queries. Previous algorithms…
Higher-order proximity (HOP) is fundamental for most network embedding methods due to its significant effects on the quality of node embedding and performance on downstream network analysis tasks. Most existing HOP definitions are based on…
Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…
Direct-summation N-body algorithms compute the gravitational interaction between stars in an exact way and have a computational complexity of O(N^2). Performance can be greatly enhanced via the use of special-purpose accelerator boards like…
Despite significant advances in particle imaging technologies over the past two decades, few advances have been made in particle tracking, i.e. linking individual particle positions across time series data. The state-of-the-art tracking…
Object counting and localization are key steps for quantitative analysis in large-scale microscopy applications. This procedure becomes challenging when target objects are overlapping, are densely clustered, and/or present fuzzy boundaries.…
The simulation of spectroscopic observables for molecular aggregates with strong and structured coupling of electronic excitation to vibrational degrees of freedom is an important but challenging task. The hierarchy of pure states (HOPS)…
Gadget3 is nowadays one of the most frequently used high performing parallel codes for cosmological hydrodynamical simulations. Recent analyses have shown t\ hat the Neighbour Search process of Gadget3 is one of the most time-consuming…
There are many applications where it important to perform well on a set of examples as opposed to individual examples. For example in image or video classification the question is does an object appear somewhere in the image or video while…
Cosmological $N$-body simulations play a vital role in studying models for the evolution of the Universe. To compare to observations and make a scientific inference, statistic analysis on large simulation datasets, e.g., finding halos,…