Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Constraints”

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

Distributed ADMM Using Private Blockchain for Power Flow Optimization in Distribution Network With Coupled and Mixed-Integer Constraints

The optimization problem for scheduling distributed energy resources (DERs) and battery energy storage systems (BESS) integrated with the power grid is important to minimize energy consumption from conventional sources in response to demand. Conventionally this optimization problem is solved in a centralized manner, limiting the size of the problem that can be solved and creating a high communication overhead because all the data is transferred to the central controller. These limitations are addressed by the proposed distributed consensus-based alternating direction method of multiplier (DC-ADMM) optimization algorithm, which decomposes the optimization problem into subproblems with private cost function and constraints. The distribution feeder is partitioned into low coupling subnetworks/regions, which solves the private subproblem locally and exchanges information with the neighboring regions to reach consensus. The relaxation strategy is employed for mixed-integer and coupled constraints introduced in the optimal power flow (OPF) problem by stationary and transportable BESS because DC-ADMM convergence is only guaranteed for strict convex problems. The information exchange and synchronization between subnetworks/regions are vital for distributed optimization. In this work, both of these aspects are addressed by the blockchain. The smart contract deployed on the blockchain network acts as a mediator for secure data exchange and synchronization in distributed computation. The blockchain-based distributed optimization problem’s effectiveness is tested for a 0.5-MW laboratory microgrid for one hour ahead and day-ahead for the IEEE 123-bus and EPRI J1 test feeders, and results are compared with a centralized solution.

25 ENERGY STORAGE↗
DOE OSTI2025

Multi-Label Classification with Constraint-Based Learning for Hierarchical Consistency

We explore the limitations of traditional crossentropy loss in a hierarchical multi-label classification setting and introduce a novel loss function. This function is designed to integrate hierarchical constraints directly into the training process. By incorporating such constraints into the loss, our approach slightly improves the logical consistency of predictions in structured domains. We demonstrate the efficacy of our approach through experiments on primary site and histology classification by using electronic pathology reports. These results show that our proposed hierarchical loss function enhances the model's ability to produce predictions that are logically consistent with the natural data hierarchies, and it slightly improves predictive accuracy. Our framework may be extended to other hierarchical domains, however the performance gains are context specific.

Shivanna, Abhishek [ORNL] (ORCID:0009000665228593)↗
DOE OSTI2022

Resilient Operating Constraints for Power Distribution Systems under Setpoint Attacks

Integration and operation of distributed generation (DG) and energy storage (ES) in power distribution systems are enabled by communication networks and embedded sensor and control devices that increase the vulnerability of the systems to cyber-threats, broadening the attack surface and making adversary actions more unpredictable. This paper proposes a methodology that uses ellipsoidal approximations to quantify the potential damage caused by successful attacks that affect, directly or indirectly, the desired operation setpoints and may drive the power distribution operation to unsafe states by violating the limits of voltage or line flows. More specifically, a new methodology is introduced to find the optimal non-symmetric operating constraints that can be imposed to each DG and ES in order to guarantee that the power distribution system is resilient to any malicious setpoints. The proposed method takes as inputs the system topology, DG and ES capabilities, and load limits to solve a convex optimization problem formulated using linear matrix inequalities (LMIs) and the power flow equations. The proposed solution is agnostic to the attacker's action or load profile and it does not require any assumption about the location or means of the attack. The numerical results on a test distribution feeder with several DG and ES illustrate how the proposed resilient operating constraints guarantee the security of the power distribution system under setpoint attacks.

Giraldo, Jairo↗
DOE OSTI2023

Constraints on OPF Surrogates for Learning Stable Local Volt/Var Controllers

