SEARCH · Engineering Papers

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 577 records · Page 32

All sources NASA NTRS DOE OSTI

DOE OSTI2015

Effects of bursting dynamic features on the generation of multi-clustered structure of neural network with symmetric spike-timing-dependent plasticity learning rule

In this paper, the generation of multi-clustered structure of self-organized neural network with different neuronal firing patterns, i.e., bursting or spiking, has been investigated. The initially all-to-all-connected spiking neural network or bursting neural network can be self-organized into clustered structure through the symmetric spike-timing-dependent plasticity learning for both bursting and spiking neurons. However, the time consumption of this clustering procedure of the burst-based self-organized neural network (BSON) is much shorter than the spike-based self-organized neural network (SSON). Our results show that the BSON network has more obvious small-world properties, i.e., higher clustering coefficient and smaller shortest path length than the SSON network. Also, the results of larger structure entropy and activity entropy of the BSON network demonstrate that this network has higher topological complexity and dynamical diversity, which benefits for enhancing information transmission of neural circuits. Hence, we conclude that the burst firing can significantly enhance the efficiency of clustering procedure and the emergent clustered structure renders the whole network more synchronous and therefore more sensitive to weak input. This result is further confirmed from its improved performance on stochastic resonance. Therefore, we believe that the multi-clustered neural network which self-organized from the bursting dynamics has high efficiency in information processing.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2022

Disentangling direct from indirect relationships in association networks

