Search NASA⌕ Search

SEARCH · Search NASA

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 163 records · Page 9

Bayesian OED for Seismic Monitoring

SAND2024-13870O The Bayesian OED (Optimal Experiment Design) for Seismic Monitoring code provides the tools to analyze and optimize seismic monitoring networks using Bayesian OED. This method designs a utility function for experiments (network designs) using network analysis and network optimization. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.

Catanach, Thomas↗

Poblano v 1.0

Poblano is a Matlab toolbox of large-scale algorithms for nonlinear optimization. The algorithms in Poblano require only first-order derivative information (e.g., gradients for scalar-valued objective functions), and therefore can scale to very large problems [6].Poblano is a set of general purpose methods for solving unconstrained nonlinear optimization methods. It has been applied to standard test problems covering a range of application areas. The driving application for Poblano development has been tensor decompositions in data analysis applications (bibliometric analysis, social network analysis, chemometrics, etc.) [1].

Dunlavy, Daniel↗

Systems and methods for estimation and prediction of battery health and performance

Systems and computer-implemented methods are used for analyzing battery information. The battery information may be acquired from both passive data acquisition and active data acquisition. Active data may be used for feature extraction and parameter identification responsive to the input data relative to an electrical equivalent circuit model to develop geometric-based parameters and optimization-based parameters. These parameters can be combined with a decision fusion algorithm to develop internal battery parameters. Analysis processes including particle filter analysis, neural network analysis, and auto regressive moving average analysis can be used to analyze the internal battery parameters and develop battery health metrics. Additional decision fusion algorithms can be used to combine the internal battery parameters and the battery health metrics to develop state-of-health estimations, state-of-charge estimations, remaining-useful-life predictions, and end-of-life predictions for the battery.

97 MATHEMATICS AND COMPUTING↗

Quantifiable and objective approach to organizational performance enhancement.

This report describes a new methodology, social language network analysis (SLNA), that combines tools from social language processing and network analysis to identify socially situated relationships between individuals which, though subtle, are highly influential. Specifically, SLNA aims to identify and characterize the nature of working relationships by processing artifacts generated with computer-mediated communication systems, such as instant message texts or emails. Because social language processing is able to identify psychological, social, and emotional processes that individuals are not able to fully mask, social language network analysis can clarify and highlight complex interdependencies between group members, even when these relationships are latent or unrecognized. This report outlines the philosophical antecedents of SLNA, the mechanics of preprocessing, processing, and post-processing stages, and some example results obtained by applying this approach to a 15-month corporate discussion archive.

99 GENERAL AND MISCELLANEOUS↗

Data-driven Vulnerability Analysis of Networked Pipeline System

This paper introduces an attack generation framework for evaluating the vulnerability of nonlinear networked pipeline systems. The vulnerability analysis is formulated as determining the presence of feasible attack sets, defined by boundary functions representing the effectiveness and stealthiness of attack signals with respect to the objective and attack detection module. The framework utilizes three data-driven models, including two discriminative models that learn the boundary functions and a generative model that produces elements of the feasible attack set. A new loss function ensures successful attack generation with high probability.

03 NATURAL GAS↗

LINEBACkER: Bio-inspired Data Reduction Toward Real Time Network Traffic Analysis

Abstract—One essential component of resilient cyber applications is the ability to detect adversaries and protect systems with the same flexibility adversaries will use to achieve their goals. Current detection techniques do not enable this degree of flexibility because most existing applications are built using exact or regular-expression matching to libraries of rule sets. Further, network traffic defies traditional cyber security approaches that focus on limiting access based on the use of passwords and examination of lists of installed or downloaded programs. These approaches do not readily apply to network traffic occurring beyond the access control point, and when the data in question are combined control and payload data of ever increasing speed and volume. Manual analysis of network traffic is not normally possible because of the magnitude of the data that is being exchanged and the length of time that this analysis takes. At the same time, using an exact matching scheme to identify malicious traffic in real time often fails because the lists against which such searches must operate grow too large. In this work, we introduce an alternative method for cyber network detection based on similarity-measuring algorithms for gene sequence analysis. These methods are ideal because they were designed to identify similar but nonidentical sequences. We demonstrate that our method is generally applicable to the problem of network traffic analysis by illustrating its use in two different areas both based on different attributes of network traffic. Our approach provides a logical framework for organizing large collections of network data, prioritizing traffic of interest to human analysts, and makes it possible to discover traffic signatures without the bias introduced by expert-directed signature generation. Pattern recognition on reduced representations of network traffic offers a fast, efficient, and more robust way to detect anomalies.

