Search NASASearch

SEARCH · Search NASA

Results for “flow networks”

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 19 records

Hierarchical Network Partitioning for Solution of Potential-Driven, Steady-State Nonlinear Network Flow Equations

The solution of potential-driven steady-state flow in large networks is a task which manifests in various engineering applications, such as transport of natural gas or water through pipeline networks. The resultant system of nonlinear equations depends on the network topology, and in general, there is no numerical algorithm that offers guaranteed convergence to the solution (assuming a solution exists). Some methods offer guarantees in cases where the network topology satisfies certain assumptions, but these methods fail for larger networks. On the other hand, the Newton-Raphson algorithm offers a convergence guarantee if the starting point lies close to the (unknown) solution. It would be advantageous to compute the solution of the large nonlinear system through the solution of smaller nonlinear sub-systems wherein the solution algorithms (Newton-Raphson or otherwise) are more likely to succeed. Here, this letter proposes and describes such a procedure, a hierarchical network partitioning algorithm that enables the solution of large nonlinear systems corresponding to potential-driven steady-state network flow equations.

42 ENGINEERING

From Points to Planes: A Workflow for Converting Three‐Dimensional Point Cloud Data Into Discrete Fracture Network Flow and Transport Models

We present the Point cLoud Algorithm for NEtwork Extraction of Discrete Fracture Networks (PLANE-DFN), a point cloud–based algorithm for automatic fracture network extraction designed to support discrete fracture network (DFN) modeling workflows. PLANE-DFN segments three-dimensional fracture planes from raw point cloud data using RANdom SAmple Consensus coupled with statistical outlier removal and density-based clustering to isolate individual fracture features. Each candidate plane is constrained against site-specific structural constraints based on strike and dip. After segmentation, each fracture is converted into a 2-D convex polygon suitable for meshing and simulation. The PLANE-DFN algorithm is validated by comparing geometric and flow and transport data against data from dfnWorks simulations with ensembles of plane-fit networks. We find that the flow and transport in plane-fit networks are comparable to dfnWorks-generated networks when realistic network geometry is maintained. The PLANE-DFN algorithm provides an automated and streamlined workflow to transform point clouds of data into DFN network geometry.

54 ENVIRONMENTAL SCIENCES

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

leblanc-lab/MA-PFN

This repository is a compact, runnable implementation of the Metric-Aware Particle Flow Network (MA-PFN) used to regress the Energy Mover's Distance (EMD). It trains MA-PFN alongside a matched, unconstrained Particle Flow Network (PFN), then compares their held-out accuracy and metric properties.

LeBlanc, Matt [@BrownUniversity]

NGEE Arctic Integrated Modeling (IM2): Improved subgrid hillslope hydrologic connectivity

This data product represents the integration of new code capability for arctic tundra hillslope hydrologic processes into the Energy Exascale Earth System Model (E3SM), through the E3SM Land Model (ELM) component. This code integration is the result of collaborative effort between the NGEE Arctic project and the E3SM project. The current ELM represents water movement primarily through vertical processes, such as precipitation, canopy interception, evaporation, infiltration, and soil water movement. Lateral water movement—such as surface runoff, subsurface flow, and river transport—plays a significant role in the hydrological cycle, especially in regions with varied topography. While E3SM includes a runoff routing component representing water transport in the river network, the lateral transport of water at the subgrid scale within the land model has previously not been taken into account. With the recent development of topographic units within the ELM subgrid data structure, there is an opportunity to simulate hillslope hydrologic connectivity by introducing water transport along topographic gradients. We expect that more realistic representation of hillslope hydrologic processes will lead to improved predictions of both soil water content and river network flows. Lateral transport of water at and near the surface is represented as a sub-grid process in this new code development. Water is tracked as it moves from higher to lower elevations within a gridcell. This capability uses the nested hierarchical sub-grid scheme within ELM to connect water fluxes from sub-grid elements with higher elevation to those with lower elevation. This data record consists of a single document (pdf format) that describes the theoretical basis for the hillslope hydrology processes added to ELM, and describes the modifications made to the ELM code. The Methods section of this metadata record includes a link to the public E3SM code repository where the exact code modifications as integrated in E3SM can be accessed. The Next-Generation Ecosystem Experiments: Arctic (NGEE Arctic), was a research effort to reduce uncertainty in Earth System Models by developing a predictive understanding of carbon-rich Arctic ecosystems and feedbacks to climate. NGEE Arctic was supported by the Department of Energy's Office of Biological and Environmental Research. The NGEE Arctic project had two field research sites: 1) located within the Arctic polygonal tundra coastal region on the Barrow Environmental Observatory (BEO) and the North Slope near Utqiagvik (Barrow), Alaska and 2) multiple areas on the discontinuous permafrost region of the Seward Peninsula north of Nome, Alaska. Through observations, experiments, and synthesis with existing datasets, NGEE Arctic provided an enhanced knowledge base for multi-scale modeling and contributed to improved process representation at global pan-Arctic scales within the Department of Energy's Earth system Model (the Energy Exascale Earth System Model, or E3SM), and specifically within the E3SM Land Model component (ELM).

