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 919 records · Page 51

Deep learning multiphysics network for imaging CO 2 saturation and estimating uncertainty in geological carbon storage

Multiphysics inversion exploits different types of geophysical data that often complement each other and aims to improve overall imaging resolution and reduce uncertainties in geophysical interpretation. Despite the advantages, traditional multiphysics inversion is challenging because it requires a large amount of computational time and intensive human interactions for preprocessing data and finding trade-off parameters. These issues make it nearly impossible for traditional multiphysics inversion to be applied as a real-time monitoring tool for geological carbon storage. In this paper, we present a deep learning (DL) multiphysics network for imaging CO 2 saturation in real time. The multiphysics network consists of three encoders for analysing seismic, electromagnetic and gravity data and shares one decoder for combining imaging capabilities of the different geophysical data for better predicting CO 2 saturation. The network is trained on pairs of CO 2 label models and multiphysics data so that it can directly image CO 2 saturation. Here we use the bootstrap aggregating method to enhance the imaging accuracy and estimate uncertainties associated with CO 2 saturation images. Using realistic CO 2 label models and multiphysics data derived from the Kimberlina CO 2 storage model, we evaluate the performance of the deep learning multiphysics network and compare its imaging results to those from the deep learning single-physics networks. Our modelling experiments show that the deep learning multiphysics network for seismic, electromagnetic, and gravity data not only improves the imaging accuracy but also reduces uncertainties associated with CO 2 saturation images. Our results also suggest that the deep learning multiphysics network for the non-seismic data (i.e., electromagnetic and gravity) can be used as an effective low-cost monitoring tool in between regular seismic monitoring.

58 GEOSCIENCES↗

Network succession reveals the importance of competition in response to emulsified vegetable oil amendment for uranium bioremediation: Competition in bioremediation system

When trying to discern network interactions among different species/populations in microbial communities interests have been evoked in recent years, but little information is available about temporal dynamics of microbial network interactions in response to environmental perturbations. We modified the random matrix theory-based network approach to discern network succession in groundwater microbial communities in response to emulsified vegetable oil (EVO) amendment for uranium bioremediation. Groundwater microbial communities from one control and seven monitor wells were analysed with a functional gene array (GeoChip 3.0), and functional molecular ecological networks (fMENs) at different time points were reconstructed. Our results showed that the network interactions were dramatically altered by EVO amendment. Dynamic and resilient succession was evident: fairly simple at the initial stage (Day 0), increasingly complex at the middle period (Days 4, 17, 31), most complex at Day 80, and then decreasingly complex at a later stage (140–269 days). Unlike previous studies in other habitats, negative interactions predominated in a time-series fMEN, suggesting strong competition among different microbial species in the groundwater systems after EVO injection. In particular, several keystone sulfate-reducing bacteria showed strong negative interactions with their network neighbours. These results provide mechanistic understanding of the decreased phylogenetic diversity during environmental perturbations.

59 BASIC BIOLOGICAL SCIENCES↗

Characterization of River Networks: A GIS Approach and Its Applications

Abstract Fluvial geomorphology provides the basis for characterizing complex river networks and evaluating biophysical processes within watersheds. Understanding the spatial organization of morphological features, their influencing processes, and resultant geomorphic diversity in stream networks are important for efficient restoration, river health assessment, and improving our knowledge of the resilience of riverine landscapes. River characterization is a means to determine the biophysical character of river networks but many methods are fraught with pitfalls, such as the use of incorrect variables and limited acknowledgment of the hierarchical organization of rivers. In this paper, a top‐down geographic information system‐based approach for determining the physical typology of river networks is outlined. A suite of multivariate analyses are used to develop a nomenclature for functional process zones (FPZs) — large tracts of the river network with similar hydro‐geomorphological character. Applied to the Little Miami River, Ohio, six distinct FPZs emerged, which had a nonuniform distribution along the river network. Some FPZs repeated downstream; others were rare in terms of total length and number of FPZ segments. The physical structure of the Little Miami River network was analyzed using a series of community metrics. Application of this approach for river monitoring, establishing reference conditions, as well as management of threatened and endangered species and asset trading is highlighted.

Thoms, Martin↗

Comprehensive framework for assessing and optimizing existing research networks