Teuton, Jeremy R.↗

FPGA Based Real-time Network Traffic Analysis using Traffic Dispersion Patterns

The problem of Network Traffic Classification (NTC) has attracted significant amount of interest in the research community, offering a wide range of solutions at various levels. The core challenge is in addressing high amounts of traffic diversity found in today's networks. The problem becomes more challenging if a quick detection is required as in the case of identifying malicious network behavior or new applications like peer-to-peer traffic that have potential to quickly throttle the network bandwidth or cause significant damage. Recently, Traffic Dispersion Graphs (TDGs) have been introduced as a viable candidate for NTC. The TDGs work by forming a network wide communication graphs that embed characteristic patterns of underlying network applications. However, these patterns need to be quickly evaluated for mounting real-time response against them. This paper addresses these concerns and presents a novel solution for real-time analysis of Traffic Dispersion Metrics (TDMs) in the TDGs. We evaluate the dispersion metrics of interest and present a dedicated solution on an FPGA for their analysis. We also present analytical measures and empirically evaluate operating effectiveness of our design. The mapped design on Virtex-5 device can process 7.4 million packets/second for a TDG comprising of 10k flows at very high accuracies of over 96%.

99 GENERAL AND MISCELLANEOUS↗

Tight Practical Bounds for Subgraph Densities in Ego-centric Networks

SAND2025-11782O Tight Practical Bounds for Subgraph Densities in Ego-centric Networks is a software tool for calculating the “subgraph spread ratio” for social network analysis. This value is useful in network analysis for determining the amount of exogenous and endogenous pressure on a graph. It can distinguish between networks coming from different sources, e.g. distinguishing a graph of Facebook data versus a graph of Wikipedia data. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.

Mattes, Connor↗

Is there a case for broadband utility communications networks? Valuing and pricing incremental communications capacity on electric utility smart grid networks

Analysis of the potential for selling non-utility uses of broadband capability constructed in conjunction with Smart Grid/AMI deserves careful consideration. These services can be provided in a manner that neither creates unfair competition nor results in cross-subsidization of unregulated services by regulated services. (author)

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Streaming Solutions for Fine-Grained Network Traffic Measurements and Analysis

Online network traffic measurements and analysis is critical for detecting and preventing any real-time anomalies in the network. We propose, implement, and evaluate an online, adaptive measurement platform, which utilizes real-time traffic analysis results to refine subsequent traffic measurements. Central to our solution is the concept of Multi-Resolution Tiling (MRT), a heuristic approach that performs sequential analysis of traffic data to zoom into traffic subregions of interest. However, MRT is sensitive to transient traffic spikes. In this paper, we propose three novel traffic streaming algorithms that overcome the limitations of MRT and can cater to varying degrees of computational and storage budgets, detection latency, and accuracy of query response. We evaluate our streaming algorithms on a highly parallel and programmable hardware as well as a traditional software-based platforms. The algorithms demonstrate significant accuracy improvement over MRT in detecting anomalies consisting of synthetic hard-to-track elephant flows and global icebergs. Our proposed algorithms maintain the worst-case complexities of the MRT while incurring only a moderate increase in average resource utilization.

97 MATHEMATICS AND COMPUTING↗

Processes in DNA damage response from a whole-cell multi-omics perspective

Technological advances have made it feasible to collect multi-condition multi-omic time courses of cellular response to perturbation, but the complexity of these datasets impedes discovery due to challenges in data management, analysis, visualization, and interpretation. Here, we report a whole-cell mechanistic analysis of HL-60 cellular response to bendamustine. We integrate both enrichment and network analysis to show the progression of DNA damage and programmed cell death over time in molecular, pathway, and process-level detail using an interactive analysis framework for multi-omics data. Our framework, Mechanism of Action Generator Involving Network analysis (MAGINE), automates network construction and enrichment analysis across multiple samples and platforms, which can be integrated into our annotated gene-set network to combine the strengths of networks and ontology-driven analysis. Taken together, our work demonstrates how multi-omics integration can be used to explore signaling processes at various resolutions and demonstrates multi-pathway involvement beyond the canonical bendamustine mechanism.

