Engineering Papers⌕ Search

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.

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

At least 811 records · Page 45
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Multiobjective optimization of nuclear microreactor reactivity control system operation with swarm and evolutionary algorithms

To improve the marketability of novel microreactor designs, there is a need for automated and optimal control of these reactors. This paper presents a methodology for performing multiobjective optimization of control drum operation for a microreactor under normal and off-nominal conditions. Here, two different case studies are used where the control drum configuration is optimized for the reactor to be critical with some desired power distribution that would satisfy peaking limits. A surrogate model for power distribution is developed based on a feedforward neural network. The process for determining weights for scalarization of the multiobjective optimization problem is also detailed. Six optimization algorithms: evolutionary strategies, differential evolution, grey wolf optimization, Harris hawks optimization, moth flame optimization and particle swarm optimization, are all applied to these cases and the results analyzed. Although all these algorithms will demonstrate optima-seeking behavior, for real-time control it is necessary to identify the best algorithm to efficiently provide reasonable optima without operator interference. The moth flame optimization algorithm was found to perform particularly well on both cases. Overall, it was found that the algorithms capable of supplying the best optima were also the most consistent. Finally, the found optima were verified with the original model used to train surrogates.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2025

Regional and Temporal Variability of Atmospheric River Seasonality: Influences of Detection Algorithms and Moisture Transport Dynamics

Abstract Understanding the regional and temporal variability of atmospheric river (AR) seasonality is crucial for preparedness and mitigation of extreme events. While ARs were thought to peak in winter, recent research shows they exhibit region‐specific seasonality and are heavily influenced by the chosen detection algorithm. This study examines the link between the year‐to‐year consistency of peak‐AR activity to the presence of a dominant seasonal pattern, considering both location and algorithm choice. Regions are categorized by their temporal characteristics: consistent patterns (e.g., East Asia), patterns with occasional outliers (e.g., British Columbia coast), and regions lacking a clear dominant peak season (e.g., South Atlantic, parts of Australia). Hence, not all regions display a consistent seasonal cycle of AR activity. This study quantifies the extent to which a region experiences a dominant peak season of AR activity (or lacks one) and offers insights to enhance decision‐making in water management, natural hazard preparedness, and forecasting. Furthermore, given our finding that detection algorithms influence the peak season of AR activity, we also examine two diagnostic variables representative of moisture transport to corroborate our results. Integrated vapor transport, which captures meridional and zonal moisture transport, and Moist Wave Activity, representing moisture intrusions from lower to higher latitudes, are examined. Our analysis indicates that inconsistencies in the seasonal cycle of AR activity are not solely due to discrepancies in detection algorithms but also arise from changes in moisture transport. Plain Language Summary Atmospheric rivers (ARs) are critical weather phenomena that can cause extreme events like heavy rainfall and flooding. Understanding when and where ARs are most likely to occur throughout the year is essential for preparing and responding to these events. Traditionally, ARs were thought to peak in winter, but recent studies show this varies by region. Our study helps address the challenge decision‐makers face in anticipating and preparing for AR events by providing insights into the consistency of peak seasonal patterns across different areas. Some regions, like East Asia, and the British Columbia coast, show a consistent peak season, while others, like the South Atlantic and parts of Australia, have significant year‐to‐year variations, making it hard to identify a dominant season. To better understand these changes over time, the study also examines how moisture moves in the atmosphere, using Integrated Vapor Transport (which looks at moisture movement in various directions) and Moist Wave Activity (which tracks moisture shifts from lower to higher latitudes). The findings suggest that inconsistencies in AR patterns are due not only to detection methods but also due to changes in moisture transport. Key Points The peak season of atmospheric river activity can change depending on the year in some areas Interannual variations in the peak season can make identifying a dominant season challenging for some regions Frequent shifts in peak season across years reflect inconsistencies tied to detection algorithms and to underlying dynamics

Kamnani, Diya↗
DOE OSTI2025

Predicting Flow in Fracture Networks With Quantum Algorithms

