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

Particle Swarm Optimization of Dynamic Load Model Parameters in Large Systems

This paper considers two dynamic load models that are widely used in industry to account for induction motor behavior: CMLD and CLOD. These models must be parametrized for the specific utility system in a general way so that they can be used in planning studies and provide a conservative but realistic representation of load behavior. This study considers a measurement-based approach to tuning both models. The load modeling study compares the response of the tuned models to generic candidate models using historical events. This study considers one area-based subsystem to simplify the modeling approach and reduce the number of models required for simulations. Additionally, because dynamic load models often produce similar results for different sets of parameters, a sensitivity study was conducted to assess the parameter impacts on the voltage response. The sensitivity study covers the parameters that are tuned using event measurements. The process to estimate the parameters uses the particle-swarm optimization algorithm. Overall, the performance of the tuned model more accurately captures recovery voltage, delayed recovery, and settling voltage than its predecessor models while not being overly tuned so that it remains general for peak summer conditions.

dynamic load modeling↗
DOE OSTI2022

Krylov subspace recycling for evolving structures

Krylov subspace recycling is a powerful tool when solving a long series of large, sparse linear systems that change only slowly over time. In PDE constrained shape optimization, these series appear naturally, as typically hundreds or thousands of optimization steps are needed with only small changes in the geometry. In this setting, however, applying Krylov subspace recycling can be a difficult task. As the geometry evolves, in general, so does the finite element mesh defined on or representing this geometry, including the numbers of nodes and elements and element connectivity. This is especially the case if re-meshing techniques are used. As a result, the number of algebraic degrees of freedom in the system changes, and in general the linear system matrices resulting from the finite element discretization change size from one optimization step to the next. Changes in the mesh connectivity also lead to structural changes in the matrices. In the case of re-meshing, even if the geometry changes only a little, the corresponding mesh might differ substantially from the previous one. Obviously, this prevents any straightforward mapping of the approximate invariant subspace of the linear system matrix (the focus of recycling in this work) from one optimization step to the next; similar problems arise for other selected subspaces. In this paper, we present an algorithm to map an approximate invariant subspace of the linear system matrix for the previous optimization step to an approximate invariant subspace of the linear system matrix for the current optimization step, for general meshes. This is achieved by exploiting the map from coefficient vectors to finite element functions on the mesh, combined with interpolation or approximation of functions on the finite element mesh. We demonstrate the effectiveness of our approach numerically with several proof of concept studies for a specific meshing technique.

42 ENGINEERING↗
DOE OSTI2023

Manifold projection image segmentation for nano-XANES imaging

As spectral imaging techniques are becoming more prominent in science, advanced image segmentation algorithms are required to identify appropriate domains in these images. We present a version of image segmentation called manifold projection image segmentation (MPIS) that is generally applicable to a broad range of systems without the need for training because MPIS uses unsupervised machine learning with a few physically motivated hyperparameters. We apply MPIS to nanoscale x-ray absorption near edge structure (XANES) imaging, where XANES spectra are collected with nanometer spatial resolution. We show the superiority of manifold projection over linear transformations, such as the commonly used principal component analysis (PCA). Moreover, MPIS maintains accuracy while reducing computation time and sensitivity to noise compared to the standard nano-XANES imaging analysis procedure. Finally, we demonstrate how multimodal information, such as x-ray fluorescence data and spatial location of pixels, can be incorporated into the MPIS framework. We propose that MPIS is adaptable for any spectral imaging technique, including scanning transmission x-ray microscopy, where the length scale of domains is larger than the resolution of the experiment.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Feedforward equilibrium trajectory optimization with GSPulse