Thornton, Peter E [ORNL] (ORCID:0000000247595158)

Photosynthetic Electron Flows and Networks of Metabolite Trafficking to Sustain Metabolism in Photosynthetic Systems

Photosynthetic eukaryotes have metabolic pathways that occur in distinct subcellular compartments. However, because metabolites synthesized in one compartment, including fixed carbon compounds and reductant generated by photosynthetic electron flows, may be integral to processes in other compartments, the cells must efficiently move metabolites among the different compartments. This review examines the various photosynthetic electron flows used to generate ATP and fixed carbon and the trafficking of metabolites in the green alga Chlamydomomas reinhardtii; information on other algae and plants is provided to add depth and nuance to the discussion. We emphasized the trafficking of metabolites across the envelope membranes of the two energy powerhouse organelles of the cell, the chloroplast and mitochondrion, the nature and roles of the major mobile metabolites that move among these compartments, and the specific or presumed transporters involved in that trafficking. These transporters include sugar-phosphate (sugar-P)/inorganic phosphate (Pi) transporters and dicarboxylate transporters, although, in many cases, we know little about the substrate specificities of these transporters, how their activities are regulated/coordinated, compensatory responses among transporters when specific transporters are compromised, associations between transporters and other cellular proteins, and the possibilities for forming specific ‘megacomplexes’ involving interactions between enzymes of central metabolism with specific transport proteins. Finally, we discuss metabolite trafficking associated with specific biological processes that occur under various environmental conditions to help to maintain the cell’s fitness. These processes include C4 metabolism in plants and the carbon concentrating mechanism, photorespiration, and fermentation metabolism in algae.

Plant Sciences

Graph-Theoretic Approaches to Quantifying Power System Resiliency

Although gaining growing importance, the subject of power system resiliency still lacks a commonly acknowledged metric. As a contribution to solving this complication, in this paper we leverage the concepts of spanning trees and Fiedler value from graph theory to propose two topology-based indices for quantifying the resiliency of power systems. The proposed indices require least information and may be applied to any other flow network, such as water or gas pipeline networks.

24 POWER TRANSMISSION AND DISTRIBUTION

Applications of Lifted Nonlinear Cuts to Convex Relaxations of the AC Power Flow Equations

Here, we demonstrate that valid inequalities, or lifted nonlinear cuts (LNC), can be projected to tighten the Second Order Cone (SOC), Convex DistFlow (CDF), and Network Flow (NF) relaxations of the AC Optimal Power Flow (AC-OPF) problem. We conduct experiments on 38 cases from the PGLib-OPF library, showing that the LNC strengthen the SOC and CDF relaxations in 100% of the test cases, with average and maximum differences in the optimality gaps of 6.2% and 17.5% respectively. The NF relaxation is strengthened in 46.2% of test cases, with average and maximum differences in the optimality gaps of 1.3% and 17.3% respectively. We also study the trade-off between relaxation quality and solve time, demonstrating that the strengthened CDF relaxation outperforms the strengthened SOC formulation in terms of runtime and number of iterations needed, while the strengthened NF formulation is the most scalable with the lowest relaxation quality improvement due to these LNC.

24 POWER TRANSMISSION AND DISTRIBUTION

Semi-supervised permutation invariant particle-level anomaly detection

The development of analysis methods to distinguish potential beyond the Standard Model phenomena in a model-agnostic way can significantly enhance the discovery reach in collider experiments. However, the typical machine learning (ML) algorithms employed for this task require fixed length and ordered inputs that break the natural permutation invariance in collision events. To address this, a semi-supervised anomaly detection tool is presented that takes a variable number of particle-level inputs and leverages a signal model to encode this information into a permutation invariant, event-level representation via supervised training with a Particle Flow Network (PFN). Data events are then encoded into this representation and given as input to an autoencoder for unsupervised ANomaly deTEction on particLe flOw latent sPacE (ANTELOPE), classifying anomalous events based on a low-level and permutation invariant input modeling. Performance of the ANTELOPE architecture is evaluated on simulated samples of hadronic processes in a high energy collider experiment, showing good capability to distinguish disparate models of new physics.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS

