SEARCH · Engineering Papers

Results for “NETWORK”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

SourceResearch connectionFrom yearThrough year

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

At least 541 records · Page 30

All sources NASA NTRS DOE OSTI

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

DOE OSTI2019

Internet protocol network mapper

A system for identifying IP ranges having a network address and a network address mask is provided. The system generates a collection of IP ranges. For each unique network address as defined by a maximum network address mask within provided IP addresses, the system adds to the collection an IP range for that unique network address. The added IP range may be defined by the unique network address and a network address mask that is set to the maximum network address mask. The system identifies groups of IP ranges of the collection to be represented by a combined IP range with a combined network address mask. For each group of IP ranges, the system removes from the collection the IP ranges within the group and adds to the collection the combined IP range with a network address and the combined network address mask.

Youd, David W.↗

DOE OSTI2023

Intelligent network slicing and policy-based routing engine

One or more aspects of the present disclosure are directed to network optimization solutions provided as software agents (applications) executed on network nodes in a heterogenous multi-vendor environment to provide cross-layer network optimization and ensure availability of network resources to meet associated Quality of Experience (QoE) and Quality of Service (QoS). In one aspect, a network slicing engine is configured to receive at least one request from at least one network endpoint for access to the heterogeneous multi-vendor network for data transmission; receive information on state of operation of a plurality of communication links between the plurality of nodes; determine a set of data transmission routes for the request; assign a network slice for serving the request; determine, from the set of data transmission routes, an end-to-end route for the network slice; and send network traffic associated with the request using the network slice and over the end-to-end route.

Mody, Apurva N.↗

DOE OSTI2018

Estimation of Commodity Origin-Destination Matrices and Flows: The Network Tomography of U.S. Wheat Shipments

This study proceeds from the belief that an examination of railroads and railcar flows provides important insights into economic geography and to the economics of transportation. The flows of wheat in the United States are examined using rail carload waybill survey data in order to model the network routes likely taken from origin to destination, a characterization of the flows themselves, and modeling the flows through the comparison of standard gravity models with two relatively new gravity estimation methodologies suggested in the network analysis literature. The analysis covers Wheat flows through the U.S. for the years 2013 through 2015. Rail flows are highly conducive to the emergence of high volume corridors, a primary hypothetical relationship described by Taaffe, Morrill and Gould (1963). Hubs are expected to develop in market centers with sufficient traffic, as in a Christaller (1966) system, where market centers above a certain size have terminal facilities, or serve as primary interchange points. Centers of different sizes may also have more than one load center thereby concentrating and attracting more flows (o’Kelly, 1998). Implications are for commodity production and processing locations to develop concentrations of flows and the development of identifiable commodity-specific components of the national rail network. As the railroad nodes are structured in relation to the railroad network, the origin and destination nodes take the form of an irregular lattice (Besag 1974). One implication of this irregular lattice network is the probable presence of network autocorrelation in the flows: the constraints of network connectivity assure flows are not open between the terminals, but travel to and from distinct neighbors on the network. In addition, the network terminal structure can be expected to follow a hierarchical central place ordering. Evidence of such an ordering may be determined by examining the clustering and concentration of flows at nodes and, by association, particular network links serving those nodes (Fujita and Thisse 2002; Hesse and Rodrigue 2004; Nierat 1997). The presence of hierarchies implies economies of scale are being realized which leads to a centralizing or agglomerating effect (Fujita and Thisse, 2002 and Brakman et al, 2001). Thus the transportation sector will also develop an associated central place hierarchy with its own associated network of flows and flow concentrations.

Peterson, Steven↗

DOE OSTI2018

Anomaly analysis and visualization for dynamic networks through spatiotemporal graph segmentations

With recent technology advance in Internet of Things (IoT) that involves human, sensors, and mobile devices, networks are not only growing much larger but more complex and dynamic in nature. The spatiotemporal dynamics of networks are represented by both topological changes and temporal shifts of attribute information associated with network components. Understanding the pattern and trend of dynamic networks is increasingly important. While data mining approaches are generally useful in analyzing the statistical properties of networks, there has been recent trend to consider bringing human into the loop, and to examine how feedback from visualizations of large-scale dynamic networks can further improve data mining and machine learning. Traditional visualization methods based on animation and sequences of snapshot graphs are also limited by human cognitive capability. Here, we present a dynamic network analysis and visualization (DNAV) tool which explores the spatiotemporal dimensions of graph components. In particular, nodes and edges are augmented with spatiotemporal segmentation based on both topological and attribute dynamics (e.g., time and locations of connectivity). To further facilitate analysis of large dynamic networks, DNAV includes statistical dynamic overviews alongside graph views, as well as data filtering modules for scalable analysis. Using case studies on public datasets, we demonstrate the effectiveness of DNAV in understanding and analyzing anomalies in dynamic networks such as computer communication networks.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

