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 73 records · Page 4

All sources NASA NTRS DOE OSTI

DOE OSTI2022

Deep Reinforcement Learning From Demonstrations to Assist Service Restoration in Islanded Microgrids

Microgrids can be operated in island mode during utility grid outages to support service restoration and improve system resilience. To schedule and dispatch distributed energy resources (DERs) in an islanded microgrid, conventional model-based methods rely on accurate distribution network models and lack generalization and adaptability. Data-driven methods are promising for DER coordination but face practical challenges such as potential hazards to microgrids during online training and insufficient online training opportunities due to low outage rates. This paper presents a novel two-stage learning framework that builds on the deep deterministic policy gradient from demonstrations to identify an optimal restoration strategy. At the pre-training stage, imitation learning is applied to equip the control agent with expert experiences to guarantee acceptable initial performance. At the online training stage, action clipping, reward shaping, and expert demonstrations are leveraged to ensure safe exploration while accelerating the training process. In conclusion, the proposed method is illustrated using the IEEE 123-node system and compared with a representative model-based method and the standard deep deterministic policy gradient method to prove solution accuracy and demonstrate increased computational efficiency.

Du, Yan↗

DOE OSTI2024

Towards Field Emission Free Cavity Processing and String Assembly at Fermilab

Cavities and cryomodules assembled at Fermilab have demonstrated unprecedented field emission (FE) free gradients. However, consistent FE-free performance is not guaranteed. Many lessons were learned, and continued vigilance is a must. In addition, several improvements have been identified to further push the state-of-the-art low particulate cavity processing and assembly at Fermilab. Those included the optimization of nitrogen flow, robotic-assisted assembly, and low-particulate fasteners. We share our latest results and vision for the future clean assemblies of cavities and cryomodule strings.

43 PARTICLE ACCELERATORS↗

DOE OSTI2023

Unlocking the Value of Deep Energy Retrofits

This publication is based on an extensive study conducted on behalf of the New York State Energy Research and Development Authority (NYSERDA) and the U S Department of Energy (DOE) to explore financial and risk products to accelerate the implementation of deep energy retrofit (DER) solutions to reduce costs These financial products are intended to speed market development via three fundamental themes: reallocating risk from building owners and lenders to insurers, quantifying and monetizing previously unrecognized value associated with DERs, and providing building owners and lenders with confidence in the performance of building systems Findings are based on a comprehensive analysis and characterization of 100+ existing DER case studies, and more than 40 qualitative interviews with industry experts, including insurers, researchers, building owners, and policymakers In addition, a quantitative model of overall project economics with baseline, high, and low cases was developed This data informed the analysis that resulted in three recommended financial product solutions, which were evaluated for their potential to raise projected cash flows and finance DERs: 1) Building System Performance and Energy Savings Guarantee; 2) Trade Credit Insurance; 3) Ancillary Revenue Contracts. This report identifies many value streams associated with DERs and introduces these three potential financial products, which aim to reallocate risks and reduce barriers to the adoption of advanced envelope DERs.

ancillary renenue contracts↗

DOE OSTI2023

Ground Vehicle Generalized Forces and Moment Governor Design Via Noncertainty-Equivalent Adaptive Prescribed Performance Control

Torque-vectoring technology demonstrates great potential in improving the safety and performance of ground vehicles. In this paper, a novel generalized forces and moment governor for torque vectoring is suggested. The proposed solution strategically combines prescribed performance control, noncertainty equivalent adaptive control design, and a smooth projection operator. The main advantage of the proposed control strategy lies in its capability to guarantee both the transient performance and prompt recovery of the desired deterministic behavior of the closed-loop adaptive system, even in the presence of parametric uncertainties. ASM simulation results are presented to validate the efficacy of the proposed generalized forces and moment governor and to demonstrate its superiority over a baseline solution.

Zhou, Xingyu↗

DOE OSTI2023

Overcoming the Technical Challenges of Coordinating Distributed Load Resources at Scale (Final Report)