Predicting Flow in Fracture Networks With Quantum Algorithms

Uncertainty quantification plays a crucial role in the modeling of subsurface flow. For instance, uncertainties in the properties of geologic fracture networks significantly impact flow, requiring numerous simulations to accurately estimate quantities of interest. However, each simulation is computationally expensive because it requires solving a large linear system to capture features that involve both small and large fractures. An example is in percolation, where the interaction of many small fractures (which cumulatively can have a large surface area) with the rock matrix must be modeled precisely. Quantum computing is an emerging tool with the potential to address this issue. Quantum algorithms offer a significant speedup in solving linear systems, achieving efficiencies that are challenging to match with classical approaches. These classical approaches include direct solvers, such as LU decomposition, and iterative methods, notably preconditioned conjugate gradient, commonly used in subsurface modeling to solve large sparse systems. However, applying quantum algorithms to geologic fracture flow requires careful attention to algorithmic and problem-specific constraints to fully realize this quantum advantage. In this work we describe a quantum algorithm for generalized Monte Carlo applications with a quadratic speedup over the classical approaches which can be combined with the quantum speedup, currently under investigation, for solving quantum linear systems for subsurface flow. We show that for quantum algorithms the computational cost of estimating a quantity of interest for a statistical ensemble of networks is roughly the same as that of a single realization, essentially implying that one can get uncertainty quantification for free.

58 GEOSCIENCES

Streamlining latent spaces in machine learning using moment pooling

Many machine learning applications involve learning a latent representation of data, which is often high-dimensional and difficult to directly interpret. In this work, we propose “moment pooling,” a natural extension of deep sets networks which drastically decreases the latent space dimensionality of these networks while maintaining or even improving performance. Moment pooling generalizes the summation in deep sets to arbitrary multivariate moments, which enables the model to achieve a much higher effective latent dimensionality for a fixed learned latent space dimension. We demonstrate moment pooling on the collider physics task of quark/gluon jet classification by extending energy flow networks (EFNs) to moment EFNs. We find that moment EFNs with latent dimensions as small as 1 perform similarly to ordinary EFNs with higher latent dimension. This small latent dimension allows for the internal representation to be directly visualized and interpreted, which in turn enables the learned internal jet representation to be extracted in closed form. Published by the American Physical Society 2024

Gambhir, Rikab (ORCID:0000000251080448)

ReLU, Sparseness, and the Encoding of Optic Flow in Neural Networks

Accurate self-motion estimation is critical for various navigational tasks in mobile robotics. Optic flow provides a means to estimate self-motion using a camera sensor and is particularly valuable in GPS- and radio-denied environments. The present study investigates the influence of different activation functions—ReLU, leaky ReLU, GELU, and Mish—on the accuracy, robustness, and encoding properties of convolutional neural networks (CNNs) and multi-layer perceptrons (MLPs) trained to estimate self-motion from optic flow. Our results demonstrate that networks with ReLU and leaky ReLU activation functions not only achieved superior accuracy in self-motion estimation from novel optic flow patterns but also exhibited greater robustness under challenging conditions. The advantages offered by ReLU and leaky ReLU may stem from their ability to induce sparser representations than GELU and Mish do. Our work characterizes the encoding of optic flow in neural networks and highlights how the sparseness induced by ReLU may enhance robust and accurate self-motion estimation from optic flow.

97 MATHEMATICS AND COMPUTING

Comparing Delay-, Distance-, and Cordon-Based Congestion Pricing Strategies Via Large-Scale Simulation

This study compares the impacts of delay-, distance-, and cordon-based congestion pricing strategies for Austin, Texas, using the POLARIS agent-based activity-based travel demand simulation model. This approach enables agent-level heterogeneity and realistic choice options (including destination, mode, and activity scheduling) for dynamic traffic assignment and congestion feedbacks across a major metro region, which are features lacking in past work. To ensure comparability, distance-based tolls were set to generate the same revenue as delay-based tolling of $3.5 M/day, averaging $1.17/resident/day or $0.42/vehicle-trip. Delay-based pricing delivers 44% lower network delay and 13% lower VHT compared to the no-toll baseline, levels unmatched by other pricing strategies. At the height of the AM peak, drivers pay up to $0.13/mile on average, though most links in the network remain untolled. Distance-based pricing is the most effective at reducing VMT (by 4%), but VHT reductions (of 6%) primarily stem from drivers selecting closer destinations, achieving only one-fourth the delay reduction of delay-based pricing. Across various implementations of delay- and distance-based pricing, the results suggest that spatial variations of tolls are far more important than temporal variations. Cordon tolls produce minimal impacts at the network-wide level, but offer substantial delay reductions inside the cordon. Other major findings include: 1) delay-based pricing increases trip-making during the PM peak period due to backward shifts in discretionary-activity start times by higher-income residents; and 2) tolls’ spatial impacts, including changes in network flows and tolls paid by residents, vary substantially between delay- and distance-based pricing strategies.

