Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Comparative framework”

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 667 records · Page 37
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Interpretable machine learning-guided design of Fe-based soft magnetic alloys

Here, we present a machine learning (ML) guided approach to predict saturation magnetization (𝑀 S ) and coercivity (𝐻 C ) in Fe-rich soft magnetic alloys, particularly Fe-Si-B systems. ML models trained on experimental data reveal that increasing Si and B content reduces 𝑀 S from 1.81 T (DFT ≈ 2.04 T) to ≈1.54 T (DFT ≈ 1.56T) in Fe-Si-B, which is attributed to decreased magnetic density and structural modifications. Experimental validation of ML predicted magnetic saturation on Fe-1Si-1B (2.09 T), Fe-5Si-5B (2.01 T), and Fe-10Si-10B (1.54 T) alloy compositions further supports our findings. These trends are consistent with density functional theory predictions, which link increased electronic disorder and band broadening to lower 𝑀 S values. Experimental validation on selected alloys confirms the predictive accuracy of the ML model, with good agreement across compositions. Beyond predictive accuracy, detailed uncertainty quantification and model interpretability including through feature importance and partial dependence analysis reveal that 𝑀 S is governed by a nonlinear interplay between Fe content and early transition metal ratios, while 𝐻 C is more sensitive to processing conditions such as ribbon thickness and thermal treatment windows. The ML framework was further applied to Fe-Si-B/Cr/Cu/Zr/Nb alloys in a pseudoquaternary compositional space, which shows comparable magnetic properties to NANOMET (Fe 84.8 ⁢Si 0.5 ⁢B 9.4 ⁢Cu 0.8⁢ P 3.5 ⁢C 1 ), FINEMET (Fe 73.5 ⁢Si 13.5 ⁢B 9 Cu 1 ⁢Nb 3 ), NANOPERM (Fe 88 ⁢Zr 7⁢ B 4 ⁢Cu 1 ), and HITPERM (Fe 44 ⁢Co 44 ⁢Zr 7⁢ B 4 ⁢Cu 1 . Our findings demonstrate the potential of the ML framework for accelerated search of high-performance soft magnetic materials.

density functional theory↗
DOE OSTI2024

Federated Deep Reinforcement Learning for Decentralized VVO of BTM DERs

The future of grid control requires a hybrid approach combining centralized and decentralized methods to fully utilize the potential of smart edge devices with artificial intelligence (AI) capabilities. This paper aims to develop and evaluate a federated deep reinforcement learning (FDRL) framework for decentralized adaptive volt-var optimization (VVO) of behind-the-meter (BTM) distributed energy resources (DERs). First, this paper models a single deep reinforcement learning (DRL) agent using the Markov Decision Process (MDP) framework for decentralized adaptive VVO of BTM DERs. Two DRL algorithms, soft actor-critic (SAC) and twin-delayed deep deterministic policy gradient (TD3), are compared for their effectiveness in optimizing VVO. Results show that TD3 outperforms SAC, achieving a 71.3% improvement in mean reward. Finally, the DRL agent is deployed within the FDRL framework, using the Flower platform, to enhance learning, provide adaptive control, and ensure data privacy for BTM DERs.

Ravi, Abhijith↗
DOE OSTI2025

Advancing stream temperature prediction with a generalizable large-sample framework across CONUS river reaches

Accurately predicting stream temperature in ungauged basins remains a critical challenge for water resource management, thermoelectric power plant cooling, and ecosystem conservation. Large-sample machine learning models trained on hundreds of well-monitored river basins have shown remarkable performance; however, such models have yet to be developed solely using forcing data that can be readily extracted to simulate stream temperatures anywhere in the contiguous United States (CONUS). In this study, we present a scalable, large-sample deep learning framework using Long Short-Term Memory (LSTM) networks to simulate daily stream temperatures in ungauged basins across the CONUS. The framework leverages both modeled reanalysis of meteorological and streamflow inputs as well as static attributes available for all 2.7 million CONUS river reaches in the National Hydrography Dataset Plus (NHDPlusV2). By generating dynamical inputs from predefined thermally relevant upstream contributing areas, rather than the entire upstream basin, the model also offers improvements in very large basins where full-basin averaging can dilute the most important influences on stream temperature. Evaluated across 300 basins, the model achieves a median Mean Absolute Error (MAE) of 1.1 °C and a Nash-Sutcliffe Efficiency (NSE) of 0.95 on temporally and spatially distinct test folds—comparable to models trained exclusively using meteorological and streamflow observational data. The flexible, high-performing framework generalizes to any unmonitored river reach without significant regulation or unnatural thermal input immediately upstream, substantially expanding predictive capabilities in data-scarce regions.

Hydrology↗
DOE OSTI2023

Rolling Horizon Based Temporal Decomposition for the Offline Pickup and Delivery Problem with Time Windows

The offline pickup and delivery problem with time windows (PDPTW) is a classical combinatorial optimization problem in the transportation community, which has proven to be very challenging computationally. Due to the complexity of the problem, practical problem instances can be solved only via heuristics, which trade-off solution quality for computational tractability. Among the various heuristics, a common strategy is problem decomposition, that is, the reduction of a large-scale problem into a collection of smaller sub-problems, with spatial and temporal decompositions being two natural approaches. While spatial decomposition has been successful in certain settings, effective temporal decomposition has been challenging due to the difficulty of stitching together the sub-problem solutions across the decomposition boundaries. In this work, we introduce a novel temporal decomposition scheme for solving a class of PDPTWs that have narrow time windows, for which it is able to provide both fast and high-quality solutions. We utilize techniques that have been popularized recently in the context of online dial-a-ride problems along with the general idea of rolling horizon optimization. To the best of our knowledge, this is the first attempt to solve offline PDPTWs using such an approach. To show the performance and scalability of our framework, we use the optimization of paratransit services as a motivating example. Due to the lack of benchmark solvers similar to ours (i.e., temporal decomposition with an online solver), we compare our results with an offline heuristic algorithm using Google OR-Tools. In smaller problem instances (with an average of 129 requests per instance), the baseline approach is as competitive as our framework. However, in larger problem instances (approximately 2,500 requests per instance), our framework is more scalable and can provide good solutions to problem instances of varying degrees of difficulty, while the baseline algorithm often fails to find a feasible solution within comparable compute times.

Kim, Youngseo↗
DOE OSTI2022

Accelerating Scientific Workflows on HPC Platforms with In Situ Processing

Scientific workflows drive most modern large-scale science breakthroughs by allowing scientists to define their computations as a set of jobs executed in a given order based on their data dependencies. Workflow management systems (WMSs) have become key to automating scientific workflows-executing computational jobs and orchestrating data transfers between those jobs running on complex high-performance computing (HPC) platforms. Traditionally, WMSs use files to communicate between jobs: a job writes out files that are read by other jobs. However, HPC machines face a growing gap between their storage and compute capabilities. To address that concern, the scientific community has adopted a new approach called in situ, which bypasses costly parallel filesystem I/O operations with faster in-memory or in-network communications. When using in situ approaches, communication and computations can be interleaved. In this work, we leverage the Decaf in situ dataflow framework to accelerate task-based scientific workflows managed by the Pegasus WMS, by replacing file communications with faster MPI messaging. We propose a new execution engine that uses Decaf to manage communications within a sub-workflow (i.e., set of jobs) to optimize inter-job communications. We consider two workflows in this study: (i) a synthetic workflow that benchmarks and compares file- and MPI-based communication; and (ii) a realistic bioinformatics workflow that computes mu-tational overlaps in the human genome. Experiments show that in situ communication can improve the bioinformatics workflow execution time by 22% to 30% compared with file communication. Our results motivate further opportunities and challenges for bridging traditional WMSs with in situ frameworks.

Decaf↗
DOE OSTI2021

Prevalence of human papillomavirus genotypes in high-grade cervical precancer and invasive cervical cancer from cancer registries before and after vaccine introduction in the United States

Background. US population-based cancer registries can be used for surveillance of human papillomavirus (HPV) types found in HPV-associated cancers. Using this framework, HPV prevalence among high-grade cervical precancers and invasive cervical cancers were compared before and after HPV vaccine availability. Methods. Archived tissue from 2 studies of cervical precancers and invasive cervical cancers diagnosed from 1993-2005 (prevaccine) were identified from 7 central cancer registries in Florida; Hawaii; Iowa; Kentucky; Louisiana; Los Angeles County, California; and Michigan; from 2014 through 2015 (postvaccine) cases were identified from 3 registries in Iowa, Kentucky, and Louisiana. HPV testing was performed using L1 consensus polymerase chain reaction analysis. HPV-type–specific prevalence was examined grouped by hierarchical attribution to vaccine types: HPV 16, 18, HPV 31, 33, 45, 52, 58, other oncogenic HPV types, and other types/HPV negative. Generalized logit models were used to compare HPV prevalence in the prevaccine study to the postvaccine study by patient age, adjusting for sampling factors. Results. A total of 676 precancers (328 prevaccine and 348 postvaccine) and 1140 invasive cervical cancers (777 prevaccine and 363 postvaccine) were typed. No differences were observed in HPV-type prevalence by patient age between the 2 studies among precancers or invasive cancers. Conclusions. The lack of reduction in vaccine-type prevalence between the 2 studies is likely explained by the low number of cases and low HPV vaccination coverage among women in the postvaccine study. Monitoring HPV-type prevalence through population-based strategies will continue to be important in evaluating the impact of the HPV vaccine.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2021

Jet tagging in the Lund plane with graph networks

The identification of boosted heavy particles such as top quarks or vector bosons is one of the key problems arising in experimental studies at the Large Hadron Collider. In this article, we introduce LundNet, a novel jet tagging method which relies on graph neural networks and an efficient description of the radiation patterns within a jet to optimally disentangle signatures of boosted objects from background events. We apply this framework to a number of different benchmarks, showing significantly improved performance for top tagging compared to existing state-of-the-art algorithms. We study the robustness of the LundNet taggers to non-perturbative and detector effects, and show how kinematic cuts in the Lund plane can mitigate overfitting of the neural network to model-dependent contributions. Finally, we consider the computational complexity of this method and its scaling as a function of kinematic Lund plane cuts, showing an order of magnitude improvement in speed over previous graph-based taggers.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

Thermodynamic modeling of countercurrent chemical looping reverse water gas shift process for redox material screening

The reverse water gas shift (RWGS) reaction is a key pathway for CO 2 utilization, particularly within Power-to-X process chains aimed at sustainable fuel and chemical production. Countercurrent chemical looping (CL-RWGS) using non-stoichiometric oxides can overcome equilibrium limitations of conventional RWGS reactors, enabling significantly higher CO 2 conversions. However, modeling the limiting performance of such systems is challenging due to their multiphase nature and coupled spatial and temporal variation in chemical composition. In this work, we present a discretized batch equilibrium model that simulates CL-RWGS reactors as a series of localized equilibrium exchanges between gas and solid elements. The model is numerically stable, computationally efficient, and free of kinetic source terms, making it well-suited for parametric studies and system-level integration. It is validated against established convection–diffusion models and shown to predict reasonable upper bounds on experimental results. Application of the model to a range of oxygen carrier materials identifies cerium–zirconium solid solutions, particularly Ce 0.80 Zr 0.20 O 2 , as a promising class offering superior oxygen storage characteristics compared to state-of-the-art La 0.6 Sr 0.4 FeO 3 . This framework provides a robust platform for materials screening, reactor sizing, and performance optimization in chemical looping systems. The model implementation is available as open-source software to support further research and development.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2020

Graph interpolating activation improves both natural and robust accuracies in data-efficient deep learning

Improving the accuracy and robustness of deep neural nets (DNNs) and adapting them to small training data are primary tasks in deep learning (DL) research. In this paper, we replace the output activation function of DNNs, typically the data-agnostic softmax function, with a graph Laplacian-based high-dimensional interpolating function which, in the continuum limit, converges to the solution of a Laplace–Beltrami equation on a high-dimensional manifold. Furthermore, we propose end-to-end training and testing algorithms for this new architecture. The proposed DNN with graph interpolating activation integrates the advantages of both deep learning and manifold learning. Compared to the conventional DNNs with the softmax function as output activation, the new framework demonstrates the following major advantages: First, it is better applicable to data-efficient learning in which we train high capacity DNNs without using a large number of training data. Second, it remarkably improves both natural accuracy on the clean images and robust accuracy on the adversarial images crafted by both white-box and black-box adversarial attacks. Third, it is a natural choice for semi-supervised learning. This paper is a significant extension of our earlier work published in NeurIPS, 2018. For reproducibility, the code is available at https://github.com/BaoWangMath/DNN-DataDependentActivation .

Mathematics↗
DOE OSTI2025

Critically assessing sodium-ion technology roadmaps and scenarios for techno-economic competitiveness against lithium-ion batteries

Sodium-ion batteries have garnered notable attention as a potentially low-cost alternative to lithium-ion batteries, which have experienced supply shortages and price volatility for key minerals. Here we assess their techno-economic competitiveness against incumbent lithium-ion batteries using a modelling framework incorporating componential learning curves constrained by minerals prices and engineering design floors. We compare projected sodium-ion and lithium-ion price trends across over 6,000 scenarios while varying Na-ion technology development roadmaps, supply chain scenarios, market penetration and learning rates. Assuming that substantial progress can be made along technology roadmaps via targeted research and development, we identify several sodium-ion pathways that might reach cost-competitiveness with low-cost lithium-ion variants in the 2030s. In addition, we show that timelines are highly sensitive to movements in critical minerals supply chains—namely that of lithium, graphite and nickel. Our modelled outcomes suggest that being price advantageous against low-cost lithium-ion variants in the near term is challenging and increasing sodium-ion energy densities to decrease materials intensity is among the most impactful ways to improve competitiveness.

25 ENERGY STORAGE↗
DOE OSTI2021

Partial dynamical symmetry versus quasi dynamical symmetry examination within a quantum chaos analyses of spectral data for even–even nuclei

Statistical analyses of the spectral distributions of rotational bands in 51 deformed prolate even–even nuclei in the 152 ≤ A ≤ 250 mass region $R_{{4_{1}^{ + } /2_{1}^{ + } }} \ge 3.00$ are examined in terms of nearest neighbor spacing distributions. Specifically, the focus is on data for 0 + , 2 + , and 4 + energy levels of the ground, gamma, and beta bands. The chaotic behavior of the gamma band, especially the position of the $2_{\gamma }^{ + }$ band-head compared to other levels and bands, is clear. The levels are analyzed within the framework of two models, namely, a SU(3)-partial dynamical symmetry Hamiltonian and a SU(3) two-coupled quasi-dynamical symmetry Hamiltonian, with results that are further analyzed using random matrix theory. The partial and quasi dynamics both yield outcomes that are in reasonable agreement with the known experimental results. However, due to the degeneracy of the beta and gamma bands within the simplest SU(3) picture, the theory cannot be used to describe the fluctuation properties of excited bands. By changing relative weights of the different terms in the partial and quasi dynamical Hamiltonians, results are obtained that show more GOE-like statistics in the partial dynamical formalism as the strength of the pairing term is increased. Also, in the quasi-dynamical symmetry limit, more correlations are found because of the stronger couplings.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Promotion of adsorptive and catalytic properties of zeolitic Brønsted acid sites by proximal extra-framework Si(OH) x groups

Steric confinement in zeolites influences the catalytic conversion of alkanes. For zeolitic Brønsted acid sites, proximate extra-framework species introduce additional confinement to the pore constraints, enhancing the catalytic activity of alkane cracking. Although extra-framework alumina has been the most studied, here we report the element-specific impact of silica species. Further, by grafting extra-framework silica species close to Brønsted acid sites in H-ZSM-5 zeolite, the binding of bases like pyridine and amines is strengthened via van der Waals interactions with their aryl or alkyl chains. Brønsted acid sites close to extra-framework silica achieve a higher reaction rate of protolytic cracking of n-pentane via enthalpic (unlike entropic, as with extra-framework alumina) stabilization of the transition state by 24–51 kJ mol −1 . The lower activation energy points to an earlier transition state than in the presence of extra-framework alumina, with a better stabilization of the carbonium ions in the transition state compared to the parent zeolite.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2025

Optimal observables for the chiral magnetic effect from machine learning

The detection of the chiral magnetic effect (CME) in relativistic heavy-ion collisions remains challenging due to substantial background contributions that obscure the expected signal. In this Letter, we present a novel machine learning approach for constructing optimized observables that significantly enhance CME detection capabilities. By parametrizing generic observables constructed from flow harmonics and optimizing them to maximize the signal-to-background ratio, we systematically develop CME-sensitive measures that outperform conventional methods. Using simulated data from the anomalous viscous fluid dynamics framework, our machine learning observables demonstrate up to 90% higher sensitivity to CME signals compared to traditional 𝛾 and 𝛿 correlators, while maintaining minimal background contamination. The constructed observables provide physical insight into optimal CME detection strategies and offer a promising path forward for experimental searches of the CME at the BNL Relativistic Heavy Ion Collider and the CERN Large Hadron Collider.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2026

Computing nuclear response functions with time-dependent coupled-cluster theory

We compute nuclear response functions by solving the time-dependent 𝐴-body Schrödinger equation, recording the time-dependent transition moment and extracting spectral information via Fourier transforms. The solution of the time-dependent many-body problem accounts for correlations on top of the mean field by taking advantage of a time-dependent formulation of coupled-cluster theory. As a validation, we focus on electric dipole transitions in 4 He and 16 O and compare moments of the response function distribution to the results of an equivalent static framework, finding negligible discrepancies. We investigate how proton and neutron densities evolve in time, and we see the traditional picture of soft and giant dipole resonances as collective oscillations of protons and neutrons emerging from our calculations in 16 O and 24 O. Furthermore, this method also allows us to investigate the behavior of the nucleus in the presence of a strong electric field. In that regime, the behavior of the system becomes chaotic. Qualitatively, the spectral information obtained in this limit is in line with previous time-dependent mean-field results.

Ab initio calculations↗
DOE OSTI2025

Network Anomaly Detection in Distributed Edge Computing Infrastructure

As networks continue to grow in complexity and scale, detecting anomalies has become increasingly challenging, particularly in diverse and geographically dispersed environments. Traditional approaches often struggle with managing the computational burden associated with analyzing large-scale network traffic to identify anomalies. This paper introduces a distributed edge computing framework that integrates federated learning with Apache Spark and Kubernetes to address these challenges. We hypothesize that our approach, which enables collaborative model training across distributed nodes, significantly enhances the detection accuracy of network anomalies across different network types. We show that by leveraging distributed computing and containerization technologies, our framework not only improves scalability and fault tolerance but also achieves superior detection performance compared to state-of-the-art methods. Extensive experiments on the UNSW-NB15 and ROAD datasets validate the effectiveness of our approach, demonstrating statistically significant improvements in detection accuracy and training efficiency over baseline models, as confirmed by MannWhitney U and Kolmogorov-Smirnov tests (p<0.05).

Marfo, William [University of Texas at El Paso,Dep↗
DOE OSTI2020

Real-time Simulation of Coordinated Sub-Transmission Volt-Var Control Tool under High Distributed PV Penetration

With the rapid penetration of intermittent solar photovoltaic (PV) and other distributed energy resources (DER) into the grid, and subsequent changes in power flow patterns in both distribution and sub-transmission, voltage regulation is becoming a major challenge. It is prudent to leverage PV and DER to provide ancillary services to the grid, such as voltage regulation. Recently, a quasi-static, coordinated real-time sub transmission volt-var control algorithm (CReST-VCT) was developed for voltage regulation under high PV penetration by dispatching the reactive power settings of the shunt devices and PV inverters. The algorithm was validated offline, on a quasistatic study. Such quasi-static dispatching algorithms cannot guarantee its performance for highly nonlinear dynamical power systems. In this paper the performance of the algorithm is validated with a real time nonlinear dynamic simulation of a modified IEEE 118 bus system in Opal-RT. The real time simulation is used to emulate the actual system operation, providing a more realistic testing environment for CReST-VCT. The dispatch and control signals are communicated between the power system (Opal solver) and the control center (GAMS solver) in real-time with a MODBUS bridge. The results demonstrate i) system is stable with the new dispatch points ii) significant improvement in system-wide voltage profiles compared to an uncontrolled scenario. Another significant contribution of the work is developing a framework for dispatchable, long duration dynamic simulations that can be leveraged for market/dispatch studies.

