Results for “ambiguities” — Page 25

DOE OSTI2020

Optimal PV Inverter Control in Distribution Systems via Data-Driven Distributionally Robust Optimization

Distribution systems with high penetration of uncertain solar generation call for advanced control strategies of photovoltaics (PVs) inverters. This paper proposes a data-driven distributionally robust optimization (DDDRO) approach to optimally controlling the PV inverters to improve the system operation performance under solar power uncertainties. In the proposed DDDRO approach, a Wasserstein ball-based method is proposed to construct the distributional ambiguity set to model the uncertainties of PV generation through partial observations of historical data without knowing exact probability distributions. We further reformulate the computationally intractable DDDRO model to a mixed integer second order cone programming (MISOCP) problem. The effectiveness and out-of-sample performance of the proposed approach have been demonstrated on a modified IEEE 33-node system. We conduct a comparative study to compare the proposed method with traditional chance constrained programming (CCP). It shows that the proposed DDDRO approach can provide a less conservative yet robust solution to minimize the worse-case expectation of the total network loss while maintaining nodal voltages in a secure range.

Xue, Yaosuo↗

DOE OSTI2021

“Frequency” and the PMU standard

The Phasor Measurement Unit (PMU) has revolutionized power system management by providing high-resolution, time-stamped, spatial, and temporal measure¬ments of the state of power systems. However, the standards defining the measured quantities have ambiguities that cause uncertainty, irreproducibility, and loss of interoperability during periods of change where the measurements should have the greatest value. This paper examines PMU frequency measurement to highlight the problems. It develops some suggestions for the scope and the next evolutionary improvements to the documentary standards. The aim is to improve the meaningfulness and trustworthiness of dynamic power system measurements.

Frequency, rate of change of frequency, definition↗

DOE OSTI2021

Nucleon Mass and Charges with Lattice Quantum Chromodynamics

Neutrino oscillation experiments are designed to measure neutrino masses and mixing parameters by scattering them off nuclei such as carbon, oxygen, and argon in detectors. Predictions of neutrino-nuclei cross sections from the Standard Model are needed to extract these parameters, but their theoretical uncertainties remain large due to the complexity of nuclear and hadronic physics. This situation needs to be improved in order to satisfy the precision needs of future experiments.In this dissertation, we focus on working towards a first-principles calculation of the nucleon axial form factor with lattice quantum chromodynamics (QCD). Nucleon axial form factor, which parametrizes the weak responses of a proton or neutron, is difficult to measure experimentally, and it is a dominant uncertainty in neutrino-nuclei cross-section calculations for incoming neutrino energies at around 1 GeV. So a theoretical calculation with lattice QCD provides a non-ambiguous determination of the form factor that could help reducing the uncertainty.The notorious signal-to-noise problem renders calculations of nucleon observables computationally intensive in lattice QCD. In this work, we investigate the use of staggered fermions in nucleon calculations. Staggered fermions are the most computationally efficient fermion discretization in lattice field theory, but certain theoretical issues have so far prevented their applications to nucleon physics. As a stepping stone towards a full calculation of the nucleon axial form factor, this dissertation provides a comprehensive theoretical framework on how to calculate the nucleon mass, vector charge, and axial charge with staggered fermions, together with numerical results demonstrating the methodology. This framework can be generalized to the form factor calculation that will appear in the near future.

Lin, Yin↗

DOE OSTI2021

Higher-order $\beta$-functions in the Standard Model and beyond

In this contribution we consider the recent computation of the gauge coupling $\beta$-function at four loops and the Yukawa matrix $\beta$-function at three loops in the most general, renormalizable and four-dimensional quantum field theory. Furthermore, we discuss ambiguities and divergences arising in Yukawa matrix $\beta$-functions.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2022

Summarizing experimental sensitivities of collider experiments to dark matter models and comparison to other experiments

