Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “adaptive algorithm”

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 541 records · Page 30
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

SPARC-X: Quantum simulations at extreme scale - reactive dynamics from first principles

We have developed the massively parallel electronic structure code SPARC-X: a computational framework for performing Kohn-Sham Density Functional Theory (DFT) calculations that can scale linearly with the number of atoms in the system, while being able to leverage petascale and emerging exascale parallel computers to study chemical phenomena at unprecedented length and time scales. SPARC-X exploits a recent breakthrough in electronic structure methodologies: systematically improvable, strictly local, orthonormal, discontinuous real-space bases that efficiently and systematically capture the local chemistry of the system. With further adaptation using new machine-learning techniques and the use of the massively parallel Spectral Quadrature (SQ) electronic structure method, the algorithmic complexity and prefactor associated with DFT calculations involving semilocal as well as hybrid functionals are dramatically reduced. Using petascale computational resources, SPARC-X enables quantum mechanical simulations at length and time scales previously accessible only by empirical approaches, e.g., 1,000,000 atoms for a few picoseconds using semilocal functionals or 1,000 atoms for a few picoseconds using hybrid functionals. Using exascale resources, the sizes and times targeted are two orders of magnitude larger. Such a capability has applications in a wide variety of chemical sciences, including reactive interfaces where large length- and/or long time-scales are needed and traditional force fields fail. This is particularly important in dynamic catalysis, where bond breaking and formation must be understood in detail. We developed, tested, and employed the SPARC-X framework to understand the photocatalytic properties of TiO 2 nanoparticles, revealing finite size effects that cannot be captured with standard model systems or functionals. This integrated development and application strategy ensures that SPARC-X remains a robust, efficient, and scalable software package for quantum simulations on current petascale and emerging exascale computing resources.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Automated, Unmanned Detection and Quantification of Fugitive Methane Emissions

Compressor stations used to move natural gas are one of the largest sources of fugitive methane emissions in the midstream sector, accounting for approximately 50% of all fugitive emissions (Zimmerle et al., 2015). This problem is most widespread at reciprocating compressors (Subramanian et al., 2015) where faulty seals are a key contributor to methane emissions (Johnson et al., 2015). As such, there is a significant need for a robust technology that could provide an early indication of an unexpected emission. Equally important, the technology needs to be able to account for biogenic versus anthropogenic sources of methane. One means of indirectly making this determination, is to leverage optical technologies that can autonomously pinpoint the source of such leaks. This presentation discusses recent work funded by the U.S. Department of Energy (DOE) National Energy Technology Laboratory (NETL), focused on the development of an innovative remote sensing technology that can reliably and autonomously detect fugitive methane emissions in near real-time, using computer vision and deep learning. The technology called the Smart Methane Leak Detection (SLED/M) system was initially developed to monitor facilities such as compressor stations in a stationary, pan-tilt-zoom configuration. The system has recently been adapted to monitor facilities from an unmanned aerial system (UAS). The speed and maneuverability of UAS platforms are attractive to leak detection and repair program operators, but introduce several challenges. Many existing methane detection algorithms rely on mostly static backgrounds becoming unusable with motion. In addition, top-down views of fugitive methane emissions present differently in Optical Gas Imagers (OGI) compared to looking across the plume. Our work has focused on overcoming these challenges, enhancing the operators ability to detect methane emissions, and pinpoint their sources. Another recent adaptation to SLED/M is the ability to quantify methane emissions using passive sensors (OGI, thermal camera), environmental conditions, plume modeling, and deep learning. SLED/M advances the state-of-the-art for methane emission detection and quantification by focusing on three key critical criteria for effective methane emission mitigation: (1) autonomy (no need for a human to be in the loop), (2) high reliability (low false alarm rates), and (3) real-time performance. Results from this work will be presented.

03 NATURAL GAS↗
DOE OSTI2025

Optimizing temperature distributions for training neural quantum states using parallel tempering

