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

Proton pulse charge calculation algorithm in Beam Power Limiting System at Spallation Neutron Source

A proton pulse charge calculation algorithm in the Beam Power Limiting System (BPLS) at the Spallation Neutron Source (SNS) was developed and implemented in an FPGA. The algorithm calculates one-minute running average of the pulse charges and issues a fault to the Personal Protection System (PPS) and the Machine Protection System (MPS) when a limit is reached. A bit-accurate model of the algorithm was first developed and tested in Matlab® and then implemented and simulated in VHDL using Vivado® design environment. Finally, the algorithm was verified on a µTCA-based hardware platform.

Bobrek, Miljko [ORNL] (ORCID:0000000332763451)↗
DOE OSTI2021

Sensor impact evaluation and verification for fault detection and diagnostics in building energy systems: A review

Sensors are the key information source for fault detection and diagnostics (FDD) in buildings. However, sensors are often not properly designed, installed, calibrated, located, and maintained, which negatively impacts FDD performance. Several sensor-related FDD topics have been widely studied, covering a wide range of fault types and applications. However, it is difficult to get a clear picture of the technical development of sensor-related topics in FDD. A systematic review of sensor topics is needed to summarize the existing research in a logical way, draw conclusions on the current development, and predict the future development of sensors in building FDD. To address this gap, we conducted a comprehensive literature review of more than 100 FDD-sensor-related papers. In this article, we subdivide the FDD tasks into building-level, system-level, and component-level FDD, and review sensor-related topics in each category. Our major conclusions are: (a) current data-driven FDD research focuses more on FDD algorithms than sensors, (b) sensor “hardware” research topics are less studied than sensor “software” topics, (c) very few papers focus on sensor engineering as an integral aspect of FDD development, and (d) some important sensor topics, such as sensor cost-effectiveness and sensor schema/layout/location, are not well studied. Finally, we discuss the need for a systematic framework of FDD sensors and models to integrate sensor design/selection, sensor data analysis/mining, feature selection, physics-based or data-driven algorithm development, sensor fault detection, sensor calibration, and sensor maintenance. Finally, expert interviews are conducted to validate the above findings and conclusions.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2020

Optimizing High Performance Markov Clustering for Pre-Exascale Architectures

HipMCL is a high-performance distributed memory implementation of the popular Markov Cluster Algorithm (MCL) and can cluster large-scale networks within hours using a few thousand CPU-equipped nodes. It relies on sparse matrix computations and heavily makes use of the sparse matrix-sparse matrix multiplication kernel (SpGEMM). The existing parallel algorithms in HipMCL are not scalable to Exascale architectures, both due to their communication costs dominating the runtime at large concurrencies and also due to their inability to take advantage of accelerators that are increasingly popular. In this work, we systematically remove scalability and performance bottlenecks of HipMCL. We enable GPUs by performing the expensive expansion phase of the MCL algorithm on GPU. Additionally, we propose a CPU-GPU joint distributed SpGEMM algorithm called pipelined Sparse SUMMA and integrate a probabilistic memory requirement estimator that is fast and accurate. Furthermore, we develop a new merging algorithm for the incremental processing of partial results produced by the GPUs, which improves the overlap efficiency and the peak memory usage. We also integrate a recent and faster algorithm for performing SpGEMM on CPUs. We validate our new algorithms and optimizations with extensive evaluations. With the enabling of the GPUs and integration of new algorithms, HipMCL is up to 12.4x faster, being able to cluster a network with 70 million proteins and 68 billion connections just under 15 minutes using 1024 nodes of ORNL's Summit supercomputer.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Randomized Federated Learning Methods for Nonsmooth, Nonconvex, and Hierarchical Optimization (Final Technical Report)

This final technical report summarizes the outcomes of a DOE-funded project on federated scientific machine learning (FL) under nonsmooth, nonconvex, and hierarchical optimization settings. The project develops new mathematical models, algorithms, and theoretical guarantees for decentralized stochastic, bilevel, and minimax optimization problems arising in DOE mission-relevant applications. A unified framework of randomized and zeroth-order federated optimization methods is introduced, providing provable convergence, communication efficiency, and sample-complexity guarantees. The report documents algorithmic design, theoretical analysis, and empirical validation of the proposed federated learning methods. The project also contributes to workforce development through graduate training and dissemination of results via publications and seminars.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Generalized Cycle Benchmarking Algorithm for Characterizing Midcircuit Measurements

