Search NASA⌕ Search

SEARCH · Search NASA

Results for “nodes”

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 487 records · Page 27
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Development of Whole System Digital Twins for Advanced Reactors: Leveraging Graph Neural Networks and SAM Simulations

Here, in this work, we introduce a novel method to develop whole system digital twins (DTs) for advanced nuclear reactors. This method treats a complex reactor system as a heterogeneous graph: with the system components as different types of graph nodes and their physical interconnections as edges. Based on the heterogeneous graph, a graph neural network combining graph convolution and temporal node attention is developed as the DT, facilitating a comprehensive understanding of the system's dynamic behavior. By utilizing the System Analysis Module (SAM) code for simulating various operational transients, we develop a graph-based database that trains the DT. This DT is characterized by two primary functions: It can infer the entire system's status using sparse node information, and it can predict the progress of transients based on current and historical system information. Our approach is validated through case studies on the Experimental Breeder Reactor II (EBR-II) system and a generic Fluoride-salt-cooled High-temperature Reactor (gFHR), demonstrating the DT's accuracy in forecasting operational transients. The DT's rapid computation capabilities enhance its potential for supporting advanced reactor operations, offering benefits in intelligent simulation, autonomous control, and anomaly detection, paving the way for improved safety analysis and intelligent component health management for advanced reactor systems and reducing their operations and maintenance cost.

EBR-II↗
DOE OSTI2020

Distributed quantum sensing enhanced by continuous-variable error correction

Abstract A distributed sensing protocol uses a network of local sensing nodes to estimate a global feature of the network, such as a weighted average of locally detectable parameters. In the noiseless case, continuous-variable (CV) multipartite entanglement shared by the nodes can improve the precision of parameter estimation relative to the precision attainable by a network without shared entanglement; for an entangled protocol, the root mean square estimation error scales like 1/ M with the number M of sensing nodes, the so-called Heisenberg scaling, while for protocols without entanglement, the error scales like 1 / M . However, in the presence of loss and other noise sources, although multipartite entanglement still has some advantages for sensing displacements and phases, the scaling of the precision with M is less favorable. In this paper, we show that using CV error correction codes can enhance the robustness of sensing protocols against imperfections and reinstate Heisenberg scaling up to moderate values of M . Furthermore, while previous distributed sensing protocols could measure only a single quadrature, we construct a protocol in which both quadratures can be sensed simultaneously. Our work demonstrates the value of CV error correction codes in realistic sensing scenarios.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Graph Neural Network for Object Reconstruction in Liquid Argon Time Projection Chambers

The Exa.TrkX project presents a graph neural network (GNN) technique for low-level reconstruction of neutrino interactions in a Liquid Argon Time Projection Chamber (LArTPC). GNNs are still a relatively novel technique, and have shown great promise for similar reconstruction tasks in the Large Hadron Collider (LHC). Graphs describing particle interactions are formed by treating each detector hit as a node, with edges describing the relationships between hits. We utilise a multi-head attention message passing network which performs graph convolutions in order to label each node with a particle type.We present an updated variant of our GNN architecture, with several improvements. After testing the model on more realistic simulation with regions of unresponsive wires, the target was modified from edge classification to node classification in order to increase robustness. Removing edges as a classification target opens up a broader possibility space for edge-forming techniques; we explore the model’s performance across a variety of approaches, such as Delaunay triangulation, kNN, and radius-based methods. We also extend this model to the 3D context, sharing information between detector views. By using reconstructed 3D spacepoints to map detector hits from each wire plane, the model naively constructs 2D representations that are independent yet fully consistent.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2025

Scalable edge clustering of dynamic graphs via weighted line graphs

