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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Dynamic Disruption Resilience in Intermodal Transport Networks: Integrating Flow Weighting and Centrality Measures

Resilient intermodal freight networks are vital for sustaining supply chains amid increasing threats from natural hazards and cyberattacks. Transportation resilience has been widely studied; understanding how random and targeted disruptions affect structural connectivity and functional performance remains a key challenge. To address this, this study evaluates the robustness of the US intermodal freight network, which consists of rail and water modes, using a simulation-based framework that integrates graph-theoretic metrics with flow-weighted centrality measures. Disruption scenarios are examined, including random failures as well as targeted node and edge removals based on static and dynamically updated degree and betweenness centrality. To reflect more realistic conditions, flow-weighted degree centralities (WDC) and partial node degradation are considered. Two resilience indicators are used: (1) the size of the giant connected component to measure structural connectivity; and (2) flow-weighted network efficiency (NE) to assess freight mobility under disruption. The results show that progressively degrading nodes ranked by WDC to 60% of their original functionality causes a sharper decline in normalized NE, for up to approximately 45 affected nodes, than complete failure (100% loss of functionality) applied to nodes targeted by weighted betweenness centrality or selected at random. This highlights how partial degradation of high-tonnage hubs can produce disproportionately large functional losses. The findings emphasize the need for resilience strategies that go beyond network topology to incorporate freight flow dynamics.

42 ENGINEERING↗
DOE OSTI2024

Dynamic Temporal Graph Sequence Data for Resilience-Oriented Distribution Network Reconfiguration

This dataset comprises temporal dynamic graph sequences generated from power grid simulations focused on grid reconfiguration to enhance resilience. The simulations model failure propagation under varying conditions, with nodes assigned distinct failure probabilities. For each time step, the dataset captures the evolution of node states (functional or failed) and features critical to grid operations, such as pv_output, load_profile, load_dispatch, dg_output, loss, and voltage. Node types include sources, normal loads, and nodes with specific equipment like PVs, micro turbines, or shunt capacitors. The dataset is structured to support the training of dynamic graph neural networks, facilitating research on node feature prediction and edge dynamics under failure scenarios. Three distinct configurations are included, providing a robust foundation for modeling power grid resilience.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2025

Replace Human Intelligence with Fast and Smart Geometric Reasoning and Graph Neural Network to Accelerate Next Gen ModSim Workflows

We present an agent-guided approach to CAD geometry decomposition that automates hex/hybrid meshing with graph neural networks (GNNs) to accelerate next-generation ModSim workflows. Our end-to-end pipeline (i) reduces 3D boundary-representation (B-Rep) models to a 2D chordal axis skeleton (CAT) and then to a 1D bipartite graph of surface and curve nodes, (ii) assigns per node labels as Cubit® WebCut actions, (iii) trains a multi-action GNN under supervised learning, and (iv) predicts five surface-node and three curve-node actions on out-of-distribution test geometries. Each graph node carries geometric, topological, and meshing attributes drawn from the B-Rep “skin” and CAT “skeleton,” with two-way mappings across 3D↔2D↔1D representations to maintain traceability back to 3D CAD. The supervised learning model exhibits stable convergence of the binary cross-entropy loss and achieves 98.7% accuracy on unseen lattice models. To operationalize decision-making, we rank predicted commands by geometric significance and prototyped the agent-guided workflow through the Cubit® Meshing PowerTool GUI. As a stretch goal, we explore reinforcement learning (RL) to reduce or remove label requirements and to learn policies for action sequences that maximize total reward (e.g., size of hex-meshable regions and resulting hex mesh quality). When all-hex meshing is not feasible, the agent assists in producing hybrid meshes—prioritizing hex in critical regions and transitioning to tetrahedral elements (tets) elsewhere—maintaining fidelity while ensuring robustness. The overarching objective is to replace manual, heuristics-based decomposition with data-driven, reproducible automation, cutting meshing turnaround time by orders of magnitude. We anticipate direct impact on simulation workflows through intelligent, scalable decomposition of complex CAD models into hex-meshable subdomains.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Closing the Loop between In Situ Stress Complexity and EGS Fracture Complexity

