Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Network analysis”

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 253 records · Page 14

Characterization and Analysis of Networked Array of Sensors for Event Detection (CANARY-EDS)

CANARY -EDS provides probabilistic event detection based on analysis of time-series data from water quality or other sensors. CANARY also can compare patterns against a library of previously seen data to indicate that a certain pattern has reoccurred, suppressing what would otherwise be considered an event. CANARY can be configured to analyze previously recorded data from files or databases, or it can be configured to run in real-time mode directory from a database, or through the US EPA EDDIES software.

Source record↗

Characterization and Analysis of Networked Array of Sensors for Event Detection (CANARY-EDS)

CANARY -EDS provides probabilistic event detection based on analysis of time-series data from water quality or other sensors. CANARY also can compare patterns against a library of previously seen data to indicate that a certain pattern has reoccurred, suppressing what would otherwise be considered an event. CANARY can be configured to analyze previously recorded data from files or databases, or it can be configured to run in real-time mode directory from a database, or through the US EPA EDDIES software.

Source record↗

Sampling graphs with a prescribed joint degree distribution using Markov Chains.

One of the most influential results in network analysis is that many natural networks exhibit a power-law or log-normal degree distribution. This has inspired numerous generative models that match this property. However, more recent work has shown that while these generative models do have the right degree distribution, they are not good models for real life networks due to their differences on other important metrics like conductance. We believe this is, in part, because many of these real-world networks have very different joint degree distributions, i.e. the probability that a randomly selected edge will be between nodes of degree k and l. Assortativity is a sufficient statistic of the joint degree distribution, and it has been previously noted that social networks tend to be assortative, while biological and technological networks tend to be disassortative. We suggest that the joint degree distribution of graphs is an interesting avenue of study for further research into network structure. We provide a simple greedy algorithm for constructing simple graphs from a given joint degree distribution, and a Monte Carlo Markov Chain method for sampling them. We also show that the state space of simple graphs with a fixed degree distribution is connected via endpoint switches. We empirically evaluate the mixing time of this Markov Chain by using experiments based on the autocorrelation of each edge.

99 GENERAL AND MISCELLANEOUS↗

Constructing and sampling graphs with a given joint degree distribution.

One of the most influential recent results in network analysis is that many natural networks exhibit a power-law or log-normal degree distribution. This has inspired numerous generative models that match this property. However, more recent work has shown that while these generative models do have the right degree distribution, they are not good models for real life networks due to their differences on other important metrics like conductance. We believe this is, in part, because many of these real-world networks have very different joint degree distributions, i.e. the probability that a randomly selected edge will be between nodes of degree k and l. Assortativity is a sufficient statistic of the joint degree distribution, and it has been previously noted that social networks tend to be assortative, while biological and technological networks tend to be disassortative. We suggest understanding the relationship between network structure and the joint degree distribution of graphs is an interesting avenue of further research. An important tool for such studies are algorithms that can generate random instances of graphs with the same joint degree distribution. This is the main topic of this paper and we study the problem from both a theoretical and practical perspective. We provide an algorithm for constructing simple graphs from a given joint degree distribution, and a Monte Carlo Markov Chain method for sampling them. We also show that the state space of simple graphs with a fixed degree distribution is connected via end point switches. We empirically evaluate the mixing time of this Markov Chain by using experiments based on the autocorrelation of each edge. These experiments show that our Markov Chain mixes quickly on real graphs, allowing for utilization of our techniques in practice.

99 GENERAL AND MISCELLANEOUS↗

Analysis of Network Address Shuffling as a Moving Target Defense

Address shuffling is a type of moving target defense that prevents an attacker from reliably contacting a system by periodically remapping network addresses. Although limited testing has demonstrated it to be effective, little research has been conducted to examine the theoretical limits of address shuffling. As a result, it is difficult to understand how effective shuffling is and under what circumstances it is a viable moving target defense. This paper introduces probabilistic models that can provide insight into the performance of address shuffling. These models quantify the probability of attacker success in terms of network size, quantity of addresses scanned, quantity of vulnerable systems, and the frequency of shuffling. Theoretical analysis will show that shuffling is an acceptable defense if there is a small population of vulnerable systems within a large network address space, however shuffling has a cost for legitimate users. These results will also be shown empirically using simulation and actual traffic traces.

