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 973 records · Page 54

Deforestation decreases spatial turnover and alters the network interactions in soil bacterial communities

Despite important progress in understanding the influence of deforestation on the bacterial α diversity and community structure at local scales, little is known about deforestation impacts in terms of spatial turnover and soil bacterial community network interactions, especially at regional or global scales. In this study, to address this research gap, we examined the bacterial spatial turnover rate and the species networks in paired primary and secondary forest soils along a 3700-km north-south transect in eastern China using high-throughput 16S rRNA gene sequencing. The spatial turnover rate of bacterial communities was higher in primary forests than in secondary, suggesting deforestation increased biotic homogenization at a large geographic scale. Multiple regression on matrices analysis revealed that both geographic distance and soil properties (especially soil pH and organic matter availability) strongly affected bacterial spatial turnover. Through the phylogenetic molecular ecological network approach, we demonstrate that the bacterial network of primary forests was more intricate than in secondary forests. This suggests that microbial species have greater niche-sharing and more interactions in primary forests as compared to secondary forests. On the other hand, the bacterial network in secondary forests was more modular, and the taxa tended to co-occur, with positive correlations accounting for 82% of all potential interactions. Lastly, our findings demonstrate that anthropogenic deforestation has clear effects on bacterial spatial turnover and network interactions, with potential for serious consequences such as microbial diversity loss in primary forests.

59 BASIC BIOLOGICAL SCIENCES↗

Optimizing lane reversals in transportation networks to reduce traffic congestion: A global optimization approach

This paper studies how to reduce the overall travel time of commuters in a transportation network by reversing the direction of some lanes in the network using a macroscopic network-wide perspective. Similar to the Network Design Problem, the lane reversal problem has been shown to be NP-hard given the dependence of the users’ route selection on the lane direction decision. Herein, we propose and compare three efficient methods to solve the routing and lane reversal problem jointly. First, we introduce an alternating method that decouples the routing and lane assignment problems. Second, we propose a Frank–Wolfe method that jointly takes gradient steps to adjust both the lane assignment and routing decisions. Third, we propose a convex approximation method that uses a threshold-based approach to convexify the joint routing and lane reversal objective. The convex approximation method is advantageous since it finds a global optimum solution for the approximated problem and it enables the possibility to include linear constraints. Using this method, we extend the main formulation to be able to limit a maximum number of reversed lanes, as well as to incorporate multiple origin–destination (OD) patterns. We test the proposed methods in a case study using the transportation network of Eastern Massachusetts where our results indicate an overall reduction in travel times of 4.7% by selecting the best 15 reversals. Moreover, using a small test network, we investigate the performance of the lane reversal strategies as a function of the OD demand symmetry. As expected, we observe that when the OD demand is very asymmetric (e.g., for a single OD pair, evacuations, large events), the reduction in travel times is larger than the symmetric case, reaching travel time reductions of 60%.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Chemiomics: Network Reconstruction and Kinetics of Port Wine Aging

Network reconstruction (NR) has proven to be useful in the detection and visualization of relationships among the compounds present in a Port wine aging data set. This view of the data provides a considerable amount of information with which to understand the kinetic contexts of the molecules represented by peaks in each chromatogram. The aim of this paper was to use NR together with the determination of kinetic parameters to extract more information about the mechanisms involved in Port wine aging. The volatile compounds present in samples of Port wines spanning 128 years in age were measured with the use of GC-MS. After chromatogram alignment, a peak matrix was created, and all peak vectors were compared to one another to determine their Pearson correlations over time. A correlation network was created and filtered on the basis of the resulting correlation values. Some nodes in the network were further studied in experiments on Port wines stored under different conditions of oxygen and temperature in order to determine their kinetic parameters. The resulting network can be divided into three main branches. The first branch is related to compounds that do not directly correlate to age, the second branch contains compounds affected by temperature, and the third branch contains compounds associated with oxygen. Compounds clustered in the same branch of the network have similar expression patterns over time as well as the same kinetic order, thus are likely to be dependent on the same technological parameters. Network construction and visualization provides more information with which to understand the probable kinetic contexts of the molecules represented by peaks in each chromatogram. Finally, the approach described here is a powerful tool for the study of mechanisms and kinetics in complex systems and should aid in the understanding and monitoring of wine quality.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Biologically-informed excitatory and inhibitory ratio for robust spiking neural network training

