Search NASA⌕ Search

SEARCH · Search NASA

Results for “Graph analysis systems”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2016

Evaluation of Graph Pattern Matching Workloads in Graph Analysis Systems

Graph analysis has emerged as a powerful method for data scientists to represent, integrate, query, and explore heterogeneous data sources. As a result, graph data management and mining became a popular area of research, and led to the development of plethora of systems in recent years. Unfortunately, the number of emerging graph analysis systems and the wide range of applications, coupled with a lack of apples-to-apples comparisons, make it difficult to understand the trade-offs between different systems and the graph operations for which they are designed. A fair comparison of these systems is a challenging task for the following reasons: multiple data models, non-standardized serialization formats, various query interfaces to users, and diverse environments they operate in. To address these key challenges, in this paper we present a new benchmark suite by extending the Lehigh University Benchmark (LUBM) to cover the most common capabilities of various graph analysis systems. We provide the design process of the benchmark, which generalizes the workflow for data scientists to conduct the desired graph analysis on different graph analysis systems. Equipped with this extended benchmark suite, we present performance comparison for nine subgraph pattern retrieval operations over six graph analysis systems, namely NetworkX, Neo4j, Jena, Titan, GraphX, and uRiKA. Through the proposed benchmark suite, this study reveals both quantitative and qualitative findings in (1) implications in loading data into each system; (2) challenges in describing graph patterns for each query interface; and (3) different sensitivity of each system to query selectivity. We envision that this study will pave the road for: (i) data scientists to select the suitable graph analysis systems, and (ii) data management system designers to advance graph analysis systems.

Hong, Seokyong↗
DOE OSTI2016

GraphBench

GraphBench is a benchmark suite for graph pattern mining and graph analysis systems. The benchmark suite is a significant addition to conducting apples-apples comparison of graph analysis software (databases, in-memory tools, triple stores, etc.)

Sukumar, SreenivasR.↗
DOE OSTI2016

GraphBench

GraphBench is a benchmark suite for graph pattern mining and graph analysis systems. The benchmark suite is a significant addition to conducting apples-apples comparison of graph analysis software (databases, in-memory tools, triple stores, etc.)

Sukumar, Sreenivas R.↗
DOE OSTI2014

Parallel processing of filtered queries in attributed semantic graphs

Execution of complex analytic queries on massive semantic graphs is a challenging problem in big-data analytics that requires high-performance parallel computing. In a semantic graph, vertices and edges carry attributes of various types and the analytic queries typically depend on the values of these attributes. Thus, the computation must view the graph through a filter that passes only those individual vertices and edges of interest. Previous investigations have developed Knowledge Discovery Toolbox (KDT), a sophisticated Python library for parallel graph computations. In KDT, the user can write custom graph algorithms by specifying operations between edges and vertices ( semiring operations ). The user can also customize existing graph algorithms by writing filters. While the high-level language for this customization enables domain scientists to productively express their graph analytics requirements, the customized queries perform poorly due to the overhead of having to call into the Python virtual machine for each vertex and edge. In this work, we use the Selective Embedded Just-In-Time Specialization (SEJITS) approach to automatically translate semiring operations and filters defined by programmers into a lower-level efficiency language, bypassing the upcall into Python. We evaluate our approach by comparing it with the high-performance Combinatorial BLAS engine and show that our approach combines the benefits of programming in a high-level language with executing in a low-level parallel environment. We increase the system's flexibility by developing techniques that provide users with the ability to define new vertex and edge types from Python. We also present a new Roofline model for graph traversals and show that we achieve performance that is significantly closer to the bounds suggested by the Roofline. Finally, to further understand the complex interaction with the underlying architecture, we present an analysis using performance counters that quantifies the improvement in hardware behavior in the context our SEJITS methodology. Comprehensively, we demonstrate the first known solution to the problem of obtaining high performance from a productivity language when applying graph algorithms selectively on semantic graphs with hundreds of millions of edges and scaling to thousands of processors for graphs.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Enabling Graph Mining in RDF Triplestores using SPARQL for Holistic In-situ Graph Analysis

