Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Guaranteed performance”

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

Final report- UFL - RAPIDS2: A SciDAC Institute for Computer Science, Data, and Artificial Intelligence

The research initiatives supported by the U.S. Department of Energy (DOE) Grant DE-SC0022265 are fundamentally aimed at pioneering advanced machine learning (ML) techniques for scientific data compression within high-performance computing (HPC) environments. This comprehensive body of work addresses the critical challenge posed by the exponential growth of data generated by scientific simulations in domains such as fusion energy, climate modeling, and computational fluid dynamics (CFD). A core objective is to develop compression algorithms that achieve substantial data reduction—often by orders of magnitude—while rigorously ensuring the fidelity of both the primary data (PD) and scientifically crucial derived quantities of interest (QoI). The methodologies deployed under this grant integrate sophisticated deep learning architectures, prominently featuring autoencoders, advanced generative models like conditional diffusion, and hybrid learning techniques. Key innovations include the development of Guaranteed Autoencoders (GAE) and the Guaranteed Conditional Diffusion with Tensor Correction (GCDTC) framework, which provide explicit, instance-level error bounds on reconstructed data. Furthermore, specialized strategies such as nonlinear constraint satisfaction are employed to preserve the integrity of QoI, a vital requirement for the trustworthiness of downstream scientific analyses. This research also focuses on the design and implementation of scalable, GPU-accelerated software pipelines that seamlessly integrate into existing HPC workflows, ensuring both computational efficiency and practical applicability. The CAESAR framework, for example, unifies foundation and generative models to create an adaptive and efficient compression solution for spatio-temporal scientific data. Collectively, these efforts represent a significant advancement in mitigating the scientific data deluge, enabling more effective data management, accelerated scientific discovery, and optimized utilization of HPC resources.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Infrared-safe energy weighting does not guarantee small nonperturbative effects

Infrared and collinear (IRC) safety has long been used a proxy for robustness when developing new jet substructure observables. This guiding philosophy has been carried into the deep learning era, where IRC-safe neural networks have been used for many jet studies. For graph-based neural networks, the most straightforward way to achieve IRC safety is to weight particle inputs by their energies. However, energy-weighting by itself does not guarantee that perturbative calculations of machine-learned observables will enjoy small nonperturbative corrections. Here, in this paper, we demonstrate the sensitivity of IRC-safe networks to nonperturbative effects, by training an energy flow network (EFN) to maximize its sensitivity to hadronization. We then show how to construct Lipschitz energy flow networks (L-EFNs), which are both IRC safe and relatively insensitive to nonperturbative corrections. We demonstrate the performance of L-EFNs on generated samples of quark and gluon jets, and showcase fascinating differences between the learned latent representations of EFNs and L-EFNs.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

Aero-Thermal Characterization of Accelerating and Diffusing Passages Downstream of Rotating Detonation Combustors

Cycle benefits of rotating detonation engines show up to five percentage points of efficiency gain for low-pressure ratio engines. An optimal integration between the combustor and the turbine needs to be guaranteed to realize this potential gain. The rotating detonation combustor (RDC) exhausts transonic flow with shocks rotating at frequencies ranging from a few to tens of kilohertz depending on the number of present waves. Hence, the turbine design requires precise knowledge of the fluctuations and losses downstream of the combustor. This paper focuses on the quantification of fluctuations and losses for accelerating and diffusing passages. The analysis of the combustor is performed via reactive unsteady Reynolds Averaged Navier-Stokes (URANS) simulations. The unsteady RANS equations are solved via CFD++ from Metacomp with a one-step reaction mechanism for an H2-air mixture. The resolving of the boundary layer is achieved with a structured mesh of around 36 million cells. Inlet pressure of 10 bar and two different back pressures are applied to the combustor to model the interconnection with downstream turbines. Finally, we present and assess a methodology to reduce the computational time to model these passages ten times.

Braun, James↗
DOE OSTI2024

