Engineering Papers⌕ Search

SEARCH · Engineering Papers

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.

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

At least 883 records · Page 49
All sourcesNASA NTRSDOE OSTI
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↗
DOE OSTI2025

Data-Conforming Data-Driven Control: Avoiding Premature Generalizations Beyond Data

Data-driven and adaptive control approaches face the problem of introducing sudden distributional shifts beyond the distribution of data encountered during learning. Therefore, they are prone to invalidating the very assumptions used in their own construction. This is due to the linearity of the underlying system, inherently assumed and formulated in most data-driven control approaches, which may falsely generalize the behavior of the system beyond the behavior experienced in the data. This article seeks to mitigate these problems by enforcing consistency of the newly designed closed-loop systems with data and slowing down any distributional shifts in the joint state-input space. This is achieved through incorporating affine regularization terms and linear matrix inequality constraints to data-driven approaches, resulting in convex semi-definite programs that can be efficiently solved by standard software packages. We discuss the optimality conditions of these programs and then conclude this article with a numerical example that further highlights the problem of premature generalization beyond data and shows the effectiveness of our proposed approaches in enhancing the safety of data-driven control methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

A Refinement-by-Superposition -Method for (curl)- and (div)-Conforming Discretizations

Here, we present refinement-by-superposition (RBS) hp-refinement infrastructure for computational electromagnetics (CEMs), which permits exponential rates of convergence. In contrast to dominant approaches to hp-refinement for continuous Galerkin methods, which rely on explicit constraint equations, the multilevel strategy presented drastically reduces the implementation complexity. Through the RBS methodology, enforcement of continuity occurs by construction, enabling arbitrary levels of refinement with ease, and without the practical (but not theoretical) limitations of constrained-node refinement. We outline the construction of the RBS hp-method for refinement with H (curl)- and H (div)-conforming finite cells. Numerical simulations for the 2-D finite element method (FEM) solution of the Maxwell eigenvalue problem demonstrate the effectiveness of RBS hp-refinement. As an additional goal of this work, we aim to promote the use of mixed-order (low- and high-order) elements in practical CEM applications.

42 ENGINEERING↗
DOE OSTI2019

Two-Level Switches for Advanced Time-Division Multiplexing

Superconducting quantum interference device (SQUID)-based time-division multiplexing (TDM) is a mature and widely implemented technology used to read out transition-edge sensor arrays. As the number of pixels in modern arrays continues to increase, a higher multiplexing factor is required to reduce the number of wires and amplifier channels. Yet, as the multiplexing factor is increased, the number of row-select wires (used to turn on a row of TDM SQUIDs in a two-dimensional configuration) also increases, limiting the reduction in array wires. We introduce a more advanced TDM architecture that enforces multi-level switching between subgroups of pixels. We show that this technique can dramatically reduce the number of required row-select lines. We also present the design, fabrication, and testing of a TDM multiplexer incorporating a two-level switch, which implements a second switch for each group of ten TDM pixels. In this application, a multiplexing factor of 100 can be addressed using ten group-select wiring pairs and ten row-select wiring pairs. We demonstrate multiplexer functionality and present measured operating margins of this new TDM multiplexer.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2018

Model-Based Iterative Reconstruction of Magnetization Using Vector Field Electron Tomography

Vector field electron tomography (VFET) is extensively used for three-dimensional (3-D) imaging of magnetic materials at nanometer resolutions. The conventional approach is to reconstruct and visualize the magnetic vector potential or the magnetic field associated with the sample. There is a lack of algorithms capable of reconstructing the 3-D distribution of magnetization from VFET data. Unlike magnetic vector potential and magnetic field, magnetization is a fundamental physical property of the sample that does not extend beyond the dimensions of the sample. We present a model-based iterative reconstruction algorithm (MBIR) that reconstructs the magnetization by minimizing a cost function consisting of a forward model term and a prior model term. The forward model uses the physics of imaging to model the VFET data as a function of the magnetization, and the prior model enforces sparsity in the magnetization reconstruction. We then formulate an optimization algorithm based on the theory of alternate direction method of multipliers to minimize the resulting MBIR cost function. In conclusion, using simulated and real data, we show that our algorithm accurately reconstructs both the magnetization and the magnetic vector potential.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2013