The graph analysis is now considered as a promising technique to discover useful knowledge in data with a new perspective. We envi- sion that there are two dimensions of graph analysis: OnLine Graph Analytic Processing (OLGAP) and Graph Mining (GM) where each respectively focuses on subgraph pattern matching and automatic knowledge discovery in graph. Moreover, as these two dimensions aim to complementarily solve complex problems, holistic in-situ graph analysis which covers both OLGAP and GM in a single system is critical for minimizing the burdens of operating multiple graph systems and transferring intermediate result-sets between those systems. Nevertheless, most existing graph analysis systems are only capable of one dimension of graph analysis. In this work, we take an approach to enabling GM capabilities (e.g., PageRank, connected-component analysis, node eccentricity, etc.) in RDF triplestores, which are originally developed to store RDF datasets and provide OLGAP capability. More specifically, to achieve our goal, we implemented six representative graph mining algorithms using SPARQL. The approach allows a wide range of available RDF data sets directly applicable for holistic graph analysis within a system. For validation of our approach, we evaluate performance of our implementations with nine real-world datasets and three different computing environments - a laptop computer, an Amazon EC2 instance, and a shared-memory Cray XMT2 URIKA-GD graph-processing appliance. The experimen- tal results show that our implementation can provide promising and scalable performance for real world graph analysis in all tested environments. The developed software is publicly available in an open-source project that we initiated.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Analysis and Mitigation of Cascading Failures Using a Stochastic Interaction Graph with Eigen-analysis

In studies on complex network systems using graph theory, eigen-analysis is typically performed on an undirected graph model of the network. However, when analyzing cascading failures in a power system, the interactions among failures suggest the need for a directed graph beyond the topology of the power system to model directions of failure propagation. To accurately quantify failure interactions for effective mitigation strategies, this paper proposes a stochastic interaction graph model and associated eigen-analysis. Different types of modes on failure propagations are defined and characterized by the eigenvalues of a stochastic interaction matrix, whose absolute values are unity, zero, or in between. Finding and interpreting these modes helps identify the probable patterns of failure propagation, either local or widespread, and the participating components based on eigenvectors. Then, by lowering the failure probabilities of critical components highly participating in a mode of widespread failures, cascading can be mitigated. Here, the validity of the proposed stochastic interaction graph model, eigen-analysis and the resulting mitigation strategies is demonstrated using simulated cascading failure data on an NPCC 140-bus system.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

Leveraging graph clustering techniques for cyber‐physical system analysis to enhance disturbance characterisation

Abstract Cyber‐physical systems have behaviour that crosses domain boundaries during events such as planned operational changes and malicious disturbances. Traditionally, the cyber and physical systems are monitored separately and use very different toolsets and analysis paradigms. The security and privacy of these cyber‐physical systems requires improved understanding of the combined cyber‐physical system behaviour and methods for holistic analysis. Therefore, the authors propose leveraging clustering techniques on cyber‐physical data from smart grid systems to analyse differences and similarities in behaviour during cyber‐, physical‐, and cyber‐physical disturbances. Since clustering methods are commonly used in data science to examine statistical similarities in order to sort large datasets, these algorithms can assist in identifying useful relationships in cyber‐physical systems. Through this analysis, deeper insights can be shared with decision‐makers on what cyber and physical components are strongly or weakly linked, what cyber‐physical pathways are most traversed, and the criticality of certain cyber‐physical nodes or edges. This paper presents several types of clustering methods for cyber‐physical graphs of smart grid systems and their application in assessing different types of disturbances for informing cyber‐physical situational awareness. The collection of these clustering techniques provide a foundational basis for cyber‐physical graph interdependency analysis.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Analyzing Impact of Distributed PV Generation on Integrated Transmission & Distribution System Voltage Stability—A Graph Trace Analysis Based Approach

The use of a Graph Trace Analysis (GTA)-based power flow for analyzing the voltage stability of integrated Transmission and Distribution (T&D) networks is discussed in the context of distributed Photovoltaic (PV) generation. The voltage stability of lines and the load carrying capability of buses is analyzed at various PV penetration levels. It is shown that as the PV generation levels increase, an increase in the steady state voltage stability of the system is observed. Moreover, within certain regions of stability margin changes, changes in voltage stability margins of transmission lines are shown to be linearly related to changes in the loading of the lines. Two case studies are presented, where one case study involves a model with eight voltage levels and 784,000 nodes. In one case study, a voltage-stability heat map is used to demonstrate the identification of weak lines and buses.

