Search NASA⌕ Search

SEARCH · Search NASA

Results for “Constraining”

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 415 records · Page 23

The Impact of Constrained Data Assimilation on the Forecasts of Three Convection Systems During the ARM MC3E Field Campaign

A constrained data assimilation (CDA) system based on the ensemble variational (EnVar) method and physical constraints of mass and water conservations is evaluated through three convective cases during the Midlatitude Continental Convective Clouds Experiment (MC3E) of the Atmospheric Radiation Measurement (ARM) program. Compared to the original data assimilation (ODA), the CDA is shown to perform better in the forecasted state variables and simulated precipitation. The CDA is also shown to greatly mitigate the loss of forecast skills in observation denial experiments when radar radial winds are withheld in the assimilation. Modifications to the algorithm and sensitivities of the CDA to the calculation of the time tendencies in the constraints are described.

54 ENVIRONMENTAL SCIENCES↗

A Surrogate-Based Asynchronous Decomposition Technique for Realistic Security-Constrained Optimal Power Flow Problems

Here we present a decomposition approach for obtaining good feasible solutions for the security-constrained, alternating-current, optimal power flow (SC-AC-OPF) problem at an industrial scale and under real-world time and computational limits. The approach was designed while preparing and participating in ARPA-E’s Grid Optimization Competition (GOC) Challenge 1. The challenge focused on a near-real-time version of the SC-AC-OPF problem, where a base operating point is optimized, taking into account possible single-element contingencies, after which the system adapts its operating point following the response of automatic frequency droop controllers and voltage regulators. Our solution approach for this problem relies on state-of-the-art nonlinear programming algorithms, and it employs nonconvex relaxations for complementarity constraints, a specialized two-stage decomposition technique with sparse approximations of recourse terms and contingency ranking and prescreening. The paper describes and justifies our approach and outlines the features of its implementation, including functions and derivatives evaluation, warm-starting strategies, and asynchronous parallelism. We discuss the results of the independent benchmark of our approach by ARPA-E’s GOC team in Challenge 1, where it was found to consistently produce high-quality solutions across a wide range of network sizes and difficulty, and conclude by outlining future extensions of the approach.

97 MATHEMATICS AND COMPUTING↗

Applying Constrained Bayesian Optimization to the Design of Critical Experiments

Often when planning a criticality experiment, many design configurations are iteratively investigated with a Monte Carlo transport code. The goal is that the experiment will be optimal with respect to some variable, like the fraction of fissions occurring at a certain energy range, while simultaneously being critical. Unfortunately, the Monte Carlo transport simulations are expensive, which can ultimately limit the number of configurations that can be explored. In this work, we present how Gaussian processes (GPs) can be used as a reduced-order model in a constrained Bayesian optimization (CBO) algorithm to design a criticality experiment. The GPs replace the Monte Carlo transport simulations that explore the design space. The CBO algorithm efficiently identifies new points in the design space to run the Monte Carlo transport code while respecting the criticality constraint. It does so in a manner that both improves the accuracy of the GP and finds the approximate global optimum. We demonstrate the performance of CBO with the design of a Thermal Epithermal eXperiment (TEX) for the criticality safety validation of nuclear waste models of the Hanford Tank Farm.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Developing a data-driven method to constrain the antiproton background in the Mu2e experiment

The Mu2e experiment will search for CLFV neutrinoless coherent muon to electron conversion in the field of an Al nucleus. The expected signal is a 104.97 MeV/c monochromatic $e^-$ (CE). CE-like $e^-$’s could also come from $\bar{p}$’s annihilating in the Stopping Target (ST). The background induced by $\bar{p}$’s is expected to be low but has a large systematic uncertainty. It cannot be suppressed by the time window cut used to reduce the prompt background. However, $p\bar{p}$ annihilation in the ST is the only source of events in the Mu2e detector with multiple tracks coming from the ST, simultaneous in time, each with a momentum in the signal window region. We exploited this unique feature and developed algorithms to identify and reconstruct multi-track events. This paper discusses the status and prospects of this data-driven method to constrain the $\bar{p}$ background at Mu2e.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Constraining Bedrock Groundwater Residence Times in a Mountain System with Environmental Tracer Observations and Bayesian Uncertainty Quantification: Modeling and Data Package

Groundwater residence times provide fundamental descriptions of hydrologic dynamics and mixing processes in mountainous watersheds. Yet, few observational datasets that can constrain groundwater residence times over broad timescales are available in high elevation mountain systems. Here we present field observations from May 2021 of dissolved noble gases (He, Ne, Ar, Kr, and Xe), Chloroflourcarbons (CFCs), Sulfurhexaflouride (SF6), and tritium (3H) sampled from the Pumphouse Lower Montane study site (wells PLM1, PLM6, and PLM7) within the East River Watershed, Colorado. The presented noble gas (PLM_noblegas_2021.csv) and environmental tracer (PLM_tracers_2021.csv) observation datasets, along with the associated modeling scripts, aide in quantifying groundwater residence times and recharge conditions in a high elevation mountain system. Furthermore, the modeling scripts quantify groundwater residence time and noble gas recharge condition uncertainties using a novel Markov-chain Monte Carlo approach. All data modeling scripts are written in the Python code.

