SEARCH · Search NASA

Results for “ENFORCEMENT”

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 883 records · Page 49

All sources NASA NTRS DOE OSTI

DOE OSTI2018

Parallel Nonnegative CP Decomposition of Dense Tensors

The CP tensor decomposition is a low-rank approximation of a tensor. We present a distributed-memory parallel algorithm and implementation of an alternating optimization method for computing a CP decomposition of dense tensors that can enforce nonnegativity of the computed low-rank factors. The principal task is to parallelize the Matricized-Tensor Times Khatri-Rao Product (MTTKRP) bottleneck subcomputation. The algorithm is computation efficient, using dimension trees to avoid redundant computation across MTTKRPs within the alternating method. Our approach is also communication efficient, using a data distribution and parallel algorithm across a multidimensional processor grid that can be tuned to minimize communication. We benchmark our software on synthetic as well as hyperspectral image and neuroscience dynamic functional connectivity data, demonstrating that our algorithm scales well to 100s of nodes (up to 4096 cores) and is faster and more general than the currently available parallel software.

Ballard, Grey↗

DOE OSTI2018

Synchronization-Avoiding Graph Algorithms

Because they were developed for optimal sequential complexity, classical graph algorithms as found in textbooks have strictly-defined orders of operations. Enforcing a prescribed order of operations, or even an approximate order, in a distributed memory setting requires significant amounts of synchronization, which in turn can severely limit scalability. As a result, new algorithms are typically required to achieve scalable performance, even for solving well-known graph problems. Yet, even in these cases, parallel graph algorithms are written according to parallel programming models that evolved for, e.g., scientific computing, and that still have inherent, and scalability-limiting, amounts of synchronization. In this paper we present a new approach to parallel graph algorithms: synchronization-avoiding algorithms. To eliminate synchronization and its associated overhead, synchronization-avoiding algorithms perform work in an unordered and fully asynchronous fashion in such a way that the result is constantly refined toward its final state. “Wasted” work is minimized by locally prioritizing tasks using problem-dependent task utility metrics. We classify algorithms for graph applications into two broad categories: algorithms with monotonic updates (which evince global synchronization) and algorithms with nonmonotonic updates (which evince vertex-centric synchronization). We apply our approach to both classes and develop novel, synchronization-avoiding algorithms for solving exemplar problems: SSSP and connected components for the former, graph coloring for the latter. We demonstrate that eliminating synchronization in conjunction with effective scheduling policies and optimizations in the runtime results in improved scalability for both classes of algorithms.

Firoz, Jesun S.↗

DOE OSTI2018

Exploring the Optimal Platform Configuration for Power-Constrained HPC Workflows

In high-performance computing (HPC) workflows, data analytics is typically utilized to gain insights from scientific simulations. Approaching the era of exascale, online analysis is gaining popularity due to the savings of I/O to persistent storage. As computing capability keeps growing, power consumption is becoming critical to HPC facilities. Enforcing power limits is emerging as a practical trend for power-constrained HPC facilities. However, it remains unclear how to choose the appropriate power limits for various HPC workflows and how to distribute the power limit of a workflow between simulation and analysis. In addition, given a power limit, it is unclear what the optimal scales and power capping levels are for various workflows, especially when taking reliability into account. In order to resolve these issues in power-constrained HPC, in this paper, we propose a reliability-aware model to determine the aforementioned platform configurations for HPC workflows. We also validate our model and present model-driven studies for a wide range of real-system scenarios. Our study reveals interesting insights about how platform configuration affects the performance and energy efficiency of HPC workflows under power constraints.

Tang, Kun↗

DOE OSTI2024

Blockchain-Enabled Secure Device-to-Device Communication in Software-Defined Networking

The Internet of Things (IoT) continues to increase the demand for seamless communication among IoT devices. The rapid growth of IoT devices has led to an exponential increase in device-to-device (D2D) communication within the Software-Defined Networking (SDN), though it enables a flexible archi-tecture for managing network resources. However, traditional security models face challenges (e.g., Security, privacy, and trust) in addressing the dynamic and decentralized nature of these communications. Despite of these challenges, this paper proposes a novel approach that leverages blockchain technology to enhance the security, privacy, and trustworthiness of D2D communication within an SDN environment. The proposed approach integrates blockchain nodes in sDN components to establish a decentralized ledger for transparent and verifiable records. Smart contracts enforce authentication rules to ensure that only authenticated devices can access the network and engage in transactions securely. It also automates the security policies to ensure temper resistance execution using the cryptographic mechanism for data integrity and authentic communication. The Implementation of the proposed algorithms validates the resilience of the proposed approach against cyberattacks. Overall, the proposed approach enables efficient and secure D2D communication for resilient SDN infrastructure in IoT ecosystems.

