Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 55 records · Page 3

Confidence-Based Buffer for Strategic Deconfliction with Probabilistic Operational Intent

This paper presents a methodology to expand the 95% confidence level of the elliptical geometry given by Unmanned Aircraft System (UAS) operators planning to fly Beyond Visual Line of Sight (BVLOS) to any confidence level before being fed to the strategic deconfliction (SD) module, effectively increasing the separation buffer between Operational Intents (OIs). To assess the performance of this approach, it is integrated within an adaptation of the Rolling Horizon with K-Position Search volume-based strategic deconfliction approach, previously developed at NASA Ames, preventing the 4D overlapping of OIs shaped by ellipses instead of traditional blocks. Safety and efficiency metrics are evaluated through the deconfliction of four simulated package delivery route network structures across the San Francisco Metropolitan Area with increasing numbers of crossing waypoints (network complexity). Safety assessment entails the in-house creation of a metric to quantify collision occurrences per flight hour based on the frequency at which the probabilistic operational volume segments are sampled, whereas efficiency is measured using ground delay. Results indicate that the largest buffer growth occurs when increasing the confidence level beyond 99.9% and demonstrate the negative impact of network complexity on both metrics, regardless of the OI geometry. Further, the ellipse-based SD adaptation more accurately estimates temporal separation at crossings, allowing deconflicted vehicles to be closer together. It is concluded that the proposed methodology enables the desired confidence level to serve as an effective controller of buffer size.

strategic deconfliction↗

Confidence-Based Buffer for Strategic Deconfliction with Probabilistic Operational Intent

This paper presents a methodology to expand the 95% confidence level of the elliptical geometry given by Unmanned Aircraft System (UAS) operators planning to fly Beyond Visual Line of Sight (BVLOS) to any confidence level before being fed to the strategic deconfliction (SD) module, effectively increasing the separation buffer between Operational Intents (OIs). To assess the performance of this approach, it is integrated within an adaptation of the Rolling Horizon with K-Position Search volume-based strategic deconfliction approach, previously developed at NASA Ames, preventing the 4D overlapping of OIs shaped by ellipses instead of traditional blocks. Safety and efficiency metrics are evaluated through the deconfliction of four simulated package delivery route network structures across the San Francisco Metropolitan Area with increasing numbers of crossing waypoints (network complexity). Safety assessment entails the in-house creation of a metric to quantify collision occurrences per flight hour based on the frequency at which the probabilistic operational volume segments are sampled, whereas efficiency is measured using ground delay. Results indicate that the largest buffer growth occurs when increasing the confidence level beyond 99.9% and demonstrate the negative impact of network complexity on both metrics, regardless of the OI geometry. Further, the ellipse-based SD adaptation more accurately estimates temporal separation at crossings, allowing deconflicted vehicles to be closer together. It is concluded that the proposed methodology enables the desired confidence level to serve as an effective controller of buffer size.

safety↗

Locating fast-varying line disturbances with the frequency mismatch

In an attempt to provide an efficient method for line disturbance identification in complex networks of diffusively coupled agents, we recently proposed to leverage the frequency mismatch. The frequency mismatch filters out the intricate combination of interactions induced by the network structure and quantifies to what extent the trajectory of each agent is affected by the disturbance. In this previous work, we provided some analytical evidence of its efficiency when the perturbation is assumed to be slow. Here we claim that the frequency mismatch performs actually well for most disturbance regimes. This is shown through a series of simulations and is backed up by an analytical argument. Therefore, we argue that the frequency mismatch is an efficient and elegant tool for line disturbance location in complex networks of diffusively coupled agents.

97 MATHEMATICS AND COMPUTING↗

A Floating Node Method for the Modelling of Discontinuities Within a Finite Element

This paper focuses on the accurate numerical representation of complex networks of evolving discontinuities in solids, with particular emphasis on cracks. The limitation of the standard finite element method (FEM) in approximating discontinuous solutions has motivated the development of re-meshing, smeared crack models, the eXtended Finite Element Method (XFEM) and the Phantom Node Method (PNM). We propose a new method which has some similarities to the PNM, but crucially: (i) does not introduce an error on the crack geometry when mapping to natural coordinates; (ii) does not require numerical integration over only part of a domain; (iii) can incorporate weak discontinuities and cohesive cracks more readily; (iv) is ideally suited for the representation of multiple and complex networks of (weak, strong and cohesive) discontinuities; (v) leads to the same solution as a finite element mesh where the discontinuity is represented explicitly; and (vi) is conceptually simpler than the PNM.

Pinho, Silvestre T.↗

Accurate and reliable thermochemistry by data analysis of complex thermochemical networks using Active Thermochemical Tables: the case of glycine thermochemistry

