Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “complex network”

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 235 records · Page 13
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

rNets: a standalone package to visualize reaction networks

In the study of chemical processes, visualizing reaction networks is pivotal for identifying crucial compounds and transformations. Traditional methods, such as network schematics and reaction path linear plots, often struggle to effectively represent complex reaction networks due to their size and intricate connectivity. Alternatives capable of leading with complexity include graph methods, but they are not user-friendly, lacking simplicity and modularity, which hinders their integration with widely-used research software. This work introduces rNets an innovative tool designed for the efficient visualization of reaction networks with a user-friendly interface, modularity, and seamless integration with existing software packages. The effectiveness of rNets is demonstrated through its application in analyzing three catalytic reactions, showcasing its potential to significantly enhance research both in homogeneous and heterogeneous catalysis fields. This tool not only simplifies the visualization process but also opens new avenues for exploring complex reaction networks in diverse research contexts.

Pablo-García, Sergio↗
NASA NTRS2013

Applying Model Based Systems Engineering to NASA's Space Communications Networks

System engineering practices for complex systems and networks now require that requirement, architecture, and concept of operations product development teams, simultaneously harmonize their activities to provide timely, useful and cost-effective products. When dealing with complex systems of systems, traditional systems engineering methodology quickly falls short of achieving project objectives. This approach is encumbered by the use of a number of disparate hardware and software tools, spreadsheets and documents to grasp the concept of the network design and operation. In case of NASA's space communication networks, since the networks are geographically distributed, and so are its subject matter experts, the team is challenged to create a common language and tools to produce its products. Using Model Based Systems Engineering methods and tools allows for a unified representation of the system in a model that enables a highly related level of detail. To date, Program System Engineering (PSE) team has been able to model each network from their top-level operational activities and system functions down to the atomic level through relational modeling decomposition. These models allow for a better understanding of the relationships between NASA's stakeholders, internal organizations, and impacts to all related entities due to integration and sustainment of existing systems. Understanding the existing systems is essential to accurate and detailed study of integration options being considered. In this paper, we identify the challenges the PSE team faced in its quest to unify complex legacy space communications networks and their operational processes. We describe the initial approaches undertaken and the evolution toward model based system engineering applied to produce Space Communication and Navigation (SCaN) PSE products. We will demonstrate the practice of Model Based System Engineering applied to integrating space communication networks and the summary of its results and impact. We will highlight the insights gained by applying the Model Based System Engineering and provide recommendations for its applications and improvements.

Bhasin, Kul↗
DOE OSTI2026

Stochastic fracture generation and thermo-hydro-mechanical modeling in an equivalent continuum framework for enhanced geothermal systems

Enhanced geothermal systems (EGS) involve fracturing low permeability material to establish well connectivity and then injecting and circulating fluid into the fractured subsurface for geothermal power production. Changes in fracture aperture from contraction of the cooling matrix rock may alter network connectivity and risk thermal short-circuiting. Thermo-hydro-mechanical (THM) models are a useful tool to study these processes. However, as fracture networks are complex, and data may be limited, fracture networks in THM models are often stochastically generated. Given reliance on stochastic fracture networks and THM modeling to represent the subsurface and assess productivity of EGS, increased understanding of the influence of such statistically derived fracture networks on flow and heat transport in THM models is needed. Here, a new fracture process model is developed in the reactive transport code PFLOTRAN to stochastically generate fracture families and simulate changes in fracture aperture over time due to temperature changes of the rock matrix. Sixty-four different fracture networks ranging from well to poorly-connected, are modeled in PFLOTRAN with and without mechanical processes (THM vs TH). Results indicate that for well-connected fracture networks, thermal short-circuiting is less of a concern due to the abundance of available alternative flowpaths. For poorly-connected fracture networks, inclusion of mechanical processes showed steep thermal drawdown coincident with increase in fracture aperture along developing colder flowpaths, demonstrating the risk of thermal short-circuiting. Simulations with additional, larger fractures engineered to establish connectivity in a poorly-fractured subsurface, indicate that while stochastic variation of fracture orientation of the background network had limited influence, such variation in the engineered fractures significantly affected flow and heat transport.

Discrete fracture networks (DFN)↗
NASA NTRS2002

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↗
DOE OSTI2021

Transient cycling of nitrogen, organic carbon and oxygen within the free-flowing Columbia River corridor: Linking exposure time dependent biogeochemical reactions to river stage fluctuations (Final project report)

