Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algorithm development”

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,423 records · Page 79
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Resilience Through Data-Driven, Intelligent Designed Control: A Formal Methods Approach

The PNNL and GTRI team developed a strategy to integrate temporal logic rule specification for detection of cyber-intrusion in the source code and control algorithms of CPS using advanced cyber-data. The GTRI team utilized its capabilities in rule synthesis and temporal logic specifications for software assurance and verification to detect and predict impact of cyber-intrusions and malware in the computational and control algorithms of cyber-physical systems. The team also developed a testing and verification approach that could be used to validate the suggested approach against a realistic use-case CPS showcasing improvements in system impact prediction performance. Temporal logic offers a compact expression of events in absolute and relative time and has a formalized translation to state machines. As such, temporal logic rules can feasibly be synthesized to any system as a rule engine, with the process being formally verified to be correct. The goal here is to utilize temporal logic rules to detect cyber-attacks and manipulations in the computational algorithms and provide real-time software assurance and verification guarantees.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

FY22 Progress Report: SRNL Analysis of ICCWR LCM and WAMS Data for Corrosion and Cracking

Algorithms for machine learning and data analysis for the 3013 Surveillance Program are being developed in an ongoing collaborative effort by the Savannah River National Laboratory (SRNL) and the University of South Carolina (USC). To detect the presence of corrosion and cracking, data is collected from large binary files generated by a Laser Confocal Microscope (LCM) or Wide Area 3D Measurement System (WAMS). Software is being developed to use the physical attributes in the data files (e.g., height, color, and grayscale values; all as functions of a location in a plane projection) to detect the presence of surface corrosion and cracking. A user-friendly Matlab Graphical User Interface (GUI) that reads data from either LCM or WAMS files was developed to integrate input data with software developed for processing and evaluation. The GUI can selectively download binary data, interrogate data attributes, label data for training ML algorithms, flag significant features, execute Machine Learning (ML) algorithms, output parameters from trained ML algorithms, report ML model accuracy with respect to labeled data, and generate graphical representations for various analyses. Surface defects can be called out by setting user-specified thresholds, feature based analysis or machine learning algorithms. Enhancements to data labeling capability have been developed to address this essential precursor to application of ML routines. Efficient labeling is particularly important in view of the very large volume of data required to train ML algorithms.

3013 Corrosion↗
DOE OSTI2022

An adaptive stochastic sequential quadratic programming with differentiable exact augmented lagrangians

In this study, we consider solving nonlinear optimization problems with a stochastic objective and deterministic equality constraints. We assume for the objective that its evaluation, gradient, and Hessian are inaccessible, while one can compute their stochastic estimates by, for example, subsampling. We propose a stochastic algorithm based on sequential quadratic programming (SQP) that uses a differentiable exact augmented Lagrangian as the merit function. To motivate our algorithm design, we first revisit and simplify an old SQP method Lucidi developed for solving deterministic problems, which serves as the skeleton of our stochastic algorithm. Based on the simplified deterministic algorithm, we then propose a non-adaptive SQP for dealing with stochastic objective, where the gradient and Hessian are replaced by stochastic estimates but the stepsizes are deterministic and prespecified. Finally, we incorporate a recent stochastic line search procedure Paquette and Scheinberg into the non-adaptive stochastic SQP to adaptively select the random stepsizes, which leads to an adaptive stochastic SQP. The global "almost sure" convergence for both non-adaptive and adaptive SQP methods is established. Numerical experiments on nonlinear problems in CUTEst test set demonstrate the superiority of the adaptive algorithm.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Inverse Calculation of Burden Distribution Matrix Using B-spline Model Based PDF control in Blast Furnace Burden Charging Process