On the evaluation and selection of network-level traffic control policies: Perimeter control, TUC, and their combination

Perimeter control (PC) of urban traffic networks can be effective in increasing network-wide efficiency. PC operates on the border of a protected region of a traffic network. Most studies thus far considered fixed-time plans for the inner part of these regions. A few studies have shown that combining PC with locally actuated or decentralized traffic control systems may have positive effects on traffic performance, including better-defined Network Macroscopic Fundamental Diagrams (NMFDs), increased network throughput, and reduced delays. The Traffic-responsive Urban Control (TUC) is a real-time network-wide traffic control system with particular design characteristics, such as the balancing of link's occupancies and an inherent gating feature. These characteristics suggest that TUC may enhance the traffic network performance when combined with PC whilst improving the resulting NMFDs and network throughput and delays. Here, in this work, we investigate the effect of feedback perimeter control (FPC), TUC, and their combination on the NMFD and on the traffic conditions of general traffic and public transport in the microsimulation of a realistic model of the Christchurch Central Business District in New Zealand. We perform a thorough investigation of practical aspects of both control strategies and their combination, including parameter tuning and infrastructure requirements, and how they may affect the control system choice. Results show higher throughput and less hysteresis on the NMFDs, particularly when TUC is involved. PC provides benefits concentrated in the protected region which can greatly benefit public transportation if there is an overlap with the transit network. The combination of TUC and FPC boosts network-wide throughput.

33 ADVANCED PROPULSION SYSTEMS↗

DOE OSTI2018

False Positive and False Negative Effects on Network Attacks

Robustness against attacks serves as evidence for complex network structures and failure mechanisms that lie behind them. Most often, due to detection capability limitation or good disguises, attacks on networks are subject to false positives and false negatives, meaning that functional nodes may be falsely regarded as compromised by the attacker and vice versa. In this work, we initiate a study of false positive/negative effects on network robustness against three fundamental types of attack strategies, namely, random attacks (RA), localized attacks (LA), and targeted attack (TA). By developing a general mathematical framework based upon the percolation model, we investigate analytically and by numerical simulations of attack robustness with false positive/negative rate (FPR/FNR) on three benchmark models including Erdős-Rényi (ER) networks, random regular (RR) networks, and scale-free (SF) networks. We show that ER networks are equivalently robust against RA and LA only when FPR equals zero or the initial network is intact. We find several interesting crossovers in RR and SF networks when FPR is taken into consideration. By defining the cost of attack, we observe diminishing marginal attack efficiency for RA, LA, and TA. Our finding highlights the potential risk of underestimating or ignoring FPR in understanding attack robustness. The results may provide insights into ways of enhancing robustness of network architecture and improve the level of protection of critical infrastructures.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2019

Development of a topology analysis tool for fifth-generation district heating and cooling networks

Fifth generation district heating and cooling networks are characterized by supply temperatures in the ambient range of 15-25 degrees C, which not only reduces heat loss but also allows for integrating various kinds of low-temperature waste heat sources. The ability of these networks to absorb waste heat that is normally unrecoverable makes them an attractive solution for the future energy supply of urban areas. To enhance the adoption of these networks, this paper describes the development of a software tool to analyze the feasibility of fifth-generation of district heating and cooling systems in both new and existing districts. The research attempts to answer the question: 'Which buildings should be connected to a low-temperature hydraulic network given both the incremental benefits and costs relative to the scenario of decentralized (dedicated) heating and cooling systems for each building?' Therefore, all possible network layouts of the buildings are considered where the heating and cooling demands of each building are met by the fifth-generation of district heating and cooling network. For the heating and cooling load characterization of the buildings, reduced-order models are used while renewable energy and waste heat sources are included in the network. The focus of the research lies in the development of a hydraulic model for flexible use in the urban energy modeling and the optimization of the fifth-generation of district heating and cooling network topology for a given urban district. This research displays simulation results that quantify the performance of the fifth-generation of district heating and cooling network based on various output metrics, including primary energy usage, carbon dioxide emissions, and network implementation cost.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

DOE OSTI2022

Feasibility of critical infrastructure protection using network functions for programmable and decoupled ICS policy enforcement over WAN