Uncertainty quantification plays a crucial role in the modeling of subsurface flow. For instance, uncertainties in the properties of geologic fracture networks significantly impact flow, requiring numerous simulations to accurately estimate quantities of interest. However, each simulation is computationally expensive because it requires solving a large linear system to capture features that involve both small and large fractures. An example is in percolation, where the interaction of many small fractures (which cumulatively can have a large surface area) with the rock matrix must be modeled precisely. Quantum computing is an emerging tool with the potential to address this issue. Quantum algorithms offer a significant speedup in solving linear systems, achieving efficiencies that are challenging to match with classical approaches. These classical approaches include direct solvers, such as LU decomposition, and iterative methods, notably preconditioned conjugate gradient, commonly used in subsurface modeling to solve large sparse systems. However, applying quantum algorithms to geologic fracture flow requires careful attention to algorithmic and problem-specific constraints to fully realize this quantum advantage. In this work we describe a quantum algorithm for generalized Monte Carlo applications with a quadratic speedup over the classical approaches which can be combined with the quantum speedup, currently under investigation, for solving quantum linear systems for subsurface flow. We show that for quantum algorithms the computational cost of estimating a quantity of interest for a statistical ensemble of networks is roughly the same as that of a single realization, essentially implying that one can get uncertainty quantification for free.

58 GEOSCIENCES↗
DOE OSTI2024

Towards provably efficient quantum algorithms for large-scale machine-learning models

Large machine learning models are revolutionary technologies of artificial intelligence whose bottlenecks include huge computational expenses, power, and time used both in the pre-training and fine-tuning process. In this work, we show that fault-tolerant quantum computing could possibly provide provably efficient resolutions for generic (stochastic) gradient descent algorithms, scaling as $\mathcal{O}$(T 2 x polylog($n$)), where n is the size of the models and T is the number of iterations in the training, as long as the models are both sufficiently dissipative and sparse, with small learning rates. Based on earlier efficient quantum algorithms for dissipative differential equations, we find and prove that similar algorithms work for (stochastic) gradient descent, the primary algorithm for machine learning. In practice, we benchmark instances of large machine learning models from 7 million to 103 million parameters. We find that, in the context of sparse training, a quantum enhancement is possible at the early stage of learning after model pruning, motivating a sparse parameter download and re-upload scheme. Our work shows solidly that fault-tolerant quantum algorithms could potentially contribute to most state-of-the-art, large-scale machine-learning problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Genetic algorithms for computational materials discovery accelerated by machine learning

Materials discovery is increasingly being impelled by machine learning methods that rely on pre-existing datasets. Where datasets are lacking, unbiased data generation can be achieved with genetic algorithms. Here a machine learning model is trained on-the-fly as a computationally inexpensive energy predictor before analyzing how to augment convergence in genetic algorithm-based approaches by using the model as a surrogate. This leads to a machine learning accelerated genetic algorithm combining robust qualities of the genetic algorithm with rapid machine learning. The approach is used to search for stable, compositionally variant, geometrically similar nanoparticle alloys to illustrate its capability for accelerated materials discovery, e.g., nanoalloy catalysts. The machine learning accelerated approach, in this case, yields a 50-fold reduction in the number of required energy calculations compared to a traditional “brute force” genetic algorithm. This makes searching through the space of all homotops and compositions of a binary alloy particle in a given structure feasible, using density functional theory calculations.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Solving the Bernstein-Vazirani problem using Majorana-based topological quantum algorithms

Executing quantum algorithms using Majorana zero modes—a major milestone for the field of topological quantum computing—requires a platform that can be scaled to large quantum registers, can be controlled in real time and space, and a braiding protocol that uses the unique properties of these exotic particles. Here, we demonstrate the first successful simulation of a Majorana-based, fault-tolerant quantum algorithm to solve the Bernstein-Vazirani problem in two-dimensional magnet-superconductor hybrid structures from initialization to read-out of the final many-body state. Utilizing the Majorana zero modes’ topological properties, we introduce an optimized braiding protocol for the algorithm and a scalable architecture for its implementation with an arbitrary number of qubits. We visualize the algorithm protocol in real time and space by computing the non-equilibrium density of states, which is proportional to the time-dependent differential conductance, and the non-equilibrium charge density, which assigns a unique signature to each final state of the algorithm.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2020

A quantum algorithm for evolving open quantum dynamics on quantum computing devices

