SEARCH · Engineering Papers

Results for “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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 685 records · Page 38

All sources NASA NTRS DOE OSTI

DOE OSTI2026

A large-scale benchmarking of deterministic and stochastic derivative-free optimization algorithms

This presentation summarizes our work in the PrOMMiS project on benchmarking of data-driven optimization algorithms and their applications in self-driving laboratories. This work supports the broader project goal of accelerating the identification of promising separation methods and operating conditions for critical minerals separation processes. We present a systematic benchmarking study of 42 data-driven optimization algorithms on a broad collection of 502 test problems. The results identify BAM, GLCCLUSTER, and MULTIMIN as the most effective optimization solvers, with BAM showing the highest overall performance and solving more than 80% of the benchmark problems. The study also shows that no single solver consistently outperforms the others across all problem types, indicating that our future laboratory applications may benefit from using a small set of strong solvers rather than relying on a single method. The presentation also illustrates an in-silico chemical reactor case study showing that data-driven optimization methods can guide autonomous experimentation in a self-driving laboratory and identify optimal operating conditions within a small number of experiments. Overall, the results provide a basis for selecting efficient optimization methods and demonstrate the practical use of data-driven optimization in self-driving laboratory workflows.

36 MATERIALS SCIENCE↗

DOE OSTI2026

Algorithm-guided experimentation for autonomous AI systems in self-driving laboratories

36 MATERIALS SCIENCE↗

DOE OSTI2026

Hardware Implementation of Grover's Search Algorithm

Grover's algorithm searches through an unstructured database, offering a quadratic speedup over classical search algorithms. We implement it, as well as two deterministic variants, on IBM (Kingston) and IQM (Garnet) hardware. Additionally, we test dynamical decoupling as an error mitigation technique. We compare our results to a classical, brute force approach to evaluate current hardware capabilities.

Pressman, Daniel [Fermilab]↗

DOE OSTI2021

Application of Monte Carlo Algorithms to Cardiac Imaging Reconstruction

Monte Carlo algorithms have a growing impact on nuclear medicine reconstruction processes. One ofthe main limitations of myocardial perfusion imaging (MPI) is the effective mitigation of the scattering component,which is particularly challenging in Single Photon Emission Computed Tomography (SPECT). In SPECT,no timing information can be retrieved to locate the primary source photons. Monte Carlo methods allow anevent-by-event simulation of the scattering kinematics, which can be incorporated into a model of the imagingsystem response. This approach was adopted in the late Nineties by several authors, and recently took advantageof the increased computational power made available by high-performance CPUs and GPUs. These recent developmentsenable a fast image reconstruction with improved image quality, compared to deterministic approaches.Deterministic approaches are based on energy-windowing of the detector response, and on the cumulative estimateand subtraction of the scattering component. In this paper, we review the main strategies and algorithms tocorrect the scattering effect in SPECT and focus on Monte Carlo developments, which nowadays allow the threedimensionalreconstruction of SPECT cardiac images in a few seconds.

Pharmacology & Pharmacy↗

DOE OSTI2024

Multi-track reconstruction algorithm in the Mu2e experiment

The Mu2e experiment, under construction at Fermilab, will search for the neutrino-less coherent $\mu^-N\rightarrow e^-N$ conversion in the field of a $^{27}$Al nucleus. Such a process violates lepton flavor conservation. About $60\%$ of muons stopped by an $^{27}$Al nucleus will undergo nuclear capture, while about $40\%$ will decay in orbit. To quantify the conversion probability, we define $R_{\mu e}$, which is given by the ratio between the $\mu^-\rightarrow e^-$ conversion rate and the nuclear capture rate [1]: \begin{equation} R_{\mu e}= \frac{\Gamma\left(\mu^- + N\left(Z,A\right)\rightarrow e^- + N\left(Z,A\right)\right)}{\Gamma\left(\mu^- + N\left(Z,A\right)\rightarrow \nu^-_\mu + N\left(Z-1,A\right)\right)}\,. \end{equation} The upper limit on $R_{\mu e}$ is $7\cdot 10^{-13}$ at $90\%$ CL, set by the SINDRUM II experiment~\cite{SINDRUM II:limit}. The goal of the Mu2e experiment is to reach a sensitivity on $R_{\mu e}$ of $8\cdot 10^{-17}$ at $90\%$ CL. This represents a four-order of magnitude improvement over the current experimental limit. Mu2e will take its first data in 2027. The signature for the muon conversion is a monochromatic electron of $104.97$~\si{\mega\eV}/c, an energy slightly below the muon rest mass. While the main experiment goal is to reconstruct the conversion electron, i.e., an event with a single track, there are motivations to develop an efficient tracking algorithm for reconstructing more simultaneous tracks. This could better constrain the background generated by $p\bar{p}$-annihilation in the Al target and to search for other Beyond the Standard Model processes. In this paper, we present an algorithm designed to reconstruct multi-particle events.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

