Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “variational 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 649 records · Page 36
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Characterizing climate pathways using feature importance on echo state networks

The 2022 National Defense Strategy of the United States listed climate change as a serious threat to national security. Climate intervention methods, such as stratospheric aerosol injection, have been proposed as mitigation strategies, but the downstream effects of such actions on a complex climate system are not well understood. The development of algorithmic techniques for quantifying relationships between source and impact variables related to a climate event (i.e., a climate pathway) would help inform policy decisions. Data-driven deep learning models have become powerful tools for modeling highly nonlinear relationships and may provide a route to characterize climate variable relationships. In this paper, we explore the use of an echo state network (ESN) for characterizing climate pathways. ESNs are a computationally efficient neural network variation designed for temporal data, and recent work proposes ESNs as a useful tool for forecasting spatiotemporal climate data. However, ESNs are noninterpretable black-box models along with other neural networks. The lack of model transparency poses a hurdle for understanding variable relationships. We address this issue by developing feature importance methods for ESNs in the context of spatiotemporal data to quantify variable relationships captured by the model. We conduct a simulation study to assess and compare the feature importance techniques, and we demonstrate the approach on reanalysis climate data. In the climate application, we consider a time period that includes the 1991 volcanic eruption of Mount Pinatubo. This event was a significant stratospheric aerosol injection, which acts as a proxy for an anthropogenic stratospheric aerosol injection. Furthermore, we are able to use the proposed approach to characterize relationships between pathway variables associated with this event that agree with relationships previously identified by climate scientists.

black-box models↗
DOE OSTI2021

A propagation-based fault detection and discrimination method and the optimization of sensor deployment

Industrial processes can be affected by faults having a serious impact on operation when not promptly detected and diagnosed. Here in this paper, a propagation-based fault detection and discrimination(PFDD) method is proposed to develop a strategy for fault diagnosis while in the design phase of a system. The PFDD method constructs the system model using the Integrated System Fault Analysis(ISFA) technique. Based on the system model, the propagation of hardware and software faults are simulated qualitatively. Given the results of the simulation, the process by which a fault propagates can be characterized using the qualitative features of system variables including the deviation of the system variables from their expected values, the variation of the system variables over time, and the order in which each variable is influenced during the propagation of the fault. The strategy by which a fault can be detected and discriminated is defined using those features. The PFDD method supports the detection and discrimination of faults in both steady states and transient states. Based on the PFDD method, the optimization of sensor deployment in a system is discussed. A brute force algorithm is developed to examine the system’s capability at diagnosing faults and the cost of sensor deployment for all possible configurations of sensors. The optimal sensor deployment strategy can be derived accordingly. However, the brute force method is only applicable to small-scale systems due to its high computational cost. A genetic algorithm is used to optimize sensor deployment in large-scale systems. The PFDD and sensor deployment optimization methods are applied to the Experimental Breeder Reactor II (EBR-II) for verification.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2025

Advancing quantum simulations of the nuclear shell model with Gray-code–based resource-efficient protocols

Background: Some of the computational limitations in solving the nuclear many-body problem could be overcome by utilizing quantum computers. The nuclear shell-model calculations providing deeper insights into the properties of atomic nuclei are one such case with high demand for resources, as the size of the Hilbert space grows exponentially with the number of particles involved. Quantum algorithms are being developed to overcome these challenges and advance such calculations. Purpose: To develop quantum circuits for the nuclear shell-model, leveraging the capabilities of noisy intermediate-scale quantum (NISQ) devices. Here, we aim to minimize resource requirements (specifically in terms of qubits and gates) and strive to reduce the impact of noise by employing relevant mitigation techniques. Methods: We achieve noise resilience by designing an optimized Ansatz for the variational quantum eigensolver (VQE) based on Givens rotations and incorporating qubit-ADAPT-VQE in combination with variational quantum deflation (VQD) to compute ground and excited states, incorporating the zero-noise extrapolation mitigation technique. Furthermore, the qubit requirements are significantly reduced by mapping the basis states to qubits using Gray-code encoding and generalizing transformations of fermionic operators to efficiently represent many-body states. Results: By employing the resource-efficient protocols, we achieve the ground and excited state energy levels of 38 Ar and 6 Li with better accuracy. These energy levels are presented for noiseless simulations, noisy conditions, and after applying noise mitigation techniques. Results are compared for Jordan-Wigner and Gray-code encoding using VQE, qubit-ADAPT-VQE, and VQD. Conclusions: Our work highlights the potential of resource-efficient protocols to leverage the full potential of NISQ devices in scaling the nuclear shell model calculations, offering a pathway toward more complex quantum simulations in nuclear physics. This approach establishes a framework for studying other nuclear systems with improved quantum resource efficiency, marking a significant advancement in applying quantum computing to realistic nuclear physics applications.

