Engineering Papers⌕ Search

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.

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

At least 1,675 records · Page 93
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Modeling of the Coral Microbiome: the Influence of Temperature and Microbial Network

Host-associated microbial communities are shaped by extrinsic and intrinsic factors to the holobiont organism. Environmental factors and microbe-microbe interactions act simultaneously on the microbial community structure, making the microbiome dynamics challenging to predict. The coral microbiome is essential to the health of coral reefs and sensitive to environmental changes. Here, we develop a dynamic model to determine the microbial community structure associated with the surface mucus layer (SML) of corals using temperature as an extrinsic factor and microbial network as an intrinsic factor. The model was validated by comparing the predicted relative abundances of microbial taxa to the relative abundances of microbial taxa from the sample data. The SML microbiome from Pseudodiploria strigosa was collected across reef zones in Bermuda, where inner and outer reefs are exposed to distinct thermal profiles. A shotgun metagenomics approach was used to describe the taxonomic composition and the microbial network of the coral SML microbiome. By simulating the annual temperature fluctuations at each reef zone, the model output is statistically identical to the observed data. The model was further applied to six scenarios that combined different profiles of temperature and microbial network to investigate the influence of each of these two factors on the model accuracy. The SML microbiome was best predicted by model scenarios with the temperature profile that was closest to the local thermal environment, regardless of the microbial network profile. Our model shows that the SML microbiome of P. strigosa in Bermuda is primarily structured by seasonal fluctuations in temperature at a reef scale, while the microbial network is a secondary driver. Coral microbiome dysbiosis (i.e., shifts in the microbial community structure or complete loss of microbial symbionts) caused by environmental changes is a key player in the decline of coral health worldwide. Multiple factors in the water column and the surrounding biological community influence the dynamics of the coral microbiome. However, by including only temperature as an external factor, our model proved to be successful in describing the microbial community associated with the surface mucus layer (SML) of the coral P. strigosa. The dynamic model developed and validated in this study is a potential tool to predict the coral microbiome under different temperature conditions.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2016

Scale-Free Compact Routing Schemes in Networks of Low Doubling Dimension

In this work, we consider compact routing schemes in networks of low doubling dimension, where the doubling dimension is the least value α such that any ball in the network can be covered by at most 2 α balls of half radius. There are two variants of routing-scheme design: (i) labeled (name-dependent) routing, in which the designer is allowed to rename the nodes so that the names (labels) can contain additional routing information, for example, topological information; and (ii) name-independent routing, which works on top of the arbitrary original node names in the network, that is, the node names are independent of the routing scheme. In this article, given any constant ε ϵ (0, 1) and an n-node edge-weighted network of doubling dimension α ϵ O(loglog n), we present —a (1 + ε)-stretch labeled compact routing scheme with Γlog n-bit routing labels, O(log 2 n/loglog n)-bit packet headers, and ((1/ε) O(α) log 3 n)-bit routing information at each node; —a (9 + ε)-stretch name-independent compact routing scheme with O(log 2 n/loglog n)-bit packet headers, and ((1/ε) O(α) log 3 n)-bit routing information at each node. In addition, we prove a lower bound: any name-independent routing scheme with o(n (ε/60)2 ) bits of storage at each node has stretch no less than 9 - ε for any ε ϵ (0, 8). Therefore, our name-independent routing scheme achieves asymptotically optimal stretch with polylogarithmic storage at each node and packet headers. Note that both schemes are scale-free in the sense that their space requirements do not depend on the normalized diameter Δ of the network. Finally, we also present a simpler nonscale-free (9 + ε)-stretch name-independent compact routing scheme with improved space requirements if Δ is polynomial in n.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

DReAM: Demand Response Architecture for Multi-level District Heating and Cooling Networks

In this paper, we exploit the inherent hierarchy of heat exchangers in District Heating and Cooling (DHC) networks and propose DReAM, a novel Demand Response (DR) architecture for Multi-level DHC networks. DReAM serves to economize system operation while still respecting comfort requirements of individual consumers. Contrary to many present day DR schemes that work on a consumer level granularity, DReAM works at a level of hierarchy above buildings, i.e. substations that supply heat to a group of buildings. This improves the overall DR scalability and reduce the computational complexity. In the first step of the proposed approach, mathematical models of individual substations and their downstream networks are abstracted into appropriately constructed low-complexity structural forms. In the second step, this abstracted information is employed by the utility to perform DR optimization that determines the optimal heat inflow to individual substations rather than buildings, in order to achieve the targeted objectives across the network. We validate the proposed DReAM framework through experimental results under different scenarios on a test network.