Carroll, Thomas E.↗

From systems biology to photosynthesis and whole-plant modeling: a conceptual model for integrating multi-scale networks

Network analysis is now a common statistical tool for molecular biologists. Network algorithms are readily used to model gene, protein and metabolic correlations providing insight into pathways driving biological phenomenon. One output from such an analysis is a candidate gene list that can be responsible, in part, for the biological process of interest. The question remains, however, as to whether molecular network analysis can be used to inform process models at higher levels of biological organization. In our previous work, transcriptional networks derived from three plant species were constructed, interrogated for orthology and then correlated to photosynthetic inhibition at elevated temperature. One unique aspect of that study was the link from co-expression networks to net photosynthesis. In this addendum, we propose a conceptual model where traditional network analysis can be linked to whole-plant models thereby informing predictions on key processes such as photosynthesis, nutrient uptake and assimilation, and C partitioning.

59 BASIC BIOLOGICAL SCIENCES↗

Techno-economic analysis and network design for CO 2 conversion to jet fuels in the United States

The conversion of carbon dioxide (CO 2 ) into jet fuel holds significant potential for reducing CO 2 emissions, providing an alternative to carbon-based resources, and offering a renewable means of energy storage. The objective of this study is to conduct a techno-economic analysis and optimize the supply chain network for converting CO 2 to jet fuel in the United States, aiming to minimize total costs while assessing the environmental and economic feasibility of two CO 2 conversion pathways. This first pathway is based on Fischer-Tropsch synthesis (FTS), and the other one is based on the valorization and upgrading of light methanol (MeOH). Incorporating spatial and techno-economic data, a mixed-integer linear programming model was developed to select source plants and conversion pathways, locations of conversion refinery sites, and the amount of captured CO 2 across the United States. The optimal results indicate that the FTS pathway is adopted at all selected refineries when the hydrogen price is 1000 dollars/t and the operating cost, mainly electricity used in conversion, is reduced to 5 % of its current level. Under this scenario, the total annual profit is 8 billion dollars, and the net carbon emissions are -88,783,284 tons. The sensitivity analyses reveal that the prices of electricity and hydrogen significantly contribute to total production costs. The CO 2 recycle percentage of the FTS pathway influences the choice of applied pathways at refineries. Additionally, a higher conversion rate holds a substantial promise for reducing the total production cost and can make the MeOH pathway a viable choice.

10 SYNTHETIC FUELS↗

An ODE-Enabled Distributed Transient Stability Analysis for Networked Microgrids

Networked microgrid (NMG) exhibits noteworthy resiliency and flexibility benefits for the mutual support from neighboring microgrids. With high penetration of distributed energy resources (DERs) and the associated controls, the transient stability analysis of NMGs is of critical significance. To address the issues of computation burdens and privacy in the centralized transient analysis, this paper devises an ordinary differential equation (ODE)-enabled distributed transient stability (DTS) methodology for NMGs. First, an ODE-based microgrid model is established to capture the dynamics in the droop control of DERs as well as network and load. Further, a distributed DTS is devised for the ODE representation of an NMG, allowing a privacy-preserving transient analysis of each microgrid while accurately reconstructing the frequency dynamics under droop controls in all DERs. In conclusion, extensive tests are performed to verify the validity of the ODE-based microgrid model through both dynamic response and eigenvalue analysis, and the efficacy of the DTS algorithm in simulating the large signal responses and the frequent fluctuations in NMG.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Antenna analysis using neural networks

