Search NASA⌕ Search

SEARCH · Search NASA

Results for “Euclidean”

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 253 records · Page 14

Investigating the Transverse Structure of Hadrons Using Parton Pseudodistributions

Within the pseudo-PDF framework, we investigate the perturbative contributions to correlators that are used to study transverse momentum dependent parton distributions (TMDs) on the lattice. Our results contain the full perturbative corrections which arise as artifacts from performing the calculation for a Euclidean separation between the parton fields, as well as the corrections which yield the evolution equations for the TMDs. This gives a path to extraction of the genuine non-perturbative features of the three-dimensional structure of the hadrons from lattice calculations.

Santiago, Melvin Gabriel [Old Dominion Univ., Norf↗

AI-Assisted Conceptual Development of a Pre-Geometric Cosmological Model - An Exercise in AI-Assisted Conceptual Framework Generation, Paper II: Local Geometry and Metric Structure

This paper develops the geometric sector of the replication-driven cosmogenesis framework introduced in Paper I. Starting from a pre-geometric spectral substrate and a minimal set of replication axioms, we show how coherent self-replicating units generate a spatial adjacency graph whose continuum limit acquires an effective Riemannian structure. The replication dynamics determines a characteristic correlation length that seeds the local metric, while overlap relations among coherent units produce an isotropic neighborhood geometry with an emergent dimensionality $d_{\rm eff}\simeq 3$ across a broad range of replication factors. As replication slows and causal order stabilizes, a limiting signal speed $c_\ast$ appears, providing the basis for the Lorentzian structure of spacetime without assuming a pre-existing light cone. We derive conditions under which the adjacency graph converges to a smooth three-dimensional manifold, describe the transition from Euclidean to Lorentzian propagation, and identify geometric invariants controlled by the replication parameters. This work establishes the geometric and causal layer of the replication cosmogenesis program, bridging the spectral axioms of Paper I to the cosmological dynamics explored in Paper III.

79 ASTRONOMY AND ASTROPHYSICS↗

Effect of realistic routing on the social burden metric

The distance people travel to reach critical services is a key input to the Social Burden metric used by Sandia’s Resilient Node Cluster Analysis Tool (ReNCAT) in the optimization’s objective function. By default, ReNCAT utilizes Euclidian distances between population blocks and critical facilities when calculating Social Burden. However, these straight-line distances do not reflect how most residents or goods would travel throughout the area. As distance is a vital input to the burden calculation, a more realistic distance calculation will yield more realistic burden values. This work uses real road networks and calculates the shortest distance path between population centers and critical facilities using a standard graph theory approach. These realistic route distances are then used to compute Social Burden for four areas of study. It was found that distances using real road routes are generally, but not always, longer than the Euclidean distance. The increased length increases the final Social Burden metric, however, the overall burden percent change ranged between 17% and 52%, which means the impact of realistic routes relies heavily upon the area’s road topology. It was found that rural locations within an area may have larger burden increases than urban areas as more dense road networks allow routes to more closely follow a straight-line path. Additionally, using the most straight forward routing algorithms requires high computational effort for areas with large road networks. While it is believed this process can be made more performant, that task is beyond this scope of work.

99 GENERAL AND MISCELLANEOUS↗

Lattice Observables for Parton Distributions

In recent years there has been a momentous surge of interest in the determination of the parton content of nucleons using lattice QCD. Scalar field theory is a convenient toy model to understand the relation between Euclidean correlators and Parton Distribution Functions (PDFs). In this talk we review the factorization formulae that allow the extraction of PDFs from the pseudo-PDFs and quasi-PDFs computed on the lattice. The scalar theory provides a simplified setting where the main physical properties are easily analysed.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Three-pion effects in $K^0-\bar{K}^0$ mixing

The rate of mixing between a neutral kaon and an anti-kaon ($K^0$-$\bar{K}^0$) is given, in part, by a long-range matrix element, defined with two insertions of the weak Hamiltonian separated by physical, Minkowski time evolution. For physical quark masses, the kaon mass lies above the two- and three-pion thresholds and, as a result, this long-range matrix element receives contributions from intermediate on-shell $2\pi$ and $3\pi$ states. These contributions cannot easily be captured in a finite Euclidean spacetime, meaning that such matrix elements are not directly accessible via lattice QCD. In this talk, we present a strategy for combining quantities that can be extracted in numerical lattice QCD calculations in order to reproduce the physical, infinite-volume long-range amplitude for $K^0-\bar{K}^0$. The key novelty relative to published work is that we fully include the effects of three-particle states that were previously neglected. The strategy is built on existing formalism for long-range matrix elements with two-particle intermediate states, together with the relativistic-field-theory finite-volume formalism for extracting three-hadron weak decays.

Jackura, Andrew↗

Photon production rate from Transverse-Longitudinal ( T – L) mesonic correlator on the lattice

Thermal photons from the QGP provide important information about the interaction among plasma constituents. The photon production rate from a thermally equilibrated system is proportional to the transverse spectral function ρ T (ω = |k → |,k → ). One can also calculate the photon production rate from the difference between ρ T (ω, k → ) (transverse) and ρ L (ω, k → ) (longitudinal) projections, as ρL vanishes on the photon point. Because the UV part of ρ T – ρ L is suppressed, the corresponding Euclidean correlator receives most of its contribution from the IR part. We calculate the T – L correlator on N f = 2 + 1 flavour HISQ configurations with m l = m s /5 at temperature of about 1.15T ρc (220 MeV). We have used two ansätze for the spectral function: 1) A polynomial connected to the UV region consistent with OPE expansion and 2) a hydro-inspired spectral function. We have also applied the Backus-Gilbert method to estimate the spectral function. All these different approaches are combined to estimate the photon production rate.