Abstract Designing quantum algorithms for simulating quantum systems has seen enormous progress, yet few studies have been done to develop quantum algorithms for open quantum dynamics despite its importance in modeling the system-environment interaction found in most realistic physical models. In this work we propose and demonstrate a general quantum algorithm to evolve open quantum dynamics on quantum computing devices. The Kraus operators governing the time evolution can be converted into unitary matrices with minimal dilation guaranteed by the Sz.-Nagy theorem. This allows the evolution of the initial state through unitary quantum gates, while using significantly less resource than required by the conventional Stinespring dilation. We demonstrate the algorithm on an amplitude damping channel using the IBM Qiskit quantum simulator and the IBM Q 5 Tenerife quantum device. The proposed algorithm does not require particular models of dynamics or decomposition of the quantum channel, and thus can be easily generalized to other open quantum dynamical models.

42 ENGINEERING↗
DOE OSTI2022

An image classification deep-learning algorithm for shrapnel detection from ultrasound images

Ultrasound imaging is essential for non-invasively diagnosing injuries where advanced diagnostics may not be possible. However, image interpretation remains a challenge as proper expertise may not be available. In response, artificial intelligence algorithms are being investigated to automate image analysis and diagnosis. Here, we highlight an image classification convolutional neural network for detecting shrapnel in ultrasound images. As an initial application, different shrapnel types and sizes were embedded first in a tissue mimicking phantom and then in swine thigh tissue. The algorithm architecture was optimized stepwise by minimizing validation loss and maximizing F1 score. The final algorithm design trained on tissue phantom image sets had an F1 score of 0.95 and an area under the ROC curve of 0.95. It maintained higher than a 90% accuracy for each of 8 shrapnel types. When trained only on swine image sets, the optimized algorithm format had even higher metrics: F1 and area under the ROC curve of 0.99. Overall, the algorithm developed resulted in strong classification accuracy for both the tissue phantom and animal tissue. This framework can be applied to other trauma relevant imaging applications such as internal bleeding to further simplify trauma medicine when resources and image interpretation are scarce.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2020

Fault-tolerant grid frequency measurement algorithm during transients

Many critical electric grid operations rely on accurate grid frequency measurements. Unfortunately, the measurement accuracy can be easily undermined by power system transient faults. During a power system transient fault, the power grid voltages and currents are usually highly distorted by high-frequency components. What is worse, the power grid signals could have discontinuity during some system transient faults such as phase angle jump, and the discontinuity could result in large measurement errors to state-of-the-art grid measurement algorithms. In this study, a fault-tolerant grid frequency measurement algorithm during transients is proposed. The new algorithm consists of two stages. The first stage is a transient detector, and it can detect the occurrence of system transient faults instantaneously. The second stage is the intelligent frequency estimator, and it will adapt its measurements according to the transient detector. The performance of the algorithm is evaluated under different steady-state and transient conditions. Both dependability and security of the fault-tolerant algorithm are assessed by using PSCAD simulation data and IEEE Standard test data.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2023

A group finder algorithm optimised for the study of local galaxy environments

Context. The majority of galaxy group catalogues available in the literature use the popular friends-of-friends algorithm which links galaxies using a linking length. One potential drawback to this approach is that clusters of points can be linked with thin bridges which may not be desirable. In order to study galaxy groups, it is important to obtain realistic group structures. Aim. Here, in this study, we present a new simple group finder algorithm, TD-ENCLOSER, that finds the group that encloses a target galaxy of interest. Methods. TD-ENCLOSER is based on the kernel density estimation method which treats each galaxy, represented by a zero-dimensional particle, as a two-dimensional circular Gaussian. The algorithm assigns galaxies to peaks in the density field in order of density in descending order (‘top down’) so that galaxy groups ‘grow’ around the density peaks. Outliers in under-dense regions are prevented from joining groups by a specified hard threshold, while outliers at the group edges are clipped below a soft (blurred) interior density level. Results. The group assignments are largely insensitive to all free parameter variations apart from the hard density threshold and the kernel standard deviation, although this is a known feature of density-based group finder algorithms and it operates with a computing speed that increases linearly with the size of the input sample. In preparation for a companion paper, we also present a simple algorithm to select unique representative groups when duplicates occur. Conclusions. TD-ENCLOSER is tested on a mock galaxy catalogue using a smoothing scale of 0.3 Mpc and is found to be able to recover the input group distribution with sufficient accuracy to be applied to observed galaxy distributions.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2021

