skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: Getting over the hump with KAMEL-LOBE: Kernel-averaging method to eliminate length-of-bin effects in radial distribution functions
Radial distribution functions (RDFs) are widely used in molecular simulation and beyond. Most approaches to computing RDFs require assembling a histogram over inter-particle separation distances. In turn, these histograms require a specific (and generally arbitrary) choice of discretization for bins. We demonstrate that this arbitrary choice for binning can lead to significant and spurious phenomena in several commonplace molecular-simulation analyses that make use of RDFs, such as identifying phase boundaries and generating excess entropy scaling relationships. We show that a straightforward approach (which we term Kernel-Averaging Method to Eliminate Length-Of-Bin Effects) mitigates these issues. This approach is based on systematic and mass-conserving mollification of RDFs using a Gaussian kernel. This technique has several advantages compared to existing methods, including being useful for cases where the original particle kinematic data have not been retained, and the only available data are the RDFs themselves. We also discuss the optimal implementation of this approach in the context of several application areas.  more » « less
Award ID(s):
2021019 2133568
PAR ID:
10469633
Author(s) / Creator(s):
;
Publisher / Repository:
American Institute of Physics
Date Published:
Journal Name:
The Journal of Chemical Physics
Volume:
158
Issue:
22
ISSN:
0021-9606
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. Particle shape strongly influences the diffusion charging of aerosol particles exposed to bipolar/unipolar ions and accurate modeling is needed to predict the charge distribution of non-spherical particles. A prior particle-ion collision kernel β_i model including Coulombic and image potential interactions for spherical particles is generalized for arbitrary shapes following a scaling approach that uses a continuum and free molecular particle length scale and Langevin dynamics simulations of non-spherical particle-ion collisions for attractive Coulomb-image potential interactions. This extended β_i model for collisions between unlike charged particle-ion (bipolar charging) and like charged particle-ion (unipolar charging) is validated by comparing against published experimental data of bipolar charge distributions for diverse shapes. Comparison to the bipolar charging data for spherical particles shows good agreement in air, argon, and nitrogen, while also demonstrating high accuracy in predicting charge states up to ±6. Comparisons to the data for fractal aggregates reveal that the LD-based β_i model predicts within overall ±30% without any systematic bias. The mean charge on linear chain aggregates and charge fractions on cylindrical particles is found to be in good agreement with the measurements (~±20% overall). The comparison with experimental results supports the use of LD-based diffusion charging models to predict the bipolar and unipolar charge distribution of arbitrary shaped aerosol particles for a wide range of particle size, and gas temperature, pressure. The presented β_i model is valid for perfectly conducting particles and in the absence of external electric fields; these simplifications need to be addressed in future work on particle charging. 
    more » « less
  2. Abstract Recently, deep learning‐based denoising approaches have led to dramatic improvements in low sample‐count Monte Carlo rendering. These approaches are aimed at path tracing, which is not ideal for simulating challenging light transport effects like caustics, where photon mapping is the method of choice. However, photon mapping requires very large numbers of traced photons to achieve high‐quality reconstructions. In this paper, we develop the first deep learning‐based method for particle‐based rendering, and specifically focus on photon density estimation, the core of all particle‐based methods. We train a novel deep neural network to predict a kernel function to aggregate photon contributions at shading points. Our network encodes individual photons into per‐photon features, aggregates them in the neighborhood of a shading point to construct a photon local context vector, and infers a kernel function from the per‐photon and photon local context features. This network is easy to incorporate in many previous photon mapping methods (by simply swapping the kernel density estimator) and can produce high‐quality reconstructions of complex global illumination effects like caustics with an order of magnitude fewer photons compared to previous photon mapping methods. Our approach largely reduces the required number of photons, significantly advancing the computational efficiency in photon mapping. 
    more » « less
  3. null (Ed.)
    We present a data-driven method for computing approximate forward reachable sets using separating kernels in a reproducing kernel Hilbert space. We frame the problem as a support estimation problem, and learn a classifier of the support as an element in a reproducing kernel Hilbert space using a data-driven approach. Kernel methods provide a computationally efficient representation for the classifier that is the solution to a regularized least squares problem. The solution converges almost surely as the sample size increases, and admits known finite sample bounds. This approach is applicable to stochastic systems with arbitrary disturbances and neural network verification problems by treating the network as a dynamical system, or by considering neural network controllers as part of a closed-loop system. We present our technique on several examples, including a spacecraft rendezvous and docking problem, and two nonlinear system benchmarks with neural network controllers. 
    more » « less
  4. Abstract Recombination directionality factors (RDFs) for large serine integrases (LSIs) are cofactor proteins that control the directionality of recombination to favour excision over insertion. Although RDFs are predicted to bind their cognate LSIs in similar ways, there is no overall common structural theme across LSI RDFs, leading to the suggestion that some of them may be moonlighting proteins with other primary functions. To test this hypothesis, we searched for characterized proteins with structures similar to the predicted structures of known RDFs. Our search shows that the RDFs for two LSIs, TG1 integrase and Bxb1 integrase, show high similarities to a single-stranded DNA binding (SSB) protein and an editing exonuclease, respectively. We present experimental data to show that Bxb1 RDF is probably an exonuclease and TG1 RDF is a functional SSB protein. We used mutational analysis to validate the integrase-RDF interface predicted by AlphaFold2 multimer for TG1 integrase and its RDF, and establish that control of recombination directionality is mediated via protein–protein interaction at the junction of recombinase’s second DNA binding domain and the base of the coiled-coil domain. 
    more » « less
  5. De Lorenzis, L; Papadrakakis, M; Zohdi T.I. (Ed.)
    This paper introduces a neural kernel method to generate machine learning plasticity models for micropolar and micromorphic materials that lack material symmetry and have internal structures. Since these complex materials often require higher-dimensional parametric space to be precisely characterized, we introduce a representation learning step where we first learn a feature vector space isomorphic to a finite-dimensional subspace of the original parametric function space from the augmented labeled data expanded from the narrow band of the yield data. This approach simplifies the data augmentation step and enables us to constitute the high-dimensional yield surface in a feature space spanned by the feature kernels. In the numerical examples, we first verified the implementations with data generated from known models, then tested the capacity of the models to discover feature spaces from meso-scale simulation data generated from representative elementary volume (RVE) of heterogeneous materials with internal structures. The neural kernel plasticity model and other alternative machine learning approaches are compared in a computational homogenization problem for layered geomaterials. The results indicate that the neural kernel feature space may lead to more robust forward predictions against sparse and high-dimensional data. 
    more » « less