Nonparametric Multiparticle Set Methods for Interpreting Environmental Samples

Collection and analysis of environmental samples is commonly used by a range of stakeholders in nuclear safeguards and security contexts. While the ubiquity of samples and their transport in the environment allow regular collection, developing and demonstrating methods for analyzing these samples is difficult. In this work, an environmental sample consists of a set of one or more individual particles. Recent advances in reactor simulation have allowed us to generate data that are more representative of real-world environmental samples, enabling statistically defensible method development and testing. The most notable of these advances is a drastic increase in the number of material depletion regions, which allows our simulations to capture the variation in isotopic composition seen at length scales consistent with environmental samples. Traditional approaches for handling multiparticle samples treat each particle in the sample individually, estimating the quantity of interest (e.g., core-average burnup) resulting from measurement and analysis of signatures (e.g., nuclide assays) from each individual particle. Individual estimates are then averaged to generate a single estimate of the quantity of interest over the entire sample. In this presentation, we introduce two novel approaches for interpreting environmental samples that comprise of multiple particles: (1) the Quantile-Quantile Comparator, which uses a multivariate generalization of quantile-quantile plots for comparing unknown statistical distributions, and (2) the Set Transformer, an attention-based neural network module designed to model interactions among elements (particles) in the input set (sample). Statistically representative sampling cannot be guaranteed as samples are passively collected and are beholden to what particles are available in the environment. These new analysis methods for set-input problems are expected to be more robust than traditional approaches to issues of sampling bias where particles are not uniformly distributed throughout regions of interest, as well as generally outperform traditional approaches by jointly considering all elements in the set. We will present results comparing the performance of traditional single particle approaches and the novel Quantile-Quantile Comparator and Set Transformer for interpretation of simulated environmental samples.

Phathanapirom, Birdy↗
DOE OSTI2021

Guaranteed Phase & Topology Identification in Three Phase Distribution Grids

We present a method for joint phase identification and topology recovery in unbalanced three phase radial networks using only voltage measurements. By recovering phases and topology jointly, we utilize all three phase voltage measurements and can handle networks where some buses have a subset of three phases. Our method is theoretically justified by a novel linearized formulation of unbalanced three phase power flow and makes precisely defined and reasonable assumptions on line impedances and load statistics. We validate our method on three IEEE test networks simulated under realistic conditions in OpenDSS, comparing our performance to the state of the art. In addition to providing a new method for phase and topology recovery, our intuitively structured linearized model will provide a foundation for future work in this and other applications.

42 ENGINEERING↗
DOE OSTI2023

Machine Learning-Based Model Predictive Control of Two-Time-Scale Systems

In this study, we present a general form of nonlinear two-time-scale systems, where singular perturbation analysis is used to separate the dynamics of the slow and fast subsystems. Machine learning techniques are utilized to approximate the dynamics of both subsystems. Specifically, a recurrent neural network (RNN) and a feedforward neural network (FNN) are used to predict the slow and fast state vectors, respectively. Moreover, we investigate the generalization error bounds for these machine learning models approximating the dynamics of two-time-scale systems. Next, under the assumption that the fast states are asymptotically stable, our focus shifts toward designing a Lyapunov-based model predictive control (LMPC) scheme that exclusively employs the RNN to predict the dynamics of the slow states. Additionally, we derive sufficient conditions to guarantee the closed-loop stability of the system under the sample-and-hold implementation of the controller. A nonlinear chemical process example is used to demonstrate the theory. In particular, two RNN models are constructed: one to model the full two-time-scale system and the other to predict solely the slow state vector. Both models are integrated within the LMPC scheme, and we compare their closed-loop performance while assessing the computational time required to execute the LMPC optimization problem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Learning-Based Demand Response in Grid Interactive Buildings via Gaussian Processes