Bhattacharya, Saptarshi↗
DOE OSTI2017

HotSpots: Failure Cascades on Heterogeneous Critical Infrastructure Networks

Critical Infrastructure Systems such as transportation, water and power grid systems are vital to our national security, economy, and public safety. Recent events, like the 2012 hurricane Sandy, show how the interdependencies among different CI networks lead to catastrophic failures among the whole system. Hence, analyzing these CI networks, and modeling failure cascades on them becomes a very important problem. However, traditional models either do not take multiple CIs or the dynamics of the system into account, or model it simplistically. In this paper, we study this problem using a heterogeneous network viewpoint. We first construct heterogeneous CI networks with multiple components using national-level datasets. Then we study novel failure maximization problems on these networks, to compute critical nodes in such systems. We then provide HotSpots, a scalable and effective algorithm for these problems, based on careful transformations. Finally, we conduct extensive experiments on real CIS data from multiple US states, and show that our method HotSpots outperforms non-trivial baselines, gives meaningful results and that our approach gives immediate benefits in providing situational-awareness during large-scale failures.

Chen, Liangzhe↗
DOE OSTI2023

cuAlign: Scalable Network Alignment on GPU Accelerators

Given two graphs, the objective of network alignment is to find the best one-to-one mapping of vertices in one graph (??) to vertices in the other (??), such that the number of overlaps is maximized. We say that edges(??, ??) ???and(??', ??') ??? are overlapped if ?? is mapped to ??' and ?? is mapped to??'. Network alignment is an important optimization problem with several applications in bioinformatics, computer vision and ontology matching. Since it is an NP-hard problem, efficient heuristics and scalable implementations are necessary. In this work, we introduce a new framework that combines the concepts of intra-network proximity using vertex embedding,Belief Propagation (BP) and approximate weighted matching, and provides qualitative improvements up to22%over state-of-the-art approaches. We also provide scalable implementations on GPU accelerators, demonstrating up to19×speedup for Belief Propagation and 3× speedup for approximate weighted matching relative to previous multithreaded implementation. A combination of combinatorial and algebraic kernels within the network alignment algorithm poses significant hurdles for parallelization. Load imbalance and irregular DRAM traffic limit achievable performance on GPUs. Our novel approach identifies and exploits unique structural proper-ties of the BP-based algorithm and employs code fusion to reduce data movement between different steps of the algorithm. Using a diverse set of inputs, we demonstrate qualitative improvements of our algorithms, and performance gains of our GPU-accelerated implementation. We believe that our work will enable algorithmic improvements and practical applications of network alignment.

Xiang, Lizhi↗
DOE OSTI2025

Complex Parsing for In-Network Acceleration of High-Energy Physics Experiments

This paper describes a novel application and evaluation of programmable networking in High-Energy Physics (HEP): a complete parser for the custom packet format used by Fermilab’s DUNE experiment. Notably, this parser is implemented on a Tofino programmable network switch and evaluated on the FABRIC testbed by using network traffic generated by the ICEBERG DUNE prototype. The parsed network traffic consists of Jumbo Ethernet frames that contain digitizations of sensor readings from ICEBERG’s detector.This work is an early investigation into providing in-network processing support for HEP experiments. The paper describes DUNE’s custom packet format, the challenges encountered when implementing a parser for that format, and an exploration of the techniques that are needed to overcome those challenges. We identify performance bottlenecks and discuss directions for future research.

