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 181 records · Page 10

Modeling root system growth around obstacles

State-of-the-Art models of Root System Architecture (RSA) do not allow simulating root growth around rigid obstacles. Yet, the presence of obstacles can be highly disruptive to the root system. We grew wheat seedlings in sealed petri dishes without obstacle and in custom 3D-printed rhizoboxes containing obstacles. Time-lapse photography was used to reconstruct the wheat root morphology network. We used the reconstructed wheat root network without obstacle to calibrate an RSA model implemented in the R-SWMS software. The root network with obstacles allowed calibrating the parameters of a new function that models the influence of rigid obstacles on wheat root growth. Experimental results show that the presence of a rigid obstacle does not affect the growth rate of the wheat root axes, but that it does influence the root trajectory after the main axis has passed the obstacle. The growth recovery time, i.e. the time for the main root axis to recover its geotropism-driven growth, is proportional to the time during which the main axis grows along the obstacle. Qualitative and quantitative comparisons between experimental and numerical results show that the proposed model successfully simulates wheat RSA growth around obstacles. Our results suggest that wheat roots follow patterns that could inspire the design of adaptive engineering flow networks.

59 BASIC BIOLOGICAL SCIENCES↗

Validation of the SINDA/FLUINT code using several analytical solutions

The Systems Improved Numerical Differencing Analyzer and Fluid Integrator (SINDA/FLUINT) code has often been used to determine the transient and steady-state response of various thermal and fluid flow networks. While this code is an often used design and analysis tool, the validation of this program has been limited to a few simple studies. For the current study, the SINDA/FLUINT code was compared to four different analytical solutions. The thermal analyzer portion of the code (conduction and radiative heat transfer, SINDA portion) was first compared to two separate solutions. The first comparison examined a semi-infinite slab with a periodic surface temperature boundary condition. Next, a small, uniform temperature object (lumped capacitance) was allowed to radiate to a fixed temperature sink. The fluid portion of the code (FLUINT) was also compared to two different analytical solutions. The first study examined a tank filling process by an ideal gas in which there is both control volume work and heat transfer. The final comparison considered the flow in a pipe joining two infinite reservoirs of pressure. The results of all these studies showed that for the situations examined here, the SINDA/FLUINT code was able to match the results of the analytical solutions.

Keller, John R.↗

A Selectivity based approach to Continuous Pattern Detection in Streaming Graphs

Cyber security is one of the most significant technical challenges in current times. Detecting adversarial activities, prevention of theft of intellectual properties and customer data is a high priority for corporations and government agencies around the world. Cyber defenders need to analyze massive-scale, high-resolution network flows to identify, categorize, and mitigate attacks involving net- works spanning institutional and national boundaries. Many of the cyber attacks can be described as subgraph patterns, with promi- nent examples being insider infiltrations (path queries), denial of service (parallel paths) and malicious spreads (tree queries). This motivates us to explore subgraph matching on streaming graphs in a continuous setting. The novelty of our work lies in using the subgraph distributional statistics collected from the streaming graph to determine the query processing strategy. We introduce a “Lazy Search" algorithm where the search strategy is decided on a vertex-to-vertex basis depending on the likelihood of a match in the vertex neighborhood. We also propose a metric named “Relative Selectivity" that is used to se- lect between different query processing strategies. Our experiments performed on real online news, network traffic stream and a syn- thetic social network benchmark demonstrate 10-100x speedups over selectivity agnostic approaches.

graphs, cybersecurity↗

Revisiting the Analytical Solutions of Heat Transport in Fractured Reservoirs Using a Generalized Multirate Memory Function

