Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Computer algorithms”

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

Privacy Preserving Federated Learning for Advanced Scientific Ecosystems

We present a framework to provide privacy preserving (PP) federating learning (FL) across multiple computational and experimental facilities. This work joins the compute capabilities of National Energy Research Scientific Computing Center (NERSC) and Oak Ridge National Laboratory Research Cloud (ORC) with simulated experimental data, such as those produced at the SLAC National Accelerator Laboratory and Spallation Neutron Source (SNS). We describe the software infrastructure developed to provide privacy for computational and experimental networks. We developed algorithmic privacy across the federated system by embedding database security, computation, and communication into the federation architecture, utilizing scientific tools developed by the experimental community.

Archibald, Rick [ORNL] (ORCID:0000000245389780)↗
DOE OSTI2025

A Robust Communication-Free Protection Scheme for Islanded Microgrids with Relay Logic and Hardware-in-the-Loop Validation

This paper presents the Imbalance Square Factor (ISF) detection algorithm, an effective, computationally lightweight method for detecting faults in inverter-based microgrids. ISF provides a high magnitude at the time of the fault, which allows for fast detection and coordination between primary and backup relays. The imbalance squared factor, calculated using local voltage and currents, is used for fault detection and coordination among three relays. ISF is validated in hardware-in-the-loop (HIL) implementation inside commercial-grade relay logic (SEL-751). The HIL validation shows that ISF can coordinate primary, secondary, and tertiary relays in the 13-bus system in islanded operation.

Ferrari Maglia, Max [ORNL]↗
DOE OSTI2023

A Model Calibration Method for Grid-Forming Inverters Using Iterative Bayesian Optimization

As inverter-based resources (IBRs) are rapidly deployed, especially at the distribution and microgrid levels, the need to include their accurate representations in power systems models increases. With well-calibrated models, IBR-interactions can be examined, preventing any stability and operational issues, especially in islanded systems. This paper proposes a method to calibrate generic inverter models using Bayesian optimization, but with a parameter-grouping approach to improve speed and accuracy. This approach is illustrated for a grid-forming inverter using synthetic data and field measurements from a simple IBRbased microgrid. Tests show that the calibration algorithm has modest computation cost and is robust to noisy measurements..

Biswas, Shuchismita↗
DOE OSTI2023

Distributed Data-Driven Optimization for Voltage Regulation in Distribution Systems

Here, this paper proposes a distributed data-driven optimization framework for voltage regulation in distribution systems. The recursive kernel regression and alternating direction method of multipliers (ADMM) are selected to cover the system learning and distributed optimization tasks. The proposed distributed data-driven framework is capable of having a rapid response to system or load changes while considering the operation optimality. Besides, the distributed algorithm parallels the computation tasks and reduces the computational expense of a single agent. To validate the performance of the proposed method, a hypothetical 7-Bus system and the IEEE 123-Bus system are selected to show the effectiveness of the proposed data-driven framework. According to the numerical study results, the proposed method offers great flexibility for selecting customized kernel models for different regions and can effectively improve the system voltage profile in a distributed manner.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

Optimal spectral resolution for solids and liquids using FT and other infrared spectrometers: How much resolution do you really need?

In this study we investigate the possibility of using spectral resolutions for infrared measurements of solids and liquids that are not powers of two, e.g. are not at 1, 2, 4, 8, or 16 cm-1 resolution. In almost all reported literature of the last fifty years the resolution used to record for a Fourier transform infrared spectrum has been a power of two. This stems from the fact that 1) the Cooley-Tukey algorithm used to compute such a transform was constructed to use only powers of two and was also driven by 2) the fact that the computing horsepower required to compute the Fourier transform increases as N?log?_2 (N), where N is the number of points in the interferogram (spectrum). For typical spectra, however, the CPU time is no longer a consideration. Our study is based on both liquid and solid spectra, all of which were recorded at 2 cm-1 resolution. There were at total of 70 solids spectra representing 2,472 spectral peaks and 61 liquids spectra (1,765 spectral peaks), each peak being inspected for being singlet / multiplet in nature. Of the 1,765 liquid bands examined, only 27 had widths less than 5 cm-1. Of the 2,472 solid bands examined, only 39 peaks have widths less than 5 cm-1. For liquids, the mean peak width is 24.7 cm-1 but the median peak width is 13.7 cm-1, and, similarly, for solids, the mean peak width is 22.2 cm-1 but the median peak width is 11.2 cm-1. In both cases, solids and liquids, a skewed peak widths distribution was observed, the peak of the distribution representing narrower bands in the 7 to 9 cm-1 FWHM range but displaying a long tail to the very broad bands, with some displaying spectral widths of 100 cm-1 or more. Because one of the most important criteria for successful instrumental design in IR spectroscopy is the spectral resolution, the data were further analyzed showing that a value to resolve 95% of all bands is 5.7 cm-1 for liquids and 5.3 cm-1 for solids; such a resolution would capture the native linewidth (no instrumental broadening) of 95% of all the solids and liquid bands, respectively. Based on the present results we suggest that, when accounting only for intrinsic linewidths an optimized resolution of 6.0 cm-1 will capture 91% of all condensed-phase bands for IR detection of chemical, mineral, and biological materials.