Bala, Dibyendu↗

Uncertainty Quantification in CO2 Trapping Mechanisms: A Case Study of PUNQ-S3 Reservoir Model Using Representative Geological Realizations and Unsupervised Machine Learning

Evaluating uncertainty in CO2 injection projections often requires numerous high-resolution geological realizations (GRs) which, although effective, are computationally demanding. This study proposes the use of representative geological realizations (RGRs) as an efficient approach to capture the uncertainty range of the full set while reducing computational costs. A predetermined number of RGRs is selected using an integrated unsupervised machine learning (UML) framework, which includes Euclidean distance measurement, multidimensional scaling (MDS), and a deterministic K-means (DK-means) clustering algorithm. In the context of the intricate 3D aquifer CO2 storage model, PUNQ-S3, these algorithms are utilized. The UML methodology selects five RGRs from a pool of 25 possibilities (20% of the total), taking into account the reservoir quality index (RQI) as a static parameter of the reservoir. To determine the credibility of these RGRs, their simulation results are scrutinized through the application of the Kolmogorov–Smirnov (KS) test, which analyzes the distribution of the output. In this assessment, 40 CO2 injection wells cover the entire reservoir alongside the full set. The end-point simulation results indicate that the CO2 structural, residual, and solubility trapping within the RGRs and full set follow the same distribution. Simulating five RGRs alongside the full set of 25 GRs over 200 years, involving 10 years of CO2 injection, reveals consistently similar trapping distribution patterns, with an average value of Dmax of 0.21 remaining lower than Dcritical (0.66). Using this methodology, computational expenses related to scenario testing and development planning for CO2 storage reservoirs in the presence of geological uncertainties can be substantially reduced.

Mahjour, Seyed Kourosh↗

Canonical Transformation of Potential Model Hamiltonian Mechanics to Geometrical Form I

Using the methods of symplectic geometry, we establish the existence of a canonical transformation from potential model Hamiltonians of standard form in a Euclidean space to an equivalent geometrical form on a manifold, where the corresponding motions are along geodesic curves. The advantage of this representation is that it admits the computation of geodesic deviation as a test for local stability, shown in recent previous studies to be a very effective criterion for the stability of the orbits generated by the potential model Hamiltonian. We describe here an algorithm for finding the generating function for the canonical transformation and describe some of the properties of this mapping under local diffeomorphisms. We give a convergence proof for this algorithm for the one-dimensional case, and provide a precise geometric formulation of geodesic deviation which relates the stability of the motion in the geometric form to that of the Hamiltonian standard form. We apply our methods to a simple one-dimensional harmonic oscillator and conclude with a discussion of the relation of bounded domains in the two representations for which Morse theory would be applicable.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Improving the Precision of First-Principles Calculation of Parton Physics from Lattice Quantum Chromodynamics

