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 109 records · Page 6

A real-time distributed solid oxide electrolysis cell (SOEC) model for cyber-physical simulation

System integration and dynamic operability between SOEC and balance-of-plant (BoP) components are major technical challenges before realizing rapid load following of SOEC systems. Cyber-physical simulation (CPS) is a leading-edge digital engineering approach and is regarded as the next step beyond Digital Twins. CPS approach can be used to research SOEC system integration and develop dynamic controls prior to actual pilot testing without using a real SOEC. To seamlessly couple with BoP hardware and access non-observable operational parameters (e.g., local temperature gradient) during transients, a distributed one-dimensional (1D) real-time SOEC model was developed. Its real-time execution was demonstrated for 20 to 640 nodes at the fixed time step of 5 ms. A higher excess air ratio enabled smaller local temperature gradients on SOEC solid materials and faster transients upon current density step change from 0.15 to 0.55 A cm -2 . During the transients, the magnitude of the peak temperature gradient nearly doubled in 10 s from -3.5 to -5.9 °C cm -1 . This represents a significant operating risk that can impact the dynamic operability of SOEC systems. In addition, the local temperature gradient was found to change directions on all nodes in SOEC solid materials, with the greatest impact on the upstream nodes. The SOEC model was also tested at the thermal neutral voltage using actual process air flow parameters as variable model inputs. Variable process air temperatures were found to induce alternating local temperature gradients on SOEC solid materials. These are new operational mechanisms for SOEC degradation relevant for load following operational modes yet distinct from previous reports. To mitigate these unfavorable features, the SOEC can be operated at voltages that are slightly (±20 mV) deviated from the thermal neutral voltage. Here, the corresponding net thermal energy change was less than 1.6% of the electric power consumption. This 1D real-time SOEC model established the basis of cyber-physical simulation of SOEC hybrid systems.

24 POWER TRANSMISSION AND DISTRIBUTION↗

An attention-based neural ordinary differential equation framework for modeling inelastic processes

To preserve strictly conservative behavior as well as model the variety of dissipative behavior displayed by solid materials, we propose a significant enhancement to the internal state variable-neural ordinary differential equation (ISV-NODE) framework. In this data-driven, physics-constrained modeling framework internal states are inferred rather than prescribed. The ISV-NODE consists of: (a) a stress model dependent on observable deformation and inferred internal state, and (b) a model of the evolution of the internal states. The enhancements to ISV-NODE proposed in this work are multifold: (a) a partially input convex neural network stress potential provides polyconvexity in terms of observed strain while leaving the inferred state unconstrained, and (b) an internal state flow model uses common latent features to inform novel attention-based gating and drives the flow of internal state only in dissipative regimes. We demonstrated that this architecture can accurately model dissipative and conservative behavior across an isotropic, isothermal elastic-viscoelastic-elastoplastic spectrum with three exemplars, while maintaining fundamental principles by design.

97 MATHEMATICS AND COMPUTING↗

Resilient information and inference networks under mixed-trust sensing

With ubiquitous digitization, sensing, and computational intelligence deployed in increasingly more and broader domains, including critical infrastructure, potentially misleading and destabilizing effects of multimodal anomalies and adversarial behavior are growing in importance. Here, we develop randomized and reinforcement learning-based strategies for strategically recruiting and utilizing deployed (and, thus, vulnerable and potentially faulty and/or compromised) nodes from information and inference networks, while defending against adversaries that attempt to misguide assessments of inferred variables. Recognizing that, besides communication and other costs, sampling from any observable node can either provide true data or dangerously expose our inference to misinformation (without being easily distinguishable what actually happens), the proposed strategies proceed by progressively recruiting nodes and cautiously scaling their information contribution based on assumed, or, in our reinforcement learning approach, intelligently weighed trustworthiness, with the learning approach also considering network-wide, threat-inclusive risk/value tradeoffs. While avoiding the hardware, communication, analytical and computational burden of explicit redundancy, the proposed defensive schemes enable on-the-fly assessments of underlying processes, and system-wide situational awareness with demonstrable resilience against adversarial activities.