Forland, Brenda M.↗
DOE OSTI2022

A Framework for Error-Bounded Approximate Computing, with an Application to Dot Products

Approximate computing techniques, which trade off the computation accuracy of an algorithm for better performance and energy efficiency, have been successful in reducing computation and power costs in several domains. However, error sensitive applications in high-performance computing are unable to benefit from existing approximate computing strategies that are not developed with guaranteed error bounds. While approximate computing techniques can be developed for individual high-performance computing applications by domain specialists, this often requires additional theoretical analysis and potentially extensive software modification. Hence, the development of low-level error-bounded approximate computing strategies that can be introduced into any high-performance computing application without requiring additional analysis or significant software alterations is desirable. In this paper, we provide a contribution in this direction by proposing a general framework for designing error-bounded approximate computing strategies and apply it to the dot product kernel to develop \bf qdot---an error-bounded approximate dot product kernel. Following the introduction of qdot, here we perform a theoretical analysis that yields a deterministic bound on the relative approximation error introduced by qdot. Empirical tests are performed to illustrate the tightness of the derived error bound and to demonstrate the effectiveness of qdot on a synthetic dataset, as well as two scientific benchmarks---the conjugate gradient (CG) and power methods. In some instances, using qdot for the dot products in CG can result in many components being quantized to half precision without increasing the iteration count required for convergence to the same solution as CG using a double precision dot product.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Randomized Algorithms for Symmetric Nonnegative Matrix Factorization

Symmetric Nonnegative Matrix Factorization (SymNMF) is a technique in data analysis and machine learning that approximates a matrix with a product of a nonnegative, low-rank matrix and it transpose. To design faster and more scalable algorithms for SymNMF we develop two randomized algorithms for its computation. The first method uses randomized matrix sketching to compute an initial low-rank approximation to the input matrix and proceeds to uses this as a low-rank input to rapidly compute a SymNMF. The second methods uses randomized leverage score sampling to approximately solve constrained least squares problems. Many successful methods for SymNMF rely on (approximately) solving sequences of constrained least squares problems. Here, we prove theoretically that leverage score sampling can approximately solve constrained least squares problems to e-accuracy. Finally we demonstrate both methods work in practice by applying them to graph clustering tasks on large real world data sets. These experiments show that our methods approximately maintain solution quality and achieve significant speed ups for both large dense and large sparse problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

A general framework for gravitational charges and holographic renormalization

We develop a general framework for constructing charges associated with diffeomorphisms in gravitational theories using covariant phase space techniques. This framework encompasses both localized charges associated with space–time subregions, as well as global conserved charges of the full space–time. Expressions for the charges include contributions from the boundary and corner terms in the subregion action, and are rendered unambiguous by appealing to the variational principle for the subregion, which selects a preferred form of the symplectic flux through the boundaries. The Poisson brackets of the charges on the subregion phase space are shown to reproduce the bracket of Barnich and Troessaert for open subsystems, thereby giving a novel derivation of this bracket from first principles. In the context of asymptotic boundaries, we show that the procedure of holographic renormalization can be always applied to obtain finite charges and fluxes once suitable counterterms have been found to ensure a finite action. This enables the study of larger asymptotic symmetry groups by loosening the boundary conditions imposed at infinity. We further present an algorithm for explicitly computing the counterterms that renormalize the action and symplectic potential, and, as an application of our framework, demonstrate that it reproduces known expressions for the charges of the generalized Bondi–Metzner–Sachs algebra.

Physics↗
DOE OSTI2021

Emu v1.1

Emu is a particle-in-cell code for solving the neutrino quantum kinetic equations in 1, 2, or 3 spatial dimensions with arbitrary angular resolution in order to simulate neutrino flavor transformation in neutron star merger and core collapse supernova environments. Emu represents the neutrino distribution function as a set of particles, each of which represent a collection of neutrinos and antineutrinos with unique position and momentum. Each particle carries two density matrices to define the flavor state of the neutrinos and antineutrinos it represents. Emu includes the vacuum, matter, and neutrino self-interaction potentials. Emu calculates the self-interaction potential using PIC deposition and interpolation algorithms that efficiently compute the local number density and flux at particle locations. Emu is implemented in C++ and is based on the AMReX library for high-performance, block-structured adaptive mesh refinement. Emu is parallelized with MPI + OpenMP for CPUs and MPI + CUDA for GPUs.

