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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 235 records · Page 13

All sources NASA NTRS DOE OSTI

DOE OSTI2022

Wigner meets ’t Hooft near the black hole horizon

Recent work on Euclidean quantum gravity, black hole thermodynamics, and the holographic principle has seen the return of random matrix models as a powerful tool. It is explained how they allow for the study of the physics well beyond the perturbative expansion. In fact, a fully nonperturbative treatment naturally unites the familiar approach of summing over smooth geometries of all topologies with the statistical approach to characterize the typical properties of a Hamiltonian. Remarkably, this leads to an explicit excavation of the underlying microstates of quantum gravity that has applications to the low-temperature dynamics of a large class of black holes.

Astronomy & Astrophysics↗

DOE OSTI2020

Dynamic Importance Sampling

Dynamic Importance (DynIm) Sampling is a new approach for importance sampling in high-dimensional space. DynIm has two key characteristics. (1) Importance sampling: The notion of importance of candidate samples is used to guide the sampling, where importance is defined based on the (dis)similarity from previously selected samples (via Euclidean distance metric). (2) Dynamic sampling: The sampling can be performed dynamically, as new candidates are generated and new samples must be selected. DynIm was developed as part of a machine learning based coupling of scales in large multiscale simulations and can be used for a variety of applications.

Bhatia, Harsh↗

DOE OSTI2021

e3nn tutorial v0.2

Repository and website for tutorials on 3d Euclidean equivariant neural networks.

Smidt, Tess↗

DOE OSTI2025

Clustering Algorithm for AM Parts using GSH and EDT with Autoencoder