This paper presents a predictive controller for a grid-interactive multi-zone building where the temperature dynamics are learned via Gaussian Process (GP) regression. We investigate the development of a learning-based predictive control with two main objectives: (i) continuously learn the temperature dynamics of the building based on data; and, (ii) use the learned dynamics to solve a multi-objective predictive control problem to guarantee occupants' comfort and energy efficiency during normal conditions and demand response events. We leverage the probabilistic non-parametric properties of GPs to estimate the (unknown) non-linear temperature dynamics of the building and to incorporate the uncertainty of those predictions in a multi-objective optimization problem. The GP-based predictive control is solved via a zero-order primal-dual projected-gradient algorithm. We evaluate numerically the performance of the proposed controller using a five-zone commercial building.

demand response↗
DOE OSTI2021

DEVELOPMENT OF A LUMPED-PARAMETER THERMAL MODEL FOR ELECTRO-HYDRAULIC ACTUATORS

This paper describes a thermal-hydraulic modeling method of a closed-circuit electro-hydraulic actuator (EHA). Despite the high energy efficiency of EHAs, it is always important to assess their cooling requirements, to guarantee that the operating temperature remains within an acceptable range. The method proposed in this paper is based on a lumped parameter approach and simplifies some of the complex heat transfer processes by introducing empirical correction factors. The model is validated by means of temperature measurements on an EHA architecture developed by the author. The good match between the simulation results and experiments confirms the capability of the proposed methodology to predict the temperature performance of the reference EHA under different drive cycles. The paper presents a detailed analysis of the power losses and passive heat dissipation for the reference system. Based on this analysis, the cooling requirements of the EHA are studied.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2020

Learning to Solve Large-Scale Security-Constrained Unit Commitment Problems

Security-constrained unit commitment (SCUC) is a fundamental problem in power systems and electricity markets. In practical settings, SCUC is repeatedly solved via mixed-integer linear programming (MIP), sometimes multiple times per day, with only minor changes in input data. In this work, we propose a number of machine learning techniques to effectively extract information from previously solved instances in order to significantly improve the computational performance of MIP solvers when solving similar instances in the future. Based on statistical data, we predict redundant constraints in the formulation, good initial feasible solutions, and affine subspaces where the optimal solution is likely to lie, leading to a significant reduction in problem size. Computational results on a diverse set of realistic and large-scale instances show that using the proposed techniques, SCUC can be solved on average 4.3 times faster with optimality guarantees and 10.2 times faster without optimality guarantees, with no observed reduction in solution quality. Out-of-distribution experiments provide evidence that the method is somewhat robust against data-set shift. Summary of Contribution. The paper describes a novel computational method, based on a combination of mixed-integer linear programming (MILP) and machine learning (ML), to solve a challenging and fundamental optimization problem in the energy sector. The method advances the state-of-the-art, not only for this particular problem, but also, more generally, in solving discrete optimization problems via ML. We expect that the techniques presented can be readily used by practitioners in the energy sector and adapted, by researchers in other fields, to other challenging operations research problems that are solved routinely.

Machine Learning↗
DOE OSTI2023

Quantum Interior Point Methods for Semidefinite Optimization

We present two quantum interior point methods for semidefinite optimization problems, building on recent advances in quantum linear system algorithms. The first scheme, more similar to a classical solution algorithm, computes an inexact search direction and is not guaranteed to explore only feasible points; the second scheme uses a nullspace representation of the Newton linear system to ensure feasibility even with inexact search directions. The second is a novel scheme that might seem impractical in the classical world, but it is well-suited for a hybrid quantum-classical setting. We show that both schemes converge to an optimal solution of the semidefinite optimization problem under standard assumptions. By comparing the theoretical performance of classical and quantum interior point methods with respect to various input parameters, we show that our second scheme obtains a speedup over classical algorithms in terms of the dimension of the problem n , but has worse dependence on other numerical parameters.

Augustino, Brandon↗
DOE OSTI2026

Resilience Through Data-Driven, Intelligent Designed Control: A Formal Methods Approach