We consider the problem of learning local Volt/Var controllers in distribution grids (DGs). Our approach starts from learning separable surrogates that take both local voltages and reactive powers as arguments and predict the reactive power setpoints that approximate optimal power flow (OPF) solutions. We propose an incremental control algorithm and identify two different sets of slope conditions on the local surrogates such that the network is collectively steered toward desired configurations asymptotically. Our results reveal the trade-offs between each set of conditions, with coupled voltage-power slope constraints allowing an arbitrary shape of surrogate functions but risking limitations on exploiting generation capabilities, and reactive power slope constraints taking full advantage of generation capabilities but constraining the shape of surrogate functions. AC power flow simulations on the IEEE 37-bus feeder illustrate their guaranteed stability properties and respective advantages in two DG scenarios.

asymptotic stability↗
DOE OSTI2014

Decoupling Coupled Constraints Through Utility Design

Several multiagent systems exemplify the need for establishing distributed control laws that ensure the resulting agents' collective behavior satisfies a given coupled constraint. This technical note focuses on the design of such control laws through a game-theoretic framework. In particular, this technical note provides two systematic methodologies for the design of local agent objective functions that guarantee all resulting Nash equilibria optimize the system level objective while also satisfying a given coupled constraint. Furthermore, the designed local agent objective functions fit into the framework of state based potential games. Consequently, one can appeal to existing results in game-theoretic learning to derive a distributed process that guarantees the agents will reach such an equilibrium.

Li, N↗
DOE OSTI2023

An Incremental Gradient Method for Optimization Problems With Variational Inequality Constraints

We consider minimizing a sum of agent-specific nondifferentiable merely convex functions over the solution set of a variational inequality (VI) problem in that each agent is associated with a local monotone mapping. This problem finds an application in computation of the best equilibrium in nonlinear complementarity problems arising in transportation networks. We develop an iteratively regularized incremental gradient method where at each iteration, agents communicate over a directed cycle graph to update their solution iterates using their local information about the objective and the mapping. The proposed method is single-timescale in the sense that it does not involve any excessive hard-to-project computation per iteration. We derive nonasymptotic agent-wise convergence rates for the suboptimality of the global objective function and infeasibility of the VI constraints measured by a suitably defined dual gap function. Finally, the proposed method appears to be the first fully iterative scheme equipped with iteration complexity that can address distributed optimization problems with VI constraints over cycle graphs.

convergence↗
DOE OSTI2021

Encoding Frequency Constraints in Preventive Unit Commitment Using Deep Learning With Region-of-Interest Active Sampling

With the increasing penetration of renewable energy, frequency response and its security are of significant concerns for reliable power system operations. Frequency-constrained unit commitment (FCUC) is proposed to address this challenge. Despite existing efforts in modeling frequency characteristics in unit commitment (UC), current strategies can only handle oversimplified low-order frequency response models and do not consider wide-range operating conditions. This paper presents a generic data-driven framework for FCUC under high renewable penetration. Here, deep neural networks (DNNs) are trained to predict the frequency response using real data or high-fidelity simulation data. Next, the DNN is reformulated as a set of mixed-integer linear constraints to be incorporated into the ordinary UC formulation. In the data generation phase, all possible power injections are considered, and a region-of-interest active sampling is proposed to include power injection samples with frequency nadirs closer to the UFLC threshold, which enhances the accuracy of frequency constraints in FCUC. The proposed FCUC is investigated on the IEEE 39-bus system. Then, a full-order dynamic model simulation using PSS/E verifies the effectiveness of FCUC in frequency-secure generator commitments.

42 ENGINEERING↗
DOE OSTI2022

Peer-to-Peer Energy Trading under Network Constraints Based on Generalized Fast Dual Ascent

