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 217 records · Page 12

All sources NASA NTRS DOE OSTI

DOE OSTI2025

Lanczos algorithm for lattice QCD matrix elements

Recent work [M. L. Wagman, Lanczos, the transfer matrix, and the signal-to-noise problem, .] found that an analysis formalism based on the Lanczos algorithm allows energy levels to be extracted from Euclidean correlation functions with faster ground-state convergence than effective masses, convergent estimators for multiple states from a single correlator, and two-sided error bounds. After filtering out spurious eigenvalues and using outlier-robust estimators within a nested bootstrap framework, Lanczos estimators behave more like multistate fit results than effective masses—but without involving statistical fitting. We extend this formalism to the determination of matrix elements from three-point correlation functions and provide a physical picture of “spurious-state filtering” involving restriction to a Hermitian subspace. We demonstrate similar advantages for matrix elements as for spectroscopy through example applications to noiseless mock-data and (bare) forward matrix elements of the strange scalar current between both ground and excited states with the quantum numbers of the nucleon.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2021

BraggNN : fast X-ray Bragg peak analysis using deep learning

X-ray diffraction based microscopy techniques such as high-energy diffraction microscopy (HEDM) rely on knowledge of the position of diffraction peaks with high precision. These positions are typically computed by fitting the observed intensities in detector data to a theoretical peak shape such as pseudo-Voigt. As experiments become more complex and detector technologies evolve, the computational cost of such peak-shape fitting becomes the biggest hurdle to the rapid analysis required for real-time feedback in experiments. To this end, we propose BraggNN, a deep-learning based method that can determine peak positions much more rapidly than conventional pseudo-Voigt peak fitting. When applied to a test dataset, peak center-of-mass positions obtained from BraggNN deviate less than 0.29 and 0.57 pixels for 75 and 95% of the peaks, respectively, from positions obtained using conventional pseudo-Voigt fitting (Euclidean distance). When applied to a real experimental dataset and using grain positions from near-field HEDM reconstruction as ground-truth, grain positions using BraggNN result in 15% smaller errors compared with those calculated using pseudo-Voigt. Recent advances in deep-learning method implementations and special-purpose model inference accelerators allow BraggNN to deliver enormous performance improvements relative to the conventional method, running, for example, more than 200 times faster on a consumer-class GPU card with out-of-the-box software.

36 MATERIALS SCIENCE↗

DOE OSTI2023

SpeckleNN: a unified embedding for real-time speckle pattern classification in X-ray single-particle imaging with limited labeled examples