Agent-based modeling

Modeling and Calibration of Supplier Selection Problem in Freight Agent-Based Simulations

Freight transportation modeling often struggles with data limitations, especially in accurately representing complex supplier selection processes and their impact on network flows. This research addresses this critical gap by developing a large-scale, calibrated agent-based model for supplier selection, complemented by a probabilistic heuristic for international shipments. Our approach integrates trade relationships between industry sectors, transportation costs, and a supplier-rating model adapted from existing literature. The model’s core objective is to minimize the discrepancy between modeled and observed commodity flows while ensuring a close match to regional shipping distance distributions. Implemented and tested across four major U.S. metropolitan areas—Atlanta, Chicago, Dallas–Fort Worth, and Los Angeles—the model demonstrates high fidelity in replicating observed freight patterns. Key findings reveal consistent alignment with national shipping distance trends and highlight significant spatial variations in commodity trade assignments and demand across the study regions. This behaviorally informed and transport-sensitive framework is designed to approximate real-world decision making, providing a robust tool for policymakers and planners to evaluate targeted interventions, assess infrastructure investments, and enhance supply chain resilience in the face of disruptions.

Ismael, Abdelrahman (ORCID:0000000303712110)

Pythia8 Quark and Gluon Jets (float32)

A float32 (single-precision) version of the quark and gluon jet dataset originally published by Komiske, Metodiev, and Thaler (Zenodo record 3164691). Only the 20-file subset without charm and bottom quark jets is included here. All simulation parameters and jet selection criteria are identical to the original: Pythia 8.226, √s = 14 TeV Quarks from WeakBosonAndParton:qg2gmZq, gluons from WeakBosonAndParton:qqbar2gmZg with the Z decaying to neutrinos FastJet 3.3.0, anti-k_t jets with R = 0.4 p_T^jet ∈ [500, 550] GeV, |y^jet| < 1.7 There are 20 files, each in compressed NumPy format (QG_jets_fp32_0.npz through QG_jets_fp32_19.npz). Each file contains two arrays: X: (100000, M, 4) — 50k quark and 50k gluon jets, randomly sorted, padded to max multiplicity M, with particle features (pt, rapidity, azimuthal angle, pdgid) stored as float32 y: (100000,) — jet labels, gluon = 0, quark = 1 The original dataset stores X in float64. Here X has been cast to float32, approximately halving file size. The y labels are unchanged. If you use this dataset, please cite the original Zenodo record and its associated paper: Komiske, Metodiev, Thaler, Energy Flow Networks: Deep Sets for Particle Jets, JHEP 01 (2019) 121, arXiv:1810.05165

energyflow

Pythia8 Quark and Gluon Jets (float16)

A float16 (half-precision) version of the quark and gluon jet dataset originally published by Komiske, Metodiev, and Thaler (Zenodo record 3164691). Only the 20-file subset without charm and bottom quark jets is included here. All simulation parameters and jet selection criteria are identical to the original: Pythia 8.226, √s = 14 TeV Quarks from WeakBosonAndParton:qg2gmZq, gluons from WeakBosonAndParton:qqbar2gmZg with the Z decaying to neutrinos FastJet 3.3.0, anti-k_t jets with R = 0.4 p_T^jet ∈ [500, 550] GeV, |y^jet| < 1.7 There are 20 files, each in compressed NumPy format (QG_jets_fp32_0.npz through QG_jets_fp32_19.npz). Each file contains two arrays: X: (100000, M, 4) — 50k quark and 50k gluon jets, randomly sorted, padded to max multiplicity M, with particle features (pt, rapidity, azimuthal angle, pdgid) stored as float32 y: (100000,) — jet labels, gluon = 0, quark = 1 The original dataset stores X in float64. Here X has been cast to float16, approximately halving file size. The y labels are unchanged. Users should be aware that float16 has limited dynamic range and precision. If you use this dataset, please cite the original Zenodo record and its associated paper: Komiske, Metodiev, Thaler, Energy Flow Networks: Deep Sets for Particle Jets, JHEP 01 (2019) 121, arXiv:1810.05165