Significant recent research has investigated the potential for loads to provide balancing services to the grid. However, this research has not addressed key issues that may arise when such schemes are applied at scale including: 1. Distribution Network Issues. Coordination of large numbers of loads could result in power flows that violate distribution network constraints; 2. Stability Issues. Certain strategies to control loads can exhibit nonlinearity in the form of period-adding bifurcations and chaos. Other control strategies can potentially synchronize the behavior of large numbers of loads. In both cases, the outcome can be power oscillations and instability; 3. Communication Network Issues. Bidirectional low-latency communication channels between a central controller (or several distributed controllers) and each resource are expensive and likely not necessary for effective coordination. Our research questions were: What network, stability, and communication issues might arise in practice when we coordinate large aggregations of loads? How can we coordinate loads to achieve performance objectives in a cost effective manner while avoiding these issues? The ultimate technical goal of the project was the development of network-aware, communication-constrained, non-disruptive load control strategies with stability guarantees that achieve the performance requirements of typical balancing services at a sufficiently low cost to enable the load aggregator and customer to profit. The overall goal was to establish credibility for load control at scale and contribute to U.S. energy security and environmental goals. The team succeeded in answering these research questions and developing these control strategies. The overall approach was based on the development of three testing environments: a simulation testbed, an experimental testbed (20 physical model houses with window-box air conditioners) coupled with the simulation testbed, and a field testbed (100 actual homes in Austin, TX) coupled with the simulation testbed, which enabled controller testing, identification of issues, controller development, and controller validation. The resulting controller was used to demonstrate fast timescale grid balancing (frequency regulation) by aggregations of physical and virtual air conditioners, with sufficient quality to participate in the electricity market. Cost benefit analysis showed overall benefits to the participating households, load aggregators, and the grid, especially if the control technology was integrated directly into existing programmable communicating thermostats. The project provides a variety of wider benefits. Our technology transfer and outreach activities lead us to choose an open-source licensing commercialization pathway, enabling the project results to be available to researchers, industry, and the public. Furthermore, new grid balancing technologies will increase grid flexibility and will enable higher penetrations of intermittent renewable energy resources, such as wind and solar, to be connected to the grid, reducing its environmental impact, and mitigating climate change to the benefit of society.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

DOE OSTI2025

Fair Concurrent Training of Multiple Models in Federated Learning

Federated learning (FL) enables collaborative learning across multiple clients. In most FL work, all clients train a single learning task. However, the recent proliferation of FL applications may increasingly require multiple FL tasks to be trained simultaneously, sharing clients’ computing resources, which we call Multiple-Model Federated Learning (MMFL). Current MMFL algorithms use naïve average-based client-task allocation schemes that often lead to unfair performance when FL tasks have heterogeneous difficulty levels, as the more difficult tasks may need more client participation to train effectively. Furthermore, in the MMFL setting, we face a further challenge that some clients may prefer training specific tasks to others, and may not even be willing to train other tasks, e.g., due to high computational costs, which may exacerbate unfairness in training outcomes across tasks. We address both challenges by firstly designing FedFairMMFL, a difficulty-aware algorithm that dynamically allocates clients to tasks in each training round, based on the tasks’ current performance levels. We provide guarantees on the resulting task fairness and FedFairMMFL’s convergence rate. We then propose novel auction designs that incentivizes clients to train multiple tasks, so as to fairly distribute clients’ training efforts across the tasks, and extend our convergence guarantees to this setting. Here, we finally evaluate our algorithm with multiple sets of learning tasks on real world datasets, showing that our algorithm improves fairness by improving the final model accuracy and convergence speed of the worst performing tasks, while maintaining the average accuracy across tasks.

Federated learning↗

DOE OSTI2020

Increasing Industry Involvement: A Solution from a Student's Perspective

