Search NASA⌕ Search

SEARCH · Search NASA

Results for “network flow”

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 73 records · Page 4

Infrared-safe energy weighting does not guarantee small nonperturbative effects

Infrared and collinear (IRC) safety has long been used a proxy for robustness when developing new jet substructure observables. This guiding philosophy has been carried into the deep learning era, where IRC-safe neural networks have been used for many jet studies. For graph-based neural networks, the most straightforward way to achieve IRC safety is to weight particle inputs by their energies. However, energy-weighting by itself does not guarantee that perturbative calculations of machine-learned observables will enjoy small nonperturbative corrections. Here, in this paper, we demonstrate the sensitivity of IRC-safe networks to nonperturbative effects, by training an energy flow network (EFN) to maximize its sensitivity to hadronization. We then show how to construct Lipschitz energy flow networks (L-EFNs), which are both IRC safe and relatively insensitive to nonperturbative corrections. We demonstrate the performance of L-EFNs on generated samples of quark and gluon jets, and showcase fascinating differences between the learned latent representations of EFNs and L-EFNs.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Extension of a System Level Tool for Component Level Analysis

This paper presents an extension of a numerical algorithm for network flow analysis code to perform multi-dimensional flow calculation. The one dimensional momentum equation in network flow analysis code has been extended to include momentum transport due to shear stress and transverse component of velocity. Both laminar and turbulent flows are considered. Turbulence is represented by Prandtl's mixing length hypothesis. Three classical examples (Poiseuille flow, Couette flow, and shear driven flow in a rectangular cavity) are presented as benchmark for the verification of the numerical scheme.

Majumdar, Alok↗

Extension of a System Level Tool for Component Level Analysis

This paper presents an extension of a numerical algorithm for network flow analysis code to perform multi-dimensional flow calculation. The one dimensional momentum equation in network flow analysis code has been extended to include momentum transport due to shear stress and transverse component of velocity. Both laminar and turbulent flows are considered. Turbulence is represented by Prandtl's mixing length hypothesis. Three classical examples (Poiseuille flow, Couette flow and shear driven flow in a rectangular cavity) are presented as benchmark for the verification of the numerical scheme.

Majumdar, Alok↗

Modeling Data Flows with Network Calculus in Cyber-Physical Systems: Enabling Feature Analysis for Anomaly Detection Applications

The electric grid is becoming increasingly cyber-physical with the addition of smart technologies, new communication interfaces, and automated grid-support functions. Because of this, it is no longer sufficient to only study the physical system dynamics, but the cyber system must also be monitored as well to examine cyber-physical interactions and effects on the overall system. To address this gap for both operational and security needs, cyber-physical situational awareness is needed to monitor the system to detect any faults or malicious activity. Techniques and models to understand the physical system (the power system operation) exist, but methods to study the cyber system are needed, which can assist in understanding how the network traffic and changes to network conditions affect applications such as data analysis, intrusion detection systems (IDS), and anomaly detection. In this paper, we examine and develop models of data flows in communication networks of cyber-physical systems (CPSs) and explore how network calculus can be utilized to develop those models for CPSs, with a focus on anomaly and intrusion detection. This provides a foundation for methods to examine how changes to behavior in the CPS can be modeled and for investigating cyber effects in CPSs in anomaly detection applications.

97 MATHEMATICS AND COMPUTING↗

Limits of multifunctionality in tunable networks

Nature is rife with networks that are functionally optimized to propagate inputs to perform specific tasks. Whether via genetic evolution or dynamic adaptation, many networks create functionality by locally tuning interactions between nodes. Here we explore this behavior in two contexts: strain propagation in mechanical networks and pressure redistribution in flow networks. By adding and removing links, we are able to optimize both types of networks to perform specific functions. We define a single function as a tuned response of a single “target” link when another, predetermined part of the network is activated. Using network structures generated via such optimization, we investigate how many simultaneous functions such networks can be programed to fulfill. We find that both flow and mechanical networks display qualitatively similar phase transitions in the number of targets that can be tuned, along with the same robust finite-size scaling behavior. We discuss how these properties can be understood in the context of constraint–satisfaction problems.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Computing Bounds on Resource Levels for Flexible Plans