Industrial control systems (ICS) represent a major component of our critical infrastructure. With the increasing need for more control and monitoring of such systems, ICS have seen an increase in connectivity to wide area networks (WAN) exposing aging equipment to rapidly evolving cybersecurity threats. Furthermore, the ICS data requires a reliability measure from the networks for critical functions for infrastructure monitoring and control. Especially when remote plant sites are involved such as pipelines, energy distribution networks, and transportation, WAN transport impairments most often provide a best effort delivery with no strict reliability guarantees. Network functions can provide a vendor agnostic, programmable critical infrastructure protection with a single maintenance, policy determination, and reliability assurance surface. A network function (NF) can be utilized for policy enforcement over the communication between remote entities and the main control office. This paper presents the research on transparent integration with existing ICS without disrupting communications, resulting in minimal downtime while decoupling the fast paced evolution of defensive security measures from the upgrade cycle of expensive long term hardware. We report our measurements on the resource requirements and overhead in the network for successful NF insertion under a wide variety of network impairments (network packet delay, reordering, and loss). Our paired NF implementation provides a policy enforcement platform extensible to cover myriad cybersecurity-related communication goals, including packet signing for verification, encryption for data privacy, packet filtering and data diode operation (i.e. protecting against eavesdropping, packet injection, and denial-of-service). Furthermore, bundling communication specifications into packet flows allows for tunability in applying policies as coarse- or fine-grained as the needs of the operator. We report on network function resource requirements in the form of required queue depth and network utilization overhead to inform the decision making against hardware cost constraints.

42 ENGINEERING↗

DOE OSTI2016

Systematic network assessment of the carcinogenic activities of cadmium

Cadmium has been defined as type I carcinogen for humans, but the underlying mechanisms of its carcinogenic activity and its influence on protein-protein interactions in cells are not fully elucidated. The aim of the current study was to evaluate, systematically, the carcinogenic activity of cadmium with systems biology approaches. From a literature search of 209 studies that performed with cellular models, 208 proteins influenced by cadmium exposure were identified. All of these were assessed by Western blotting and were recognized as key nodes in network analyses. The protein-protein functional interaction networks were constructed with NetBox software and visualized with Cytoscape software. These cadmium-rewired genes were used to construct a scale-free, highly connected biological protein interaction network with 850 nodes and 8770 edges. Of the network, nine key modules were identified and 60 key signaling pathways, including the estrogen, RAS, PI3K-Akt, NF-κB, HIF-1α, Jak-STAT, and TGF-β signaling pathways, were significantly enriched. With breast cancer, colorectal and prostate cancer cellular models, we validated the key node genes in the network that had been previously reported or inferred form the network by Western blotting methods, including STAT3, JNK, p38, SMAD2/3, P65, AKT1, and HIF-1α. These results suggested the established network was robust and provided a systematic view of the carcinogenic activities of cadmium in human. - Highlights: • A cadmium-influenced network with 850 nodes and 8770 edges was established. • The cadmium-rewired gene network was scale-free and highly connected. • Nine modules were identified, and 60 key signaling pathways related to cadmium-induced carcinogenesis were found. • Key mediators in the network were validated in multiple cellular models.

60 APPLIED LIFE SCIENCES↗

DOE OSTI2023

Non-unimodal and non-concave relationships in the network Macroscopic Fundamental Diagram caused by hierarchical streets

Unimodal, concave relationships between average network productivity and accumulation or density aggregated across spatially compact regions of urban networks—so called network Macroscopic Fundamental Diagrams (MFDs)—have recently been shown to exist on homogeneous street networks. When present, MFD relationships facilitate the modeling of traffic congestion at a regional level and have led to the development of various regional traffic control strategies. However, real street networks are not homogeneous—they generally have a hierarchical structure where some streets (e.g., arterials) promote higher mobility than others (e.g., local roads). Here, this paper examines how the presence of hierarchical roadway structures may potentially cause non-unimodal patterns in a network's MFD. These are observed using three types of tools: analytical models of simple network structures, simulations of various idealized roadway networks, and empirical data. The impacts of street hierarchy depend on how vehicles use different roadway types to move within the network; i.e., their routing strategy. The findings suggest that the presence of roadway hierarchies may lead to MFDs that have non-unimodal or non-concave patterns on the free-flow branch when vehicles route themselves according to user equilibrium principles, which is closest to what would be observed in realistic situations. Such patterns are contrary to what is traditionally assumed in most MFD-based modeling frameworks. However, the unimodal and concave MFD should be expected under system optimal routing conditions that maximize network productivity for a given traffic state.

42 ENGINEERING↗