Tools for Understanding Identity

Identity attribution and enrichment is critical to many aspects of law-enforcement and intelligence gathering; this identity typically spans a number of domains in the natural-world such as biographic information (factual information – e.g. names, addresses), biometric information (e.g. fingerprints) and psychological information. In addition to these natural-world projections of identity, identity elements are projected in the cyber-world. Conversely, undesirable elements may use similar techniques to target individuals for spear-phishing attacks (or worse), and potential targets or their organizations may want to determine how to minimize the attack surface exposed. Our research has been exploring the construction of a mathematical model for identity that supports such holistic identities. The model captures the ways in which an identity is constructed through a combination of data elements (e.g. a username on a forum, an address, a telephone number). Some of these elements may allow new characteristics to be inferred, hence enriching the holistic view of the identity. An example use-case would be the inference of real names from usernames, the ‘path’ created by inferring new elements of identity is highlighted in the ‘critical information’ panel. Individual attribution exercises can be understood as paths through a number of elements. Intuitively the entire realizable ‘capability’ can be modeled as a directed graph, where the elements are nodes and the inferences are represented by links connecting one or more antecedents with a conclusion. The model can be operationalized with two levels of tool support described in this paper, the first is a working prototype, the second is expected to reach prototype by July 2013: Understanding the Model The tool allows a user to easily determine, given a particular set of inferences and attributes, which elements or inferences are of most value to an investigator (or an attacker). The tool is also able to take into account the difficulty of the inferences, allowing the user to consider different scenarios depending on the perceived resources of the attacker, or to prioritize lines of investigation. It also has a number of interesting visualizations that are designed to aid the user in understanding the model. The tool works by considering the inferences as a graph and runs various graph-theoretic algorithms, with some novel adaptations, in order to deduce various properties. Using the Model To help investigators exploit the model to perform identity attribution, we have developed the Identity Map visualization. For a user-provided set of known starting elements and a set of desired target elements for a given identity, the Identity Map generates investigative workflows as paths through the model. Each path consists of a series of elements and inferences between them that connect the input and output elements. Each path also has an associated confidence level that estimates the reliability of the resulting attribution. Identity Map can help investigators understand the possible ways to make an identification decision and guide them toward the data-collection or analysis steps required to reach that decision.

Creese, Sadie↗
DOE OSTI2023

Combined Dimensional and Topology Optimization of Synchronous Machine Rotors Using a Material Density Interpolation Method

This article presents a magneto-structural combined dimensional and topology optimization technique for interior permanent magnet synchronous machine (IPMSM) and wound field synchronous machine (WFSM) rotors. Dimensional changes to the permanent magnet (PM) and rotor winding location or size are accomplished by interpolating or projecting a smoothed Heaviside rectangular function representing the presence of PM material onto the IPMSM rotor design domain mesh, whereas the presence of copper material for WFSM rotor is interpolated in the same manner. A density based Solid Isotropic Material with Penalization (SIMP) topology optimization approach is then used to vary the presence of electrical steel in mesh elements to form flux barriers around the PM. The proposed method enforces a defined shape for the PM without requiring the mesh in the design domain to be deformed. Four examples are presented to demonstrate the technique: Two flat bar IPMSM, one V-shaped IPMSM, and a WFSM. Here, a comparative study is performed on one of the flat bar IPMSMs using Metamodel of Optimal Prognosis (MOP) based method.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2026

Safe Deep Reinforcement Learning for Robust Frequency and Voltage-Constrained Networked Microgrid Restoration