We report the wide deployment of renewable energy resources, combined with a more proactive demand-side management, is inducing a new paradigm in both power system operation and electricity market trading, which especially boosts the emergence of the peer-to-peer (P2P) market. A more flexible local market mechanism is highly desirable in response to fast changes in renewable power generation at the distribution network level. Moreover, large-scale implementation of P2P energy trading inevitably affects the secure and economic operation of the distribution network. This paper presents a new P2P electricity trading framework with distribution network security constraints considered using the generalized fast dual ascent method. First, an event-driven local P2P market framework is presented to facilitate short-term or immediate local energy transactions. Then, the sensitivity analysis of nodal voltage and network loss with respect to nodal power injections is used to evaluate the impacts of P2P transactions on the distribution network, which ensures the secure operation of the distribution system. Thereby, the external operational constraints are internalized, and the cost of P2P energy trading can be appropriately allocated in an endogenous way. Moreover, a generalized fast dual ascent method is employed to implement distributed market-clearing efficiently. Finally, numerical results indicate that the proposed model could guarantee secure operation of the distribution system with P2P energy trading, and the solution method enjoys good convergence performance.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2023

The role of height–driven constraints and compensations on tree vulnerability to drought

Frequent observations of higher mortality in larger trees than in smaller ones during droughts have sparked an increasing interest in size–dependent drought–induced mortality. However, the underlying physiological mechanisms are not well understood, with height–associated hydraulic constraints often being implied as the potential mechanism driving increased drought vulnerability. Here we performed a quantitative synthesis on how key traits that drive plant water and carbon economy change with tree height within species and assessed the implications that the different constraints and compensations may have on the interacting mechanisms (hydraulic failure, carbon starvation and/or biotic–agent attacks) affecting tree vulnerability to drought. While xylem tension increases with tree height, taller trees present a range of structural and functional adjustments, including more efficient water use and transport and greater water uptake and storage capacity, that mitigate the path–length–associated drop in water potential. These adaptations allow taller trees to withstand episodic water stress. Conclusive evidence for height–dependent increased vulnerability to hydraulic failure and carbon starvation, and their coupling to defence mechanisms and pest and pathogen dynamics, is still lacking. Further research is needed, particularly at the intraspecific level, to ascertain the specific conditions and thresholds above which height hinders tree survival under drought.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2015

Pulmonary nodule detection in CT images based on shape constraint CV model

Purpose: Accurate detection of pulmonary nodules remains a technical challenge in computer-aided diagnosis systems because some nodules may adhere to the blood vessels or the lung wall, which have low contrast compared to the surrounding tissues. In this paper, the analysis of typical shape features of candidate nodules based on a shape constraint Chan–Vese (CV) model combined with calculation of the number of blood branches adhered to nodule candidates is proposed to reduce false positive (FP) nodules from candidate nodules. Methods: The proposed scheme consists of three major stages: (1) Segmentation of lung parenchyma from computed tomography images. (2) Extraction of candidate nodules. (3) Reduction of FP nodules. A gray level enhancement combined with a spherical shape enhancement filter is introduced to extract the candidate nodules and their sphere-like contour regions. FPs are removed by analysis of the typical shape features of nodule candidates based on the CV model using spherical constraint and by investigating the number of blood branches adhered to the candidate nodules. The constrained shapes of CV model are automatically achieved from the extracted candidate nodules. Results: The detection performance was evaluated on 127 nodules of 103 cases including three types of challenging nodules, which are juxta-pleural nodules, juxta-vascular nodules, and ground glass opacity nodules. The free-receiver operating characteristic (FROC) curve shows that the proposed method is able to detect 88% of all the nodules in the data set with 4 FPs per case. Conclusions: Evaluation shows that the authors’ method is feasible and effective for detection of three types of nodules in this study.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2016

Unlocking the Constraints of Cyanobacterial Productivity: Acclimations Enabling Ultrafast Growth