Timestamped relational datasets consisting of records (or connections) between pairs of entities are ubiquitous in network science. For applications like peer-to-peer communication, email, various social network interactions, and computer network security, it is useful to organize these records into groups based on how and when they are occurring. Weighted line graphs offer a natural way to model how records are related in such datasets but for large real-world graph topologies, building and utilizing the line graph is prohibitively expensive. Here, we present the framework to cluster the edges of a dynamic graph via the associated line graph that contains two major contributions. The first is a method to work with the line graph implicitly and the second is a distributed scale implementation of an agglomerative hierarchical graph clustering algorithm. We outline a novel hierarchical dynamic graph edge clustering approach that efficiently breaks massive relational datasets into small sets of edges containing events at various timescales. This is in stark contrast to traditional graph clustering algorithms that prioritize highly connected (clique-like) community structures. Our approach relies on constructing a sufficient subgraph of a weighted line graph and applying a hierarchical agglomerative clustering. This approach is related to scalable techniques from spatial clustering, nonlinear-dimension reduction, topological data analysis, and draws particular inspiration from HDBSCAN. As an edge clustering, this method yields an overlapping node clustering. Our algorithm is parallelizable and we demonstrate efficient clustering of a billion-scale, real-world dynamic graph into small edge sets that correlate in topology and time. The entire clustering process for a graph with tens of billions of edges takes just a few minutes of run time on 256 nodes of a distributed compute environment. We argue how the output of the edge clustering is useful for a multitude of data visualization and powerful machine learning tasks, both involving the original massive dynamic graph data and metadata associated with the nodes and edges. Finally, we describe how this approach can be extended to dynamic hypergraphs and dynamic graphs/hypergraphs with unstructured data living on vertices and edges.

Data Analysis↗
DOE OSTI2026

Simultaneous global and local clustering in multiplex networks with covariate information

Understanding both global and layer-specific group structures is useful for uncovering complex patterns in networks with multiple interaction types. In this work, we introduce a new model, the hierarchical multiplex stochastic blockmodel, which simultaneously detects communities within individual layers of a multiplex network while inferring a global node clustering across the layers. A stochastic blockmodel is assumed in each layer, with probabilities of layer-level group memberships determined by a node’s global group assignment. Our model uses a Bayesian framework, employing a probit stick-breaking process to construct node-specific mixing proportions over a set of shared Griffiths–Engen–McCloseky distributions. These proportions determine layer-level community assignment, allowing for an unknown and varying number of groups across layers, while incorporating nodal covariate information to inform the global clustering. We propose a scalable variational inference procedure with parallelisable updates for application to large networks. Extensive simulation studies demonstrate our model’s ability to accurately recover both global and layer-level clusters in complicated settings, and applications to real data showcase the model’s effectiveness in uncovering interesting latent network structure.

community detection↗
DOE OSTI2023

Hickson-like compact groups inhabiting different environments

ABSTRACT Although compact groups (CGs) of galaxies have been envisioned as isolated extremely dense structures in the Universe, it is accepted today that many of them could be not as isolated as thought. In this work, we study Hickson-like CGs identified in the Sloan Digital Sky Survey Data Release 16 to analyse these systems and their galaxies when embedded in different cosmological structures. To achieve this goal, we identify several cosmological structures where CGs can reside: nodes of filaments, loose groups, filaments, and cosmic voids. Our results indicate that 45 per cent of CGs do not reside in any of these structures, i.e. they can be considered non-embedded or isolated systems. Most of the embedded CGs are found inhabiting loose groups and nodes, while there are almost no CGs residing well inside cosmic voids. Some physical properties of CGs vary depending on the environment they inhabit. CGs in nodes show the largest velocity dispersions, the brightest absolute magnitude of the first-ranked galaxy, and the smallest crossing times, while the opposite occurs in non-embedded CGs. When comparing galaxies in all the environments and galaxies in CGs, CGs show the highest fractions of red/early-type galaxy members in most of the absolute magnitudes ranges. The variation between galaxies in CGs inhabiting one or another environment is not as significant as the differences caused by belonging or not to a CG. Our results suggest a plausible scenario for galaxy evolution in CGs in which both large-scale and local environments play essential roles.

