Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Cluster computing”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,189 records · Page 66

Modelling nearest neighbour distributions of biased tracers using hybrid effective field theory

ABSTRACT We investigate the application of hybrid effective field theory (HEFT) – which combines a Lagrangian bias expansion with subsequent particle dynamics from N-body simulations – to the modelling of k-nearest neighbour cumulative distribution functions (kNN-CDFs) of biased tracers of the cosmological matter field. The kNN-CDFs are sensitive to all higher order connected N-point functions in the data, but are computationally cheap to compute. We develop the formalism to predict the kNN-CDFs of discrete tracers of a continuous field from the statistics of the continuous field itself. Using this formalism, we demonstrate how kNN-CDF statistics of a set of biased tracers, such as haloes or galaxies, of the cosmological matter field can be modelled given a set of low-redshift HEFT component fields and bias parameter values. These are the same ingredients needed to predict the two-point clustering. For a specific sample of haloes, we show that both the two-point clustering and the kNN-CDFs can be well-fit on quasi-linear scales (≳ 20h−1Mpc) by the second-order HEFT formalism with the same values of the bias parameters, implying that joint modelling of the two is possible. Finally, using a Fisher matrix analysis, we show that including kNN-CDF measurements over the range of allowed scales in the HEFT framework can improve the constraints on σ8 by roughly a factor of 3, compared to the case where only two-point measurements are considered. Combining the statistical power of kNN measurements with the modelling power of HEFT, therefore, represents an exciting prospect for extracting greater information from small-scale cosmological clustering.

79 ASTRONOMY AND ASTROPHYSICS↗

Automated and efficient local adaptive regression for principal component-based reduced-order modeling of turbulent reacting flows

Principal Component Analysis can be used to reduce the cost of Computational Fluid Dynamics simulations of turbulent reacting flows by reducing the dimensionality of the transported variables through projection of the thermochemical state onto a lower-dimensional manifold. However, because of the nonlinearity of the principal component source terms, nonlinear regression techniques must be utilized for the source terms in terms of the principal components. Unfortunately, widely available and utilized nonlinear regression techniques can have prohibitive computational requirements and/or accuracy that is highly dependent on user experience in ad hoc tuning of model architecture and hyperparameters. Here, in this work, a new nonlinear regression approach is proposed that is both computationally efficient and automated so does not require any user input. The approach is evaluated through a priori prediction of principal component source terms using data from a Direct Numerical Simulation of a turbulent nonpremixed n-heptane/air jet flame. In particular, the proposed framework consists of local regressions whose complexity is adapted according to the local nonlinearity of the data: local linear regression when accurate enough and local Artificial Neural Networks when nonlinear regression is required. The number of local clusters for local regression is determined automatically using the Davies-Bouldin index. In addition, Bayesian optimization is utilized for model training (i.e., to select the best architectures and hyperparameters of the nonlinear regressions in an unsupervised fashion), eliminating ad hoc hand-tuning and/or expensive grid searches. Overall, compared to a single, global neural network, the new local adaptive regression approach is shown to have comparable accuracy but 69% less training time due to the utilization of local linear regression and faster training of local neural networks.

42 ENGINEERING↗

Understanding the hydrological response of a headwater-dominated catchment by analysis of distributed surface–subsurface interactions