Networks are vital tools for understanding and modeling interactions in complex systems in science and engineering, and direct and indirect interactions are pervasive in all types of networks. However, quantitatively disentangling direct and indirect relationships in networks remains a formidable task. Here, we present a framework, called iDIRECT (Inference of Direct and Indirect Relationships with Effective Copula-based Transitivity), for quantitatively inferring direct dependencies in association networks. Using copula-based transitivity, iDIRECT eliminates/ameliorates several challenging mathematical problems, including ill-conditioning, self-looping, and interaction strength overflow. With simulation data as benchmark examples, iDIRECT showed high prediction accuracies. Application of iDIRECT to reconstruct gene regulatory networks in Escherichia coli also revealed considerably higher prediction power than the best-performing approaches in the DREAM5 (Dialogue on Reverse Engineering Assessment and Methods project, #5) Network Inference Challenge. In addition, applying iDIRECT to highly diverse grassland soil microbial communities in response to climate warming showed that the iDIRECT-processed networks were significantly different from the original networks, with considerably fewer nodes, links, and connectivity, but higher relative modularity. Further analysis revealed that the iDIRECT-processed network was more complex under warming than the control and more robust to both random and target species removal ( P < 0.001). As a general approach, iDIRECT has great advantages for network inference, and it should be widely applicable to infer direct relationships in association networks across diverse disciplines in science and engineering.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2020

Distributed Outage Detection in Power Distribution Networks

Real time topology knowledge is essential for situational awareness of power distribution networks. Line outages change the topology of a distribution network. Hence, outage detection is an important task. Most of the existing outage detection algorithms are centralized, in which sensors communicate their data to a control center which performs outage detection using the received data. However, with the increasing size of the distribution network and with different areas of the network being monitored by different operators, communication is a bottleneck and scalability is a major concern. To address these issues, we propose a novel outage detection algorithm using a divide and conquer approach. First, we divide a distribution network into sub-networks, such that outage detection can be run in parallel in each sub-network independently ensuring scalability to large networks. Further, to reduce the latency, bandwidth and attenuation challenges associated with communications in a large network, we divide each sub-network into multiple control areas which communicate only with their neighbors. We employ a distributed iterative load estimation across the control areas of each sub-network and then use the load estimate for local outage detection in each control area. Here, the performance of our algorithm is evaluated for multiple feeder models and compared against traditional centralized outage detection algorithms.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

DOE OSTI2024

Parallel Simulation of Quantum Networks with Distributed Quantum State Management

Quantum network simulators offer the opportunity to cost-efficiently investigate potential avenues for building networks that scale with the number of users, communication distance, and application demands by simulating alternative hardware designs and control protocols. Several quantum network simulators have been recently developed with these goals in mind. As the size of the simulated networks increases, however, sequential execution becomes time-consuming. Parallel execution presents a suitable method for scalable simulations of large-scale quantum networks, but the unique attributes of quantum information create unexpected challenges. In this work, we identify requirements for parallel simulation of quantum networks and develop the first parallel discrete-event quantum network simulator by modifying the existing serial simulator SeQUeNCe. Our contributions include the design and development of a quantum state manager (QSM) that maintains shared quantum information distributed across multiple processes. We also optimize our parallel code by minimizing the overhead of the QSM and decreasing the amount of synchronization needed among processes. Using these techniques, we observe a speedup of 2 to 25 times when simulating a 1,024-node linear network topology using 2 to 128 processes. We also observe an efficiency greater than 0.5 for up to 32 processes in a linear network topology of the same size and with the same workload. We repeat this evaluation with a randomized workload on a caveman network. We also introduce several methods for partitioning networks by mapping them to different parallel simulation processes. We have released the parallel SeQUeNCe simulator as an open source tool alongside the existing sequential version.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2019

Beyond toy models: distilling tensor networks in full AdS/CFT

We present a general procedure for constructing tensor networks that accurately reproduce holographic states in conformal field theories (CFTs). Given a state in a large-N CFT with a static, semiclassical gravitational dual, we build a tensor network by an iterative series of approximations that eliminate redundant degrees of freedom and minimize the bond dimensions of the resulting network. We argue that the bond dimensions of the tensor network will match the areas of the corresponding bulk surfaces. For “tree” tensor networks (i.e., those that are constructed by discretizing spacetime with nonintersecting Ryu-Takayanagi surfaces), our arguments can be made rigorous using a version of one-shot entanglement distillation in the CFT. Using the known quantum error correcting properties of AdS/CFT, we show that bulk legs can be added to the tensor networks to create holographic quantum error correcting codes. These codes behave similarly to previous holographic tensor network toy models, but describe actual bulk excitations in continuum AdS/CFT. By assuming some natural generalizations of the “holographic entanglement of purification” conjecture, we are able to construct tensor networks for more general bulk discretizations, leading to finer-grained networks that partition the information content of a Ryu-Takayanagi surface into tensor-factorized subregions. While the granularity of such a tensor network must be set larger than the string/Planck scales, we expect that it can be chosen to lie well below the AdS scale. However, we also prove a no-go theorem which shows that the bulk-to-boundary maps cannot all be isometries in a tensor network with intersecting Ryu-Takayanagi surfaces.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2016

Autonomous management of a recursive area hierarchy for large scale wireless sensor networks using multiple parents

Large scale wireless sensor networks have been proposed for applications ranging from anomaly detection in an environment to vehicle tracking. Many of these applications require the networks to be distributed across a large geographic area while supporting three to five year network lifetimes. In order to support these requirements large scale wireless sensor networks of duty-cycled devices need a method of efficient and effective autonomous configuration/maintenance. This method should gracefully handle the synchronization tasks duty-cycled networks. Further, an effective configuration solution needs to recognize that in-network data aggregation and analysis presents significant benefits to wireless sensor network and should configure the network in a way such that said higher level functions benefit from the logically imposed structure. NOA, the proposed configuration and maintenance protocol, provides a multi-parent hierarchical logical structure for the network that reduces the synchronization workload. It also provides higher level functions with significant inherent benefits such as but not limited to: removing network divisions that are created by single-parent hierarchies, guarantees for when data will be compared in the hierarchy, and redundancies for communication as well as in-network data aggregation/analysis/storage.

47 OTHER INSTRUMENTATION↗

DOE OSTI2021

Multilayer Network Clarifies Prevailing Water Consumption Telecouplings in the United States

Virtual water flows are used to map the indirect water consumption connections implied by the supply chain of a city, region, or country. This information can be used to manage supply chains to achieve environmental policy objectives and mitigate environmental risks to critical supply chains. A limitation of prior work is that these flows are typically analyzed using monolayer networks, which ignores crucial intersectoral or interlayer couplings. Here, in this study, we use a multilayer network to account for such couplings when analyzing blue virtual water flows in the United States. Our multilayer network consists of 115 different regions (nodes), covering the entire conterminous United States; 41 coupled economic sectors (layers); and ∼2 × 10 7 possible links. To analyze the multilayer network, we focus on three fundamental network properties: topological connectivity, mesoscale structure, and node centrality. The network has a high connectivity, with each node being on average connected to roughly 2/3 of the network's nodes. Interlayer flows are a major driver of connectivity, representing ∼54% of all the network's connections. Five different groups of tightly connected nodes (communities) characterize the network. Each community represents a preferred spatial mode of long-range virtual water interaction within the United States. We find that large (populous) cities have a stronger influence than small ones on network functioning because they attract and recirculate more virtual water through their supply chains. Our results also highlight differences between the multilayer and monolayer virtual water network, which overall show that the former provides a more realistic representation of virtual water flows.

Garcia Gonzalez, Susana↗

DOE OSTI2013

Seizure-induced alterations in fast-spiking basket cell GABA currents modulate frequency and coherence of gamma oscillation in network simulations

Gamma frequency oscillations have been proposed to contribute to memory formation and retrieval. Fast-spiking basket cells (FS-BCs) are known to underlie development of gamma oscillations. Fast, high amplitude GABA synapses and gap junctions have been suggested to contribute to gamma oscillations in FS-BC networks. Recently, we identified that, apart from GABAergic synapses, FS-BCs in the hippocampal dentate gyrus have GABAergic currents mediated by extrasynaptic receptors. Our experimental studies demonstrated two specific changes in FS-BC GABA currents following experimental seizures [Yu et al., J. Neurophysiol. 109, 1746 (2013)]: increase in the magnitude of extrasynaptic (tonic) GABA currents and a depolarizing shift in GABA reversal potential (E{sub GABA}). Here, we use homogeneous networks of a biophysically based model of FS-BCs to examine how the presence of extrasynaptic GABA conductance (g{sub GABA-extra}) and experimentally identified, seizure-induced changes in g{sub GABA-extra} and E{sub GABA} influence network activity. Networks of FS-BCs interconnected by fast GABAergic synapses developed synchronous firing in the dentate gamma frequency range (40–100 Hz). Systematic investigation revealed that the biologically realistic range of 30 to 40 connections between FS-BCs resulted in greater coherence in the gamma frequency range when networks were activated by Poisson-distributed dendritic synaptic inputs rather than by homogeneous somatic current injections, which were balanced for FS-BC firing frequency in unconnected networks. Distance-dependent conduction delay enhanced coherence in networks with 30–40 FS-BC interconnections while inclusion of gap junctional conductance had a modest effect on coherence. In networks activated by somatic current injections resulting in heterogeneous FS-BC firing, increasing g{sub GABA-extra} reduced the frequency and coherence of FS-BC firing when E{sub GABA} was shunting (−74 mV), but failed to alter average FS-BC frequency when E{sub GABA} was depolarizing (−54 mV). When FS-BCs were activated by biologically based dendritic synaptic inputs, enhancing g{sub GABA-extra} reduced the frequency and coherence of FS-BC firing when E{sub GABA} was shunting and increased average FS-BC firing when E{sub GABA} was depolarizing. Shifting E{sub GABA} from shunting to depolarizing potentials consistently increased network frequency to and above high gamma frequencies (>80 Hz). Since gamma oscillations may contribute to learning and memory processing [Fell et al., Nat. Neurosci. 4, 1259 (2001); Jutras et al., J. Neurosci. 29, 12521 (2009); Wang, Physiol. Rev. 90, 1195 (2010)], our demonstration that network oscillations are modulated by extrasynaptic inhibition in FS-BCs suggests that neuroactive compounds that act on extrasynaptic GABA receptors could impact memory formation by modulating hippocampal gamma oscillations. The simulation results indicate that the depolarized FS-BC GABA reversal, observed after experimental seizures, together with enhanced spillover extrasynaptic GABA currents are likely to promote generation of focal high frequency activity associated with epileptic networks.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2017

Networks in ATLAS

Networks have played a critical role in high-energy physics (HEP), enabling us to access and effectively utilize globally distributed resources to meet the needs of our physicists. Because of their importance in enabling our grid computing infrastructure many physicists have taken leading roles in research and education (R&E) networking, participating in, and even convening, network related meetings and research programs with the broader networking community worldwide. This has led to HEP benefiting from excellent global networking capabilities for little to no direct cost. However, as other science domains ramp-up their need for similar networking it becomes less clear that this situation will continue unchanged. What this means for ATLAS in particular needs to be understood. ATLAS has evolved its computing model since the LHC started based upon its experience with using globally distributed resources. The most significant theme of those changes has been increased reliance upon, and use of, its networks. We will report on a number of networking initiatives in ATLAS including participation in the global perfSONAR network monitoring and measuring efforts of WLCG and OSG, the collaboration with the LHCOPN/LHCONE effort, the integration of network awareness into PanDA, the use of the evolving ATLAS analytics framework to better understand our networks and the changes in our DDM system to allow remote access to data.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

MONACO: accurate biological network alignment through optimal neighborhood matching between focal nodes

Motivation: Alignment of protein–protein interaction networks can be used for the unsupervised prediction of functional modules, such as protein complexes and signaling pathways, that are conserved across different species. To date, various algorithms have been proposed for biological network alignment, many of which attempt to incorporate topological similarity between the networks into the alignment process with the goal of constructing accurate and biologically meaningful alignments. Especially, random walk models have been shown to be effective for quantifying the global topological relatedness between nodes that belong to different networks by diffusing node-level similarity along the interaction edges. However, these schemes are not ideal for capturing the local topological similarity between nodes. Results: Here, we propose MONACO, a novel and versatile network alignment algorithm that finds highly accurate pairwise and multiple network alignments through the iterative optimal matching of ‘local’ neighborhoods around focal nodes. Extensive performance assessment based on real networks as well as synthetic networks, for which the ground truth is known, demonstrates that MONACO clearly and consistently outperforms all other state-of-the-art network alignment algorithms that we have tested, in terms of accuracy, coherence and topological quality of the aligned network regions. Furthermore, despite the sharply enhanced alignment accuracy, MONACO remains computationally efficient and it scales well with increasing size and number of networks.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2014

Damage Spreading in Spatial and Small-world Random Boolean Networks

The study of the response of complex dynamical social, biological, or technological networks to external perturbations has numerous applications. Random Boolean Networks (RBNs) are commonly used a simple generic model for certain dynamics of complex systems. Traditionally, RBNs are interconnected randomly and without considering any spatial extension and arrangement of the links and nodes. However, most real-world networks are spatially extended and arranged with regular, power-law, small-world, or other non-random connections. Here we explore the RBN network topology between extreme local connections, random small-world, and pure random networks, and study the damage spreading with small perturbations. We find that spatially local connections change the scaling of the relevant component at very low connectivities ($\bar{K} \ll 1$) and that the critical connectivity of stability $K_s$ changes compared to random networks. At higher $\bar{K}$, this scaling remains unchanged. We also show that the relevant component of spatially local networks scales with a power-law as the system size N increases, but with a different exponent for local and small-world networks. The scaling behaviors are obtained by finite-size scaling. We further investigate the wiring cost of the networks. From an engineering perspective, our new findings provide the key design trade-offs between damage spreading (robustness), the network's wiring cost, and the network's communication characteristics.

Lu, Qiming↗

DOE OSTI2011

Phylogenetic Molecular Ecological Network of Soil Microbial Communities in Response to Elevated CO 2

Understanding the interactions among different species and their responses to environmental changes, such as elevated atmospheric concentrations of CO 2 , is a central goal in ecology but is poorly understood in microbial ecology. Here we describe a novel random matrix theory (RMT)-based conceptual framework to discern phylogenetic molecular ecological networks using metagenomic sequencing data of 16S rRNA genes from grassland soil microbial communities, which were sampled from a long-term free-air CO 2 enrichment experimental facility at the Cedar Creek Ecosystem Science Reserve in Minnesota. Our experimental results demonstrated that an RMT-based network approach is very useful in delineating phylogenetic molecular ecological networks of microbial communities based on high-throughput metagenomic sequencing data. The structure of the identified networks under ambient and elevated CO 2 levels was substantially different in terms of overall network topology, network composition, node overlap, module preservation, module-based higher-order organization, topological roles of individual nodes, and network hubs, suggesting that the network interactions among different phylogenetic groups/populations were markedly changed. Also, the changes in network structure were significantly correlated with soil carbon and nitrogen contents, indicating the potential importance of network interactions in ecosystem functioning. In addition, based on network topology, microbial populations potentially most important to community structure and ecosystem functioning can be discerned. The novel approach described in this study is important not only for research on biodiversity, microbial ecology, and systems microbiology but also for microbial community studies in human health, global change, and environmental management.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2016

petal: Co-expression network modelling in R

Background: Networks provide effective models to study complex biological systems, such as gene and protein interaction networks. With the advent of new sequencing technologies, many life scientists are grasping for user-friendly methods and tools to examine biological components at the whole-systems level. Gene co-expression network analysis approaches are frequently used to successfully associate genes with biological processes and demonstrate great potential to gain further insights into the functionality of genes, thus becoming a standard approach in Systems Biology. Here the objective is to construct biologically meaningful and statistically strong co-expression networks, the identification of research dependent subnetworks, and the presentation of self-contained results. Results: We introduce petal, a novel approach to generate gene co-expression network models based on experimental gene expression measures. petal focuses on statistical, mathematical, and biological characteristics of both, input data and output network models. Often over-looked issues of current co-expression analysis tools include the assumption of data normality, which is seldom the case for hight-throughput expression data obtained from RNA-seq technologies. petal does not assume data normality, making it a statistically appropriate method for RNA-seq data. Also, network models are rarely tested for their known typical architecture: scale-free and small-world. petal explicitly constructs networks based on both these characteristics, thereby generating biologically meaningful models. Furthermore, many network analysis tools require a number of user-defined input variables, these often require tuning and/or an understanding of the underlying algorithm; petal requires no user input other than experimental data. This allows for reproducible results, and simplifies the use of petal. Lastly, this approach is specifically designed for very large high-throughput datasets; this way, petal’s network models represent as much of the entire system as possible to provide a whole-system approach. Conclusion: petal is a novel tool for generating co-expression network models of whole-genomics experiments. It is implemented in R and available as a library. Its application to several whole-genome experiments has generated novel meaningful results and has lead the way to new testing hypothesizes for further biological investigation.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2010

Multiplicative Attribute Graph Model of Real-World Networks

Large scale real-world network data, such as social networks, Internet andWeb graphs, is ubiquitous in a variety of scientific domains. The study of such social and information networks commonly finds patterns and explain their emergence through tractable models. In most networks, especially in social networks, nodes also have a rich set of attributes (e.g., age, gender) associatedwith them. However, most of the existing network models focus only on modeling the network structure while ignoring the features of nodes in the network. Here we present a class of network models that we refer to as the Multiplicative Attribute Graphs (MAG), which naturally captures the interactions between the network structure and node attributes. We consider a model where each node has a vector of categorical features associated with it. The probability of an edge between a pair of nodes then depends on the product of individual attributeattribute similarities. The model yields itself to mathematical analysis as well as fit to real data. We derive thresholds for the connectivity, the emergence of the giant connected component, and show that the model gives rise to graphs with a constant diameter. Moreover, we analyze the degree distribution to show that the model can produce networks with either lognormal or power-law degree distribution depending on certain conditions.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2013

The NSLS-II Control Network Design

The required positioning tolerances are an essential part of the survey and alignment design. The following tables show the requirement of storage ring. Table 1 provides the required global tolerances, while Table 2 outlines the relative tolerances for the NSLS-II girder-to-girder positioning. These tolerances dictate the instruments and methods necessary to obtain the positioning goals. The global tolerance is a little bit relaxed, but the ± 0.10 mm positioning requirement of adjacent girders is rather strict if the larger dimension and probable foundation settlement is considered. control network. Therefore, whether the goals can be obtained is mainly dependent on the performance of control network. The shape of control network defines the global alignment accuracy, while the relative position relationships of monuments determine the relative positioning accuracy between girders. When deciding the strategy of survey and alignment techniques, the instrumentation and approach of light sources have been built and are still in construction are investigated. State-of-the art equipment and methods will be employed. NSLS-II covers an area of about one-eighth of a square kilometer with a radius of ~126 m and a circumference of ~792 m. Depending on the size of the system to be constructed, primary and secondary control networks are required to achieve these tolerances. Primary control network will provide global control for different tunnels, and it should possess a relative point accuracy of better than ± 3 mm for all the storage ring monuments. Secondary control network will direct the alignment of girders in tunnel with the ability to ensure the final ± 0.10 mm positioning accuracy. The experiences from accomplished light source indicate that: for a dimension like NSLS2, primary control network can obtain a point accuracy of better than ± 1 mm easily, while secondary control network can obtain a relative point accuracy of ± 0.08 mm. With this expectation, the tolerance can be achieved for both the global and relative situation. Take the relative positioning requirement as an example, with 2 control network error of ± 0.08 mm, instrument tie-in error of ± 0.04 mm, and residual error of ± 0.04 mm, according to error propagation formula, the final alignment error should be better than ± 0.1 mm. Correspondingly, if a better control network accuracy can be achieved, the requirement for the residuals can be looser. The further alignment accuracy improvement will be realized by a smoothing process to assure the better position relationship between adjacent girders. The following simulation will perform error analysis to evaluate the estimated accuracy of NSLS II control network.

36 MATERIALS SCIENCE↗

DOE OSTI2016

Silicon-embedded copper nanostructure network for high energy storage

Provided herein are nanostructure networks having high energy storage, electrochemically active electrode materials including nanostructure networks having high energy storage, as well as electrodes and batteries including the nanostructure networks having high energy storage. According to various implementations, the nanostructure networks have high energy density as well as long cycle life. In some implementations, the nanostructure networks include a conductive network embedded with electrochemically active material. In some implementations, silicon is used as the electrochemically active material. The conductive network may be a metal network such as a copper nanostructure network. Methods of manufacturing the nanostructure networks and electrodes are provided. In some implementations, metal nanostructures can be synthesized in a solution that contains silicon powder to make a composite network structure that contains both. The metal nanostructure growth can nucleate in solution and on silicon nanostructure surfaces.

25 ENERGY STORAGE↗

DOE OSTI2018

Silicon-embedded copper nanostructure network for high energy storage

25 ENERGY STORAGE↗

DOE OSTI2018

Democratizing Network Reservations through Application-Aware Orchestration

The provisioning of network connections for data transfers that provide quality of service (QoS) over research and education (R&E) networks is currently performed by network operators. For network connections that span multiple administrative domains, network operators have to reach agreements on reservation requirements. As a result, a network reservation request may take from days to weeks to be provisioned. To improve provisioning times and the success rate of multidomain network reservations, we designed and implemented an application-aware orchestration framework for multidomain R&E networks. This framework leverages latest developments in software-defined networking to automate network provisioning in order to democratize access to network reservation through novel APIs. We present the design, implementation, and evaluation of our application-aware orchestration framework. We evaluate our system using Mininet and demonstrate that it provisions 49% more reservations than current state-of-the-art systems within seconds of receiving a request.

Rao, Nageswara S.↗