Search NASA⌕ Search

SEARCH · Search NASA

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 469 records · Page 26
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Astrophysical Equation-of-State Constraints on the Color-Superconducting Gap

We demonstrate that astrophysical constraints on the dense-matter equation of state place an upper bound on the color-superconducting gap in dense matter above the transition from nuclear matter to quark matter. Pairing effects in the color-flavor locked quark matter phase increase the pressure at high density, and if this effect is sufficiently large then the requirements of causality and mechanical stability make it impossible to reach such a pressure in a way that is consistent with what is known at lower densities. The intermediate-density equation of state is inferred by considering extensions of chiral effective field theory to neutron star densities, and conditioning these using current astrophysical observations of neutron star radius, maximum mass, and tidal deformability (PSR J⁢0348+0432, PSR J1624-2230, PSR J⁢0740+6620, GW170817). At baryon number chemical potential μ = 2.6 GeV we find a 95% upper limit on the color-flavor locked pairing gap Δ of 457 MeV using overly conservative assumptions and 216 MeV with more reasonable assumptions. Furthermore, this constraint may be strengthened by future astrophysical measurements as well as by future advances in high-density QCD calculations.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2024

New Data-Driven Constraints on the Sign of Gluon Polarization in the Proton

Recently, the possible existence of negative gluon helicity Δ g has been observed to be compatible with existing empirical constraints, including from jet production in polarized proton-proton collisions at the Relativistic Heavy Ion Collider, and lattice QCD data on polarized gluon Ioffe time distributions. We perform a new global analysis of polarized parton distributions in the proton with new constraints from the high- x region of deep-inelastic scattering (DIS). A dramatic reduction in the quality of the fit for the negative Δ g replicas compared to those with positive Δ g suggests that the negative Δ g solution cannot simultaneously account for high- x polarized DIS data along with lattice and polarized jet data. Published by the American Physical Society 2024

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

First Constraints on General Neutrino Interactions Based on KATRIN Data

The precision measurement of the tritium β-decay spectrum performed by the KATRIN experiment provides a unique way to search for general neutrino interactions (GNIs). All theoretically allowed GNI terms at dimension 6 involving neutrinos are incorporated into a low-energy effective field theory, and can be identified by specific signatures in the measured tritium β spectrum. In this Letter an effective description of the impact of GNIs on the β spectrum is formulated and the first constraints on the effective GNI parameters are derived based on the 4 ×10 6 electrons collected in the second measurement campaign of KATRIN in 2019. In addition, constraints on selected types of interactions are investigated, thereby exploring the potential of KATRIN to search for more specific new physics cases, including a right-handed W boson, a charged Higgs boson, or leptoquarks.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

Dark Energy Survey Year 3 Results: Cosmological constraints from second- and third-order shear statistics

Here, we present a cosmological analysis of the third-order aperture mass statistic using Dark Energy Survey Year 3 (DES Y3) data. We perform a complete tomographic measurement of the three-point correlation function of the Y3 weak lensing shape catalog with the four fiducial source redshift bins. Building upon our companion methodology paper, we apply a pipeline that combines the two-point function ξ ± with the mass aperture skewness statistic ⟨ M ap 3 ⟩ , which is an efficient compression of the full shear three-point function. We use a suite of simulated shear maps to obtain a joint covariance matrix. By jointly analyzing ξ ± and ⟨ M ap 3 ⟩ measured from DES Y3 data with a Λ CDM model, we find S 8 = 0.780 ± 0.015 and Ω m = 0.26 6 - 0.040 + 0.039 , yielding 111% of figure-of-merit improvement in the Ω m - S 8 plane relative to ξ ± alone, consistent with expectations from simulated likelihood analyses. With a w CDM model, we find S 8 = 0.74 9 - 0.026 + 0.027 and w 0 = - 1.39 ± 0.31 , which gives an improvement of 22% on the joint S 8 - w 0 constraint. Our results are consistent with w 0 = - 1 . Our new constraints are compared to CMB data from the Planck satellite, and we find that with the inclusion of ⟨ M ap 3 ⟩ the existing tension between the datasets is at the level of 2.3 σ . We show that the third-order statistic enables us to self-calibrate the mean photometric redshift uncertainty parameter of the highest redshift bin with little degradation in the figure of merit. Our results demonstrate the constraining power of higher-order lensing statistics and establish ⟨ M ap 3 ⟩ as a practical observable for joint analyses in current and future surveys.

Gomes, R. C. H. [University of Pennsylvania] (ORCI↗
DOE OSTI2026

Multiprobe constraints on early and late time dark energy

We perform a multiprobe analysis combining cosmic microwave background (CMB) data from Planck and the Atacama Cosmology Telescope (ACT), ACT CMB lensing, and large-scale structure (LSS) measurements from the Dark Energy Spectroscopic Instrument (DESI), including DESI Legacy Imaging Survey (LS) galaxies and baryon acoustic oscillations (BAOs). We present the first 5×2 pt analysis of ACT DR6 lensing, DESI LS, and Planck Integrated Sachs-Wolfe (ISW). Within Λ⁢CDM, this yields 𝑆 8 =𝜎 8 ⁢(Ω 𝑚 /0.3) 0.5 =0.819 ±0.016, in good agreement with primary CMB inferences and provides a sound-horizon-free Hubble constant constraint of 𝐻 0 =70.0±4.4 km s −1 Mpc −1 . Then, combining with CMB primary and BAO, we reconfirm a CMB–BAO discrepancy in the Ω 𝑚 –$\frac{𝐷𝑣}{𝑟𝑑}$ plane, which is heightened when combining BAO with the 5 ×2 pt data vector. We explore two dark-energy extensions that may reconcile this: an early-time modification, early dark energy (EDE), and late-time dynamical dark energy (DDE) parametrized by 𝑤 0 ⁢𝑤 𝑎 . For CMB primary +BAO +5 ×2 pt, we find a 3.3⁢𝜎 preference for DDE over Λ⁢CDM, while EDE is modestly favored at 2.3⁢𝜎. The models address different shortcomings of Λ⁢CDM: DDE relaxes the neutrino mass bound (𝑀 𝜈 <0.17 eV vs <0.050 eV under Λ⁢CDM), making it compatible with neutrino oscillation measurements, while EDE raises the Hubble constant to 𝐻 0 =70.5±1.2 km s −1 Mpc −1 , easing the discrepancy with SH0ES. However, neither model resolves both issues simultaneously. Our analysis indicates that both DDE and EDE remain viable extensions of Λ⁢CDM within current uncertainties and demonstrates the capacity of combined probes to place increasingly stringent constraints on cosmological parameters.

79 ASTRONOMY AND ASTROPHYSICS↗
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 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 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)↗