energyflow

Pythia8 Quark and Gluon Jets (float8 e4m3FN)

A float8 (e4m3FN) quantized version of the quark and gluon jet dataset originally published by Komiske, Metodiev, and Thaler (Zenodo record 3164691). Only the 20-file subset without charm and bottom quark jets is included here. All simulation parameters and jet selection criteria are identical to the original: Pythia 8.226, √s = 14 TeV Quarks from WeakBosonAndParton:qg2gmZq, gluons from WeakBosonAndParton:qqbar2gmZg with the Z decaying to neutrinos FastJet 3.3.0, anti-k_t jets with R = 0.4 p_T^jet ∈ [500, 550] GeV, |y^jet| < 1.7 There are 20 files, each in compressed NumPy format (QG_jets_fp8e4m3fn_0.npz through QG_jets_fp8e4m3fn_19.npz). Each file contains two arrays: X: (100000, M, 4) — 50k quark and 50k gluon jets, randomly sorted, padded to max multiplicity M, with particle features (pt, rapidity, azimuthal angle, pdgid) y: (100000,) — jet labels, gluon = 0, quark = 1 Since NumPy has no native fp8 dtype, X is stored as float32, but the values have been quantized through TensorFlow's float8_e4m3fn type and carry only fp8 precision. The quantization procedure is as follows: a global per-channel scale factor is computed from the absolute maximum value across all 20 chunks (with FP8_MAX = 448.0, the maximum representable value of e4m3FN). Each chunk is then scaled into the fp8 dynamic range, round-tripped through tf.experimental.float8_e4m3fn, and scaled back. This global scaling ensures a consistent quantization grid across the full dataset. The y labels are unchanged. Users should be aware that e4m3FN has limited dynamic range and precision. We recommend verifying this format is appropriate for your application; for a less aggressive reduction see the float16 and float32 versions linked below. If you use this dataset, please cite the original Zenodo record and its associated paper: Komiske, Metodiev, Thaler, Energy Flow Networks: Deep Sets for Particle Jets, JHEP 01 (2019) 121, arXiv:1810.05165

DiLullo, Nicholas [Brown University] (ORCID:000000

Heat Transfer Experiments of a 1st Stage Blade Cascade for Supercritical CO2 Oxy-Combustion Turbine Application

The results of internally cooled 1st stage blade (S1B) cascade testing in a supercritical CO2 environment is presented. The turbine blade design has been previously established for the end application of an oxy-combustion turbine operating in the Allam-Fetvedt cycle with turbine inlet conditions of 305 bar and 1150°C. The internally cooled blade features leading edge (LE) region impingement cooling, mid-section ribbed serpentine passages, and a pin-finned trailing edge (TE) region before cooling ejection holes. The geometry for the tested blade cascade has a cooled central blade with un-cooled blades on either side to match flowpath areas of the actual turbine. The flowpath reuses internal components previously employed for mid-section region ribbed serpentine passage experiments that established Nusselt number enhancement ratios over a range of Reynolds numbers from 100,000-400,000. New components include flow conditioning plates upstream and downstream of the blade cascade to adequately represent the flow field and blade external heat transfer coefficient profiles for the actual turbine. The cooled central blade utilizes uniform crystal temperature sensors (UCTS) with six sensors each on the blade pressure and suction surfaces distributed radially and from LE to TE. The post-processed UCTS quantified the maximum wall temperature seen at each installed sensor location. The test procedure consisted of establishing supercritical CO2 cooling flow temperature and flow rate and maintaining it throughout the test. The flow rate aims to match that for the actual in-service turbine blade design and is maintained through an orifice restriction to keep the pressure differential between internal cooling flow and external hot flow nearly constant. For the sCO2 flow path external to the blade, temperatures were ramped throughout the test via control of the test loop’s natural gas burner heater. The maximum temperature seen was 468°C and held constant for a duration of 10 minutes at which the blade metal temperature was predicted to be at its maximum before ramping down. For the turbine blade design for service inlet conditions, external flow path computational fluid dynamics (CFD) results and an internal cooling 1-D thermal and hydraulic flow network model using experimentally validated correlations served as thermal finite element (FE) boundary conditions to predict blade metal temperatures. These predicted temperatures were subsequently utilized in a structural FE model to predict blade life ratings dictated by Haynes 282 creep strength data, having a strong dependence on temperature. The boundary conditions experienced during testing are used in the same workflow and compared to the experimental results, with the goal of validating the analysis methodology and providing insight on the uncertainty in local metal temperature predictions.

20 FOSSIL-FUELED POWER PLANTS