The inverse calculation of burden distribution matrix (BDM) is one of the most important challenges in the blast furnace operation in iron-making processes. In general, blast furnace consumes 65% of the total energy for the whole steel-making. Focusing on this practical challenge, this article proposes a new burden distribution spatial model in calculating burden charging process, and develops a B-spline approximation-based probability density function (PDF) control algorithm to assign the expected thickness distribution of burden layer and, thus, develops a new method for the required inverse calculation of BDM. First, a novel method for the thickness distribution of burden layer is given using B-spline model to produce an expected distribution shape subjected to a desired tracking within a specific spatial constraint. Then, according to the coexistence of continuous and bounded discrete variables in BDM, a novel hybrid optimization control method by combining integer programming and PDF tracking is further established for the effective inverse calculation of BDM. Finally, the proposed PDF-based iterative inverse calculation of BDM using B-spline models are tested using various data from industrial examples. Furthermore, the simulation results show that the proposed method is well suited to solve the BDM inverse calculation problem in practice.

42 ENGINEERING↗
DOE OSTI2023

Plasma-based global pathway analysis to understand the chemical kinetics of plasma-assisted combustion and fuel reforming

The Global Pathway Analysis (GPA) algorithm helps analyze the chemical kinetics of complex combustion systems by identifying important global reaction pathways connecting a source species to a sink species through various important intermediate species (i.e., hub species). Here, the present work aims to extend GPA algorithm to plasma-assisted combustion and fuel reforming systems to identify the dominant global pathways in such systems at various conditions. In addition, the present study extends the ability of GPA algorithm to identify reaction cycles involving the excitation of high-concentration species (e.g., O 2 , N 2 , and fuel) to their vibrational and electronic states and the subsequent de excitation to their ground state, based on their significance on the reactivity of plasma-assisted systems in terms of gas heating and radical production. Provisions are made in the GPA algorithm to evaluate the reactivity of identified re action pathways and cycles based on the element-flux transfer (i.e., dominance), heat release, and radical production rate. The newly developed Plasma-based Global Pathway Analysis (PGPA) algorithm is then used to analyze the plasma assisted combustion of ammonia and reforming of methane. The PGPA analyses elucidated the significance of vibrational-translational cycles on the reactivity of NH 3 /air mixtures. Further, analyses on the production of NO ascribed the early reforming of NH 3 to N 2 and H 2 in impeding the production of NO during plasma-assisted NH 3 ignition. Lastly, the enhanced reforming of CH 4 /N 2 mixtures using plasma has been attributed to electron impact dissociation of CH 4 when compared to thermal reforming. In contrast, conventional path-Flux analysis (PFA) was found to require significant manual effort and pre-analysis intuitions from expert knowledge, making it arduous to provide valuable in sights into plasma chemistry. The user-friendly and automated nature of PGPA thus provides a valuable tool for assessing the kinetics of plasma-assisted systems helpful in analyzing and, further, a foundation in reducing plasma-assisted chemistry, without the needs of expert knowledge.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2025

MOOSE ProbML: Parallelized probabilistic machine learning and uncertainty quantification for computational energy applications

Here, this paper presents the development and demonstration of massively parallel probabilistic machine learning (ML) and uncertainty quantification (UQ) capabilities within the Multiphysics Object-Oriented Simulation Environment (MOOSE), an open-source computational platform for parallel finite element and finite volume analyses. In addressing the computational expense and uncertainties inherent in complex multiphysics simulations, this paper integrates Gaussian process (GP) variants, active learning, Bayesian inverse UQ, adaptive forward UQ, Bayesian optimization, evolutionary optimization, and Markov chain Monte Carlo (MCMC) within MOOSE. It also elaborates on the interaction among key MOOSE systems — Sampler, MultiApp, Reporter, and Surrogate — in enabling these capabilities. The modularity offered by these systems enables development of a multitude of probabilistic ML and UQ algorithms in MOOSE. Example code demonstrations include parallel active learning and parallel Bayesian inference via active learning. The impact of these developments is illustrated through five applications relevant to computational energy applications: UQ of nuclear fuel fission product release, using parallel active learning Bayesian inference; very rare events analysis in nuclear microreactors using active learning; advanced manufacturing process modeling using multi-output GPs (MOGPs) and dimensionality reduction; fluid flow using deep GPs (DGPs); and tritium transport model parameter optimization for fusion energy, using batch Bayesian optimization. These capabilities are part of the MOOSE framework.