Physics - Nuclear physics and radiation physics↗
DOE OSTI2020

Quantum state reduction: Generalized bipartitions from algebras of observables

Reduced density matrices are a powerful tool in the analysis of entanglement structure, approximate or coarse-grained dynamics, decoherence, and the emergence of classicality. It is straightforward to produce a reduced density matrix with the partial-trace map by tracing out part of the quantum state, but in many natural situations this reduction may not be achievable. We investigate the general problem of identifying how the quantum state is reduced given a restriction on the observables. For example, in an experimental setting, the set of observables that can actually be measured is usually modest (compared to the set of all possible observables) and their resolution is limited. In such situations, the appropriate state-reduction map can be defined via a generalized bipartition, which is associated with the structure of irreducible representations of the algebra generated by the restricted set of observables. One of our main technical results is a general, not inherently numeric, algorithm for finding irreducible representations of matrix algebras. In our work, we demonstrate the viability of this approach with two examples of limited-resolution observables. The definition of quantum state reductions can also be extended beyond algebras of observables. To accomplish this task we introduce a more flexible notion of bipartition, the partial bipartition, which describes coarse grainings preserving information about a limited set (not necessarily algebra) of observables. We describe a variational method to choose the coarse grainings most compatible with a specified Hamiltonian, which exhibit emergent classicality in the reduced state space. We apply this construction to the concrete example of the one-dimensional Ising model. Our results have relevance for quantum information, bulk reconstruction in holography, and quantum gravity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Representation Learning via Quantum Neural Tangent Kernels

Variational quantum circuits are used in quantum machine learning and variational quantum simulation tasks. Designing good variational circuits or predicting how well they perform for given learning or optimization tasks is still unclear. Here we discuss these problems, analyzing variational quantum circuits using the theory of neural tangent kernels. We define quantum neural tangent kernels, and derive dynamical equations for their associated loss function in optimization and learning tasks. We analytically solve the dynamics in the frozen limit, or lazy training regime, where variational angles change slowly and a linear perturbation is good enough. We extend the analysis to a dynamical setting, including quadratic corrections in the variational angles. We then consider a hybrid quantum classical architecture and define a large-width limit for hybrid kernels, showing that a hybrid quantum classical neural network can be approximately Gaussian. The results presented here show limits for which analytical understandings of the training dynamics for variational quantum circuits, used for quantum machine learning and optimization problems, are possible. These analytical results are supported by numerical simulations of quantum machine-learning experiments.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Towards quantum simulations in particle physics and beyond on noisy intermediate-scale quantum devices

We review two algorithmic advances that bring us closer to reliable quantum simulations of model systems in high-energy physics and beyond on noisy intermediate-scale quantum (NISQ) devices. The first method is the dimensional expressivity analysis of quantum circuits, which allows for constructing minimal but maximally expressive quantum circuits. The second method is an efficient mitigation of readout errors on quantum devices. Both methods can lead to significant improvements in quantum simulations, e.g. when variational quantum eigensolvers are used. This article is part of the theme issue ‘Quantum technologies in particle physics’.

Science & Technology - Other Topics↗
DOE OSTI2025

Reweighting simulated events using machine-learning techniques in the CMS experiment

Data analyses in particle physics rely on an accurate simulation of particle collisions and a detailed simulation of detector effects to extract physics knowledge from the recorded data. Event generators together with a GEANT -based simulation of the detectors are used to produce large samples of simulated events for analysis by the LHC experiments. These simulations come at a high computational cost, where the detector simulation and reconstruction algorithms have the largest CPU demands. This article describes how machine-learning (ML) techniques are used to reweight simulated samples obtained with a given set of parameters to samples with different parameters or samples obtained from entirely different simulation programs. The ML reweighting method avoids the need for simulating the detector response multiple times by incorporating the relevant information in a single sample through event weights. Results are presented for reweighting to model variations and higher-order calculations in simulated top quark pair production at the LHC. This ML-based reweighting is an important element of the future computing model of the CMS experiment and will facilitate precision measurements at the High-Luminosity LHC.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2020