SAND2025-10103O The Clustering Algorithm for AM Parts Using GSH and (EDT With Autoencoder is a software tool. It uses a clustering algorithm for additive manufacturing (AM) parts using generalized spherical harmonics (GSH) and Euclidean distance transform (EDT) with an autoencoder to quantify material microstructure. The tool offers improved sensitivity to microstructural changes compared to traditional approaches. The tool integrates multiple microstructural properties, such as grain morphology, crystallographic orientation, and material phase information, to provide a comprehensive analysis of material microstructures. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.

Rodgers, Theron [Sandia National Lab. (SNL-CA), Li↗

DOE OSTI2025

Catalyst-Vision (PEM Catalyst Layer Image Analysis Tool) [SWR-25-100]

Catalyst-Vision (PEM Catalyst Layer Image Analysis Tool) provides an advanced Python-based tool, primarily designed for use in a Jupyter/Colab notebook, for the quantitative morphological analysis of pre-segmented shapes. While developed for analyzing PEM catalyst layers from microscopy, its methodology is suitable for characterizing any grayscale object provided on a uniform white background. The tool uses a robust computer vision pipeline based on the Euclidean Distance Transform and skeletonization to accurately measure local thickness and tortuosity, providing a comprehensive characterization of an object's geometry and internal texture. If you find this code useful, please cite our preprint as: Chan, Ai-Lin and Hayden, Steven and Harvey, Steven P. and Smeaton, Michelle and Okrucky, Caleb and Watt, John and Ulična, Soňa and Spurgeon, Steven and Jungjohann, Katherine and Alia, Shaun, Mechanism-informed breakdown: understanding degradation by controlling voltage hold patterns in PEM water electrolyzers. Preprint (2025).

Spurgeon, Steven [National Laboratory of the Rocki↗

DOE OSTI2023

Influences of cloud vertical overlapping on the calculated cloud albedo and their validation with satellite observations

Cloud albedo is expected to influence cloud radiative forcing in addition to cloud fraction, and inadequate description of the cloud overlapping effects on the cloud fraction may influence the simulated cloud fraction, and thus the relative cloud radiative forcing (RCRF) and cloud albedo. In this study, we first present a new formula by extending that presented previously in Liu et al. (2011) to consider multilayer clouds directly in the relationship between cloud albedo, cloud fraction and RCRF, and then quantitatively evaluate the effects of different cloud vertical overlapping structures, represented by the decorrelation length scales (L cf ), on the simulated cloud albedos. We use the BCC_AGCM2.0_CUACE/Aero model with simultaneous validation by observations from the Clouds and the Earth's Radiation Energy System (CERES) satellite. When L cf < 4 km (i.e., the cloud overlap is closer to the random overlap), the simulated cloud albedos are generally in good agreement with the satellite-based albedos for December– February and June–August; when L cf ≥ 4 km (i.e., the cloud vertical overlap is closer to the maximum overlap), the difference between simulated and observed cloud albedos became larger, due mainly to significant differences in cloud fractions and RCRF. Further quantitative analysis shows that the relative Euclidean distance, which represents the degree of overall model–observation disagreement, increases with the L cf for all three variables (cloud albedo, cloud fraction and RCRF), indicating the importance of cloud vertical overlapping in determining the accuracy of the calculated cloud albedo for multilayer clouds.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2023

Structure-informed clustering for population stratification in association studies

Background: Identifying variants associated with complex traits is a challenging task in genetic association studies due to linkage disequilibrium (LD) between genetic variants and population stratification, unrelated to the disease risk. Existing methods of population structure correction use principal component analysis or linear mixed models with a random effect when modeling associations between a trait of interest and genetic markers. However, due to stringent significance thresholds and latent interactions between the markers, these methods often fail to detect genuinely associated variants. Results: To overcome this, we propose CluStrat, which corrects for complex arbitrarily structured populations while leveraging the linkage disequilibrium induced distances between genetic markers. It performs an agglomerative hierarchical clustering using the Mahalanobis distance covariance matrix of the markers. In simulation studies, we show that our method outperforms existing methods in detecting true causal variants. Applying CluStrat on WTCCC2 and UK Biobank cohorts, we found biologically relevant associations in Schizophrenia and Myocardial Infarction. CluStrat was also able to correct for population structure in polygenic adaptation of height in Europeans. Conclusions: CluStrat highlights the advantages of biologically relevant distance metrics, such as the Mahalanobis distance, which captures the cryptic interactions within populations in the presence of LD better than the Euclidean distance.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2020

General Bayesian Inference over the Stiefel Manifold via the Givens Transform

We introduce here an approach based on the Givens representation for posterior inference in statistical models with orthogonal matrix parameters, such as factor models and probabilistic principal component analysis (PPCA). We show how the Givens representation can be used to develop practical methods for transforming densities over the Stiefel manifold into densities over subsets of Euclidean space. We demonstrate how to deal with issues arising from the topology of the Stiefel manifold and how to inexpensively compute the change-of-measure terms. We introduce an auxiliary parameter approach that limits the impact of topological issues. We provide both analysis of our methods and numerical examples demonstrating the effectiveness of the approach. We also discuss how our Givens representation can be used to define general classes of distributions over the space of orthogonal matrices. We then give demonstrations on several examples showing how the Givens approach performs in practice in comparison with other methods.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Enabling Real-Time Communication in Multi-Agent Systems: A Graph Neural Network Based Approach

Global connectivity enables effective coordination in Multi-Agent Systems (MAS). Solving these connection problems under hardware constraints is an NP-hard non-Euclidean Degree Constrained Minimum Spanning Tree (DCMST) problem. Prior MAS controllers coordinate team movement for task completion and collision avoidance; some considering Line-of-Sight (LOS) maintenance but prioritizing flexibility over guarantees. Evolutionary Algorithms (EA) have been shown to find good solutions for DCMST, but their performance degrades with larger populations required to support a large MAS. We present a method based on edge graph attention networks, trained offline to reduce online computation times. Empirical comparisons with greedy polynomial-time solvers and EA show that our method leverages latent graph information to consistently find constraint-satisfying solutions in less time.

connectivity maintenance↗

DOE OSTI2024

Using spatio-temporal graph neural networks to estimate fleet-wide photovoltaic performance degradation patterns

Accurate estimation of photovoltaic (PV) system performance is crucial for determining its feasibility as a power generation technology and financial asset. PV-based energy solutions offer a viable alternative to traditional energy resources due to their superior Levelized Cost of Energy (LCOE). A significant challenge in assessing the LCOE of PV systems lies in understanding the Performance Loss Rate (PLR) for large fleets of PV systems. Estimating the PLR of PV systems becomes increasingly important in the rapidly growing PV industry. Precise PLR estimation benefits PV users by providing real-time monitoring of PV module performance, while explainable PLR estimation assists PV manufacturers in studying and enhancing the performance of their products. However, traditional PLR estimation methods based on statistical models have notable drawbacks. Firstly, they require user knowledge and decision-making. Secondly, they fail to leverage spatial coherence for fleet-level analysis. Additionally, these methods inherently assume the linearity of degradation, which is not representative of real world degradation. To overcome these challenges, we propose a novel graph deep learning-based decomposition method called the Spatio-Temporal Graph Neural Network for fleet-level PLR estimation (PV-stGNN-PLR). PV-stGNN-PLR decomposes the power timeseries data into aging and fluctuation components, utilizing the aging component to estimate PLR. PV-stGNN-PLR exploits spatial and temporal coherence to derive PLR estimation for all systems in a fleet and imposes flatness and smoothness regularization in loss function to ensure the successful disentanglement between aging and fluctuation. We have evaluated PV-stGNN-PLR on three simulated PV datasets consisting of 100 inverters from 5 sites. Experimental results show that PV-stGNN-PLR obtains a reduction of 33.9% and 35.1% on average in Mean Absolute Percent Error (MAPE) and Euclidean Distance (ED) in PLR degradation pattern estimation compared to the state-of-the-art PLR estimation methods.

14 SOLAR ENERGY↗

DOE OSTI2022

Effectiveness of Deep Learning Trained on SynthCity Data for Urban Point-Cloud Classification

3D object recognition is one of the most popular areas of study in computer vision. Many of the more recent algorithms focus on indoor point clouds, classifying 3D geometric objects, and segmenting outdoor 3D scenes. One of the challenges of the classification pipeline is finding adequate and accurate training data. Hence, this article seeks to evaluate the accuracy of a synthetically generated data set called SynthCity, tested on two mobile laser-scan data sets. Varying levels of noise were applied to the training data to reflect varying levels of noise in different scanners. The chosen deep-learning algorithm was Kernel Point Convolution, a convolutional neural network that uses kernel points in Euclidean space for convolution weights.

Geology↗

DOE OSTI2022

String correlators on $\text{AdS}_3$: Analytic structure and dual CFT

We continue our study of string correlators on Euclidean \text{AdS}_3 AdS 3 with pure NS-NS flux. The worldsheet and spacetime correlators have a rich analytic structure, which we analyse completely for genus 0 four-point functions. We show that correlators exhibit a simple behaviour near their singularities. The spacetime correlators are meromorphic functions in the \mathrm{SL}(2,\mathbb{R}) S L ( 2 , ℝ ) -spins, whose pole structure is shown to agree with the prediction of a recent proposal for the dual \text{CFT}_2 CFT 2 . Moreover, we also compute the residues of the spacetime correlators for some of the poles exactly and find again a perfect match with the proposal for the dual \text{CFT}_2 CFT 2 , thereby checking the duality for some non-trivial four-point functions exactly. Our computations simplify drastically in the tensionless limit of \mathrm{AdS}_3 \times \mathrm{S}^3 \times \mathbb{T}^4 A d S 3 × S 3 × 𝕋 4 where the behaviour near the poles gives in fact the exact answer. This paper is the third in a series with several installments.

74 ATOMIC AND MOLECULAR PHYSICS↗

DOE OSTI2024

Non-chiral vertex operator algebra associated to Lorentzian lattices and Narain CFTs

Frenkel, Lepowsky, and Meurman constructed a vertex operator algebra (VOA) associated to any even, integral, Euclidean lattice. In the language of physics, these are examples of chiral conformal field theories (CFT). In this paper, we define non-chiral vertex operator algebra and some associated notions. We then give a construction of a non-chiral VOA associated to an even, integral, Lorentzian lattice and construct their irreducible modules. We obtain the moduli space of such modular invariant non-chiral CFTs based on even, self-dual Lorentzian lattices of signature (m,n) ( m , n ) assuming the validity of a technical result about automorphisms of the lattice. We finally show that Narain conformal field theories in physics are examples of non-chiral VOA. Our formalism helps us to identify the chiral algebra of Narain CFTs in terms of a particular sublattice and give us the decomposition of its partition function into sum of characters.

Singh, Ranveer Kumar (ORCID:000000026385704X)↗

DOE OSTI2024

Lorentzian contours for tree-level string amplitudes

We engineer compact contours on the moduli spaces of genus-zero Riemann surfaces that achieve analytic continuation from Euclidean to Lorentzian worldsheets. These generalized Pochhammer contours are based on the combinatorics of associahedra and make the analytic properties of tree-level amplitudes entirely manifest for any number and type of external strings. We use them in practice to perform first numerical computations of open and closed string amplitudes directly in the physical kinematics for n=4,5,6,7,8,9 n = 4 , 5 , 6 , 7 , 8 , 9 . We provide a code that allows anyone to do such computations.

Physics↗

DOE OSTI2020

Higher spin partition functions via the quasinormal mode method in de Sitter quantum gravity

In this note we compute the 1-loop partition function of spin- s s fields on Euclidean de Sitter space S^{2n+1} S 2 n + 1 using the quasinormal mode method. Instead of computing the quasinormal mode frequencies from scratch, we use the analytic continuation prescription L_{\text{AdS}}\to iL_{\text{dS}} L AdS → i L dS , appearing in the dS/CFT correspondence, and Wick rotate the normal mode frequencies of fields on thermal \text{AdS}_{2n+1} AdS 2 n + 1 into the quasinormal mode frequencies of fields on de Sitter space. We compare the quasinormal mode and heat kernel methods of calculating 1-loop determinants, finding exact agreement, and furthermore explicitly relate these methods via a sum over the conformal dimension. We discuss how the Wick rotation of normal modes on thermal \text{AdS}_{2n+1} AdS 2 n + 1 can be generalized to calculating 1-loop partition functions on the thermal spherical quotients S^{2n+1}/\mathbb{Z}_{p} S 2 n + 1 / ℤ p . We further show that the quasinormal mode frequencies encode the group theoretic structure of the spherical spacetimes in question, analogous to the analysis made for thermal AdS in [1-3] .

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2022

Connected and Disconnected Sea Partons from CT18 Parametrization of PDFs

The separation of the connected and disconnected sea partons, which were uncovered in the Euclidean path-integral formulation of the hadronic tensor, is accommodated with the CT18 parametrization of the global analysis of the parton distribution functions (PDFs). This is achieved with the help of the distinct small x x behaviors of these two sea parton components and the constraint from the lattice calculation of the ratio of the strange momentum fraction to that of the {\bar u} u ‾ or {\bar d} d ‾ in the disconnected insertion. This allows lattice calculations of separate flavors in both the connected and disconnected insertions to be directly compared with the global analysis results term by term.

Hou, Tie-Jiun↗

DOE OSTI2020

Vision-Guided Automation and Assistance

Robotic automation and assistance is an excellent way to increase efficiency and safety when working in a potentially hazardous workspace. However, many traditional automation approaches rely on the precise placement of items to be manipulated. The scope of such automated tasks is also limited to the manipulation of one type of object since there is no way to distinguish between different objects. The addition of a vision pipeline, where robot vision is used to localize and recognize objects, can allow the robot to perform more complex tasks in a variable workspace. In my vision pipeline, a depth camera is used to generate a 3D point cloud of the workspace. Objects to be manipulated are isolated in the point cloud by filtering out shared surfaces and using Euclidean cluster extraction to group clusters of points. The locations of the objects are then estimated from the point cloud of the isolated objects. The localization of objects with robot vision allows for variable workspaces, reducing the overhead associated with requiring all objects to be precisely placed in the workspace. For object recognition, deep learning is used to train a neural network that classifies objects from the raw point clouds. More complex tasks that require multiple objects to be manipulated differently can be achieved through the vision pipeline. Through its ability to visualize the workspace, robot vision greatly improves efficiency and safety of automated and assistive tasks.

42 ENGINEERING↗

DOE OSTI2024

Using Parameter Sweep in WaterTAP to Analyze New Water Treatment Technologies

We describe a powerful and generalized parameter sweep tool in this report that was originally developed to analyze the performance of existing and novel water treatment models being developed in WaterTAP. Since WaterTAP is built upon IDAES and Pyomo, the parameter sweep tool can be used to systematically explore and debug the behavior of most Pyomo and IDAES numerical models. In order to enable meaningful analyses, the parameter sweep tool has been designed with the following features: 1) Model flexibility: The parameter sweep tool does not enforce any restrictions on the types of models that can be used with it. As long as a Pyomo model can be solved and the parameter is active and mutable, the tool only needs functions that describe how to run the model, the sweep parameters, and the output quantities of interest. 2) Flexible sampling: The parameter sweep tool has inbuilt functions to generate samples from a random distribution or a multidimensional Euclidean space. Furthermore, the users have to ability to supply samples generated from a tool of their choice. 3) Multiple sweep types: A user can choose from one of 3 types of parameter sweeps depending on their needs. 4) Detailed outputs: Outputs generated by the parameter sweep tool can be stored in detailed H5 file or user-friendly CSV files for post processing. 5) Parallel computing: The parameter sweep supports shared and distributed memory parallel computing to enable the use of high performance computers (HPC) for large-scale analyses. 6) Modular: The parameter sweep tool is self-contained and can easily be integrated within an outer-loop analysis or as desired by the user. 7) Ease of use: The tool is well documented and a simple sweep can be easily executed by following the online documentation in a few lines of code. We demonstrate the use of the parameter sweep tool on a simple water treatment system from the WaterTAP repository and show its parallel scaling performance on an Apple laptop and NREL's Eagle HPC. The parameter sweep tool is actively being used with models currently being developed within WaterTAP and we expect its use to grow beyond it to other IDAES and Pyomo models.

97 MATHEMATICS AND COMPUTING↗