Large momentum effective theory (LaMET) provides a general framework for computing the multi-dimensional partonic structure of the proton from first principles using lattice quantum chromodynamics (QCD). In this effective field theory approach, LaMET predicts parton distributions through a power expansion and perturbative matching of a class of Euclidean observables—quasi-distributions—evaluated at large proton momenta. Recent advances in lattice renormalization, such as the hybrid scheme with leading renormalon resummation, together with improved matching kernel that incorporates higher-loop corrections and resummations, have enhanced both the perturbative and power accuracy of LaMET, enabling a reliable quantification of theoretical uncertainties. Moreover, the Coulomb-gauge correlator approach further simplifies lattice analyses and improves the precision of transverse-momentum-dependent structures, particularly in the non-perturbative region. State-of-the-art LaMET calculations have already yielded certain parton observables with important phenomenological impact. In addition, the recently proposed kinematically enhanced lattice interpolation operators promise access to unprecedented proton momenta with greatly improved signal-to-noise ratios, which will extend the range of LaMET prediction and further suppress the power corrections. The remaining challenges, such as controlling excited-state contamination in lattice matrix elements and extracting gluonic distributions, are expected to benefit from emerging lattice techniques for ground-state isolation and noise reduction. Thus, lattice QCD studies of parton physics have entered an exciting stage of precision control and systematic improvement, which will have a broader impact for nuclear and particle experiments.