We present an agent-guided approach to CAD geometry decomposition that automates hex/hybrid meshing with graph neural networks (GNNs) to accelerate next-generation ModSim workflows. Our end-to-end pipeline (i) reduces 3D boundary-representation (B-Rep) models to a 2D chordal axis skeleton (CAT) and then to a 1D bipartite graph of surface and curve nodes, (ii) assigns per node labels as Cubit® WebCut actions, (iii) trains a multi-action GNN under supervised learning, and (iv) predicts five surface-node and three curve-node actions on out-of-distribution test geometries. Each graph node carries geometric, topological, and meshing attributes drawn from the B-Rep “skin” and CAT “skeleton,” with two-way mappings across 3D↔2D↔1D representations to maintain traceability back to 3D CAD. The supervised learning model exhibits stable convergence of the binary cross-entropy loss and achieves 98.7% accuracy on unseen lattice models. To operationalize decision-making, we rank predicted commands by geometric significance and prototyped the agent-guided workflow through the Cubit® Meshing PowerTool GUI. As a stretch goal, we explore reinforcement learning (RL) to reduce or remove label requirements and to learn policies for action sequences that maximize total reward (e.g., size of hex-meshable regions and resulting hex mesh quality). When all-hex meshing is not feasible, the agent assists in producing hybrid meshes—prioritizing hex in critical regions and transitioning to tetrahedral elements (tets) elsewhere—maintaining fidelity while ensuring robustness. The overarching objective is to replace manual, heuristics-based decomposition with data-driven, reproducible automation, cutting meshing turnaround time by orders of magnitude. We anticipate direct impact on simulation workflows through intelligent, scalable decomposition of complex CAD models into hex-meshable subdomains.

42 ENGINEERING↗
DOE OSTI2025

Demonstration Trials of AI/ML Edge+Cloud Suite (CRADA Final Report)

PACE AI and LBNL partnered under this CRADA to test and evaluate the PACE5 edge node prototype, an AI/ML edge and cloud-based suite, at FLEXLAB.The objective of the test was to evaluate the PACE5 edge node prototype's ability to perform demand shed and take to dynamic price signals, and to demonstrate advanced fault detection and microgrid monitoring capabilities.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Explainable Graph Learning for Particle Accelerator Operations

Particle accelerators are vital tools in physics, medicine, and industry, requiring precise tuning to ensure optimal beam performance. However, real-world deviations from idealized simulations make beam tuning a time-consuming and error-prone process. In this work, we propose an explanation-driven framework for providing actionable insight into beamline operations, with a focus on the injector beamline at the Continuous Electron Beam Accelerator Facility (CEBAF). We represent beamline configurations as heterogeneous graphs, where setting nodes represent elements that human operators can actively adjust during beam tuning, and reading nodes passively provide diagnostic feedback. To identify the most influential setting nodes responsible for differences between any two beamline configurations, our approach first predicts the resulting changes in reading nodes caused by variations in settings, and then learns importance scores that capture the joint influence of multiple setting nodes. Experimental results on real-world CEBAF injector data demonstrate the framework’s ability to generate interpretable insights that can assist human operators in beamline tuning and reduce operational overhead.

