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.

SourceResearch connectionFrom yearThrough year

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

At least 181 records · Page 10

All sources NASA NTRS DOE OSTI

DOE OSTI2025

Faster solutions to the interdiction defense problem using suboptimal solutions

The interdiction defense (ID) problem solves a defender-attacker-defender model where the defender and attacker share the same set of components to harden and target. Here, we build upon the best response intersection (BRI) algorithm by developing the BRI with suboptimal solutions (BRI-SS) algorithm to solve the ID problem. The BRI-SS algorithm utilizes off-the-shelf optimization solvers that return suboptimal solutions at no additional computation cost. We derive novel cuts from suboptimal solutions, reducing the number of iterations required for the algorithm to converge while maintaining optimality guarantees. We also present a heuristic that utilizes all obtained suboptimal solutions to select the next defense to evaluate at each iteration. We perform computational experiments applied to power grid interdiction on standard test cases. Our results demonstrate that the BRI-SS algorithm consistently outperforms the BRI algorithm across all test cases.

Computer science↗

DOE OSTI2021

Unbalanced Parallel I/O: An Often-Neglected Side Effect of Lossy Scientific Data Compression

Lossy compression techniques have demonstrated promising results in significantly reducing the scientific data size while guaranteeing the compression error bounds. However, one important yet often neglected side effect of lossy scientific data compression is its impact on the performance of parallel I/O. Our key observation is that the compressed data size is often highly skewed across processes in lossy scientific compression. To understand this behavior, we conduct extensive experiments where we apply three lossy compressors MGARD, ZFP, and SZ, which are specifically designed and optimized for scientific data, to three real-world scientific applications Gray-Scott simulation, WarpX, and XGC. Our analysis result demonstrates that the size of the compressed data is always skewed even if the original data is evenly decomposed among processes. Such skewness widely exists in different scientific applications using different compressors as long as the information density of the data varies across processes. We then systematically study how this side effect of lossy scientific data compression impacts the performance of parallel I/O. We observe that the skewness in the sizes of the compressed data often leads to I/O imbalance, which can significantly reduce the efficiency of I/O bandwidth utilization if not properly handled. In addition, writing data concurrently to a single shared file through MPI-IO library is more sensitive to the unbalanced I/O loads. Therefore, we believe our research community should pay more attention to the unbalanced parallel I/O caused by lossy scientific data compression.

Wang, Xinying↗

DOE OSTI2021

Scalable Plug-and-Play ADMM with Convergence Guarantees

Plug-and-play priors (PnP) is a broadly applicable methodology for solving inverse problems by exploiting statistical priors specified as denoisers. Recent work has reported the state-of-the-art performance of PnP algorithms using pre-trained deep neural nets as denoisers in a number of imaging applications. However, current PnP algorithms are impractical in large-scale settings due to their heavy computational and memory requirements. This work addresses this issue by proposing an incremental variant of the widely used PnP-ADMM algorithm, making it scalable to problems involving a large number measurements. Here, we theoretically analyze the convergence of the algorithm under a set of explicit assumptions, extending recent theoretical results in the area. Additionally, we show the effectiveness of our algorithm with nonsmooth data-fidelity terms and deep neural net priors, its fast convergence compared to existing PnP algorithms, and its scalability in terms of speed and memory.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

An Algorithmic and Software Pipeline for Very Large Scale Scientific Data Compression with Error Guarantees

Efficient data compression is becoming increasingly critical for storing scientific data because many scientific applications produce vast amounts of data. This paper presents an end-to-end algorithmic and software pipeline for data compression that guarantees both error bounds on primary data (PD) and derived data, known as Quantities of Interest (QoI).We demonstrate the effectiveness of the pipeline by compressing fusion data generated by a large-scale fusion code, XGC, which produces tens of petabytes of data in a single day. We demonstrate that the compression is conducted by setting aside computational resources known as staging nodes, and does not impact the simulation performance. For efficient parallel I/O, the pipeline uses ADIOS2, which many codes such as XGC already use for their parallel I/O. We show that our approach can compress the data by two orders of magnitude while guaranteeing high accuracy on both the PD and the QoIs. Further, the amount of resources required by compression is a few percent of the resources required by simulation while ensuring that the compression time for each stage is less than the corresponding simulation time.This pipeline consists of three main steps. The first step decomposes the data using domain decomposition into small subdomains. Each subdomain is then compressed independently to achieve a high level of parallelism. The second step uses existing techniques that guarantee error bounds on the primary data for each subdomain. The third step uses a post-processing optimization technique based on Lagrange multipliers to reduce the QoI errors for data corresponding to each subdomain. The Lagrange multipliers generated can be further quantized or truncated to increase the compression level. All of the above characteristics of our approach make it highly practical to apply on-the-fly compression while guaranteeing errors on QoIs that are critical to the scientists.