Numerous analytical solutions have been developed for modeling thermal perturbations to underground formations caused by deep-well injection of fluids. Each solution has been derived for a specific boundary value problem and a simplified flow network with one set of parallel fractures. In this paper, new generalized solutions G*( x, s ) are developed using (existing) global transfer functions G$^*_0(x,s)$ and a new memory function g*( s ), where x and s are the space and Laplace variable. The memory function represents the solutions of conductive heat exchange between fractures and matrix blocks and between fractured aquifers and unfractured aquitards. The memory function is developed to account for multirate exchange induced by different shapes, sizes, properties, and volumetric fractions of matrix blocks bounded by multiple sets of orthogonal fractures with different spacing. The global transfer functions represent the fundamental solutions to convective, convective-conductive, and convective-dispersive heat transport in fractures (or aquifers) without exchange and are available for various (1-D linear, 1-D radial, 2-D dipole, and single-well injection-withdrawal) flow fields. The new solutions with exchange are developed using $G^*(x,s) = B^*(s)G^*_0{x, s[1 + Θg^*(s)]}$, thereby greatly simplifying solution development in a novel way, where Θ and B*( s ) are a fracture-matrix scaling factor and the boundary condition function. As a result, the new solutions are applied to several example problems, showing that heat transport in fractured aquifers is significantly impacted by (1) thermal dispersion in fractures that is rarely considered, (2) multirate heat exchange with a wide range of size and anisotropy of rectangular matrix blocks, and (3) heat exchange between aquifers and aquitards.

58 GEOSCIENCES↗

Crossing Versus Locking: Bit Threads and Continuum Multiflows

Bit threads are curves in holographic spacetimes that manifest boundary entanglement, and are represented mathematically by continuum analogues of network flows or multiflows. Subject to a density bound, the maximum number of threads connecting a boundary region to its complement computes the Ryu–Takayanagi entropy. When considering several regions at the same time, for example in proving entropy inequalities, there are various inequivalent density bounds that can be imposed. Here, we investigate for which choices of bound a given set of boundary regions can be “locked”, in other words can have their entropies computed by a single thread configuration. We show that under the most stringent bound, which requires the threads to be locally parallel, non-crossing regions can in general be locked, but crossing regions cannot, where two regions are said to cross if they partially overlap and do not cover the entire boundary. We also show that, under a certain less stringent density bound, a crossing pair can be locked, and conjecture that any set of regions not containing a pairwise crossing triple can be locked, analogously to the situation for networks.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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↗

Multi-Modular Coordination Control of HTR-PM600 Plant - 190

HTR-PM600 is a high temperature gas-cooled reactor plant based on the multi-modular scheme, i.e. six modular high temperature gas-cooled reactor (MHTGR) driving a common secondary loop system. Six MHTGR-based nuclear steam supplying system (NSSS) modules are tightly coupled by the secondary fluid flow network (FFN) which contains the secondary side of steam generators, feedwater system, main steam system, turbine generator system. The secondary FFN control, which focuses on the feedwater flowrates and main steam pressure, plays a central role in multi-modular coordination of HTR-PM600 plant. In this paper, a differential algebraic model of this secondary FFN is first proposed. Then, the corresponding flowrate-pressure control strategy is proposed, which takes the simple form of proportional-integral feedback laws. Numerical simulation results show both the feasibility and satisfactory transient performance of this controller. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Capturing the two-way hydromechanical coupling effect on fluid-driven fracture in a dual-graph lattice beam model

Fluid-driven fractures of brittle rock is simulated via a dual-graph lattice model. The new discrete hydromechanical model incorporates a two-way coupling mechanism between the discrete element model and the flow network. Through adopting an operator-split algorithm, the coupling model is able to replicate the transient poroelasticity coupling mechanism and the resultant Mandel-Cryer hydromechanical coupling effect in a discrete mechanics framework. As crack propagation, coalescence and branching are all path-dependent and irreversible processes, capturing this transient coupling effect is important for capturing the essence of the fluid-driven fracture in simulations. Injection simulations suggest that the onset and propagation of fractures is highly sensitive to the ratio between the injection rate and the effective permeability. Moreover, we show that in a permeable rock, the borehole breakdown pressure, the pressure at which fractures start to grow from the borehole, depends on both the given ratio between injection rate and permeability and the Biot coefficient.

58 GEOSCIENCES↗

Thermal model development and validation for rapid filling of high pressure hydrogen tanks

This paper describes the development of thermal models for the filling of high pressure hydrogen tanks with experimental validation. Two models are presented; the first uses a one-dimensional, transient, network flow analysis code developed at Sandia National Labs, and the second uses the commercially available CFD analysis tool Fluent. These models were developed to help assess the safety of Type IV high pressure hydrogen tanks during the filling process. The primary concern for these tanks is due to the increased susceptibility to fatigue failure of the liner caused by the fill process. Thus, a thorough understanding of temperature changes of the hydrogen gas and the heat transfer to the tank walls is essential. The effects of initial pressure, filling time, and fill procedure were investigated to quantify the temperature change and verify the accuracy of the models. In this paper we show that the predictions of mass averaged gas temperature for the one and three-dimensional models compare well with the experiment and both can be used to make predictions for final mass delivery. Furthermore, due to buoyancy and other three-dimensional effects, however, the maximum wall temperature cannot be predicted using one-dimensional tools alone which means that a three-dimensional analysis is required for a safety assessment of the system.