Here, this paper proposes a safe soft actor-critic reinforcement learning (RL) algorithm–based controller for networked microgrid restoration. It formulates the post black-start start as a finite-horizon constrained Markov decision process. The RL agent co-optimizes real and reactive power set-points for both grid-forming and grid-following inverters under explicit voltage and frequency constraints, while enforcing proper power sharing via the Mean Active Power Sharing Index (MPSI) and Mean Reactive Power Sharing Index (MQSI). Numerical results obtained on the IEEE 123-bus distribution system show that the proposed method achieves a mean voltage build-up time of 0.01 s without breaching the 5% sharing-violation budget under various load scenarios, considering MPSI and MQSI indices. These findings demonstrate that the proposed method yields fast and safe black-start schedules without resorting to heuristic penalties.

Selim, Alaa [Dartmouth College, Hanover, NH (Unite↗
DOE OSTI2026

Safe Deep Reinforcement Learning for Active Distribution System Model Predictive Control with EVs and DERs

The temporal and spatial mismatch between PV generation and electric vehicle (EV) charging and discharging may cause voltage violations in active distribution networks. Despite the widespread use of deep reinforcement learning (DRL) in power system optimization and control, it lacks guarantees on constraint satisfaction during both training and deployment. This paper proposes a Lagrangian-based safe DRL approach for model predictive control (MPC) of active distribution systems with large-scale integration of PVs, EVs, and energy storage systems (ESSs). A Transformer-LSTM time-series model is proposed to forecast EV charging demand, which is then formulated as a constraint to ensure charging requirements are met. Using this prediction, a Lagrangian-based safe soft actor-critic (SAC) framework is developed for real-time control in a three-phase unbalanced distribution system, enforcing voltage safety constraints while optimizing the cumulative net reward. By integrating the forecasting model with multi-period constraints, the proposed framework jointly coordinates PV systems, EV charging and discharging, and ESS scheduling within the MPC horizon. Numerical experiments on a modified IEEE 123-bus system with real-world data show that, under a high PV penetration scenario, the proposed method increases the net reward by 30.74% and reduces average voltage violations from 0.0011 p.u. to 0.0002 p.u. compared with standard SAC. Compared with the optimal power flow (OPF) approach, it achieves similar voltage security while yielding lower line losses. It also maintains real-time control capability, reducing operation latency to 53.21 ms per 15-minute control interval. The proposed method remains effective under varying PV/EV penetrations and load conditions.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2015

Variational Dirichlet Blur Kernel Estimation

Blind image deconvolution involves two key objectives: 1) latent image and 2) blur estimation. For latent image estimation, we propose a fast deconvolution algorithm, which uses an image prior of nondimensional Gaussianity measure to enforce sparsity and an undetermined boundary condition methodology to reduce boundary artifacts. For blur estimation, a linear inverse problem with normalization and nonnegative constraints must be solved. However, the normalization constraint is ignored in many blind image deblurring methods, mainly because it makes the problem less tractable. In this paper, we show that the normalization constraint can be very naturally incorporated into the estimation process by using a Dirichlet distribution to approximate the posterior distribution of the blur. Making use of variational Dirichlet approximation, we provide a blur posterior approximation that considers the uncertainty of the estimate and removes noise in the estimated kernel. Furthermore, experiments with synthetic and real data demonstrate that the proposed method is very competitive to the state-of-the-art blind image restoration methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Bayesian K-SVD Using Fast Variational Inference