Banerjee, Tania↗

DOE OSTI2023

Resonant anomaly detection with multiple reference datasets

An important class of techniques for resonant anomaly detection in high energy physics builds models that can distinguish between reference and target datasets, where only the latter has appreciable signal. Such techniques, including Classification Without Labels (CWoLa) and Simulation Assisted Likelihood-free Anomaly Detection (SALAD) rely on a single reference dataset. They cannot take advantage of commonly available multiple datasets and thus cannot fully exploit available information. In this work, we propose generalizations of CWoLa and SALAD for settings where multiple reference datasets are available, building on weak supervision techniques. We demonstrate improved performance in a number of settings with realistic and synthetic data. As an added benefit, our generalizations enable us to provide finite-sample guarantees, improving on existing asymptotic analyses.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2024

Local convergence analysis of an inexact trust-region method for nonsmooth optimization

In Baraldi, we introduced an inexact trust-region algorithm for minimizing the sum of a smooth nonconvex function and a nonsmooth convex function in Hilbert space—a class of problems that is ubiquitous in data science, learning, optimal control, and inverse problems. Furthermore, this algorithm has demonstrated excellent performance and scalability with problem size. In this paper, we enrich the convergence analysis for this algorithm, proving strong convergence of the iterates with guaranteed rates. In particular, we demonstrate that the trust-region algorithm recovers superlinear, even quadratic, convergence rates when using a second-order Taylor approximation of the smooth objective function term.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2026

Investigation and Diagnosis of Faulty Data Channels in CMS Outer Tracker Module Testing

The High-Luminosity Large Hadron Collider (HL-LHC) is currently undergoing upgrades to improve its luminosity. In parallel, this requires an upgrade to the Compact Muon Solenoid (CMS)’s Outer Tracker, consisting of Pixel-Strip (PS) and Strip-Strip (2S) modules that can accurately track the path of charged particles originating from the collisions. It follows that such complex modules call for extensive testing, requiring a sophisticated Data Acquisition (DAQ) system that can perform specific tests to assess their performance. In addition, errors caused by the hardware of a given testing station, and its associated data channel, need to be accurately identified to guarantee proper testing of modules. We have developed a software extension to the Phase-II Outer Tracker Analyzer of Test Outputs (POTATO), which is a specialized software designed to analyze and grade all of the module tests through a centralized database. This extension categorizes and analyzes module test results by its station and data channel. Its analysis can be used to identify trends in grading that indicate issues in these channels’ grading process rather than in the individual modules. This poster shows our methodology and results for identifying faulty data channels. Using this extension, we can quickly diagnose and address problems in our DAQ system, ensuring proper evaluation corrections for each module.

Chen, Angus [Fermilab]↗

DOE OSTI2026

Investigation and Diagnosis of Faulty Data Channels in CMS Outer Tracker Module Testing

Chen, Angus [Fermilab]↗

DOE OSTI2025

Derivative-free stochastic optimization via adaptive sampling strategies

In this paper, we present a novel derivative-free framework for solving unconstrained stochastic optimization problems. Many problems in fields ranging from simulation optimization to reinforcement learning to quantum computing involve settings where only stochastic function values are obtained via a zeroth-order oracle, which has no available gradient information and necessitates the usage of derivative-free optimization methodologies. Our approach includes estimating gradients using stochastic function evaluations and integrating adaptive sampling techniques to control the accuracy in these stochastic approximations. Our framework encapsulates several gradient estimation techniques, including standard finite-difference, Gaussian smoothing, sphere smoothing, randomized coordinate finite-difference, and randomized subspace finite-difference methods. We provide theoretical convergence guarantees for our framework and analyze the worst-case iteration and sample complexities associated with each gradient estimation method. Finally, we demonstrate the empirical performance of the methods on logistic regression and nonlinear least squares problems.