Abstract We computationally explore the relationship between surface–subsurface exchange and hydrological response in a headwater-dominated high elevation, mountainous catchment in East River Watershed, Colorado, USA. In order to isolate the effect of surface–subsurface exchange on the hydrological response, we compare three model variations that differ only in soil permeability. Traditional methods of hydrograph analysis that have been developed for headwater catchments may fail to properly characterize catchments, where catchment response is tightly coupled to headwater inflow. Analyzing the spatially distributed hydrological response of such catchments gives additional information on the catchment functioning. Thus, we compute hydrographs, hydrological indices, and spatio-temporal distributions of hydrological variables. The indices and distributions are then linked to the hydrograph at the outlet of the catchment. Our results show that changes in the surface–subsurface exchange fluxes trigger different flow regimes, connectivity dynamics, and runoff generation mechanisms inside the catchment, and hence, affect the distributed hydrological response. Further, changes in surface–subsurface exchange rates lead to a nonlinear change in the degree of connectivity—quantified through the number of disconnected clusters of ponding water—in the catchment. Although the runoff formation in the catchment changes significantly, these changes do not significantly alter the aggregated streamflow hydrograph. This hints at a crucial gap in our ability to infer catchment function from aggregated signatures. We show that while these changes in distributed hydrological response may not always be observable through aggregated hydrological signatures, they can be quantified through the use of indices of connectivity.

54 ENVIRONMENTAL SCIENCES↗

VpROM: a novel variational autoencoder-boosted reduced order model for the treatment of parametric dependencies in nonlinear systems

Reduced Order Models (ROMs) are of considerable importance in many areas of engineering in which computational time presents difficulties. Established approaches employ projection-based reduction, such as Proper Orthogonal Decomposition. The limitation of the linear nature of such operators is typically tackled via a library of local reduction subspaces, which requires the assembly of numerous local ROMs to address parametric dependencies. Our work attempts to define a more generalisable mapping between parametric inputs and reduced bases for the purpose of generative modeling. We propose the use of Variational Autoencoders (VAEs) in place of the typically utilised clustering or interpolation operations, for inferring the fundamental vectors, termed as modes, which approximate the manifold of the model response for any and each parametric input state. The derived ROM still relies on projection bases, built on the basis of full-order model simulations, thus retaining the imprinted physical connotation. However, it additionally exploits a matrix of coefficients that relates each local sample response and dynamics to the global phenomena across the parametric input domain. The VAE scheme is utilised for approximating these coefficients for any input state. This coupling leads to a high-precision low-order representation, which is particularly suited for problems where model dependencies or excitation traits cause the dynamic behavior to span multiple response regimes. Moreover, the probabilistic treatment of the VAE representation allows for uncertainty quantification on the reduction bases, which may then be propagated to the ROM response. The performance of the proposed approach is validated on an open-source simulation benchmark featuring hysteresis and multi-parametric dependencies, and on a large-scale wind turbine tower characterised by nonlinear material behavior and model uncertainty.

Conditional VAEs↗

Reducing Communication in Graph Neural Network Training

Graph Neural Networks (GNNs) are powerful and flexible neural networks that use the naturally sparse connectivity information of the data. GNNs represent this connectivity as sparse matrices, which have lower arithmetic intensity and thus higher communication costs compared to dense matrices, making GNNs harder to scale to high concurrencies than convolutional or fully-connected neural networks. Here, we introduce a family of parallel algorithms for training GNNs and show that they can asymptotically reduce communication compared to previous parallel GNN training methods. We implement these algorithms, which are based on 1D, 1. 5D, 2D, and 3D sparse-dense matrix multiplication, using torch.distributed on GPU-equipped clusters. Our algorithms optimize communication across the full GNN training pipeline. We train GNNs on over a hundred GPUs on multiple datasets, including a protein network with over a billion edges.

97 MATHEMATICS AND COMPUTING↗

Nowcasting Earthquakes With Stochastic Simulations: Information Entropy of Earthquake Catalogs