Conservation, monitoring, and research networks, or collections of ecological research sites unified under a common mission of data collection or a research mission, are essential infrastructure for understanding large landscapes. However, most networks developed opportunistically over decades rather than through systematic design, creating potential limitations in the ability to address conservation challenges across entire regions. We developed a framework to evaluate how well an existing research network represents the environmental conditions its members study and devised an approach to rank sites of priority for strategic expansion. Our approach measures performance through environmental representativeness, geographic coverage, and adequacy for scientific inference and thus optimizes limited monitoring resources to maximize scientific impact. We demonstrated this approach with the U.S. Department of Agriculture (USDA) Forest Service Experimental Forests and Ranges Network (EFRN), a 79‐site network across the United States that grew opportunistically over a century. At the national scale, the network effectively captured high‐biomass forests important for carbon cycle research; 82% of forest biomass was in well‐represented areas. Some areas in Texas, Florida, the Rocky Mountains, and the West Coast had no relevant EFRN sites, which limits the ability to make regional inferences. A fundamental challenge for the EFRN was that sites improving regional extent coverage sometimes provided minimal national benefits, which can create conflicts between local and global priorities. Adding the highest‐ranked candidate site provided a relevant site for 17% of currently poorly represented 1‐km pixel cells nationally, but regional and national site rankings varied considerably due to nested spatial inference. This framework provides quantitative tools for strategic infrastructure decision‐making, ensures that limited monitoring resources maximize conservation impact, and can be applied broadly to address the widespread challenge of optimizing conservation and monitoring networks worldwide.

additional site↗

Computer-aided detection using non-convolutional neural network Gaussian processes

Deep convolutional neural networks (CNNs) have in recent years achieved record-breaking performance on many image classification tasks and are therefore well-suited for computer aided detection (CAD). The need for uncertainty quantification for CAD motivates the need for a probabilistic framework for deep learning. The most well-known probabilistic neural network model is the Bayesian neural network (BNN), but BNNs are notoriously difficult to sample for large complex network architectures, and as such their use is restricted to small problems. It is known that the limit of BNNs as their widths increase toward infinity is a Gaussian process (GP), and there has been considerable research interest in these infinitely wide BNNs. Recently, this classic result has been extended to deep architectures in what is termed the neural network Gaussian process (NNGP) model. In this work, we implement an NNGP model and apply it to the ChestXRay14 dataset at the full resolution of 1024x1024 pixels. Even without any convolutional aspects to the network architecture and without any data augmentation, our five layer deep NNGP model outperforms other non-convolutional models and therefore helps to narrow the performance gap between non-convolutional and convolutional models. Our NNGP model is fully Bayesian and therefore offers uncertainty information through its predictive variance that can be used to formulate a predictive confidence measure. We show that the performance of the NNGP model is significantly boosted after low-confidence predictions are rejected, suggesting that convolution is most beneficial only for these low-confidence examples. Finally, our results indicate that an extremely large fully-connected neural network with appropriate regularization could perform as well as the NNGP if not for the computational bottleneck resulting from the large number of model parameters.

Agrawal, Devanshu↗

SuperNeurons: Dynamic GPU Memory Management for Training Deep Neural Networks

Going deeper and wider in neural architectures improves their accuracy, while the limited GPU DRAM places an undesired restriction on the network design domain. Deep Learning (DL) practitioners either need to change to less de- sired network architectures, or nontrivially dissect a network across multiGPUs. These distract DL practitioners from concentrating on their original machine learning tasks. We present SuperNeurons: a dynamic GPU memory scheduling runtime to enable the network training far beyond the GPU DRAM capacity. SuperNeurons features 3 memory optimizations, Liveness Analysis, Unified Tensor Pool, and Cost-Aware Recomputation; together they effectively reduce the network-wide peak memory usage down to the maximal memory usage among layers. We also address the performance issues in these memory-saving techniques. Given the limited GPU DRAM, SuperNeurons not only provisions the necessary memory for the training, but also dynamically allocates the memory for convolution workspaces to achieve the high performance. Evaluations against Caffe, Torch, MXNet and TensorFlow have demonstrated that SuperNeurons trains at least 3.2432 deeper network than current ones with the leading performance. Particularly, SuperNeurons can train ResNet2500 that has 104 basic network layers on a 12GB K40c.

Wang, Linnan↗

Optimizing Cluster Heads for Energy Efficiency in Large-Scale Heterogeneous Wireless Sensor Networks

Many complex sensor network applications require deploying a large number of inexpensive and small sensors in a vast geographical region to achieve quality through quantity. Hierarchical clustering is generally considered as an efficient and scalable way to facilitate the management and operation of such large-scale networks and minimize the total energy consumption for prolonged lifetime. Judicious selection of cluster heads for data integration and communication is critical to the success of applications based on hierarchical sensor networks organized as layered clusters. We investigate the problem of selecting sensor nodes in a predeployed sensor network to be the cluster heads to minimize the total energy needed for data gathering. We rigorously derive an analytical formula to optimize the number of cluster heads in sensor networks under uniform node distribution, and propose a Distance-based Crowdedness Clustering algorithm to determine the cluster heads in sensor networks under general node distribution. The results from an extensive set of experiments on a large number of simulated sensor networks illustrate the performance superiority of the proposed solution over the clustering schemes based on k -means algorithm.