Adaptive sampling↗

DOE OSTI2024

Electron– K -phonon interaction in twisted bilayer graphene

We develop an analytic theory to describe the interaction between electrons and K phonons and study its influence on superconductivity in the bare bands of twisted bilayer graphene (TBG). We find that, due to symmetry and the two-center approximation, only one optical K phonon (160meV) of graphene is responsible for the intervalley electron-phonon interaction. Here, this phonon has recently been found in angular-resolved photoemission spectroscopy to be responsible for replicas of the TBG flat bands. By projecting the interaction to the TBG flat bands, we perform the full symmetry analysis of the phonon-mediated attractive interaction and pairing channels in the Chern basis, and show that several channels are guaranteed to have gapless order parameters. From the linearized gap equations, we find that the highest T c pairing induced by this phonon is a singlet gapped s-wave inter-Chern-band order parameter, followed closely by a gapless nematic d-wave intra-Chern-band order parameter. We justify these results analytically, using the topological heavy-fermion mapping of TBG which has allowed us to obtain an analytic form of a phonon-mediated attractive interaction and to analytically solve the linearized and T = 0 gap equations. For the intra-Chern-band channel, the nematic state with nodes is shown to be stabilized in the chiral flat-band limit. While the flat-band Coulomb interaction can be screened sufficiently enough—around the Van Hove singularities—to allow for electron-phonon based superconductivity, it is unlikely that this effect can be maintained in the lower density of states excitation bands around the correlated insulator states.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

DOE OSTI2023

Implementation of extrinsic cohesive zone model (ECZM) in 2D finite-discrete element method (FDEM) using node binding scheme

The combined finite-discrete element method (FDEM) has been widely used for rock fracturing simulations. Conventionally, FDEM is realized using the intrinsic cohesive zone model (ICZM); however, it has the drawback of artificial compliance and high computational expense. As a complement, the extrinsic cohesive zone model (ECZM) is seen to be realized in FDEM recently, whereas the node splitting scheme utilized is cumbersome. Here, within the framework of ICZM-based FDEM, we propose a node binding scheme to efficiently bind the pre-discretized finite elements and thus guarantee the continuum behavior of materials in the elastic stage. The yield surfaces, controlled by ECZM, are dynamically embedded by invoking the pre-inserted cohesive elements. The effectiveness and efficiency of the proposed approach are validated and tested by performing a suite of numerical experiments. Compared with ICZM-based FDEM, the proposed approach can correctly capture material deformation and reduce the computation cost. In contrast to the existing ECZM-based FDEM, the proposed approach can overcome the frequent and complex element topology updating. Finally, this work provides a novel perspective that fully inherits the advantages of both ICZM and ECZM, but circumvents their shortcomings, which guarantees a more efficient and effective simulation of brittle material evolution from continuum to discontinuum.

58 GEOSCIENCES↗

DOE OSTI2021

Learning Sequential Distribution System Restoration via Graph-Reinforcement Learning

We report a distribution service restoration algorithm as a fundamental resilient paradigm for system operators provides an optimally coordinated, resilient solution to enhance the restoration performance. The restoration problem is formulated to coordinate distribution generators and controllable switches optimally. A model-based control scheme is usually designed to solve this problem, relying on a precise model and resulting in low scalability. To tackle these limitations, this work proposes a graph-reinforcement learning framework for the restoration problem. We link the power system topology with a graph convolutional network, which captures the complex mechanism of network restoration in power networks and understands the mutual interactions among controllable devices. Latent features over graphical power networks produced by graph convolutional layers are exploited to learn the control policy for network restoration using deep reinforcement learning. The solution scalability is guaranteed by modeling distributed generators as agents in a multi-agent environment and a proper pre-training paradigm. Comparative studies on IEEE 123-node and 8500-node test systems demonstrate the performance of the proposed solution.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2025