Sagstad, Bjoern [IIT, Chicago] (ORCID:000900033610↗
DOE OSTI2014

The Science DMZ: A Network Design Pattern for Data-Intensive Science

The ever-increasing scale of scientific data has become a significant challenge for researchers that rely on networks to interact with remote computing systems and transfer results to collaborators worldwide. Despite the availability of high-capacity connections, scientists struggle with inadequate cyberinfrastructure that cripples data transfer performance, and impedes scientific progress. The Science DMZ paradigm comprises a proven set of network design patterns that collectively address these problems for scientists. We explain the Science DMZ model, including network architecture, system configuration, cybersecurity, and performance tools, that creates an optimized network environment for science. We describe use cases from universities, supercomputing centers and research laboratories, highlighting the effectiveness of the Science DMZ model in diverse operational settings. In all, the Science DMZ model is a solid platform that supports any science workflow, and flexibly accommodates emerging network technologies. As a result, the Science DMZ vastly improves collaboration, accelerating scientific discovery.

Dart, Eli↗
DOE OSTI2018

Optimization, Inference and Learning for Advanced Networks

This piece of software aims at providing an implementation of methods to perform efficient optimization, probabilistic inference and model selection and learning for various type of networked systems. The software contains a suite of methods and functions that: 1) perform probabilistic inference and random sampling on networked models 2) select or learn networked models from data 3) solve optimization tasks with a networked structure Network models that are supported by these features include, but are not limited to, factor graphs and Markov random fields such as Ising models, Potts models, p-spins models, Gaussian random fields and restricted Boltzmann machine.

Hijazi, Hassan↗
DOE OSTI2020

Hylia: Time-Series Library for Network Operations (Hylia) v1

The ability to analyze time-series data in network operations is critical to ensure optimal operations and management in wide area networks, sensor networks, and cloud networks. Hylia is a collection of multiple time-series prediction algorithms designed specifically to work with network monitoring data sets such as SNMP, NETFLOW and other monitoring data. It is designed to recognize these features and perform the extrapolation of the data.

Kiran, Mariam↗
DOE OSTI2024

UFNet: Joint U-Net and Fully Connected Neural Network to Bias Correct Precipitation Predictions from

Paper information. Shuang Yu, Indrasis Chakraborty, Gemma J. Anderson, Donald D. Lucas, Yannic Lops, and Daniel Galea. UFNet: Joint U-Net and fully connected neural network to bias correct precipitation predictions from climate models. Artificial Intelligence for the Earth Systems, 2024. Overview. This work develops the UFNet methodology to correct E3SM historical precipitation projection bias. The UFNet deep learning framework consists of a two-part architecture: a U-Net convolutional network to capture the spatiotemporal distribution of precipitation and a fully connected network to capture the distribution of higher-order statistics. The joint network, termed UFNet, can simultaneously improve the spatial structure of the modeled precipitation and capture the distribution of extreme precipitation values. Below we provide guidance for applying UFNet to correct the Energy Exascale Earth System Model (E3SM; Golaz et al. 2019) daily precipitation projection over the contiguous United States (CONUS). Getting started 1. Obtain the historical climate simulation and observation data. The E3SM historical simulation data are available through https://aims2.llnl.gov/search/cmip6/. The CPC unified gauge-based analysis of daily precipitation can be found through https://psl.noaa.gov/data/gridded/data.cpc.globalprecip.html. The ECMWF atmospheric reanalysis of the 20th century (ERA-20C) data are available through https://www.ecmwf.int/en/forecasts/datasets/reanalysis-datasets/era-20c. The spatial resolution of E3SM and observed datasets are both regridded to a common 1° resolution grid using conservative interpolation. The regridded E3SM, CPC and ERA-20C with 1° resolution can be found throught ./data/. 2. Train the fully connected network (DNN) Python train_dnn.py 3. Train the UFNet Python train_ufnet.py 4. Evaluation and compared with the baseline Python evaluation.py

Lucas, DonaldD↗
DOE OSTI2022

Observing Profiles of Derived Kinematic Field Quantities Using a Network of Profiling Sites

Abstract Observations of thermodynamic and kinematic parameters associated with derivatives of the thermodynamics and wind fields, namely, advection, vorticity, divergence, and deformation, can be obtained by applying Green’s theorem to a network of observing sites. The five nodes that comprise the Atmospheric Radiation Measurement (ARM) Southern Great Plains (SGP) profiling network, spaced 50–80 km apart, are used to obtain measurements of these parameters over a finite region. To demonstrate the applicability of this technique at this location, it is first applied to gridded model output from the High-Resolution Rapid Refresh (HRRR) numerical weather prediction model, using profiles from the locations of ARM network sites, so that values calculated from this method can be directly compared to finite difference calculations. Good agreement is found between both approaches as well as between the model and values calculated from the observations. Uncertainties for the observations are obtained via a Monte Carlo process in which the profiles are randomly perturbed in accordance with their known error characteristics. The existing size of the ARM network is well suited to capturing these parameters, with strong correlations to model values and smaller uncertainties than a more closely spaced network, yet it is small enough that it avoids the tendency for advection to go to zero over a large area.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2018