42 ENGINEERING↗

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↗

Energy Minimization of Discrete Protein Titration State Models Using Graph Theory

There are several applications in computational biophysics which require the optimization of discrete interacting states; e.g., amino acid titration states, ligand oxidation states, or discrete rotamer angles. Such optimization can be very time-consuming as it scales exponentially in the number of sites to be optimized. In this paper, we describe a new polynomial-time algorithm for optimization of discrete states in macromolecular systems. This algorithm was adapted from image processing and uses techniques from discrete mathematics and graph theory to restate the optimization problem in terms of maximum flow-minimum cut graph analysis. The interaction energy graph, a graph in which vertices (amino acids) and edges (interactions) are weighted with their respective energies, is transformed into a flow network in which the value of the minimum cut in the network equals the minimum free energy of the protein, and the cut itself encodes the state that achieves the minimum free energy. Because of its deterministic nature and polynomial-time performance, this algorithm has the potential to allow for the ionization state of larger proteins to be discovered.

energy minimization↗

Chemo‐mechanical Alterations Induced From CO 2 Injection in Carbonate‐Cemented Sandstone: An Experimental Study at 71 °C and 29 MPa

Abstract Carbon capture, utilization, and storage may lead to mechanical degradation of the subsurface reservoir from fluid‐rock interaction, which could lead to wellbore instability or reservoir compaction. To better understand potential relationship between mechanical degradation with various carbonate cement textures and compositions in sandstone reservoirs, six flow‐through experiments were conducted. Formation water (TDS = 5,390 mg/L) enriched with CO 2 flowed through two types of Pennsylvanian Morrow B Sandstone: an ankerite‐siderite‐cemented sandstone (disseminated cement texture) and a calcite‐cemented sandstone (poikilotopic cement texture). The experiments produced little change in permeability in the ankerite‐siderite‐cemented sandstone, but permeability increased up to more than 1 order of magnitude in the calcite‐cemented sandstone. Ultrasonic measurements and cylinder‐splitting tests (also known as Brazilian tests) suggested negligible mechanical degradation of the ankerite‐siderite‐cemented sandstone. Variable changes, with significant mechanical degradation in the static moduli, were observed in the calcite‐cemented sandstone. Thus, dissolution of the disseminated ankerite‐siderite cement (0.28–0.30%) had minimal impact on modifying the flow network and the mechanical integrity of the sandstone, whereas dissolution of the poikilotopic calcite cement (0.89–1.13%, quantified with fluid chemistry and visualized with X‐ray microcomputed tomography) impacted the mechanical strength of the sandstone by disconnecting framework grains. With the high water‐to‐rock mass ratios (7.3–8.2) and number of pore volumes (147–675) employed in these experiments, potential risks are most relevant to regions near injection wells. Ultimately, the chemo‐mechanical effects induced by CO 2 injection are strongly influenced by the cement texture and composition and the burial history of the reservoir rock.

Wu, Z.↗

A divide-conquer-recombine algorithmic paradigm for large spatiotemporal quantum molecular dynamics simulations