Spiking neural networks drawing inspiration from biological constraints of the brain promise an energy-efficient paradigm for artificial intelligence. However, challenges exist in identifying guiding principles to train these networks in a robust fashion. In addition, training becomes an even more difficult problem when incorporating biological constraints of excitatory and inhibitory connections. In this work, we identify several key factors, such as low initial firing rates and diverse inhibitory spiking patterns, that determine the overall ability to train in the context of spiking networks with various ratios of excitatory to inhibitory neurons. The results indicate networks with biologically-realistic excitatory:inhibitory ratios can reliably train at low activity levels and in noisy environments. Additionally, the Van Rossum distance, a measure of spike train synchrony, provides insight into the importance of inhibitory neurons to increase network robustness to noise. This work supports further biologically-informed large-scale networks and energy efficient hardware implementations.

bio-inspired computing↗

Active learning of chemical reaction networks via probabilistic graphical models and Boolean reaction circuits

Discerning networks of many reactions among multiple interconverting species is challenging. Here, we present a reaction network identification methodology. Our methodology enumerates all stoichiometrically and chemically feasible reactions and requires statistical evidence from effluent concentrations for the inclusion or exclusion of each from the reaction network, contrasting with the commonly seen incremental approach and other work of relying heavily upon chemical intuition and assuming the reactions occurring. Using graph theory alongside an active learning design of experiments that propose maximally informative feeds, we identify the underlying reaction network with minimal laboratory runs. Here, we introduce chemistry-probabilistic graphical modeling and Boolean reaction circuits to statistically quantify which reactions occur from effluent concentrations. Our methodology accurately discerns active reactions, as showcased upon a laboratory network of cross-ketonization of furoic and lauric acid and validated upon simulated networks of thermal and CO 2 -assisted ethane dehydrogenation.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Prediction of Weld Penetration in FCAW of HSLA steel using Artificial Neural Networks

Flux-cored arc welding (FCAW) is a semiautomatic or automatic arc welding process that requires a continuously-fed consumable tubular electrode containing a flux. The main FCAW process parameters affecting the depth of penetration are welding current, arc voltage, nozzle-to-work distance, torch angle and welding speed. Shallow depth of penetration may contribute to failure of a welded structure since penetration determines the stress-carrying capacity of a welded joint. To avoid such occurrences; the welding process parameters influencing the weld penetration must be properly selected to obtain an acceptable weld penetration and hence a high quality joint. Artificial neural networks (ANN), also called neural networks (NN), are computational models used to express complex non-linear relationships between input and output data. In this paper, artificial neural network (ANN) method is used to predict the effects of welding current, arc voltage, nozzle-to-work distance, torch angle and welding speed on weld penetration depth in gas shielded FCAW of a grade of high strength low alloy steel. 32 experimental runs were carried out using the bead-on-plate welding technique. Weld penetrations were measured and on the basis of these 32 sets of experimental data, a feed-forward back-propagation neural network was created. 28 sets of the experiments were used as the training data and the remaining 4 sets were used for the testing phase of the network. The ANN has one hidden layer with eight neurons and is trained after 840 iterations. The comparison between the experimental results and ANN results showed that the trained network could predict the effects of the FCAW process parameters on weld penetration adequately.

36 MATERIALS SCIENCE↗

Implementing controlled-unitary operations over the butterfly network

We introduce a multiparty quantum computation task over a network in a situation where the capacities of both the quantum and classical communication channels of the network are limited and a bottleneck occurs. Using a resource setting introduced by Hayashi [1], we present an efficient protocol for performing controlled-unitary operations between two input nodes and two output nodes over the butterfly network, one of the most fundamental networks exhibiting the bottleneck problem. This result opens the possibility of developing a theory of quantum network coding for multiparty quantum computation, whereas the conventional network coding only treats multiparty quantum communication.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A mixed-scale dense convolutional neural network for image analysis