ABSTRACT Harnessing the metabolic potential of photosynthetic microbes for next-generation biotechnology objectives requires detailed scientific understanding of the physiological constraints and regulatory controls affecting carbon partitioning between biomass, metabolite storage pools, and bioproduct synthesis. We dissected the cellular mechanisms underlying the remarkable physiological robustness of the euryhaline unicellular cyanobacterium Synechococcus sp. strain PCC 7002 ( Synechococcus 7002) and identify key mechanisms that allow cyanobacteria to achieve unprecedented photoautotrophic productivities (~2.5-h doubling time). Ultrafast growth of Synechococcus 7002 was supported by high rates of photosynthetic electron transfer and linked to significantly elevated transcription of precursor biosynthesis and protein translation machinery. Notably, no growth or photosynthesis inhibition signatures were observed under any of the tested experimental conditions. Finally, the ultrafast growth in Synechococcus 7002 was also linked to a 300% expansion of average cell volume. We hypothesize that this cellular adaptation is required at high irradiances to support higher cell division rates and reduce deleterious effects, corresponding to high light, through increased carbon and reductant sequestration. IMPORTANCE Efficient coupling between photosynthesis and productivity is central to the development of biotechnology based on solar energy. Therefore, understanding the factors constraining maximum rates of carbon processing is necessary to identify regulatory mechanisms and devise strategies to overcome productivity constraints. Here, we interrogate the molecular mechanisms that operate at a systems level to allow cyanobacteria to achieve ultrafast growth. This was done by considering growth and photosynthetic kinetics with global transcription patterns. We have delineated putative biological principles that allow unicellular cyanobacteria to achieve ultrahigh growth rates through photophysiological acclimation and effective management of cellular resource under different growth regimes.

cyanobacteria↗
DOE OSTI2015

Constraints on the pMSSM, AMSB model and on other models from the search for long-lived charged particles in proton-proton collisions at √s = 8 TeV

Stringent limits are set on the long-lived lepton-like sector of the phenomenological minimal supersymmetric standard model (pMSSM) and the anomaly-mediated supersymmetry breaking (AMSB) model. We derived the limits from the results presented in a recent search for long-lived charged particles in proton–proton collisions, based on data collected by the CMS detector at a centre-of-mass energy of 8 TeV at the Large Hadron Collider. In the pMSSM parameter sub-space considered, 95.9 % of the points predicting charginos with a lifetime of at least 10 ns are excluded. Furthermore, these constraints on the pMSSM are the first obtained at the LHC. Charginos with a lifetime greater than 100 ns and masses up to about 800 GeV in the AMSB model are also excluded. Furthermore, the method described can also be used to set constraints on other models.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2018

The higgsino–singlino sector of the NMSSM: combined constraints from dark matter and the LHC

A light singlino is a promising candidate for dark matter, and a light higgsino is natural in the parameter space of the NMSSM. We study the combined constraints on this scenario resulting from the dark matter relic density, the most recent results from direct detection experiments, LEP and the LHC. In particular limits from a recent search for electroweak production of charginos and neutralinos at √s = 13 TeV after 35.9 fb –1 by CMS and constraints on spin-independent dark matter–nucleon cross sections from XENON1T after 1 tonne × year exposure are considered. We find that scenarios with higgsino masses below ~250 GeV as well as singlino masses below ~100 GeV are strongly constrained depending, however, on assumptions on the bino mass parameter M 1 . Benchmark points and branching fractions for future searches at the LHC are proposed.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Observational constraints on early dark energy

In this paper, we review and update constraints on the Early Dark Energy (EDE) model from cosmological data sets, in particular Planck PR3 and PR4 cosmic microwave background (CMB) data and large-scale structure (LSS) data sets including galaxy clustering and weak lensing data from the Dark Energy Survey, Subaru Hyper Suprime-Cam and KiDS+VIKING-450, as well as BOSS/eBOSS galaxy clustering and Lyman-[Formula: see text] forest data. We detail the fit to CMB data, and perform the first analyses of EDE using the CAMSPEC and Hillipop likelihoods for Planck CMB data, rather than Plik, both of which yield a tighter upper bound on the allowed EDE fraction than that found with Plik. We then supplement CMB data with LSS data in a series of new analyses. All these analyses are concordant in their Bayesian preference for [Formula: see text]CDM over EDE, as indicated by marginalized posterior distributions. We perform a series of tests of the impact of priors in these results, and compare with frequentist analyses based on the profile likelihood, finding qualitative agreement with the Bayesian results. All these tests suggest prior volume effects are not a determining factor in analyses of EDE. This work provides both a review of existing constraints and several new analyses.