One of the common tasks required for designing new plasma scenarios or evaluating capabilities of a tokamak is to design the desired equilibria using a Grad-Shafranov (GS) equilibrium solver. However, most standard equilibrium solvers are time-independent and do not include dynamic effects such as plasma current flux consumption, induced vessel currents, or voltage constraints. Another class of tools, plasma equilibrium evolution simulators, do include time-dependent effects. These are generally structured to solve the forward problem of evolving the plasma equilibrium given feedback-controlled voltages. In this work, we introduce GSPulse, a novel algorithm for equilibrium trajectory optimization, that is more akin to a pulse planner than a pulse simulator. GSPulse includes time-dependent effects and solves the inverse problem: given a user-specified set of target equilibrium shapes, as well as limits on the coil currents and voltages, the optimizer returns trajectories of the voltages, currents, and achievable equilibria. This task is useful for scoping performance of a tokamak and exploring the space of achievable pulses. The computed equilibria satisfy both Grad-Shafranov force balance and axisymmetric circuit dynamics. The optimization is performed by restructuring the free-boundary equilibrium evolution equations into a form where it is computationally efficient to optimize the entire dynamic sequence. GSPulse can solve for hundreds of equilibria simultaneously within a few minutes. GSPulse has been validated against NSTX-U and MAST-U experiments and against SPARC feedback control simulations, and is being used to perform scenario design for SPARC. The computed trajectories can be used as feedforward inputs that are connected to the feedback controller to inform and improve feedback performance. The code for GSPulse is available open-source at github.com/jwai-cfs/GSPulse_public.

equilibrium↗
DOE OSTI2023

Mapping out the thermodynamic stability of a QCD equation of state with a critical point using active learning

The Beam Energy Scan Theory (BEST) collaboration's equation of state (EoS) incorporates a three-dimensional Ising model critical point into the quantum chromodynamics (QCD) equation of state from lattice simulations. Furthermore, it contains four free parameters related to the size and location of the critical region in the QCD phase diagram. Certain combinations of the free parameters lead to acausal or unstable realizations of the EoS that should not be considered. In this work, we use an active learning framework to rule out pathological EoS efficiently. We find that checking stability and causality for a small portion of the parameters' range is sufficient to construct algorithms that perform with > 96 % accuracy across the entire parameter space. Though in this work we focus on a specific case, our approach can be generalized to any EoS containing a parameter space-class correspondence.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2023

Intra-hour Solar Irradiance Forecast in Multiple Locations using Deep Transfer Learning

In recent years, solar power system installation imposes several challenges on the operations of local and regional power grids due to the inherent variability of ground-level solar irradiance. This work proposes a novel real-time solar forecast methodology for intra-hour solar irradiance based on deep transfer learning from ground-based sky imager for time horizons ranging from 5-15 min. There are three unique aspects of the proposed methodology: (1) a Deep Learning based algorithm development which is modeled as a classification approach rather than a traditional regression approach; (2) the use of the Transfer Learning technique to show generalization capability, robustness, and portability of baseline model in the newly deployed location where availability of enough data for training is typically scarce, and (3) redefinition of point-based irradiation forecast error estimation technique with a window-based one that is more intuitive and user-friendly. The system is developed using multiple years of irradiance and sky image recording in New Jersey and one-year data from Colorado, USA. The method is validated against ground telemetry from these two locations of diverse geographic and climatic conditions. Results show that the forecasting method proposed in this work is robust and highly accurate (8% MAPE error) for multiple locations deployment.

Deep Learning, Convolution Neural Networks, transf↗
DOE OSTI2020

Reverse and Forward Engineering of Local Voltage Control in Distribution Networks

The increasing penetration of renewable and distributed energy resources in distribution networks calls for real-time and distributed voltage control. As such, in this paper we investigate local Volt/VAR control with a general class of control functions, and show that the power system dynamics with non-incremental local voltage control can be seen as a distributed algorithm for solving a well-defined optimization problem (reverse engineering). The reverse engineering further reveals a fundamental limitation of the non-incremental voltage control: the convergence condition is restrictive and prevents better voltage regulation at equilibrium. This motivates us to design two incremental local voltage control schemes based on the subgradient and pseudo-gradient algorithms respectively for solving the same optimization problem (forward engineering). The new control schemes decouple the dynamical property from the equilibrium property, and have much less restrictive convergence conditions. This work presents another step towards developing a new foundation—network dynamics as optimization algorithms—for distributed real-time control and optimization of future power networks.

42 ENGINEERING↗
DOE OSTI2020

pnnl/QASMBench