Design, Development and Testing Plan for Energy Efficiency Algorithms Related to Building-Integrated Cooling, Heating, and Power Systems

Building-integrated cooling, heating and power (CHP) systems are more efficient than conventional systems at providing local power and thermal energy, and favorable fuel prices are bound to spur their increased adoption. It is estimated that the total CHP technical potential in the commercial building sector is approximately 76 GW, but only a small fraction of it is actually deployed. Advanced control and monitoring systems that realize the full potential of these CHP systems can transform this capacity into an asset for both the owner and the grid and also accelerate the adoption of these systems in the building sector. However, to realize the full benefit of the CHP systems, we must ensure persistence of energy efficient operations. It has been demonstrated by several studies that as much as 30% of building energy use is wasted. Much of the waste results from the inability to anticipate load variations (design day vs. non-design day operations; diurnal variation of loads), identify improper operation, and efficiently operate, control and maintain building systems. Moreover, many buildings, even those with adequate control infrastructure, lack knowledgeable staff to operate and maintain energy systems. Operators of buildings with CHP systems will constantly need to make tradeoffs (economic dispatch) between onsite power generation and purchasing power, between onsite heat production from distributed generation versus heating/cooling from conventional systems, and different passive and active load management measures. Much of the inefficiency in the current building operations can be eliminated by use of automated performance monitoring (PM), real-time commissioning verification (CxV) and automated fault detection and diagnostic (AFDD) tools. Automation can help system operators make intelligent decisions. Remote and continuous monitoring of system conditions and performance will enable better management and integration of CHP with existing building systems. Continuous PM, real-time CxV and AFDD could alleviate burdens for operations staff, enhance operations and maintenance (O&M), and improve reliability of building and CHP systems. To address the O&M challenges and to provide a means to maximize the rate-of-return of building-integrated CHP systems, the Building Technologies Office (BTO) within the U.S. Department of Energy’s (DOE’s) Office of Energy Efficiency and Renewable Energy (EERE) initiated a project to design, develop, and field test a VOLTTRON™-based supervisory controller and associated open-source algorithms. These algorithms will ensure real-time optimal operation of a building-integrated CHP system, support electric grid reliability, and lead to achieving the goal of a clean, efficient, reliable and affordable next-generation integrated energy systems. This report lists the components for which PM, real-time CxV and AFDD algorithms will be developed, how the algorithms will be tested, and metrics that will be used to validate the algorithms and easy of deployment. Deployment of these algorithms in the field will result in savings reduction in energy consumption of between 10% and 20%.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2023

Probabilistic partition of unity networks for high–dimensional regression problems

We explore the probabilistic partition of unity network (PPOU-Net) model in the context of high-dimensional regression problems and propose a general framework focusing on adaptive dimensionality reduction. With the proposed framework, the target function is approximated by a mixture of experts model on a low-dimensional manifold, where each cluster is associated with a fixed-degree polynomial. We present a training strategy that leverages the expectation maximization (EM) algorithm. During the training, we alternate between (i) applying gradient descent to update the DNN coefficients; and (ii) using closed-form formulae derived from the EM algorithm to update the mixture of experts model parameters. Under the probabilistic formulation, step (ii) admits the form of embarrassingly paralleliazable weighted least-squares solves. The PPOU-Nets consistently outperform the baseline fully-connected neural networks of comparable sizes in numerical experiments of various data dimensions. Here, we also explore the proposed model in applications of quantum computing, where the PPOU-Nets act as surrogate models for cost landscapes associated with variational quantum circuits.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Landmark-embedded Gaussian process with applications for functional data modeling

In practice, we often need to infer the value of a target variable from functional observation data. A challenge in this task is that the relationship between the functional data and the target variable is very complex: the target variable not only influences the shape but also the location of the functional data. In addition, due to the uncertainties in the environment, the relationship is probabilistic, that is, for a given fixed target variable value, we still see variations in the shape and location of the functional data. To address this challenge, we present a landmark-embedded Gaussian process model that describes the relationship between the functional data and the target variable. A unique feature of the model is that landmark information is embedded in the Gaussian process model so that both the shape and location information of the functional data are considered simultaneously in a unified manner. Gibbs-Metropolis-Hasting algorithm is used for model parameters estimation and target variable inference. The performance of the proposed framework is evaluated by extensive numerical studies and a case study of nano-sensor calibration.