Recent work in signal processing in general and image processing in particular deals with sparse representation related problems. Two such problems are of paramount importance: an overriding need for designing a well-suited overcomplete dictionary containing a redundant set of atoms— i.e., basis signals—and how to find a sparse representation of a given signal with respect to the chosen dictionary. Dictionary learning techniques, among which we find the popular K-singular value decomposition algorithm, tackle these problems by adapting a dictionary to a set of training data. A common drawback of such techniques is the need for parameter-tuning. In order to overcome this limitation, we propose a fullyautomated Bayesian method that considers the uncertainty of the estimates and produces a sparse representation of the data without prior information on the number of non-zeros in each representation vector. We follow a Bayesian approach that uses a three-tiered hierarchical prior to enforce sparsity on the representations and develop an efficient variational inference framework that reduces computational complexity. Furthermore, we describe a greedy approach that speeds up the whole process. Lastly, we present experimental results that show superior performance on two different applications with real images: denoising and inpainting.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Learning Canonical Embeddings for Unsupervised Shape Correspondence With Locally Linear Transformations

We present a new approach to unsupervised shape correspondence learning between pairs of point clouds. We make the first attempt to adapt the classical locally linear embedding algorithm (LLE)-originally designed for nonlinear dimensionality reduction-for shape correspondence. The key idea is to find dense correspondences between shapes by first obtaining high-dimensional neighborhood-preserving embeddings of low-dimensional point clouds and subsequently aligning the source and target embeddings using locally linear transformations. We demonstrate that learning the embedding using a new LLE-inspired point cloud reconstruction objective results in accurate shape correspondences. More specifically, the approach comprises an end-to-end learnable framework of extracting high-dimensional neighborhood-preserving embeddings, estimating locally linear transformations in the embedding space, and reconstructing shapes via divergence measure-based alignment of probability density functions built over reconstructed and target shapes. Our approach enforces embeddings of shapes in correspondence to lie in the same universal/canonical embedding space, which eventually helps regularize the learning process and leads to a simple nearest neighbors approach between shape embeddings for finding reliable correspondences. Comprehensive experiments show that the new method makes noticeable improvements over state-of-the-art approaches on standard shape correspondence benchmark datasets covering both human and nonhuman shapes.

deformation↗
DOE OSTI2016

Corrective Control to Handle Forecast Uncertainty: A Chance Constrained Optimal Power Flow

Higher shares of electricity generation from renewable energy sources and market liberalization is increasing uncertainty in power systems operation. At the same time, operation is becoming more flexible with improved control systems and new technology such as phase shifting transformers (PSTs) and high voltage direct current connections (HVDC). Previous studies have shown that the use of corrective control in response to outages contributes to a reduction in operating cost, while maintaining N-1 security. In this work, we propose a method to extend the use of corrective control of PSTs and HVDCs to react to uncertainty. We characterize the uncertainty as continuous random variables, and define the corrective control actions through affine control policies. This allows us to efficiently model control reactions to a large number of uncertainty sources. The control policies are then included in a chance constrained optimal power flow formulation, which guarantees that the system constraints are enforced with a desired probability. Lastly, by applying an analytical reformulation of the chance constraints, we obtain a second-order cone problem for which we develop an efficient solution algorithm. In a case study for the IEEE 118 bus system, we show that corrective control for uncertainty leads to a decrease in operational cost, while maintaining system security. Further, we demonstrate the scalability of the method by solving the problem for the IEEE 300 bus and the Polish system test cases.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2017

Chance-Constrained AC Optimal Power Flow for Distribution Systems With Renewables

This paper focuses on distribution systems featuring renewable energy sources (RESs) and energy storage systems, and presents an AC optimal power flow (OPF) approach to optimize system-level performance objectives while coping with uncertainty in both RES generation and loads. The proposed method hinges on a chance-constrained AC OPF formulation where probabilistic constraints are utilized to enforce voltage regulation with prescribed probability. A computationally more affordable convex reformulation is developed by resorting to suitable linear approximations of the AC power-flow equations as well as convex approximations of the chance constraints. The approximate chance constraints provide conservative bounds that hold for arbitrary distributions of the forecasting errors. An adaptive strategy is then obtained by embedding the proposed AC OPF task into a model predictive control framework. Finally, a distributed solver is developed to strategically distribute the solution of the optimization problems across utility and customers.

24 POWER TRANSMISSION AND DISTRIBUTION↗