The objective of this project was to develop next-generation techniques for representing the transformations of complex reaction networks like those impacting transient river-corridors, then apply them to develop upscaling tools. The project contributed significantly to the development of Lagrangian “mass transfer particle tracking” (MTPT) tools that are the first numerical framework that explicitly separates mixing and spreading processes; a crucial distinction for accurate representations of reaction rates across scales. The MTPT approach uses an operator splitting scheme where physical transport processes are simulated using classical random walk methods and each particle is treated as a “container” that carries with it any number of chemical species. Mixing between particles is simulated using a colocation-probability based mass transfer kernel and reactions are evaluated on each particle after mixing. The method is stable, accurate, and also allows the explicit modeling of residence time distributions of the individual containers of mass. The MTPT scheme allowed us to explore several research questions related to reactive transport in river corridors and complex reaction networks. We found that it is possible to quantify the exposure time distributions (ETDs) of reactants and that this does suggest some pathways to upscaling. However, comparable approximations can be obtained using simplified (reduced dimensionality) MTPT simulations in less time with similar uncertainty, so development of extensive ETD-based methods was not productive. The major findings are that i) the MTPT schemes are robust and highly accurate across a range of arbitrarily complex reactions, ii) the methods can be efficiently parallelized and the parallel performance characteristics of MTPT are predictable, and iii) the MTPT tools allow simultaneous tracking of residence time. The development of these research tools into efficient software packages continues. The methods are already available to the community because open-source, working examples have been included with all publications.

54 ENVIRONMENTAL SCIENCES↗
NASA NTRS2019

Complex Dynamics of Air Traffic Flow

Air traffic in the United States has continued to grow at a steady pace since 1980, except for a dip immediately after the tragic events of September 11, 2001. There are different growth scenarios associated both with the magnitude and the composition of the future air traffic. The Terminal Area Forecast (TAF), prepared every year by the FAA, projects the growth of traffic in the United States. Both Boeing and Airbus publish market outlooks for air travel annually. Although predicting the future growth of traffic is difficult, there are two significant trends: heavily congested major airports continue to see an increase in traffic, and the emergence of regional jets and other smaller aircraft with fewer passengers operating directly between non-major airports. The interaction between air traffic demand and the ability of the system to provide the necessary airport and airspace resources can be modeled as a network. The size of the resulting network varies depending on the choice of its nodes. It would be useful to understand the properties of this network to guide future design and development. Many questions, such as the growth of delay with increasing traffic demand and impact of the en route weather on future air traffic, require a systematic understanding of the properties of the air traffic network. There has been a major advance in the understanding of the behavior of networks with a large number of components. Several theories have been advanced about the evolution of large biological and engineering networks by authors in diversified disciplines like physics, mathematics, biology and computer science. Several networks exhibit a scale-free property in the sense that the probabilistic distribution of their nodes as a function of connections decreases slower than an exponential. These networks are characterized by the fact that a small number of components have a disproportionate influence on the performance of the network. Scale-free networks are tolerant to random failure of components, but are vulnerable to selective attack on components. This paper examines two network representations for the baseline air traffic system. A network defined with the 40 major airports as nodes and with standard flight routes as links has a characteristic scale: all nodes have 60 or more links and no node has more than 460 links. Another network is defined with baseline aircraft routing structure exhibits an exponentially truncated scale-free behavior. Its degree ranges from 2 connections to 2900 connections, and 225 nodes have more than 250 connections. Furthermore, those high-degree nodes are homogeneously distributed in the airspace. A consequence of this scale-free behavior is that the random loss of a single node has little impact, but the loss of multiple high-degree nodes (such as occurs during major storms in busy airspace) can adversely impact the system. Two future scenarios of air traffic growth are used to predict the growth of air traffic in the United States. It is shown that a three-times growth in the overall traffic may result in a ten-times impact on the density of traffic in certain parts of the United States.

Scale-free Networks↗
DOE OSTI2026

Powers of magnetic graph matrix: Fourier spectrum, walk compression, and applications