Comparisons of the coverage of current and proposed dark matter searches can help us to understand the context in which a discovery of particle dark matter would be made. In some scenarios, a discovery could be reinforced by information from multiple, complementary types of experiments; in others, only one experiment would see a signal, giving only a partial, more ambiguous picture; in still others, no experiment would be sensitive and new approaches would be needed. In this whitepaper, we present an update to a similar study performed for the European Strategy Briefing Book performed within the dark matter at the Energy Frontier (EF10) Snowmass Topical Group We take as a starting point a set of projections for future collider facilities and a method of graphical comparisons routinely performed for LHC DM searches using simplified models recommended by the LHC Dark Matter Working Group and also used for the BSM and dark matter chapters of the European Strategy Briefing Book. These comparisons can also serve as launching point for cross-frontier discussions about dark matter complementarity.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2023

Search for Isoscalar Resonances in yp ¿ wnp AT GLUEX

The GlueX experiment has produced the world?s largest statistics for peripheral photoproduction of mesons with a goal to search for exotic mesons. This document presents results on the search for possible intermediate resonances which decay to ??. Little is known for the states seen in this decay channel such as the ?(1420) and ?(1650). This channel also allows to search for the never seen exotics JPC = 0??, 2+?, and the elusive 2??. The ?, in this reaction, is identified via the ?+???0 decay mode and the ? and ?0 are identified via the decay to 2?. Data from the GlueX Phase I was analyzed. This data was obtained at the Thomas Jefferson National Accelerator Facility utilizing the GlueX detector and a tagged linearly polarized photon beam incident on a liquid hydrogen target. A model using the expected major wave contributors, 1+? and 1??, shows two structure in the region where the ?(1420) and ?(1650) are expected. A third structure is seen at threshold with the quantum numbers of an h1 resonance, however, more studies are needed to assert the nature of this structure. Instabilities on the m = ±1 were shown to come from mathematical ambiguities. This only occurs between the m = 1 and m = ?1 projections when both reflectivities are present in close amount. Expanding the intensity equation for a single wave allows to extract coefficients that can help describe the data. A tangent study is also presented in this document which consists on a direct fit to the lineshape of an isolated N(1535). This baryonic resonance is well established, but its Breit-Wigner parameters have only been obtained from partial wave analysis. In contrast, this study obtained the Breit-Wigner parameters using a direct fit and finds the value of the width to be 70.5± 9.2 MeV; this is half of the accepted value.

Barriga, Edmundo↗

DOE OSTI2022

Fiber Bundle Morphisms as a Framework for Modeling Many-to-Many Maps