Astronomy & Astrophysics↗
DOE OSTI2024

The beyond-halo mass effects of the cosmic web environment on galaxies

ABSTRACT Galaxy properties primarily depend on their host halo mass. Halo mass, in turn, depends on the cosmic web environment. We explore if the effect of the cosmic web on galaxy properties is entirely transitive via host halo mass, or if the cosmic web has an effect independent of mass. The secondary galaxy bias, sometimes referred to as ‘galaxy assembly bias’, is the beyond-mass component of the galaxy–halo connection. We investigate the link between the cosmic web environment and the secondary galaxy bias in simulations. We measure the secondary galaxy bias through the following summary statistics: projected two-point correlation function, $w_{\mathrm{p}}(r_{\mathrm{p}})$, and counts-in-cylinders statistics, $P(N_{\mathrm{CIC}})$. First, we examine the extent to which the secondary galaxy bias can be accounted for with a measure of the environment as a secondary halo property. We find that the total secondary galaxy bias preferentially places galaxies in more strongly clustered haloes. In particular, haloes at fixed mass tend to host more galaxies when they are more strongly associated with nodes or filaments. This tendency accounts for a significant portion, but not the entirety, of the total secondary galaxy bias effect. Secondly, we quantify how the secondary galaxy bias behaves differently depending on the host halo proximity to nodes and filaments. We find that the total secondary galaxy bias is relatively stronger in haloes more associated with nodes or filaments. We emphasize the importance of removing halo mass effects when considering the cosmic web environment as a factor in the galaxy–halo connection.

Astronomy & Astrophysics↗
DOE OSTI2020

Optical conductivity of the type-II Weyl semimetal TaIrTe 4

TaIrTe4 is an example of a candidate Weyl type-II semimetal with a minimal possible number of Weyl nodes. Four nodes are reported to exist a single plane in k-space. The existence of a conical dispersion linked to Weyl nodes has yet to be shown experimentally. Here we use optical spectroscopy as a probe of the band structure on a low-energy scale. Studying optical conductivity allows us to probe intraband and interband transitions with zero momentum. In TaIrTe 4 , we observe a narrow Drude contribution and an interband conductivity that may be consistent with a tilted linear band dispersion up to 40 meV. The interband conductivity allows us to establish the effective parameters of the conical dispersion; effective velocity v = 1.1 · 10 4 m/s and tilt γ = 0.37. The transport data, Seebeck and Hall coefficients, are qualitatively consistent with conical features in the band structure. Quantitative disagreement may be linked to the multiband nature of TaIrTe 4 .

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2022

Chern numbers of topological phonon band crossing determined with inelastic neutron scattering

Topological invariants in the band structure, such as Chern numbers, are important for the understanding and classification of the topological properties of matter and dictate the occurrence of exotic behaviors, yet their direct spectroscopic determination has been largely limited to electronic bands. Here, we use inelastic neutron scattering in conjunction with ab initio calculations to identify a variety of topological phonon band crossings in MnSi and CoSi single crystals. We find a distinct relation between the Chern numbers of a band-crossing node and the scattering intensity modulation in momentum space around the node. Given sufficiently high resolution, our method can be used to determine arbitrarily large Chern numbers of topological phonon band-crossing nodes.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2023

Multi-$\mathcal{k}$ magnetic structure and large anomalous Hall effect in candidate magnetic Weyl semimetal NdAlGe

Here, the magnetic structure, magnetoresistance (MR), and Hall effect of the noncentrosymmetric magnetic semimetal NdAlGe are investigated, revealing an unusual magnetic state and anomalous transport properties that are associated with the electronic structure of this compound. The magnetization and MR measurements are both highly anisotropic and indicate an Ising-like magnetic system. The magnetic structure is complex in that it involves two magnetic ordering vectors, including an incommensurate spin density wave and commensurate ferrimagnetic state in zero field. We have discovered a large anomalous Hall conductivity that reaches ≈430 Ω –1 cm –1 , implying that it originates from an intrinsic Berry curvature effect stemming from Weyl nodes found in the electronic structure. These electronic structure calculations indicate the presence of nested Fermi surface pockets with nesting wave vectors like the measured magnetic ordering wave vector and the presence of Weyl nodes in proximity to the Fermi surface. We associate the incommensurate magnetic structure with the large anomalous Hall response to be the result of the combination of Fermi surface nesting and the Berry curvature associated with Weyl nodes.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2024