Magnetic graphs, originally developed to model quantum systems under magnetic fields, have recently emerged as a powerful framework for analyzing complex directed networks. Existing research has primarily used the spectral properties of the magnetic graph matrix to study global and stationary network features. However, their capacity to model local, nonequilibrium behaviors, often described by matrix powers, remains largely unexplored. We present a combinatorial interpretation of the magnetic graph matrix powers through directed walk profiles—counts of graph walks indexed by the number of edge reversals. Crucially, we establish that walk profiles correspond to a Fourier transform of magnetic matrix powers. The connection allows exact reconstruction of walk profiles from magnetic matrix powers at multiple discrete potentials, and more importantly, an even smaller number of potentials often suffices for accurate approximate reconstruction in real networks. This shows the empirical compressibility of the information captured by the magnetic matrix. This fresh perspective suggests further applications; for example, we illustrate how powers of the magnetic matrix can identify frustrated directed cycles (e.g., feedforward loops) and can be effectively employed for link prediction by encoding local structural details in directed graphs.

complex networks↗
DOE OSTI2024

Simulation Evaluation of a Large-Scale Implementation of Virtual-Phase Link-Based Model Predictive Control

Traffic congestion is a serious problem in the US, and traffic signal control is one of the effective solutions to congestion. Previous research on model predictive control (MPC)-based traffic signal control showed substantial benefits over conventional methods. This study focused on implementing MPC over a large-scale network with complex intersections and the impact of cycle length, network size, and imperfect state estimation on performances. This study implemented a virtual phase link (VPL)-based model predictive control method which used the number of vehicles in each VPL as input state variables and was suitable for National Electrical Manufacturing Association (NEMA) ring-barrier control. To test the impact of network size, the performance of distributed MPC (36 intersections in the network are divided into five subnetworks) was compared with that of MPC over the full network for a set of cycle lengths. To test the impact of imperfect state estimation, we synthetically infused estimation error and developed two scenarios, MPC-error and MPC-error narrow, which had higher and lower estimation errors, respectively. The performance of these MPC methods was compared with that of the existing time-of-day (TOD) method and an offline method that used Webster's method for split and MULTIBAND for cycle length and offset optimization. Trajectory and linkwise signal performance measures were collected from the simulation to evaluate performance. The distributed MPC method with perfect state estimation had the lowest delay and highest energy efficiency of all the methods. The performance of MPC decreased as the prediction inaccuracy increased. MPC-error had 7% and 11% more delay than MPC-error narrow in the morning and evening peaks, respectively. Overall, simulation results suggest that even with imperfect state estimation, MPC methods will outperform offline methods significantly.

large-scale simulation↗
DOE OSTI2021

Efficient Sampling of Complex Interdependent and Multiplex Networks

Efficient sampling of interdependent and multiplex infrastructure networks is critical for effectively applying failure and recovery algorithms in real-world settings, as well as to generate property-preserving reduced-order graph-based ensembles that address topological uncertainties. In this paper, we first explore the performance, i.e. the success in preserving graph properties, of graph sampling algorithms for interdependent and multiplex networks with synthetic and real-world graphs. We simulate sampling algorithms under different parameter settings. These settings include probabilistic graph generators, coupling patterns, and various performance metrics. Our results show that while Random Node and Random Walk sampling algorithms perform best for interdependent networks, Random Edge and Forest Fire sampling algorithms perform best for multiplex networks. Second, we propose and implement a novel similarity-based sampling algorithm for multiplex networks that samples only log(N) number of layers of an N-layer multiplex network while yielding computational savings with performance guarantees. Experimental results show that similarity sampling outperforms complete sampling of all layers while decreasing performance costs from a linear scale to a logarithmic one. Our results also indicate that similarity-based sampling outperforms complete sampling and random selection in nearly all scenarios when tested with real-world data.

Subasi, Omer↗
NASA NTRS1994

An expert system for configuring a network for a Milstar terminal

This paper describes a rule-based expert system which assists the user in configuring a network for Air Force terminals using the Milstar satellite system. The network configuration expert system approach uses CLIPS. The complexity of network configuration is discussed, and the methods used to model it are described.

Mahoney, Melissa J.↗
DOE OSTI2023

Social network structure and the spread of complex contagions from a population genetics perspective

