Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “generalized algorithm”

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

Hiperclust

This software leverages transfer learning to analyze atom probe tomography (APT) data. It is trained on synthetic data and then applies this knowledge to predict the optimal number of clusters for a given APT dataset. Initially, the software used preliminary clustering to estimate the general structure of the data. Based on this, it provides suggestions for key parameters like minimum cluster size and minimum number of points. These parameters are critical for algorithms like HDBSCAN, ensuring accurate cluster formation without the need for trial-and-error testing. The software runs on High-Performance computing (HPC) systems, enabling fast, scalable analysis of large APT datasets, ultimately saving time and improving the reliability of clustering outcomes.

Tang, Yalei [Idaho National Laboratory (INL), Idah↗
DOE OSTI2021

Deep Learning for Fish Identification from Sonar Data: CRADA 481 [Abstract only]

To help solve the challenges of hydropower energy production related to the potential for eel injury and mortality from passage through hydropower turbines, we will develop a deep learning method for identifying migrating eels from imaging sonar. This project continues with a prior project conducted by the Pacific Northwest National Laboratory (PNNL) and the Electric Power Research Institute (EPRI) in FY2018-2019. The proposed method employs Convolution Neural Network (CNN), a powerful deep learning method for image classification, to distinguish between images of eels and non-eel moving objects. We propose to collect more laboratory data and add more existing field data to train a powerful deep learning model. In addition to eels and sticks as classified in previous studies, we will add images containing several non-eel fish species and macrophyte mats to the training data. A multi-class classification model will be developed to distinguish these objects. Object detection algorithm will be explored and developed to locate and identify multiple objects in each sonar frame. Motion analysis will be performed to track the movement of objects in sonar video clips. We will also improve the data conversion algorithm so that it can read in both DIDSON and ARIS (both are imaging sonars developed by Sound Metrics Corp) data files and convert them to images with comparably high resolution, regardless of the varying detection ranges in different environments. The developed algorithms will be packaged as a software with a graphic user interface. The software will be evaluated by external collaborators in the field. The developed framework can be generalized for automatic monitoring of fish passage and migration using other imaging sonars like ARIS and will benefit the design and operation of ecologically friendly hydroelectric projects. The developed wavelet and CNN model configuration parameters can potentially be transferred to lamprey detection in similar riverine environments.

13 HYDRO ENERGY↗
DOE OSTI2022

Bayesian Optimization Framework for Imperfect Data or Models

Conventional Bayesian optimization methods implicitly assume that the data and model being optimized are “perfect.” This assumption leads to inaccurate posterior probability distribution functions (PDFs) when applied to “imperfect” data or models. The new Bayesian optimization framework presented in this report provides a way to parameterize the effect of imperfections usually encountered in a prior PDF of generalized data or a model on the posterior PDF. The effects of imperfections are parameterized by a set of constraints imposed on the posterior expectation values of deviations between the data and the model and on their covariance matrix elements. A particular set of values for these constraints conveys an evaluator’s best estimate of the effect of imperfections on the corresponding posterior expectation values. When a prior PDF of generalized data is assumed to be normal, an expression for a posterior PDF satisfying an arbitrary set of constraints is derived analytically for linear models. An analogous iterative algorithm is given for nonlinear models. The corresponding posterior PDF should be used to estimate any posterior expectation values in the presence of imperfections parameterized by that set of constraints. A posterior PDF of a conventional Bayesian optimization method is recovered analytically when all evaluator-specified constraints are set to zero (i.e., in the absence of any imperfections). The analytical expressions derived in this report for normal PDFs and linear models were verified numerically by a Metropolis–Hastings Monte Carlo method. The methods presented herein could be applied to any kind of data or models, including differential cross-section data or integral benchmark experiments.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Evaluation of Portable Programming Models to Accelerate LArTPC Detector Simulations

The Liquid Argon Time Projection Chamber (LArTPC) technology is widely used in high energy physics experiments, including the upcoming Deep Underground Neutrino Experiment (DUNE). Accurately simulating LArTPC detector responses is essential for analysis algorithm development and physics model interpretations. Accurate LArTPC detector response simulations are computationally demanding, and can become a bottleneck in the analysis workflow. Compute devices such as General-Purpose Graphics Processing Units (GPGPUs) have the potential to substantially accelerate simulations compared to traditional CPU-only processing. The software development that requires often carries the cost of specialized code refactorization and porting to match the target hardware architecture. With the rapid evolution and increased diversity of the computer architecture landscape, it is highly desirable to have a portable solution that also maintains reasonable performance. We report our ongoing effort in evaluating Kokkos as a basis for this portable programming model using LArTPC simulations in the context of the Wire-Cell Toolkit, a C++ library for LArTPC simulations, data analysis, reconstruction and visualization.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2022

A phase transition for finding needles in nonlinear haystacks with LASSO artificial neural networks

To fit sparse linear associations, a LASSO sparsity inducing penalty with a single hyperparameter provably allows to recover the important features (needles) with high probability in certain regimes even if the sample size is smaller than the dimension of the input vector (haystack). More recently learners known as artificial neural networks (ANN) have shown great successes in many machine learning tasks, in particular fitting nonlinear associations. Small learning rate, stochastic gradient descent algorithm and large training set help to cope with the explosion in the number of parameters present in deep neural networks. Yet few ANN learners have been developed and studied to find needles in nonlinear haystacks. Driven by a single hyperparameter, our ANN learner, like for sparse linear associations, exhibits a phase transition in the probability of retrieving the needles, which we do not observe with other ANN learners. To select our penalty parameter, we generalize the universal threshold of Donoho and Johnstone (Biometrika 81(3):425–455, 1994) which is a better rule than the conservative (too many false detections) and expensive cross-validation. In the spirit of simulated annealing, we propose a warm-start sparsity inducing algorithm to solve the high-dimensional, non-convex and non-differentiable optimization problem. We perform simulated and real data Monte Carlo experiments to quantify the effectiveness of our approach.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Optimizing pressurized-water reactor equilibrium cycle using a novel loading pattern encoding and rule-based genetic crossover operators

This work presents an extended multi-batch approach applied in shuffling scheme optimization for equilibrium cycle for pressurized water reactors using Genetic Algorithms (GAs). A new ruled based GA crossover operator called Inherited Location and Batch (ILB) was introduced to enhance offsprings reproduction efficiency specialized for equilibrium cycle optimization problem. This approach was implemented within the Plant ReLoad Optimization (PRLO) framework and validated using a generic reactor model based on the AP1000 design, with core parameters calculated via the CASMO/SIMULATE software package. The ILB approach is then applied for both single and multi-objective problems in maximizing cycle length and core average exposure while minimizing the average enrichment of the 57 fresh fuel assemblies (FAs) per cycle. The optimal solutions are selected based on their dominance to the objectives from all feasible solutions. This research identified three optimal solutions satisfied safety constraints: The first solution minimizes feed enrichment costs with a cycle length of 338.8 days and core exposure of 25.39 MWd/MT; the second solution extends cycle length to 361.2 days, with the highest core exposure of 26.84 MWd/MT, using 3.75 wt% average fuel enrichment; the third solution balances both objectives with a cycle length of 349.6 days, core exposure of 25.82 MWd/MT with a slight enrichment increase compared to the first solution. Collectively, these findings underscore the efficiency and effectiveness of the proposed approach in achieving practical multi-objective optimal equilibrium cycle designs using GAs optimizer.

11 - NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2020

Characterization of Quantum States Based on Creation Complexity

Abstract The creation complexity of a quantum state is the minimum number of elementary gates required to create it from a basic initial state. The creation complexity of quantum states is closely related to the complexity of quantum circuits, which is crucial in developing efficient quantum algorithms that can outperform classical algorithms. A major question unanswered so far is what quantum states can be created with a number of elementary gates that scales polynomially with the number of qubits. In this work, it is first shown that for an entirely general quantum state it is exponentially hard (requires a number of steps that scales exponentially with the number of qubits) to determine if the creation complexity is polynomial. Then, it is shown that it is possible for a large class of quantum states with polynomial creation complexity to have common coefficient features such that, given any candidate quantum state, an efficient coefficient sampling procedure can be designed to determine if the state belongs to the class or not with arbitrarily high success probability. Consequently, partial knowledge of a quantum state's creation complexity is obtained, which can be useful for designing quantum circuits and algorithms involving such a state.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2020

K-space algorithmic reconstruction (KAREN): a robust statistical methodology to separate Bragg and diffuse scattering

Diffuse scattering occurring in the Bragg diffraction pattern of a long-range-ordered structure represents local deviation from the governing regular lattice. However, interpreting the real-space structure from the diffraction pattern presents a significant challenge because of the dramatic difference in intensity between the Bragg and diffuse components of the total scattering function. In contrast to the sharp Bragg diffraction, the diffuse signal has generally been considered to be a weak expansive or continuous background signal. In this paper, using 1D and 2D models, it is demonstrated that diffuse scattering in fact consists of a complex array of high-frequency features that must not be averaged into a low-frequency background signal. To evaluate the actual diffuse scattering effectively, an algorithm has been developed that uses robust statistics and traditional signal processing techniques to identify Bragg peaks as signal outliers which can be removed from the overall scattering data and then replaced by statistically valid fill values. This method, described as a 'K-space algorithmic reconstruction' (KAREN), can identify Bragg reflections independent of prior knowledge of a system's unit cell. KAREN does not alter any data other than that in the immediate vicinity of the Bragg reflections, and reconstructs the diffuse component surrounding the Bragg peaks without introducing discontinuities which induce Fourier ripples or artifacts from underfilling `punched' voids. The KAREN algorithm for reconstructing diffuse scattering provides demonstrably better resolution than can be obtained from previously described punch-and-fill methods. The superior structural resolution obtained using the KAREN method is demonstrated by evaluating the complex ordered diffuse scattering observed from the neutron diffraction of a single plastic crystal of CBr 4 using pair distribution function analysis.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Load-Displacement Relation and Gap Distribution Between Rough Surfaces: Partial Differential Equations Approach

We develop a theoretical model to predict the load-displacement relation and probability density function for gaps between contacting rough surfaces. We derive partial differential equations from the previous model (Joe et al., 2018), and extend them to the non-adhesive contact problem. The predictions of the present theory are compared with numerical results using the Green's function molecular dynamics algorithm, and a good agreement is obtained.

adhesion↗
DOE OSTI2022

AI@DOE Interim Executive Report

Interim executive report for DOE’s Office of Science, NNSA, and Applied Energy Offices, in collaboration with the Artificial Intelligence and Technology Office, DOE AI roundtable workshops (December 2021 through February 2022) (“AI@DOE”). These workshops were used to help identify AI research requirements and priorities for the next decade for Department of Energy in developing machine-learning-based prediction and decision-support capabilities that address and anticipate DOE mission challenges. These missions’ challenges for AI include: AI to advance scientific discovery and technological innovation AI to support high consequence decisions while managing risk AI to improve DOE’s responsiveness to national & global issues AI to assist stewardship of the environment and national critical infrastructure These will be addressed in large part through the development and application of new and powerful artificial intelligence and/or machine learning algorithms and strategies. https://web.cvent.com/event/fc3922f8-fc75-4041-a317-f13a1da44f7c/summary?locale=en-US&i=2Wx2tjbStkydRFq_N2whPw

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Encoding trade-offs and design toolkits in quantum algorithms for discrete optimization: coloring, routing, scheduling, and other problems

Challenging combinatorial optimization problems are ubiquitous in science and engineering. Several quantum methods for optimization have recently been developed, in different settings including both exact and approximate solvers. Addressing this field of research, this manuscript has three distinct purposes. First, we present an intuitive method for synthesizing and analyzing discrete (i.e., integer-based) optimization problems, wherein the problem and corresponding algorithmic primitives are expressed using a discrete quantum intermediate representation (DQIR) that is encoding-independent. This compact representation often allows for more efficient problem compilation, automated analyses of different encoding choices, easier interpretability, more complex runtime procedures, and richer programmability, as compared to previous approaches, which we demonstrate with a number of examples. Second, we perform numerical studies comparing several qubit encodings; the results exhibit a number of preliminary trends that help guide the choice of encoding for a particular set of hardware and a particular problem and algorithm. Our study includes problems related to graph coloring, the traveling salesperson problem, factory/machine scheduling, financial portfolio rebalancing, and integer linear programming. Third, we design low-depth graph-derived partial mixers (GDPMs) up to 16-level quantum variables, demonstrating that compact (binary) encodings are more amenable to QAOA than previously understood. We expect this toolkit of programming abstractions and low-level building blocks to aid in designing quantum algorithms for discrete combinatorial problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

SNoGloDe: A Structured Nonlinear Global Decomposition Solver

Large-scale optimization problems often require decomposition strategies and customized algorithms to achieve optimal solutions within a reasonable time. Building on the work of Cao and Zavala (2019) for solving nonlinear two-stage stochastic programs to global optimality, we implement and extend their approach. We generalize to optimization problems reformulated with a block-angular constraint structure (e.g., temporal decomposition). Our framework, written in Python using Pyomo, is highly customizable and enables parallel execution of the decomposition. SNoGloDe allows tailored branching strategies, lower bounding problems, and candidate generators to leverage problem-specific knowledge. To demonstrate effectiveness, we compare SNoGloDe’s performance with Gurobi on a temporally decomposed produced water case study.

algorithms↗
DOE OSTI2026

Direct estimation of the density of states for fermionic systems

Simulating time evolution is one of the most natural applications of quantum computers and is thus one of the most promising prospects for achieving practical quantum advantage. Here, we develop quantum algorithms to extract thermodynamic properties by estimating the density of states (DOS), which is a central object in quantum statistical mechanics. We introduce several key innovations that significantly improve the practicality and extend the generality of previous techniques. First, our approach allows one to estimate the DOS only for a specific subspace of the full Hilbert space. This is crucial for fermionic systems, since both canonical and grand canonical ensemble thermal equilibrium properties depend on subspaces of fixed number. Second, in our approach, by time evolving very simple, random initial states, such as randomly chosen computational basis states, we can exactly recover the DOS on average. Third, due to circuit-depth limitations, we only reconstruct the DOS up to a convolution with a Gaussian window—thus all imperfections that shift the energy levels by less than the width of the convolution window will not significantly affect the estimated DOS. For these reasons, we find the approach is a promising candidate for early quantum advantage as even short-time, noisy dynamics can yield a semiquantitative reconstruction of the DOS (convolution with a broad Gaussian window), while early fault-tolerant devices will likely enable higher-resolution DOS reconstruction through longer time evolutions. We demonstrate the practicality of our approach in representative Fermi-Hubbard and spin models and indeed find that our approach is highly robust against algorithmic errors in the time evolution and against gate noise. We further demonstrate that our approach is compatible with noisy intermediate-scale quantum (NISQ) computing NISQ-friendly variational techniques, introducing and leveraging a technique for variational time evolution.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Machine-Learning-Based Mapping and Modeling of Solar Energy with Ultra-High Spatiotemporal Granularity

Despite the rapid growth of solar energy, we still lack a dynamic, high-fidelity database that tracks the spatiotemporal variations of solar PVs and their associated infrastructures across different places at a spatially resolved scale. The absence of such data presents a barrier to various applications such as solar PV growth projection, solar energy integration, solar incentive design, and climate risk assessment. In this project, we aim to bridge this gap by developing AI-based algorithms to extract granular information about solar PV installations and their associated infrastructures (i.e., distribution grids) from widely available unstructured data like remote sensing images and street views. As a result, we have built the Solar Energy Atlas, a fine-grained, large-scale geospatial overlay of distributed solar PVs and distribution grids. On top of it, we have advanced the understanding of solar adoption and distribution grid vulnerability to climate-induced extremes. Our major contributions can be summarized as follow: (1) By developing new AI algorithms, we have built the most comprehensive solar PV spatiotemporal database covering the entire US. This is the first time we obtained the exact GPS locations, size, subtype, and installation year information for rooftop solar PVs across the US. This database can be used for solar PV growth projection, solar energy integration, solar energy policy analysis and design, and spatially-resolved climate risk assessment. (2) Leveraging this database, we have uncovered the socioeconomic driving factors that are correlated with earlier onset of solar adoption and higher saturated adoption levels. We have identified the heterogeneity in the effects of different types of financial incentives on solar adoption and provided implications for tailoring incentive design based on local income levels to promote equitable solar adoption. (3) We have developed a distribution grid GIS mapping algorithm which can obtain granular geospatial and topology information about distribution grids using multi-modal open data, reducing the dependency on hard-to-obtain smart meter data of conventional approaches. It shows effectiveness in both the U.S. and Sub-Saharan Africa. Using this algorithm, we have uncovered the non-uniform vulnerability of distribution grids to wildfires in California in the aspects of undergrounding protection and Distributed Energy Resources (DER) preparedness. This has provided important implications for improving the affordability and equity of grid adaptation approaches. (3) We have made our produced database publicly available and provided user-friendly interface to enable various stakeholders and the general public to interact with the data. We have also integrated the produced data into the Data Commons platform to enable the public to access the data and correlate it with other location-specific characteristics simply using natural language as queries. The impact of our project is three-fold: (1) New algorithms for mapping solar PVs and distribution grids across space and time, which are open source to facilitate researchers and industry; (2) New databases of solar PVs and distribution grids that have been made publicly available for engineering, social, and policy applications; (3) New understandings and actionable insights on the potential approaches to promoting solar adoption and reducing energy infrastructure vulnerabilities. In this report, we start by discussing the project background and motivation (section 5), followed by the overview of project objectives (section 6). Results and discussion for each task are presented in section 7. Significant accomplishments are summarized in section 8. This report will be concluded by discussing the paths forwards (section 9), products (section 10), and team roles (section 11).

14 SOLAR ENERGY↗
DOE OSTI2023

Reinforcement Learning-Guided Long-Timescale Simulation of Hydrogen Transport in Metals

Diffusion in alloys is an important class of atomic processes. However, atomistic simulations of diffusion in chemically complex solids are confronted with the timescale problem: the accessible simulation time is usually far shorter than that of experimental interest. In this work, long-timescale simulation methods are developed using reinforcement learning (RL) that extends simulation capability to match the duration of experimental interest. Two special limits, RL transition kinetics simulator (TKS) and RL low-energy states sampler (LSS), are implemented and explained in detail, while the meaning of general RL are also discussed. As a testbed, hydrogen diffusivity is computed using RL TKS in pure metals and a medium entropy alloy, CrCoNi, and compared with experiments. The algorithm can produce counter-intuitive hydrogen-vacancy cooperative motion. We also demonstrate that RL LSS can accelerate the sampling of low-energy configurations compared to the Metropolis–Hastings algorithm, using hydrogen migration to copper (111) surface as an example.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Interpolation of compound semiconductor alloy parameters from those of their constituents

Several methods have been proposed for interpolation of the value of physical parameters of quaternary alloys from those of their constituent ternary and binary sub-alloys. These expressions agree when non-linear bowing terms are not required; they differ in how the bowing terms of the bounding ternaries should be utilized. Common interpolation expressions for quaternaries can be generalized into two groups: (1) those that use a linear interpolation of the nearest ternary parameter values and (2) those that interpolate over binary values with a bowing term derived from the bounding ternaries. The second group of methods is equivalent to a polynomial expansion over the alloy’s interpolation space. For compound semiconductor alloys, the geometry of the composition space is the direct sum of the group-III and group-V mixture sub-spaces. The mixture sub-spaces are best described using barycentric coordinates on a regular simplex. A general polynomial expansion of the value of an alloy parameter using barycentric coordinates for the group-III and group-V simplex spaces is described along with an algorithm to generate interpolation expressions for alloys with arbitrary numbers of elements, including quinary and senary alloys. It is shown that a polynomial expansion produces values in closer agreement with the direct gap of quaternaries lattice-matched to common substrates than do approaches using an interpolation of the ternary values, despite a prominent recommendation to the contrary. Finally, a quaternary correction term is described that improves the predicted direct bandgap energies of GaInAsSb for compositions near those lattice matched to InP, InAs, and GaSb.

Olesberg, Jonathon T. [Sandia National Laboratorie↗
DOE OSTI2024

Reductive quantum phase estimation

Estimating a quantum phase is a necessary task in a wide range of fields of quantum science. To accomplish this task, two well-known methods have been developed in distinct contexts, namely, Ramsey interferometry (RI) in atomic and molecular physics and quantum phase estimation (QPE) in quantum computing. We demonstrate that these canonical examples are instances of a larger class of phase estimation protocols, which we call reductive quantum phase estimation (RQPE) circuits. Here, we present an explicit algorithm that allows one to create an RQPE circuit. This circuit distinguishes an arbitrary set of phases with a smaller number of qubits and unitary applications, thereby solving a general class of quantum hypothesis testing to which RI and QPE belong. We further demonstrate a tradeoff between measurement precision and phase distinguishability, which allows one to tune the circuit to be optimal for a specific application. Published by the American Physical Society 2024

Papadopoulos, Nicholas J. C. (ORCID:00000002635700↗