Signature of nodal topology in nonlinear quantum transport across junctions in Weyl and multi-Weyl semimetals

We investigate quantum transport through a rectangular potential barrier in Weyl semimetals (WSMs) and multi-Weyl semimetals (MSMs), within the framework of Landauer-Büttiker formalism. Here, our study uncovers the role of nodal topology imprinted in the electric current and the shot noise. We find that, in contrast to the finite odd-order conductance and noise power, the even-order contributions vanish at the nodes. Additionally, depending on the topological charge ($J$), the linear conductance ($G_1$) scales with the Fermi energy ($E_F$) as $G^{E_F>U}_{1}$ $∝$ $E^{2/J}_{F}$, $U$ being the barrier height. We demonstrate that the $E_F$ dependence of the second-order conductance and shot noise power could quite remarkably distinguish an MSM from a WSM depending on the band topology, and may induce several smoking gun experiments in nanostructures made out of WSMs and MSMs. Analyzing shot noise and Fano factor, we show that the transport across the rectangular barrier follows the sub-Poissonian statistics. Interestingly, we obtain universal values of Fano factor at the nodes unique to their topological charges. The universality for a fixed $J$, however, indicates that only a fixed number of open channels participate in the transport through evanescent waves at the nodes. The proposed results can serve as a potential diagnostic tool to identify different topological systems in experiments.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Geometric transport signatures of strained multi-Weyl semimetals

The minimal coupling of strain to Dirac and Weyl semimetals, and its modeling as a pseudogauge field has been extensively studied, resulting in several proposed topological transport signatures. In this work, we study the effects of strain on higher winding number Weyl semimetals and show that strain is not a pseudogauge field for any winding number larger than one. Here we focus on the double-Weyl semimetal as an illustrative example to show that the application of strain splits the higher winding number Weyl nodes and produces an anisotropic Fermi surface. Specifically, the Fermi surface of the double-Weyl semimetal acquires nematic order. By extending chiral kinetic theory for such nematic fields, we determine the effective gauge fields acting on the system and show how strain induces anisotropy and affects the geometry of the semiclassical phase space of the double-Weyl semimetal. Further, the strain-induced deformation of the Weyl nodes results in transport signatures related to the covariant coupling of the strain tensor to the geometric tensor associated with the Weyl nodes giving rise to strain-dependent dissipative corrections to the longitudinal as well as the Hall conductance. Thus, by extension, we show that in multi-Weyl semimetals, strain produces geometric signatures rather than topological signatures. Further, we highlight that the most general way to view strain is as a symmetry-breaking field rather than a pseudogauge field.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2025

Probing Curved Spacetime with a Distributed Atomic Processor Clock

Quantum dynamics on curved spacetime has never been directly probed beyond the Newtonian limit. Although we can describe such dynamics theoretically, experiments would provide empirical evidence that quantum theory holds even in this extreme limit. The practical challenge is the minute spacetime curvature difference over the length scale of the typical extent of quantum effects. Here, we propose a quantum network of alkaline earth (like) atomic processors for constructing a distributed quantum state that is sensitive to the differential proper time between its constituent atomic processor nodes, implementing a quantum observable that is affected by post-Newtonian curved spacetime. Conceptually, we propose to delocalize one clock between three locations by encoding the presence or absence of a clock into the state of the local atoms. By separating three atomic nodes over approximately kilometer-scale elevation differences and distributing one clock between them via a 𝑊 state, we demonstrate that the curvature of spacetime is manifest in the interference of the three different proper times that give rise to three distinct beat notes in our nonlocal observable. We further demonstrate that 𝑁-atom entanglement within each node enhances the interrogation bandwidth by a factor of 𝑁. We discuss how our proposed system can probe new facets of fundamental physics, such as the linearity, unitarity, and probabilistic nature of quantum theory on curved spacetime. Our protocol combines several recent advances with neutral atom and trapped ions to realize a novel quantum probe of gravity uniquely enabled by quantum networks.