The PNNL and GTRI team developed a strategy to integrate temporal logic rule specification for detection of cyber-intrusion in the source code and control algorithms of CPS using advanced cyber-data. The GTRI team utilized its capabilities in rule synthesis and temporal logic specifications for software assurance and verification to detect and predict impact of cyber-intrusions and malware in the computational and control algorithms of cyber-physical systems. The team also developed a testing and verification approach that could be used to validate the suggested approach against a realistic use-case CPS showcasing improvements in system impact prediction performance. Temporal logic offers a compact expression of events in absolute and relative time and has a formalized translation to state machines. As such, temporal logic rules can feasibly be synthesized to any system as a rule engine, with the process being formally verified to be correct. The goal here is to utilize temporal logic rules to detect cyber-attacks and manipulations in the computational algorithms and provide real-time software assurance and verification guarantees.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

A comparison of efficiency-aware model-predictive control approaches for wave energy devices

In this study, we compare four different formulations of model predictive control that attempt to maximise electrical power generated by a wave energy converter (WEC). Control laws include (1) pure maximisation of mechanical power, (2) maximisation of mechanical power with a control penalty factor, (3) maximisation of electrical power using power conversion efficiency, and (4) maximisation of electrical power using the full electro-mechanical model of a system. For this study, a wave-to-wire model is developed for a floating spherical buoy connected to a permanent magnet synchronous generator. The performance of the controllers, including the mechanical and electrical power outputs, is compared in irregular wave conditions for the unconstrained and force-constrained scenarios. The results demonstrate that the controller designed to maximise mechanical power is not suitable for practical applications and may lead to negative electrical power output due to the non-ideal power take-off efficiency. Moreover, the replacement of the power take-off dynamics by the efficiency coefficient does not guarantee the maximum electrical power production.

16 TIDAL AND WAVE POWER↗
DOE OSTI2026

A fresh perspective on the role of band bending, and related contributors, in light-driven production of electricity and chemicals

It is widely known that semiconductor-based solar energy conversion could power our planet. This is in part because high-quality semiconductor structures are unrivalled in their ability to separate photogenerated electrons and holes. One effective approach to achieving this photoinduced charge separation relies on a phenomenon known as “band bending”. But details to justify why band bending results in photoinduced charge separation are more complex than often appreciated. This underappreciation is an impediment to the rational, hypothesis-driven design of next-generation approaches to solar energy conversion. Herein we show, by means of derivations rooted in physical chemistry, that several phenomena – not just band bending – can facilitate photoinduced charge separation, and that each is influenced by nonequilibrium species concentration and a parameter, such as diffusion coefficient or rate coefficient, that introduces dynamics. To help visualize the impact of each phenomenon, we introduce plots that depict their contributions as free energy, force, flux, force constant, and rate. We reveal that spatial dopant distributions that define band bending are predictors of initial photogenerated species transport rates. But charge separation alone does not guarantee high-efficiency operation. A photogenerated change in energy that is freely available to do useful work is also essential, and is strongly dependent on semiconductor optical properties and reaction kinetics. Notably, this information reveals that specificity of interfacial chemical reactions – even when they are not preceded by charge separation elsewhere – can result in efficient solar energy conversion. We expect that this tutorial will guide researchers in their pursuit to uncover new mechanisms for light to perform useful work.

14 SOLAR ENERGY↗
DOE OSTI2021

SGD-Net: Efficient Model-Based Deep Learning with Theoretical Guarantees