Gu, Yi↗

Continuum Modeling and Control of Large Nonuniform Wireless Networks via Nonlinear Partial Differential Equations

We introduce a continuum modeling method to approximate a class of large wireless networks by nonlinear partial differential equations (PDEs). This method is based on the convergence of a sequence of underlying Markov chains of the network indexed by N , the number of nodes in the network. As N goes to infinity, the sequence converges to a continuum limit, which is the solution of a certain nonlinear PDE. We first describe PDE models for networks with uniformly located nodes and then generalize to networks with nonuniformly located, and possibly mobile, nodes. Based on the PDE models, we develop a method to control the transmissions in nonuniform networks so that the continuum limit is invariant under perturbations in node locations. This enables the networks to maintain stable global characteristics in the presence of varying node locations.

Zhang, Yang↗

Situational Awareness of Network System Roles (SANSR)

In a large enterprise it is difficult for cyber security analysts to know what services and roles every machine on the network is performing (e.g. file server, domain name server, email server). Understanding the roles of the systems in the network provides analysts with a situational awareness that will allow them to detect consequential changes in the network, initiate an incident response plan, and optimize their security posture. Using the network flow data, already collected by most enterprises, we developed a tool that enables analysts to automatically detect/classify services and roles of every machine that’s operating on a network (e.g. file server, domain name server, email server) for better situational awareness of potential threats to the network. his tool queries Elasticsearch for network flow data, creates a temporal behavior model of each system, uses unsupervised machine learning to cluster the models with a set of labeled temporal behavior models, and the resulting information can be printed to the console or programmatically accessed. The results include the likelihood that a machine has a labeled role and lists other machines that are most similar in behavior.

Huffer, KellyM.↗

Optical networking within the Lightwave Energy-Efficient Datacenter project [Invited]

The Lightwave Energy-Efficient Datacenter (LEED) project within the ARPA-e ENLITENED program is developing novel energy-efficient multichannel lightwave networks. These networks are enabled by a new optical “rotor” switch that can reconfigure the network topology in less than 20 µs and a field-programmable-gate-array-based network interface controller called Corundum that can provide precise network-wide synchronization of packets admitted into the lightwave network. Here we review the optical networking research within LEED and discuss future directions.

Mellette, William M.↗

Network inference reveals novel connections in pathways regulating growth and defense in the yeast salt response

Cells respond to stressful conditions by coordinating a complex, multi-faceted response that spans many levels of physiology. Much of the response is coordinated by changes in protein phosphorylation. Although the regulators of transcriptome changes during stress are well characterized in Saccharomyces cerevisiae , the upstream regulatory network controlling protein phosphorylation is less well dissected. Here, we developed a computational approach to infer the signaling network that regulates phosphorylation changes in response to salt stress. We developed an approach to link predicted regulators to groups of likely co-regulated phospho-peptides responding to stress, thereby creating new edges in a background protein interaction network. We then use integer linear programming (ILP) to integrate wild type and mutant phospho-proteomic data and predict the network controlling stress-activated phospho-proteomic changes. The network we inferred predicted new regulatory connections between stress-activated and growth-regulating pathways and suggested mechanisms coordinating metabolism, cell-cycle progression, and growth during stress. We confirmed several network predictions with co-immunoprecipitations coupled with mass-spectrometry protein identification and mutant phospho-proteomic analysis. Results show that the cAMP-phosphodiesterase Pde2 physically interacts with many stress-regulated transcription factors targeted by PKA, and that reduced phosphorylation of those factors during stress requires the Rck2 kinase that we show physically interacts with Pde2. Conclusively, our work shows how a high-quality computational network model can facilitate discovery of new pathway interactions during osmotic stress.

59 BASIC BIOLOGICAL SCIENCES↗

Optimizing Topological Cascade Resilience Based on the Structure of Terrorist Networks