Willcox, Donald↗
DOE OSTI2026

buhito

buhito is a Python library for graph analysis and machine learning. Graphs can represent networks with objects as nodes and their relationships as edges. buhito focuses on graphlet methods that study graphs through enumerating their component subgraphs to enable interpretable and fast models of complex systems. The package provides tools for different algorithmic designs for computing, analyzing, and applying graphlets to research problems such as machine learning, data compression, and anomaly detection in graph-structured data. A central feature is performing decomposition data analysis on graphs for machine learning models. Implemented in Python and built upon open-source scientific libraries such as NetworkX, NumPy, and SciPy, buhito provides high-performance methods for researchers exploring the mathematical and computational foundations of graphlet analysis applicable to systems of different sizes.

Pimonova, Yulia↗
DOE OSTI2026

Dataset for "A primer on forest structure measurement with lidar for ecologists"

This repository includes data and code accompanying the case study included in the manuscript "A primer on forest structure measurement with lidar for ecologists" (submitted to Ecosphere). We compiled lidar datasets from multiple platforms in a common area to: 1. Demonstrate how differences in sensor characteristics influence density and resolution of lidar data. 2. Provide open-source, co-located datasets for users to further inspect differences in lidar data. 3. Provide example code to perform basic lidar analysis. This case study is meant to allow readers to get hands-on experience with real-world data from different platforms. This case study is not meant to be a rigorous comparison of derived ecological metrics among all sensors; such comparisons can be found throughout other publications referenced throughout the main manuscript. Code includes basic functions in R commonly used to visualize and manipulate lidar data accessible with a normal laptop computer; more sophisticated algorithms for advanced users are also referenced throughout the main manuscript. Terrestrial laser scanning (TLS), mobile laser scanning (MLS), UAS laser scanning (ULS), airborne laser scanning (ALS), and spaceborne laser scanning (SLS) data were collected within the Smithsonian Environmental Research Center (SERC) forest dynamics plot in Maryland, USA. TLS, MLS, and ALS data were collected within 1 month of the 2021 growing season; ULS data were collected in November 2020 (“leaf-off” data) and July 2022 (“leaf-on” data).

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2023

Ising-Traffic: Using Ising Machine Learning to Predict Traffic Congestion under Uncertainty

This paper addresses the challenges in accurate and realtime traffic congestion prediction with uncertainty by proposing Ising-Traffic, a novel quantum-inspired dual-model Ising based traffic prediction framework which delivers higher accuracy and lower latency than SOTA solutions. While traditional and deep learning methods face the trade-off between algorithm complexity and computational efficiency, our Ising-based method leverages Ising’s inherent and unique capability of finding the state of a system with the lowest energy and applying it to traffic prediction. In this work, traffic prediction under uncertainty is formulated into two separate Ising models: Reconstruct-Ising and Predict-Ising. Reconstruct-Ising is mapped onto modern Ising machine and handles uncertainty in traffic accurately with negligible latency and energy consumption, while Predict-Ising is mapped onto traditional processors and predicts future congestion precisely with only at most 1.8% computational demands of existing solutions. Our evaluation shows Ising-Traffic delivers on average 98× speedups and 5% accuracy improvement over SOTA.

traffic flow control, Ising↗
DOE OSTI2020

Sparse Dense and Compact Linearizations of the AC OPF (Online Supplement)

This document is an online supplement for Sparse, Dense, and Compact Linearizations of the AC OPF. Here we present complete derivations of the formulations examined, details of the lazy constraint algorithm, and full computational results supporting Sparse, Dense, and Compact Linearizations of the AC OPF.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2021

Value of Information and Data Management Platform Promoting Modern Data Analysis Utilization. STTR Phase I, Final Technical Report

The immense growth in weather and river sensor data availability along with increases in computational power and algorithmic sophistication have enabled the widespread application of physical, machine learning, and artificial intelligence algorithms to river forecasting. The forecasts produced by widely varying model approaches are inherently limited in different ways, such as by the number and quality of training observations, producing biased predictions that achieve optimal skill only over specific ranges of weather and river conditions. Thus, despite the growing availability and new sources of forecasts, hydropower owners cannot fully leverage the information because they lack an effective mechanism to determine the “best” forecast for given conditions or objectives. Tools are needed to consolidate forecast information, demonstrate skill, and extract optimal forecast guidance from the range of possibilities. Such tools will increase uptake and beneficial use of the growing wealth of forecast information, and lead to improved operating decisions, optimal power generation, and enhanced system value. This research proposes to improve the value of forecasts by developing a broadly accessible verification framework and applying machine learning techniques to identify the ‘best’ forecast from an ensemble of sources given the current weather, river, and operating conditions.

13 HYDRO ENERGY↗
DOE OSTI2024

300_underground robot (final research report)