42 ENGINEERING↗
DOE OSTI2023

Adaptive mitigation of time-varying quantum noise

Current quantum computers suffer from non-stationary noise channels with high error rates, which undermines their reliability and reproducibility. We propose a Bayesian inference based adaptive algorithm that can learn and mitigate quantum noise in response to changing channel conditions. Our study emphasizes the need for dynamic inference of critical channel parameters to improve program accuracy. We use the Dirichlet distribution to model the stochasticity of the Pauli channel. This allows us to perform Bayesian inference, which can improve the performance of probabilistic error cancellation (PEC) under time-varying noise. Our work demonstrates the importance of characterizing and mitigating temporal variations in quantum noise, which is crucial for developing more accurate and reliable quantum technologies. Our results demonstrate that Bayesian PEC can outperform non-adaptive approaches by a factor of 4.5x when measured using Hellinger distance from the ideal distribution.

Dasgupta, Samudra↗
DOE OSTI2020

Deep Reinforcement Learning-Based Edge Caching in Wireless Networks

With the purpose to offload data traffic in wireless networks, content caching techniques have recently been studied intensively. Using these techniques and caching a portion of the popular files at the local content servers, the users can be served with less delay. Most of the content replacement policies are based on the content popularity, that depends on the users' preferences. In practice, such information varies over time. Therefore, an approach to determine the file popularity patterns must be incorporated into caching policies. In this context, we study content caching at the wireless network edge using a deep reinforcement learning framework with Wolpertinger architecture. In particular, we propose deep actor-critic reinforcement learning based policies for both centralized and decentralized content caching. For centralized edge caching, we aim at maximizing the cache hit rate. In decentralized edge caching, we consider both the cache hit rate and transmission delay as performance metrics. These proposed frameworks are assumed to neither have any prior information on the file popularities nor know the potential variations in such information. Via simulation results, the superiority of the proposed frameworks is verified by comparing them with other policies, including least frequently used (LFU), least recently used (LRU), and first-in-first-out (FIFO) policies.

42 ENGINEERING↗
DOE OSTI2023

Ultraviolet digital holographic microscopy (DHM) of micron-scale particles from shocked Sn ejecta

A cloud of very fast, O (km/s), and very fine, O (µm), particles may be ejected when a strong shock impacts and possibly melts the free surface of a solid metal. To quantify these dynamics, this work develops an ultraviolet, long-working distance, two-pulse Digital Holographic Microscopy (DHM) configuration and is the first to replace film recording with digital sensors for this challenging application. A proposed multi-iteration DHM processing algorithm is demonstrated for automated measures of the sizes, velocities, and three-dimensional positions of non-spherical particles. Ejecta as small as 2 µm diameter are successfully tracked, while uncertainty simulations indicate that particle size distributions are accurately quantified for diameters ≥4 µm. These techniques are demonstrated on three explosively driven experiments. Measured ejecta size and velocity statistics are shown to be consistent with prior film-based recording, while also revealing spatial variations in velocities and 3D positions that have yet to be widely investigated. Having eliminated time-consuming analog film processing, the methodologies proposed here are expected to significantly accelerate future experimental investigation of ejecta physics.

47 OTHER INSTRUMENTATION↗
DOE OSTI2024

Quantum Computing for Energy-Related Applications

Growing interest in quantum computing and simulations have created opportunities for its deployment to improve processes pertaining to energy production, distribution, and consumption. While quantum computing is considered as a paradigm shift in our basic understanding of physical computation, effective implementation of quantum computing in energy applications also depends on progress and development in the dimensions of both quantum computing hardware and quantum computing algorithms. To fully address the status and future challenges of quantum information science (QIS) applied within the energy sector, in this presentation, we firstly summarize recent advancements on the applications of quantum computing to energy infrastructure and materials, complex energy system processes, advanced manufacturing, and energy system security. Then, we will demonstrate the results of quantum computing both on a simulator and a quantum device accessing from OLCF. Our first example is to use the variational quantum eigensolver (VQE) with a unitary coupled cluster with singles and doubles (UCCSD) ansatz to simulate a series of LixHyq molecules (q=-1, 0, +1). The obtained results showed that the quantum computing VQE-UCCSD is comparable to classical CCSD for small systems like LiH with respect to full configuration interaction (FCI). Targeting on CO2 capture application, our second example is to use VQE to quantify molecular vibrational energies and reaction pathways between CO2 and a simplified amine-based solvent model—NH3 to form H2NCOOH. This research showcases quantum computing applications in the study of CO2 capture reactions.