Zhao, Yong [Argonne National Laboratory (ANL), Arg↗

The Fate of Nucleated Black Holes in de Sitter Quantum Gravity

The Euclidean Nariai geometry has long been proposed as the instanton describing the nucleation of maximal-mass black holes in de Sitter space. We place this interpretation on firmer footing by showing that, once an observer is included, the gravitational path integral produces the imaginary phase required for a transition rate. As a warmup, we revisit the Hawking-Moss instanton and, as a byproduct, find that scalar fields can enhance black-hole nucleation, suggesting a quantum-gravity bound on scalar potentials with de Sitter solutions. We then study the subsequent semiclassical evolution of the nucleated black hole. We show that the previously claimed "anti-evaporation" channel is unphysical, arising from a quantum state with singular horizons. In a smooth state, the black hole instead undergoes standard thermal Hawking evaporation. We verify explicit agreement with the no-boundary state and argue that this evaporation is not subject to large quantum-gravity corrections. The nucleated black hole thus evaporates completely back to the maximally-entropic empty de Sitter vacuum, making the full process a Boltzmann fluctuation.

FOS: Physical sciences↗

A network approach for multiscale catchment classification using traits

Abstract. The classification of river catchments into groups with similar biophysical characteristics is useful to understand and predict their hydrological behavior. The increasing availability of remote sensing and other large-scale geospatial datasets has enabled the use of advanced data-driven approaches to classify catchments using traits such as topography, geology, climate, land cover, land use, and human influence. Unsupervised clustering algorithms based on the Euclidean distance are commonly used for trait-based classification but are not suitable for highly dimensional data. In this study we present a new network-based method for multi-scale catchment classification, which can be applied to large datasets and used to determine the traits associated with different catchment groups. In this framework, two networks are analyzed in parallel: the first being where the nodes are traits and the second being where the nodes are catchments. In both cases, edges represent pairwise similarity, and a network cluster detection algorithm is used for the classification. The trait network is used to investigate redundancy in the trait data and to condense this information into a small number of interpretable categories. The catchments network is used to classify the catchments into clusters and to identify representative catchments for the different groups using the degree centrality metric. We apply this method to classify 9067 river catchments across the contiguous United States at both regional and continental scales using 274 non-categorical traits. At the continental scale, we identify 25 interpretable trait categories and 34 catchment clusters of sizes greater than 50. We find that catchments with similar trait categories are typically located in the same region, with different spatial patterns emerging among clusters dominated by natural and anthropogenic traits. We also find that the catchment clusters exhibit distinct hydrological behavior based on an analysis of streamflow indices. This network approach provides several advantages over traditional means of classification, including better separation of clusters, the use of alternate similarity metrics that are more suitable for highly dimensional data, and reducing redundancy in the trait information. The paired catchment–trait networks enable analysis of hydrological behavior using the dominant trait categories for each catchment cluster. The approach can be used at multiple spatial scales since the network topologies adjust automatically to reflect the trait patterns at the scale of investigation. Finally, the representative catchments identified as hub nodes in the network can be used to guide transferable observational and modeling strategies. The method is broadly applicable beyond hydrology for classification of other complex systems that utilize different types of trait datasets.

54 ENVIRONMENTAL SCIENCES↗

Extending Shared Socioeconomic Pathways to Future Water Supply In-frastructure Scenarios: A Case Study of San Antonio, TX

Datasets supporting findings and visualization behind Okoye and McManamay (2025) Extending Shared Socioeconomic Pathways to Future Water Supply Infrastructure Scenarios: A Case Study of San Antonio, TX. Environmental Research Communications, DOI: 10.57931/2563186 These datasets contains the results of a site selection analysis for municipal water supply planning across multiple Shared Socioeconomic Pathways (SSPs 1–5) and hard scenario classification of water systems in San Antonio, TX. It includes data at the resolution of individual surface water supply sources (COMIDs) and integrates a wide range of hydrologic, socioeconomic, infrastructural, and scenario-based planning variables. Please refer to the README file provided in Files for more details. Descriptions of the datasets are provided below. Dataset(s) Descriptions: Dataset_SSP1_SSP4.xlsx - Contains data used for site selection optimization under SSP1 to SSP4. This dataset was generated based on multi-indicator computations (e.g., WAI, WQI, ERI, WTC, WIC), scenario demand projections, and resource and spatial constraints, excluding new reservoir values. Dataset_SSP5.xlsx - Used for site optimization under SSP5. Unlike Dataset_SSP1_SSP4, this dataset includes new reservoir features with updated calculations of WAI, WTC, and WIC to reflect the added infrastructure and supply potential. hard_classification.xlsx - Provides the scenario classification output for each site. Includes both the initial scenario classification based on Euclidean Distance and adjusted classifications based on 30% change reduction BAU.zip - Zipped folder of .shp files showing spatially optimized water supply sites per SSP under the Business-As-Usual (BAU) water demand strategy LowGW.zip - Zipped folder of .shp files showing optimized site selections under the Low Groundwater strategy

geospatial↗

Utility-scale Building Type Assignment Using Smart Meter Data

United States building energy use accounted for 40% of total energy use, 74% of peak demand, and $412 billion in 2019. Building energy modeling allows researchers to simulate building physics, gain insights into possible energy/demand saving opportunities, and assess cost-effective resilience amidst climate change. Many building features needed to create building energy models are readily available such as 2D footprints and LiDAR (height). A critical feature that is not generally obtainable is the building type. In partnership with a utility, a years worth of real-world, 15-minute electrical use data has been examined. The smart meter data is compared to 97 different prototype building energy models to assign building type. Real-world considerations including data preparation, quality assurance, and handling of missing values for advanced metering infrastructure data are addressed. Euclidean distance for pattern-matching of energy use, dynamic time warping, and time-window statistics with machine learning are compared for determining building type from measured electricity use.

Bass, Brett↗

Integer Sequences from Configurations in the Hausdorff Metric Geometry via Edge Covers of Bipartite Graphs

The Hausdorff metric provides a way to measure the distance between nonempty compact sets in $\mathbb{R}^N$, from which we can build a geometry of sets. This geometry is very different than the standard Euclidean geometry and provides many interesting results. In this paper we focus on line segments in this geometry, where pairs of disjoint sets $A$ and $B$ satisfying certain distance conditions have the property that there are exactly $m$ different sets on the line segment $\overline{AB}$ at every distance from $A$, where $m$ can assume many values different than one. We provide new families of sets that generate previously unrecorded integer sequences via these values of $m$ by connecting the values of $m$ to the number of edge coverings of a graph corresponding to the sets $A$ and $B$.

97 MATHEMATICS AND COMPUTING↗

Topological terms with qubit regularization and relativistic quantum circuits

Qubit regularization provides a rich framework to explore quantum field theories. The freedom to choose how the important symmetries of the theory are embedded in the qubit regularization scheme allows us to construct new lattice models with rich phase diagrams. Some of the phases can contain topological terms which lead to critical phases. In this work we introduce and study the SU(3)-F qubit regularization scheme to embed the SO(3) spin-symmetry. We argue that qubit models in this regularization scheme contain several phases including a critical phase which describes the k = 1 Wess-Zumino-Witten (WZW) conformal field theory (CFT) at long distances, and two massive phases one of which is trvially gapped and the other which breaks the lattice translation symmetry. We construct a simple space-time Euclidean lattice model with a single coupling U and study it using the Monte Carlo method. We show the model has a critical phase at small U and a trivially massive phase at large U with a first order transition separating the two. Another feature of our model is that it is symmetric under space-time rotations, which means the temporal and spatial lattice spacing are connected to each other. The unitary time evolution operator obtained by a Wick rotation of the transfer matrix of our model can help us compute the physics of the k = 1 WZW CFT in real time without the need for tuning the temporal lattice spacing to zero. We use this idea to introduce the concept of a relativistic quantum circuit on a discrete space-time lattice.

Bhattacharya, Tanmoy↗

Riemannian Optimization Applied to AC Optimal Power Flow

The nonlinear, nonconvex AC optimal power flow problem is of growing importance as the nature of the power grid evolves. This problem can be difficult to solve for interior point methods. However, the advent of optimization algorithms over smooth Riemannian manifolds presents an alternative approach. The nonlinear, nonconvex constraints in the AC power flow problem form an embedded submanifold of Euclidean space. In this paper, the authors explore the performance of Riemannian optimization algorithms for the ACOPF problem where the optimization is performed directly on the AC power flow manifold. This is done by using the Julia programming language and the Julia packages PowerModels.jl and Manopt.jl.

AC optimal power flow↗

Conflict Detection in Open RAN with Recurrent Neural Networks Using Geometric Manifolds

Allowing third-party applications on Radio Access Network (RAN) Intelligent Controllers (RICs) within the OpenRAN (O-RAN) framework introduces conflicting interactions that are often difficult to detect in advance. These conflicts, occurring between third-party applications in the Near RealTime RIC (Near-RT RIC), known as xApps, can lead to performance degradation and instability in O-RAN if not identified early. Existing conflict detection and mitigation solutions in the literature assume that the conflicts are known beforehand, which is not always accurate due to the complex and often hidden relationships between control parameters and Key Performance Indicators (KPIs). In this paper, we propose a novel Recurrent Neural Network (RNN) to detect both known and unknown conflicts in O-RAN xApps as specified in the O-RAN standards. We model the xApps, control parameters, and KPIs with nodes and edges to create graph structures and use the hidden nonEuclidean geometric properties of the Riemannian manifold to train the RNN model. The performance of this proposed model is validated using evaluation metrics and compared with benchmarks. Results demonstrate that the proposed RNN model, leveraging Riemannian geometric properties, can achieve 100% of the F1-score provided by an optimal solution in just 20 iterations.

5G↗

Conflict Detection in Open RAN with Recurrent Neural Networks Using Geometric Manifolds

Allowing third-party applications on Radio Access Network (RAN) Intelligent Controllers (RICs) within the OpenRAN (O-RAN) framework introduces conflicting interactions that are often difficult to detect in advance. These conflicts, occurring between third-party applications in the Near RealTime RIC (Near-RT RIC), known as xApps, can lead to performance degradation and instability in O-RAN if not identified early. Existing conflict detection and mitigation solutions in the literature assume that the conflicts are known beforehand, which is not always accurate due to the complex and often hidden relationships between control parameters and Key Performance Indicators (KPIs). In this paper, we propose a novel Recurrent Neural Network (RNN) to detect both known and unknown conflicts in O-RAN xApps as specified in the O-RAN standards. We model the xApps, control parameters, and KPIs with nodes and edges to create graph structures and use the hidden nonEuclidean geometric properties of the Riemannian manifold to train the RNN model. The performance of this proposed model is validated using evaluation metrics and compared with benchmarks. Results demonstrate that the proposed RNN model, leveraging Riemannian geometric properties, can achieve 100% of the F1-score provided by an optimal solution in just 20 iterations.

5G↗