97 - MATHEMATICS AND COMPUTING↗

Distributed Tomographic Reconstruction with Quantization

Conventional tomographic reconstruction typically depends on centralized servers for both data storage and computation, leading to concerns about memory limitations and data privacy. Distributed reconstruction algorithms mitigate these issues by partitioning data across multiple nodes, reducing server load and enhancing privacy. However, these algorithms often encounter challenges related to memory constraints and communication overhead between nodes. In this paper, we introduce a decentralized Alternating Directions Method of Multipliers (ADMM) with configurable quantization. By distributing local objectives across nodes, our approach is highly scalable and can efficiently reconstruct images while adapting to available resources. To overcome communication bottlenecks, we propose two quantization techniques based on K-means clustering and JPEG compression. Numerical experiments with benchmark images illustrate the tradeoffs between communication efficiency, memory use, and reconstruction accuracy.

Miao, Runxuan↗

Benders Decomposition Using Graph Modeling and Multi-Parametric Programming

Benders decomposition is a widely used method for solving large and structured optimization problems, but its performance is affected by the repeated solution of subproblems. We propose a flexible and modular algorithmic framework for accelerating Benders decomposition. Specifically, we express the problem structure by using a graph-theoretic modeling abstraction in which nodes represent optimization subproblems and edges represent connectivity between subproblems. A key innovation of our approach is that we embed multiparametric programming (mp) surrogates for node subproblems, which maps the exact analytical map of the subproblem solution space. The use of mp surrogates allows us to replace subproblem solves with fast look-ups and function evaluations for primal and dual variables during the iterative Benders process. We formally show the equivalence between classical Benders cuts and those derived from the mp solution. We implement our framework in the open-source PlasmoBenders.jl software package. To demonstrate the capabilities of the proposed framework, we apply it to a two-stage stochastic programming problem, which aims to make optimal capacity expansion decisions under market uncertainty. We evaluate both single-cut and multicut variants of Benders decomposition and show that the use of mp surrogates achieves substantial speedups in subproblem solve time, while preserving the convergence guarantees of Benders decomposition. We highlight advantages in solution analysis and interpretability that is enabled by mp critical region tracking; specifically, we show that these reveal how decisions evolve geometrically across the Benders search. Our results aim to demonstrate that combining surrogate modeling with graph modeling offers a promising and extensible foundation for structure-exploiting decomposition. In addition, by decomposing the problem into more tractable subproblems, the proposed approach also aims to overcome scalability issues of mp. Finally, the use of mp surrogates provides a unifying and modular optimization framework that enables the representation of heterogeneous node subproblems as modeling objects with a homogeneous structure.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Photochemical CO 2 Reduction by a Postsynthetically Modified Zr-MOF

Metal–organic frameworks are an excellent platform for photochemical CO 2 reduction into valuable chemicals. Herein, we report the synthesis and photocatalytic behavior of Ru@MOF-808, a Zr-based MOF, modified with a Ru-polypyridyl complex. The postsynthetic modification was achieved using solvent-assisted incorporation of bipyridine–carboxylate ligands onto the nodes of the MOF-808, followed by the coordination of Ru­(II)-terpyridine moiety. A thorough characterization including 1 H NMR, diffuse reflectance UV/vis, X-ray absorption spectroscopy and gas adsorption studies, combined with DFT calculations, provides strong support for efficient incorporation of the molecular Ru-complex at the loading of one Ru center per node. In the presence of a strong sacrificial reductant BIH, Ru@MOF-808 was found to catalyze the photochemical reduction of CO 2 into a mixture of CO and formate ion. When compared to the homogeneous model catalyst Ru­(tpy)­(bpy) 2+ , Ru@MOF-808 was found to exhibit higher formate yields. Additionally, to explain these formate enhancements, we propose a mechanism that involves CO 2 capture at the MOF nodes to form Zr-bicarbonate species, which further react in a hydride transfer reaction with photogenerated Ru–H donor, thereby outperforming molecular catalysts in HCOO – production. Overall, the results presented in this work indicate the potential of Zr-based MOFs in integrating CO 2 capture with its photochemical conversion to desired products.