Earthquake nowcasting has been proposed as a means of tracking the change in large earthquake potential in a seismically active area. The method was developed using observable seismic data, in which probabilities of future large earthquakes can be computed using Receiver Operating Characteristic methods. Furthermore, analysis of the Shannon information content of the earthquake catalogs has been used to show that there is information contained in the catalogs, and that it can vary in time. So an important question remains, where does the information originate? In this paper, we examine this question using stochastic simulations of earthquake catalogs. Our catalog simulations are computed using an Earthquake Rescaled Aftershock Seismicity (“ERAS”) stochastic model. This model is similar in many ways to other stochastic seismicity simulations, but has the advantage that the model has only 2 free parameters to be set, one for the aftershock (Omori-Utsu) time decay, and one for the aftershock spatial migration away from the epicenter. Generating a simulation catalog and fitting the two parameters to the observed catalog such as California takes only a few minutes of wall clock time. While clustering can arise from random, Poisson statistics, we show that significant information in the simulation catalogs arises from the “non-Poisson” power-law aftershock clustering, implying that the practice of de-clustering observed catalogs may remove information that would otherwise be useful in forecasting and nowcasting. We also show that the nowcasting method provides similar results with the ERAS model as it does with observed seismicity.

58 GEOSCIENCES↗

Exploring NaCl-PuCl 3 molten salts with machine learning interatomic potentials and graph theory

Actinide molten salts are the basis of the liquid fuels used in molten salt reactors. Due to the inherent difficulties associated with high temperature and hazardous conditions, experimental investigations of fundamental properties of these materials are usually challenging. In this work, we describe the structure and transport of NaCl-PuCl 3 mixtures using computational techniques. Three compositions were considered (16, 25, and 36 mol% PuCl 3 ) over a temperature range (730 – 1257K) using ab initio molecular dynamics, which provided the necessary data sets for training machine learned interatomic potentials. Further, molecular dynamics simulations based on these potentials were then used to determine structure and transport properties. A substantial change was noted in the structure factor when increasing the PuCl 3 content from 25 to 36 mol%. This change is linked to the aggregation of larger Pu 3+ clusters. In addition, the similarity of the atomic environments of metal cations in molten salt systems to their solid states counterparts was investigated using an unsupervised learning technique. Finally, graph theory was employed to explore the structure and size of actinide networks. Consistent with the structure factor, a dense Pu 3+ intermolecular structure is observed within the 36 mol% PuCl 3 mixture. The structure of cation-cation inter-junctions is also discussed. In all cases, the diffusion of Pu 3+ is significantly lower than that of Na + and Cl - .

36 MATERIALS SCIENCE↗

Accurate Fe–He machine learning potential for studying He effects in BCC-Fe

Nanostructured Ferritic Alloys (NFAs) containing oxide nanoparticles are prospective advanced structural materials in future fusion reactors. Lacking fusion neutron sources with an adequate flux, modeling is critical to understand radiation damage in the NFAs, including helium effects. Machine learning interatomic potentials (MLPs) have been demonstrated to be capable of describing atomic interactions in chemically complex systems with comparable accuracy to density functional theory (DFT) but with much less computational costs. Hence, MLPs are chosen to study He bubble accumulation in chemically complex NFAs. As a preliminary step, we develop a Fe–He potential, based on ~10,000 atomic configurations. The developed MLP accurately predicts the bulk properties of BCC-Fe compared to DFT, including the lattice constant (2.832 Å), elastic constants (c 11 = 271 GPa, c 12 = 141, c 44 = 93), and phonon frequencies (maximum error < 3.5%). The MLP predicts He binding energies in He n V bubbles and He n clusters with a mean absolute error (MAE) of only ~70 meV, which is ~3 to ~5 times smaller than the MAE of binding energies estimated using empirical potentials. The MLP also accurately predicts the migration barrier of interstitial He (64 meV). Furthermore, the MLP correctly predicts the maximum number of He atoms (critical size) at which a He n V bubble (He n cluster) can kick-out a self-interstitial atom (SIA), forming a bigger He n V 2 bubble (He n V bubble). Subsequently, we use the MLP to perform molecular dynamics simulations to investigate the effect of temperature on the critical size of He n V bubbles and He n clusters. We find that the critical size decreases with increasing temperature — indicating that smaller bubbles and clusters can kick-out an SIA at higher temperatures, thereby escalating the He bubble growth. We report the current Fe–He MLP can be further developed to include all chemical interactions in NFAs.