Parametrized artificial neural networks (ANNs) can be very expressive ansatzes for variational algorithms, reaching state-of-the-art energies on many quantum many-body Hamiltonians. Nevertheless, the training of the ANN can be slow and stymied by the presence of local minima in the parameter landscape. One approach to mitigate this issue is to use parallel tempering methods, and in this work, we focus on the role played by the temperature distribution of the parallel tempering replicas. Using an adaptive method that adjusts the temperatures in order to equate the exchange probability between neighboring replicas, we show that this temperature optimization can significantly increase the success rate of the variational algorithm with negligible computational cost by eliminating bottlenecks in the replicas' random walk. Furthermore, we demonstrate this using two different neural networks, a restricted Boltzmann machine and a feedforward network, which we use to study a toy problem based on a permutation invariant Hamiltonian with a pernicious local minimum and the 𝐽 1 −𝐽 2 model on a rectangular lattice.

Neural network simulations↗
DOE OSTI2023

Large-Scale Materials Modeling at Quantum Accuracy: Ab Initio Simulations of Quasicrystals and Interacting Extended Defects in Metallic Alloys

Ab initio electronic-structure has remained dichotomous between achievable accuracy and length-scale. Quantum many-body (QMB) methods realize quantum accuracy but fail to scale. Density functional theory (DFT) scales favorably but remains far from quantum accuracy. We present a framework that breaks this dichotomy by use of three interconnected modules: (i) invDFT: a methodological advance in inverse DFT linking QMB methods to DFT; (ii) MLXC: a machine-learned density functional trained with invDFT data, commensurate with quantum accuracy; (iii) DFT-FE-MLXC: an adaptive higher-order spectral finite-element (FE) based DFT implementation that integrates MLXC with efficient solver strategies and HPC innovations in FE-specific dense linear algebra, mixed-precision algorithms, and asynchronous compute-communication. Furthermore, we demonstrate a paradigm shift in DFT that not only provides an accuracy commensurate with QMB methods in ground-state energies, but also attains an unprecedented performance of 659.7 PFLOPS (43.1% peak FP64 performance) on 619,124 electrons using 8,000 GPU nodes of Frontier supercomputer.

density functional theory↗
DOE OSTI2020

Advances in Kriging-Based Autonomous X-Ray Scattering Experiments

Autonomous experimentation is an emerging paradigm for scientific discovery, wherein measurement instruments are augmented with decision-making algorithms, allowing them to autonomously explore parameter spaces of interest. We have recently demonstrated a generalized approach to autonomous experimental control, based on generating a surrogate model to interpolate experimental data, and a corresponding uncertainty model, which are computed using a Gaussian process regression known as ordinary Kriging (OK). We demonstrated the successful application of this method to exploring materials science problems using x-ray scattering measurements at a synchrotron beamline. Here, we report several improvements to this methodology that overcome limitations of traditional Kriging methods. The variogram underlying OK is global and thus insensitive to local data variation. We augment the Kriging variance with model-based measures, for instance providing local sensitivity by including the gradient of the surrogate model. As with most statistical regression methods, OK minimizes the number of measurements required to achieve a particular model quality. However, in practice this may not be the most stringent experimental constraint; e.g. the goal may instead be to minimize experiment duration or material usage. We define an adaptive cost function, allowing the autonomous method to balance information gain against measured experimental cost. We provide synthetic and experimental demonstrations, validating that this improved algorithm yields more efficient autonomous data collection.

36 MATERIALS SCIENCE↗
DOE OSTI2022

A reusable neural network pipeline for unidirectional fiber segmentation