97 - MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Enabling cooperative adaptive cruise control on strings of vehicles with heterogeneous dynamics and powertrains

Recent studies have shown that positive impact of Cooperative Adaptive Cruise Control (CACC) can only be guaranteed as market penetration rate increases. Removing the string homogeneity constraint is essential to encourage widespread adoption. In this work, a hierarchical architecture is proposed to enable CACC on vehicles with not only mixed dynamics but also different powertrain types. A low-level layer deals with the vehicle and powertrain dynamics to provide accurate and consistent reference speed tracking response. The high-level layer uses: (1) a Linear Parameter Varying feedback system to provide loop stability, robustness and enforce a variable time gap policy and (2) a feedforward system that processes Vehicle-to-Vehicle information to enhance string stability and response bandwidth, by dealing with the string heterogeneity. A gap management strategy is built on top of the CACC architecture to handle gap setting changes or cut-in/out situations, via a dynamics constrained time gap trajectory planning algorithm. We report the proposed work has been designed, developed and validated on three different real passenger vehicles on public highways and test tracks, showing the potential of the proposed algorithm to enable robust string stable CACC, despite the different dynamics and powertrains considered.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2025

Ensemble Simulation Techniques and Fast Randomized Algorithms

The major goals of the project were to develop and analyze new ensemble simulation techniques, including trajectory stratification and preconditioned MCMC techniques, as well as develop fast numerical linear algebra techniques closely related to ensemble simulation ideas. The trajectory stratification techniques involve simulating in parallel short trajectory fragments of a Markov process confined to a specific region of space‐time and then patching together the statistics gathered to assemble estimates of very general dynamical properties. We have also developed this approach for rare event simulation and extended the techniques to applications requiring a more general framework (such as electronic structure calculations). The preconditioned MCMC techniques involve simulating multiple Markov chains in parallel and then using information from the ensemble to speed the mixing of each individual chain. The fast randomized linear algebra methods are motivated by the diffusion Monte Carlo technique, but are applicable to finding the dominant eigenvalue of (almost) general matrices. For most non‐negative matrices, the schemes result in an error (compared to the power method) that is constant in the dimension of the problem. For more general matrices, we see a very clear sublinear cost trend in computational tests.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2020

Fast and Universal Kohn-Sham Density Functional Theory Algorithm for Warm Dense Matter to Hot Dense Plasma

Understanding many processes, e.g., fusion experiments, planetary interiors, and dwarf stars, depends strongly on microscopic physics modeling of warm dense matter and hot dense plasma. This complex state of matter consists of a transient mixture of degenerate and nearly free electrons, molecules, and ions. This regime challenges both experiment and analytical modeling, necessitating predictive ab initio atomistic computation, typically based on quantum mechanical Kohn-Sham density functional theory (KS-DFT). However, cubic computational scaling with temperature and system size prohibits the use of DFT through much of the warm dense matter regime. A recently developed stochastic approach to KS-DFT can be used at high temperatures, with the exact same accuracy as the deterministic approach, but the stochastic error can converge slowly and it remains expensive for intermediate temperatures (< 50 eV). Here we have developed a universal mixed stochastic-deterministic algorithm for DFT at any temperature. This approach leverages the physics of KS-DFT to seamlessly integrate the best aspects of these different approaches. We demonstrate that this method significantly accelerated self-consistent field calculations for temperatures from 3 to 50 eV, while producing stable molecular dynamics and accurate diffusion coefficients.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2020

Preliminary Enhanced LAW Glass Formulation Algorithm