Das, Debashis↗

DOE OSTI2024

Optimal Management of Grid-Interactive Efficient Buildings via Safe Reinforcement Learning

Reinforcement learning (RL)-based methods have achieved significant success in managing grid-interactive efficient buildings (GEBs). However, RL does not carry intrinsic guarantees of constraint satisfaction, which may lead to severe safety consequences. Besides, in GEB control applications, most existing safe RL approaches rely only on the regularisation parameters in neural networks or penalty of rewards, which often encounter challenges with parameter tuning and lead to catastrophic constraint violations. To provide enforced safety guarantees in controlling GEBs, this paper designs a physics-inspired safe RL method whose decision-making is enhanced through safe interaction with the environment. Different energy resources in GEBs are optimally managed to minimize energy costs and maximize customer comfort. The proposed approach can achieve strict constraint guarantees based on prior knowledge of a set of developed hard steady-state rules. Simulations on the optimal management of GEBs, including heating, ventilation, and air conditioning (HVAC), solar photovoltaics, and energy storage systems, demonstrate the effectiveness of the proposed approach.

Huo, Xiang↗

DOE OSTI2020

Model-based Reconstruction for Single Particle Cryo-Electron Microscopy

Single particle cryo-electron microscopy is a vital tool for 3D characterization of protein structures. A typical workflow involves acquiring projection images of a collection of randomly oriented particles, picking and classifying individual particle projections by orientation, and finally using the individual particle projections to reconstruct a 3D map of the electron density profile. The reconstruction is challenging because of the low signal-to-noise ratio of the data, the unknown orientation of the particles, and the sparsity of data especially when dealing with flexible proteins where there may not be sufficient data corresponding to each class to obtain an accurate reconstruction using standard algorithms. In this paper we present a model-based image reconstruction technique that uses a regularized cost function to reconstruct the 3D density map by assuming known orientations for the particles. Our method casts the reconstruction as minimizing a cost function involving a novel forward model term that accounts for the contrast transfer function of the microscope, the orientation of the particles and the center of rotation offsets. We combine the forward model term with a regularizer that enforces desirable properties in the volume to be reconstructed. Using simulated data, we demonstrate how our method can significantly improve upon the typically used approach.

Venkatakrishnan, Singanallur↗

DOE OSTI2014

An Evaluation of One-Sided and Two-Sided Communication Paradigms on Relaxed-Ordering Interconnect

The Cray Gemini interconnect hardware provides multiple transfer mechanisms and out-of-order message delivery to improve communication throughput. In this paper we quantify the performance of one-sided and two-sided communication paradigms with respect to: 1) the optimal available hardware transfer mechanism, 2) message ordering constraints, 3) per node and per core message concurrency. In addition to using Cray native communication APIs, we use UPC and MPI micro-benchmarks to capture one- and two-sided semantics respectively. Our results indicate that relaxing the message delivery order can improve performance up to 4.6x when compared with strict ordering. When hardware allows it, high-level one-sided programming models can already take advantage of message reordering. Enforcing the ordering semantics of two-sided communication comes with a performance penalty. Furthermore, we argue that exposing out-of-order delivery at the application level is required for the next-generation programming models. Any ordering constraints in the language specifications reduce communication performance for small messages and increase the number of active cores required for peak throughput.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2017

Network-Cognizant Design of Decentralized Volt/VAR Controllers

This paper considers the problem of designing decentralized Volt/VAR controllers for distributed energy resources (DERs). The voltage-reactive power characteristics of individual DERs are obtained by solving a convex optimization problem, where given performance objectives (e.g., minimization of the voltage deviations from a given profile) are specified and stability constraints are enforced. The resultant Volt/VAR characteristics are network-cognizant, in the sense that they embed information on the location of the DERs and, consequently, on the effect of reactive-power adjustments on the voltages throughout the feeder. Bounds on the maximum voltage deviation incurred by the controllers are analytically established. Numerical results are reported to corroborate the technical findings.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2021

Phasor Based Control with the Distributed, Extensible Grid Control Platform

This paper describes how to implement Phasor Based Control (PBC) using the Distributed, Extensible Grid Control (DEGC) Platform. PBC is a novel method for controlling distributed energy resources (DER) that coordinates a centralized optimization with distributed feedback controllers to enforce voltage phasor targets. DEGC is an open source software and communication platform designed for general DER control. We deployed PBC at Lawrence Berkeley Lab's FLEXLAB test site, conducting multiple hardware-in-the-loop test runs. Here, we describe how DEGC was used to implement PBC on hardware, and results demonstrating successful deployment.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2022