14 SOLAR ENERGY↗
DOE OSTI2019

A graph theoretic framework for representation, exploration and analysis on computed states of physical systems

A graph theoretic perspective is taken for a range of phenomena in continuum physics in order to develop representations for analysis of large scale, high-fidelity solutions to these problems. Of interest are phenomena described by partial differential equations, with solutions being obtained by computation. The motivation is to gain insight that may otherwise be difficult to attain because of the high dimensionality of computed solutions. We consider graph theoretic representations that are made possible by low-dimensional states defined on the systems. These states are typically functionals of the high-dimensional solutions, and therefore retain important aspects of the high-fidelity information present in the original, computed solutions. Our method is rooted in regarding each state as a vertex on a graph and identifying edges via processes that are induced either by numerical solution strategies, or by the physics. Correspondences are drawn between the sampling of stationary states, or the time evolution of dynamic phenomena, and the analytic machinery of graph theory. A collection of computations is examined in this framework and new insights to them are presented through analysis of the corresponding graphs.

42 ENGINEERING↗
NASA NTRS2004

Website of the Systems and Analysis Branch Supported Projects and Graph Analysis

Throughout the past few weeks I have learned a great amount of information about many interesting aspects that go on here at NASA Glenn Research Center Branch 7820. Branch 7820 is the Systems and Analysis Branch. The people involved in this Branch deal with in a nutshell the analysis of propulsion systems for Earth to orbit and space transportation systems. The first project that I had worked on was helping my mentor learn more about lunar geography and the most recommended way to maintain communication for our future lunar missions. During this time I studied the craters of the moon, especially the South Pole, to provide her with information so that she can make decisions. I also researched to provide her with contact information on those people who are specialized in lunar geography so that she may talk to them to find out more in depth information. Most of my time spent here has been helping to develop a comprehensive explanation and background of the different projects our Branch has supported. When I first came to NASA Glenn and started working with the 7820 Branch there website had many holes that needed to be filled in. I have spent numerous weeks researching information about topics such as Project Prometheus itself and one of its components Jupiter s Icy Moons Orbiter (JIMO). I have also done a large amount of research on propulsion systems and how different kinds work. I have learned many facts about Nuclear Electric Propulsion (NEP) all the way to Nuclear Thermal Propulsion (NTP) systems. I will continue to do this until all the holes are filled and find out about Global Integrated Design Environment (GLIDE) and Next Generation Launch technology (NGLT). Since most of my job was providing information to go onto a website I has to learn how to put my information into a HTML format. I had no previous knowledge on how to do that kind of task and had to study how to do it and am now able to create a document in HTML format. There has been reorganizing done here at NASA Glenn and our Branch was moved to another building. Therefore, our library had to be moved with us. I spent time helping to put together the boxes, pack the library, and label them accordingly. This was not an easy task but was an experience in itself. I was able to see old posters that NASA had produced about different space missions and look at Russian map of the US and books on space missions. I was also about to see what was in the library in terms of reference material helped because now I can make use of the information for my research on the website. Throughout my internship my mentor will provide me with graphs to analyze and recreate so that she may use them to her advantage. I will learn from every piece of data that comes my way. Later, I will study and analysis gravity-loss for Earth departure trajectories. Since I haven't done that yet I cannot really describe what 1 will learn or what exactly the project entails. The whole experience has been great and I have no doubt that it will exceed every expectation previously thought.

Kellerman, Corinne↗
NASA NTRS2008

The Analysis of Image Segmentation Hierarchies with a Graph-based Knowledge Discovery System

Currently available pixel-based analysis techniques do not effectively extract the information content from the increasingly available high spatial resolution remotely sensed imagery data. A general consensus is that object-based image analysis (OBIA) is required to effectively analyze this type of data. OBIA is usually a two-stage process; image segmentation followed by an analysis of the segmented objects. We are exploring an approach to OBIA in which hierarchical image segmentations provided by the Recursive Hierarchical Segmentation (RHSEG) software developed at NASA GSFC are analyzed by the Subdue graph-based knowledge discovery system developed by a team at Washington State University. In this paper we discuss out initial approach to representing the RHSEG-produced hierarchical image segmentations in a graphical form understandable by Subdue, and provide results on real and simulated data. We also discuss planned improvements designed to more effectively and completely convey the hierarchical segmentation information to Subdue and to improve processing efficiency.