An algorithm to locate the centers of baryon acoustic oscillations

The cosmic structure formed from baryon acoustic oscillations (BAO) in the early universe is imprinted in the galaxy distribution observable in large-scale surveys and is used as a standard ruler in contemporary cosmology. Typically, BAOs are detected as a preferential length scale in two-point statistics, which gives little information about the location of the BAO structures in real space. The aim of the algorithm described in this paper is to find probable centers of BAOs in the cosmic matter distribution. The algorithm convolves the three-dimensional distribution of matter density with a spherical shell kernel of variable radius placed at different locations. The locations that correspond to the highest values of the convolution correspond to the probable centers of BAOs. This method is realized in an open-source, computationally efficient algorithm. Here, we describe the algorithm and present the results of applying it to the SDSS DR9 CMASS survey and associated mock catalogs. A detailed performance study demonstrates the ability of the algorithm to locate BAO centers and in doing so presents a novel detection of the BAO scale in galaxy surveys.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2018

A generalized muon trajectory estimation algorithm with energy loss for application to muon tomography

Here, this work presents a generalized muon trajectory estimation (GMTE) algorithm to estimate the path of a muon in either uniform or nonuniform media. The use of cosmic ray muons in nuclear nonproliferation and safeguards verification applications has recently gained attention due to the non-intrusive and passive nature of the inspection, penetrating capabilities, as well as recent advances in detectors that measure position and direction of the individual muons before and after traversing the imaged object. However, muon image reconstruction techniques are limited in resolution due to low muon flux and the effects of multiple Coulomb scattering (MCS). Current reconstruction algorithms, e.g., point of closest approach (PoCA) or straight-line path (SLP), rely on overly simple assumptions for muon path estimation through the imaged object. For robust muon tomography, efficient and flexible physics-based algorithms are needed to model the MCS process and accurately estimate the most probable trajectory of a muon as it traverses an object. In the present work, the use of a Bayesian framework and a Gaussian approximation of MCS are explored for estimation of the most likely path of a cosmic ray muon traversing uniform or nonuniform media and undergoing MCS. The algorithm’s precision is compared to Monte Carlo simulated muon trajectories. It was found that the algorithm is expected to be able to predict muon tracks to less than 1.5 mm RMS for 0.5 GeV muons and 0.25 mm RMS for 3 GeV muons, a 50% improvement compared to SLP and 15% improvement when compared to PoCA. Further, a 30% increase in useful muon flux was observed relative to PoCA. Muon track prediction improved for higher muon energies or smaller penetration depth where energy loss is not significant. Finally, the effect of energy loss due to ionization is investigated, and a linear energy loss relation that is easy to use is proposed.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Efficient numerical algorithm for multi-level ionization of high-atomic-number gases

An efficient numerical algorithm for laser driven multi-level ionization of high-atomic-number gases is proposed and implemented in an electromagnetic particle-in-cell code SPACE. The algorithm is based on analytical solutions to the system of differential equations describing ionization evolution. Using analytical solutions resolves the multiscale issue of ionization due to different characteristic time scales of ionization processes and the main code time step. Algorithm efficiency and memory requirements are significantly improved by using a locally reduced system of differential equations. The algorithm also assigns proper orbital quantum numbers and their projections to ionization states. The algorithm is verified and validated using experimental data.

Cheng, A. (ORCID:000000021945282X)↗
DOE OSTI2019

A fourth-order adaptive mesh refinement algorithm for the multicomponent, reacting compressible Navier–Stokes equations

In this study, we present a fourth-order in space and time block-structured adaptive mesh refinement algorithm for the compressible multicomponent reacting Navier–Stokes equations. The algorithm uses a finite-volume approach that incorporates a fourth-order discretisation of the convective terms. The time-stepping algorithm is based on a multi-level spectral deferred corrections method that enables explicit treatment of advection and diffusion coupled with an implicit treatment of reactions. The temporal scheme is embedded in a block-structured adaptive mesh refinement algorithm that includes subcycling in time with spectral deferred correction sweeps applied on levels. Here we present the details of the multi-level scheme paying particular attention to the treatment of coarse–fine boundaries required to maintain fourth-order accuracy in time. We then demonstrate the convergence properties of the algorithm on several test cases including both non-reacting and reacting flows. Finally we present simulations of a vitiated dimethyl ether jet in 2D and a turbulent hydrogen jet in 3D, both with detailed kinetics and transport.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Learning-based traffic signal control algorithms with neighborhood information sharing: An application for sustainable mobility