Significance Popular neural networks for image-processing problems often contain many different operations, multiple layers of connections, and a large number of trainable parameters, often exceeding several million. They are typically tailored to specific applications, making it difficult to apply a network that is successful in one application to different applications. Here, we introduce a neural network architecture that is less complex than existing networks, is easy to train, and achieves accurate results with relatively few trainable parameters. The network automatically adapts to a specific problem, allowing the same network to be applied to a wide variety of different problems.

97 MATHEMATICS AND COMPUTING↗

Distribution of centrality measures on undirected random networks via the cavity method

The Katz centrality of a node in a complex network is a measure of the node’s importance as far as the flow of information across the network is concerned. For ensembles of locally tree-like undirected random graphs, this observable is a random variable. Its full probability distribution is of interest but difficult to handle analytically because of its “global” character and its definition in terms of a matrix inverse. Leveraging a fast Gaussian Belief Propagation-Cavity algorithm to solve linear systems on tree-like structures, we show that i) the Katz centrality of a single instance can be computed recursively in a very fast way, and ii) the probability P ( K ) that a random node in the ensemble of undirected random graphs has centrality K satisfies a set of recursive distributional equations, which can be analytically characterized and efficiently solved using a population dynamics algorithm. We test our solution on ensembles of Erdős-Rényi and Scale Free networks in the locally tree-like regime, with excellent agreement. The analytical distribution of centrality for the configuration model conditioned on the degree of each node can be employed as a benchmark to identify nodes of empirical networks with over- and underexpressed centrality relative to a null baseline. We also provide an approximate formula based on a rank- 1 projection that works well if the network is not too sparse, and we argue that an extension of our method could be efficiently extended to tackle analytical distributions of other centrality measures such as PageRank for directed networks in a transparent and user-friendly way.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum walks on complex networks with connection instabilities and community structure

A continuous-time quantum walk is investigated on complex networks with the characteristic property of community structure, which is shared by most real-world networks. Motivated by the prospect of viable quantum networks, I focus on the effects of network instabilities in the form of broken links, and examine the response of the quantum walk to such failures. It is shown that the reconfiguration of the quantum walk is determined by the community structure of the network. In this context, quantum walks based on the adjacency and Laplacian matrices of the network are compared, and their responses to link failures is analyzed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

q-state Potts-glass neural network based on pseudoinverse rule

We study the q-state Potts-glass neural network with the pseudoinverse (PI) rule. Its performance is investigated and compared with that of the counterpart network with the Hebbian rule instead. We find that there exists a critical point of q, i.e., q{sub cr}=14, below which the storage capacity and the retrieval quality can be greatly improved by introducing the PI rule. We show that the dynamics of the neural networks constructed with the two learning rules respectively are quite different; but however, regardless of the learning rules, in the q-state Potts-glass neural networks with q{>=}3 there is a common novel dynamical phase in which the spurious memories are completely suppressed. This property has never been noticed in the symmetric feedback neural networks. Free from the spurious memories implies that the multistate Potts-glass neural networks would not be trapped in the metastable states, which is a favorable property for their applications.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Neural network–based pore flow field prediction in porous media using super resolution

Direct pore-scale simulations of fluid flow through porous media are computationally expensive to perform for realistic systems. Previous works have demonstrated using the geometry of the microstructure of porous media to predict the velocity fields therein based on neural networks. However, such trained neural networks do not perform well for unseen porous media with a large degree of heterogeneity. In this study we propose that incorporating a coarse velocity field in the input of neural networks is an effective way to improve the prediction performance. The coarse velocity field can be simulated with a low computational cost and provides global information to regularize the ill-posedness of the learning problem, which is usually caused by the use of local geometries due to the computational resource constraints. We show that incorporating the coarse-mesh velocity field significantly improves the prediction accuracy of the fine-mesh velocity field by comparison to the prediction that relies on geometric information alone, especially for the porous medium with a large interior vuggy pore space. We also show the flexibility of training the network in using coarse velocity fields with various resolutions. The results suggest that even using coarse velocity field with a very low resolution, the predictions are still enhanced and close to the ground truths. The feasibility of the method is further demonstrated by testing the trained network on real rocks. This study highlights the merits of incorporating a coarse-mesh velocity field into the input for neural networks, which provides global, physics-based information for the model, thereby improving the model's generalization capability.

