Search NASA⌕ Search

SEARCH · Search NASA

Results for “NETWORKING”

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 1,063 records · Page 59

Cascading Failures in Interdependent Networks with Multiple Supply-Demand Links and Functionality Thresholds

Various social, financial, biological and technological systems can be modeled by interdependent networks. It has been assumed that in order to remain functional, nodes in one network must receive the support from nodes belonging to different networks. So far these models have been limited to the case in which the failure propagates across networks only if the nodes lose all their supply nodes. In this paper we develop a more realistic model for two interdependent networks in which each node has its own supply threshold, i.e., they need the support of a minimum number of supply nodes to remain functional. In addition, we analyze different conditions of internal node failure due to disconnection from nodes within its own network. We show that several local internal failure conditions lead to similar nontrivial results. When there are no internal failures the model is equivalent to a bipartite system, which can be useful to model a financial market. We explore the rich behaviors of these models that include discontinuous and continuous phase transitions. Using the generating functions formalism, we analytically solve all the models in the limit of infinitely large networks and find an excellent agreement with the stochastic simulations.

97 MATHEMATICS AND COMPUTING↗

Quantum annealing algorithms for Boolean tensor networks

Abstract Quantum annealers manufactured by D-Wave Systems, Inc., are computational devices capable of finding high-quality heuristic solutions of NP-hard problems. In this contribution, we explore the potential and effectiveness of such quantum annealers for computing Boolean tensor networks. Tensors offer a natural way to model high-dimensional data commonplace in many scientific fields, and representing a binary tensor as a Boolean tensor network is the task of expressing a tensor containing categorical (i.e., $$\{0, 1\}$$ { 0 , 1 } ) values as a product of low dimensional binary tensors. A Boolean tensor network is computed by Boolean tensor decomposition, and it is usually not exact. The aim of such decomposition is to minimize the given distance measure between the high-dimensional input tensor and the product of lower-dimensional (usually three-dimensional) tensors and matrices representing the tensor network. In this paper, we introduce and analyze three general algorithms for Boolean tensor networks: Tucker, Tensor Train, and Hierarchical Tucker networks. The computation of a Boolean tensor network is reduced to a sequence of Boolean matrix factorizations, which we show can be expressed as a quadratic unconstrained binary optimization problem suitable for solving on a quantum annealer. By using a novel method we introduce called parallel quantum annealing, we demonstrate that Boolean tensor’s with up to millions of elements can be decomposed efficiently using a DWave 2000Q quantum annealer.

97 MATHEMATICS AND COMPUTING↗

Self-organization of network dynamics into local quantized states

Self-organization and pattern formation in network-organized systems emerges from the collective activation and interaction of many interconnected units. A striking feature of these non-equilibrium structures is that they are often localized and robust: only a small subset of the nodes, or cell assembly, is activated. Understanding the role of cell assemblies as basic functional units in neural networks and socio-technical systems emerges as a fundamental challenge in network theory. A key open question is how these elementary building blocks emerge, and how they operate, linking structure and function in complex networks. Here we show that a network analogue of the Swift-Hohenberg continuum model—a minimal-ingredients model of nodal activation and interaction within a complex network—is able to produce a complex suite of localized patterns. Thus, the spontaneous formation of robust operational cell assemblies in complex networks can be explained as the result of self-organization, even in the absence of synaptic reinforcements.

59 BASIC BIOLOGICAL SCIENCES↗

Multi-fidelity modeling to predict the rheological properties of a suspension of fibers using neural networks and Gaussian processes

Unveiling the rheological properties of fiber suspensions is of paramount interest to many industrial applications. There are multiple factors, such as fiber aspect ratio and volume fraction, that play a significant role in altering the rheological behavior of suspensions. Three-dimensional (3D) numerical simulations of coupled differential equations of the suspension of fibers are computationally expensive and time-consuming. Machine learning algorithms can be trained on the available data and make predictions for the cases where no numerical data are available. However, some widely used machine learning surrogates, such as neural networks, require a relatively large training dataset to produce accurate predictions. Multi-fidelity models, which combine high-fidelity data from numerical simulations and less expensive lower fidelity data from resources such as simplified constitutive equations, can pave the way for more accurate predictions. Here, we focus on neural networks and the Gaussian processes with two levels of fidelity, i.e., high and low fidelity networks, to predict the steady-state rheological properties, and compare them to the single-fidelity network. High-fidelity data are obtained from direct numerical simulations based on an immersed boundary method to couple the fluid and solid motion. The low-fidelity data are produced by using constitutive equations. Multiple neural networks and the Gaussian process structures are used for the hyperparameter tuning purpose. Results indicate that with the best choice of hyperparameters, both the multi-fidelity Gaussian processes and neural networks are capable of making predictions with a high level of accuracy with neural networks demonstrating marginally better performance.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Structural inference of networked dynamical systems with universal differential equations