59 BASIC BIOLOGICAL SCIENCES↗

Efficient energy transfer in light-harvesting systems: Quantum-classical comparison, flux network, and robustness analysis

Following the calculation of optimal energy transfer in thermal environment in our first paper [J. L. Wu, F. Liu, Y. Shen, J. S. Cao, and R. J. Silbey, New J. Phys. 12, 105012 (2010)], full quantum dynamics and leading-order 'classical' hopping kinetics are compared in the seven-site Fenna-Matthews-Olson (FMO) protein complex. The difference between these two dynamic descriptions is due to higher-order quantum corrections. Two thermal bath models, classical white noise (the Haken-Strobl-Reineker (HSR) model) and quantum Debye model, are considered. In the seven-site FMO model, we observe that higher-order corrections lead to negligible changes in the trapping time or in energy transfer efficiency around the optimal and physiological conditions (2% in the HSR model and 0.1% in the quantum Debye model for the initial site at BChl 1). However, using the concept of integrated flux, we can identify significant differences in branching probabilities of the energy transfer network between hopping kinetics and quantum dynamics (26% in the HSR model and 32% in the quantum Debye model for the initial site at BChl 1). This observation indicates that the quantum coherence can significantly change the distribution of energy transfer pathways in the flux network with the efficiency nearly the same. The quantum-classical comparison of the average trapping time with the removal of the bottleneck site, BChl 4, demonstrates the robustness of the efficient energy transfer by the mechanism of multi-site quantum coherence. To reconcile with the latest eight-site FMO model which is also investigated in the third paper [J. Moix, J. L. Wu, P. F. Huo, D. F. Coker, and J. S. Cao, J. Phys. Chem. Lett. 2, 3045 (2011)], the quantum-classical comparison with the flux network analysis is summarized in Appendix C. The eight-site FMO model yields similar trapping time and network structure as the seven-site FMO model but leads to a more disperse distribution of energy transfer pathways.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

RivGraph: Automatic extraction and analysis of river and delta channel network topology

River networks sustain life and landscapes by carrying and distributing water, sediment, and nutrients throughout ecosystems and communities. At the largest scale, river networks drain continents through tree-like tributary networks. At typically smaller scales, river deltas and braided rivers form loopy, complex distributary river networks via avulsions and bifurcations.In order to model flows through these networks or analyze network structure, the topology, or connectivity, of the network must be resolved. Additionally, morphologic properties of each river channel as well as the direction of flow through the channel inform how fluxes travel through the network’s channels. Riv Graphis a Python package that automates the extraction and characterization of river channel networks from a user-provided binary image, or mask, of a channel network (Fig. 1). Masks may be derived from (typically remotely-sensed) imagery, simulations, or even hand-drawn. RivGraph will create explicit representations of the channel network by resolving river centerlines as links, and junctions as nodes. Flow directions are solved for each link of the network without using auxiliary data, e.g., a digital elevation model (DEM). Morphologic properties are computed as well, including link lengths, widths, sinuosities, branching angles,and braiding indices. If provided,RivGraph will preserve georeferencing information of the mask and will export results as ESRI shapefiles, GeoJSONs, and GeoTIFFs for easy import into GIS software.RivGraph can also return extracted networks as networkx objects for convenient interfacing with the full-featured networkx package (Hagberg et al., 2008). Finally, RivGraph offers a suite of topologic metrics that were specifically designed for river channel network analysis (Tejedor et al., 2015b).

54 ENVIRONMENTAL SCIENCES↗

Using Bayesian Networks for Sensitivity Analysis of Complex Biogeochemical Models