Conventional computing schemes have long been used to analyze problems in electromagnetics (EM). The vast majority of EM applications require computationally intensive algorithms involving numerical integration and solutions to large systems of equations. The feasibility of using neural network computing algorithms for antenna analysis is investigated. The ultimate goal is to use a trained neural network algorithm to reduce the computational demands of existing reflector surface error compensation techniques. Neural networks are computational algorithms based on neurobiological systems. Neural nets consist of massively parallel interconnected nonlinear computational elements. They are often employed in pattern recognition and image processing problems. Recently, neural network analysis has been applied in the electromagnetics area for the design of frequency selective surfaces and beam forming networks. The backpropagation training algorithm was employed to simulate classical antenna array synthesis techniques. The Woodward-Lawson (W-L) and Dolph-Chebyshev (D-C) array pattern synthesis techniques were used to train the neural network. The inputs to the network were samples of the desired synthesis pattern. The outputs are the array element excitations required to synthesize the desired pattern. Once trained, the network is used to simulate the W-L or D-C techniques. Various sector patterns and cosecant-type patterns (27 total) generated using W-L synthesis were used to train the network. Desired pattern samples were then fed to the neural network. The outputs of the network were the simulated W-L excitations. A 20 element linear array was used. There were 41 input pattern samples with 40 output excitations (20 real parts, 20 imaginary). A comparison between the simulated and actual W-L techniques is shown for a triangular-shaped pattern. Dolph-Chebyshev is a different class of synthesis technique in that D-C is used for side lobe control as opposed to pattern shaping. The interesting thing about D-C synthesis is that the side lobes have the same amplitude. Five-element arrays were used. Again, 41 pattern samples were used for the input. Nine actual D-C patterns ranging from -10 dB to -30 dB side lobe levels were used to train the network. A comparison between simulated and actual D-C techniques for a pattern with -22 dB side lobe level is shown. The goal for this research was to evaluate the performance of neural network computing with antennas. Future applications will employ the backpropagation training algorithm to drastically reduce the computational complexity involved in performing EM compensation for surface errors in large space reflector antennas.

Smith, William T.↗

Network performance analysis for HPC datacenters (net_perf) v1.0

The software has two main features: (1) identify data movement trends in HPC data centers that use network flow monitoring (2) analyze the performance of individual data flows under the existing data movement management strategy and identify performance bottlenecks that impede timely data availability for science workflows. Its main advantage is that it is tailored for HPC network traffic by considering HPC data movement management intricacies.

Giannakou, Anna↗

MICTPT - A minicomputer general-purpose microwave two-port analysis program

The implementation of a microwave network-analysis program for computers with 4K words of memory is described. The program is capable of the frequency analysis of networks which include interconnections of lumped elements, transmission lines, waveguides, and any two-port which is described by the elements of a scattering matrix. The network can be described mnemonically rather than by numerical codes. For each frequency in the range, the entire network is collapsed into a single equivalent A matrix, and the input impedance and other characteristics are calculated.

Olson, D. H.↗

Network algorithms for information analysis using the Titan Toolkit.

The analysis of networked activities is dramatically more challenging than many traditional kinds of analysis. A network is defined by a set of entities (people, organizations, banks, computers, etc.) linked by various types of relationships. These entities and relationships are often uninteresting alone, and only become significant in aggregate. The analysis and visualization of these networks is one of the driving factors behind the creation of the Titan Toolkit. Given the broad set of problem domains and the wide ranging databases in use by the information analysis community, the Titan Toolkit's flexible, component based pipeline provides an excellent platform for constructing specific combinations of network algorithms and visualizations.

99 GENERAL AND MISCELLANEOUS↗

Disrupting the ArcA Regulatory Network Amplifies the Fitness Cost of Tetracycline Resistance in Escherichia coli

There is an urgent need for strategies to discover secondary drugs to prevent or disrupt antimicrobial resistance (AMR), which is causing >700,000 deaths annually. Here, we demonstrate that tetracycline-resistant (Tet R ) Escherichia coli undergoes global transcriptional and metabolic remodeling, including downregulation of tricarboxylic acid cycle and disruption of redox homeostasis, to support consumption of the proton motive force for tetracycline efflux. Using a pooled genome-wide library of single-gene deletion strains, at least 308 genes, including four transcriptional regulators identified by our network analysis, were confirmed as essential for restoring the fitness of Tet R E. coli during treatment with tetracycline. Targeted knockout of ArcA, identified by network analysis as a master regulator of this new compensatory physiological state, significantly compromised fitness of Tet R E. coli during tetracycline treatment. A drug, sertraline, which generated a similar metabolome profile as the arcA knockout strain, also resensitized Tet R E. coli to tetracycline. We discovered that the potentiating effect of sertraline was eliminated upon knocking out arcA, demonstrating that the mechanism of potential synergy was through action of sertraline on the tetracycline-induced ArcA network in the Tet R strain. Our findings demonstrate that therapies that target mechanistic drivers of compensatory physiological states could resensitize AMR pathogens to lost antibiotics.