42 ENGINEERING↗

Local rules for fabricating allosteric networks

Mechanical properties of disordered networks can be significantly tailored by modifying a small fraction of their bonds. This procedure has been used to design and build mechanical metamaterials with a variety of responses. A long-range “allosteric” response, where a localized input strain at one site gives rise to a localized output strain at a distant site, has been of particular interest. This work presents an approach to incorporating allosteric responses in experimental systems by pruning disordered networks in situ. Previous work has relied on computer simulations to design and predict the response of such systems using a cost function where the response of the entire network to each bond removal is used at each step to determine which bond to prune. It is not feasible to follow such a design protocol in experiments where one has access only to local response at each site. This paper presents design algorithms that allow determination of what bonds to prune based purely on the local forces in the network without employing a cost function; using only local information, allosteric networks are designed in simulations and then built out of real materials. The results show that some pruning strategies work better than others when translated into an experimental system. A method is presented to measure local stresses experimentally in disordered networks. This approach is then used to implement pruning methods to design desired responses in situ. Results from these experiments confirm that the pruning methods are robust and work in a real laboratory material.

36 MATERIALS SCIENCE↗

SHARP-Net: Platform for Self-Healing and Attack Resilient PMU Networks

Synchrophasor technology plays a pivotal role in developing the next generation of wide-area monitoring, protection, and control in the smart grid environment. As technology and communications infrastructures evolve, however, so do the attack surfaces in the synchrophasor network that can be exploited by advanced persistent threat (APT) actors to affect power system stability and reliability. In this paper, we propose a novel platform for developing a self-healing and attack-resilient PMU network (SHARP-Net) by instituting a state-of-the-art intrusion detection system (IDS) with an intrusion mitigation system (IMS) and an alert management system (AMS). In particular, the proposed platform detects anomalies during cyberattacks on phasor data concentrators (PDCs) based on the rules defined in the IDS, then the generated alerts are published to the IMS through the AMS. The proposed IMS proceeds to take automated corrective responses to mitigate cyberattacks by reconfiguring the synchrophasor network to isolate the compromised PDCs, and it orchestrates new PDCs to prevent the future propagation of attacks. Further, the IMS restores the system's observability by reconnecting the new PDCs to make the grid attack-resilient. In this work, the SHARP-Net platform is developed by using Python-based libraries, minimega's software-defined network, and virtual machine orchestration. We implement and validate the proposed SHARP-Net architecture by testing a PMU network in the smart grid environment. SHARP-Net showed promising performance in detecting cyberattacks and mitigating them through the network reconfiguration.

computer architecture↗

Social Sensor Analytics: Making Sense of Network Models in Social Media

Social networks can be thought of as noisy sensor networks mapping real world information to the web. Owing to the extensive body of literature in sensor network analysis, this work sought to apply several novel and traditional methods in sensor network analysis for the purposes of efficiently interrogating social media data streams from raw data. We carefully revisit our definition of a social media signal from previous work both in terms of time-varying features within the data and the networked nature of the medium. Further, we detail our analysis of global patterns in Twitter over the months of November 2013 and June 2014, detect and categorize events, and illustrate how these analyses can be used to inform graph-based models of Twitter, namely using a recent network influence model called PhySense: similar to PageRank but tuned to behavioral analysis by leveraging a sociologically inspired probabilistic model. We ultimately identify forms of information dissemination via analysis of time series and dynamic graph spectra and corroborate these findings through manual investigation of the data as a requisite step in modeling the diffusion process with PhySense. We hope to sufficiently characterize global behavior in a medium such as Twitter as a means of learning global model parameters one may use to predict or simulate behavior on a large scale. We have made our time series and dynamic graph analytical code available via a GitHub repository https://github.com/cpatdowling/salsa and our data are available upon request.