Abstract Fiber-reinforced ceramic-matrix composites are advanced, temperature resistant materials with applications in aerospace engineering. Their analysis involves the detection and separation of fibers, embedded in a fiber bed, from an imaged sample. Currently, this is mostly done using semi-supervised techniques. Here, we present an open, automated computational pipeline to detect fibers from a tomographically reconstructed X-ray volume. We apply our pipeline to a non-trivial dataset by Larson et al . To separate the fibers in these samples, we tested four different architectures of convolutional neural networks. When comparing our neural network approach to a semi-supervised one, we obtained Dice and Matthews coefficients reaching up to 98%, showing that these automated approaches can match human-supervised methods, in some cases separating fibers that human-curated algorithms could not find. The software written for this project is open source, released under a permissive license, and can be freely adapted and re-used in other domains.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

A Behavioral Robotics Approach to Radiation Mapping Using Adaptive Sampling

Radiation mapping is a desirable task to automate because of the inherent risks involved and its tedious nature. A novel system was designed to address this by combining various existing technologies, utilizing behavior-based robotics and Bayesian optimization. The system uses a quadruped robot equipped with a manipulator and gamma detector to take measurements at locations that are selected based on the uncertainty of a surrogate model used to estimate the true radiation field. The robot uses input from the world with depth cameras to avoid collisions with the robot’s body, and unreachable points for the end effector are addressed by both allowing for a soft collision with the environment to occur, prompting the system to abandon that point, and varying the exploration tendency of the optimization based on consecutive collisions. This approach provides unique traversability and adaptability over other strategies in the literature. Experiments were performed by placing a Cesium-137 source on the ground and varying geometric setups and an optimization parameter demonstrating the adaptability to diverse environments and the increased robustness resulting from the designed behavior. The results additionally demonstrate that dynamically adjusting the optimization algorithm’s exploration tendency based on the arm’s collision history improves the system’s ability to navigate cluttered environments and construct accurate radiation maps without getting stuck in unreachable areas.

Adams, Joel↗
DOE OSTI2020

Building Battery Energy Storage System Performance Data into an Economic Assessment

Economic assessments of battery energy storage systems (BESSs) rely on optimal dispatch methods to capture temporal interdependency of BESS operations and coupling among different grid applications. Many existing BESS economic assessment studies are based on a simplified first-order scalar model using BESS nameplate numbers. Such a method cannot accurately capture varying capabilities and nonlinear dynamics of a BESS, leading to inaccurate assessment results. This paper presents a practical implementation of performance data into the economic assessment of the BESSs recently developed within the Snohomish Public Utility District system in Washington State. Extensive testing conducted over multiple seasons is used to assess the technical performance and develop high-fidelity models of the BESSs. A dynamic programming algorithm is proposed to optimally dispatch the BESSs and assess the potential benefits from stacked value streams. The proposed method can be adapted for the economic assessment of other BESSs with different applications.

Wu, Di↗
DOE OSTI2021

Scaling pair count to next galaxy surveys

ABSTRACT Counting pairs of galaxies or stars according to their distance is at the core of real-space correlation analyses performed in astrophysics and cosmology. Upcoming galaxy surveys (LSST, Euclid) will measure properties of billions of galaxies challenging our ability to perform such counting in a minute-scale time relevant for the usage of simulations. The problem is only limited by efficient access to the data, hence belongs to the big data category. We use the popular Apache Spark framework to address it and design an efficient high-throughput algorithm to deal with hundreds of millions to billions of input data. To optimize it, we revisit the question of non-hierarchical sphere pixelization based on cube symmetries and develop a new one dubbed the ‘Similar Radius Sphere Pixelization’ (SARSPix) with very close to square pixels. It provides the most adapted indexing over the sphere for all distance-related computations. Using LSST-like fast simulations, we compute autocorrelation functions on tomographic bins containing between a hundred million to one billion data points. In each case, we achieve the construction of a standard pair-distance histogram in about 2 min, using a simple algorithm that is shown to scale, over a moderate number of nodes (16–64). This illustrates the potential of this new techniques in the field of astronomy where data access is becoming the main bottleneck. They can be easily adapted to other use-cases as nearest-neighbours search, catalogue cross-match or cluster finding. The software is publicly available from https://github.com/astrolabsoftware/SparkCorr.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2021