This report summarizes the Preliminary Enhanced LAW Glass Formulation Algorithm, its background information, and the calculations it performs. The Preliminary Enhanced LAW Glass Formulation Algorithm is a tool that has been developed in MATLAB to formulate glass at a given a waste composition, while attempting to maximize waste loading. It is intended for use at the Hanford Waste Treatment and Immobilization Plant, where nuclear waste will be vitrified into glass for safe, long-term storage. The formulated glass is required to meet several processing and product quality constraints. In addition, calculations must account for associated uncertainties in constraint prediction and measurement. The algorithm also allows for the ability to hold glass compositions closer to tested regions in order to increase confidence in the output. The algorithm must also follow nuclear quality assurance procedures and submit to rigorous validation and verification testing.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗
DOE OSTI2023

Emerging Computing Architectures: Simulation of Power Electronics in Power Grids

As the penetration of power electronics increases in power grids, new computing architectures needed to be evaluated for the simulation of high-fidelity models of power electronics in power grids in operations. In this paper, emerging computing architectures such as quantum processing units are evaluated for the simulation of power electronics in power grids. A hybrid algorithm based on classical computing and quantum computing is developed and tested for different use cases of electromagnetic transient (EMT) simulation of power electronics (PE)-based systems and simple circuits. The algorithms needed to simulate power electronics in emerging computing architectures are discussed and thereafter, simulation results are shown.

Debnath, Suman↗
DOE OSTI2024

Resilient Control of Networked Microgrids Using Vertical Federated Reinforcement Learning: Designs and Real-Time Test-Bed Validations

Improving system-level resiliency of networked microgrids against adversarial cyber-attacks is an important aspect in the current regime of increased inverter-based resources (IBRs). To achieve that, this paper contributes in designing a hierarchical control layer, in conjunction with the existing control layers, resilient to adversarial attack signals. Considering model complexities, unknown dynamical behaviors of IBRs, and privacy issues regarding data sharing in multi-party-owned microgrids, designing such a control layer is non-trivial. Here, to tackle these issues, a novel federated reinforcement learning (Fed-RL) method is proposed. To grasp the interconnected dynamics of networked microgrids, the paper develops Federated Soft Actor-Critic (FedSAC) algorithm following the vertical structure of implementing Fed-RL. Next, utilizing the OpenAI Gym interface, we built a custom set-up in GridLAB-D/HELICS co-simulation platform, named Resilient RL Co-simulation (ResRLCoSIM), to train the RL agents with IEEE 123-bus benchmark comprising 3 interconnected microgrids. Finally, the learned policies in the simulation are transferred to the real-time hardware-in-the-loop (HIL) test-bed developed using the high-fidelity Hypersim platform. Finally, experiments show that the simulator-trained RL controllers achieve desirable performance with the test-bed platform, validating the minimization of the sim-to-real gap.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2026

Planetary Boundary-Layer Height (PBLHT) Value-Added Product: Remote-Sensing Retrievals

The planetary boundary layer (PBL) is fundamental to numerous atmospheric processes, including aerosol mixing and transport, cloud evolution, and precipitation formation. A critical parameter in these studies is the PBL height (PBLHT). This vertical depth is essential for characterizing PBL structures in numerical simulations and serves as a primary metric for estimating flux exchanges between the Earth’s surface and the atmosphere. Radiosonde (SONDE) observations provide high-vertical-resolution measurements of temperature and moisture profiles and are widely used to estimate PBLHT (Liu and Liang 2010, Seidel et al. 2010). The U.S. Department of Energy Atmospheric Radiation Measurement (ARM) User Facility’s PBLHT value-added product (VAP) for radiosonde measurements, known as PBLHTSONDE, applies three commonly used methods—the Heffter (1980) method, the Liu and Liang (2010) method, and the bulk Richardson number approach (Seibert et al. 2000)—to derive PBLHT. The PBLHTSONDE VAP operates routinely at ARM observatories and mobile facilities, with data available from the ARM Data Center shortly after sounding observations are collected (Sivaraman et al. 2013). However, radiosonde observations are limited by their low temporal resolution. Most stations launch soundings only twice daily, which constrains the ability to investigate and characterize the temporal evolution of the PBL using radiosonde data alone. The use of continuous remote-sensing observations provides high temporal resolution of PBLHT estimates. These observations include aerosol lidars (Dang et al. 2019, Su et al. 2020), Doppler lidar (DL; Tucker et al. 2009, Krishnamurthy et al. 2021), and water vapor and/or temperature lidars and radiometers (Turner et al. 2014). These observations provide valuable data on the PBL’s thermodynamic properties (e.g., water vapor and/or temperature lidars and radiometers), dynamic properties (e.g., DL), and distribution of tracer substances (e.g., aerosol lidars), all of which can be used to estimate PBLHT. ARM developed PBLHT estimates from the micropulse lidar (MPL; PBLHTMPL), Doppler lidar (PBLHTDL), and combined Raman lidar (RL)/atmospheric emitted radiance interferometer (AERI) thermodynamic profiles (PBLHTTHERMO). Each estimate captures different physical characteristics of the boundary layer—aerosol tracers, vertical velocity turbulence, and thermodynamic structure—and exhibits distinct strengths and limitations depending on the PBL regime and time of day. In addition, the ARM ceilometer (CEIL) provides three potential PBLHT candidates derived from the vendor's built-in algorithm. Building on these individual retrievals, ARM developed the PBLHTBEML VAP, which combines the four remote-sensing-based estimates with ancillary meteorological variables using the machine learning approach of Zhang et al. (2025) to produce a best-estimate PBLHT at 10-minute resolution.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2021