Active Thermochemical Tables (ATcT) were successfully used to resolve the existing inconsistencies related to the thermochemistry of glycine, based on statistically analyzing and solving a thermochemical network that includes >3350 chemical species interconnected by nearly 35 000 thermochemically-relevant determinations from experiment and high-level theory. Here, the current ATcT results for the 298.15 K enthalpies of formation are −394.70 ± 0.55 kJ mol −1 for gas phase glycine, −528.37 ± 0.20 kJ mol −1 for solid α-glycine, −528.05 ± 0.22 kJ mol −1 for β-glycine, −528.64 ± 0.23 kJ mol −1 for γ-glycine, −514.22 ± 0.20 kJ mol −1 for aqueous undissociated glycine, and −470.09 ± 0.20 kJ mol −1 for fully dissociated aqueous glycine at infinite dilution. In addition, a new set of thermophysical properties of gas phase glycine was obtained from a fully corrected nonrigid rotor anharmonic oscillator (NRRAO) partition function, which includes all conformers. Corresponding sets of thermophysical properties of α-, β-, and γ-glycine are also presented.

Active Thermochemical Tables↗

Modeling the contributions to acoustic nonlinearity from complex dislocation networks using 3D dislocation dynamics

Nonlinear ultrasonic parameters are highly sensitive to microstructural features that affect macroscale material behavior, providing a nondestructive means to characterize their evolution. Although dislocations are known to be a strong source of acoustic nonlinearity, establishing quantitative links between the acoustic nonlinearity parameter (β), measured via Second Harmonic Generation, and dislocation morphology—such as dislocation length and density—remains an open challenge. This work advances the numerical modeling of dislocation–β relationships using 3D dislocation dynamics (DD) simulations in two approaches: a “static” method computing strain and stress fields from dislocation configurations in the absence of external loading, and a “quasi-static” method to estimate β from the curvature of dislocation lines under applied load. First, the static method is combined with finite element analysis to investigate a recent assertion that heterogeneous initial strain fields can induce higher harmonic generation in a linear elastic medium; the present results do not corroborate this outcome. Then, the quasi-static method is applied to multiple-dislocation scenarios through parametric studies, revealing behaviors not predicted by analytical models, such as the competing interactions of edge and screw dislocations and the significant influence of applied stress on β. Finally, the simulations are used to model SHG experimental results and validate the hypothesis that β can decrease during plastic deformation, despite increasing dislocation density. As the DD code used here is open-source, it provides a practical platform for future investigation into microstructure–β relationships important to the interpretation of SHG results.

Materials science↗

Analytic method for calculating properties of random walks on networks

A method for calculating the properties of discrete random walks on networks is presented. The method divides complex networks into simpler units whose contribution to the mean first-passage time is calculated. The simplified network is then further iterated. The method is demonstrated by calculating mean first-passage times on a segment, a segment with a single dangling bond, a segment with many dangling bonds, and a looplike structure. The results are analyzed and related to the applicability of the Einstein relation between conductance and diffusion.

Goldhirsch, I.↗

Accelerating network layouts using graph neural networks

Graph layout algorithms used in network visualization represent the first and the most widely used tool to unveil the inner structure and the behavior of complex networks. Current network visualization software relies on the force-directed layout (FDL) algorithm, whose high computational complexity makes the visualization of large real networks computationally prohibitive and traps large graphs into high energy configurations, resulting in hard-to-interpret “hairball” layouts. Here we use Graph Neural Networks (GNN) to accelerate FDL, showing that deep learning can address both limitations of FDL: it offers a 10 to 100 fold improvement in speed while also yielding layouts which are more informative. We analytically derive the speedup offered by GNN, relating it to the number of outliers in the eigenspectrum of the adjacency matrix, predicting that GNNs are particularly effective for networks with communities and local regularities. Finally, we use GNN to generate a three-dimensional layout of the Internet, and introduce additional measures to assess the layout quality and its interpretability, exploring the algorithm’s ability to separate communities and the link-length distribution. The novel use of deep neural networks can help accelerate other network-based optimization problems as well, with applications from reaction-diffusion systems to epidemics.

97 MATHEMATICS AND COMPUTING↗

Slip-free multiplication and complexity of dislocation networks in FCC metals

Abstract During plastic deformation of crystalline solids, intricate networks of dislocation lines form and evolve. To capture dislocation density evolution, prominent theories of crystal plasticity assume that 1) multiplication is driven by slip in active slip systems and 2) pair-wise slip system interactions dominate network evolution. In this work, we analyze a massive database of over 100 discrete dislocation dynamics simulations (with cross-slip suppressed), and our findings bring both of these assumptions into question. We demonstrate that dislocation multiplication is commonly observed on slip systems with no applied stress and no plastic strain rate, a phenomenon we refer to as slip-free multiplication. We show that while the formation of glissile junctions provides one mechanism for slip-free multiplication, additional mechanisms which account for the influence of coplanar interactions are needed to fully explain the observations. Unlike glissile junction formation which results from a binary reaction between a pair of slip systems, these new multiplication mechanisms require higher order reactions that lead to complex network configurations. While these complex configurations have not been given much attention previously, they account for about 50% of the line intersections in our database.