While it is not generally reflected in the `nice' datasets used for benchmarking machine learning algorithms, the real-world is full of processes that would be best described as many-to-many. That is, a single input can potentially yield many different outputs (whether due to noise, imperfect measurement, or intrinsic stochasticity in the process) and many different inputs can yield the same output (that is, the map is not injective). For example, imagine a sentiment analysis task where, due to linguistic ambiguity, a single statement can have a range of different sentiment interpretations while at the same time many distinct statements can represent the same sentiment. When modeling such a multivalued function $f: X \rightarrow Y$, it is frequently useful to be able to model the distribution on $f(x)$ for specific input $x$ as well as the distribution on fiber $f^{-1}(y)$ for specific output $y$. Such an analysis helps the user (i) better understand the variance intrinsic to the process they are studying and (ii) understand the range of specific input $x$ that can be used to achieve output $y$. Following existing work which used a fiber bundle framework to better model many-to-one processes we describe how morphisms of fiber bundles provide a template for building models which naturally capture the structure of many-to-many processes.

Coda, Elizabeth D.↗

DOE OSTI2023

Formally Verified ZTA Requirements for OT/ICS Environments with Isabelle/HOL: Preprint

The clean energy transformation led to the integration of distributed energy resources on a top of the grid, and so a substantial increase in the complexity of power grids infrastructure and the underlying operational technology environment. Operational technology environments are becoming a system of systems, integrating heterogeneous devices which are software/hardware intensive, have ever increasing demands to exploit advances in commodity of software/hardware infrastructures, and this for good reasons - improving energy systems requirements such as cybersecurity and resilience. In such a setting, system requirements at different levels mix, thus undesirable outcomes will surely happen. The use of formal methods will remove ambiguity, increase automation and provide high levels of assurance and reliability. In this paper, we contribute a methodology and a framework for the system level verification of zero trust architecture requirements in operational technology environments. We define a formal specification for the core functionalities of operational technology environments, the corresponding invariants, and security proofs. Of particular note is our modular approach for the formal verification of asynchronous interactions in operational technology environments. The formal specification and the proofs have been mechanized using the interactive theorem proving environment Isabelle/HOL.

formal methods↗

DOE OSTI2023

Terrain-aided position determination using range angle radar altimetry

Various embodiments described herein provide for a terrain-aided location determination using a range/angle radar altimetry. Range/angle radar systems use vertical synthetic aperture radar measurements which do not include any cross-track resolution, such that if a range/Doppler cloud from a single VSAR image is compared to a regular DEM, there can be ambiguity in determining the cross-track position. By modifying the DEM to inherently include additional terrain signature information that could be compared to VSAR measurement, the limitation can be overcome, and a single range/angle radar system can provide an accurate position without the additional complexity of a range/angle/angle radar system.

Sloan, George R.↗

DOE OSTI2024

Learning with Adaptive Conservativeness for Distributionally Robust Optimization: Incentive Design for Voltage Regulation: Preprint

Information asymmetry between the Distribution System Operator (DSO) and Distributed Energy Resource Aggregators (DERAs) obstructs designing effective incentives for voltage regulation. To capture this effect, we employ a Stackelberg game-theoretic framework, where the DSO seeks to overcome the information asymmetry and refine its incentive strategies by learning from DERA behavior over multiple iterations. We introduce a model-based online learning algorithm for the DSO, aimed at inferring the relationship between incentives and DERA responses. Given the uncertain nature of these responses, we also propose a distributionally robust incentive design model to control the probability of voltage regulation failure and then reformulate it into a convex problem. This model allows the DSO to periodically revise distribution assumptions on uncertain parameters in the decision model of the DERA. Finally, we present a gradient-based method that permits the DSO to adaptively modify its conservativeness level, measured by the size of a Wasserstein metric-based ambiguity set, according to historical voltage regulation performance. The effectiveness of our proposed method is demonstrated through numerical experiments.

distribution system operator↗

DOE OSTI2025

Power and Limitations of Linear Programming Decoder for Quantum LDPC Codes

Decoding quantum error-correcting codes is a key challenge in enabling fault-tolerant quantum computation. In the classical setting, linear programming (LP) decoders offer provable performance guarantees and can leverage fast practical optimization algorithms. Although LP decoders have been proposed for quantum codes, their performance and limitations remain relatively underexplored. In this work, we uncover a key limitation of LP decoding for quantum low-density parity-check (LDPC) codes: certain constant-weight error patterns lead to ambiguous fractional solutions that cannot be resolved through independent rounding. To address this issue, we incorporate a post-processing technique known as ordered statistics decoding (OSD), which significantly enhances LP decoding performance in practice. Our results show that LP decoding, when augmented with OSD, can outperform belief propagation with the same post-processing for intermediate code sizes of up to hundreds of qubits. These findings suggest that LP-based decoders, equipped with effective post-processing, offer a promising approach for decoding near-term quantum LDPC codes.

Gu, Shouzhen [Yale U.]↗

DOE OSTI2025

Power and Limitations of Linear Programming Decoder for Quantum LDPC Codes

Decoding quantum error-correcting codes is a key challenge in enabling fault-tolerant quantum computation. In the classical setting, linear programming (LP) decoders offer provable performance guarantees and can leverage fast practical optimization algorithms. Although LP decoders have been proposed for quantum codes, their performance and limitations remain relatively underexplored. In this work, we uncover a key limitation of LP decoding for quantum low-density parity-check (LDPC) codes: certain constant-weight error patterns lead to ambiguous fractional solutions that cannot be resolved through independent rounding. To address this issue, we incorporate a post-processing technique known as ordered statistics decoding (OSD), which significantly enhances LP decoding performance in practice. Our results show that LP decoding, when augmented with OSD, can outperform belief propagation with the same post-processing for intermediate code sizes of up to hundreds of qubits. These findings suggest that LP-based decoders, equipped with effective post-processing, offer a promising approach for decoding near-term quantum LDPC codes.

Gu, Shouzhen [Yale U.]↗

DOE OSTI2026

One Man’s Pirate is Another Man’s . . . Nuclear Terrorist? Evaluating the Act of Piracy Against Floating Nuclear Power Plants on the High Seas

The lack of international consensus about whether a floating nuclear power plant is a facility or vessel presents an ambiguity about a pirate's status if they board a floating nuclear power plant, As piracy continues to be a concern for maritime security, the deployment of floating nuclear power plants (FNPPs) on the high seas raises questions about laws on piracy.

Fialkoff, Marc [Oak Ridge National Laboratory (ORN↗

DOE OSTI2026

Discovery and Spectroscopic Characterization of a Distant, Compact Milky Way Satellite in Gemini

We present the discovery of a compact Milky Way satellite in the constellation of Gemini. This system was discovered by cross-matching detections from two independent search algorithms applied to Blanco/DECam data from the third data release of the DECam Local Volume Exploration survey (DELVE DR3), and confirmed with deeper imaging from Gemini/GMOS-N. Based on these data, we determine that the system is an ultra-faint ($M_V = -2.1^{+0.4}_{-0.6}$), compact ($r_{1/2} = 8.6^{+1.4}_{-1.2}$ pc) system located at a heliocentric distance of $120^{+7}_{-6}$ kpc. These physical properties place the system in the regime of ambiguous, ultra-faint compact Milky Way halo satellites that cannot be confidently classified as dwarf galaxies or star clusters from morphology alone; we therefore name the system DELVE 8/Gemini I. From medium-resolution Keck/DEIMOS spectroscopy, we securely identify four members including two blue horizontal branch stars, confirming the system as a bound satellite moving at a mean radial velocity of $v_{\rm hel} = -82.7^{+3.7}_{-3.9} {\rm km\,s}^{-1}$. We also use these spectra to place an upper limit of $\rm [Fe/H] \lesssim -2.5$ on the metallicity of DELVE 8/Gemini I's brightest star, supporting the classification of the system as either an ancient star cluster or ultra-faint dwarf galaxy. The discovery of faint, distant systems similar to DELVE 8/Gemini I is expected to become more common with upcoming surveys.

Overdeck, K. [Chicago U., Astron. Astrophys. Ctr.;↗

DOE OSTI2025

Power and Limitations of Linear Programming Decoder for Quantum LDPC Codes

Decoding quantum error-correcting codes is a key challenge in enabling fault-tolerant quantum computation. In the classical setting, linear programming (LP) decoders offer provable performance guarantees and can leverage fast practical optimization algorithms. Although LP decoders have been proposed for quantum codes, their performance and limitations remain relatively underexplored. In this work, we uncover a key limitation of LP decoding for quantum low-density parity-check (LDPC) codes: certain constant-weight error patterns lead to ambiguous fractional solutions that cannot be resolved through independent rounding. To address this issue, we incorporate a post-processing technique known as ordered statistics decoding (OSD), which significantly enhances LP decoding performance in practice. Our results show that LP decoding, when augmented with OSD, can outperform belief propagation with the same post-processing for intermediate code sizes of up to hundreds of qubits. These findings suggest that LP-based decoders, equipped with effective post-processing, offer a promising approach for decoding near-term quantum LDPC codes.

Gu, Shouzhen [Yale U.]↗