A new algorithm efficiently computes the tightest exact bound on the levels of resources induced by a flexible activity plan (see figure). Tightness of bounds is extremely important for computations involved in planning because tight bounds can save potentially exponential amounts of search (through early backtracking and detection of solutions), relative to looser bounds. The bound computed by the new algorithm, denoted the resource-level envelope, constitutes the measure of maximum and minimum consumption of resources at any time for all fixed-time schedules in the flexible plan. At each time, the envelope guarantees that there are two fixed-time instantiations one that produces the minimum level and one that produces the maximum level. Therefore, the resource-level envelope is the tightest possible resource-level bound for a flexible plan because any tighter bound would exclude the contribution of at least one fixed-time schedule. If the resource- level envelope can be computed efficiently, one could substitute looser bounds that are currently used in the inner cores of constraint-posting scheduling algorithms, with the potential for great improvements in performance. What is needed to reduce the cost of computation is an algorithm, the measure of complexity of which is no greater than a low-degree polynomial in N (where N is the number of activities). The new algorithm satisfies this need. In this algorithm, the computation of resource-level envelopes is based on a novel combination of (1) the theory of shortest paths in the temporal-constraint network for the flexible plan and (2) the theory of maximum flows for a flow network derived from the temporal and resource constraints. The measure of asymptotic complexity of the algorithm is O(N O(maxflow(N)), where O(x) denotes an amount of computing time or a number of arithmetic operations proportional to a number of the order of x and O(maxflow(N)) is the measure of complexity (and thus of cost) of a maximumflow algorithm applied to an auxiliary flow network of 2N nodes. The algorithm is believed to be efficient in practice; experimental analysis shows the practical cost of maxflow to be as low as O(N1.5). The algorithm could be enhanced following at least two approaches. In the first approach, incremental subalgorithms for the computation of the envelope could be developed. By use of temporal scanning of the events in the temporal network, it may be possible to significantly reduce the size of the networks on which it is necessary to run the maximum-flow subalgorithm, thereby significantly reducing the time required for envelope calculation. In the second approach, the practical effectiveness of resource envelopes in the inner loops of search algorithms could be tested for multi-capacity resource scheduling. This testing would include inner-loop backtracking and termination tests and variable and value-ordering heuristics that exploit the properties of resource envelopes more directly.

Muscvettola, Nicola↗

A Novel Approach for Modeling Chemical Reaction in Generalized Fluid System Simulation Program

The Generalized Fluid System Simulation Program (GFSSP) is a computer code developed at NASA Marshall Space Flight Center for analyzing steady state and transient flow rates, pressures, temperatures, and concentrations in a complex flow network. The code, which performs system level simulation, can handle compressible and incompressible flows as well as phase change and mixture thermodynamics. Thermodynamic and thermophysical property programs, GASP, WASP and GASPAK provide the necessary data for fluids such as helium, methane, neon, nitrogen, carbon monoxide, oxygen, argon, carbon dioxide, fluorine, hydrogen, water, a hydrogen, isobutane, butane, deuterium, ethane, ethylene, hydrogen sulfide, krypton, propane, xenon, several refrigerants, nitrogen trifluoride and ammonia. The program which was developed out of need for an easy to use system level simulation tool for complex flow networks, has been used for the following purposes to name a few: Space Shuttle Main Engine (SSME) High Pressure Oxidizer Turbopump Secondary Flow Circuits, Axial Thrust Balance of the Fastrac Engine Turbopump, Pressurized Propellant Feed System for the Propulsion Test Article at Stennis Space Center, X-34 Main Propulsion System, X-33 Reaction Control System and Thermal Protection System, and International Space Station Environmental Control and Life Support System design. There has been an increasing demand for implementing a combustion simulation capability into GFSSP in order to increase its system level simulation capability of a liquid rocket propulsion system starting from the propellant tanks up to the thruster nozzle for spacecraft as well as launch vehicles. The present work was undertaken for addressing this need. The chemical equilibrium equations derived from the second law of thermodynamics and the energy conservation equation derived from the first law of thermodynamics are solved simultaneously by a Newton-Raphson method. The numerical scheme was implemented as a User Subroutine in GFSSP.

Sozen, Mehmet↗

A Finite-Volume method for compressible non-equilibrium two-phase flows in networks of elastic pipelines using the Baer–Nunziato model

A novel Finite-Volume scheme for the numerical computations of compressible two-phase flows in pipelines is proposed for the fully non-equilibrium Baer–Nunziato model. The present FV approach is the extension of the method proposed in Daude and Galon (2018) in the context of the Euler equations to the Baer–Nunziato model. In addition, proper approximations of the non-conservative terms are proposed to consider jumps of volume fraction as well as jumps of cross-section in order to respect uniform pressure and velocity profiles preservation. In particular, focus is given to the numerical treatment of abrupt changes in area and to networks wherein several pipelines are connected at junctions. The proposed method makes it possible to avoid the use of an iterative procedure for the solution of the junction problem. The present approach can also deal with general Equations Of State. In addition, the fluid–structure interaction of compressible fluid flowing in flexible pipes is also considered. Lastly, the proposed scheme is then assessed on a variety of shock-tubes and other transient flow problems and experiments demonstrating its capability to resolve such problems efficiently, accurately and robustly.

42 ENGINEERING↗

Computing the Envelope for Stepwise-Constant Resource Allocations

Computing tight resource-level bounds is a fundamental problem in the construction of flexible plans with resource utilization. In this paper we describe an efficient algorithm that builds a resource envelope, the tightest possible such bound. The algorithm is based on transforming the temporal network of resource consuming and producing events into a flow network with nodes equal to the events and edges equal to the necessary predecessor links between events. A staged maximum flow problem on the network is then used to compute the time of occurrence and the height of each step of the resource envelope profile. Each stage has the same computational complexity of solving a maximum flow problem on the entire flow network. This makes this method computationally feasible and promising for use in the inner loop of flexible-time scheduling algorithms.

Muscettola, Nicola↗

Computing the Envelope for Stepwise Constant Resource Allocations

Estimating tight resource level is a fundamental problem in the construction of flexible plans with resource utilization. In this paper we describe an efficient algorithm that builds a resource envelope, the tightest possible such bound. The algorithm is based on transforming the temporal network of resource consuming and producing events into a flow network with noises equal to the events and edges equal to the necessary predecessor links between events. The incremental solution of a staged maximum flow problem on the network is then used to compute the time of occurrence and the height of each step of the resource envelope profile. The staged algorithm has the same computational complexity of solving a maximum flow problem on the entire flow network. This makes this method computationally feasible for use in the inner loop of search-based scheduling algorithms.

Muscettola, Nicola↗

Fluid inertia controls mineral precipitation and clogging in pore to network-scale flows

Mineral precipitation caused by fluid mixing presents complex control and predictability challenges in a variety of natural and engineering processes, including carbon mineralization, geothermal energy, and microfluidics. Precipitation dynamics, particularly under the influence of fluid flow, remain poorly understood. Combining microfluidic experiments and three-dimensional reactive transport simulations, we demonstrate that fluid inertia controls mineral precipitation and clogging at flow intersections, even in laminar flows. We observe distinct precipitation regimes as a function of Reynolds number (Re). At low Reynolds numbers (Re < 10), precipitates form a thin, dense layer along the mixing interface, which shuts precipitation off, while at high Reynolds numbers (Re > 50), strong three-dimensional flows significantly enhance precipitation over the entire intersection, resulting in rapid clogging. When injection rates from two inlets are uneven, flow symmetry-breaking leads to unexpected flow bifurcation phenomena, which result in enhanced concurrent precipitation in both downstream channels. Finally, we extend our findings to rough channel networks and demonstrate that the identified inertial effects on precipitation at the intersection scale are also present and even more dramatic at the network scale. This study sheds light on the fundamental mechanisms underlying mixing-induced mineral precipitation and provides a framework for designing and optimizing processes involving mineral precipitation.

Science & Technology - Other Topics↗

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

Opposing Hysteresis Patterns in Flow and Outflow Macroscopic Fundamental Diagrams and Their Implications

Two key aggregated traffic models are the relationship between average network flow and density (known as the network or flow macroscopic fundamental diagram [flow-MFD]) and the relationship between trip completion and density (known as network exit function or the outflow-MFD [o-FMD]). The flow- and o-MFDs have been shown to be related by average network length and average trip distance under steady-state conditions. However, recent studies have demonstrated that these two relationships might have different patterns when traffic conditions are allowed to vary: the flow-MFD exhibits a clockwise hysteresis loop, while the o-MFD exhibits a counter-clockwise loop. One recent study attributes this behavior to the presence of bottlenecks within the network. The present paper demonstrates that this phenomenon may arise even without bottlenecks present and offers an alternative, but more general, explanation for these findings: a vehicle’s entire trip contributes to a network’s average flow, while only its end contributes to the trip completion rate. This lag can also be exaggerated by trips with different lengths, and it can lead to other patterns in the o-MFD such as figure-eight patterns. A simple arterial example is used to demonstrate this explanation and reveal the expected patterns, and they are also identified in real networks using empirical data. Then, simulations of a congestible ring network are used to unveil features that might increase or diminish the differences between the flow- and o-MFDs. Finally, more realistic simulations are used to confirm that these behaviors arise in real networks.

42 ENGINEERING↗

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↗

Situational Awareness of Network System Roles (SANSR)

In a large enterprise it is difficult for cyber security analysts to know what services and roles every machine on the network is performing (e.g. file server, domain name server, email server). Understanding the roles of the systems in the network provides analysts with a situational awareness that will allow them to detect consequential changes in the network, initiate an incident response plan, and optimize their security posture. Using the network flow data, already collected by most enterprises, we developed a tool that enables analysts to automatically detect/classify services and roles of every machine that’s operating on a network (e.g. file server, domain name server, email server) for better situational awareness of potential threats to the network. his tool queries Elasticsearch for network flow data, creates a temporal behavior model of each system, uses unsupervised machine learning to cluster the models with a set of labeled temporal behavior models, and the resulting information can be printed to the console or programmatically accessed. The results include the likelihood that a machine has a labeled role and lists other machines that are most similar in behavior.

Huffer, KellyM.↗

Control of Networked Traffic Flow Distribution: A Stochastic Distribution System Perspective

At signalized intersections, the traffic queues are controlled by traffic signal control settings and effective traffic lights control would realize both smooth traffic flow and minimize fuel consumption. Funded by the Energy Efficient Mobility Systems (EEMS) program of the Vehicle Technologies Office of the US Department of Energy, we performed a preliminary investigation on the modelling and control framework in context of urban network of signalized intersections. In specific, we developed a recursive input-output traffic queueing models. The queue formation can be modeled as a stochastic process where the number of vehicles entering each intersection is a random number. Further, we proposed a preliminary B-Spline stochastic modelling and control for a one-way single-lane corridor traffic system based on theory of stochastic distribution control that shapes the PDF of the queue length.

33 ADVANCED PROPULSION SYSTEMS↗

A biophysical approach to the performance diagnosis of human–building energy interaction: Information (bits) modeling, algorithm, and indicators of energy flow complexity

Highlights: • Energy-related human-building interaction is analyzed at the biophysical system scale. • Energy flow-networking model of environmental building performance is suggested. • Information is suggested as a holistic building performance metric. - Abstract: This article addresses the utmost upstream impacts of human–building energy interaction by proposing a network-based model, algorithms, and indicators. Hypothesizing that human behavior is a key factor for the symbiotic development of building and the geobiosphere system, the author seeks emergy (spelled with an “m”)-information integrated measures to indicate dynamic system-level performance of the interaction with building energy flow topology. To validate the hypothesis and methods, four representative building cases were tested on the building form (envelope) of (i) a building with no occupant intervention (baseline), (ii) a building controlled by responsive human behavior (bioclimatic adaptation), (iii) a building with reinforced insulation and behavior-dominated control (passive design), and (iv) a net-zero energy building (NZEB). The results demonstrate that adaptive human behavior in building operation increases the information content and complexity of energy-flow networking, improving performance and sustainability. Findings also reveal that increasing information, complexity, and power (energy availability over time) parallel the general energetic features of developing biophysical systems (greater feedback, internalization, and recycling of materials and energies). It becames clear that active behavioral response is a dominant agent of sustainable environments even on a far broader system scale.

54 ENVIRONMENTAL SCIENCES↗