36 MATERIALS SCIENCE↗

Complex Fluid‐Driven Fractures Caused by Crack‐Parallel Stress

Abstract Managing fluid‐driven fracture networks is crucial for subsurface resource utilization, yet the current understanding of the key controlling factors remains insufficient. While geologic discontinuities have been shown to significantly influence fracture network complexity, this study identifies another major contributor. We conducted a new set of experiments using a transparent true triaxial cell, which enabled video recording of the temporal evolution of fluid‐driven fracture paths. Using pseudo‐2D samples without macroscale structural discontinuities, we observed multiple occurrences of hydraulic fracture curving and branching under anisotropic boundary stresses. We proposed a theoretical model demonstrating that the stress parallel to the crack line in the solid matrix near the crack tip (i.e., the T ‐stress) accounts for the observed fracture curving behavior. This finding suggests that T ‐stress is an additional mechanism contributing to the complexity of fluid‐driven fracture networks in the subsurface, besides the geologic discontinuities.

58 GEOSCIENCES↗

Global Droughts Connected By Linkages Between Drought Hubs

Quantifying the spatial and interconnected structure of regional to continental scale droughts is one of the unsolved global hydrology problems, which is important for understanding the looming risk of mega-scale droughts and the resulting water and food scarcity and their cascading impact on the worldwide economy. Using a Complex Network analysis, this study explores the topological characteristics of global drought events based on the self-calibrated Palmer Drought Severity Index. Event Synchronization is used to measure the strength of association between the onset of droughts at different spatial locations within the time lag of 1-3 months. The network coefficients derived from the synchronization network indicate a highly heterogeneous connectivity structure underlying global drought events. Drought hotspot regions such as Southern Europe, Northeast Brazil, Australia, and Northwest USA behave as drought hubs that synchronize regionally and with other hubs at inter-continental or even inter-hemispheric scale. This observed affinity among drought hubs is equivalent to the ‘rich-club phenomenon’ in Network Theory, where ‘rich’ nodes (here, drought hubs) are tightly interconnected to form a club, implicating the possibility of simultaneous large-scale droughts over multiple continents.

Drought↗

Inside the Mechanics of Network Development: How Competition and Strategy Reorganize European Air Traffic

Air transport forms complex networks that can be measured in order to understand its structural characteristics and functional properties. Recent models for network growth (i.e., preferential attachment, etc.) remain stochastic and do not seek to understand other network-specific mechanisms that may account for their development in a more microscopic way. Air traffic is made up of many constituent airlines that are either privately or publicly owned and that operate their own networks. They follow more or less similar business policies each. The way these airline networks organize among themselves into distinct traffic distributions reveals complex interaction among them, which in turn can be aggregated into larger (macro-) traffic distributions. Our approach allows for a more deterministic methodology that will assess the impact of airline strategies on the distinct distributions for air traffic, particularly inside Europe. One key question this paper is seeking to answer is whether there are distinct patterns of preferential attachment for given classes of airline networks to distinct types of European airports. Conclusions about the advancing degree of concentration in this industry and the airline operators that accelerate this process can be drawn.

Huber, Hans↗

A Theoretical Approach for Reliability Within Information Supply Chains With Cycles and Negations

Complex networks of information processing systems, or information supply chains, present challenges for performance analysis. Here, we establish a mathematical setting, in which a process within an information supply chain can be analyzed in terms of the functionality of the system’s components. Principles of this methodology are rigorously defended and induce a model for determining the reliability for the various products in these networks. Our model does not limit us from having cycles in the network, as long as the cycles do not contain negation. It is shown that our approach to reliability resolves the nonuniqueness caused by cycles in a probabilistic Boolean network. An iterative algorithm is given to find the reliability values of the model, using a process that can be fully automated. This automated method of discerning reliability is beneficial for systems managers. As a systems manager considers systems modification, such as the replacement of owned and maintained hardware systems with cloud computing resources, the need for comparative analysis of system reliability is paramount. The model is extended to handle conditional knowledge about the network, allowing one to make predictions of weaknesses in the system. Finally, to illustrate the model’s flexibility over different forms, it is demonstrated on a system of components and subcomponents.

97 MATHEMATICS AND COMPUTING↗

Tandem synthesis of tetrahydroquinolines and identification of the reaction network by operando NMR