A low-level OpenQASM benchmark suite for NISQ evaluation and simulation. Please see our paper for details. n this repository you will find a low-level and light-weighted benchmark suite based on IBM OpenQASM language (see spec). It collects commonly seen quantum algorithms and routines from various domains including chemistry, simulation, linear algebra, searching, optimization, arithmetic, machine learning, fault tolerance, cryptography, etc. QASMBench trades-off between generality and usability, covering the number of qubits ranging from 2 to 60K, and the circuit depth from 4 to 12M

Li, Ang↗
DOE OSTI2023

HIGH-LOW FIDELITY THERMAL HYDRAULIC COUPLING USING AI/MACHINE LEARNING ALGORITHMS

The primary goal of the US Department of Energy (DOE) office of Nuclear Energy Integrated Energy Systems (IES) program is to develop the tools and framework for coupling multi-scale and multi-physical thermal and electrical energy usage and storage systems. High- and low-fidelity (high–low) coupling is a key feature of multi-scale, multi-component systems and has been an important focus of research in the nuclear energy community for the past two decades. An essential feature of demonstrating the capability to couple high-fidelity and low-fidelity systems for real-time applications are surrogate/reduced order models (ROM). For the purposes of this study, surrogate models are essentially Blackbox models, typically developed using supervised Machine learning (ML) algorithms. The surrogate models can be used to mimic the response of high-fidelity models to represent large historical datasets and coupled with more general low-fidelity system models distributed as Functional Mock-up Interface (FMI) or Functional Mock-up Units (FMU) modules. The example is demonstrated with Spallation Neutron Source (SNS) First Target Station flow loop data. The flow loop is a liquid mercury loop with a pump, piping, heat exchange, and internal heat generation in the target window. This work elucidates some of the potential benefits and future needs of developing tools for high–low system coupling of energy systems.

Williams, Wesley↗
DOE OSTI2021

Data-Driven Learning for the Mori--Zwanzig Formalism: A Generalization of the Koopman Learning Framework

A theoretical framework which unifies the conventional Mori--Zwanzig formalism and the approximate Koopman learning of deterministic dynamical systems from noiseless observation is presented. In this framework, the Mori--Zwanzig formalism, developed in statistical mechanics to tackle the hard problem of construction of reduced-order dynamics for high-dimensional dynamical systems, can be considered as a natural generalization of the Koopman description of the dynamical system. We next show that, similar to the approximate Koopman learning methods, data-driven methods can be developed for the Mori--Zwanzig formalism with Mori's linear projection operator. We have developed two algorithms to extract the key operators, the Markov and the memory kernel, using time series of a reduced set of observables in a dynamical system. We have adopted the Lorenz `96 system as a test problem and solved for the above operators. These operators exhibit complex behaviors, which are unlikely to be captured by traditional modeling approaches in Mori--Zwanzig analysis. The nontrivial generalized fluctuation-dissipation relationship, which relates the memory kernel with the two-time correlation statistics of the orthogonal dynamics, was numerically verified as a validation of the solved operators. Here we present numerical evidence that the generalized Langevin equation, a key construct in the Mori--Zwanzig formalism, is more advantageous in predicting the evolution of the reduced set of observables than the conventional approximate Koopman operators.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Why is the winner the best?

International benchmarking competitions have become fundamental for the comparative performance assessment of image analysis methods. However, little attention has been given to investigating what can be learnt from these competitions. Do they really generate scientific progress? What are common and successful participation strategies? What makes a solution superior to a competing method? To address this gap in the literature, we performed a multi- center study with all 80 competitions that were conducted in the scope of IEEE ISBI 2021 and MICCAI 2021. Statistical analyses performed based on comprehensive descriptions of the submitted algorithms linked to their rank as well as the underlying participation strategies revealed common characteristics of winning solutions. These typically include the use of multi-task learning (63%) and/or multi-stage pipelines (61%), and a focus on augmentation (100%), im- age preprocessing (97%), data curation (79%), and post- processing (66%). The “typical” lead of a winning team is a computer scientist with a doctoral degree, five years of experience in biomedical image analysis, and four years of experience in deep learning. Two core general development strategies stood out for highly-ranked teams: the reflection of the metrics in the method design and the focus on analyzing and handling failure cases. According to the organizers, 43% of the winning algorithms exceeded the state of the art but only 11% completely solved the respective domain problem. The insights of our study could help researchers (1) improve algorithm development strategies when approaching new problems, and (2) focus on open research questions revealed by this work.