DOE OSTI2025

Efficient Hamiltonian encoding algorithms for extracting quantum control mechanism as interfering pathway amplitudes in the Dyson series

Hamiltonian encoding is a methodology for revealing the mechanism behind the dynamics governing controlled quantum systems. In this paper, following Mitra and Rabitz \cite{abhra_1}, we define mechanism via pathways of eigenstates that describe the evolution of the system, where each pathway is associated with a complex-valued amplitude corresponding to a term in the Dyson series. The evolution of the system is determined by the constructive and destructive interference of these pathway amplitudes. Pathways with similar attributes can be grouped together into pathway classes. The amplitudes of pathway classes are computed by modulating the Hamiltonian matrix elements and decoding the subsequent evolution of the system rather than by direct computation of the individual terms in the Dyson series. The original implementation of Hamiltonian encoding was computationally intensive and became prohibitively expensive in large quantum systems. This paper presents two new encoding algorithms that calculate the amplitudes of pathway classes by using techniques from graph theory and algebraic topology to exploit patterns in the set of allowed transitions, greatly reducing the number of matrix elements that need to be modulated. These new algorithms provide an exponential decrease in both computation time and memory utilization with respect to the Hilbert space dimension of the system. To demonstrate the use of these techniques, they are applied to two illustrative state-to-state transition problems.