We introduce an extension of the divide-and-conquer (DC) algorithmic paradigm called divide-conquer-recombine (DCR) to perform large quantum molecular dynamics (QMD) simulations on massively parallel supercomputers, in which interatomic forces are computed quantum mechanically in the framework of density functional theory (DFT). In DCR, the DC phase constructs globally informed, overlapping local-domain solutions, which in the recombine phase are synthesized into a global solution encompassing large spatiotemporal scales. For the DC phase, we design a lean divide-and-conquer (LDC) DFT algorithm, which significantly reduces the prefactor of the O(N) computational cost for N electrons by applying a density-adaptive boundary condition at the peripheries of the DC domains. Our globally scalable and locally efficient solver is based on a hybrid real-reciprocal space approach that combines: (1) a highly scalable real-space multigrid to represent the global charge density; and (2) a numerically efficient plane-wave basis for local electronic wave functions and charge density within each domain. Hybrid space-band decomposition is used to implement the LDC-DFT algorithm on parallel computers. A benchmark test on an IBM Blue Gene/Q computer exhibits an isogranular parallel efficiency of 0.984 on 786 432 cores for a 50.3 × 10{sup 6}-atom SiC system. As a test of production runs, LDC-DFT-based QMD simulation involving 16 661 atoms is performed on the Blue Gene/Q to study on-demand production of hydrogen gas from water using LiAl alloy particles. As an example of the recombine phase, LDC-DFT electronic structures are used as a basis set to describe global photoexcitation dynamics with nonadiabatic QMD (NAQMD) and kinetic Monte Carlo (KMC) methods. The NAQMD simulations are based on the linear response time-dependent density functional theory to describe electronic excited states and a surface-hopping approach to describe transitions between the excited states. A series of techniques are employed for efficiently calculating the long-range exact exchange correction and excited-state forces. The NAQMD trajectories are analyzed to extract the rates of various excitonic processes, which are then used in KMC simulation to study the dynamics of the global exciton flow network. This has allowed the study of large-scale photoexcitation dynamics in 6400-atom amorphous molecular solid, reaching the experimental time scales.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Non-Hermitian topological states in 2D line-graph lattices: evolving triple exceptional points on reciprocal line graphs

Non-Hermitian (NH) topological states, such as the doubly-degenerate nodes dubbed as exceptional points (EPs) in Bloch band structure of 2D lattices driven by gain and loss, have attracted much recent interest. We demonstrate theoretically that in the three-site edge-centered lattices, i.e. the so-called line-graph lattices, such as kagome lattice which is a line graph of hexagonal lattice, there exist three types of triply-degenerate EPs evolving intriguingly on another set of line graphs in the reciprocal space. A single TEP (STEP) with ±1/3 topological charge moves faithfully along the edges of reciprocal line graphs with varying gain and loss, while two STEPs merge distinctively into one unconventional orthogonal double TEP (DTEP) with ±2/3 charge at the vertices, which is characterized with two ordinary self-orthogonal eigenfunctions but one surprising 'orthogonal' eigenfunction. Differently, in a modified line-graph lattice with an off-edge-center site, the ordinary coalesced state of DTEPs emerges with three identical self-orthogonal eigenfunctions. Such NH states and their evolution can be generally realized in various artificial systems, such as photonic and sonic crystals, where light and sonic vortex beams with different fractional twisting can be found. Our findings shed new light on fundamental understanding of gapless topological states in NH systems in terms of creation and evolution of high-order EPs, and open up new research directions to further link line graph and flow network theory coupled with topological physics, especially under non-equilibrium gain/loss conditions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Resiliency of Distribution Systems Incorporating Asynchronous Information for System Restoration

Resiliency of distribution systems under extreme operating conditions is critical, especially when the utility is not available. With the large-scale deployment of distributed resources, it becomes possible to restore critical loads with local non-utility resources. Distribution system operators (DSOs) need to determine the critical loads to be restored, considering limited resources and distribution facilities. Several studies on resiliency have been conducted for the restoration of distribution systems. However, the inherent asynchronous characteristic on the information availability has not been incorporated. With incomplete and asynchronous information, decisions may be made that result in underutilization of generation resources. In this paper, a new distribution system restoration approach is proposed, considering uncertain devices and associated asynchronous information. It uses a two-module architecture that efficiently optimizes restoration actions using a binary linear programming model and evaluates their feasibility with unbalanced optimal power flow. Networked microgrids are included in the model. The IEEE 123-node test feeder is used for validation. Results show that asynchronous messages may affect the restoration actions significantly and the impacts can be mitigated by the proposed decision support tool for the DSOs.

Bedoya, Juan C.↗

Denial of Service Attack Detection via Differential Analysis of Generalized Entropy Progressions