Eisenmann, Matthias↗
DOE OSTI2023

Vertical Structure and Ice Production Processes of Shallow Convective Postfrontal Clouds over the Southern Ocean in MARCUS. Part I: Observational Study

A study of the vertical structure of postfrontal shallow clouds in the marine boundary layer over the Southern Ocean is presented here. The central question of this two-part study regards cloud phase (liquid/ice) of precipitation, and the associated growth mechanisms. In this first part, data from the Measurements of Aerosols, Radiation, and Clouds over the Southern Ocean (MARCUS) field campaign are analyzed, starting with a 75-h case with continuous sea surface-based thermal instability, modest surface heat fluxes, an open-cellular mesoscale organization, and very few ice nucleating particles (INPs). The clouds are mostly precipitating and shallow (tops mostly around 2 km above sea level), with weak up- and downdrafts, and with cloud-top temperatures generally around –18° to –10°C. Further, the case study is extended to three other periods of postfrontal shallow clouds in MARCUS. While abundant supercooled liquid water is commonly present, an experimental cloud-phase algorithm classifies nearly two-thirds of clouds in the 0° to –5°C layer as containing ice (cloud ice, snow, or mixed phase), implying that much of the precipitation grows through cold-cloud processes. The best predictors of ice presence are cloud-top temperature, cloud depth, and INP concentration. Measures of convective activity and turbulence are found to be poor indicators of ice presence in the studied environment. The water-phase distribution in this cloud regime is explored through numerical simulations in Part II. Significance Statement: Climate models generally predict a lower albedo than observed over the Southern Ocean, and this is largely attributed to a lack of cloudiness, especially in the postfrontal cold sector of midlatitude cyclones. This in turn may be due to an excess of ice in these simulated clouds, resulting in rapid precipitation fallout and an overly brief cloud lifespan. The objective of this study is to examine whether shallow postfrontal clouds over the Southern Ocean are dominated by supercooled drops, or by snow and ice, using data collected by a U.S. Department of Energy Atmospheric Radiation Measurement Mobile Facility deployed aboard an Australian Antarctic supply vessel. We find that these clouds contain much supercooled liquid, even though cloud-top temperatures generally are around –18° to –8°C, and that about two-thirds of the clouds just above the freezing level contain ice. Much of the precipitation appears to grow through cold-cloud processes above the freezing level, rather than drizzle/rain. Updrafts and/or turbulence in convection or in cloud-top generating cells do not initiate much ice, compared to observations elsewhere in a similar temperature range. This may be attributable to the extremely low concentration of ice nucleating particles in this environment. Ultimately, the deepest clouds with the coldest cloud tops are most likely to be ice dominated.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2021

AI-based design of a nuclear reactor core

The authors developed an artificial intelligence (AI)-based algorithm for the design and optimization of a nuclear reactor core based on a flexible geometry and demonstrated a 3× improvement in the selected performance metric: temperature peaking factor. The rapid development of advanced, and specifically, additive manufacturing (3-D printing) and its introduction into advanced nuclear core design through the Transformational Challenge Reactor program have presented the opportunity to explore the arbitrary geometry design of nuclear-heated structures. The primary challenge is that the arbitrary geometry design space is vast and requires the computational evaluation of many candidate designs, and the multiphysics simulation of nuclear systems is very time-intensive. Therefore, the authors developed a machine learning-based multiphysics emulator and evaluated thousands of candidate geometries on Summit, Oak Ridge National Laboratory’s leadership class supercomputer. The results presented in this work demonstrate temperature distribution smoothing in a nuclear reactor core through the manipulation of the geometry, which is traditionally achieved in light water reactors through variable assembly loading in the axial direction and fuel shuffling during refueling in the radial direction. The conclusions discuss the future implications for nuclear systems design with arbitrary geometry and the potential for AI-based autonomous design algorithms.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2022