Complex socioeconomic networks such as information, finance and even terrorist networks need resilience to cascades - to prevent the failure of a single node from causing a far-reaching domino effect. We show that terrorist and guerrilla networks are uniquely cascade-resilient while maintaining high efficiency, but they become more vulnerable beyond a certain threshold. We also introduce an optimization method for constructing networks with high passive cascade resilience. The optimal networks are found to be based on cells, where each cell has a star topology. Counterintuitively, we find that there are conditions where networks should not be modified to stop cascades because doing so would come at a disproportionate loss of efficiency. Implementation of these findings can lead to more cascade-resilient networks in many diverse areas.

97 MATHEMATICS AND COMPUTING↗

Connecting Network Properties of Rapidly Disseminating Epizoonotics

Background: To effectively control the geographical dissemination of infectious diseases, their properties need to be determined. To test that rapid microbial dispersal requires not only susceptible hosts but also a pre-existing, connecting network, we explored constructs meant to reveal the network properties associated with disease spread, which included the road structure. Methods: Using geo-temporal data collected from epizoonotics in which all hosts were susceptible (mammals infected by Foot-and-mouth disease virus, Uruguay, 2001; birds infected by Avian Influenza virus H5N1, Nigeria, 2006), two models were compared: 1) ‘connectivity’, a model that integrated bio-physical concepts (the agent’s transmission cycle, road topology) into indicators designed to measure networks (‘nodes’ or infected sites with short- and long-range links), and 2) ‘contacts’, which focused on infected individuals but did not assess connectivity. Results: The connectivity model showed five network properties: 1) spatial aggregation of cases (disease clusters), 2) links among similar ‘nodes’ (assortativity), 3) simultaneous activation of similar nodes (synchronicity), 4) disease flows moving from highly to poorly connected nodes (directionality), and 5) a few nodes accounting for most cases (a ‘‘20:800 pattern). In both epizoonotics, 1) not all primary cases were connected but at least one primary case was connected, 2) highly connected, small areas (nodes) accounted for most cases, 3) several classes of nodes were distinguished, and 4) the contact model, which assumed all primary cases were identical, captured half the number of cases identified by the connectivity model. When assessed together, the synchronicity and directionality properties explained when and where an infectious disease spreads. Conclusions: Geo-temporal constructs of Network Theory’s nodes and links were retrospectively validated in rapidly disseminating infectious diseases. They distinguished classes of cases, nodes, and networks, generating information usable to revise theory and optimize control measures. Prospective studies that consider pre-outbreak predictors, such as connecting networks, are recommended.

59 BASIC BIOLOGICAL SCIENCES↗

Integrated network design and scheduling problems :

We consider the class of integrated network design and scheduling problems. These problems focus on selecting and scheduling operations that will change the characteristics of a network, while being speci cally concerned with the performance of the network over time. Motivating applications of INDS problems include infrastructure restoration after extreme events and building humanitarian distribution supply chains. While similar models have been proposed, no one has performed an extensive review of INDS problems from their complexity, network and scheduling characteristics, information, and solution methods. We examine INDS problems under a parallel identical machine scheduling environment where the performance of the network is evaluated by solving classic network optimization problems. We classify that all considered INDS problems as NP-Hard and propose a novel heuristic dispatching rule algorithm that selects and schedules sets of arcs based on their interactions in the network. We present computational analysis based on realistic data sets representing the infrastructures of coastal New Hanover County, North Carolina, lower Manhattan, New York, and a realistic arti cial community CLARC County. These tests demonstrate the importance of a dispatching rule to arrive at near-optimal solutions during real-time decision making activities. We extend INDS problems to incorporate release dates which represent the earliest an operation can be performed and exible release dates through the introduction of specialized machine(s) that can perform work to move the release date earlier in time. An online optimization setting is explored where the release date of a component is not known.

Nurre, Sarah G.↗

Final Report. Analysis and Reduction of Complex Networks Under Uncertainty