Recent advancements in mobile robotics have displayed impressive capabilities in traversing and accessing areas that are inaccessible to humans either due to the characteristics of the environment or potential hazards. Furthermore, these advancements within the field of mobile robotics, more specifically uncrewed ground vehicles (UGVs), give the ability to potentially survey, observe, and map these inaccessible areas for humans. However, one of the most challenging areas to implement this technology is underground environments. The main challenge with implementing this technology in underground environments is the dependence on either GPS or RF communication for UGVs to navigate properly. Therefore, in order to properly demonstrate the mapping capabilities of the UGV this challenge must be resolved. The overall goal of this study is to demonstrate the mapping capabilities of a UGV while addressing this challenge and documenting the implementation and testing phase of the robot. The proposed solution to this challenge is to implement a SLAM algorithm onto the main computational device of the UGV utilizing the Robot Operating System (ROS). The algorithm is the open-source software package Slam Toolbox developed by Steve Macenski. Furthermore, the sllidar_ros2 package from Slamtec will be used to gather the lidar data from an A3M1 2D lidar. A separate program will be created to gather odometry information for our UGV robot. All of these software packages will run together in a Docker environment. Through working on this project I have developed a better understanding of the world of robotics/autonomous systems, especially with applications such as navigation and mapping. Furthermore, through this project, I have been given exposure to how research is conducted within a DOE lab setting. As robotics/autonomous systems become more advanced it's important to pursue more avenues of research such as this project as it will ensure the development of our capabilities.

42 ENGINEERING↗
DOE OSTI2021

Approximating Nash Equilibrium in Day-ahead Electricity Market Bidding with Multi-agent Deep Reinforcement Learning

In this paper, a day-ahead electricity market bidding problem with multiple strategic generation company (GEN-CO) bidders is studied. The problem is formulated as a Markov game model, where GENCO bidders interact with each other todevelop their optimal day-ahead bidding strategies. Considering unobservable information in the problem, a model-free and data-driven approach, known as multi-agent deep deterministic policy gradient (MADDPG), is applied for approximating the Nash equilibrium (NE) in the above Markov game. The MADDPG algorithm has the advantage of generalization due to the automatic feature extraction ability of the deep neural networks. The algorithm is tested on an IEEE 30-bus system with three competitive GENCO bidders in both an uncongested caseand a congested case. Comparisons with a truthful bidding strategy and state-of-the-art deep reinforcement learning methods including deep Q network and deep deterministic policy gradient (DDPG) demonstrate that the applied MADDPG algorithm can find a superior bidding strategy for all the market participants with increased profit gains. In addition, the comparison with a conventional model-based method shows that the MADDPG algorithm has higher computational efficiency, which is feasible for real-world applications.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2026

Optimality of Gradient-MUSIC for Spectral Estimation

We introduce the Gradient-MUSIC algorithm for estimating the unknown frequencies and amplitudes of a nonharmonic signal from noisy time samples. While the classical MUSIC algorithm performs a computationally expensive search over a fine grid, Gradient-MUSIC is significantly more efficient and eliminates the need for discretization over a fine grid by using optimization techniques. It coarsely scans the 1D landscape to find initialization simultaneously for all frequencies followed by parallelizable local refinement via gradient descent. We also analyze its performance when the noise level is sufficiently small and the signal frequencies are separated by at least 8π/m, where π/m is the standard resolution of this problem. Even though the 1D landscape is nonconvex, we prove a global convergence result for Gradient-MUSIC: coarse scanning provably finds suitable initialization and gradient descent converges at a linear rate. In addition to convergence results, we also upper bound the error between the true signal frequencies and amplitudes with those found by Gradient-MUSIC. For example, if the noise has $\ell^\infty$ norm at most ϵ, then the frequencies and amplitudes are recovered up to error at most Cϵ/m and Cϵ respectively, which are minimax optimal in m and ϵ. Our theory can also handle stochastic noise with performance guarantees under nonstationary independent Gaussian noise. Our main approach is a comprehensive geometric analysis of the landscape, a perspective that has not been explored before.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Graph Neural Networks for Particle Reconstruction in High Energy Physics detectors

Pattern recognition problems in high energy physics are notably different from traditional machine learning applications in computer vision. Reconstruction algorithms identify and measure the kinematic properties of particles produced in high energy collisions and recorded with complex detector systems. Two critical applications are the reconstruction of charged particle trajectories in tracking detectors and the reconstruction of particle showers in calorimeters. These two problems have unique challenges and characteristics, but both have high dimensionality, high degree of sparsity, and complex geometric layouts. Graph Neural Networks (GNNs) are a relatively new class of deep learning architectures which can deal with such data effectively, allowing scientists to incorporate domain knowledge in a graph structure and learn powerful representations leveraging that structure to identify patterns of interest. In this work we demonstrate the applicability of GNNs to these two diverse particle reconstruction problems.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