Deep unfolding networks have recently gained popularity for solving imaging inverse problems. However, the computational and memory complexity of data-consistency layers within traditional deep unfolding networks scales with the number of measurements, limiting their applicability to large-scale imaging inverse problems. We propose SGD-Net as a new methodology for improving the efficiency of deep unfolding through stochastic approximations of the data-consistency layers. Our theoretical analysis shows that SGD-Net can be trained to approximate batch deep unfolding networks to an arbitrary precision. Our simulations on intensity diffraction tomography and sparse-view computed tomography show that SGD-Net can match the performance of the traditional batch network at a fraction of training and testing complexity.Deep unfolding networks have recently gained popularity for solving imaging inverse problems. However, the computational and memory complexity of data-consistency layers within traditional deep unfolding networks scales with the number of measurements, limiting their applicability to large-scale imaging inverse problems. We propose SGD-Net as a new methodology for improving the efficiency of deep unfolding through stochastic approximations of the data-consistency layers. Our theoretical analysis shows that SGD-Net can be trained to approximate batch deep unfolding networks to an arbitrary precision. Our simulations on intensity diffraction tomography and sparse-view computed tomography show that SGD-Net can match the performance of the traditional batch network at a fraction of training and testing complexity.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

New heavenly double copies

The double copy relates scattering amplitudes and classical solutions in Yang-Mills theory, gravity, and related field theories. Previous work has shown that this has an explicit realisation in self-dual YM theory, where the equation of motion can be written in a form that maps directly to Plebański’s heavenly equation for self-dual gravity. The self-dual YM equation involves an area-preserving diffeomorphism algebra, two copies of which appear in the heavenly equation. In this paper, we show that this construction is a special case of a wider family of heavenly-type examples, by (i) performing Moyal deformations, and (ii) replacing the area-preserving diffeomorphisms with a less restricted algebra. As a result, we obtain a double-copy interpretation for hyper-Hermitian manifolds, extending the previously known hyper-Kähler case. We also introduce a double-Moyal deformation of the heavenly equation. The examples where the construction of Lax pairs is possible are manifestly consistent with Ward’s conjecture, and suggest that the classical integrability of the gravity-type theory may be guaranteed in general by the integrability of at least one of two gauge-theory-type single copies.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

FedEFsz: Fair Cross-Silo Federated Learning System With Error-Bounded Lossy Compression

Cross-Silo federated learning systems have been identified as an efficient approach to scaling DNN training across geographically-distributed data silos to preserve the privacy of the training data. Communication efficiency and fairness are two major issues that need to be both satisfied when federated learning systems are deployed in practice. Simultaneously guaranteeing both of them, however, is exceptionally difficult because simply combining communication reduction and fairness optimization approaches often causes non-converged training or drastic accuracy degradation. Here, to bridge this gap, we propose FedEFsz. On the one hand, it integrates the state-of-the-art error-bounded lossy compressor SZ3 into cross-silo federated learning systems to significantly reduce communication traffic during the training. On the other hand, it achieves a high fairness (i.e., rather consistent model accuracy and performance across different clients) through a carefully designed heuristic algorithm that can tune the error-bound of SZ3 for different clients during the training. Extensive experimental results based on a GPU cluster with 65 GPU cards show that FedEFsz improves the fairness across different benchmarks by up to 60.88% and meanwhile reduces the communication traffic by up to 315×.

Cross-Silo Federated Learning Systems↗
DOE OSTI2022

Multisource Mobile Transfer Learning Algorithm Based on Dynamic Model Compression

With the development of the Internet of Things, the application of computer vision on mobile phones is becoming more and more extensive and people have higher and higher requirements for the timeliness of the recognition results returned and the processing capabilities of the mobile phone for image recognition. However, the processing capability and storage capability of the user terminal equipment cannot meet the needs of identifying and storing a large number of pictures, and the data transmission process will cause high energy consumption of the terminal equipment. At the same time, multisource deep transfer learning has outstanding performance in computer vision and image classification. However, due to the huge amount of calculation of the deep network model, it is impossible to use the existing excellent network model to realize image recognition and classification on the mobile terminal. In order to solve the abovementioned problems, we propose a multisource mobile transfer learning algorithm based on dynamic model compression, this algorithm considers the realization of multisource transfer learning computing in the case of multiple mobile device computing source domains, and the method also guarantees data privacy and security for each device (origin domain). Meanwhile, extensive experiments show that our method can achieve remarkable results in popular image classification datasets.

Gao, Peng↗