Implementing Arbitrary/Common Concurrent Writes of CRCW PRAM

The Parallel Random Access Machines (PRAM) abstraction is the simplest and most elegant algorithmic model for the design and analysis of parallel algorithms. It consists of different models categorized based on the underlying memory access mode used, the most powerful of which is the Concurrent Read Concurrent Write (CRCW) model. A PRAM algorithm describes a series of rounds, each of which consists of a collection of operations that can be executed concurrently within the same time step. However, the lack of support for concurrent memory accesses and the prevalence of asynchronous programming models led to the belief that implementing CRCW PRAM algorithms is unattainable and prompted many to avoid this model except for theoretical studies of optimal performance.In this work, we study the arbitrary and common concurrent writes in the CRCW PRAM model and explore implementation challenges on general-purpose systems. Moreover, we examine current practices for implementing common/arbitrary concurrent writes and propose a new efficient lightweight and thread-safe method to implement concurrent writes through leveraging atomic instructions. To demonstrate the efficacy of our method, we developed OpenMP kernels for classical CRCW PRAM algorithms and provide experimental results and comparisons based on run time performance measured over the x86 multicore architecture. Our results show a performance speedup compared to current practices up to 4.5x across all our benchmarks.

Ghanim, Fady↗
DOE OSTI2024

Modifying the Asynchronous Jacobi Method for Data Corruption Resilience

Moving scientific computation from high-performance computing (HPC) and cloud computing (CC) environments to devices on the edge, i.e., physically near instruments of interest, has received tremendous interest in recent years. Such edge computing environments can operate on data in situ, offering enticing benefits over data aggregation to HPC and CC facilities that include avoiding costs of transmission, increased data privacy, and real-time data analysis. Because of the inherent unreliability of edge computing environments, new fault-tolerant approaches must be developed before the benefits of edge computing can be realized. Motivated by algorithm-based fault tolerance, a variant of the asynchronous Jacobi (ASJ) method is developed that achieves resilience to data corruption by rejecting solution approximations from neighbor devices according to a bound derived from convergence theory. Numerical results on a two-dimensional Poisson problem show that the new rejection criterion, along with a novel approximation to the shortest path length on which the criterion depends, restores convergence for the ASJ variant in the presence of certain types data corruption. Numerical results are obtained for when the singular values in the analytic bound are approximated. Additional linear systems are also explored, one with a more dense sparsity pattern and one that includes advection. All results indicate that successful resilience to data corruption depends on whether the bound tightens fast enough to reject corrupted data before the iteration evolution deviates significantly from that predicted by the convergence theory defining the bound. This observation generalizes to future work on algorithm-based fault tolerance for other asynchronous algorithms, including upcoming approaches that leverage Krylov subspaces.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Relocating microseismicity from downhole monitoring of the Decatur CCS site using a modified double-difference algorithm