Networked dynamical systems are common throughout science in engineering; e.g., biological networks, reaction networks, power systems, and the like. For many such systems, nonlinearity drives populations of identical (or near-identical) units to exhibit a wide range of nontrivial behaviors, such as the emergence of coherent structures (e.g., waves and patterns) or otherwise notable dynamics (e.g., synchrony and chaos). Here, we seek to infer (i) the intrinsic physics of a base unit of a population, (ii) the underlying graphical structure shared between units, and (iii) the coupling physics of a given networked dynamical system given observations of nodal states. These tasks are formulated around the notion of the Universal Differential Equation, whereby unknown dynamical systems can be approximated with neural networks, mathematical terms known a priori (albeit with unknown parameterizations), or combinations of the two. We demonstrate the value of these inference tasks by investigating not only future state predictions but also the inference of system behavior on varied network topologies. The effectiveness and utility of these methods are shown with their application to canonical networked nonlinear coupled oscillators.

97 MATHEMATICS AND COMPUTING↗

Climate change–induced stress disrupts ectomycorrhizal interaction networks at the boreal–temperate ecotone

The interaction networks formed by ectomycorrhizal fungi (EMF) and their tree hosts, which are important to both forest recruitment and ecosystem carbon and nutrient retention, may be particularly susceptible to climate change at the boreal–temperate forest ecotone where environmental conditions are changing rapidly. Here, we quantified the compositional and functional trait responses of EMF communities and their interaction networks with two boreal ( Pinus banksiana and Betula papyrifera ) and two temperate ( Pinus strobus and Quercus macrocarpa ) hosts to a factorial combination of experimentally elevated temperatures and reduced rainfall in a long-term open-air field experiment. The study was conducted at the B4WarmED (Boreal Forest Warming at an Ecotone in Danger) experiment in Minnesota, USA, where infrared lamps and buried heating cables elevate temperatures (ambient, +3.1 °C) and rain-out shelters reduce growing season precipitation (ambient, ~30% reduction). EMF communities were characterized and interaction networks inferred from metabarcoding of fungal-colonized root tips. Warming and rainfall reduction significantly altered EMF community composition, leading to an increase in the relative abundance of EMF with contact-short distance exploration types. These compositional changes, which likely limited the capacity for mycelial connections between trees, corresponded with shifts from highly redundant EMF interaction networks under ambient conditions to less redundant (more specialized) networks. Further, the observed changes in EMF communities and interaction networks were correlated with changes in soil moisture and host photosynthesis. Collectively, these results indicate that the projected changes in climate will likely lead to significant shifts in the traits, structure, and integrity of EMF communities as well as their interaction networks in forest ecosystems at the boreal–temperate ecotone.

54 ENVIRONMENTAL SCIENCES↗

A Graphical Approach to Diagnosing the Validity of the Conditional Independence Assumptions of a Bayesian Network Given Data

Bayesian networks have attained widespread use in data analysis and decision making. Well studied topics include: efficient inference, evidence propagation, parameter learning from data for complete and incomplete data scenarios, expert elicitation for calibrating Bayesian network probabilities, and structure learning. It is not uncommon for the researcher to assume the structure of the Bayesian network or to glean the structure from expert elicitation or domain knowledge. In this scenario, the model may be calibrated through learning the parameters from relevant data. There is a lack of work on model diagnostics for fitted Bayesian networks; this is the contribution of this paper. We key on the definition of (conditional) independence to develop a graphical diagnostic method which indicates if the conditional independence assumptions imposed when one assumes the structure of the Bayesian network are supported by the data. We develop the approach theoretically and describe a Monte Carlo method to generate uncertainty measures for the consistency of the data with conditional independence assumptions under the model structure. We describe how this theoretical information and the data are presented in a graphical diagnostic tool. We demonstrate the approach through data simulated from Bayesian networks under different conditional independence assumptions. We also apply the diagnostic to a real world data set. The results indicate that our approach is a reasonable way of visualizing and inspecting the conditional independence assumption of a Bayesian network given data.