The study of the reaction mechanism and complex network for heterogeneously catalyzed tandem reactions is challenging but can guide reaction design and optimization. Here, we describe a case study using bifunctional metal–organic framework supported Pd nanoparticles (Pd/UiO-66(HCl)) for the one-pot tandem synthesis of substituted tetrahydroquinolines via the Claisen–Schmidt condensation and reductive intramolecular cyclization. The directly observed evolution of intermediates and products, including reactive species containing hydroxylamine group and unstable intermediate 2-phenyl-3,4-dihydroquinoline, was enabled by operando magic angle spinning nuclear magnetic resonance studies under 50 bar H 2 . The reaction network of the tandem reaction is deduced based on reaction kinetic information obtained from the operando study. The optimized procedure was applied to various acetophenone and nitrobenzaldehyde derivatives carrying different functional groups, and eight valuable substituted tetrahydroquinolines were obtained in moderate to good yields. This work provides a molecular-level understanding of the catalytic system and brings up new opportunities for efficient and sustainable synthesis of medicinally relevant building blocks.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Toward Optimal Transport Networks

Strictly evolutionary approaches to improving the air transport system a highly complex network of interacting systems no longer suffice in the face of demand that is projected to double or triple in the near future. Thus evolutionary approaches should be augmented with active design methods. The ability to actively design, optimize and control a system presupposes the existence of predictive modeling and reasonably well-defined functional dependences between the controllable variables of the system and objective and constraint functions for optimization. Following recent advances in the studies of the effects of network topology structure on dynamics, we investigate the performance of dynamic processes on transport networks as a function of the first nontrivial eigenvalue of the network's Laplacian, which, in turn, is a function of the network s connectivity and modularity. The last two characteristics can be controlled and tuned via optimization. We consider design optimization problem formulations. We have developed a flexible simulation of network topology coupled with flows on the network for use as a platform for computational experiments.

Alexandrov, Natalia↗

Distribution of centrality measures on undirected random networks via the cavity method

The Katz centrality of a node in a complex network is a measure of the node’s importance as far as the flow of information across the network is concerned. For ensembles of locally tree-like undirected random graphs, this observable is a random variable. Its full probability distribution is of interest but difficult to handle analytically because of its “global” character and its definition in terms of a matrix inverse. Leveraging a fast Gaussian Belief Propagation-Cavity algorithm to solve linear systems on tree-like structures, we show that i) the Katz centrality of a single instance can be computed recursively in a very fast way, and ii) the probability P ( K ) that a random node in the ensemble of undirected random graphs has centrality K satisfies a set of recursive distributional equations, which can be analytically characterized and efficiently solved using a population dynamics algorithm. We test our solution on ensembles of Erdős-Rényi and Scale Free networks in the locally tree-like regime, with excellent agreement. The analytical distribution of centrality for the configuration model conditioned on the degree of each node can be employed as a benchmark to identify nodes of empirical networks with over- and underexpressed centrality relative to a null baseline. We also provide an approximate formula based on a rank- 1 projection that works well if the network is not too sparse, and we argue that an extension of our method could be efficiently extended to tackle analytical distributions of other centrality measures such as PageRank for directed networks in a transparent and user-friendly way.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Three-dimensional modeling of hyphal fusion, branching, and nutrient transport in filamentous fungi

Fungi exhibit behaviors distinct from other microbes. Filamentous fungi grow by extending complex networks of branched filaments collectively referred to as the mycelium. These networks can expand over large distances and traverse low-nutrient areas by translocating nutrients through the filament network. This spatial characteristic makes filamentous fungi crucial for soil ecosystems, supporting stable microbial communities and promoting plant growth. However, simulating these behaviors is complex. The elongated nature of fungal compartments results in different mechanical interactions compared to the commonly modeled spherical bacteria. These detailed hyphal mechanics require specialized consideration and are often excluded from conventional fungal simulation packages. Additionally, the extensive fungal networks in nature demand computationally intensive simulations, necessitating high-performance algorithms. Therefore, realistic fungi simulations require specialized software. Here, we introduce a fungal modeling expansion to the high-performance biological modelling and interface exchange (bmx) software suite. bmx leverages adaptive mesh refinement in AMReX for chemical diffusion and incorporates a full mechanical model for bacterial cells, accelerated by GPUs. By extending bmx to model filamentous particles, we demonstrate the formation of complex filament networks through interactions like hyphal branching and fusion (anastomosis). We show that the networks produced match real-world fungal structures through various metrics. This work supports computational studies of fungal growth dynamics and can be adapted to investigate the growth of other filamentous structures in biology or materials science. The expanded-BMX package is open-sourced and is available online.

Cell mechanics↗