36 MATERIALS SCIENCE↗

Data augmentation for disruption prediction via robust surrogate models

The goal of this work is to generate large statistically representative data sets to train machine learning models for disruption prediction provided by data from few existing discharges. Such a comprehensive training database is important to achieve satisfying and reliable prediction results in artificial neural network classifiers. Here, we aim for a robust augmentation of the training database for multivariate time series data using Student t process regression. We apply Student t process regression in a state space formulation via Bayesian filtering to tackle challenges imposed by outliers and noise in the training data set and to reduce the computational complexity. Thus, the method can also be used if the time resolution is high. We use an uncorrelated model for each dimension and impose correlations afterwards via colouring transformations. We demonstrate the efficacy of our approach on plasma diagnostics data of three different disruption classes from the DIII-D tokamak. To evaluate if the distribution of the generated data is similar to the training data, we additionally perform statistical analyses using methods from time series analysis, descriptive statistics and classic machine learning clustering algorithms.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Analytical gradients for molecular-orbital-based machine learning

We report molecular-orbital-based machine learning (MOB-ML) enables the prediction of accurate correlation energies at the cost of obtaining molecular orbitals. Here, we present the derivation, implementation, and numerical demonstration of MOB-ML analytical nuclear gradients, which are formulated in a general Lagrangian framework to enforce orthogonality, localization, and Brillouin constraints on the molecular orbitals. The MOB-ML gradient framework is general with respect to the regression technique (e.g., Gaussian process regression or neural networks) and the MOB feature design. We show that MOB-ML gradients are highly accurate compared to other ML methods on the ISO17 dataset while only being trained on energies for hundreds of molecules compared to energies and gradients for hundreds of thousands of molecules for the other ML methods. The MOB-ML gradients are also shown to yield accurate optimized structures at a computational cost for the gradient evaluation that is comparable to a density-corrected density functional theory calculation.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Minimal implicit-solvent coarse-grained simulation of Pluronic block copolymers with ionic liquids

Pluronic block copolymers, composed of poly(ethylene oxide) (PEO) and poly(propylene oxide) (PPO) in a triblock structure (PEO–PPO–PEO), are well known for their amphiphilic character and ability to self‐assemble into micelles in aqueous solution. The addition of ionic liquids (ILs) can further modulate the core–shell structures of these copolymers, influencing their stability, critical micellization temperature, and size. However, fully atomistic simulations often become prohibitively expensive due to the size and complexity of these systems. In this work, coarse‐grained simulations using a minimal implicit‐solvent model were performed to examine how two classes of ILs, namely, 1‐alkyl‐3‐methylimidazolium ([C n C 1 im]) and 1‐alkyl‐3‐methylpyrrolidinium ([C n C 1 pyrr]), change the micellization of Pluronic block copolymers in aqueous solution. The effects of IL concentration and alkyl group length were investigated, and the model greatly improved the efficiency of simulating large‐scale micelle systems. Furthermore, the numerical simulations are qualitatively compared with experimental investigations. Our results show that adding ILs expands the micelle core by embedding IL tails among the PPO blocks, thereby increasing overall micelle size. Less polar ILs generally induce more pronounced micellar growth. However, the effect of IL tail length on conformation and micellar packing is non‐monotonic. Up to moderate chain lengths (around C8–C10), the IL tails can extend sufficiently to increase local separation within the micelle; at longer tail lengths, enhanced hydrophobic clustering and steric hindrance cause the tails to bend or fold, capping further expansion. In addition, although block copolymer chains tend to pack more closely in the presence of longer‐tailed ILs, the random coil size of an individual polymer chain does not necessarily shrink. Meanwhile, these insights provide a deeper understanding of how Pluronic/IL systems interact, informing applications in drug delivery, cosmetics, food, and environmental engineering. Finally, our minimal implicit‐solvent model can be applied to larger systems and longer timescales, substantially reducing computational cost while reproducing key structural trends observed experimentally.