Many engineering employers are finding that graduates are not sufficiently equipped to begin contributing productively when they exit a 4-year institution and enter the workforce. The Intern Professional Development Center (IPDC) is a proposed business model that exposes engineering undergraduates to industry-relevant knowledge, while providing them with working experience during their degree. Using a tri-stage approach, the IPDC engages with students early in their academic careers, provides continuous training and development opportunities, and finally connects the students with potential employers. The two topics most commonly under-represented in engineering programs are: - Familiarity with drafting software - Knowledge of relevant codes and standards. The Intern Professional Development Center (IPDC): A tri-stage solution for recruiting, training, and encouraging the workforce of tomorrow. An IPDC allows students to be active members of industry during their undergraduate careers, leading to: - Improved local talent retention; - Improved graduation and academic performance statistics; - Near-guarantee for post-graduation employment. In March of 2019, the first IPDC prototype began operating in the Tri-Cities, Washington. Since then, 3 undergraduate students have entered the IPDC at Stage 2, beginning with the standard training and professional development. Of those 3 students, 2 have already moved on to Stage 3, with successful ongoing internships with local employers. At a performance review for one of the IPDC's Stage 3 students after 90 days of employment, the direct manager said: 'How soon can we get another one?'.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

DOE OSTI2025

HP-MDR: High-performance and Portable Data Refactoring and Progressive Retrieval with Advanced GPUs

Scientific applications produce vast amounts of data, posing grand challenges in the underlying data management and analytic tasks. Progressive compression is a promising way to address this problem, as it allows for on-demand data retrieval with significantly reduced data movement cost. However, most existing progressive methods are designed for CPUs, leaving a gap for them to unleash the power of today’s heterogeneous computing systems with GPUs.In this work, we propose HP-MDR, a high-performance and portable data refactoring and progressive retrieval framework for GPUs. Our contributions are four-fold: (1) We carefully optimize the bitplane encoding and lossless encoding, two key stages in progressive methods, to achieve high performance on GPUs; (2) We propose pipeline optimization and incorporate it with data refactoring and progressive retrieval workflows to further enhance the performance for large data process; (3) We leverage our framework to enable high-performance data retrieval with guaranteed error control for common Quantities of Interest; (4) We evaluate HP-MDR and compare it with state of the arts using five real-world datasets. Experimental results demonstrate that HP-MDR delivers an average 13.68 × and 6.31 × throughput in data refactoring and progressive retrieval tasks, respectively. It also leads to 11.22 × throughput for recomposing required data representations under Quantity-of-Interest error control and 6.04 × performance for the corresponding end-to-end data retrieval, when compared with state-of-the-art solutions.

Li, Yanliang [University of Oregon]↗

DOE OSTI2022

On the Convergence of Inexact Predictor-Corrector Methods for Linear Programming

Interior point methods (IPMs) are a common approach for solving linear programs (LPs) with strong theoretical guarantees and solid empirical performance. The time complexity of these methods is dominated by the cost of solving a linear system of equations at each iteration. In common applications of linear programming, particularly in machine learning and scientific computing, the size of this linear system can become prohibitively large, requiring the use of iterative solvers, which provide an approximate solution to the linear system. However, approximately solving the linear system at each iteration of an IPM invalidates the theoretical guarantees of common IPM analyses. To remedy this, we theoretically and empirically analyze (slightly modified) predictor-corrector IPMs when using approximate linear solvers: our approach guarantees that, when certain conditions are satisfied, the number of IPM iterations does not increase and that the final solution remains feasible. We also provide practical instantiations of approximate linear solvers that satisfy these conditions for special classes of constraint matrices using randomized linear algebra.

Dexter, Gregory↗

DOE OSTI2020

M&V in ESPC: The U.S. Federal Experience and Implications for Developing ESPC Markets