Model-Based Framework to Optimize Charger Station Deployment for Battery Electric Vehicles

The development of battery electric vehicles (BEVs) is accelerating due to their environmental advantages over gasoline and diesel-powered vehicles, including a decrease in air pollution and an increase in energy efficiency. The deployment of charging infrastructure will need to increase to keep pace with demand, especially for large commercial vehicles for which few public chargers currently exist. In this paper, a new flexible framework is proposed for optimizing the placement of charging stations for BEVs, within which different physical models and optimization techniques may be used. Furthermore, a set of metrics is suggested to help enforce complex constraints and facilitate direct comparison between different optimization techniques. Unlike many existing charger placement techniques, the proposed method directly considers the historical driving patterns on a vehicle-by-vehicle basis, using transparent models to assess impacts of candidate charger placements, thus improving the explainability of the results. In the developed framework, modeled BEVs are first generated along the road network to mimic historical traffic data and are simulated traveling along a given route according to a simplified vehicle model. During the simulation, the charger placement problem is initially relaxed to allow vehicles to charge at any node along the road network, and vehicle states are tracked to assess areas of high charging demand. Charging stations are then placed based on the results of the relaxed simulation, and suggested placements are evaluated via road network simulation with fixed charger locations. This proposed framework is applied to a sample problem of placing charging stations along five major highway corridors for Class 8 over-the-road electric trucks. A novel mixed integer programming (MIP) formulation is proposed to optimize charger placements based upon the expected charging demand. Constraints were imposed on the final placement results to limit expected wait times at each station and ensure a minimum threshold of trucking routes are viable for BEVs. The results demonstrate the flexibility and potential effectiveness of the developed model-based framework for scalable charger station deployment.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

DOE OSTI2026

Optimal Client Sampling in Federated Learning with Client-level Heterogeneous Differential Privacy

Federated Learning with client-level differential privacy (DP) provides a promising framework for collaboratively training models while rigorously protecting clients’ privacy. However, classic approaches like DP-FedAvg struggle when clients have heterogeneous privacy requirements, as they must uniformly enforce the strictest privacy level across all clients, leading to excessive DP noise and significant degradation in model utility. Existing methods to improve the model utility in such heterogeneous privacy settings often assume a trusted server and are largely heuristic, resulting in suboptimal performance and lacking strong theoretical foundations. Here, in this work, we address these challenges under a practical attack model where both clients and the server are honest-but-curious. We propose GDPFed, which partitions clients into groups based on their privacy budgets and achieves client-level DP within each group to reduce the privacy budget waste and hence improve the model utility. Based on the privacy and convergence analysis of GDPFed, we find that the magnitude of DP noise depends on both model dimensionality and the per-group client sampling ratios. To further improve the performance of GDPFed, we introduce GDPFed+, which integrates model sparsification to eliminate unnecessary noise and optimizes per-group client sampling ratios to minimize convergence error. Extensive empirical evaluations on multiple benchmark datasets demonstrate the effectiveness of GDPFed+, showing substantial performance gains compared with state-of-the-art methods.