FedCSpc: A Cross-Silo Federated Learning System With Error-Bounded Lossy Parameter Compression

Cross-Silo federated learning is widely used for scaling deep neural network (DNN) training over data silos from different locations worldwide while guaranteeing data privacy. Communication has been identified as the main bottleneck when training large-scale models due to large-volume model parameters and gradient transmission across public networks with limited bandwidth. Most previous works focus on gradient compression, while limited work tries to compress parameters that can not be ignored and extremely affect communication performance during the training. Here, to bridge this gap, we propose FedCSpc: an efficient cross-silo federated learning system with an XAI-driven adaptive parameter compression strategy for large-scale model training. Our work substantially differs from existing gradient compression techniques due to the distinct data features of gradient and parameter. The key contributions of this paper are fourfold. (1) Our designed FedCSpc proposes to compress the parameter during the training using the state-of-the-art error-bounded lossy compressor – SZ3. (2) We develop an adaptive compression error bound adjustment algorithm to guarantee the model accuracy effectively. (3) We exploit an efficient approach to utilize the idle CPU resources of clients to compress the parameters. (4) We perform a comprehensive evaluation with a wide range of models and benchmarks on a GPU cluster with 65 GPUs. Results show that FedCSpc can achieve the same model accuracy as FedAvg while reducing the data volume of parameters and gradients in communication by up to 7.39× and 288×, respectively. With 32 clients on a 4 Gb size model, FedCSpc significantly outperforms FedAvg in wall-clock time in the emulated WAN environment (at the bandwidth of 1 Gbps or lower without loss of generality).

SZ3↗

DOE OSTI2022

Mitigate: An Adaptive Network Data Anonymization Tool Using Condensation-Based Differential Privacy

Modern network devices collect a large amount of data that can be analyzed to identify bottlenecks, anomalies, cyber-attacks, etc. Therefore, there is often a need to analyze such collections of network data quite often by an external expert or by the research community. However, these collections of data contain sensitive, proprietary information. In order for the network data to be shared, it must first be anonymized. The overall objective of this project is to develop an innovative privacy management tool to anonymize network data and achieve sufficient privacy, acceptable data utility, and efficient data analysis at the same time. No existing anonymization methods can achieve all of these at the same time. The core of this technology is a differential private clustering algorithm that provides strong privacy protection, preserves data properties important for subsequent analysis, and allows the party receiving the anonymized data to conduct analysis directly on anonymized data without the need of decryption or any extra processing. The research carried out was to design, implement and verify a solution to this problem by completing the following tasks: 1) developing the core technology; 2) developing a context based method that automatically recommends fields that must be anonymized; 3) conducted experiments showing superior results using our approach compared to existing tools, and 4) developed an intuitive but basic user interface. The research that was conducted generated novel algorithmic techniques that utilize state-of-the-art methods such as condensation, differential privacy preservation, clustering, automated tuning based on contextual awareness, and recommendation techniques to specify columns to users for anonymization leading to optimal privacy that allows research analysis on the dataset. Experiments were conducted to evaluate the efficacy of these novel algorithmic techniques by performing analysis on original non-anonymized datasets, then conducting analysis on the same yet anonymized datasets and comparing the results of the analyses. Overall, the anonymized analysis results were within 1% of the original results, verifying that the generated technology not only guarantees a high level of privacy but also enables research analysis as if it were conducted on the original dataset. Potential applications of this technology include anonymization of any type of structured network datasets that contain sensitive identifiers, such as IP addresses, that can be used in multiple applications. For example, to create an AI or machine learning model for cyber security, e.g., to detect attacks, or for performance analysis, e.g., identify bottlenecks or predict performance. In addition, a market analysis that was conducted for potential applications of this technology identified a broader range of applications of our anonymization technology beyond the network sector that includes healthcare, banking, insurance, securities, finance (FISB), data brokering, cloud services, ad sales, and government.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

A Priority-Based Control Strategy and Performance Bound for Aggregated HVAC-Based Load Shaping