Ideas, behaviors, and opinions spread through social networks. If the probability of spreading to a new individual is a non-linear function of the fraction of the individuals’ affected neighbors, such a spreading process becomes a “complex contagion”. This non-linearity does not typically appear with physically spreading infections, but instead can emerge when the concept that is spreading is subject to game theoretical considerations (e.g. for choices of strategy or behavior) or psychological effects such as social reinforcement and other forms of peer influence (e.g. for ideas, preferences, or opinions). Here we study how the stochastic dynamics of such complex contagions are affected by the underlying network structure. Motivated by simulations of complex contagions on real social networks, we present a framework for analyzing the statistics of contagions with arbitrary non-linear adoption probabilities based on the mathematical tools of population genetics. The central idea is to use an effective lower-dimensional diffusion process to approximate the statistics of the contagion. This leads to a tradeoff between the effects of ”selection” (microscopic tendencies for an idea to spread or die out), random drift, and network structure. Our framework illustrates intuitively several key properties of complex contagions: stronger community structure and network sparsity can significantly enhance the spread, while broad degree distributions dampen the effect of selection compared to random drift. Finally, we show that some structural features can exhibit critical values that demarcate regimes where global contagions become possible for networks of arbitrary size. Our results draw parallels between the competition of genes in a population and memes in a world of minds and ideas. Our tools provide insight into the spread of information, behaviors, and ideas via social influence, and highlight the role of macroscopic network structure in determining their fate.

59 BASIC BIOLOGICAL SCIENCES↗
NASA NTRS2003

Optimal Feedback Control of Thermal Networks

An improved approach to the mathematical modeling of feedback control of thermal networks has been devised. Heretofore software for feedback control of thermal networks has been developed by time-consuming trial-and-error methods that depend on engineers expertise. In contrast, the present approach is a systematic means of developing algorithms for feedback control that is optimal in the sense that it combines performance with low cost of implementation. An additional advantage of the present approach is that a thermal engineer need not be expert in control theory. Thermal networks are lumped-parameter approximations used to represent complex thermal systems. Thermal networks are closely related to electrical networks commonly represented by lumped-parameter circuit diagrams. Like such electrical circuits, thermal networks are mathematically modeled by systems of differential-algebraic equations (DAEs) that is, ordinary differential equations subject to a set of algebraic constraints. In the present approach, emphasis is placed on applications in which thermal networks are subject to constant disturbances and, therefore, integral control action is necessary to obtain steady-state responses. The mathematical development of the present approach begins with the derivation of optimal integral-control laws via minimization of an appropriate cost functional that involves augmented state vectors. Subsequently, classical variational arguments provide optimality conditions in the form of the Hamiltonian equations for the standard linear-quadratic-regulator (LQR) problem. These equations are reduced to an algebraic Riccati equation (ARE) with respect to the augmented state vector. The solution of the ARE leads to the direct computation of the optimal proportional- and integral-feedback control gains. In cases of very complex networks, large numbers of state variables make it difficult to implement optimal controllers in the manner described in the preceding paragraph.

Papalexandris, Miltiadis↗
DOE OSTI2022

The effect of differential mineral shrinkage on crack formation and network geometry

Rock, concrete, and other engineered materials are often composed of several minerals that change volumetrically in response to variations in the moisture content of the local environment. Such differential shrinkage is caused by varying shrinkage rates between mineral compositions during dehydration. Using both 3D X-ray imaging of geo-architected samples and peridynamic (PD) numerical simulations, we show that the spatial distribution of the clay affects the crack network geometry with distributed clay particles yielding the most complex crack networks and percent damage (99.56%), along with a 60% reduction in material strength. We also demonstrate that crack formation, growth, coalescence, and distribution during dehydration, are controlled by the differential shrinkage rates between a highly shrinkable clay and a homogeneous mortar matrix. Sensitivity tests performed with the PD models show a clay shrinkage parameter of 0.4 yields considerable damage, and reductions in the parameter can result in a significant reduction in fracturing and an increase in material strength. Additionally, isolated clay inclusions induced localized fracturing predominantly due to debonding between the clay and matrix. These insights indicate differential shrinkage is a source of potential failure in natural and engineered barriers used to sequester anthropogenic waste.

58 GEOSCIENCES↗
NASA NTRS2009

Method and Apparatus for Predicting Unsteady Pressure and Flow Rate Distribution in a Fluid Network

A method and apparatus for analyzing steady state and transient flow in a complex fluid network, modeling phase changes, compressibility, mixture thermodynamics, external body forces such as gravity and centrifugal force and conjugate heat transfer. In some embodiments, a graphical user interface provides for the interactive development of a fluid network simulation having nodes and branches. In some embodiments, mass, energy, and specific conservation equations are solved at the nodes, and momentum conservation equations are solved in the branches. In some embodiments, contained herein are data objects for computing thermodynamic and thermophysical properties for fluids. In some embodiments, the systems of equations describing the fluid network are solved by a hybrid numerical method that is a combination of the Newton-Raphson and successive substitution methods.

Majumdar, Alok K.↗