Covey, Jacob P. [Univ. of Illinois at Urbana-Champ↗
DOE OSTI2026

Community detection robustness of graph neural networks

Graph neural networks (GNNs) are increasingly widely used for community detection in attributed networks. They combine structural topology with node attributes through message passing and pooling. However, their robustness or lack thereof with respect to different perturbations and targeted attacks in conjunction with community detection tasks is not well understood. To shed light on latent mechanisms behind GNN sensitivity on community detection tasks, we conduct a systematic computational evaluation of six widely adopted GNN architectures graph convolutional network, graph attention network, graph sample and aggregate (GraphSAGE), differentiable pooling (DiffPool), minimum cut pooling (MinCUT), and deep modularity networks (DMoN). The analysis covers three perturbation categories: node attribute manipulations, edge topology distortions, and adversarial attacks. We use element-centric similarity as the evaluation metric on synthetic benchmarks and real-world citation networks. Our findings indicate that supervised GNNs tend to achieve higher baseline accuracy, while unsupervised methods, particularly DMoN, maintain stronger resilience under targeted and adversarial perturbations. Furthermore, robustness appears to be strongly influenced by community strength, with well-defined communities reducing performance loss. Across all models, node attribute perturbations associated with targeted edge deletions and shifts in attribute distributions tend to cause the largest degradation in community recovery. These findings highlight important trade-offs between accuracy and robustness in GNN-based community detection and offer insights into selecting architectures resilient to noise and adversarial attacks.

Goel, Jaidev [Virginia Polytechnic Inst. and State↗
DOE OSTI2020

MARBLE: A Multi-GPU Aware Job Scheduler for Deep Learning on HPC Systems

Deep learning (DL) has become a key tool for solving complex scientific problems. However, managing the multi-dimensional large-scale data associated with DL, especially atop extant multiple graphics processing units (GPUs) in modern supercomputers poses significant challenges. Moreover, the latest high-performance computing (HPC) architectures bring different performance trends in training throughput compared to the existing studies. Existing DL optimizations such as larger batch size and GPU locality-aware scheduling have little effect on improving DL training throughput performance due to fast CPU-to-GPU connections. Additionally, DL training on multiple GPUs scales sublinearly. Thus, simply adding more GPUs to a system is ineffective. To this end, we design MARBLE, a first-of-its-kind job scheduler, which considers the non-linear scalability of GPUs at the intra-node level to schedule an appropriate number of GPUs per node for a job. By sharing the GPU resources on a node with multiple DL jobs, MARBLE avoids low GPU utilization in current multi-GPU DL training on HPC systems. Our comprehensive evaluation in the Summit supercomputer shows that MARBLE is able to improve DL training performance by up to 48.3% compared to the popular Platform Load Sharing Facility (LSF) scheduler. Compared to the state-of-the-art of DL scheduler, Optimus, MARBLE reduces the job completion time by up to 47%.

Han, Jingoo↗
DOE OSTI2025

A Versatile Simulated Data Transport Layer for in Situ Workflows Performance Evaluation

In situ processing does not only allow scientific applications to face the explosion in data volume and velocity but also to address the time constraints of many simulation-analysis workflows by providing scientists with early insights about their applications at runtime. Multiple frameworks implement the concept of a data transport layer (DTL) to enable such in situ workflows. These tools are very versatile, directly or indirectly access the data generated on the same node, another node of the same compute cluster, or a completely distinct node, and allow data publishers and subscribers to run on the same computing resources or not. This versatility puts on researchers the onus of taking key decisions related to resource allocation and how to transport data to ensure the most efficient execution of their in situ workflows. However, domain scientists and workflow practitioners lack the appropriate tools to assess the respective performance of particular design and deployment options. In this paper we introduce a versatile simulated DTL designed to provide researchers with insights on the respective performance of different execution scenarios of in situ workflows. This open-source, standalone library builds on the SimGrid toolkit and can be linked to any SimGrid-based simulator. It facilitates the evaluation of the performance behavior, at scale, of different data transport configurations and the study of the effects of resource allocation strategies. We demonstrate the scalability, versatility, and accuracy of this simulated DTL by reproducing the execution of two synthetic benchmarks and of a real-world in situ workflow composed of an MPI application and a parallel data analysis. Results of simulations run on a single core show that the proposed library can simulate the interactions of tens of thousands of simulated processes deployed on two interconnected commodity clusters in a few seconds, and the execution by a thousand simulated processes of an in situ workflow in less than three minutes.

Suter, Fred [ORNL] (ORCID:0000000319021955)↗
DOE OSTI2025

Enabling Scientific Applications with Performance-Portability and High-Productivity for Multi-GPU Programming with JACC.Multi

This work bridges the gap between multi-GPU computing and high-productivity, performance-portable programming solutions. Our goal is to enhance scientific applications with a productive and portable solution—program once, deploy everywhere—for multi-GPU programming with no cost to programmability. To accomplish this, we implemented JACC.Multi, which is part of the Julia for ACCelerators (JACC) performance-portable framework. JACC. Multi is the only high-level, portable metaprogramming solution that targets multi-GPU environments and is integrated in a readily accessible programming language (e.g., Julia language). With transparent GPU-to-GPU communication, JACC. Multi is optimized for scientific application workloads and is portable for NVIDIA and AMD accelerators. For the evaluation, we use two modern multi-GPU systems: Hudson, which features two NVIDIA H100 Hopper GPUs per node, and Frontier, which features four AMD MI250X GPUs per node, each with two Graphics Compute Dies (GCDs) for a total of eight GCDs per node. Additionally, as part of the evaluation, we use JACC (one GPU), MPI+JACC, and JACC. Multi codes that implement well-known and widely used scientific algorithms/kernels such as the conjugate gradient algorithm and an explicit forward Euler solver that requires GPU-to-GPU communication. Overall, JACC. Multi codes achieve better performance than MPI+JACC codes and significant speedups over JACC (one GPU), with up to 1.9× on Hudson and 6× on Frontier.

Valero Lara, Pedro [ORNL] (ORCID:0000000214794310)↗
DOE OSTI2020

Local Phasor-Based Control of DER Inverters for Voltage Regulation on Distribution Feeders

We introduce a new control paradigm termed Phasor-Based Control (PBC) to coordinate Distributed Energy Resources (DER) for improved voltage regulation and other objectives. PBC is a multi-layer control framework where the state of the distribution grid is represented by voltage phasors, and Phasor Measurement Units (PMUs) measure the state at critical points in the distribution grid. In the PBC paradigm, a supervisory controller (S-PBC) sets phasor targets which local controllers track. In this paper, we propose a Proportional Integral (PI) implementation for the local control layer (LPBC), to regulate real and reactive power output of distributed inverters to track a voltage phasor target computed by the supervisory layer. We tune the PI controller gains offline with a genetic algorithm that yields better performance than the Ziegler-Nichols method. We benchmark the proposed L-PBC controller against droop volt-var control (DVVC) and observe improved voltage regulation in simulation on the IEEE 13 node unbalanced test feeder (IEEE 13NF). Furthermore, by means of numerical simulation we observe the response of the L-PBC controllers to small and large grid disturbances. Simulations on larger feeders, IEEE 123-node and 647-node, demonstrate challenges with tuning controllers in setups with different amounts of power-voltage coupling.

42 ENGINEERING↗