Interpreting Write Performance of Supercomputer I/O Systems with Regression Models

This work seeks to advance the state of the art in HPC I/O performance analysis and interpretation. In particular, we demonstrate effective techniques to: (1) model output performance in the presence of I/O interference from production loads; (2) build features from write patterns and key parameters of the system architecture and configurations; (3) employ suitable machine learning algorithms to improve model accuracy. We train models with five popular regression algorithms and conduct experiments on two distinct production HPC platforms. We find that the lasso and random forest models predict output performance with high accuracy on both of the target systems. We also explore use of the models to guide adaptation in I/O middleware systems, and show potential for improvements of at least 15% from model-guided adaptation on 70% of samples, and improvements up to 10× on some samples for both of the target systems.

Xie, Bing↗
DOE OSTI2022

Optimal Operation of PV Sources in DC Grids for Improving Technical, Economical, and Environmental Conditions by Using Vortex Search Algorithm and a Matrix Hourly Power Flow

This document presents a master–slave methodology for solving the problem of optimal operation of photovoltaic (PV) distributed generators (DGs) in direct current (DC) networks. This problem was modeled using a nonlinear programming model (NLP) that considers the minimization of three different objective functions in a daily operation of the system. The first one corresponds to the minimization of the total operational cost of the system, including the energy purchasing cost to the conventional generators and maintenance costs of the PV sources; the second objective function corresponds to the reduction of the energy losses associated with the transport of energy in the network, and the third objective function is related to the minimization of the total emissions of CO2 by the conventional generators installed on the DC grid. The minimization of these objective functions is achieved by using a master–slave optimization approach through the application of the Vortex Search algorithm combined with a matrix hourly power flow. To evaluate the effectiveness and robustness of the proposed approach, two test scenarios were used, which correspond to a grid-connected and a standalone network located in two different regions of Colombia. The grid-connected system emulates the behavior of the solar resource and power demand of the city of Medellín-Antioquia, and the standalone network corresponds to an adaptation of the generation and demand curves for the municipality of Capurganá-Choco. A numerical comparison was performed with four optimization methodologies reported in the literature: particle swarm optimization, multiverse optimizer, crow search algorithm, and salp swarm algorithm. The results obtained demonstrate that the proposed optimization approach achieved excellent solutions in terms of response quality, repeatability, and processing times.

14 SOLAR ENERGY↗
DOE OSTI2024

Haar-Like Wavelets on Hierarchical Trees

Here, discrete wavelet methods, originally formulated in the setting of regularly sampled signals, can be adapted to data defined on a point cloud if some multiresolution structure is imposed on the cloud. A wide variety of hierarchical clustering algorithms can be used for this purpose, and the multiresolution structure obtained can be encoded by a hierarchical tree of subsets of the cloud. Prior work introduced the use of Haar-like bases defined with respect to such trees for approximation and learning tasks on unstructured data. This paper builds on that work in two directions. First, we present an algorithm for constructing Haar-like bases on general discrete hierarchical trees. Second, with an eye towards data compression, we present thresholding techniques for data defined on a point cloud with error controlled in the $L$ $\infty$ norm and in a Hölder-type norm. In a concluding trio of numerical examples, we apply our methods to compress a point cloud dataset, study the tightness of the $L$ $\infty$ error bound, and use thresholding to identify MNIST classifiers with good generalizability.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Neuromorphic learning with Mott insulator NiO