54 ENVIRONMENTAL SCIENCES↗

Identifying Direct SP -Converted Waves Constrains Local Induced Earthquake Depths

Abstract Seismicity in southern Kansas and northern Oklahoma in the past decade has been associated with fluid injections. In southcentral Kansas, the Wellington earthquake catalog is primarily composed of local, low-magnitude events. Approximately 22% of recorded earthquakes over a 2.5 yr period exhibit a seismic phase arriving between the direct P phase and direct S phase with particle motion similar to the P wave. This intermediate phase was identified as an S to P conversion (SP phase) occurring in the sedimentary rocks instead of the hypothesized basement to sedimentary section transition. We exploit the SP-converted phases to improve the depth accuracy of shallow earthquakes and to constrain VP/VS. The revised depth calculations further confirm that these local induced earthquakes are occurring in the shallow crystalline basement, below the sedimentary section in which fluids are injected.

Geochemistry & Geophysics↗

Constraining braneworlds with entanglement entropy

We propose swampland criteria for braneworlds viewed as effective field theories of defects coupled to semiclassical gravity. We do this by exploiting their holographic interpretation. We focus on general features of entanglement entropies and their holographic calculations. Entropies have to be positive. Furthermore, causality imposes certain constraints on the surfaces that are used holographically to compute them, most notably a property known as causal wedge inclusion. As a test case, we explicitly constrain the Dvali-Gabadadze-Porrati term as a second-order-in-derivatives correction to the Randall-Sundrum action. We conclude by discussing the implications of these criteria for the question on whether entanglement islands in theories with massless gravitons are possible in Karch-Randall braneworlds.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Constraining the nuclear gluon PDF with inclusive hadron production data

The nuclear parton distribution functions (nPDFs) of gluons are known to be difficult to determine with fits of deep inelastic scattering (DIS) and Drell-Yan (DY) data alone. Therefore, the nCTEQ15 analysis of nuclear PDFs added inclusive neutral pion production data from RHIC to help in constraining the gluon. In this analysis, we present a new global analysis of nuclear PDFs based on a much larger set of single inclusive light hadron data from RHIC and the LHC. Using our new nCTEQ code (nCTEQ++) with an optimized version of INCNLO we study systematically the limitations of the theory and the impact of the fragmentation function uncertainty.

Duwentäster, Pit↗

Methods for Representing Flexible, Energy-Constrained Technologies in Utility Planning Tools

Capacity expansion models are widely used by power system researchers, planners, and policy analysts to evaluate alternative power system investment scenarios. With the increasing deployment of wind and solar in the US, there has been much focus on improving the representations of variable generation (VG) technologies within capacity expansion models. Models that capture the variable net-load profiles and larger reserve requirements associated with high penetration VG systems represent an improvement to classic capacity expansion models, but fall short of capturing the complexities associated with storage technologies, such as battery energy storage (BES) and concentrating solar power with thermal energy storage (CSP with TES). While difficult to model in a capacity expansion setting, these technologies are potentially competitive sources of flexibility with the intriguing characteristics of being able to absorb VG that would otherwise be curtailed and directly contribute to renewable energy goals, respectively. In this paper we present methods for accurately representing these technologies in a large-scale capacity expansion model with high electrical and geospatial resolution. VG modeling techniques, including novel methods for capturing curtailment due to unit commitment and other hourly dispatch phenomena, are also reviewed. Modeling for a region in the southwestern United States demonstrates the economic relevance of being able to explicitly trade off the costs and capabilities of energy-constrained technologies, especially BES, against other resources in the near-term, in time to make plans for the coming decade

24 POWER TRANSMISSION AND DISTRIBUTION↗

A Scalable Mixed-Integer Decomposition Method for Security-Constrained Optimal Power Flow with Complementarity Constraints

This project aimed to develop a scalable algorithm for security-constrained optimal power flow (SCOPF) under contingency scenarios. In particular, the SCOPF problem targeted in the GO Competition is challenging because of the nonconvexity, its nonsmoothness, and the problem size, which increases with the number of contingency events. Complementarity constraints imposed in post-contingency variables are particularly challenging because they lead to a violation of constraint qualifications at any feasible point.

97 MATHEMATICS AND COMPUTING↗

High Performance Solution for Security Constrained Optimal Power Flow