Network Scale Travel Time Prediction using Deep Learning

In recent years, deep learning models have been receiving increased attention within the artificial intelligence (AI) community because of their high prediction accuracy. In this paper, two deep learning models, long short-term memory (LSTM) and convolutional neural network (CNN), are proposed to predict travel time in a road network. One major advantage of using deep learning for travel time prediction is that it can make accurate predictions for all the segments in the transportation network with a single model structure, instead of building customized models for each segment separately. The proposed models were evaluated on a transportation network in the City of Saint Louis, Missouri. The prediction results show that deep learning can provide accurate prediction for both congested and uncongested traffic conditions, and can successfully capture the traffic dynamics of unexpected incidents or special events. The study findings show that deep learning offers a promising approach to real-time prediction of travel times on a network scale.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2018

A Time-Dependent Intermodal A* Algorithm: Methodology and Implementation on a Large-Scale Network

This paper proposes a time-dependent intermodal A* (TDIMA*) algorithm. The algorithm works on a multimodal network with transit, walking, and vehicular network links, and finds paths for the three major modes (transit, walking, driving) and any feasible combination thereof (e.g., park-and-ride). Turn penalties on the vehicular network and progressive transfer penalties on the transit network are considered for improved realism. Moreover, upper bounds to prevent excessive waiting and walking are introduced, as well as an upper bound on driving for the park-and-ride (PNR) mode. The algorithm is validated on the large-scale Chicago Regional network using real-world trips against the Google Directions API and the Regional Transit Authority router.

Verbas, Omer↗
DOE OSTI2014

The founding charter of the Genomic Observatories Network

The co-authors of this paper hereby state their intention to work together to launch the Genomic Observatories Network (GOs Network) for which this document will serve as its Founding Charter. We define a Genomic Observatory as an ecosystem and/or site subject to long-term scientific research, including (but not limited to) the sustained study of genomic biodiversity from single-celled microbes to multicellular organisms. An international group of 64 scientists first published the call for a global network of Genomic Observatories in January 2012. The vision for such a network was expanded in a subsequent paper and developed over a series of meetings in Bremen (Germany), Shenzhen (China), Moorea (French Polynesia), Oxford (UK), Pacific Grove (California, USA), Washington (DC, USA), and London (UK). While this community-building process continues, here we express our mutual intent to establish the GOs Network formally, and to describe our shared vision for its future. The views expressed here are ours alone as individual scientists, and do not necessarily represent those of the institutions with which we are affiliated.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2016

Genome co-amplification upregulates a mitotic gene network activity that predicts outcome and response to mitotic protein inhibitors in breast cancer

Background: High mitotic activity is associated with the genesis and progression of many cancers. Small molecule inhibitors of mitotic apparatus proteins are now being developed and evaluated clinically as anticancer agents. With clinical trials of several of these experimental compounds underway, it is important to understand the molecular mechanisms that determine high mitotic activity, identify tumor subtypes that carry molecular aberrations that confer high mitotic activity, and to develop molecular markers that distinguish which tumors will be most responsive to mitotic apparatus inhibitors. Methods: We identified a coordinately regulated mitotic apparatus network by analyzing gene expression profiles for 53 malignant and non-malignant human breast cancer cell lines and two separate primary breast tumor datasets. We defined the mitotic network activity index (MNAI) as the sum of the transcriptional levels of the 54 coordinately regulated mitotic apparatus genes. The effect of those genes on cell growth was evaluated by small interfering RNA (siRNA). Results: High MNAI was enriched in basal-like breast tumors and was associated with reduced survival duration and preferential sensitivity to i nhibitors of the mitotic apparatus proteins, polo-like kinase, centromere associated protein E and aurora kinase designated GSK462364, GSK923295 and GSK1070916, respectively. Co-amplification of regions of chromosomes 8q24, 10p15-p12, 12p13, and 17q24-q25 was associated with the transcriptional upregulation of this network of 54 mitotic apparatus genes, and we identify transcription factors that localize to these regions and putatively regulate mitotic activity. Knockdown of the mitotic network by siRNA identified 22 genes that might be considered as additional therapeutic targets for this clinically relevant patient subgroup. Conclusions: We define a molecular signature which may guide therapeutic approaches for tumors with high mitotic network activity.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2022