Atomistic simulations↗

Weighted FFT estimators for 1D and 3D correlations of the Lyman- α forest

Correlations in the Lyman-α (Lyα) forest, both as a function of line of sight separation (1D) and 3D separation, provide a unique window to the distribution of matter at redshifts not accessible by current galaxy surveys. While optimal quadratic estimators have been used to measure 1D correlations, they are computationally expensive and difficult to extend to 3D analyses. On the other hand, estimators based on the Fast Fourier Transform (FFT) are significantly faster, but are affected by missing data in the spectra (masked pixels) and so far have not used pixel weights to reduce the uncertainties in the measurement. In this publication we describe how to compute the window matrix that enables forward-modelling the impact of masked pixels and weights on the FFT-based estimators. Here, we use Gaussian and hydrodynamical simulations with artificially masked pixels to validate the method on the measurement of 1D correlations. Finally, we show that the formalism can be extended to model the impact on 3D correlations, in particular on the cross-spectrum, the correlation of 1D Fourier modes as a function of transverse separation. This work will enable more precise clustering measurements with the Lyα forest dataset recently collected by the Dark Energy Spectroscopic Instrument (DESI).

Lokken, Martine [Univ. Autonoma de Barcelona (Spai↗

Wholesale Electricity Analysis via Simulation & Learning Experiments (WEASLE): Platform Development and Pilot Competition

This document reports the development of the Wholesale Electricity Analysis via Simulation and Learning Experiments (WEASLE) platform and the pilot competition that was conducted to test the platform. Due to the increasing reliance on variable renewable energy resources for bulk power, the pilot competition, called the Energy Storage Participation Algorithm Competition (ESPA-Comp), was used to test the effect of various market designs on storage utilization and market efficiency. Basic details of the platform are provided, including an overview of the market clearing engine, the battery dispatch and degradation models, electric grid topology and resource mix, and software architecture. Two market designs were tested: a two-settlement market analogous to typical ISO design today, and a multi-settlement market that allows additional forward-trading periods during the real-time market. Results from the pilot competition show that the storage bidding problem is nontrivial and is well suited for future challenges. We find that: 1) all four teams utilized different approaches to the bidding problem, 2) different methodological approaches led to substantially different offer behaviors, 3) resource profits are clustered by team and methodological approach, 4) simulated offers reduced market surplus by about 0.5%, 5) substantially different prices between two-settlement and multi-settlement markets albeit minimal difference in overall market surplus.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Early Career: First-Principles Tools for Nonadiabatic Attosecond Dynamics in Materials

The overarching goal of this project was to develop computer tools for predicting how electrons move in molecules and solids at the attosecond (billionth-of-a-billionth of a second) time scale, during and after interaction with intense and/or high energy laser light. An associated goal was to also determine how X-ray spectroscopy could be used as a probe of these dynamics. The project resulted in multiple methodology developments that allow for these processes to be simulated from first-principles, most notably the use of small bulk-mimicking clusters to model solids and fixes for a deficiency in a commonly used method (time-dependent density functional theory). Additionally, the simulations showed that X-ray absorption peaks can be directly related to the electron density above the absorbing atom, and can thus be used as an intuitive probe of "where the electrons are" at a given time in the system. Collectively, these tools and results expected to be valuable for predicting and interpreting future attosecond experiments, especially for X-ray pump/probe studies at free-electron laser facilities.

74 ATOMIC AND MOLECULAR PHYSICS↗

Facial Named Entity Recognition by Attention-Based Graph Convolutional Neural Network

In the realm of facial recognition and analysis, the ability to accurately cluster large datasets of facial images stands as a cornerstone for various applications, ranging from security surveillance to user biometric identification. This project evolves a novel approach to facial data clustering by embedding facial images into a high-dimensional vector space using an advanced embedding model trained on separate data and assumes a graph-like structure on the high-dimensional vectors. We find our method works significantly better than common shallow methods.