SUMMARY The injection of CO2 at the Decatur carbon capture and storage site has generated significant microseismic activity, which occurs in distinct spatial clusters up to approximately 2.2 km from the primary injection well. Accurate and precise event locations are vital for the characterization of the microseismicity to help understand the reservoir response to the CO2 injection, whilst enabling the identification of minor faults and fractures below the resolution of conventional active seismic imaging. However, microseismic monitoring of fluid injection sites, such as Decatur, is often performed using a network of borehole sensors often from a single well. While these downhole sensors have excellent detection capabilities, their poor azimuthal coverage limits the ability to precisely determine event locations. We have developed a modified double-difference relocation algorithm suitable for both 1-D and 3-D velocity models, and which incorporates differential back azimuth observations to allow the benefits of the original double-difference algorithm to be applicable to a downhole microseismic monitoring setting. Applying the modified double-difference algorithm to the microseismicity at Decatur, we have successfully relocated 4293 events. The relocation included over 59 million observations for 757 285 event pairs, split across seven geographic regions. Despite the majority of observations being recorded in only two boreholes, with an almost identical azimuthal coverage, the results have shown to be reliable with significantly reduced residuals and low uncertainties associated with the final locations. We have analysed the residuals in terms of their association with each geographic region, data type, station and individual events, to fully appreciate their influence in the inversion and the fit of the data to the final set of event locations. For each region, the relocated seismicity has become less diffuse with improved clustering, and with newly visible linear features often orientated in a NE–SW direction. These results show the potential improvements that can be made to microseismic event locations recorded by a borehole network with a limited and variable azimuthal distribution.

58 GEOSCIENCES↗
DOE OSTI2021

Advances and perspectives in discovery and functional analysis of small secreted proteins in plants

Small secreted proteins (SSPs) are less than 250 amino acids in length and are actively transported out of cells through conventional protein secretion pathways or unconventional protein secretion pathways. In plants, SSPs have been found to play important roles in various processes, including plant growth and development, plant response to abiotic and biotic stresses, and beneficial plant–microbe interactions. Over the past 10 years, substantial progress has been made in the identification and functional characterization of SSPs in several plant species relevant to agriculture, bioenergy, and horticulture. Yet, there are potentially a lot of SSPs that have not been discovered in plant genomes, which is largely due to limitations of existing computational algorithms. Recent advances in genomics, transcriptomics, and proteomics research, as well as the development of new computational algorithms based on machine learning, provide unprecedented capabilities for genome-wide discovery of novel SSPs in plants. In this review, we summarize known SSPs and their functions in various plant species. Then we provide an update on the computational and experimental approaches that can be used to discover new SSPs. Finally, we discuss strategies for elucidating the biological functions of SSPs in plants.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2024

Solving the Hele–Shaw flow using the Harrow–Hassidim–Lloyd algorithm on superconducting devices: A study of efficiency and challenges

The development of quantum processors for practical fluid flow problems is a promising yet distant goal. Recent advances in quantum linear solvers have highlighted their potential for classical fluid dynamics. In this study, we evaluate the Harrow–Hassidim–Lloyd (HHL) quantum linear systems algorithm (QLSA) for solving the idealized Hele–Shaw flow. Our focus is on the accuracy and computational cost of the HHL solver, which we find to be sensitive to the condition number, scaling exponentially with problem size. This emphasizes the need for preconditioning to enhance the practical use of QLSAs in fluid flow applications. Moreover, we perform shots-based simulations on quantum simulators and test the HHL solver on superconducting quantum devices, where noise, large circuit depths, and gate errors limit performance. Error suppression and mitigation techniques improve accuracy, suggesting that such fluid flow problems can benchmark noise mitigation efforts. Finally, our findings provide a foundation for future, more complex application of QLSAs in fluid flow simulations.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