Hybrid quantum-classical algorithms for approximate graph coloring

We show how to apply the recursive quantum approximate optimization algorithm (RQAOA) to MAX- k -CUT, the problem of finding an approximate k -vertex coloring of a graph. We compare this proposal to the best known classical and hybrid classical-quantum algorithms. First, we show that the standard (non-recursive) QAOA fails to solve this optimization problem for most regular bipartite graphs at any constant level p : the approximation ratio achieved by QAOA is hardly better than assigning colors to vertices at random. Second, we construct an efficient classical simulation algorithm which simulates level- 1 QAOA and level- 1 RQAOA for arbitrary graphs. In particular, these hybrid algorithms give rise to efficient classical algorithms, and no benefit arising from the use of quantum mechanics is to be expected. Nevertheless, they provide a suitable testbed for assessing the potential benefit of hybrid algorithm: We use the simulation algorithm to perform large-scale simulation of level- 1 QAOA and RQAOA with up to 300 qutrits applied to ensembles of randomly generated 3 -colorable constant-degree graphs. We find that level- 1 RQAOA is surprisingly competitive: for the ensembles considered, its approximation ratios are often higher than those achieved by the best known generic classical algorithm based on rounding an SDP relaxation. This suggests the intriguing possibility that higher-level RQAOA may be a potentially useful algorithm for NISQ devices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

RSVP - Flu Like Illness and Respiratory Syndromes COVID-19 Syndromic Reporting Tool Prototype

Individuals infected with SARS-CoV-2, the virus that causes COVID-19, may be infectious between 1-3 days prior to symptom onset. People may delay seeking medical care after symptom development due to multiple determinants of health seeking behavior like availability of testing, accessibility of providers, and ability to pay. Therefore, understanding symptoms in the general public is important to better predict and inform resource management plans and engage in reopening. As the influenza season looms, the ability to differentiate between clinical presentation of COVID-19 and seasonal influenza will also be important to health providers and public health response efforts. This project has developed an algorithm that when used with captured syndromic trends can help provide both differentiation to various influenza-like illnesses (ILI) as well as provide public health decision makers a better understanding regarding spatial and temporal trends. This effort has also developed a web-based tool to allow for the capturing of generalized syndromic trends and provide both spatial and temporal outputs on these trends. This page left blank

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2020

The Future of Computing: Integrating Scientific Computation on Neuromorphic Systems

Neuromorphic computing is known for its integration of algorithms and hardware elements that are inspired by the brain. Conventionally, this nontraditional method of computing is used for many neural or learning inspired applications. Unfortunately, this has resulted in the field of neuromorphic computing being relatively narrow in scope. In this paper we discuss two research areas actively trying to widen the impact of neuromorphic systems. The first is Fugu, a high-level programming interface designed to bridge the gap between general computer scientists and those who specialize in neuromorphic areas. The second aims to map classical scientific computing problems onto these frameworks through the example of random walks. This elucidates a class of scientific applications that are conducive to neuromorphic algorithms.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Efficient Parallel Sparse Symmetric Tucker Decomposition for High-Order Tensors

Tensor based methods are receiving renewed attention in recent years due to their prevalence in diverse real-world applications. There is considerable literature on tensor representations and algorithms for tensor decompositions, both for dense and sparse tensors. Many applications in hypergraph analytics, machine learning, psychometry, and signal processing result in tensors that are both sparse and symmetric, making it an important class for further study. Similar to the critical Tensor Times Matrix chain operation (TTMc) in general sparse tensors, the Sparse Symmetric Tensor Times Same Matrix chain (S3TTMc) operation is compute and memory intensive due to high tensor order and the associated factorial explosion in the number of non-zeros. In this work, we present a novel compressed storage format CSS for sparse symmetric tensors, along with an efficient parallel algorithm for the S3TTMc operation. We theoretically establish that S3TTMc on CSS achieves a better memory versus run-time trade-off compared to state-of-the-art implementations. We demonstrate experimental findings that confirm these results and achieve up to 2.9× speedup on synthetic and real datasets.

Shivakumar, Shruti↗