event detection↗

Performance of a Dynamically Controlled Inverter in a Photovoltaic System Interconnected with a Secondary Network Distribution System

In 2008, a 300 kW{sub peak} photovoltaic (PV) system was installed on the rooftop of the Colorado Convention Center (CCC). The installation was unique for the electric utility, Xcel Energy, as it had not previously permitted a PV system to be interconnected on a building served by the local secondary network distribution system (network). The PV system was installed with several provisions; one to prevent reverse power flow, another called a dynamically controlled inverter (DCI), that curtails the output of the PV inverters to maintain an amount of load supplied by Xcel Energy at the CCC. The DCI system utilizes current transformers (CTs) to sense power flow to insure that a minimum threshold is maintained from Xcel Energy through the network transformers. The inverters are set to track the load on each of the three phases and curtail power from the PV system when the generated PV system current reaches 95% of the current on any phase. This is achieved by the DCI, which gathers inputs from current transformers measuring the current from the PV array, Xcel, and the spot network load. Preventing reverse power flow is a critical technical requirement for the spot network which serve this part of the CCC. The PV system was designed with the expectation that the DCI system would not curtail the PV system, as the expected minimum load consumption was historically higher than the designed PV system size. However, the DCI system has operated many days during the course of a year, and the performance has been excellent. The DCI system at the CCC was installed as a secondary measure to insure that a minimum level of power flows to the CCC from the Xcel Energy network. While this DCI system was intended for localized control, the system could also reduce output percent if an external smart grid control signal was employed. This paper specifically focuses on the performance of the innovative design at this installation; however, the DCI system could also be used for new s- art grid-enabled distribution systems where renewables power contributions at certain conditions or times may need to be curtailed.

14 SOLAR ENERGY↗

Losing Control of Your Linear Network? Try Resilience Theory

Resilience of cyber-physical networks to unexpected failures is a critical need widely recognized across domains. For instance, power grids, telecommunication networks, transportation infrastructures, and water treatment systems have all been subject to disruptive malfunctions and catastrophic cyberattacks. Following such adverse events, we investigate scenarios where a node of a linear network suffers a loss of control authority over some of its actuators. These actuators are not following the controller's commands and are instead producing undesirable outputs. The repercussions of such a loss of control can propagate and destabilize the whole network despite the malfunction occurring at a single node. To assess system vulnerability, we establish resilience conditions for networks with a subsystem enduring a loss of control authority over some of its actuators. Furthermore, we quantify the destabilizing impact on the overall network when such a malfunction perturbs a nonresilient subsystem. We illustrate our resilience conditions on two academic examples, on an islanded microgrid and on the linearized IEEE 39-bus system.

97 MATHEMATICS AND COMPUTING↗

Autonomic Intelligent Cyber Sensor to Support Industrial Control Network Awareness

The proliferation of digital devices in a networked industrial ecosystem, along with an exponential growth in complexity and scope, has resulted in elevated security concerns and management complexity issues. This paper describes a novel architecture utilizing concepts of Autonomic computing and a SOAP based IF-MAP external communication layer to create a network security sensor. This approach simplifies integration of legacy software and supports a secure, scalable, self-managed framework. The contribution of this paper is two-fold: 1) A flexible two level communication layer based on Autonomic computing and Service Oriented Architecture is detailed and 2) Three complementary modules that dynamically reconfigure in response to a changing environment are presented. One module utilizes clustering and fuzzy logic to monitor traffic for abnormal behavior. Another module passively monitors network traffic and deploys deceptive virtual network hosts. These components of the sensor system were implemented in C++ and PERL and utilize a common internal D-Bus communication mechanism. A proof of concept prototype was deployed on a mixed-use test network showing the possible real world applicability. In testing, 45 of the 46 network attached devices were recognized and 10 of the 12 emulated devices were created with specific Operating System and port configurations. Additionally the anomaly detection algorithm achieved a 99.9% recognition rate. All output from the modules were correctly distributed using the common communication structure.

97 MATHEMATICS AND COMPUTING↗