Xu, Jiahao [Univ. of Nevada, Reno, NV (United Stat↗

DOE OSTI2017

A Plug-and-Play Priors Approach for Solving Nonlinear Imaging Inverse Problems

In the past two decades, nonlinear image reconstruction methods have led to substantial improvements in the capabilities of numerous imaging systems. Such methods are traditionally formulated as optimization problems that are solved iteratively by simultaneously enforcing data consistency and incorporating prior models. Recently, the Plug-and-Play Priors (PPP) framework suggested that by using more sophisticated denoisers, not necessarily corresponding to an optimization objective, it is possible to improve the quality of reconstructed images. Here in this letter, we show that the PPP approach is applicable beyond linear inverse problems. In particular, we develop the fast iterative shrinkage/thresholding algorithm variant of PPP for model-based nonlinear inverse scattering. The key advantage of the proposed formulation over the original ADMM-based one is that it does not need to perform an inversion on the forward model. We show that the proposed method produces high quality images using both simulated and experimentally measured data.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

Resilient Microgrid Scheduling Considering Multi-Level Load Priorities

In this paper, we propose a novel resilient microgrid scheduling model considering the multi-level load priorities. The resiliency of the microgrid is guaranteed by quickly adjusting the output of committed local resources and shedding the loads with low priorities when the power supply from the main grid is interrupted. Considering the uncertainty of renewable energy resources and loads as well as exchanged power at PCC, the probability of successful islanding (PSI) is used to quantify the resiliency of electricity supply for various loads with different priorities. Then, the multi-level priorities are enforced through chance constrains. Results of numerical simulation validate the proposed resilient scheduling model. In addition, the impacts of resiliency requirement of loads with high priority on the resiliency of loads with low priority are analyzed as well.

Liu, Guodong↗

DOE OSTI2021

A Load Switching Group based Feeder-level Microgrid Energy Management Algorithm for Service Restoration in Power Distribution System

This paper presents a load switching group based energy management system (LSG-EMS) for operating microgrids on a distribution feeder powered by one or multiple grid-forming distributed energy resources. Loads on a distribution feeder are divided into load switching groups that can be remotely switched on and off. The LSG-EMS algorithm, formulated as a mixed-integer linear programming (MILP) problem, has an objective function of maximizing the served loads while minimizing the total number of switching actions. A new set of topology constraints are developed for allowing multiple microgrids to be formed on the feeder and selecting the optimal supply path. Customer comfort is accounted for by maximizing the supply duration in the customer preferred service period and enforcing a minimum service duration. The proposed method is demonstrated on a modified IEEE 33-bus system using actual customer data. Simulation results show that the LSG-EMS successfully coordinates multiple grid-forming sources by selecting an optimal supply topology that maximizes the supply period of both the critical and noncritical loads while minimizing customer service interruptions in the service restoration process.

Hu, Rongxing↗

DOE OSTI2022

Uncertainty-Proof Hosting Capacity with Surrogate Affine Policy

Physical constraints must be enforced when dis-tributed energy resources, such as PV, are integrated into distribution network. Hosting capacity (HC) is thus introduced to define the maximum renewable that distribution system can accommodate. When the grid is further pushed towards low-carbon, many research efforts are devoted to increasing HC. Security and cost-efficiency become even more important in determining HC. This work proposes an uncertainty-proof HC with surrogate affine policy. Flexible resources are leveraged to increase HC. We propose a novel hybrid two-stage AC model with variable uncertainty set. An iterative algorithm is designed to solve the problem. The proposed model and solution approach are validated in modified 141-node feeders, and HC performance is also analyzed.

hosting capacity↗

DOE OSTI2025

A Novel Secondary Frequency Regulation with Optimal Priority Selection of AGC Contributions

Automatic generation control (AGC) is used to maintain acceptable frequencies during operation owing to fluctuations in load and variable resources. In conventional industry applications, the AGC signal is allocated to each generator according to the predispatched frequency regulation capacity or the order of economic efficiency. However, with the increasing integration of inverter-based resources (IBRs), the retirement of conventional synchronous generators (SGs) has posed new challenges to frequency control schemes because fewer of them are optional for AGC regulation. In this paper, we propose a novel model predictive control (MPC)-based frequency regulation model to reduce control cost and ensure stability, by considering different critical dynamic factors when optimally selecting the AGC units. The proposed control model – developed in a general form – comprehensively embeds characteristics such as generator ramping rates, reserve capacity, and operation cost. The model predictive control–based two-timescale AGC scheme enhances the capability of immunizing the power disturbance from types of resources by coordinating the control signals between faster IBRs and slower SGs. The case study’s proposed model is verified to be effective in synergistically enforcing different dynamic properties of AGC units into the frequency regulation scheme.

Jiang, Sufan [The University of North Carolina at ↗

DOE OSTI2015

Creation and Analysis of Atomic Structures for CdTe Bi-crystal Interfaces by the Grain Boundary Genie

Grain boundaries (GB) in poly-CdTe solar cells play an important role in species diffusion, segregation, defect formation, and carrier recombination. While the creation of specific high-symmetry interfaces can be straight forward, the creation of general GB structures in many material systems is difficult if periodic boundary conditions are to be enforced. Here we describe a novel algorithm and implementation to generate initial general GB structures for CdTe in an automated way, and we investigate some of these structures using density functional theory (DFT). Example structures include those with bi-crystals already fabricated for comparison, and those planning to be investigated in the future.

Buurma, Christopher↗

DOE OSTI2016

A Biosequence-based Approach to Software Characterization

For many applications, it is desirable to have some process for recognizing when software binaries are closely related without relying on them to be identical or have identical segments. Some examples include monitoring utilization of high performance computing centers or service clouds, detecting freeware in licensed code, and enforcing application whitelists. But doing so in a dynamic environment is a nontrivial task because most approaches to software similarity require extensive and time-consuming analysis of a binary, or they fail to recognize executables that are similar but nonidentical. Presented herein is a novel biosequence-based method for quantifying similarity of executable binaries. Using this method, it is shown in an example application on large-scale multi-author codes that 1) the biosequence-based method has a statistical performance in recognizing and distinguishing between a collection of real-world high performance computing applications better than 90% of ideal; and 2) an example of using family tree analysis to tune identification for a code subfamily can achieve better than 99% of ideal performance.

cyber security↗