59 BASIC BIOLOGICAL SCIENCES↗

Development of the ITACA Network Loading Analysis Tool's Scheduling Techniques

NASA's SCENIC project aims to simplify and reduce the cost of space mission planning by creating analysis capabilities which are integrated with relevant analysis parameters specific to SCaN assets and SCaN supported user missions. The Integrated Tradespace Analysis of Communications Architectures (ITACA) will provide an all-in-one package for various analysis capabilities that normally require add-ons or multiple tools to complete. The ITACA tool will be responsible for assessing the given network architecture and generating a schedule for the missions as well as the assets. ITACA will allow users to evaluate the quality of service of a given network and determine whether or not the network will satisfy the mission's requirements. ITACA is currently under development, and during the spring of 2018 major development in the tools scheduling techniques were completed. A total of seven different techniques were completed.

space communications↗

Scripts for Running Multiple Lines of Evidence Analysis

The software code titled “Scripts for Running Multiple Lunes of Evidence Analysis” enables high throughput network analysis; efficient analysis of large multi-omic networks in order to rank genes by connectivity. This code creates a set of scripts that take omic networks as input as well as list of known genes and calculates scores for all other genes in genome based on connectivity to those genes and does so accurately and efficiently. In addition, it aids the user in performing a validation check of observed data to random. The code outputs a table of all genes in the genome with LOE scores and scores observed data versus random.

Furches, AnnaK.↗

Knowledge Spillovers and Cost Reductions in Solar Soft Costs

Despite the commonly acknowledged importance of knowledge spillovers in reducing solar soft costs, we are only beginning to answer a fundamental question: who learns what (knowledge acquisition), from whom (knowledge production), and how (spillover mechanisms)? Until recently, this important topic has been largely unexplored in the case of solar soft costs. Thus, this project set out to identify how knowledge spillovers affect soft costs in the U.S. photovoltaic (PV) installation industry, specifically how important spillovers are, what types of knowledge are most likely to spillover, and how networks of actors affect spillovers. Our findings offer insights for designing solutions that address problems associated with knowledge spillovers and that leverage spillovers to reduce solar soft costs. Recognizing the ambiguity in the definition of soft costs, i.e., “non-hardware costs,” and variability in soft cost categories, we developed the Solar Soft Cost Ontology (SSCO) to systematically identify key concepts related to soft costs, network actors, learning processes, and the relationships between them. This ontology served as a foundational organizational structure for the methodology of the remaining tasks: case studies, surveys, pricing analysis, patent analysis, network analysis, and project integration across tasks. While there is substantial learning among installers that is reducing the soft costs for PV installations, most of that learning is retained by firms rather than spread across the industry. The positive relationship between experience accumulation and cost reductions is typically explained as learning by doing (LBD), but we find that LBD effects are mediated by other learning mechanisms, including learning by searching and learning by interacting. Knowledge spillovers have significant potential to reduce solar PV soft costs, but successful knowledge spillover pathways are complex and non-trivial. There are a wide variety of ways to construct an installation business, thus categories of firms that can effectively cross-learn directly are small and what knowledge is relevant to whom is challenging and costly for firms to assess. This fragmentation limits the critical mass needed for spillover related soft cost reductions. Knowledge does not flow directly between installers. Indirect knowledge transfer pathways are critical: distributors, software providers, collaboratives, and hiring. Furthermore, diverse, more integrated knowledge networks tend to promote successful learning by organizations and across the system as a whole. Accordingly, we find the need to supporting the whole ecosystem using an integrated policy and programmatic approach to support installers, distributors, complementary sector, and facilitators. Overall, a deliberate policy-mix design is needed to reduce the solar PV deployment barrier in terms of installation cost reductions, because deployment policies could potentially interact with policies that facilitate network-building and technological innovation. A combination of deployment policies, innovation-support policies, and network-facilitating policies could potentially lead to a more desired market outcome through achieving higher joint learning rates from firms’ cumulative experiences developed in a more integrated production and deployment ecosystem.

14 SOLAR ENERGY↗