Network upgrade exploiting multi band: S- or E-band?

Nowadays, the fiber spectrum is only partially exploited, i.e., mainly in the C-band and more recently in the C + L-band, where the fiber attenuation profile experiences the minimum. Thus, fiber communications technology—amplifiers, switching, transceivers, etc.—and networking solutions are mature for those spectrum bands. However, the continuous increase in traffic means that capacity saturation of the current infrastructure is looming. Taking advantage of the unused portions of the spectrum (e.g., the S- and E-bands) may be an efficient solution to accommodate an increase in traffic without installing new fibers. Research is thus investigating multi-band transmission and networking to evaluate and enable such network upgrades. Some issues need to be solved or taken into account, from the enabling technology (e.g., amplifiers in the S- or E-band are still under development) to physical layer effects previously neglected, such as stimulated Raman scattering (SRS). SRS affects wideband transmission, potentially degrading active channels. The contribution of this paper is the investigation of network upgrades for C + L-band systems. In particular, upgrades exploiting the E- and S-bands are compared taking into account each band capacity and the effects of SRS on both new and already deployed channels (in both the C- and L-bands). A detailed analysis of the physical layer is provided also in the presence of guard bands between previously exploited bands and the bands used for upgrade. By leveraging the physical layer assessment, a networking analysis is carried out to evaluate the supported traffic increase and also the signal quality degradation due to SRS on active channels. Overall, the results suggest that upgrades to the E- and S-bands support a comparable increase in traffic. However, the exploitation of the E-band with 14 THz of guard band between the C- and E-bands may avoid detrimental effects to already active channels in the C + L-band, suggesting this upgrade strategy can be the most effective of the two.

47 OTHER INSTRUMENTATION↗
DOE OSTI2022

Optimal resource allocation for flexible-grid entanglement distribution networks

We use a genetic algorithm (GA) as a design aid for determining the optimal provisioning of entangled photon spectrum in flex-grid quantum networks with arbitrary numbers of channels and users. After introducing a general model for entanglement distribution based on frequency-polarization hyperentangled biphotons, we derive upper bounds on fidelity and entangled bit rate for networks comprising one-to-one user connections. Simple conditions based on user detector quality and link efficiencies are found that determine whether entanglement is possible. We successfully apply a GA to find optimal resource allocations in four different representative network scenarios and validate features of our model experimentally in a quantum local area network in deployed fiber. Our results show promise for the rapid design of large-scale entanglement distribution networks.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Community detection in sequence similarity networks based on attribute clustering

Networks are powerful tools for the presentation and analysis of interactions in multi-component systems. A commonly studied mesoscopic feature of networks is their community structure, which arises from grouping together similar nodes into one community and dissimilar nodes into separate communities. Here in this paper, the community structure of protein sequence similarity networks is determined with a new method: Attribute Clustering Dependent Communities (ACDC). Sequence similarity has hitherto typically been quantified by the alignment score or its expectation value. However, pair alignments with the same score or expectation value cannot thus be differentiated. To overcome this deficiency, the method constructs, for pair alignments, an extended alignment metric, the link attribute vector, which includes the score and other alignment characteristics. Rescaling components of the attribute vectors qualitatively identifies a systematic variation of sequence similarity within protein superfamilies. The problem of community detection is then mapped to clustering the link attribute vectors, selection of an optimal subset of links and community structure refinement based on the partition density of the network. ACDC-predicted communities are found to be in good agreement with gold standard sequence databases for which the "ground truth" community structures (or families) are known. ACDC is therefore a community detection method for sequence similarity networks based entirely on pair similarity information. A serial implementation of ACDC is available from https://cmb.ornl.gov/resources/developments

59 BASIC BIOLOGICAL SCIENCES↗