97 MATHEMATICS AND COMPUTING↗

Reaction Profiles and Kinetics for Radical–Radical Hydrogen Abstraction via Multireference Coupled Cluster Theory

Radical-radical abstractions in hydrocarbon oxidation chemistry are disproportionation reactions that are generally exothermic with little or no barrier yet are underappreciated and poorly studied. Such challenging multireference electronic structure problems are tackled here using the recently developed state-specific multireference coupled cluster methods Mk-MRCCSD and Mk-MRCCSD(T), as well as the companion perturbation theory Mk-MRPT2 and the established MRCISD, MRCISD+Q, and CASPT2 approaches. Reaction paths are investigated for five prototypes involving radical-radical hydrogen abstraction: H + BeH → H 2 + Be, H + NH 2 → H 2 + NH, CH 3 + C 2 H 5 → CH 4 + C 2 H 4 , H + C2H 5 → H 2 + C 2 H 4 , and H + HCO → H 2 + CO. Full configuration interaction (FCI) benchmark computations for the H + BeH, H + NH 2 , and H + HCO reactions prove that Mk-MRCCSD(T) provides superior accuracy for the interaction energies in the entrance channel, with mean absolute errors less than 0.3 kcal mol(-1) and percentage deviations less than 10% over the fragment separations of relevance to kinetics. To facilitate combustion studies, energetics for the CH 3 + C 2 H 5 , H + C 2 H 5 , and H + HCO reactions were computed at each level of theory with correlation-consistent basis sets (cc-pVXZ, X = T, Q 5) and extrapolated to the complete basis set (CBS) limit. These CBS energies were coupled with CASPT2 projected vibrational frequencies along a minimum energy path to obtain rate constants for these three reactions. The rigorous Mk-MRCCSD(T)/CBS results demonstrate unequivocally that these three reactions proceed with no barrier in the entrance channel, contrary to some earlier predictions. Mk-MRCCSD(T) also reveals that the economical CASPT2 method performs well for large interfragment separations but may deteriorate substantially at shorter distances.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Ab Initio Nuclear Thermodynamics

Here, we propose a new Monte Carlo method called the pinhole trace algorithm for ab initio calculations of the thermodynamics of nuclear systems. For typical simulations of interest, the computational speedup relative to conventional grand-canonical ensemble calculations can be as large as a factor of one thousand. Using a leading-order effective interaction that reproduces the properties of many atomic nuclei and neutron matter to a few percent accuracy, we determine the location of the critical point and the liquid-vapor coexistence line for symmetric nuclear matter with equal numbers of protons and neutrons. We also present the first ab initio study of the density and temperature dependence of nuclear clustering.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DLSIA: Deep Learning for Scientific Image Analysis

DLSIA (Deep Learning for Scientific Image Analysis) is a Python-based machine learning library that empowers scientists and researchers across diverse scientific domains with a range of customizable convolutional neural network (CNN) architectures for a wide variety of tasks in image analysis to be used in downstream data processing. DLSIA features easy-to-use architectures, such as autoencoders, tunable U-Nets and parameter-lean mixed-scale dense networks (MSDNets). Additionally, this article introduces sparse mixed-scale networks (SMSNets), generated using random graphs, sparse connections and dilated convolutions connecting different length scales. For verification, several DLSIA-instantiated networks and training scripts are employed in multiple applications, including inpainting for X-ray scattering data using U-Nets and MSDNets, segmenting 3D fibers in X-ray tomographic reconstructions of concrete using an ensemble of SMSNets, and leveraging autoencoder latent spaces for data compression and clustering. As experimental data continue to grow in scale and complexity, DLSIA provides accessible CNN construction and abstracts CNN complexities, allowing scientists to tailor their machine learning approaches, accelerate discoveries, foster interdisciplinary collaboration and advance research in scientific image analysis.

97 MATHEMATICS AND COMPUTING↗