Bayesian Networks · Structural Model Diagnostics ·↗

Network analysis of memristive device circuits: dynamics, stability and correlations

Abstract Networks with memristive devices are a potential basis for the next generation of computing devices. They are also an important model system for basic science, from modeling nanoscale conductivity to providing insight into the information-processing of neurons. The resistance in a memristive device depends on the history of the applied bias and thus displays a type of memory. The interplay of this memory with the dynamic properties of the network can give rise to new behavior, offering many fascinating theoretical challenges. But methods to analyze general memristive circuits are not well described in the literature. In this paper we develop a general circuit analysis for networks that combine memristive devices alongside resistors, capacitors and inductors and under various types of control. We derive equations of motion for the memory parameters of these circuits and describe the conditions for which a network should display properties characteristic of a resonator system. For the case of a purely memresistive network, we derive Lyapunov functions, which can be used to study the stability of the network dynamics. Surprisingly, analysis of the Lyapunov functions show that these circuits do not always have a stable equilibrium in the case of nonlinear resistance and window functions. The Lyapunov function allows us to study circuit invariances, wherein different circuits give rise to similar equations of motion, which manifest through a gauge freedom and node permutations. Finally, we identify the relation between the graph Laplacian and the operators governing the dynamics of memristor networks operators, and we use these tools to study the correlations between distant memristive devices through the effective resistance.

97 MATHEMATICS AND COMPUTING↗

Training neural networks using Metropolis Monte Carlo and an adaptive variant

Abstract We examine the zero-temperature Metropolis Monte Carlo (MC) algorithm as a tool for training a neural network by minimizing a loss function. We find that, as expected on theoretical grounds and shown empirically by other authors, Metropolis MC can train a neural net with an accuracy comparable to that of gradient descent (GD), if not necessarily as quickly. The Metropolis algorithm does not fail automatically when the number of parameters of a neural network is large. It can fail when a neural network’s structure or neuron activations are strongly heterogenous, and we introduce an adaptive Monte Carlo algorithm (aMC) to overcome these limitations. The intrinsic stochasticity and numerical stability of the MC method allow aMC to train deep neural networks and recurrent neural networks in which the gradient is too small or too large to allow training by GD. MC methods offer a complement to gradient-based methods for training neural networks, allowing access to a distinct set of network architectures and principles.

97 MATHEMATICS AND COMPUTING↗

Combining compositional data sets introduces error in covariance network reconstruction

Microbial communities are diverse biological systems that include taxa from across multiple kingdoms of life. Notably, interactions between bacteria and fungi play a significant role in determining community structure. However, these statistical associations across kingdoms are more difficult to infer than intra-kingdom associations due to the nature of the data involved using standard network inference techniques. We quantify the challenges of cross-kingdom network inference from both theoretical and practical points of view using synthetic and real-world microbiome data. We detail the theoretical issue presented by combining compositional data sets drawn from the same environment, e.g. 16S and ITS sequencing of a single set of samples, and we survey common network inference techniques for their ability to handle this error. We then test these techniques for the accuracy and usefulness of their intra- and inter-kingdom associations by inferring networks from a set of simulated samples for which a ground-truth set of associations is known. We show that while the two methods mitigate the error of cross-kingdom inference, there is little difference between techniques for key practical applications including identification of strong correlations and identification of possible keystone taxa (i.e. hub nodes in the network). Furthermore, we identify a signature of the error caused by transkingdom network inference and demonstrate that it appears in networks constructed using real-world environmental microbiome data.

59 BASIC BIOLOGICAL SCIENCES↗

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↗

Neuralized fermionic tensor networks for quantum many-body systems