Duan, Yuhua↗
DOE OSTI2020

Dynamic Power Network State Estimation with Asynchronous Measurements

The operation of distribution networks is becoming increasingly volatile, due to fast variations of renewables and, hence, net-loading conditions. To perform a reliable state estimation under these conditions, this paper considers the case where measurements from meters, phasor measurement units, and distributed energy resources are collected and processed in real time to produce estimates of the state at a fast time scale. Streams of measurements collected in real time and at heterogenous rates render the underlying processing asynchronous, and poses severe strains on workhorse state estimation algorithms. In this work, a real-time state estimation algorithm is proposed, where data are processed on the fly. Starting from a regularized least-squares model, and leveraging appropriate linear models, the proposed scheme boils down to a linear dynamical system where the state is updated based on the previous estimate and on the measurement gathered from a few available sensors. The estimation error is shown to be always bounded under mild condition. Numerical simulations are provided to corroborate the analytical findings.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

Dynamic Adaptive Relaying for Distribution Grids with High Inverter-Based Generation

The penetration of distributed energy resources (DERs) in distribution systems is rapidly increasing. This can lead to large variations in the operating load and the fault current seen by a relay, which can impact the reliability of overcurrent protection. Adaptive overcurrent relaying (AOCR) can address this concern by enabling the relay to adjust its pickup settings based on the system operating conditions. This paper presents a novel dynamic AOCR approach that allows the relays to locally estimate the pickup settings and dynamically modify them. The approach is based on a two-stage estimation algorithm that uses local measurements and system information to estimate the worst-case fault current and the relay pickup settings. The relay pickup settings are then dynamically modified based on the estimated fault current. The performance of the proposed approach is evaluated on multiple configurations of the EPRI J1 feeder and the IEEE 13-bus system. The results show that the proposed approach can effectively improve the reliability of overcurrent protection in distribution systems with DERs.

adaptive overcurrent protection↗
DOE OSTI2024

Severe Convective Storms in Limited Instability Organized by Pattern and Distribution

Abstract Severe convection occurring in high-shear, low-CAPE (HSLC) environments is a common cool-season threat in the southeastern United States. Previous studies of HSLC convection document the increased operational challenges that these environments present compared to their high-CAPE counterparts, corresponding to higher false-alarm ratios and lower probability of detection for severe watches and warnings. These environments can exhibit rapid destabilization in the hours prior to convection, sometimes associated with the release of potential instability. Here, we use self-organizing maps (SOMs) to objectively identify environmental patterns accompanying HSLC cool-season severe events and associate them with variations in severe weather frequency and distribution. Large-scale patterns exhibit modest variation within the HSLC subclass, featuring strong surface cyclones accompanied by vigorous upper-tropospheric troughs and northward-extending regions of instability, consistent with prior studies. In most patterns, severe weather occurs immediately ahead of a cold front. Other convective ingredients, such as lower-tropospheric vertical wind shear, near-surface equivalent potential temperature (θ e ) advection, and the release of potential instability, varied more significantly across patterns. No single variable used to train SOMs consistently demonstrated differences in the distribution of severe weather occurrence across patterns. Comparison of SOMs based on upper and lower quartiles of severe occurrence demonstrated that the release of potential instability was most consistently associated with higher-impact events in comparison to other convective ingredients. Overall, we find that previously developed HSLC composite parameters reasonably identify high-impact HSLC events. Significance Statement Even when atmospheric instability is not optimal for severe convective storms, in some situations they can still occur, presenting increased challenges to forecasters. These marginal environments may occur at night or during the cool season, when people are less attuned to severe weather threats. Here, we use a sorting algorithm to classify different weather patterns accompanying such storms, and we distinguish which specific patterns and weather system features are most strongly associated with severe storms. Our goals are to increase situational awareness for forecasters and to improve understanding of the processes leading to severe convection in marginal environments.

Meteorology & Atmospheric Sciences↗