Tilton, James C.↗
NASA NTRS2006

Vulnerabilities, Influences and Interaction Paths: Failure Data for Integrated System Risk Analysis

We describe graph-based analysis methods for identifying and analyzing cross-subsystem interaction risks from subsystem connectivity information. By discovering external and remote influences that would be otherwise unexpected, these methods can support better communication among subsystem designers at points of potential conflict and to support design of more dependable and diagnosable systems. These methods identify hazard causes that can impact vulnerable functions or entities if propagated across interaction paths from the hazard source to the vulnerable target. The analysis can also assess combined impacts of And-Or trees of disabling influences. The analysis can use ratings of hazards and vulnerabilities to calculate cumulative measures of the severity and importance. Identification of cross-subsystem hazard-vulnerability pairs and propagation paths across subsystems will increase coverage of hazard and risk analysis and can indicate risk control and protection strategies.

Malin, Jane T.↗
DOE OSTI2017

TopoMS-UI

"TopoMS" is a visualization and analysis tool developed to enable interactive exploration of molecular systems, allowing the users perform Bader analysis as well as detailed analysis of molecular graph in complex systems.

Bhatia, Harsh↗
DOE OSTI2024

A graph embedding‐based approach for automatic cyber‐physical power system risk assessment to prevent and mitigate threats at scale

Abstract Power systems are facing an increasing number of cyber incidents, potentially leading to damaging consequences to both physical and cyber aspects. However, the development of analytical methods for the study of large‐scale power infrastructures as cyber‐physical systems is still in its early stages. Drawing inspiration from machine‐learning techniques, the authors introduce a method inspired by the principles of graph embedding that is tailored for quantitative risk assessment and the exploration of possible mitigation strategies of large‐scale cyber‐physical power systems. The primary advantage of the graph embedding approach lies in its ability to generate numerous random walks on a graph, simulating potential access paths. Meanwhile, it enables capturing high‐dimensional structures in low‐dimensional spaces, facilitating advanced machine‐learning applications, and ensuring scalability and adaptability for comprehensive network analysis. By employing this graph embedding‐based approach, the authors present a structured and methodical framework for risk assessment in cyber‐physical systems. The proposed graph embedding‐based risk analysis framework aims to provide a more insightful perspective on cyber‐physical risk assessment and situation awareness for power systems. To validate and demonstrate its applicability, the method has been tested on two cyber‐physical power system models: the Western System Coordinating Council (WSCC) 9‐Bus System and the Illinois 200‐Bus System , thereby showing its advantages in enhancing the accuracy of risk analysis and comprehensiveness of situational awareness.

Sun, Shining↗
DOE OSTI2025

ERAD: A Graph-Based Tool for Energy Resilience Analysis of Electric Distribution Systems

Understanding the impact of extreme events on people's ability to access energy is crucial for designing resilient energy systems. In the event of a disaster, damage to the electric system and related infrastructure (e.g., downed power lines, flooded equipment, hacked communication systems, damaged roads, etc.) can impact people's access to critical services, including not just electricity but also shelter, food, healthcare, and more. There is a key need to understand such impacts better and evaluate options to improve energy resilience. The Energy Resilience Analysis for Electric Distribution Systems (ERAD) tool is a free and open-source software package designed to help researchers and decision-makers analyze and improve energy system resilience.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2014

Combining static analysis and state transition graphs for verification of event-condition-action systems in the RERS 2012 and 2013 challenges

In this work, we present a combination of approaches for the verification of event-condition-action (ECA) systems. The analyzed ECA systems range from structurally simple to structurally complex systems. We address the verification of reachability properties and behavioral properties. Reachability properties are represented by assertions in the program and we determine statically whether an assertion holds for all execution paths. Behavioral properties are represented as linear temporal logic formulas specifying the input/output behavior of the program. Our approach assumes a finite state space. We compare a symbolic analysis with an exhaustive state space exploration and discuss the trade-offs between the approaches in terms of the number of computed states and run-time behavior. All variants compute a state transition graph which can also be passed to an LTL verifier. The variants have a different impact on the number of computed states in the state transition graph which in turn impacts the run-time and memory consumption of subsequent phases. Finally, we evaluate the different analysis variants with the RERS benchmarks.

97 MATHEMATICS AND COMPUTING↗