The project was a collaborative effort among MIT, Sandia National Laboratories (local PI Dr. Habib Najm), the University of Southern California (local PI Prof. Roger Ghanem), and The Johns Hopkins University (local PI Prof. Omar Knio, now at Duke University). Our focus was the analysis and reduction of large-scale dynamical systems emerging from networks of interacting components. Such networks underlie myriad natural and engineered systems. Examples important to DOE include chemical models of energy conversion processes, and elements of national infrastructure—e.g., electric power grids. Time scales in chemical systems span orders of magnitude, while infrastructure networks feature both local and long-distance connectivity, with associated clusters of time scales. These systems also blend continuous and discrete behavior; examples include saturation phenomena in surface chemistry and catalysis, and switching in electrical networks. Reducing size and stiffness is essential to tractable and predictive simulation of these systems. Computational singular perturbation (CSP) has been effectively used to identify and decouple dynamics at disparate time scales in chemical systems, allowing reduction of model complexity and stiffness. In realistic settings, however, model reduction must contend with uncertainties, which are often greatest in large-scale systems most in need of reduction. Uncertainty is not limited to parameters; one must also address structural uncertainties—e.g., whether a link is present in a network—and the impact of random perturbations, e.g., fluctuating loads or sources. Research under this project developed new methods for the analysis and reduction of complex multiscale networks under uncertainty, by combining computational singular perturbation (CSP) with probabilistic uncertainty quantification. CSP yields asymptotic approximations of reduceddimensionality “slow manifolds” on which a multiscale dynamical system evolves. Introducing uncertainty in this context raised fundamentally new issues, e.g., how is the topology of slow manifolds transformed by parametric uncertainty? How to construct dynamical models on these uncertain manifolds? To address these questions, we used stochastic spectral polynomial chaos (PC) methods to reformulate uncertain network models and analyzed them using CSP in probabilistic terms. Finding uncertain manifolds involved the solution of stochastic eigenvalue problems, facilitated by projection onto PC bases. These problems motivated us to explore the spectral properties stochastic Galerkin systems. We also introduced novel methods for rank-reduction in stochastic eigensystems—transformations of a uncertain dynamical system that lead to lower storage and solution complexity. These technical accomplishments are detailed below. This report focuses on the MIT portion of the joint project.

97 MATHEMATICS AND COMPUTING↗

Path Network Recovery Using Remote Sensing Data and Geospatial-Temporal Semantic Graphs

Remote sensing systems produce large volumes of high-resolution images that are difficult to search. The GeoGraphy (pronounced Geo-Graph-y) framework [2, 20] encodes remote sensing imagery into a geospatial-temporal semantic graph representation to enable high level semantic searches to be performed. Typically scene objects such as buildings and trees tend to be shaped like blocks with few holes, but other shapes generated from path networks tend to have a large number of holes and can span a large geographic region due to their connectedness. For example, we have a dataset covering the city of Philadelphia in which there is a single road network node spanning a 6 mile x 8 mile region. Even a simple question such as "find two houses near the same street" might give unexpected results. More generally, nodes arising from networks of paths (roads, sidewalks, trails, etc.) require additional processing to make them useful for searches in GeoGraphy. We have assigned the term Path Network Recovery to this process. Path Network Recovery is a three-step process involving (1) partitioning the network node into segments, (2) repairing broken path segments interrupted by occlusions or sensor noise, and (3) adding path-aware search semantics into GeoQuestions. This report covers the path network recovery process, how it is used, and some example use cases of the current capabilities.

47 OTHER INSTRUMENTATION↗

Networked Microgrids Scoping Study

Much like individual microgrids, the range of opportunities and potential architectures of networked microgrids is very diverse. The goals of this scoping study are to provide an early assessment of research and development needs by examining the benefits of, risks created by, and risks to networked microgrids. At this time there are very few, if any, examples of deployed microgrid networks. In addition, there are very few tools to simulate or otherwise analyze the behavior of networked microgrids. In this setting, it is very difficult to evaluate networked microgrids systematically or quantitatively. At this early stage, this study is relying on inputs, estimations, and literature reviews by subject matter experts who are engaged in individual microgrid research and development projects, i.e., the authors of this study The initial step of the study gathered input about the potential opportunities provided by networked microgrids from these subject matter experts. These opportunities were divided between the subject matter experts for further review. Part 2 of this study is comprised of these reviews. Part 1 of this study is a summary of the benefits and risks identified in the reviews in Part 2 and synthesis of the research needs required to enable networked microgrids.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

High Fidelity Simulations of Large-Scale Wireless Networks (Part I)

Wireless systems and networks have experienced rapid growth over the last decade with the advent of smart devices for everyday use. These systems, which include smartphones, vehicular gadgets, and internet-of-things devices, are becoming ubiquitous and ever-more important. They pose interesting research challenges for design and analysis of new network protocols due to their large scale and complexity. In this work, we focus on the challenging aspect of simulating the inter-connectivity of many of these devices in wireless networks. The quantitative study of large scale wireless networks, with counts of wireless devices in the thousands, is a very difficult problem with no known acceptable solution. By necessity, simulations of this scale have to approximate reality, but the algorithms employed in most modern-day network simulators can be improved for wireless network simulations. In this report, we present advances that we have made and propositions for continuation of progress towards a framework for high fidelity simulations of wireless networks. This work is not complete in that a final simulation framework tool is yet to be produced. However, we highlight the major bottlenecks and address them individually with initial results showing enough promise.

42 ENGINEERING↗