The United States Federal Government has been conducting guaranteed savings energy savings performance contracts for over 20 years and now relies on ESPC for the majority of its energy efficiency work. Along with a related financed project type, these deals resulted in $4.2 billion of project investment in the five years ending in 2016, a pace that has even accelerated since.Measurement and verification (M&V) on the projects is the key to assuring savings realization and persistence. Perceived as a weakness or burdensome added cost in the early years of the program, M&V has become a strength. All energy conservation measures (ECMs) have some form of measurement – defined as a measured baseline establishment followed by at least one measurement of the main energy-saving parameter for a given ECM taken in the performance period. The government’s in-house energy consulting office, the Federal Energy Management Program (FEMP), now recommends measurement of these “Option A” M&V ECMs throughout the contract term, usually annually. Moreover, a significantly higher percentage of projects are now characterized by more ambitious M&V, including Option B (all parameter measurement) for most generation (including renewable) and some efficiency measures, and more frequent Option C (whole facility utility bill analysis) for “deep retrofit” projects with multiple, interactive ECMs. Coincident with this progress in M&V has been a much greater embracing of ESPC by the federal agencies, resulting in the enormous rate of projects now executed. This paper traces the evolution of M&V in federal ESPC and argues that the heightened credibility of the estimated (and guaranteed) savings has contributed significantly to the procurement vehicle’s long-term viability. This focus on savings integrity via M&V has been learned over two decades for U.S. federal ESPC, but countries with developing ESPC markets would be wise to emphasize it as their markets emerge, allowing them to avoid some of the “growing pains” experienced in the U.S.

Coleman, Philip↗

DOE OSTI2024

Estimating Sparse Direct Effects in Multivariate Regression With the Spike-and-Slab LASSO

The multivariate regression interpretation of the Gaussian chain graph model simultaneously parametrizes (i) the direct effects of p predictors on q outcomes and (ii) the residual partial covariances between pairs of outcomes. We introduce a new method for fitting sparse versions of these models with spike-and-slab LASSO (SSL) priors. We develop an Expectation Conditional Maximization algorithm to obtain sparse estimates of the p × q matrix of direct effects and the q × q residual precision matrix. Our algorithm iteratively solves a sequence of penalized maximum likelihood problems with self-adaptive penalties that gradually filter out negligible regression coefficients and partial covariances. Because it adaptively penalizes individual model parameters, our method is seen to outperform fixed-penalty competitors on simulated data. We establish the posterior contraction rate for our model, buttressing our method’s excellent empirical performance with strong theoretical guarantees. Using our method, we estimated the direct effects of diet and residence type on the composition of the gut microbiome of elderly adults.

EM algorithm↗

DOE OSTI2024

Portable Parallel Algorithms and Frameworks for Exascale Graph Analytics

Graphs (or networks) are a tool used to model the interactions among various entities. Efficiently processing large graphs has recently attracted significant attention due to the applications of graphs in various domains, such as biology, chemistry, and cyber-security. Analyzing the structure and properties of these graphs is an important component of many scientific computing pipelines. With the explosion in the volume of data, graphs have become very large and can contain hundreds of billions of vertices and trillions of edges. Therefore, it is crucial to develop high-performance methods to enable graph analysis to be done quickly and energy-efficiently. Furthermore, these solutions should be highly parallel in order to take advantage of modern parallel machines. However, designing efficient solutions is not enough. With the wide variety of computing environments available, each with different programmability and performance characteristics, it is necessary to develop solutions that are portable in terms of both performance (i.e., provide theoretical guarantees) and programmability (i.e., provide high level abstractions).

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

M&V in ESPC: The U.S. Federal Experience and Implications for Developing ESPC Markets

