Search NASA⌕ Search

SEARCH · Search NASA

Results for “Complex 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 469 records · Page 26

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↗

Crossing the great divide between single-crystal reactivity and actual catalyst selectivity with pressure transients

The quantitative prediction of catalyst selectivity is essential to the design of efficient catalytic processes and requires a detailed knowledge of the reaction mechanism and rate constants. Here we present a study that accurately predicts, using the kinetics and a mechanism derived from fundamental studies on single-crystal gold, the product distribution resulting from the complex reaction network that governs the oxidative coupling of methanol, catalysed by nanoporous gold between 360 and 425 K and for a vast range of pressures. Analysis of the transient product responses to micropulses of methanol over nanoporous gold yields a precise understanding of the marked dependence of selectivity on pressure, surface oxygen coverage and temperature. The key to a high selectivity for methyl formate is the surface lifetime and abundance of the methoxy. In conclusion, this successful microkinetic modelling of catalytic reactions across a wide set of reaction conditions is broadly applicable to predicting catalytic selectivity and provides a pathway to designing more efficient catalytic processes.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

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↗

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↗

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

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↗

ISAP-MATLAB Package for Sensitivity Analysis of High-Dimensional Stochastic Chemical Networks

Stochastic simulation and modeling play an important role to elucidate the fundamental mechanisms in complex biochemical networks. The parametric sensitivity analysis of reaction networks becomes a powerful mathematical and computational tool, yielding information regarding the robustness and the identifiability of model parameters. However, due to overwhelming computational cost, parametric sensitivity analysis is a extremely challenging problem for stochastic models with a high-dimensional parameter space and for which existing approaches are very slow. Here we present an information-theoretic sensitivity analysis in path-space (ISAP) MATLAB package that simulates stochastic processes with various algorithms and most importantly implements a gradient-free approach to quantify the parameter sensitivities of stochastic chemical reaction network dynamics using the pathwise Fisher information matrix (PFIM; Pantazis, Katsoulakis, and Vlachos 2013). The sparse, block-diagonal structure of the PFIM makes its computational complexity scale linearly with the number of model parameters. As a result of the gradientfree and the sparse nature of the PFIM, it is highly suitable for the sensitivity analysis of stochastic reaction networks with a very large number of model parameters, which are typical in the modeling and simulation of complex biochemical phenomena. Finally, the PFIM provides a fast sensitivity screening method (Arampatzis, Katsoulakis, and Pantazis 2015) which allows it to be combined with any existing sensitivity analysis software.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

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↗

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↗

HEP Science Network Requirements--Final Report

The Energy Sciences Network (ESnet) is the primary provider of network connectivity for the US Department of Energy Office of Science, the single largest supporter of basic research in the physical sciences in the United States. In support of the Office of Science programs, ESnet regularly updates and refreshes its understanding of the networking requirements of the instruments, facilities, scientists, and science programs that it serves. This focus has helped ESnet to be a highly successful enabler of scientific discovery for over 20 years. In August 2009 ESnet and the Office of High Energy Physics (HEP), of the DOE Office of Science, organized a workshop to characterize the networking requirements of the programs funded by HEP. The International HEP community has been a leader in data intensive science from the beginning. HEP data sets have historically been the largest of all scientific data sets, and the communty of interest the most distributed. The HEP community was also the first to embrace Grid technologies. The requirements identified at the workshop are summarized below, and described in more detail in the case studies and the Findings section: (1) There will be more LHC Tier-3 sites than orginally thought, and likely more Tier-2 to Tier-2 traffic than was envisioned. It it not yet known what the impact of this will be on ESnet, but we will need to keep an eye on this traffic. (2) The LHC Tier-1 sites (BNL and FNAL) predict the need for 40-50 Gbps of data movement capacity in 2-5 years, and 100-200 Gbps in 5-10 years for HEP program related traffic. Other key HEP sites include LHC Tier-2 and Tier-3 sites, many of which are located at universities. To support the LHC, ESnet must continue its collaborations with university and international networks. (3) While in all cases the deployed 'raw' network bandwidth must exceed the user requirements in order to meet the data transfer and reliability requirements, network engineering for trans-Atlantic connectivity is more complex than network engineering for intra-US connectivity. This is because transoceanic circuits have lower reliability and longer repair times when compared with land-based circuits. Therefore, trans-Atlantic connectivity requires greater deployed bandwidth and diversity to ensure reliability and service continuity of the user-level required data transfer rates. (4) Trans-Atlantic traffic load and patterns must be monitored, and projections adjusted if necessary. There is currently a shutdown planned for the LHC in 2012 that may affect projections of trans-Atlantic bandwidth requirements. (5) There is a significant need for network tuning and troubleshooting during the establishment of new LHC Tier-2 and Tier-3 facilities. ESnet will work with the HEP community to help new sites effectively use the network. (6) SLAC is building the CCD camera for the LSST. This project will require significant bandwidth (up to 30Gbps) to NCSA over the next few years. (7) The accelerator modeling program at SLAC could require the movement of 1PB simulation data sets from the Leadership Computing Facilities at Argonne and Oak Ridge to SLAC. The data sets would need to be moved overnight, and moving 1PB in eight hours requires more than 300Gbps of throughput. This requirement is dependent on the deployment of analysis capabilities at SLAC, and is about five years away. (8) It is difficult to achieve high data transfer throughput to sites in China. Projects that need to transfer data in or out of China are encouraged to deploy test and measurement infrastructure (e.g. perfSONAR) and allow time for performance tuning.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Dissipation in noisy chemical networks: The role of deficiency

We study the effect of intrinsic noise on the thermodynamic balance of complex chemical networks subtending cellular metabolism and gene regulation. A topological network property called deficiency, known to determine the possibility of complex behavior such as multistability and oscillations, is shown to also characterize the entropic balance. In particular, when deficiency is zero the average stochastic dissipation rate equals that of the corresponding deterministic model, where correlations are disregarded. In fact, dissipation can be reduced by the effect of noise, as occurs in a toy model of metabolism that we employ to illustrate our findings. This phenomenon highlights that there is a close interplay between deficiency and the activation of new dissipative pathways at low molecule numbers.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