Solving the Alternating Current Optimal Power Flow (ACOPF) problem is key to economically efficient and reliable power networks with a good solution potentially saving utilities tens of billions of dollars annually (according to FERC). The Grid Optimization (GO) Competition set up by ARPA-E saw several promising solutions in Challenge 1. While team GOT-TJU-OPF placed top 10 in Division 3 and 4, this was not a satisfactory performance, and the team has identified specific areas to improve and will be adding more members to round out the necessary skills and expertise needed to be more competitive. The team set out for redemption during GO Challenge 2 with an improved High-Performance Solution for Security Constrained Optimal Power Flow. The (renamed) BSI-GOT-OPF Team ended up finishing top 2 overall in the competition. The algorithms developed have potential impacts for the electric power markets that are enormous. Optimal Power Flow technology can be an enabling technology to achieve energy-efficient power grids while enhancing renewable energy penetration, among others.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Building Intelligence with Layered Defense Using Security-Constrained Optimization and Security Risk Detection (BUILD-SOS): A Probabilistic Approach

In this project, we employ a layered protection strategy incorporating advanced optimization and detection techniques using a probabilistic approach. The probabilistic approach is not only applied when detecting cyber attacks, but also incorporated in control strategies, which greatly increases the attacking difficulties. Hackers need to understand both probabilistic detection algorithms and uncertainty modeling methods in control in order to execute any effective attacks. The end-to-end solutions enable us to provide Building Intelligence with Layered Defense using Security-Constrained Optimization and Security Risk Detection (BUILD-SOS).

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Constraining Cross Section and Beam Systematics for Future NOvA Sterile Neutrino Search

he NOvA (NuMI Off-axis $\nu_e$ Appearance) experiment measures neutrino oscillations in a nearly pure muon (anti)neutrino beam over a 810 km baseline. We search for sterile neutrino driven oscillations in both neutral current (NC) and charged current (CC) muon neutrino samples. A deficit of NC interactions at the Far Detector could occur since sterile neutrinos do not couple to the Z boson. A modulation of the muon neutrino disappearance probability is possible due to a new mass splitting. The NuMI beam line is capable of running in forward or reverse horn current modes, which creates a neutrino or antineutrino beam, respectively. Samples collected in forward horn current (FHC) or reverse horn current (RHC) modes are subject to beam optics uncertainties, in addition to cross section and hadron production uncertainties. We explore the ategories. To tackle reduction of cross section uncertainties, we study how splitting the neutral current (NC) samples can impact the systematic reduction and its implications on oscillation parameters, leveraging results from Monte Carlo simulations. Additionally, we look at the possibility of using a $\nu$-on-e scattering sample. The $\nu$-on-e scattering process has minimal cross section uncertainties compared to that of neutrino-nucleus interactions, which can help constrain the overall flux normalizations. Using both the ZHC sample, NC split sample, and $\nu$-on-e scattering sample jointly with FHC samples would reduce the focusing uncertainties and the hadron production uncertainties in the future sterile analysis.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Intelligent Partitioning based Fully Parallel AC Security-Constrained Optimal Power Flow

Today’s power grid is becoming more diverse and integrated with high-level distributed energy resources and smart control technologies that is creating a new set of grid management challenges in terms of large-scale, nonlinear, and non-convex problem modeling, complex and time-consuming computation, as well as difficult uncertainty handling. This project focused on solving a challenging multi-period security-constrained generation scheduling problem, which is of great importance for maximizing the social welfare of real-time dispatch, day-ahead market, as well as weekly planning of power systems. Our developed software explored parallel optimization algorithms for complex and realistic power system models, and develop fast, efficient, and robust grid optimization solutions on the high-performance computing platform that will enable increased grid economics, flexibility, resilience, as well as energy security in the United States.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Alternating Direction Decomposition with Strong Bounding and Convexification (ADDSBC) for Solving Security Constrained AC Unit Commitment Problems