CReST-VCT, Opal-RT, Volt/Var Control, renewable in↗
DOE OSTI2020

A Hierarchical Volt-var Optimization with Discrete Variables in Unbalanced Distribution Systems

This paper proposes a framework to determine the optimal active and reactive power dispatch of distributed photovoltaic (PV) generation, switched capacitors, and voltage regulators in multi-phase unbalanced distribution systems. The objectives of the optimal dispatch are minimization of the energy loss, PV real power curtailment, and switching operations of capacitors and voltage regulators, in addition to elimination of voltage violation and reverse power flow. The optimization problem is formulated in rectangular coordinates as a nonlinear, nonconvex problem with discrete variables. A hierarchical twostage framework is proposed to effectively handle those discrete variables and reduce the computational time compared to the unified approach in which all variables are solved simultaneously. The efficacy of the proposed approach and the accuracy of the obtained numerical solution is validated using the unbalanced multi-phase IEEE 34-bus with 15-minute load and PV data.

Nguyen, Quan H.↗
DOE OSTI2023

A single-tree algorithm to compute the Euclidean minimum spanning tree on GPUs

Computing the Euclidean minimum spanning tree (Emst) is a computationally demanding step of many algorithms. While work-efficient serial and multithreaded algorithms for computing Emst are known, designing an efficient GPU algorithm is challenging due to a complex branching structure, data dependencies, and load imbalances. In this paper, we propose a single-tree $Bor\mathring{u}vka$-based algorithm for computing Emst on GPUs. We use an efficient nearest neighbor algorithm and reduce the number of the required distance calculations by avoiding traversing subtrees with leaf nodes in the same component. The developed algorithms are implemented in a performance portable way using ArborX, an open-source geometric search library based on the Kokkos framework. We evaluate the proposed algorithm on various 2D and 3D datasets, show and compare it with the current state-of-the-art open-source CPU implementations. We demonstrate 4-24 × speedup over the fastest multi-threaded implementation. We prove the portability of our implementation by providing results on a variety of hardware: AMD EPYC 7763, Nvidia A100 and AMD MI250X. We show scalability of the implementation, computing Emst for 37 million 3D cosmological dataset in under a 0.5 second on a single A100 Nvidia GPU.

Prokopenko, Andrey↗