Denial-of-Service (DoS) attacks are one the most common and consequential cyber attacks in computer networks. While existing research offers a plethora of detection methods, the issue of achieving scalability, a low false positive rate, and high detection accuracy remains open. In this work, we address this problem by developing a differential method based on generalized entropy progression. In this method, named as DoDGE, we continuously fit the line of best fit to the entropy progression of destination addresses and check if the derivative, that is, the slope of this line is less than the negative of the dynamically computed standard deviation of the derivatives. Furthermore, to distinguish from flash events, we leverage the symmetry that when a flash event occurs, the derivative of the entropy progression of source addresses is positive. With this design, we omit the usage of the thresholds and the results with five real-world network traffic datasets confirm that DoDGE outperforms threshold-based DoS attack detection by two orders of magnitude in terms of false positives on average. When compared to ten machine learning (ML) models, DoDGE achieves a balanced accuracy of 99%, while the average balanced accuracy for the ML models is 52%. Moreover, the results show that DoDGE successfully differentiates between a flash event and a DoS attack. Furthermore, since the main computation cost of DoDGE is the entropy computation, which is linear in the volume of the unit-time network flow, uses integer only operations, and works on a small fraction of the total flow, it is lightweight and scalable.

Cybersecurity, wireless communication↗

Identification of Dynamic Force Coefficients for an Additively Manufactured Hermetic Squeeze Film Bearing Support Damper Utilizing a Pass-Through Channel

Abstract The following paper presents breakthrough experimental results for a new hermetic squeeze film damper (HSFD) concept that is integrally designed within an externally pressurized tilting-pad radial gas bearing support. The flexibly damped gas bearing module was designed for a 7.2″ (183 mm) diameter shaft and fabricated using direct metal laser melting (DMLM); also known as additive manufacturing. The bearing and HSFD were sized based on ongoing studies for oil-free supercritical carbon dioxide (sCO2) power turbines in the 8.5 MW–10 MW power range. The development of the new damper concept was motivated by past dynamic testing on HSFD, which generated frequency-dependent stiffness and damping force coefficients. In efforts to eliminate the frequency dependency, a new HSFD architecture was conceived that adds accumulator volumes and a pass-through channel to previously conceived HSFD flow network designs. The other motivation for the work is the need to develop a cost-effective and reliable oil-free bearing technology that is scalable to large power turbomachinery applications. There were several objectives for the following work. The first objective was to successfully design and fabricate a single piece bearing-damper using additive manufacturing, while dimensionally controlling critical design features. The paper discusses the manufacturing steps and shows cut-ups that reveal adequate clearance control capability with internal damper clearances. The second objective was to perform experimental testing with the new HSFD design in efforts to extract stiffness and damping coefficients for excitation frequencies within 20–160 Hz and peak vibration amplitudes between 0.25 mils (6.35 microns) to 1 mil (25.4 microns). The test results for a single HSFD bearing module indicated that the design modifications to the HSFD architecture were successful in eliminating nearly all the frequency dependencies for the stiffness force coefficient. The dynamic tests yielded a stiffness coefficient that varied between 112 klb/in. (19.6 MN/m) and 96 klb/in. (16.8 MN/m). The damping force coefficient however, exhibited relatively more variation with frequency with values residing between 175 lb-s/in. (31 kN-s/m) to 214 lb-s/in. (37 kN-s/m). Finally, the paper advances a three-dimensional fluid-structure interaction (FSI) model using transient finite element analysis (FEA) coupled to a computational fluid dynamics (CFD) model. The FSI analysis performed between 20 Hz and 80 Hz was used to predict the stiffness and damping of the HSFD using a quarter-section model of the damper. The FSI analysis was able to support test results by showing only a 6–7.4% change in the magnitude of force coefficients. Stiffness predictions agree reasonably well with experiments whereas damping is underpredicted.

Engineering↗

A Parallel Solver for Graph Laplacians

Problems from graph drawing, spectral clustering, network flow and graph partitioning can all be expressed in terms of graph Laplacian matrices. There are a variety of practical approaches to solving these problems in serial. However, as problem sizes increase and single core speeds stagnate, parallelism is essential to solve such problems quickly. We present an unsmoothed aggregation multigrid method for solving graph Laplacians in a distributed memory setting. We introduce new parallel aggregation and low degree elimination algorithms targeted specifically at irregular degree graphs. These algorithms are expressed in terms of sparse matrix-vector products using generalized sum and product operations. This formulation is amenable to linear algebra using arbitrary distributions and allows us to operate on a 2D sparse matrix distribution, which is necessary for parallel scalability. Our solver outperforms the natural parallel extension of the current state of the art in an algorithmic comparison. We demonstrate scalability to 576 processes and graphs with up to 1.7 billion edges.

Konolige, Tristan↗