Wang, Song [Univ. of Virginia, Charlottesville, VA↗
DOE OSTI2026

Photooxidation of Organic Sulfide Enhanced by Heavy Atom Effect in Porphyrin Metal–Organic Frameworks with a Sea Topology

The photoactivity of three porphyrin-based metal-organic frameworks (PMOFs) incorporating Al, Ga, and In nodes was systematically evaluated using the photooxidation of an organic sulfide (2-chloroethyl ethyl sulfide, or CEES; a mustard gas simulant). Faster photodegradation of CEES was observed for PMOFs with heavier metal nodes, placing In-PMOF as the most efficient photocatalyst in the series. Guided by this insight, we developed CSLA-10, a MOF integrating In nodes and Sn-doped porphyrin linker to synergistically amplify heavy-atom effects at both the nodes and ligand levels. CSLA-10 exhibited the fastest reported CEES photooxidation to date, achieving a half-life of 38 s in methanol under blue LED irradiation. When grafted onto textiles, CSLA-10 enabled solvent-free CEES degradation in air/O 2 with a half-life of 2.7 min and complete conversion within 7 min, representing the most rapid full degradation reported under solvent-free conditions. Furthermore, this work establishes a dual heavy-atom strategy for enhancing intersystem crossing and singlet oxygen generation in porphyrin MOFs, providing a rational design principle for next-generation photocatalysts for the degradation of toxic organic sulfides.

Metal-organic frameworks↗
DOE OSTI2025

Microscopic Imprints of Learned Solutions in Tunable Networks

In physical networks trained using supervised learning, physical parameters are adjusted to produce desired responses to inputs. An example is an electrical contrastive local learning network of nodes connected by edges that adjust their conductances during training. When an edge conductance changes, it upsets the current balance of every node. In response, physics adjusts the node voltages to minimize the dissipated power. Learning in these systems is therefore a coupled double-optimization process, in which the network descends both a cost landscape in the high-dimensional space of edge conductances and a physical landscape—the power dissipation—in the high-dimensional space of node voltages. Because of this coupling, the physical landscape of a trained network contains information about the learned task. Here, we derive a structure-function relation for trained tunable networks and demonstrate that all the physical information relevant to the trained input-output relation can be captured by a tuning susceptibility, an experimentally measurable quantity. We supplement our theoretical results with simulations to show that the tuning susceptibility is correlated with functional importance and that we can extract physical insight into how the system performs the task from the conductances of highly susceptible edges. Our analysis is general and can be applied directly to mechanical networks, such as networks trained for protein-inspired function such as allostery.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Characterization and Optimization of the Fitting of Quantum Correlation Functions

This case study presents a characterization and optimization of an application code for extracting parton distribution functions from high energy electron-proton scattering data. Profiling this application code reveals that the phase-space density computation accounts for 93% of the overall execution time for a single iteration on a single core. When executing multiple iterations in parallel on a multicore system, the application spends 78% of its overall execution time idling due to load imbalance. We address these issues by first transforming the application code from Python to C++ and then tackling the application load imbalance via a hybrid scheduling strategy that combines dynamic and static scheduling. These techniques result in a 62% reduction in CPU idle time and a 2.46x speedup in overall execution time per node. In addition, the typically enabled power-management mechanisms in supercomputers (e.g., AMD Turbo Core, Intel Turbo Boost, and RAPL) can significantly impact intra-node scalability when more than 50% of the CPU cores are used. This finding underscores the importance of understanding system interactions with power management, as they can adversely impact application performance, and highlights the necessity of intra-node scaling tests to identify performance degradation that inter-node scaling tests might otherwise overlook.

Chuang, Pi-Yueh [Virginia Tech,Dept. of Computer S↗
DOE OSTI2024

Bilevel Nodal Behind-the-meter Solar Disaggregation Under Unexpected Extreme Weather Conditions

As the power grid undergoes significant paradigm shift due to the increasing penetration of renewable generation, the ever-growing installation of behind-the-meter (BTM) solar generation in the power grid also has a significant impact on nodal loads, posing challenges on transmission operators. Furthermore, increasing frequent and severe extreme weather events intertwine with ubiquitous BTM solar generations and have amplified the challenges of accurately model nodal load profiles, especially under the lack of ground-truth information for verification. To tackle these challenges, this paper introduces a bilevel model that utilizes year-long data (e.g., proxy solar, zonal load, and individual node load profiles) to disaggregate metered profiles into actual demand and BTM solar generation at each transmission node. The proxy solar not only scales the BTM solar generation of individual nodes but also create a compensation term for enhancing performance on days with unexpected extreme weather events. The proposed algorithm is validated with real-world PJM Interconnection data during unexpected events like the recent Winter Storm Elliott. For quantitative evaluations, a novel Score error is introduced, which is based on mean percentages and load scales and offers a universal assessment method suitable for all nodes and different data formats (e.g., normalized or raw values).

behind-the-meter solar, load disaggregations, load↗
DOE OSTI2024

Emulator-Based Bayesian Calibration of the CISNET Colorectal Cancer Models

Purpose To calibrate Cancer Intervention and Surveillance Modeling Network (CISNET)'s SimCRC, MISCAN-Colon, and CRC-SPIN simulation models of the natural history colorectal cancer (CRC) with an emulator-based Bayesian algorithm and internally validate the model-predicted outcomes to calibration targets.Methods We used Latin hypercube sampling to sample up to 50,000 parameter sets for each CISNET-CRC model and generated the corresponding outputs. We trained multilayer perceptron artificial neural networks (ANNs) as emulators using the input and output samples for each CISNET-CRC model. We selected ANN structures with corresponding hyperparameters (i.e., number of hidden layers, nodes, activation functions, epochs, and optimizer) that minimize the predicted mean square error on the validation sample. We implemented the ANN emulators in a probabilistic programming language and calibrated the input parameters with Hamiltonian Monte Carlo-based algorithms to obtain the joint posterior distributions of the CISNET-CRC models' parameters. We internally validated each calibrated emulator by comparing the model-predicted posterior outputs against the calibration targets.Results The optimal ANN for SimCRC had 4 hidden layers and 360 hidden nodes, MISCAN-Colon had 4 hidden layers and 114 hidden nodes, and CRC-SPIN had 1 hidden layer and 140 hidden nodes. The total time for training and calibrating the emulators was 7.3, 4.0, and 0.66 h for SimCRC, MISCAN-Colon, and CRC-SPIN, respectively. The mean of the model-predicted outputs fell within the 95% confidence intervals of the calibration targets in 98 of 110 for SimCRC, 65 of 93 for MISCAN, and 31 of 41 targets for CRC-SPIN.Conclusions Using ANN emulators is a practical solution to reduce the computational burden and complexity for Bayesian calibration of individual-level simulation models used for policy analysis, such as the CISNET CRC models. In this work, we present a step-by-step guide to constructing emulators for calibrating 3 realistic CRC individual-level models using a Bayesian approach.

artificial neural networks↗
DOE OSTI2026

Sap Velocity Data for Urban Trees in Chicago, Illinois (2024-2025)

This dataset contains uncorrected sap velocity measurements using the heat ratio method (HRM) collected using ICT International SFM1x sensors at five urban sites in Chicago, Illinois, as part of the DOE CROCUS project. The data includes continuous monitoring of sap velocity from various tree species, including Maples (Acer spp.): Sugar Maple (Acer saccharum), Silver Maple (Acer saccharinum), and Red Maple (Acer rubrum); Oaks (Quercus spp.): Swamp White Oak (Quercus bicolor); American Elm (Ulmus americana); Honey Locust (Gleditsia triacanthos); Cottonwood (Populus deltoides); and Tree of Heaven (Ailanthus altissima) across Chicago State University (CSU), Northeastern Illinois University (NEIU), Northwestern University (NU), University of Illinois Chicago (UIC), and West Woodlawn "Blacks in Green" (BIG). These include both street trees and those in urban park locations. Measurements were collected at 15-20 minute intervals, depending on the sensor, and transmitted via Long Range Wide Area Network (LoRaWAN) protocols. The wireless data was collected by Sage Network (https://sagecontinuum.org/) nodes. The dataset includes sensor ID, Global Positioning System (GPS) coordinates, tree species (common and scientific names), tree identification number, diameter at breast height (DBH in cm), uncorrected sap velocity measurements (cm/hr) from both inner and outer probes, and Sage Node identifiers so the data can be mapped to related variables such as air quality and wind speed that were collected on the Sage nodes. All timestamps are in local Chicago time (CDT/CST). Quality control flags are provided using a 3-bit binary system indicating physical range violations (< -10 or > 60 cm/hr), step spikes (absolute difference > 36 cm/hr), and stuck sensor conditions (> 10 consecutive identical values). These are raw data, not corrected for wood anatomy or species-specific characteristics. Data is provided in comma separated (CSV) format. This dataset is part of a larger collection of CROCUS environmental monitoring data, including linked datasets from Air Quality Transmitter (AQT) sensors, Weather Transmitter (WXT) sensors, and Multi-Function Research LoRaWAN (MFR) Nodes. DOIs for the supporting data are provided as part of this data package.

Chicago↗
DOE OSTI2026

Methodology For Determining The Effective Aircraft Impact Area For Irregularly Shaped Facilities

This report presents a computational methodology for determining the effective aircraft impact area for irregularly shaped facilities, extending the approach in Department of Energy (DOE) Standard 3014 by decomposing “critical areas” into multiple rectangular nodes rather than relying on a single bounding cuboid. This method reduces unnecessary conservatism that can arise when non-critical space is enveloped by a single footprint. The facility’s critical areas are partitioned into nodes of constant height, a baseline aircraft impact trajectory is established, and the facility perspective is rotated to accommodate arbitrary heading angles. For each node, analytic expressions are provided to construct the node-specific effective impact polygon that accounts for skid distance, structural footprint, fly-in (shadow) region driven by building height and descent angle, and wingspan offsets capturing wing-only strikes.

42 ENGINEERING↗
DOE OSTI2026

DAOS Benchmarks and Findings

We benchmark DAOS on a 127-node, 4,064-target pool using fio, IOR, IO500, and mdtest, comparing the DFS API against DFuse+POSIX. Single-client fio sweeps show larger block sizes and writes yield higher bandwidth, with similar random/sequential performance. Multi-node IOR (1–32 nodes, 6–48 tasks/node) shows bandwidth saturating around 32 tasks/node, with large transfer sizes hurting read throughput at high concurrency and write latency growing faster than read latency. An 8-node IO500 run shows DFS achieving ~5x higher bandwidth and ~190x higher IOPS than POSIX. We also detail operational issues: SCM target-filling under mdtest, intermittent NA_HOSTUNREACH errors, fio CPU-affinity failures, and a pool error storm resolved by recreation.

George, Rebecca [Thomas Jefferson National Acceler↗
DOE OSTI2024

Histopathological characteristics of PRRS and expression profiles of viral receptors in the piglet immune system

Porcine reproductive and respiratory syndrome (PRRS) is a highly contagious viral disease that causes significant economic losses to the swine industry worldwide. PRRS virus (PRRSV) infection is a receptor-mediated endocytosis and replication process. The purpose of this study was to determine the localization and expression of four important PRRSV receptors in immunological organs of piglets. After piglets were infected with PRRSV, Hematoxylin and Eosin staining, immunofluorescence, and Western blot were used to perform histopathological examination and receptors distribution analysis. The results showed that PRRSV caused severe damage to the piglets’ immune organs, including atrophy of the thymus and swelling of lymph node. Histopathological lesions were mainly observed in the lung and lymph node and were characterized by interstitial pneumonia, collapsed follicles, exhaustion of germinal centers, and extensive hemorrhage. Immunofluorescence staining and Western blot results showed that the receptors of CD163 and NMHCII-A were mainly distributed in the thymus, hilar lymph nodes, and mesenteric lymph nodes. However, Sn and vimentin receptors were expressed at low levels in the immune organs of piglets. The distribution of the four receptors in the immune organs was more concentrated in the cortex but was more scattered in the medulla. Compared to the control group, the relative expression of the four receptors increased significantly in most immune organs after viral infection. In conclusion, our study examined the distribution and expression of four PRRSV receptors in immunological organs. We observed a significant increase in the expression of Sn, CD163, and vimentin following viral infection. These findings may provide potential targets for future antiviral reagent design or vaccine development.

Chen, Hong↗
DOE OSTI2024

Implementing Ordinary Differential Equation Solvers in Rust Programming Language for Modeling Vehicle Powertrain Systems: Preprint

Efficient and accurate ordinary differential equation (ODE) solvers are necessary for powertrain and vehicle dynamics modeling. However, current commercial ODE solvers can be financially prohibitive, leading to a need for accessible, effective, open-source ODE solvers designed for powertrain modeling. Rust is a compiled programming language that has the potential to be used for fast and easy-to-use powertrain models, given its exceptional computational performance, robust package ecosystem, and short time required for modelers to become proficient. However, of the three commonly used (>3,000 downloads) packages in Rust with ODE solver capabilities, only one has more than four numerical methods implemented, and none are designed specifically for modeling physical systems. Therefore, the goal of the Differential Equation System Solver (DESS) was to implement accurate ODE solvers in Rust designed for the component-based problems often seen in powertrain modeling. DESS is a text-based software package that provides a flexible framework for building and solving systems of ODEs. This allows DESS to be included as a dependency for automotive powertrain models that require a variety of solvers and solver configurations. Seven explicit ODE solver methods have been implemented in DESS: Euler’s, Heun’s, midpoint, Ralston’s, classic Runge-Kutta, Bogacki-Shampine, and Cash-Karp. These represent five fixed-step methods and two adaptive-step methods. This paper shows that the solver implementations increase accuracy and computational efficiency compared to Euler's method when modeling a system of three thermal masses in Rust. DESS also includes features designed for modeling component-based physical systems. Users can define relationships between nodes in their system, which the package then translates into a system of equations, leading to simpler and more intuitive code. In the case of a three-thermal-mass system, the user can specify node thermal properties (e.g., thermal capacitance), how nodes are interconnected, and thermal conductance between nodes rather than providing a system of equations. The core contribution from this work is an open-source, text-based Rust package with ODE solvers for automotive powertrain modeling to support cost-free, fast, and accurate simulation.

ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2024

Refactoring the elastic–viscous–plastic solver from the sea ice model CICE v6.5.1 for improved performance

This study focuses on the performance of the elastic–viscous–plastic (EVP) dynamical solver within the sea ice model, CICE v6.5.1. The study has been conducted in two steps. First, the standard EVP solver was extracted from CICE for experiments with refactored versions, which are used for performance testing. Second, one refactored version was integrated and tested in the full CICE model to demonstrate that the new algorithms do not significantly impact the physical results. The study reveals two dominant bottlenecks, namely (1) the number of Message Parsing Interface (MPI) and Open Multi-Processing (OpenMP) synchronization points required for halo exchanges during each time step combined with the irregular domain of active sea ice points and (2) the lack of single-instruction, multiple-data (SIMD) code generation. The standard EVP solver has been refactored based on two generic patterns. The first pattern exposes how general finite differences on masked multi-dimensional arrays can be expressed in order to produce significantly better code generation by changing the memory access pattern from random access to direct access. The second pattern takes an alternative approach to handle static grid properties. The measured single-core performance improvement is more than a factor of 5 compared to the standard implementation. The refactored implementation of strong scales on the Intel® Xeon® Scalable Processors series node until the available bandwidth of the node is used. For the Intel® Xeon® CPU Max series, there is sufficient bandwidth to allow the strong scaling to continue for all the cores on the node, resulting in a single-node improvement factor of 35 over the standard implementation. This study also demonstrates improved performance on GPU processors.

58 GEOSCIENCES↗
DOE OSTI2025

Central Compact Finite‐Difference Scheme With High Spectral Resolution for KdV Equation

This work presents a combination of cell‐node and cell‐centered compact finite difference scheme for the approximation of third derivatives involved in Korteweg–de Vries (KdV) equations. This approach employs a half‐shifted derivative construction at cell centers, avoiding the need for compact interpolation, thereby removing transfer errors; hence, it improves spectral resolution and maintains high‐order accuracy. Fourier analysis is performed to show the spectral properties of the proposed formulation, which provides higher spectral resolutions as compared to node‐based compact schemes. A filtering strategy is incorporated to suppress high‐frequency oscillations without compromising the accuracy of the numerical scheme, and the total variation diminishing Runge Kutta (TVDRK3) method is applied for time integration. Numerical experiments on linear, nonlinear, and coupled KdV systems are conducted, and a comparative analysis with cell‐node compact schemes confirms that the proposed scheme consistently reduces errors by up to an order of magnitude and achieves high spectral resolution properties.

97 MATHEMATICS AND COMPUTING↗