With X-ray free-electron lasers (XFELs), it is possible to determine the three-dimensional structure of noncrystalline nanoscale particles using X-ray single-particle imaging (SPI) techniques at room temperature. Classifying SPI scattering patterns, or `speckles', to extract single-hits that are needed for real-time vetoing and three-dimensional reconstruction poses a challenge for high-data-rate facilities like the European XFEL and LCLS-II-HE. Here, we introduce SpeckleNN, a unified embedding model for real-time speckle pattern classification with limited labeled examples that can scale linearly with dataset size. Trained with twin neural networks, SpeckleNN maps speckle patterns to a unified embedding vector space, where similarity is measured by Euclidean distance. We highlight its few-shot classification capability on new never-seen samples and its robust performance despite having only tens of labels per classification category even in the presence of substantial missing detector areas. Without the need for excessive manual labeling or even a full detector image, our classification method offers a great solution for real-time high-throughput SPI experiments.

47 OTHER INSTRUMENTATION↗

DOE OSTI2025

Growth functions of periodic space tessellations

This work analyzes the rules governing the growth of the numbers of vertices, edges and faces in all possible periodic tessellations of the 2D Euclidean space, and encodes those rules in several types of polynomial growth functions. These encodings map the geometric, combinatorial and topological properties of the tessellations into sets of integer coefficients. Several general statements about these encodings are given with rigorous mathematical proof. The variation of the growth functions is represented graphically and analyzed in orphic diagrams, so named because of their similarity to orphic art. Several examples of 3D space groups are included, to emphasize the complexity of the growth functions in higher dimensions. A freely available Python library is presented to facilitate the discovery of the growth functions and the generation of orphic diagrams.

Chemistry↗

DOE OSTI2023

Covariance Shaping Over Riemannian Manifolds for Massive MIMO Communication

Acquiring accurate instantaneous channel state information (CSI) is a challenging aspect of massive multi-input multi-output (MIMO) communication. Utilizing statistical information, such as channel covariance matrix, to design statistical beamforming vectors is robust when compared to instantaneous CSI. In this paper, we propose a novel MIMO covariance shaping scheme over Riemannian manifolds. It serves as an effective statistical beamforming solution to a number of close proximity user equipment (UE) that are undergoing substantial channel correlation. Proposed algorithm exploits the Hermitian positive definite nature of covariance matrices lying over Riemannian manifold. We introduce Wasserstein distance function as a Riemannian metric to measure distances between channel covariance matrices. Furthermore, K-means clustering technique is utilized to effectively identify the optimal shape of effective optimal covariance matrices. Our findings suggest that maximizing the geodesic distance between covariance matrices ultimately leads to a corresponding increase in the network throughput, as determined by the beamforming vector used to shape the covariance matrices. Simulation results validate that the proposed solution converges faster than Euclidean-based state-of-the-art, while maintaining the same computational complexity. Finally, the sum rate performance asymptotically achieves full capacity for two-UE case and more than 96% of the upper bound exhaustive search benchmark for multi-UE scenario.

42 ENGINEERING↗

DOE OSTI2021

Multi-Dimensional Scaling on Groups

Leveraging the intrinsic symmetries in data for clear and efficient analysis is an important theme in signal processing and other data-driven sciences. A basic example of this is the ubiquity of the discrete Fourier transform which arises from translational symmetry (i.e. time-delay/phase-shift). Particularly important in this area is understanding how symmetries inform the algorithms that we apply to our data. In this paper we explore the behavior of the dimensionality reduction algorithm multi-dimensional scaling (MDS) in the presence of symmetry. We show that understanding the properties of the underlying symmetry group allows us to make strong statements about the output of MDS even before applying the algorithm itself. In analogy to Fourier theory, we show that in some cases only a handful of fundamental ``frequencies'' (irreducible representations derived from the corresponding group) contribute information for the MDS Euclidean embedding.

Dimensionality reduction, Representation theory, D↗

DOE OSTI2020

AWB-GCN: A Graph Convolutional Network Accelerator with Runtime Workload Rebalancing

The recent development of deep learning has been mostly focusing on Euclidean data, such as images, videos, audios, etc. However, most real-world information and relation are often expressed as graphs. To efficiently learn from graph data, graph convolutional networks (GCNs) emerge as a promising approach, showing advantages in several practical applications such as social network analysis, knowledge discovery, 3D modeling, motion capturing, etc. Real-world graphs are usually extremely large and imbalanced, posting significant performance demand and design challenges on the hardware dedicated for GCN inference. In this paper, we propose an architecture design called UW-GCN to accelerate graph convolutional network inference. To tackle the major performance bottleneck from workload imbalance, we propose dynamic neighborhood stealing and remote chunk shuffling techniques, relying on hardware flexibility to achieve hardware auto-tuning under negligible area or delay overhead. Specifically, UW-GCN is able to smartly profile the sparse graph pattern while continuously adjusting the workload distribution via routing reconfiguration among parallel processing elements (PEs). The ideal configuration is then reused in the remaining iterations. To the best of our knowledge, this is the first accelerator design particularly for GCN and the first work relying on hardware auto-tuning, which is normally based on software, to achieve near-optimal workload balance in processing sparse structures.

Geng, Tong↗

DOE OSTI2024

Synchronization and Rebound Effects in Residential Loads

Increasing fuel prices and capacity investment deferral place an increasing demand for peak reduction from distribution level systems. Residential and commercial devices, such as HVAC systems and water heaters, are increasingly involved in load control programs, and their use may generate synchronization and rebound effects, such as artificial peaks caused by device optimization. While there have been concerns over device synchronization, few studies quantify the extent of this effect with numerical values. In this study, we attempt to investigate whether control efforts result in device synchronization or rebound effects. We focus on three clustering methods – Ward’s clustering, Euclidean K-means, and Density-based spatial clustering of applications with noise – to evaluate the extent of synchronization of a fleet of water heaters and HVAC systems in Atlanta, Georgia. Our findings show that synchronization and rebound effects are present in the neighborhood’s water heaters, but none were found in the HVAC systems. Further, high usage water heaters are more susceptible to synchronization and rebound effects.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2021

Improving the Accuracy of Clustering Electric Utility Net Load Data using Dynamic Time Warping

Identifying patterns in electric utility net load data in a time-series format is very useful in preparing the operation for next day. Machine learning algorithms have been used in other domains and those concepts are applied in this paper on real-world net load measurement data. Clustering is the practice of grouping data with similar characteristics as determined by the distance measure. The K-means clustering algorithm is utilized here with actual electric utility data. The paper uses the standard distance measure, Euclidean distance (ED), and compares its performance against the dynamic time warping (DTW) measure. An actual case study with real data is presented, and DTW distance measure-based method observed to result better accuracy compared to the ED based method for substation net load measurements predominantly with residential customers.

clustering↗

DOE OSTI2022

Tri-Sectional Approximation of the Shortest Path to Long-Term Voltage Stability Boundary with Distributed Energy Resources

Ensuring long-term voltage stability is critical for reliable operations of power grids. High share of distributed energy resources (DERs) can create complicated system operation modes that may invalidate the traditional long-term voltage stability analysis based on typical operation modes. To address this challenge, this paper investigates how to compute the shortest path to the voltage stability boundary in the DER aggregated load space with large dispersion. Instead of working in the Euclidean space, we establish the analysis and computations on the algebraic power flow manifold to better capture the curvature change of the shortest path along the direction of losing stability. A modified optimal control framework is presented for obtaining the ground-truth of the smooth shortest path on the manifold. To efficiently and accurately solve for the shortest path, we further leverage the geometric features of the power flow manifold and propose a tri-sectional approximation model that is scalable for large-scale systems. Several numerical examples, up to the 1354-bus system, with different DER penetration levels and high dimensional renewable power injection variations are evaluated. The simulation results demonstrate that the tri-sectional approximation achieves high accuracy and efficiency to approximate the shortest path to the voltage stability boundary.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2025

Diffusion power spectra as a window into dynamic materials architecture

Chemical recycling of commodity and specialty polymers presents a multifaceted challenge for industrial societies. On one hand, macromolecular architectures must be engineered to yield durable products that, on the other hand, rapidly deconstruct to recyclable monomers under pre-determined conditions. Polymer deconstruction is a chemical process that requires deep understanding of molecular reactivity in heterogeneous media, where porous material architectures evolve in both space and time. To build this understanding, we develop herein experimental and analytical methods describing sets of diffusive eigenmodes that exist within time-varying, non-Euclidean boundary conditions, a situation commonly encountered in the reactive deconstruction of polymers where chain fragments splay, alter their local dynamics, and evolve in their confinement of reacting media. Diffusion power spectra, discerned experimentally by NMR, yield polymer and solvent frequency-domain velocity autocorrelation functions that are analyzed in the context of physical models for chemical reactions parameterized with fractal mathematics. The results connect local motion in polymers to chemical reactivity during acidolysis of circular elastomers.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2022

Generative Ensemble Regression: Learning Particle Dynamics from Observations of Ensembles with Physics-informed Deep Generative Models

Here, we propose a new method for inferring the governing stochastic ordinary differential equations (SODEs) by observing particle ensembles at discrete and sparse time instants, i.e., multiple “snapshots.” Particle coordinates at a single time instant, possibly noisy or truncated, are recorded in each snapshot but are unpaired across the snapshots. By training a physics-informed generative model that generates “fake” sample paths, we aim to fit the observed particle ensemble distributions with a curve in the probability measure space, which is induced from the inferred particle dynamics. We employ different metrics to quantify the differences between distributions, e.g., the sliced Wasserstein distances and the adversarial losses in generative adversarial networks. We refer to this method as generative “ensemble-regression” (GER), in analogy to the classic “point-regression,” where we infer the dynamics by performing regression in the Euclidean space. We illustrate the GER by learning the drift and diffusion terms of particle ensembles governed by SODEs with Brownian motions and Lévy processes up to 100 dimensions. We also discuss how to treat cases with noisy or truncated observations. Apart from systems consisting of independent particles, we also tackle nonlocal interacting particle systems with unknown interaction potential parameters by constructing a physics-informed loss function. Finally, we investigate scenarios of paired observations and discuss how to reduce the dimensionality in such cases by proving a convergence theorem that provides theoretical support.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

Algebra of hyperbolic band theory under magnetic field

We explore algebras associated with the hyperbolic band theory under a magnetic field for the first time. We define the magnetic Fuchsian group associated with a higher genus Riemann surface. By imposing the magnetic boundary conditions for the hyperbolic Bloch states, we construct the hyperbolic magnetic Bloch states and investigate their energy spectrum. We give a connection between such magnetic Bloch states and automorphic forms. Our theory is a general extension of the conventional algebra associated with the band theory defined on a Euclidean lattice/space into that of the band theory on a general hyperbolic lattice/Riemann surface.

Physics↗

DOE OSTI2020

Impurity lattice Monte Carlo for hypernuclei

Abstract We consider the problem of including $$\varLambda $$ Λ hyperons into the ab initio framework of nuclear lattice effective field theory. In order to avoid large sign oscillations in Monte Carlo simulations, we make use of the fact that the number of hyperons is typically small compared to the number of nucleons in the hypernuclei of interest. This allows us to use the impurity lattice Monte Carlo method, where the minority species of fermions in the full nuclear Hamiltonian is integrated out and treated as a worldline in Euclidean projection time. The majority fermions (nucleons) are treated as explicit degrees of freedom, with their mutual interactions described by auxiliary fields. This is the first application of the impurity lattice Monte Carlo method to systems where the majority particles are interacting. Here, we show how the impurity Monte Carlo method can be applied to compute the binding energies of the light hypernuclei. In this exploratory work we use spin-independent nucleon–nucleon and hyperon–nucleon interactions to test the computational power of the method. We find that the computational effort scales approximately linearly in the number of nucleons. The results are very promising for future studies of larger hypernuclear systems using chiral effective field theory and realistic hyperon–nucleon interactions, as well as applications to other quantum many-body systems.

Frame, Dillon↗

DOE OSTI2023

Fast estimation of the look-elsewhere effect using Gaussian random fields

Abstract We discuss the use of Gaussian random fields to estimate the look-elsewhere effect correction. We show that Gaussian random fields can be used to model the null-hypothesis significance maps from a large set of statistical problems commonly encountered in physics, such as template matching and likelihood ratio tests. Some specific examples are searches for dark matter using pixel arrays, searches for astronomical transients, and searches for fast-radio bursts. Gaussian random fields can be sampled efficiently in the frequency domain, and the excursion probability can be fitted with these samples to extend any estimation of the look-elsewhere effect to lower p values. In addition, in cases where the Gaussian random field is stationary and the parameter space is Euclidean, the look-elsewhere effect correction can be computed analytically. We demonstrate these methods using two example template matching problems. Finally, we apply these methods to estimate the trial factor of a $$4^3$$ 4 3 accelerometer array for the detection of dark matter tracks in the Windchime project. When a global significance of $$3\sigma $$ 3 σ is required, the estimated trial factor for such an accelerometer array is $$10^{14}$$ 10 14 for a one-second search, and $$10^{22}$$ 10 22 for a 1-year search.

Qin, Juehang (ORCID:0000000182288949)↗

DOE OSTI2021

From the black hole conundrum to the structure of quantum gravity

Here, we portray the structure of quantum gravity emerging from recent progress in understanding the quantum mechanics of an evaporating black hole. Quantum gravity admits two different descriptions, based on Euclidean gravitational path integral and a unitarily evolving holographic quantum system, which appear to present vastly different pictures under the existence of a black hole. Nevertheless, these two descriptions are physically equivalent. Various issues of black hole physics — including the existence of the interior, unitarity of the evolution, the puzzle of too large interior volume, and the ensemble nature seen in certain calculations — are addressed very differently in the two descriptions, still leading to the same physical conclusions. The perspective of quantum gravity developed here is expected to have broader implications beyond black hole physics, especially for the cosmology of the eternally inflating multiverse.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2020

Theory and applications of parton pseudodistributions

We review the basic theory of the parton pseudodistributions approach and its applications to lattice extractions of parton distribution functions. The crucial idea of the approach is the realization that the correlator $M(z,p)$ of the parton fields is a function $M(ν,-z^2)$ of Lorentz invariants $ν=-(zp)$, the Ioffe time, and the invariant interval $z^2$. This observation allows to extract the Ioffe-time distribution $M(ν,-z^2)$ from Euclidean separations z accessible on the lattice. Another basic feature is the use of the ratio $M(ν,-z^2)≡M(ν,-z^2)/M(0,-z^2)$, that allows to eliminate artificial ultraviolet divergence generated by the gauge link for spacelike intervals. The remaining $z^2$-dependence of the reduced Ioffe-time distribution $M(ν,-z^2)$ corresponds to perturbative evolution, and can be converted into the scale-dependence of parton distributions $f(x,μ^2)$ using matching relations. The ν-dependence of $M(ν,-z^2)$ governs the x-dependence of parton densities $f(x,μ^2)$. The perturbative evolution was successfully observed in exploratory quenched lattice calculation. The analysis of its precise data provides a framework for extraction of parton densities using the pseudodistributions approach. It was used in the recently performed calculations of the nucleon and pion valence quark distributions. We also discuss matching conditions for the pion distribution amplitude and generalized parton distributions, the lattice studies of which are now in progress.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2022

Exploring 2 + 2 answers to 3 + 1 questions

We explore potential uses of physics formulated in Kleinian (i.e. 2 + 2) signature spacetimes as a tool for understanding properties of physics in Lorentzian (i.e. 3 + 1) signature. Much as Euclidean (i.e. 4 + 0) signature quantities can be used to formally construct the ground state wavefunction of a Lorentzian signature quantum field theory, a similar analytic continuation to Kleinian signature constructs a state of low particle flux in the direction of analytic continuation. There is also a natural supersymmetry algebra available in 2 + 2 signature, which serves to constrain the structure of correlation functions. Spontaneous breaking of Lorentz symmetry can produce various [Formula: see text] supersymmetry algebras that in 3 + 1 signature correspond to nonsupersymmetric systems. We speculate on the possible role of these structures in addressing the cosmological constant problem.

Physics↗