Astronomy & Astrophysics↗
DOE OSTI2021

PLANC: Parallel Low-rank Approximation with Nonnegativity Constraints

In this work, we consider the problem of low-rank approximation of massive dense nonnegative tensor data, for example, to discover latent patterns in video and imaging applications. As the size of data sets grows, single workstations are hitting bottlenecks in both computation time and available memory. We propose a distributed-memory parallel computing solution to handle massive data sets, loading the input data across the memories of multiple nodes, and performing efficient and scalable parallel algorithms to compute the low-rank approximation. We present a software package called Parallel Low-rank Approximation with Nonnegativity Constraints, which implements our solution and allows for extension in terms of data (dense or sparse, matrices or tensors of any order), algorithm (e.g., from multiplicative updating techniques to alternating direction method of multipliers), and architecture (we exploit GPUs to accelerate the computation in this work). We describe our parallel distributions and algorithms, which are careful to avoid unnecessary communication and computation, show how to extend the software to include new algorithms and/or constraints, and report efficiency and scalability results for both synthetic and real-world data sets.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Automating NISQ Application Design with Meta Quantum Circuits with Constraints (MQCC)

Near-term intermediate scale quantum (NISQ) computers are likely to have very restricted hardware resources, where precisely controllable qubits are expensive, error-prone, and scarce. Programmers of such computers must therefore balance trade-offs among a large number of (potentially heterogeneous) factors specific to the targeted application and quantum hardware. To assist them, we propose Meta Quantum Circuits with Constraints (MQCC), a meta-programming framework for quantum programs. Programmers express their application as a succinct collection of normal quantum circuits stitched together by a set of (manually or automatically) added meta-level choice variables, whose values are constrained according to a programmable set of quantitative optimization criteria. MQCC’s compiler generates the appropriate constraints and solves them via an SMT solver, producing an optimized, runnable program. We showcase a few MQCC’s applications for its generality including an automatic generation of efficient error syndrome extraction schemes for fault-tolerant quantum error correction with heterogeneous qubits and an approach to writing approximate quantum Fourier transformation and quantum phase estimation that smoothly trades off accuracy and resource use. We also illustrate that MQCC can easily encode prior one-off NISQ application designs-–multi-programming (MP), crosstalk mitigation (CM)—as well as a combination of their optimization goals (i.e., a combined MP-CM).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Optimal Financing Decision in a Contract Food Supply Chain with Capital Constraint

To solve the financing problem of the food producers, we consider a two‐echelon contract food supply chain composed of a family farm with capital constraints and a food processing enterprise. With no capital constraints as the benchmark model, we analyze optimal decisions of the family farm and the food processing enterprise in the case of bank financing with bank participation only and bank financing with “government, bank, and insurance” coparticipation. Then, we discuss how the risk of yield uncertainty influences the optimal decisions and profits of the family farm and the food processing enterprise under different financing situation. Meanwhile, the reason why the government subsidizes agriculture is explored, and the policy of minimum purchase price of the food is initiated when the market price is too low. Finally, the numerical examples and sensitivity analysis are presented. The results show that the bank financing with “government, bank, and insurance” coparticipation improves the welfare of supply chain members more obviously than the bank financing with bank participation only; when the rice price is too low, the policy of minimum purchase price of food is initiated, which increases the revenue and the growing enthusiasm of the family farm; the profits of the family farm and the food processing enterprise will decrease as the risk of yield uncertainty increases in the case of bank financing, and the risk of yield uncertainty will be reduced for the family farm when bank financing with “government, bank, and insurance” coparticipation.

Luo, Ying (ORCID:0000000158101443)↗