Abrams, Erez [Princeton University, Massachusetts ↗

DOE OSTI2024

A multi-algorithm approach for modeling coastal wetland eco-geomorphology

Coastal wetlands play an important role in the global water and biogeochemical cycles. Climate change makes it more difficult for these ecosystems to adapt to the fluctuation in sea levels and other environmental changes. Given the importance of eco-geomorphological processes for coastal wetland resilience, many eco-geomorphology models differing in complexity and numerical schemes have been developed in recent decades. However, their divergent estimates of the response of coastal wetlands to climate change indicate that substantial structural uncertainties exist in these models. To investigate the structural uncertainty of coastal wetland eco-geomorphology models, we developed a multi-algorithm model framework of eco-geomorphological processes, such as mineral accretion and organic matter accretion, within a single hydrodynamics model. The framework is designed to explore possible ways to represent coastal wetland eco-geomorphology in Earth system models and reduce the related uncertainties in global applications. We tested this model framework at three representative coastal wetland sites: two saltmarsh wetlands (Venice Lagoon and Plum Island Estuary) and a mangrove wetland (Hunter Estuary). Through the model–data comparison, we showed the importance of using a multi-algorithm ensemble approach for more robust predictions of the evolution of coastal wetlands. We also found that more observations of mineral and organic matter accretion at different elevations of coastal wetlands and evaluation of the coastal wetland models at different sites in diverse environments can help reduce the model uncertainty.

58 GEOSCIENCES↗

DOE OSTI2022

Construction of Women’s All-Around Speed Skating Event Performance Prediction Model and Competition Strategy Analysis Based on Machine Learning Algorithms

Introduction Accurately predicting the competitive performance of elite athletes is an essential prerequisite for formulating competitive strategies. Women’s all-around speed skating event consists of four individual subevents, and the competition system is complex and challenging to make accurate predictions on their performance. Objective The present study aims to explore the feasibility and effectiveness of machine learning algorithms for predicting the performance of women’s all-around speed skating event and provide effective training and competition strategies. Methods The data, consisting of 16 seasons of world-class women’s all-around speed skating competition results, used in the present study came from the International Skating Union (ISU). According to the competition rules, distinct features are filtered using lasso regression, and a 5,000 m race model and a medal model are built using a fivefold cross-validation method. Results The results showed that the support vector machine model was the most stable among the 5,000 m race and the medal models, with the highest AUC (0.86, 0.81, respectively). Furthermore, 3,000 m points are the main characteristic factors that decide whether an athlete can qualify for the final. The 11th lap of the 5,000 m, the second lap of the 500 m, and the fourth lap of the 1,500 m are the main characteristic factors that affect the athlete’s ability to win medals. Conclusion Compared with logistic regression, random forest, K-nearest neighbor, naive Bayes, neural network, support vector machine is a more viable algorithm to establish the performance prediction model of women’s all-around speed skating event; excellent performance in the 3,000 m event can facilitate athletes to advance to the final, and athletes with outstanding performance in the 500 m event are more likely competitive for medals.

Liu, Meng↗

DOE OSTI2020

Development and Implementation of Fault-Correction Algorithms in Fault Detection and Diagnostics Tools

A fault detection and diagnostics (FDD) tool is a type of energy management and information system that continuously identifies the presence of faults and efficiency improvement opportunities through a one-way interface to the building automation system and the application of automated analytics. Building operators on the leading edge of technology adoption use FDD tools to enable median whole-building portfolio savings of 8%. Although FDD tools can inform operators of operational faults, currently an action is always required to correct the faults to generate energy savings. A subset of faults, however, such as biased sensors, can be addressed automatically, eliminating the need for staff intervention. Automating this fault “correction” can significantly increase the savings generated by FDD tools and reduce the reliance on human intervention. Doing so is expected to advance the usability and technical and economic performance of FDD technologies. This paper presents the development of nine innovative fault auto-correction algorithms for Heating, Ventilation, and Air Conditioning pi(HVAC) systems. When the auto-correction routine is triggered, it overwrites control setpoints or other variables to implement the intended changes. It also discusses the implementation of the auto-correction algorithms in commercial FDD software products, the integration of these strategies with building automation systems and their preliminary testing.

field testing↗

DOE OSTI2026

Proposed Algorithm for Placement and Sizing of Generation and Storage Stations in Urban Environments

The placement of generation and storage stations (GSSs) in distribution grids has been extensively investigated. Most traditional methods are applicable to rural or homogeneous environments and do not account for external restrictions on generation placement in urban or semi-urban environments. In this article, we propose a method for generation placement considering externality constraints. New utility-scale generation in distribution grids potentially occupies footprint and interferes in areas with existing infrastructure with architectural, historical, or touristic value. Urban environments are often regulated by municipal legislation. The placement of utility-scale generation in urban landscapes is economically and physically restricted by such externalities, and existing methods for generation placement in distribution grids based on technical optimization fail to account for this important nuance. The proposed algorithm flexibly adapts to changes in government energy policies and priorities. The selection of the type of generation suitable for the power grid is left to the preference of external high-level stakeholders, such as urban planners, industry development leaders, and energy policymakers. The proposed algorithm is a unique tool for determining the placement and sizing of generation in realistic conditions in distribution grids; it is adaptable to urban externalities and sensitive to stakeholder preferences.

generation and storage station placement↗

DOE OSTI2022

Training Ultrasound Image Classification Deep-Learning Algorithms for Pneumothorax Detection Using a Synthetic Tissue Phantom Apparatus

Ultrasound (US) imaging is a critical tool in emergency and military medicine because of its portability and immediate nature. However, proper image interpretation requires skill, limiting its utility in remote applications for conditions such as pneumothorax (PTX) which requires rapid intervention. Artificial intelligence has the potential to automate ultrasound image analysis for various pathophysiological conditions. Training models require large data sets and a means of troubleshooting in real-time for ultrasound integration deployment, and they also require large animal models or clinical testing. Here, we detail the development of a dynamic synthetic tissue phantom model for PTX and its use in training image classification algorithms. The model comprises a synthetic gelatin phantom cast in a custom 3D-printed rib mold and a lung mimicking phantom. When compared to PTX images acquired in swine, images from the phantom were similar in both PTX negative and positive mimicking scenarios. We then used a deep learning image classification algorithm, which we previously developed for shrapnel detection, to accurately predict the presence of PTX in swine images by only training on phantom image sets, highlighting the utility for a tissue phantom for AI applications.

Boice, Emily N. (ORCID:0000000171802842)↗

DOE OSTI2024

Convergence Analysis for an Online Data-Driven Feedback Control Algorithm

This paper presents convergence analysis of a novel data-driven feedback control algorithm designed for generating online controls based on partial noisy observational data. The algorithm comprises a particle filter-enabled state estimation component, estimating the controlled system’s state via indirect observations, alongside an efficient stochastic maximum principle-type optimal control solver. By integrating weak convergence techniques for the particle filter with convergence analysis for the stochastic maximum principle control solver, we derive a weak convergence result for the optimization procedure in search of optimal data-driven feedback control. Numerical experiments are performed to validate the theoretical findings.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

A Novel Machine Learning Algorithm for Cloud Detection Using AERI Measurement Data

Infrared hyperspectral remote sensing has been widely used in the field of meteorology. Many scientists have carried out research on inversion methods of meteorological elements such as thermodynamic profile, boundary layer height, cloud base height, etc. In this study, a method based on machine learning for cloud detection using ground-based infrared hyperspectral radiation data is proposed. The features of outliers, the cloudy and cloud-free data of Atmospheric Emitted Radiance Interferometer (AERI) radiation are extracted. The “reference values” of cloudy and cloud-free are determined based on the observation data of Vaisala CL31 ceilometer within the time range of 8 min before the corresponding time of AERI. A support vector machine (SVM) algorithm is used for training. The dataset comes from the Atmospheric Radiation Measurement (ARM) Southern Great Plains (SGP) site and North Slope Alaska (NSA) site from 2015 to 2017, and the ARM West Antarctic Radiation Experiment (AWARE) site in 2016 is also analyzed. The instruments used in this paper include AERI, ceilometer, etc. The experimental results reveal that the agreement of cloud detection results between the proposed algorithm and ceilometer is about 93% at each site. However, for high clouds or optically thin clouds, the agreement will decrease.

47 OTHER INSTRUMENTATION↗

DOE OSTI2024

Fast, Nondestructive and Precise Biomass Measurements Are Possible Using Lidar-Based Convex Hull and Voxelization Algorithms

Light detection and ranging (lidar) scanning tools are available that can make rapid digital estimations of biomass. Voxelization and convex hull are two algorithms used to calculate the volume of the scanned plant canopy, which is correlated with biomass, often the primary trait of interest. Voxelization splits the scans into regular-sized cubes, or voxels, whereas the convex hull algorithm creates a polygon mesh around the outermost points of the point cloud and calculates the volume within that mesh. In this study, digital estimates of biomass were correlated against hand-harvested biomass for field-grown corn, broom corn, and energy sorghum. Voxelization (r = 0.92) and convex hull (r = 0.95) both correlated well with plant dry biomass. Lidar data were also collected in a large breeding trial with nearly 900 genotypes of energy sorghum. In contrast to the manual harvest studies, digital biomass estimations correlated poorly with yield collected from a forage harvester for both voxel count (r = 0.32) and convex hull volume (r = 0.39). However, further analysis showed that the coefficient of variation (CV, a measure of variability) for harvester-based estimates of biomass was greater than the CV of the voxel and convex-hull-based biomass estimates, indicating that poor correlation was due to harvester imprecision, not digital estimations. Overall, results indicate that the lidar-based digital biomass estimates presented here are comparable or more precise than current approaches.

Environmental Sciences & Ecology↗

DOE OSTI2023

Particle-in-cell Simulations of Relativistic Magnetic Reconnection with Advanced Maxwell Solver Algorithms

Abstract Relativistic magnetic reconnection is a nonideal plasma process that is a source of nonthermal particle acceleration in many high-energy astrophysical systems. Particle-in-cell (PIC) methods are commonly used for simulating reconnection from first principles. While much progress has been made in understanding the physics of reconnection, especially in 2D, the adoption of advanced algorithms and numerical techniques for efficiently modeling such systems has been limited. With the GPU-accelerated PIC code WarpX, we explore the accuracy and potential performance benefits of two advanced Maxwell solver algorithms: a nonstandard finite-difference scheme (CKC) and an ultrahigh-order pseudo-spectral method (PSATD). We find that, for the relativistic reconnection problem, CKC and PSATD qualitatively and quantitatively match the standard Yee-grid finite-difference method. CKC and PSATD both admit a time step that is 40% longer than that of Yee, resulting in a ∼40% faster time to solution for CKC, but no performance benefit for PSATD when using a current deposition scheme that satisfies Gauss’s law. Relaxing this constraint maintains accuracy and yields a 30% speedup. Unlike Yee and CKC, PSATD is numerically stable at any time step, allowing for a larger time step than with the finite-difference methods. We found that increasing the time step 2.4–3 times over the standard Yee step still yields accurate results, but it only translates to modest performance improvements over CKC, due to the current deposition scheme used with PSATD. Further optimization of this scheme will likely improve the effective performance of PSATD.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2024

The Impact of Void-finding Algorithms on Galaxy Classification

We explore how the definition of a void influences the conclusions drawn about the impact of the void environment on galactic properties using two void-finding algorithms in the Void Analysis Software Toolkit: Voronoi Voids (V 2 ), a Python implementation of ZOnes Bordering On Voidness (ZOBOV); and VoidFinder, an algorithm that grows and merges spherical void regions. Using the Sloan Digital Sky Survey Data Release 7, we find that galaxies found in VoidFinder voids tend to be bluer and fainter and to have higher (specific) star formation rates than galaxies in denser regions. Conversely, galaxies found in V 2 voids show less significant differences when compared to galaxies in denser regions, less consistent with the large-scale environmental effects on galaxy properties expected from both simulations and previous observations. These results align with previous simulation results that show V 2 -identified voids “leak” into the dense walls between voids because their boundaries extend up to the density maxima in the walls. As a result, when using ZOBOV-based void-finders, galaxies likely to be part of wall regions are instead classified as void galaxies, a misclassification that can be critical to our understanding of galaxy evolution.

cosmic web↗

DOE OSTI2020

Stochastic gradient descent algorithm for stochastic optimization in solving analytic continuation problems

We propose a stochastic gradient descent based optimization algorithm to solve the analytic continuation problem in which we extract real frequency spectra from imaginary time Quantum Monte Carlo data. The procedure of analytic continuation is an ill-posed inverse problem which is usually solved by regularized optimization methods, such like the Maximum Entropy method, or stochastic optimization methods. The main contribution of this work is to improve the performance of stochastic optimization approaches by introducing a supervised stochastic gradient descent algorithm to solve a flipped inverse system which processes the random solutions obtained by a type of Fast and Efficient Stochastic Optimization Method.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Algorithm to extract direction in 2D discrete distributions and a continuous Frobenius norm

In this study, we present a novel algorithm for determining directionality in 2D distributions of discrete data. We compare a reference dataset with a known direction to a measured dataset with an unknown direction by the Frobenius norm of the difference (FND) to find the unknown direction. To generalize this concept, we develop a continuous Frobenius norm of the difference (CFND) as a continuous analog of the FND and derive its analytical expression. By relating fitted and normalized 2D Gaussian distributions, we show that the CFND approximates the FND, and we validate this relationship with computer simulations. We find that a first-order approximation of the CFND between two similar Gaussian distributions takes the form of an absolute sine function, offering a simple analytical form with potential for specialized applications in segmented inverse beta decay (IBD) neutrino detectors, astronomy, machine learning, and more. Although this method may easily extend to 3D scalar fields, our focus here is on 2D real-valued fields as it directly applies to directionality. Our methodology consists of modeling a 2D Gaussian distribution, binning the data into a histogram, and encoding it as a square matrix. Rotating this matrix around its geometric center and comparing it to a measured dataset using the FND gives us rotational data that we fit with an absolute sine function. The location of the minimum of this fit is the angle closest to the true angle of the direction in the measured dataset. We present the derivation and discuss initial applications of the CFND in our novel algorithm, demonstrating its success in approximating directionality in 2D distributions.

Data Analysis, Statistics and Probability (physics↗