Habituation and sensitization (nonassociative learning) are among the most fundamental forms of learning and memory behavior present in organisms that enable adaptation and learning in dynamic environments. Emulating such features of intelligence found in nature in the solid state can serve as inspiration for algorithmic simulations in artificial neural networks and potential use in neuromorphic computing. In this work, we demonstrate nonassociative learning with a prototypical Mott insulator, nickel oxide (NiO), under a variety of external stimuli at and above room temperature. Similar to biological species such as Aplysia, habituation and sensitization of NiO possess time-dependent plasticity relying on both strength and time interval between stimuli. A combination of experimental approaches and first-principles calculations reveals that such learning behavior of NiO results from dynamic modulation of its defect and electronic structure. An artificial neural network model inspired by such nonassociative learning is simulated to show advantages for an unsupervised clustering task in accuracy and reducing catastrophic interference, which could help mitigate the stability–plasticity dilemma. Mott insulators can therefore serve as building blocks to examine learning behavior noted in biology and inspire new learning algorithms for artificial intelligence.

42 ENGINEERING↗
DOE OSTI2024

Utilizing a Virtual Sodium-Cooled Fast Reactor Digital Twin to Aid in Diversion Pathway Analysis for International Safeguards Applications

We report digital twin technology has the potential to improve the effectiveness of international safeguards inspectors by providing a tool which can: first, perform an accurate diversion path analysis, identify their indicators, and required sensors to detect them; and second, monitor facilities in real-time using critical data streams that benefit from this safeguards-by-design approach. Safeguards inspectors are required to visit facilities and verify the nuclear material to ensure no diversion has taken place and detect misuse of the facility; however, this analysis and verification effort is time consuming, and with limited funding it is imperative that time spent at a nuclear facility is focused on key areas. A virtual digital twin of three prototypic sodium fast reactors was developed, where diversion and misuse scenarios were explored to determine how a digital twin could provide inspectors with an understanding of how proliferation may occur and where the most likely areas for proliferation would be. For each of the three reactors, an optimization algorithm was able to find core designs which would be difficult to detect via sensors alone; however, the use of a machine learning adapter provided by the digital twin was able to show general trends in where proliferation as likely to take place.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2025

Framework for assessment of magnetic equilibrium controller performance on the MAST upgrade spherical tokamak

Here, in this work we present the assessment framework for magnetic equilibrium controllers on MAST Upgrade spherical tokamak (MAST-U) spherical tokamak. Such controllers are essential for the MAST-U since exhaust physics and core-edge integration studies require advanced divertor plasma configurations. The developed framework is based on the TokSys suite of plasma control codes, which was adapted and upgraded for MAST-U. However, extra capabilities were added on top of TokSys to support the development of new control algorithms, deployment of controllers to the plasma control system (PCS) and evaluation of their performance. The controller assessment was realized via closed-loop integrated control simulations with the actual MAST-U PCS and different physics-based plasma models. Since all components of the assessment chain were experimentally validated, these simulations provide qualified controllers applicable for direct use in the experiment. This resulted in the successful experimental demonstration of advanced plasma shape control on MAST-U with minimal on-machine development time. A similar methodology would be beneficial to other tokamaks, both existing and future.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2021

Algebraic Algorithms for Betweenness and Percolation Centrality

Abstract In this paper, we explored different ways to write the algebraic version of betweenness centrality algorithm. Particularly, we focused on Brandes' algorithm. We aimed for algebraic betweenness centrality that can be parallelized easily. We proposed 3-tuple geodetic semiring as an extension to the usual geodetic semiring with 2-tuples. Using the 3-tuple geodetic semiring, Dijkstra's and Brandes' algorithm, we wrote more concise and general algebraic betweenness centrality (ABC) algorithm which is valid for weighted and directed graphs. We also proposed an alternative version of ABC using the usual geodetic semiring with 2-tuple where we used a simple way to construct shortest path tree after computing shortest path distances in the usual geodetic semiring. This allows us to avoid computational complexity of ABC implementation using 3-tuple geodetic semiring. We used numba to optimize and parallelize ABC. We evaluated the performance of ABC using 2-tuple geodetic semiring as compared to NetworkX, a common python package for graph algorithms. We did scalability experiments on parallel ABC and showed its total speedup. We also showed that with small modification, ABC can be adapted to algebraicly compute other centrality measures such as percolation centrality.

97 MATHEMATICS AND COMPUTING↗