Sensitivity analysis is a vital tool in numerical modeling to identify important parameters and processes that contribute to the overall uncertainty in model outputs. We developed a new sensitivity analysis method to quantify the relative importance of uncertain model processes that contain multiple uncertain parameters. The method is based on the concepts of Bayesian networks (BNs) to account for complex hierarchical uncertainty structure of a model system. We derived a new set of sensitivity indices using the methodology of variance-based global sensitivity analysis with the Bayesian inference. The framework is capable of representing the detailed uncertainty information of a complex model system using BNs and affords flexible grouping of different uncertain inputs given their characteristics and dependency structures. We have implemented the method on a real-world biogeochemical model at the groundwater-surface water interface within the Hanford Site’s 300 Area. The uncertainty sources of the model were first grouped into forcing scenario and three different processes based on our understanding of the complex system. The sensitivity analysis results indicate that both the reactive transport and groundwater flow processes are important sources of uncertainty for carbon-consumption predictions. Within the groundwater flow process, the structure of geological formations is more important than the permeability heterogeneity within a given geological formation. Our new sensitivity analysis framework based on BNs offers substantial flexibility for investigating the importance of combinations of interacting uncertainty sources in a hierarchical order, and it is expected to be applicable to a wide range of multi-physics models for complex systems.

Dai, Heng↗

Towards a Scalable and Reliable Real Time In-Network Data Analysis Infrastructure

The smart grid applications requires real time analysis, response within the order of milliseconds and high-reliability because of the mission critical structure of the power grid system. The only way to satisfy these requirements is in network data analysis and build-in redundancy routing for failures. To achieve this, we propose a data dissemination system that builds routes using network flow algorithms, have in network processing of the data and utilize data encoding to cope with high latencies.

99 GENERAL AND MISCELLANEOUS↗

Computing Bottleneck Structures at Scale for High-Precision Network Performance Analysis

The Theory of Bottleneck Structures is a recently-developed framework for studying the performance of data networks. It describes how local perturbations in one part of the network propagate and interact with others. This framework is a powerful analytical tool that allows network operators to make accurate predictions about network behavior and thereby optimize performance. Previous work implemented a software package for bottleneck structure analysis, but applied it only to toy examples. In this work, we introduce the first software package capable of scaling bottleneck structure analysis to production-size networks. Here, we benchmark our system using logs from ESnet, the Department of Energy's high-performance data network that connects research institutions in the U.S. Using the previously published tool as a baseline, we demonstrate that our system achieves vastly improved performance, constructing the bottleneck structure graphs in 0.21 s and calculating link derivatives in 0.09 s on average. We also study the asymptotic complexity of our core algorithms, demonstrating good scaling properties and strong agreement with theoretical bounds. These results indicate that our new software package can maintain its fast performance when applied to even larger networks. They also show that our software is efficient enough to analyze rapidly changing networks in real time. Overall, we demonstrate the feasibility of applying bottleneck structure analysis to solve practical problems in large, real-world data networks.

benchmark↗

A systematic analysis and data mining of opioid-related adverse events submitted to the FAERS database

The opioid epidemic has become a serious national crisis in the United States. An indepth systematic analysis of opioid-related adverse events (AEs) can clarify the risks presented by opioid exposure, as well as the individual risk profiles of specific opioid drugs and the potential relationships among the opioids. In this study, 92 opioids were identified from the list of all Food and Drug Administration (FDA)-approved drugs, annotated by RxNorm and were classified into 13 opioid groups: buprenorphine, codeine, dihydrocodeine, fentanyl, hydrocodone, hydromorphone, meperidine, methadone, morphine, oxycodone, oxymorphone, tapentadol, and tramadol. A total of 14,970,399 AE reports were retrieved and downloaded from the FDA Adverse Events Reporting System (FAERS) from 2004, Quarter 1 to 2020, Quarter 3. After data processing, Empirical Bayes Geometric Mean (EBGM) was then applied which identified 3317 pairs of potential risk signals within the 13 opioid groups. Based on these potential safety signals, a comparative analysis was pursued to provide a global overview of opioid-related AEs for all 13 groups of FDA-approved prescription opioids. The top 10 most reported AEs for each opioid class were then presented. Both network analysis and hierarchical clustering analysis were conducted to further explore the relationship between opioids. Results from the network analysis revealed a close association among fentanyl, oxycodone, hydrocodone, and hydromorphone, which shared more than 22 AEs. In addition, much less commonly reported AEs were shared among dihydrocodeine, meperidine, oxymorphone, and tapentadol. On the contrary, the hierarchical clustering analysis further categorized the 13 opioid classes into two groups by comparing the full profiles of presence/absence of AEs. The results of network analysis and hierarchical clustering analysis were not only consistent and cross-validated each other but also provided a better and deeper understanding of the associations and relationships between the 13 opioid groups with respect to their adverse effect profiles.

Research & Experimental Medicine↗