The United States Federal Government has been conducting guaranteed savings energy savings performance contracts for over 20 years and now relies on ESPC for the majority of its energy efficiency work. Along with a related financed project type, these deals resulted in $4.2 billion of project investment in the five years ending in 2016, a pace that has even accelerated since. Measurement and verification (M&V) on the projects is the key to assuring savings realization and persistence. Perceived as a weakness or burdensome added cost in the early years of the program, M&V has become a strength. All energy conservation measures (ECMs) have some form of measurement – defined as a measured baseline establishment followed by at least one measurement of the main energy-saving parameter taken in the performance period for each ECM. The government’s in-house energy consulting office, the Federal Energy Management Program (FEMP), now recommends measurement of these “Option A” M&V ECMs throughout the contract term, usually annually. Moreover, a significantly higher percentage of projects are now characterized by more ambitious M&V, including Option B (all parameter measurement) for most generation (including renewable) and some efficiency measures, and more frequent Option C (whole facility utility bill analysis) for “deep retrofit” projects with multiple, interactive ECMs. Coincident with this progress in M&V has been a much greater embracing of ESPC by the federal agencies, resulting in the enormous rate of projects now executed. This paper traces the evolution of M&V in federal ESPC and argues that the heightened credibility of the savings has contributed significantly to the procurement vehicle’s long-term viability. This focus on savings integrity via M&V has been learned over two decades for U.S. federal ESPC, but countries with developing ESPC markets would be wise to emphasize it as their markets emerge, allowing them to avoid some of the “growing pains” experienced in the U.S.

Coleman, Philip↗

DOE OSTI2024

Geometry-aware training of factorized layers in tensor Tucker format

Reducing parameter redundancies in neural network architectures is crucial for achieving feasible computational and memory requirements during train and inference of large networks. Given its easy implementation and flexibility, one promising approach is layer factorization, which reshapes weight tensors into a matrix format and parameterizes it as the product of two rank-r matrices. However, this family of approaches often requires an initial full-model warm-up phase, prior knowledge of a feasible rank, and it is sensitive to parameter initialization.In this work, we introduce a novel approach to train the factors of a Tucker decomposition of the weight tensors. Our training proposal proves to be optimal in locally approximating the original unfactorized dynamics and stable for the initialization. Furthermore, the rank of each mode is dynamically updated during training.We provide a theoretical analysis of the algorithm, showing convergence, approximation and local descent guarantees. The method's performance is further illustrated through a variety of experiments, showing remarkable training compression rates and comparable or even better performance than the full baseline and alternative layer factorization strategies.