This project aims to develop efficient and robust computational methods for solving the security-constrained unit commitment and alternating current optimal power flow problem (SC-UC-ACOPF). The SC-UC-ACOPF problem is at the center of the short-term operation of the U.S. Power Grid. It is solved every week, every day, and every 10 minutes to plan for the optimal action of electricity generation and consumption by minimizing the generation cost and maintaining power system reliability against potential disruptions of equipment failures. In mathematical terms, SC-UC-ACOPF is a challenging large-scale mixed-integer nonlinear optimization model. This means that the decisions involve both discrete variables, e.g. the turning on and off of generators and switching of transmission lines and transformers, and continuous decisions, e.g. the amount of energy generated by each generator and the power flows in the power grid. The physics of the power flow is described by nonlinear equations involving real and reactive power and bus voltages. Another key feature is the large number of contingencies, i.e. the system needs to stay reliable in face of failure of any one equipment, such as transmission lines and generators. The U.S. power grids are extremely complicated and large scale with more than 5,000 generators, 50,000 buses, and 100,000 high-voltage transmission lines, making the SC-UC-ACOPF a very large-scale computation challenge. The research developed in this project aims to solve the SC-UC-ACOPF problems in the three timescales, i.e. weekly, daily, and every 10-min. The proposed computational methods are built on a principled algorithmic approach of decomposition and penalization. More specifically, the algorithm develops spatial and temporal decomposition by exploiting the strong temporal coupling and weak spatial coupling of the UC problem and the complementary feature, i.e. weak temporal coupling and strong spatial coupling of the ACOPF problem. The algorithm also leverages recent progresses in strong convex relaxation of ACOPF. A unique feature of the proposed approach is that it generates a valid, global upper bound on the optimal maximum profit. In this way, a global optimality gap is available to measure the quality of the solution. To further speed up computation, the research team has developed a plethora of effective heuristics to strengthen the iterative penalty-based decomposition framework. For instance, a heuristic is developed to construct inner approximations of the time coupling constraints within the time decoupled problems. Contingencies are pre-screened and low-rank matrix computation is exploited to find the almost unique solution to each contingency. A novel heuristic for line switching is proposed and tested with positive impacts on instances where line switching is beneficial. Taking a systematic approach and carefully handling every detail of the problem pays off. The TIM-GO’s performance throughout the trials and the final event was stellar. TIM-GO garnered the second highest total prize money and is ranked in the top three positions across all categories of comparison.

97 MATHEMATICS AND COMPUTING↗

Early Career: Constraining the Electromagnetic Shower Energy Scale at LArTPC Neutrino Detectors Near and Far (Final Scientific/Technical Report)

This is the final scientific/technical report associated with the award "Early Career: Constraining the Electromagnetic Shower Energy Scale at LArTPC Neutrino Detectors Near and Far"; the primary research topics associated with the award are neutrino oscillation physics, reconstruction of neutrino interaction events using machine learning techniques, and detector calibration.

43 PARTICLE ACCELERATORS↗

Constraining the Stellar-to-Halo Mass Relation with Galaxy Clustering and Weak Lensing from DES Year 3 Data

We develop a framework to study the relation between the stellar mass of a galaxy and the total mass of its host dark matter halo using galaxy clustering and galaxy-galaxy lensing measurements. We model a wide range of scales, roughly from $\sim 100 \; {\rm kpc}$ to $\sim 100 \; {\rm Mpc}$, using a theoretical framework based on the Halo Occupation Distribution and data from Year 3 of the Dark Energy Survey (DES) dataset. The new advances of this work include: 1) the generation and validation of a new stellar mass-selected galaxy sample in the range of $\log M_\star/M_\odot \sim 9.6$ to $\sim 11.5$; 2) the joint-modeling framework of galaxy clustering and galaxy-galaxy lensing that is able to describe our stellar mass-selected sample deep into the 1-halo regime; and 3) stellar-to-halo mass relation (SHMR) constraints from this dataset. In general, our SHMR constraints agree well with existing literature with various weak lensing measurements. We constrain the free parameters in the SHMR functional form $\log M_\star (M_h) = \log(εM_1) + f\left[ \log\left( M_h / M_1 \right) \right] - f(0)$, with $f(x) \equiv -\log(10^{αx}+1) + δ[\log(1+\exp(x))]^γ/ [1+\exp(10^{-x})]$, to be $\log M_1 = 11.506^{+0.325}_{-0.404}$, $\log ε= -1.632^{+0.306}_{-0.181}$, $α= -1.638^{+0.108}_{-0.099}$, $γ= 0.596^{+0.251}_{-0.210}$ and $δ= 3.810^{+2.045}_{-1.811}$. The inferred average satellite fraction is within $\sim 5-35\%$ for our fiducial results and we do not see any clear trends with redshift or stellar mass. Furthermore, we find that the inferred average galaxy bias values follow the generally expected trends with stellar mass and redshift. Our study is the first SHMR in DES in this mass range, and we expect the stellar mass sample to be of general interest for other science cases.

Zacharegkas, G. [Argonne; Chicago U., KICP] (ORCID↗

A Quantum-Inspired Tensor Network Algorithm for Constrained Combinatorial Optimization Problems

Combinatorial optimization is of general interest for both theoretical study and real-world applications. Fast-developing quantum algorithms provide a different perspective on solving combinatorial optimization problems. In this paper, we propose a quantum-inspired tensor-network-based algorithm for general locally constrained combinatorial optimization problems. Our algorithm constructs a Hamiltonian for the problem of interest, effectively mapping it to a quantum problem, then encodes the constraints directly into a tensor network state and solves the optimal solution by evolving the system to the ground state of the Hamiltonian. We demonstrate our algorithm with the open-pit mining problem, which results in a quadratic asymptotic time complexity. Our numerical results show the effectiveness of this construction and potential applications in further studies for general combinatorial optimization problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