Here, this research applies R-Markov Average Reward Technique based reinforcement learning (RL) algorithm, namely RMART, for vehicular signal control problem leveraging information sharing among signal controllers in connected vehicle environment. We implemented the algorithm in a network of 18 signalized intersections and compare the performance of RMART with fixed, adaptive, and variants of the RL schemes. Results show significant improvement in system performance for RMART algorithm with information sharing over both traditional fixed signal timing plans and real time adaptive control schemes. Additionally, the comparison with reinforcement learning algorithms including Q learning and SARSA indicate that RMART performs better at higher congestion levels. Further, a multi-reward structure is proposed that dynamically adjusts the reward function with varying congestion states at the intersection. Finally, the results from test networks show significant reduction in emissions (CO, CO 2 , NO x , VOC, PM 10 ) when RL algorithms are implemented compared to fixed signal timings and adaptive schemes.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2018

Local rewiring algorithms to increase clustering and grow a small world

Abstract Many real-world networks have high clustering among vertices: vertices that share neighbours are often also directly connected to each other. A network’s clustering can be a useful indicator of its connectedness and community structure. Algorithms for generating networks with high clustering have been developed, but typically rely on adding or removing edges and nodes, sometimes from a completely empty network. Here, we introduce algorithms that create a highly clustered network by starting with an existing network and rearranging edges, without adding or removing them; these algorithms can preserve other network properties even as the clustering increases. They rely on local rewiring rules, in which a single edge changes one of its vertices in a way that is guaranteed to increase clustering. This greedy step can be applied iteratively to transform a random network into a form with much higher clustering. Additionally, the algorithms presented grow a network’s clustering faster than they increase its path length, meaning that network enters a regime of comparatively high clustering and low path length: a small world. These algorithms may be a basis for how real-world networks rearrange themselves organically to achieve or maintain high clustering and small-world structure.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

sOPTICS: a modified density-based algorithm for identifying galaxy groups/clusters and brightest cluster galaxies

A direct approach to studying the galaxy–halo connection is to analyse groups and clusters of galaxies that trace the underlying dark matter haloes, emphasizing the importance of identifying galaxy clusters and their associated brightest cluster galaxies (BCGs). In this work, we test and propose a robust density-based clustering algorithm that outperforms the traditional Friends-of-Friends (FoF) algorithm in the currently available galaxy group/cluster catalogues. Our new approach is a modified version of the Ordering Points To Identify the Clustering Structure (OPTICS) algorithm, which accounts for line-of-sight positional uncertainties due to redshift space distortions by incorporating a scaling factor, and is thereby referred to as sOPTICS. When tested on both a galaxy group catalogue based on semi-analytic galaxy formation simulations and observational data, our algorithm demonstrated robustness to outliers and relative insensitivity to hyperparameter choices. In total, we compared the results of eight clustering algorithms. The proposed density-based clustering method, sOPTICS, outperforms FoF in accurately identifying giant galaxy clusters and their associated BCGs in various environments with higher purity and recovery rate, also successfully recovering 115 BCGs out of 118 reliable BCGs from a large galaxy sample. Furthermore, when applied to an independent observational catalogue without extensive re-tuning, sOPTICS maintains high recovery efficiency, confirming its flexibility and effectiveness for large-scale astronomical surveys.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

Improved algorithm for dynamical triangulations and simulations of finer lattices

We introduce a new algorithm for the simulation of Euclidean dynamical triangulations that mimics the Metropolis-Hastings algorithm, but where all proposed moves are accepted. This rejection-free algorithm allows for the factorization of local and global terms in the action, a condition needed for efficient simulation of theories with global terms, while still maintaining detailed balance. We test our algorithm on the 2 d Ising model, and against results for EDT obtained with standard Metropolis. Our new algorithm allows us to simulate EDT at finer lattice spacings than previously possible, and we find geometries that resemble semiclassical Euclidean de Sitter space in agreement with earlier results at coarser lattices. The agreement between lattice data and the classical de Sitter solution continues to get better as the lattice spacing decreases. Published by the American Physical Society 2024

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