In this work, we describe a class of neuralized fermionic tensor network states (NN-fTNSs) that introduce nonlinearity into fermionic tensor networks through configuration-dependent neural network transformations of the local tensors. The construction uses the fTNS algebra to implement a natural fermionic sign structure and is compatible with standard tensor network algorithms but gains enhanced expressivity through the neural network parametrization. Using the 1D and 2D Fermi-Hubbard models as benchmarks, we demonstrate that NN-fTNSs achieve order of magnitude improvements in the ground-state energy compared to pure fTNSs with the same bond dimension and can be systematically improved through both the tensor network bond dimension and the neural network parametrization. Compared to existing fermionic neural quantum states based on Slater determinants and Pfaffians, NN-fTNSs offer a physically motivated alternative fermionic structure. Furthermore, compared to such states, NN-fTNSs naturally exhibit improved computational scaling and we demonstrate a construction that achieves linear scaling with the lattice size.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Multi-Channel Large Network Simulation Including Adversarial Activity

Using network simulation to generate high fidelity networks is essential to test adversarial search problems, in addition to their benefits of privacy preservation and benchmarking purposes. Different generative models have been developed to generate single-channel, homogeneous networks that can model domains such as social networks, communication, and co-authorship. Modeling adversarial activity compounds the complexity of network simulation as it requires generating multi-channel networks simultaneously with correlated channel attributes at scale. We present a methodology along with scalable graph modeling and generation tools to produce realistic large-scale synthetic background activity graphs with embedded an adversarial activity. We present a concrete use case based on an attack scenario developed with the help of subject matter experts (SMEs). We discuss challenges in modeling integration across channels, scalability of the generative models, and integration across such models. We also discuss required aspects to simulate high fidelity multi-channel networks up-to an order of billion edges.

Network simulation, Multi-channel simulation, Adve↗

Cyber-Physical System Security With Deceptive Virtual Hosts for Industrial Control Networks

A challenge facing industrial control network administrators is protecting the typically large number of connected assets for which they are responsible. These cyber devices may be tightly coupled with the physical processes they control and human induced failures risk dire real-world consequences. Dynamic virtual honeypots are effective tools for observing and attracting network intruder activity. This paper presents a design and implementation for self-configuring honeypots that passively examine control system network traffic and actively adapt to the observed environment. In contrast to prior work in the field, six tools were analyzed for suitability of network entity information gathering. Ettercap, an established network security tool not commonly used in this capacity, outperformed the other tools and was chosen for implementation. Utilizing Ettercap XML output, a novel four-step algorithm was developed for autonomous creation and update of a Honeyd configuration. This algorithm was tested on an existing small campus grid and sensor network by execution of a collaborative usage scenario. Automatically created virtual hosts were deployed in concert with an anomaly behavior (AB) system in an attack scenario. Virtual hosts were automatically configured with unique emulated network stack behaviors for 92% of the targeted devices. The AB system alerted on 100% of the monitored emulated devices.

97 MATHEMATICS AND COMPUTING↗

Global Network Analysis of Neisseria gonorrhoeae Identifies Coordination between Pathways, Processes, and Regulators Expressed during Human Infection

Neisseria gonorrhoeae is a Gram-negative diplococcus that is responsible for the sexually transmitted infection gonorrhea, a high-morbidity disease in the United States and worldwide. Over the past several years, N. gonorrhoeae strains resistant to antibiotics used to treat this infection have begun to emerge across the globe. Thus, new treatment strategies are needed to combat this organism. Here, we utilized N. gonorrhoeae transcriptomic data sets, including those obtained from natural infection of the human genital tract, to infer the first global gene coexpression network of this pathogen. Interrogation of this network revealed genes central to the network that are likely critical for gonococcal growth, metabolism, and virulence, including genes encoding hypothetical proteins expressed during mucosal infection. In addition, network analysis revealed overlap in the response of N. gonorrhoeae to incubation with neutrophils and exposure to hydrogen peroxide stress in vitro. Network analysis also identified new targets of the gonococcal global regulatory protein Fur, while examination of the network neighborhood of genes allowed us to assign additional putative categories to several proteins. Collectively, the characterization of the first gene coexpression network for N. gonorrhoeae described here has revealed new regulatory pathways and new categories for proteins and has shown how processes important to gonococcal infection in both men and women are linked. This information fills a critical gap in our understanding of virulence strategies of this obligate human pathogen and will aid in the development of new treatment strategies for gonorrhea.

59 BASIC BIOLOGICAL SCIENCES↗

Genomic reconstruction of transcriptional regulatory networks in lactic acid bacteria