Air conditioning systems have been recognized as a potential, cost-effective resource for shaping electrical load in a power system. This work presents a new priority-based control strategy that explicitly addresses three requirements for using a collection of air conditioning units in this capacity. These are 1) tracking a regulation signal, 2) maintaining the building temperature near its set point, and 3) satisfying a cycling constraint of the air conditioners. After introducing the control strategy, we derive a bound for the regulation signal within which tracking is guaranteed while also satisfying the temperature requirement. These results are illustrated with simulations.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

DOE OSTI2026

AstraAI v1

AstraAI is an open-source, structure-aware AI coding agent designed for large scientific and DOE-HPC codebases such as AMReX-based applications. Unlike general-purpose coding assistants, AstraAI combines retrieval-augmented generation (RAG) with compiler-level Abstract Syntax Tree (AST) analysis to perform precise, scope-constrained code modifications. It identifies exact function spans, enforces locality of edits, and maintains cross-file invariants, enabling deterministic and build-safe transformations in complex C++/GPU environments. AstraAI is intended for developers working on large, evolving HPC frameworks where correctness, reproducibility, and structural integrity are critical. Typical use cases include modifying physics kernels, updating GPU device lambdas, and performing multi-file refactors without breaking compilation or runtime semantics. Compared to conventional LLM-based coding agents - even those with repository access - AstraAI provides structural guarantees rather than free-form text patches. It minimizes unintended diffs, prevents scope drift, preserves formatting and build stability, and reduces structural hallucinations. By integrating compiler tooling directly into the generation loop, AstraAI transforms AI-assisted coding from probabilistic text editing into deterministic, structure-preserving program transformation suitable for mission-critical scientific software.

Natarajan, Mahesh [Lawrence Berkeley National Labo↗

DOE OSTI2020

Transient Safety Filter Design for Grid-Forming Inverters

Unlike conventional generators, inverter-based generation are fundamentally incapable of providing rotational inertia. While grid-forming inverters alleviate some of that problem by synthesizing small inertia via feedback control, additional control mechanisms are needed to ensure safety and security during transients. In this paper, we propose novel real-time safety-constrained feedback controllers (``safety filters'') for droop-based (grid-forming) inverters to ensure transient security of the grid. The safety filter acts as a buffer between the network operational layer and the inverter-control layer, and only lets those dispatch control signals pass to the inverter droop-controller, which are guaranteed to not violate the safety specifications (frequency, voltage, current limits). Using a distributed barrier certificates method, we construct sector-like conditions on the control policies, which guarantee the satisfaction of transient safety specifications. Sum-of-square programming is used to synthesize the safety filters. Numerical simulation results are provided to illustrate the performance of the proposed filter on inverter-based microgrids.

Kundu, Soumya↗

DOE OSTI2021

U.S. ESCO Industry: Industry Size and Recent Market Trends

This study is the latest in a series of LBNL research into U.S. ESCO industry characteristics and market trends. The research is based on interviews with ESCO industry executives conducted during the fall of 2019 and the first half of 2020. Nearly all companies that identified themselves as ESCOs were contacted as part of this project. We find that after a period of little growth (2011-2014), industry revenues reached an estimated $6 billion in 2018, or a 3.4% annual average growth rate from 2015-2018. ESCOs primarily serve the public an institutional sectors (e.g., federal, state, and local governments; university and colleges; and K-12 schools). In 2018, project investments by public and institutional organizations accounted for over 90% of industry revenue, which is consistent with previous industry studies. ESCO activity in the Middle Atlantic, East North Central, and Pacific regions in the U.S. delivered the highest share of revenue in 2018, which is also consistent with earlier research. ESCOs reported that a majority of their customers use energy savings performance contracts (ESPCs) primarily for facility capital improvement needs and resilience rather than utility savings. In addition, the importance of non-energy benefits (e.g., water savings, avoided operations and maintenance costs, and avoided capital costs) accounted for in the project savings guarantee reportedly increased in all markets during 2016-2018 compared to previous time periods. The study found that the ESCO industry faces several key challenges, including: (1) increasing project development times due to more complex projects and other factors; (2) difficulty finding qualified subcontractors in some regions, including minority- women- and disadvantaged population-owned small business enterprises; and (3) difficulty accessing project documents and quickly fulfilling customer requests to justify project payments several years into the performance period of a project.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