Midcircuit measurements (MCMs) are crucial ingredients in the development of fault-tolerant quantum computation. While there have been rapid experimental progresses in realizing MCMs, a systematic method for characterizing noisy MCMs is still under exploration. In this work, we develop a cycle benchmarking (CB)-type algorithm to characterize noisy MCMs. The key idea is to use a joint Fourier transform on the classical and quantum registers and then estimate parameters in the Fourier space, analogous to Pauli fidelities used in CB-type algorithms for characterizing the Pauli-noise channel of Clifford gates. Furthermore, we develop a theory of the noise learnability of MCMs, which determines what information can be learned about the noise model (in the presence of state preparation and terminating measurement noise) and what cannot, which shows that all learnable information can be learned using our algorithm. As an application, we show how to use the learned information to test the independence between measurement noise and state-preparation noise in an MCM. Finally, we conduct numerical simulations to illustrate the practical applicability of the algorithm. Similar to other CB-type algorithms, we expect the algorithm to provide a useful toolkit that is of experimental interest. Published by the American Physical Society 2025

Zhang, Zhihan (ORCID:0009000862907691)↗
DOE OSTI2020

Practical quantum computation of chemical and nuclear energy levels using quantum imaginary time evolution and Lanczos algorithms

Various methods have been developed for the quantum computation of the ground and excited states of physical and chemical systems, but many of them require either large numbers of ancilla qubits or high-dimensional optimization in the presence of noise. The quantum imaginary-time evolution (QITE) and quantum Lanczos (QLanczos) methods proposed in Motta et al. (2020) eschew the aforementioned issues. In this study, we demonstrate the practical application of these algorithms to challenging quantum computations of relevance for chemistry and nuclear physics, using the deuteron-binding energy and molecular hydrogen binding and excited state energies as examples. With the correct choice of initial and final states, we show that the number of timesteps in QITE and QLanczos can be reduced significantly, which commensurately simplifies the required quantum circuit and improves compatibility with NISQ devices. We have performed these calculations on cloud-accessible IBM Q quantum computers. With the application of readout-error mitigation and Richardson error extrapolation, we have obtained ground and excited state energies that agree well with exact results obtained from diagonalization.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Field-based AFDD for refrigerant undercharge in residential HVAC systems: enhancing reliability through false alarm mitigation

This study evaluated rule-based and machine learning (ML) based automated fault detection and diagnostics (AFDD) algorithms for detecting refrigerant undercharge faults in residential heating, ventilation, and air conditioning (HVAC) systems, using actual building data and a minimal set of features. The ML-based algorithms included Decision Tree (DT) and K-Nearest Neighbors (KNN). Both the rule-based and ML-based algorithms demonstrated the capability to detect refrigerant undercharge faults of -30% or more. Both types of algorithms exhibited false alarms before the implementation of a false alarm mitigation algorithm, which motivated the development of such a mitigation strategy. After applying the mitigation, false alarms were substantially reduced, with the rule-based algorithm decreasing to 0.6% and the ML-based algorithms reaching 0%, while maintaining strong detection performance. Although the rule-based algorithm initially showed lower performance compared to the ML-based algorithms, its detection accuracy improved after mitigation to a level comparable to the ML-based algorithms. These results confirm that combining false alarm mitigation with both rule-based and ML-based AFDD algorithms significantly enhances practical reliability while preserving robust fault detection capabilities. Furthermore, the findings demonstrate the potential for field deployment of these algorithms in residential HVAC systems and highlight the importance of minimizing false alarms.

False Alarm↗
DOE OSTI2023

ACCERT