Zangrando, Emanuele [Gran Sasso Science Institute ↗

DOE OSTI2021

Exploratory analysis and performance prediction of big data transfer in High-performance Networks

Big data transfer in large-scale scientific and business applications is increasingly carried out over connections with guaranteed bandwidth provisioned in High-performance Networks (HPNs) via advance bandwidth reservation. Provisioning agents need to carefully schedule data transfer requests, compute network paths, and allocate appropriate bandwidths. Such reserved bandwidths, if not fully utilized, could be simply wasted due to the exclusive access during the approved time window, and cause extra overhead and complexity for resource management. This calls for accurate performance prediction to reserve bandwidths that match actual needs and avoid over-provisioning. We employ machine learning algorithms to predict big data transfer performance based on extensive performance measurements collected in the past several years from data transfer tests using different protocols and toolkits between various end sites on several real-life physical or emulated testbeds. We first analyze the performance patterns in response to a comprehensive list of parameters in end-host systems, network connections, and data transfer applications, which motivate the use of machine learning and also help us identify the effects of latent factors. We then propose threshold- and clustering-based methods to eliminate negative effects of latent factors in data preprocessing and build a robust performance predictor based on customized domain-oriented loss functions. The performance of the proposed methods is verified by extensive experiments using SVR and RFR as well as theoretical analysis of the general performance bound.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

Resilient Observer Design for Cyber-Physical Systems with Data-Driven Measurement Pruning

Resilient observer design for Cyber-Physical Systems (CPS) in the presence of adversarial false data injection attacks (FDIA) is an active area of research. The existing state-of-the-art algorithms tend to break down as more and more knowledge of the system is built into the attack model; also as the percentage of attacked nodes increases. From the view of optimization theory, the problem is often cast as a classical error correction problem for which a theoretical limit of has been established as the maximum percentage attacked nodes for which state recovery is guaranteed. Beyond this limit, the performance of -minimization based schemes, for instance, deteriorates rapidly. Similar performance degradation occurs for other types of resilient observers beyond certain percentages of attacked nodes. In order to increase the corresponding percentage of attacked nodes for which state recoveries can be guaranteed, researchers have begun to incorporate prior information into the underlying resilient observer design framework. For the most pragmatic cases, this prior information is often obtained through a data-driven machine learning process. Existing results have shown a strong positive correlation between the maximum attacked percentages that can be tolerated and the accuracy of the data-driven model. Motivated by these results, this chapter examines the case for pruning algorithms designed to improve the Positive Prediction Value (PPV) of the resulting prior information, given stochastic uncertainty characteristics of the underlying machine learning model. Theoretical quantification of the achievable improvement is given. Simulation results show that the pruning algorithm significantly increases the maximum correctable percentage of attacked nodes, even for machine learning model whose prediction power is comparable to the random flip of a coin.

Resilient Observer, Cyber-physical Systems, Data-D↗

DOE OSTI2020

Performance Prediction of Big Data Transfer Through Experimental Analysis and Machine Learning

Big data transfer in next-generation scientific applications is now commonly carried out over connections with guaranteed bandwidth provisioned in High-performance Networks (HPNs) through advance bandwidth reservation. To use HPN resources efficiently, provisioning agents need to carefully schedule data transfer requests and allocate appropriate bandwidths. Such reserved bandwidths, if not fully utilized by the requesting user, could be simply wasted or cause extra overhead and complexity in management due to exclusive access. This calls for the capability of performance prediction to reserve bandwidth resources that match actual needs. Towards this goal, we employ machine learning algorithms to predict big data transfer performance based on extensive performance measurements, which are collected over a span of several years from a large number of data transfer tests using different protocols and toolkits between various end sites on several real-life physical or emulated HPN testbeds. We first identify a comprehensive list of attributes involved in a typical big data transfer process, including end host system configurations, network connection properties, and control parameters of data transfer methods. We then conduct an in-depth exploratory analysis of their impacts on application-level throughput, which provides insights into big data transfer performance and motivates the use of machine learning. We also investigate the applicability of machine learning algorithms and derive their general performance bounds for performance prediction of big data transfer in HPNs. Experimental results show that, with appropriate data preprocessing, the proposed machine learning-based approach achieves 95% or higher prediction accuracy in up to 90% of the cases with very noisy real-life performance measurements.

Yun, Daqing↗

DOE OSTI2020

Performance Prediction of Big Data Transfer Through Experimental Analysis and Machine Learning

Big data transfer in next-generation scientific ap- plications is now commonly carried out over connections with guaranteed bandwidth provisioned in High-performance Net- works (HPNs) through advance bandwidth reservation. To use HPN resources efficiently, provisioning agents need to carefully schedule data transfer requests and allocate appropriate band- widths. Such reserved bandwidths, if not fully utilized by the requesting user, could be simply wasted or cause extra overhead and complexity in management due to exclusive access. This calls for the capability of performance prediction to reserve bandwidth resources that match actual needs. Towards this goal, we employ machine learning algorithms to predict big data transfer perfor- mance based on extensive performance measurements, which are collected over a span of several years from a large number of data transfer tests using different protocols and toolkits between various end sites on several real-life physical or emulated HPN testbeds. We first identify a comprehensive list of attributes involved in a typical big data transfer process, including end host system configurations, network connection properties, and control parameters of data transfer methods. We then conduct an in-depth exploratory analysis of their impacts on application- level throughput, which provides insights into big data transfer performance and motivates the use of machine learning. We also investigate the applicability of machine learning algorithms and derive their general performance bounds for performance prediction of big data transfer in HPNs. Experimental results show that, with appropriate data preprocessing, the proposed machine learning-based approach achieves 95% or higher pre- diction accuracy in up to 90% of the cases with very noisy real-life performance measurements.

Yun, Daqing↗