Background: Genome scale annotation of regulatory interactions and reconstruction of regulatory networks are the crucial problems in bacterial genomics. The Lactobacillales order of bacteria collates various microorganisms having a large economic impact, including both human and animal pathogens and strains used in the food industry. Nonetheless, no systematic genome-wide analysis of transcriptional regulation has been previously made for this taxonomic group. Results: A comparative genomics approach was used for reconstruction of transcriptional regulatory networks in 30 selected genomes of lactic acid bacteria. The inferred networks comprise regulons for 102 orthologous transcription factors (TFs), including 47 novel regulons for previously uncharacterized TFs. Numerous differences between regulatory networks of the Streptococcaceae and Lactobacillaceae groups were described on several levels. The two groups are characterized by substantially different sets of TFs encoded in their genomes. Content of the inferred regulons and structure of their cognate TF binding motifs differ for many orthologous TFs between the two groups. Multiple cases of non-orthologous displacements of TFs that control specific metabolic pathways were reported. Conclusions: The reconstructed regulatory networks substantially expand the existing knowledge of transcriptional regulation in lactic acid bacteria. In each of 30 studied genomes the obtained regulatory network contains on average 36 TFs and 250 target genes that are mostly involved in carbohydrate metabolism, stress response, metal homeostasis and amino acids biosynthesis. The inferred networks can be used for genetic experiments, functional annotations of genes, metabolic reconstruction and evolutionary analysis. All reconstructed regulons are captured within the Streptococcaceae and Lactobacillaceae collections in the RegPrecise database (http://regprecise.lbl.gov).

59 BASIC BIOLOGICAL SCIENCES↗

Beyond 100 Gb/s: Capacity, Flexibility, and Network Optimization

Here, we discuss building blocks that enable the exploitation of optical capacities beyond 100 Gb/s. Optical networks will benefit from more flexibility and agility in their network elements, especially from coherent transceivers. To achieve capacities of 400 Gb/s and more, coherent transceivers will operate at higher symbol rates. This will be made possible with higher bandwidth components using new electro-optic technologies implemented with indium phosphide and silicon photonics. Digital signal processing will benefit from new algorithms. Multi-dimensional modulation, of which some formats are already in existence in current flexible coherent transceivers, will provide improved tolerance to noise and fiber nonlinearities. Constellation shaping will further improve these tolerances while allowing a finer granularity in the selection of capacity. Frequency-division multiplexing will also provide improved tolerance to the nonlinear characteristics of fibers. Algorithms with reduced computation complexity will allow the implementation, at speeds, of direct pre-compensation of nonlinear propagation effects. Advancement in forward error correction will shrink the performance gap with Shannon's limit. At the network control and management level, new tools are being developed to achieve a more efficient utilization of networks. This will also allow for network virtualization, orchestration, and management. Lastly, FlexEthernet and FlexOTN will be put in place to allow network operators to optimize capacity in their optical transport networks without manual changes to the client hardware.

47 OTHER INSTRUMENTATION↗

Animal movement estimation and network-based epidemic modeling: Illustration for the swine industry in Iowa (US)

Animal movement plays a critical role in disease transmission between farms. However, in the United States, the lack of available animal shipment data, sometimes coupled with a lack of detailed information about farm demographics and characteristics, presents great challenges for epidemic modeling and prediction. In this study, we proposed a new method based on the maximum entropy to generate “synthetic” animal movement networks, considering available statistics about the premises operation type, operation size, and the distance between premises. We illustrated our method for the swine movement networks in Iowa and performed network analyses to gain insights into the swine industry. We then applied the generated networks to a network-based epidemic model to identify potential system vulnerabilities in terms of disease transmission. The model was parameterized for African Swine Fever (ASF) as the US swine industry is quite concerned about this disease. Results show that premises with a central role in the network are more vulnerable to disease outbreaks and play an important role in disease spread. Simulations with outbreaks starting from random farms reveal no significant large outbreaks, indicating the system’s relative robustness against arbitrary disease introductions. However, outbreaks originating from high out-degree farms can lead to large epidemic sizes. This underscores the importance for stakeholders and policymakers to continue improving animal movement records and traceability programs in the US and the value of making that data available to epidemiologists and modelers to better understand risk and inform strategies aimed to cost-effectively prevent and control disease transmission. Our approach could be easily adapted to estimate movement networks in other animal production systems and to inform disease spread models for various infectious diseases.

60 APPLIED LIFE SCIENCES↗