The main function of ACCERT (The Algorithm for the Capital Cost Estimation of Reactor Technologies) is to provide an item-by-item estimate of the cost of a facility, at present a nuclear reactor complex, primarily nuclear power stations. The core of ACCERT is the large number of algorithms that have been developed and will continue to be developed. ACCERT is also a general methodology for identifying and organizing the individual items that are estimated using the ACCERT algorithms. ACCERT also summarize status and results; to save results and pull information from previous analyses; and to provide an interactive dynamic graphical user interface for a wide range of functions and visualizations.

Zhou, Jia [Argonne National Laboratory (ANL), Argo↗
DOE OSTI2020

Emerging materials intelligence ecosystems propelled by machine learning

We report that the age of cognitive computing and artificial intelligence (AI) is just dawning. Inspired by its successes and promises, several AI ecosystems are blossoming, many of them within the domain of materials science and engineering. These materials intelligence ecosystems are being shaped by several independent developments. Machine learning (ML) algorithms and extant materials data are utilized to create surrogate models of materials properties and performance predictions. Materials data repositories, which fuel such surrogate model development, are mushrooming. Automated data and knowledge capture from the literature (to populate data repositories) using natural language processing approaches is being explored. The design of materials that meet target property requirements and of synthesis steps to create target materials appear to be within reach, either by closed-loop active-learning strategies or by inverting the prediction pipeline using advanced generative algorithms. AI and ML concepts are also transforming the computational and physical laboratory infrastructural landscapes used to create materials data in the first place. Surrogate models that can outstrip physics-based simulations (on which they are trained) by several orders of magnitude in speed while preserving accuracy are being actively developed. Automation, autonomy and guided high-throughput techniques are imparting enormous efficiencies and eliminating redundancies in materials synthesis and characterization. The integration of the various parts of the burgeoning ML landscape may lead to materials-savvy digital assistants and to a human-machine partnership that could enable dramatic efficiencies, accelerated discoveries and increased productivity. Here, we review these emergent materials intelligence ecosystems and discuss the imminent challenges and opportunities. The materials research landscape is being transformed by the infusion of approaches based on machine learning. This Review discusses the emerging materials intelligence ecosystems and the potential of human-machine partnerships for fast and efficient virtual materials screening, development and discovery.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Citadels Final Report (GMLC 2.2.1: Citadels)

This is the final project report for the Grid Modernization Laboratory Consortium (GMLC) Resilient Distribution System (RDS) Citadels project. The primary goal of this GMLC project was to increase the operational flexibly of power systems by engaging microgrids distributedly, coordinated using consensus algorithms. The primary goal was successfully achieved. The primary goal was divided into three areas: Implement peer-to-peer control between microgrid controllers using the Open Field Message Bus (OpenFMB) approach; Develop and implement consensus algorithms on commercially available hardware that allows a group of microgrids to distributedly implement operational controls; Develop the architectures and controls to enable groups of microgrids to coordinate their operations to support the bulk power system during abnormal events, and end-use loads in the event the bulk power systems fail.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2023

Distributed memory, GPU accelerated Fock construction for hybrid, Gaussian basis density functional theory

With the growing reliance of modern supercomputers on accelerator-based architecture such a graphics processing units (GPUs), the development and optimization of electronic structure methods to exploit these massively parallel resources has become a recent priority. While significant strides have been made in the development GPU accelerated, distributed memory algorithms for many modern electronic structure methods, the primary focus of GPU development for Gaussian basis atomic orbital methods has been for shared memory systems with only a handful of examples pursing massive parallelism. Here in this work, we present a set of distributed memory algorithms for the evaluation of the Coulomb and exact exchange matrices for hybrid Kohn–Sham DFT with Gaussian basis sets via direct density-fitted (DF-J-Engine) and seminumerical (sn-K) methods, respectively. The absolute performance and strong scalability of the developed methods are demonstrated on systems ranging from a few hundred to over one thousand atoms using up to 128 NVIDIA A100 GPUs on the Perlmutter supercomputer.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Application of the Approximate Bayesian Computation Algorithm to Gamma-Ray Spectroscopy

Radioisotope identification (RIID) algorithms for gamma-ray spectroscopy aim to infer what isotopes are present and in what amounts in test items. RIID algorithms either use all energy channels in the analysis region or only energy channels in and near identified peaks. Because many RIID algorithms rely on locating peaks and estimating each peak’s net area, peak location and peak area estimation algorithms continue to be developed for gamma-ray spectroscopy. This paper shows that approximate Bayesian computation (ABC) can be effective for peak location and area estimation. Algorithms to locate peaks can be applied to raw or smoothed data, and among several smoothing options, the iterative bias reduction algorithm (IBR) is recommended; the use of IBR with ABC is shown to potentially reduce uncertainty in peak location estimation. Extracted peak locations and areas can then be used as summary statistics in a new ABC-based RIID. ABC allows for easy experimentation with candidate summary statistics such as goodness-of-fit scores and peak areas that are extracted from relatively high dimensional gamma spectra with photopeaks (1024 or more energy channels) consisting of count rates versus energy for a large number of gamma energies.

Burr, Tom↗
DOE OSTI2020

Space–time reduced order model for large-scale linear dynamical systems with application to Boltzmann transport problems

A classical reduced order model for dynamical problems involves spatial reduction of the problem size. However, temporal reduction accompanied by the spatial reduction can further reduce the problem size without losing much accuracy, which results in a considerably more speed-up than the spatial reduction only. Recently, a novel space–time reduced order model for dynamical problems has been developed [17], where the space–time reduced order model shows an order of a hundred speed-up with a relative error of 10 –4 for small academic problems. However, in order for the method to be applicable to a large-scale problem, an efficient space–time reduced basis construction algorithm needs to be developed. Here we present the incremental space–time reduced basis construction algorithm. The incremental algorithm is fully parallel and scalable. Additionally, the block structure in the space–time reduced basis is exploited, which enables the avoidance of constructing the reduced space–time basis. These novel techniques are applied to a large-scale particle transport simulation with million and billion degrees of freedom. The numerical example shows that the algorithm is scalable and practical. Also, it achieves a tremendous speed-up, maintaining a good accuracy. Finally, error bounds for space-only and space–time reduced order models are derived.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

On the Feasibility of Simulation-Driven Portfolio Scheduling for Cyberinfrastructure Runtime Systems

Runtime systems that automate the execution of applications on distributed cyberinfrastructures need to make scheduling decisions. Researchers have proposed many scheduling algorithms, but most of them are designed based on analytical models and assumptions that may not hold in practice. The literature is thus rife with algorithms that have been evaluated only within the scope of their underlying assumptions but whose practical effectiveness is unclear. It is thus difficult for developers to decide which algorithm to implement in their runtime systems.To obviate the above difficulty, we propose an approach by which the runtime system executes, throughout application execution, simulations of this very execution. Each simulation is for a different algorithm in a scheduling algorithm portfolio, and the best algorithm is selected based on simulation results. The main objective of this work is to evaluate the feasibility and potential merit of this portfolio scheduling approach, even in the presence of simulation inaccuracy, when compared to the traditional one-algorithm approach. We perform this evaluation via a case study in the context of scientific workflows. Our main finding is that portfolio scheduling can outperform the best one-algorithm approach even in the presence of relatively large simulation inaccuracies.

Casanova, Henri↗
DOE OSTI2020

Improving near real-time precipitation estimation using a U-Net convolutional neural network and geographical information

Reliable near real-time precipitation estimates are essential for monitoring and managing of natural disasters such as floods. Quality of inputs and capability of the retrieval algorithm are two important aspects for developing satellite-based precipitation datasets. Most retrieval algorithms utilize infrared (IR) information as their input due to its fine spatiotemporal resolution and near-instantaneous availability. However, their sole reliance on IR information limits their capability to learn different mechanisms of precipitation during training, resulting in less accurate estimates. Moreover, recent advances in the field of machine learning offer attractive opportunities to improve the precipitation retrieval algorithms. This work investigates the effectiveness of adding geographical information (i.e. latitude and longitude) to IR information and the application of a U-Net-based convolutional neural network for improving the accuracy of retrieval algorithms. This research suggests that applying an appropriate CNN architecture on geographical and IR information provides an opportunity to improve the satellite-based precipitation products.

42 ENGINEERING↗
DOE OSTI2023

Automatic Code Generation for High-Performance Graph Algorithms

Graph problems are common across fields of scientific computing and social sciences. However, despite their importance, implementing graph algorithms effectively on modern computing systems is a challenging task that requires significant programming effort and generally results in customized implementations. Current computing and memory hierarchies are not architected for irregular computations resulting in challenges for graph algorithms to achieve high performance on those architectures. In this paper, we present GraphX, a novel compiler framework and DSL designed to simplify the development of efficient graph algorithms and achieve high performance on modern computing systems. GraphX consists of a DSL for efficient implementation of graph algorithms, various optimizations, such as support for sparse linear algebra and workspace transformations, optimized graph primitives, including semiring and masking, and a high-performance code generation engine. Using GraphX, users can implement graph algorithms using a semantically-rich language with graph-oriented operators. GraphX uses these semantics to automatically generate efficient code for target architectures, increasing performance and portability across architectures. The composable nature of GraphX makes it possible to extend the set of optimizations and architectures without modifying the source code. We demonstrate GraphX outperforms state-of-the-art graph libraries, such as LAGraph, up to $3.7 speedup in semiring operations, $2.19 speedup in an important sparse computational kernel, and $9.05 speedup in graph processing algorithms.

compiler, graph algorithms, semiring, masking, wor↗
DOE OSTI2023

Optimization Algorithm for Criticality Experiment Design Using Whisper

Many criticality experiments performed to aid in nuclear data evaluation are designed to maximize the sensitivity of the system’s effective neutron multiplication factor to a certain nuclide reaction pair over an energy region of interest. This is typically done by evaluating possible designs in a transport code such as MCNP and selecting the one with the highest desired sensitivity. A designer has many tools to try to maximize this sensitivity such as different moderators, reflectors, fuels, and geometries. This balancing act of identifying a critical and maximally sensitive system become very computationally expensive as more variables are added and higher precisions are desired. In order to identify these optimal configurations more efficiently a Particle Swarm Optimization (PSO) algorithm coupled with MCNP has been developed by Los Alamos National Laboratory (LANL). This algorithm has been used to design two upcoming criticality experiments that will be performed at the National Criticality Experiments Research Center (NCERC), located at the Nevada National Security Site, and operated by LANL, the only general-purpose critical experiments laboratory in the United States. PSO uses a population (swarm) of candidate solutions (particles) on a search space of dimensions such as moderator and reflector thicknesses or enrichments and concentrations. These particles move around the search space from generation to generation according to simple rules. Eventually, the swarm converges on the configuration that is both critical and maximally sensitive to a piece of nuclear data. PSO is well suited for criticality experiments as the algorithm is agnostic to the underlying physics, meaning it is effective on many different experimental setups. This algorithm has been modified to maximize the nuclear data similarity coefficient between an application case and an experiment aimed at replicating the application case using WHISPER, a nuclear criticality safety analysis tool. This allows for the efficient design of critical experiments informed by nuclear data sensitives.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

Feature Selection Techniques for a Machine Learning Model to Detect Autonomic Dysreflexia

Feature selection plays a crucial role in the development of machine learning algorithms. Understanding the impact of the features on a model, and their physiological relevance can improve the performance. This is particularly helpful in the healthcare domain wherein disease states need to be identified with relatively small quantities of data. Autonomic Dysreflexia (AD) is one such example, wherein mismanagement of this neurological condition could lead to severe consequences for individuals with spinal cord injuries. We explore different methods of feature selection needed to improve the performance of a machine learning model in the detection of the onset of AD. We present different techniques used as well as the ideal metrics using a dataset of thirty-six features extracted from electrocardiograms, skin nerve activity, blood pressure and temperature. The best performing algorithm was a 5-layer neural network with five relevant features, which resulted in 93.4% accuracy in the detection of AD. The techniques in this paper can be applied to a myriad of healthcare datasets allowing forays into deeper exploration and improved machine learning model development. Through critical feature selection, it is possible to design better machine learning algorithms for detection of niche disease states using smaller datasets.

electrocardiography↗