CO2 reduction↗

PySIDT: Subgraph Isomorphic Decision Trees for Molecular Property Prediction

Accurate molecular property prediction is important across all fields of chemistry. Deep neural networks (DNNs) have become increasingly popular due to their ability to train automatically, avoiding the incredibly tedious process of constructing and extending traditional property estimation schemes. However, DNNs require large amounts of training data, are challenging to interpret, require large amounts of memory to load even during inference, and have severe difficulties incorporating qualitative chemical knowledge, which are often desired for molecular property prediction tasks. Here, in this study, we present PySIDT (https://github.com/zadorlab/PySIDT), a software for training and running inference on Subgraph Isomorphic Decision Trees (SIDTs). SIDTs are graph-based decision trees made of nodes associated with molecular substructures. Inference is done by descending target molecular structures down the decision tree to nodes with matching subgraph isomorphic substructures and making predictions based on the final (most specific) nodes matched. SIDTs scale down well to dataset sizes much smaller than is feasible for DNNs. As trees of molecular substructures, SIDTs are inherently readable and easy to visualize, making them easy to analyze. They are also straightforward to extend and retrain, facilitate uncertainty estimation, and enable easy integration of expert knowledge. We demonstrate the SIDT approach discussing its application to a diverse range of molecular prediction tasks: rate coefficient estimation, diffusion coefficient estimation, thermochemistry estimation, transition state bond stretch prediction, p K a prediction, stability of molecular structures, stability of surface structures, and prediction of surface lateral interaction energetics. Additionally, we demonstrate the power of the SIDT algorithms in two direct learning curve vanilla comparisons with the popular DNN-based software Chemprop and the popular gradient boosted trees-based software XGBoost on enthalpy of formation and rate coefficient prediction tasks. In particular, in the enthalpy of formation case, vanilla PySIDT is able to outperform vanilla Chemprop and XGBoost across the full range of training/validation set sizes out to 11,560 data points.

Johnson, Matthew Sean [Sandia National Laboratorie↗

Electrolyte-Dependent, “Microscopically Irreversible” H-Atom Transfer Kinetics of Ce-Based Metal–Organic Framework, Ce-MOF-808

Redox reactions at the interface of metal oxides and protic electrolytes almost always involve protons and electrons in equal amounts. Given the stoichiometry, these proton-coupled electron transfer (PCET) reactions are thermochemically equivalent to net H-atom transfer (HAT) reactions. The correlation between the chemical nature of solid catalysts and HAT kinetics has been employed for decades as the design principle for energy-relevant reactions (e.g., reactions of 2H + /H 2 ). More recently, chemists have experimentally determined that a change in liquid electrolytes that alters the microenvironment at the redox-active sites has an equally profound impact on electrocatalysis involving PCET/HAT. Yet, precise correlations between the chemical nature of electrolytes and the PCET kinetics are, to date, rare in the literature. Herein, we report our findings using the Ce-based metal−organic framework, Ce-MOF-808, as a model system. Each Ce 6 (μ 3 −O) 4 (μ 3 − OH) 4 (OH) 6 (H 2 O) 6 node of this MOF undergoes a 1H + /1e − redox reaction. Using chronoamperometry and the Cottrell analysis, we have determined that the PCET hopping kinetics within the pores of Ce-MOF-808 can change by orders of magnitude by altering the buffer species and the proton activity of the electrolyte. Furthermore, in all buffers, reductive reactions were ∼3−10 times faster in kinetics than the reverse oxidative reaction with the same electrochemical driving force, suggesting that the system, at first glance, violates the principle of microscopic reversibility. Isothermal titration calorimetry (ITC) and computational simulations corroborated that the buffer-node binding thermodynamics are quite distinct, depending on the chemical nature of the buffer and the oxidation state of the node. Together, these results suggest that the substrate and the product during the oxidative vs reductive reaction of Ce-MOF-808 are chemically different species, which explains the apparent ‘microscopic irreversibility.’ Thus, the rational modulation of electrolytes can dramatically enhance PCET kinetics, even though the solid electrodes remain identical. Implications of these findings are contrasted with the electrochemical/electrocatalytic behavior of other redox-active MOFs, heterogeneous catalysts, and enzymatic systems at the solid−liquid interface.

Ce-based MOF↗

Proton, Electron, and Hydrogen-Atom Transfer Thermodynamics of the Metal–Organic Framework, Ti-MIL-125, Are Intrinsically Correlated to the Structural Disorder

Interfacial charge transfer reactions involving protons and/or electrons are fundamental to heterogeneous catalysis and many other reactions relevant to energy, chemical, and biological sectors. Metal–organic frameworks (MOFs) with redox-active metal-oxo nodes have emerged as candidate materials to examine these reactions with near-atomic-level precision, given their crystalline nature. Here, we employed a colloidally stable, Ti-based MOF, Ti-MIL-125, with different crystal sizes to examine catalytically relevant charge transfer thermodynamics. The Ti 8 (μ 2 -O) 8 (μ 2 -OH) 4 nodes structurally mimic TiO 2 , which has shown some PCET reactivity toward reactions of H 2 , O 2 , and others. In this report, we have demonstrated that a change in crystal size induces different amounts of structural disorder to the Ti-oxo node, further changing the thermodynamics of proton/electron/hydrogen-atom transfer reactions. Using electrochemical open-circuit potential (E OCP ) measurements, we have determined that all crystallites undergo a 1H + /1e – redox reaction, which, given the stoichiometry, can be considered as a net H atom transfer (HAT) reaction. The thermodynamics of this HAT reaction, the Ti 3+ O–H bond dissociation free energy (BDFE), was dependent on the crystal size of the MOF, as the decrease in crystal size induced more structural disorder. Our computational calculations have indicated that this difference in BDFE is due to a local change in the geometry of Ti cations, rather than the commonly invoked defects, such as the “missing-linker” defect sites. Individual proton/electron transfer (PT/ET) thermodynamics were also highly dependent on the crystal sizes. These were probed using pK a or band gaps (E g ), respectively. These findings suggest that, particularly when MOFs are nanosized with a large amount of structural disorder, they should no longer be considered “true” single-site catalysts; this is an implicit, but widespread assumption within the MOF-based catalysis field. Implications of these findings will be contrasted with structurally similar metal oxides like TiO 2 and other redox-active MOFs.

Bond dissociation free energy↗

Precise Fermi level engineering in a topological Weyl semimetal via fast ion implantation

The precise controllability of the Fermi level is a critical aspect of quantum materials. For topological Weyl semimetals, there is a pressing need to fine-tune the Fermi level to the Weyl nodes and unlock exotic electronic and optoelectronic effects associated with the divergent Berry curvature. However, in contrast to two-dimensional materials, where the Fermi level can be controlled through various techniques, the situation for bulk crystals beyond laborious chemical doping poses significant challenges. Here, we report the milli-electron-volt (meV) level ultra-fine-tuning of the Fermi level of bulk topological Weyl semimetal tantalum phosphide using accelerator-based high-energy hydrogen implantation and theory-driven planning. By calculating the desired carrier density and controlling the accelerator profiles, the Fermi level can be experimentally fine-tuned from 5 meV below, to 3.8 meV below, to 3.2 meV above the Weyl nodes. High-resolution transmission electron microscopy reveals the crystalline structure is largely maintained under irradiation, while electrical transport indicates that Weyl nodes are preserved and carrier mobility is also largely retained. Our work demonstrates the viability of this generic approach to tune the Fermi level in semimetal systems and could serve to achieve property fine-tuning for other bulk quantum materials with ultrahigh precision.

36 MATERIALS SCIENCE↗

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↗

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↗

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↗

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↗

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↗

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↗

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↗

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)↗