Appendix D Surface Water and Ground Water Time-Concentration...
Office of Legacy Management (LM)
Surface Water and Ground Water Time-Concentration Plots, Stream Discharge Measurements, Ground Water Level Data, and Ground Water Well Hydrographs This page intentionally left ...
Sanfilippo, Antonio P.
2005-12-27
Graph theory is a branch of discrete combinatorial mathematics that studies the properties of graphs. The theory was pioneered by the Swiss mathematician Leonhard Euler in the 18th century, commenced its formal development during the second half of the 19th century, and has witnessed substantial growth during the last seventy years, with applications in areas as diverse as engineering, computer science, physics, sociology, chemistry and biology. Graph theory has also had a strong impact in computational linguistics by providing the foundations for the theory of features structures that has emerged as one of the most widely used frameworks for the representation of grammar formalisms.
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
that use data from the PDSF batch scheduler (SGE) to show the utilization of the cluster over the past 24 hours. The graphs were generated with RRDTool and are updated...
Wong, Pak C.; Mackey, Patrick S.; Perrine, Kenneth A.; Foote, Harlan P.; Thomas, James J.
2008-12-23
Methods for visualizing a graph by automatically drawing elements of the graph as labels are disclosed. In one embodiment, the method comprises receiving node information and edge information from an input device and/or communication interface, constructing a graph layout based at least in part on that information, wherein the edges are automatically drawn as labels, and displaying the graph on a display device according to the graph layout. In some embodiments, the nodes are automatically drawn as labels instead of, or in addition to, the label-edges.
Energy Science and Technology Software Center (OSTI)
2007-05-22
MpiGraph consists of an MPI application called mpiGraph written in C to measure message bandwidth and an associated crunch_mpiGraph script written in Perl to process the application output into an HTMO report. The mpiGraph application is designed to inspect the health and scalability of a high-performance interconnect while under heavy load. This is useful to detect hardware and software problems in a system, such as slow nodes, links, switches, or contention in switch routing. Itmore » is also useful to characterize how interconnect performance changes with different settings or how one interconnect type compares to another.« less
Lothian, Josh; Powers, Sarah S; Sullivan, Blair D; Baker, Matthew B; Schrock, Jonathan; Poole, Stephen W
2013-12-01
The benchmarking effort within the Extreme Scale Systems Center at Oak Ridge National Laboratory seeks to provide High Performance Computing benchmarks and test suites of interest to the DoD sponsor. The work described in this report is a part of the effort focusing on graph generation. A previously developed benchmark, SystemBurn, allowed the emulation of dierent application behavior profiles within a single framework. To complement this effort, similar capabilities are desired for graph-centric problems. This report examines existing synthetic graph generator implementations in preparation for further study on the properties of their generated synthetic graphs.
Graphs, matrices, and the GraphBLAS: Seven good reasons
DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)
Kepner, Jeremy; Bader, David; Buluç, Aydın; Gilbert, John; Mattson, Timothy; Meyerhenke, Henning
2015-01-01
The analysis of graphs has become increasingly important to a wide range of applications. Graph analysis presents a number of unique challenges in the areas of (1) software complexity, (2) data complexity, (3) security, (4) mathematical complexity, (5) theoretical analysis, (6) serial performance, and (7) parallel performance. Implementing graph algorithms using matrix-based approaches provides a number of promising solutions to these challenges. The GraphBLAS standard (istcbigdata.org/GraphBlas) is being developed to bring the potential of matrix based graph algorithms to the broadest possible audience. The GraphBLAS mathematically defines a core set of matrix-based graph operations that can be used to implementmore » a wide class of graph algorithms in a wide range of programming environments. This paper provides an introduction to the GraphBLAS and describes how the GraphBLAS can be used to address many of the challenges associated with analysis of graphs.« less
Graphs, matrices, and the GraphBLAS: Seven good reasons
Kepner, Jeremy; Bader, David; Buluç, Aydın; Gilbert, John; Mattson, Timothy; Meyerhenke, Henning
2015-01-01
The analysis of graphs has become increasingly important to a wide range of applications. Graph analysis presents a number of unique challenges in the areas of (1) software complexity, (2) data complexity, (3) security, (4) mathematical complexity, (5) theoretical analysis, (6) serial performance, and (7) parallel performance. Implementing graph algorithms using matrix-based approaches provides a number of promising solutions to these challenges. The GraphBLAS standard (istcbigdata.org/GraphBlas) is being developed to bring the potential of matrix based graph algorithms to the broadest possible audience. The GraphBLAS mathematically defines a core set of matrix-based graph operations that can be used to implement a wide class of graph algorithms in a wide range of programming environments. This paper provides an introduction to the GraphBLAS and describes how the GraphBLAS can be used to address many of the challenges associated with analysis of graphs.
Subdominant pseudoultrametric on graphs
Dovgoshei, A A; Petrov, E A
2013-08-31
Let (G,w) be a weighted graph. We find necessary and sufficient conditions under which the weight w:E(G)?R{sup +} can be extended to a pseudoultrametric on V(G), and establish a criterion for the uniqueness of such an extension. We demonstrate that (G,w) is a complete k-partite graph, for k?2, if and only if for any weight that can be extended to a pseudoultrametric, among all such extensions one can find the least pseudoultrametric consistent with w. We give a structural characterization of graphs for which the subdominant pseudoultrametric is an ultrametric for any strictly positive weight that can be extended to a pseudoultrametric. Bibliography: 14 titles.
Energy Science and Technology Software Center (OSTI)
2013-02-19
This library is used in several LLNL projects, including STAT (the Stack Trace Analysis Tool for scalable debugging) and some modules in P^nMPI (a tool MPI tool infrastructure). It can also be used standalone for creating and manipulationg graphs, but its API is primarily tuned to support these other projects
Simple and Flexible Scene Graph
Energy Science and Technology Software Center (OSTI)
2007-10-01
The system implements a flexible and extensible scene graph for the visualization and analysis of scientific information.
Temporal Representation in Semantic Graphs
Levandoski, J J; Abdulla, G M
2007-08-07
A wide range of knowledge discovery and analysis applications, ranging from business to biological, make use of semantic graphs when modeling relationships and concepts. Most of the semantic graphs used in these applications are assumed to be static pieces of information, meaning temporal evolution of concepts and relationships are not taken into account. Guided by the need for more advanced semantic graph queries involving temporal concepts, this paper surveys the existing work involving temporal representations in semantic graphs.
Winlaw, Manda; De Sterck, Hans; Sanders, Geoffrey
2015-10-26
In very simple terms a network can be de ned as a collection of points joined together by lines. Thus, networks can be used to represent connections between entities in a wide variety of elds including engi- neering, science, medicine, and sociology. Many large real-world networks share a surprising number of properties, leading to a strong interest in model development research and techniques for building synthetic networks have been developed, that capture these similarities and replicate real-world graphs. Modeling these real-world networks serves two purposes. First, building models that mimic the patterns and prop- erties of real networks helps to understand the implications of these patterns and helps determine which patterns are important. If we develop a generative process to synthesize real networks we can also examine which growth processes are plausible and which are not. Secondly, high-quality, large-scale network data is often not available, because of economic, legal, technological, or other obstacles [7]. Thus, there are many instances where the systems of interest cannot be represented by a single exemplar network. As one example, consider the eld of cybersecurity, where systems require testing across diverse threat scenarios and validation across diverse network structures. In these cases, where there is no single exemplar network, the systems must instead be modeled as a collection of networks in which the variation among them may be just as important as their common features. By developing processes to build synthetic models, so-called graph generators, we can build synthetic networks that capture both the essential features of a system and realistic variability. Then we can use such synthetic graphs to perform tasks such as simulations, analysis, and decision making. We can also use synthetic graphs to performance test graph analysis algorithms, including clustering algorithms and anomaly detection algorithms.
Recursive Feature Extraction in Graphs
Energy Science and Technology Software Center (OSTI)
2014-08-14
ReFeX extracts recursive topological features from graph data. The input is a graph as a csv file and the output is a csv file containing feature values for each node in the graph. The features are based on topological counts in the neighborhoods of each nodes, as well as recursive summaries of neighbors' features.
Graph Coarsening for Path Finding in Cybersecurity Graphs
Hogan, Emilie A.; Johnson, John R.; Halappanavar, Mahantesh
2013-01-01
n the pass-the-hash attack, hackers repeatedly steal password hashes and move through a computer network with the goal of reaching a computer with high level administrative privileges. In this paper we apply graph coarsening in network graphs for the purpose of detecting hackers using this attack or assessing the risk level of the network's current state. We repeatedly take graph minors, which preserve the existence of paths in the graph, and take powers of the adjacency matrix to count the paths. This allows us to detect the existence of paths as well as find paths that have high risk of being used by adversaries.
Maunz, Peter Lukas Wilhelm; Sterk, Jonathan David; Lobser, Daniel; Parekh, Ojas D.; Ryan-Anderson, Ciaran
2016-01-01
In recent years, advanced network analytics have become increasingly important to na- tional security with applications ranging from cyber security to detection and disruption of ter- rorist networks. While classical computing solutions have received considerable investment, the development of quantum algorithms to address problems, such as data mining of attributed relational graphs, is a largely unexplored space. Recent theoretical work has shown that quan- tum algorithms for graph analysis can be more efficient than their classical counterparts. Here, we have implemented a trapped-ion-based two-qubit quantum information proces- sor to address these goals. Building on Sandia's microfabricated silicon surface ion traps, we have designed, realized and characterized a quantum information processor using the hyperfine qubits encoded in two 171 Yb + ions. We have implemented single qubit gates using resonant microwave radiation and have employed Gate set tomography (GST) to characterize the quan- tum process. For the first time, we were able to prove that the quantum process surpasses the fault tolerance thresholds of some quantum codes by demonstrating a diamond norm distance of less than 1 . 9 x 10 [?] 4 . We used Raman transitions in order to manipulate the trapped ions' motion and realize two-qubit gates. We characterized the implemented motion sensitive and insensitive single qubit processes and achieved a maximal process infidelity of 6 . 5 x 10 [?] 5 . We implemented the two-qubit gate proposed by Molmer and Sorensen and achieved a fidelity of more than 97 . 7%.
A Collection of Features for Semantic Graphs
Eliassi-Rad, T; Fodor, I K; Gallagher, B
2007-05-02
Semantic graphs are commonly used to represent data from one or more data sources. Such graphs extend traditional graphs by imposing types on both nodes and links. This type information defines permissible links among specified nodes and can be represented as a graph commonly referred to as an ontology or schema graph. Figure 1 depicts an ontology graph for data from National Association of Securities Dealers. Each node type and link type may also have a list of attributes. To capture the increased complexity of semantic graphs, concepts derived for standard graphs have to be extended. This document explains briefly features commonly used to characterize graphs, and their extensions to semantic graphs. This document is divided into two sections. Section 2 contains the feature descriptions for static graphs. Section 3 extends the features for semantic graphs that vary over time.
Graph Partitioning and Sequencing Software
Energy Science and Technology Software Center (OSTI)
1995-09-19
Graph partitioning is a fundemental problem in many scientific contexts. CHACO2.0 is a software package designed to partition and sequence graphs. CHACO2.0 allows for recursive application of several methods for finding small edge separators in weighted graphs. These methods include inertial, spectral, Kernighan Lin and multilevel methods in addition to several simpler strategies. Each of these approaches can be used to partition the graph into two, four, or eight pieces at each level of recursion.more » In addition, the Kernighan Lin method can be used to improve partitions generated by any of the other algorithms. CHACO2.0 can also be used to address various graph sequencing problems, with applications to scientific computing, database design, gene sequencing and other problems.« less
Khovanov homology of graph-links
Nikonov, Igor M
2012-08-31
Graph-links arise as the intersection graphs of turning chord diagrams of links. Speaking informally, graph-links provide a combinatorial description of links up to mutations. Many link invariants can be reformulated in the language of graph-links. Khovanov homology, a well-known and useful knot invariant, is defined for graph-links in this paper (in the case of the ground field of characteristic two). Bibliography: 14 titles.
Graph Analytics for Signature Discovery
Hogan, Emilie A.; Johnson, John R.; Halappanavar, Mahantesh; Lo, Chaomei
2013-06-01
Within large amounts of seemingly unstructured data it can be diffcult to find signatures of events. In our work we transform unstructured data into a graph representation. By doing this we expose underlying structure in the data and can take advantage of existing graph analytics capabilities, as well as develop new capabilities. Currently we focus on applications in cybersecurity and communication domains. Within cybersecurity we aim to find signatures for perpetrators using the pass-the-hash attack, and in communications we look for emails or phone calls going up or down a chain of command. In both of these areas, and in many others, the signature we look for is a path with certain temporal properties. In this paper we discuss our methodology for finding these temporal paths within large graphs.
Graph modeling systems and methods
Neergaard, Mike
2015-10-13
An apparatus and a method for vulnerability and reliability modeling are provided. The method generally includes constructing a graph model of a physical network using a computer, the graph model including a plurality of terminating vertices to represent nodes in the physical network, a plurality of edges to represent transmission paths in the physical network, and a non-terminating vertex to represent a non-nodal vulnerability along a transmission path in the physical network. The method additionally includes evaluating the vulnerability and reliability of the physical network using the constructed graph model, wherein the vulnerability and reliability evaluation includes a determination of whether each terminating and non-terminating vertex represents a critical point of failure. The method can be utilized to evaluate wide variety of networks, including power grid infrastructures, communication network topologies, and fluid distribution systems.
Dr.L: Distributed Recursive (Graph) Layout
Energy Science and Technology Software Center (OSTI)
2007-11-19
Dr. L provides two-dimensional visualizations of very large abstract graph structures. it can be used for data mining applications including biology, scientific literature, and social network analysis. Dr. L is a graph layout program that uses a multilevel force-directed algorithm. A graph is input and drawn using a force-directed algorithm based on simulated annealing. The resulting layout is clustered using a single link algorithm. This clustering is used to produce a coarsened graph (fewer nodes)more » which is then re-drawn. this process is repeated until a sufficiently small graph is produced. The smallest graph is drawn and then used as a basis for drawing the original graph by refining the series of coarsened graphs that were produced. The layout engine can be run in serial or in parallel.« less
Fast generation of sparse random kernel graphs
Hagberg, Aric; Lemons, Nathan; Du, Wen -Bo
2015-09-10
The development of kernel-based inhomogeneous random graphs has provided models that are flexible enough to capture many observed characteristics of real networks, and that are also mathematically tractable. We specify a class of inhomogeneous random graph models, called random kernel graphs, that produces sparse graphs with tunable graph properties, and we develop an efficient generation algorithm to sample random instances from this model. As real-world networks are usually large, it is essential that the run-time of generation algorithms scales better than quadratically in the number of vertices n. We show that for many practical kernels our algorithm runs in time at most ο(n(logn)²). As an example, we show how to generate samples of power-law degree distribution graphs with tunable assortativity.
Fast generation of sparse random kernel graphs
DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)
Hagberg, Aric; Lemons, Nathan; Du, Wen -Bo
2015-09-10
The development of kernel-based inhomogeneous random graphs has provided models that are flexible enough to capture many observed characteristics of real networks, and that are also mathematically tractable. We specify a class of inhomogeneous random graph models, called random kernel graphs, that produces sparse graphs with tunable graph properties, and we develop an efficient generation algorithm to sample random instances from this model. As real-world networks are usually large, it is essential that the run-time of generation algorithms scales better than quadratically in the number of vertices n. We show that for many practical kernels our algorithm runs in timemore » at most ο(n(logn)²). As an example, we show how to generate samples of power-law degree distribution graphs with tunable assortativity.« less
API Requirements for Dynamic Graph Prediction
Gallagher, B; Eliassi-Rad, T
2006-10-13
Given a large-scale time-evolving multi-modal and multi-relational complex network (a.k.a., a large-scale dynamic semantic graph), we want to implement algorithms that discover patterns of activities on the graph and learn predictive models of those discovered patterns. This document outlines the application programming interface (API) requirements for fast prototyping of feature extraction, learning, and prediction algorithms on large dynamic semantic graphs. Since our algorithms must operate on large-scale dynamic semantic graphs, we have chosen to use the graph API developed in the CASC Complex Networks Project. This API is supported on the back end by a semantic graph database (developed by Scott Kohn and his team). The advantages of using this API are (i) we have full-control of its development and (ii) the current API meets almost all of the requirements outlined in this document.
Graph algorithms in the titan toolkit.
McLendon, William Clarence, III; Wylie, Brian Neil
2009-10-01
Graph algorithms are a key component in a wide variety of intelligence analysis activities. The Graph-Based Informatics for Non-Proliferation and Counter-Terrorism project addresses the critical need of making these graph algorithms accessible to Sandia analysts in a manner that is both intuitive and effective. Specifically we describe the design and implementation of an open source toolkit for doing graph analysis, informatics, and visualization that provides Sandia with novel analysis capability for non-proliferation and counter-terrorism.
Enabling Graph Appliance for Genome Assembly
Singh, Rina; Graves, Jeffrey A; Lee, Sangkeun; Sukumar, Sreenivas R; Shankar, Mallikarjun
2015-01-01
In recent years, there has been a huge growth in the amount of genomic data available as reads generated from various genome sequencers. The number of reads generated can be huge, ranging from hundreds to billions of nucleotide, each varying in size. Assembling such large amounts of data is one of the challenging computational problems for both biomedical and data scientists. Most of the genome assemblers developed have used de Bruijn graph techniques. A de Bruijn graph represents a collection of read sequences by billions of vertices and edges, which require large amounts of memory and computational power to store and process. This is the major drawback to de Bruijn graph assembly. Massively parallel, multi-threaded, shared memory systems can be leveraged to overcome some of these issues. The objective of our research is to investigate the feasibility and scalability issues of de Bruijn graph assembly on Cray s Urika-GD system; Urika-GD is a high performance graph appliance with a large shared memory and massively multithreaded custom processor designed for executing SPARQL queries over large-scale RDF data sets. However, to the best of our knowledge, there is no research on representing a de Bruijn graph as an RDF graph or finding Eulerian paths in RDF graphs using SPARQL for potential genome discovery. In this paper, we address the issues involved in representing a de Bruin graphs as RDF graphs and propose an iterative querying approach for finding Eulerian paths in large RDF graphs. We evaluate the performance of our implementation on real world ebola genome datasets and illustrate how genome assembly can be accomplished with Urika-GD using iterative SPARQL queries.
Useful Graphs and Charts - Ion Beams - Radiation Effects Facility...
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Times 15 MeVu LET vs Range Graph 25 MeVu LET vs Range Graph 40 Mevu LET vs Range Graph Radiation Effects Facility Cyclotron Institute Texas A&M University MS 3366 ...
Graph Mining Meets the Semantic Web
Lee, Sangkeun; Sukumar, Sreenivas R; Lim, Seung-Hwan
2015-01-01
The Resource Description Framework (RDF) and SPARQL Protocol and RDF Query Language (SPARQL) were introduced about a decade ago to enable flexible schema-free data interchange on the Semantic Web. Today, data scientists use the framework as a scalable graph representation for integrating, querying, exploring and analyzing data sets hosted at different sources. With increasing adoption, the need for graph mining capabilities for the Semantic Web has emerged. We address that need through implementation of three popular iterative Graph Mining algorithms (Triangle count, Connected component analysis, and PageRank). We implement these algorithms as SPARQL queries, wrapped within Python scripts. We evaluate the performance of our implementation on 6 real world data sets and show graph mining algorithms (that have a linear-algebra formulation) can indeed be unleashed on data represented as RDF graphs using the SPARQL query interface.
GraphReduce: Processing Large-Scale Graphs on Accelerator-Based Systems
Sengupta, Dipanjan; Song, Shuaiwen; Agarwal, Kapil; Schwan, Karsten
2015-11-15
Recent work on real-world graph analytics has sought to leverage the massive amount of parallelism offered by GPU devices, but challenges remain due to the inherent irregularity of graph algorithms and limitations in GPU-resident memory for storing large graphs. We present GraphReduce, a highly efficient and scalable GPU-based framework that operates on graphs that exceed the device’s internal memory capacity. GraphReduce adopts a combination of edge- and vertex-centric implementations of the Gather-Apply-Scatter programming model and operates on multiple asynchronous GPU streams to fully exploit the high degrees of parallelism in GPUs with efficient graph data movement between the host and device.
GraphReduce: Large-Scale Graph Analytics on Accelerator-Based HPC Systems
Sengupta, Dipanjan; Agarwal, Kapil; Song, Shuaiwen; Schwan, Karsten
2015-09-30
Recent work on real-world graph analytics has sought to leverage the massive amount of parallelism offered by GPU devices, but challenges remain due to the inherent irregularity of graph algorithms and limitations in GPU-resident memory for storing large graphs. We present GraphReduce, a highly efficient and scalable GPU-based framework that operates on graphs that exceed the device’s internal memory capacity. GraphReduce adopts a combination of both edge- and vertex-centric implementations of the Gather-Apply-Scatter programming model and operates on multiple asynchronous GPU streams to fully exploit the high degrees of parallelism in GPUs with efficient graph data movement between the host and the device.
Enabling Graph Mining in RDF Triplestores using SPARQL for Holistic In-situ Graph Analysis
Lee, Sangkeun; Sukumar, Sreenivas R; Hong, Seokyong; Lim, Seung-Hwan
2016-01-01
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.
Enabling Graph Mining in RDF Triplestores using SPARQL for Holistic In-situ Graph Analysis
DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)
Lee, Sangkeun; Sukumar, Sreenivas R; Hong, Seokyong; Lim, Seung-Hwan
2016-01-01
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 existingmore » 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.« less
The MultiThreaded Graph Library (MTGL)
Energy Science and Technology Software Center (OSTI)
2008-07-17
The MultiThreaded Graph Library (MTGL) is a set of header files that implement graph algorithm in such a way that they can run on massively multithreaded architectures. It is based upon the Boost Graph Library, but doesnÃÂÃÂ¢ÃÂÃÂÃÂÃÂt use Boost since the latter doesnÃÂÃÂ¢ÃÂÃÂÃÂÃÂt run well on these architectures.
Bipartite graph partitioning and data clustering
Zha, Hongyuan; He, Xiaofeng; Ding, Chris; Gu, Ming; Simon, Horst D.
2001-05-07
Many data types arising from data mining applications can be modeled as bipartite graphs, examples include terms and documents in a text corpus, customers and purchasing items in market basket analysis and reviewers and movies in a movie recommender system. In this paper, the authors propose a new data clustering method based on partitioning the underlying biopartite graph. The partition is constructed by minimizing a normalized sum of edge weights between unmatched pairs of vertices of the bipartite graph. They show that an approximate solution to the minimization problem can be obtained by computing a partial singular value decomposition (SVD) of the associated edge weight matrix of the bipartite graph. They point out the connection of their clustering algorithm to correspondence analysis used in multivariate analysis. They also briefly discuss the issue of assigning data objects to multiple clusters. In the experimental results, they apply their clustering algorithm to the problem of document clustering to illustrate its effectiveness and efficiency.
Visualization Graph | OpenEI Community
8 August, 2012 - 12:37 New Gapminder Visualizations Added EIA Energy data Gapminder OECD OpenEI SEDS Visualization Graph OpenEI now features some cool new Gapminder...
Fault-tolerant dynamic task graph scheduling
Kurt, Mehmet C.; Krishnamoorthy, Sriram; Agrawal, Kunal; Agrawal, Gagan
2014-11-16
In this paper, we present an approach to fault tolerant execution of dynamic task graphs scheduled using work stealing. In particular, we focus on selective and localized recovery of tasks in the presence of soft faults. We elicit from the user the basic task graph structure in terms of successor and predecessor relationships. The work stealing-based algorithm to schedule such a task graph is augmented to enable recovery when the data and meta-data associated with a task get corrupted. We use this redundancy, and the knowledge of the task graph structure, to selectively recover from faults with low space and time overheads. We show that the fault tolerant design retains the essential properties of the underlying work stealing-based task scheduling algorithm, and that the fault tolerant execution is asymptotically optimal when task re-execution is taken into account. Experimental evaluation demonstrates the low cost of recovery under various fault scenarios.
Bayati Kim Saberi random graph sampler
Energy Science and Technology Software Center (OSTI)
2012-06-05
This software package implements the algorithm from a paper by Bayati, Kim, and Saberi (first reference below) to generate a uniformly random sample of a graph with a prescribed degree distribution.
Comparing English, Mandarin, and Russian Hydrographic and Terrain Categories
Feng, Chen-Chieh; Sorokine, Alexandre
2013-01-01
The paper compares hydrographic and terrain categories in the geospatial data standards of the US, Taiwan, and Russian Federation where the dominant languages used are from di erent language families. It aims to identify structural and semantic di erences between similar categories across three geospatial data standards. By formalizing the data standard structures and identifying the properties that di erentiate sibling categories in each geospatial data standard using well-known formal relations and quality universals, we develop a common basis on which hydrographic and terrain categories in the three data standards can be compared. The result suggests that all three data standards structure categories with a mixture of relations with di erent meaning even though most of them are well-known relations in top-level ontologies. Similar categories can be found across all three standards but exact match between similar categories are rare.
Accelerating semantic graph databases on commodity clusters
Morari, Alessandro; Castellana, Vito G.; Haglin, David J.; Feo, John T.; Weaver, Jesse R.; Tumeo, Antonino; Villa, Oreste
2013-10-06
We are developing a full software system for accelerating semantic graph databases on commodity cluster that scales to hundreds of nodes while maintaining constant query throughput. Our framework comprises a SPARQL to C++ compiler, a library of parallel graph methods and a custom multithreaded runtime layer, which provides a Partitioned Global Address Space (PGAS) programming model with fork/join parallelism and automatic load balancing over a commodity clusters. We present preliminary results for the compiler and for the runtime.
Ocean Carbon and Repeat Hydrographic CLIVAR Program Data
DOE Data Explorer [Office of Scientific and Technical Information (OSTI)]
Effective management and archival of data is a fundamental requirement for successful scientific research endeavors, and future oceanographic research depends on the availability and clarity of existing data. Two data offices in the US deal with reference-quality global ocean CTD, water sample, and underway data, one (CDIAC) specializing in discrete CO2 and underway surface data, and the other (WHPO/CCHDO) specializing in CTD, hydrographic, and tracer data.
Graph representation of protein free energy landscape
Li, Minghai; Duan, Mojie; Fan, Jue; Huo, Shuanghong; Han, Li
2013-11-14
The thermodynamics and kinetics of protein folding and protein conformational changes are governed by the underlying free energy landscape. However, the multidimensional nature of the free energy landscape makes it difficult to describe. We propose to use a weighted-graph approach to depict the free energy landscape with the nodes on the graph representing the conformational states and the edge weights reflecting the free energy barriers between the states. Our graph is constructed from a molecular dynamics trajectory and does not involve projecting the multi-dimensional free energy landscape onto a low-dimensional space defined by a few order parameters. The calculation of free energy barriers was based on transition-path theory using the MSMBuilder2 package. We compare our graph with the widely used transition disconnectivity graph (TRDG) which is constructed from the same trajectory and show that our approach gives more accurate description of the free energy landscape than the TRDG approach even though the latter can be organized into a simple tree representation. The weighted-graph is a general approach and can be used on any complex system.
Ocean Carbon and Repeat Hydrographic CLIVAR Program Data
DOE Data Explorer [Office of Scientific and Technical Information (OSTI)]
A systematic and global re-occupation of select hydrographic sections is underway to quantify changes in storage and transport of heat, fresh water, carbon dioxide (CO2) and related parameters. By integrating the scientific needs of the carbon and hydrography/tracer communities, major synergies and cost savings are being achieved. The philosophy is that in addition to efficiency, a coordinated approach will produce scientific advances that exceed those of having individual carbon and hydrographic/tracer programs. These advances will contribute to the following overlapping scientific objectives: • Data for Model Calibration and Validation • Carbon System Studies • Heat and Freshwater Storage and Flux Studies • Deep and Shallow Water Mass and Ventilation Studies • Calibration of Autonomous Sensors Effective management and archival of data is a fundamental requirement for successful scientific research endeavors, and future oceanographic research depends on the availability and clarity of existing data. Two data offices in the US deal with reference-quality global ocean CTD, water sample, and underway data, one (CDIAC) specializing in discrete CO2 and underway surface data, and the other (WHPO/CCHDO) specializing in CTD, hydrographic, and tracer data.
Continuous-time quantum walks on star graphs
Salimi, S.
2009-06-15
In this paper, we investigate continuous-time quantum walk on star graphs. It is shown that quantum central limit theorem for a continuous-time quantum walk on star graphs for N-fold star power graph, which are invariant under the quantum component of adjacency matrix, converges to continuous-time quantum walk on K{sub 2} graphs (complete graph with two vertices) and the probability of observing walk tends to the uniform distribution.
Dynamic graph system for a semantic database
Mizell, David
2015-01-27
A method and system in a computer system for dynamically providing a graphical representation of a data store of entries via a matrix interface is disclosed. A dynamic graph system provides a matrix interface that exposes to an application program a graphical representation of data stored in a data store such as a semantic database storing triples. To the application program, the matrix interface represents the graph as a sparse adjacency matrix that is stored in compressed form. Each entry of the data store is considered to represent a link between nodes of the graph. Each entry has a first field and a second field identifying the nodes connected by the link and a third field with a value for the link that connects the identified nodes. The first, second, and third fields represent the rows, column, and elements of the adjacency matrix.
Dynamic graph system for a semantic database
Mizell, David
2016-04-12
A method and system in a computer system for dynamically providing a graphical representation of a data store of entries via a matrix interface is disclosed. A dynamic graph system provides a matrix interface that exposes to an application program a graphical representation of data stored in a data store such as a semantic database storing triples. To the application program, the matrix interface represents the graph as a sparse adjacency matrix that is stored in compressed form. Each entry of the data store is considered to represent a link between nodes of the graph. Each entry has a first field and a second field identifying the nodes connected by the link and a third field with a value for the link that connects the identified nodes. The first, second, and third fields represent the rows, column, and elements of the adjacency matrix.
Communication Graph Generator for Parallel Programs
Energy Science and Technology Software Center (OSTI)
2014-04-08
Graphator is a collection of relatively simple sequential programs that generate communication graphs/matrices for commonly occurring patterns in parallel programs. Currently, there is support for five communication patterns: two-dimensional 4-point stencil, four-dimensional 8-point stencil, all-to-alls over sub-communicators, random near-neighbor communication, and near-neighbor communication.
GraphPrints: Towards a Graph Analytic Method for Network Anomaly Detection
Harshaw, Chris R; Bridges, Robert A; Iannacone, Michael D; Reed, Joel W; Goodall, John R
2016-01-01
This paper introduces a novel graph-analytic approach for detecting anomalies in network flow data called \\textit{GraphPrints}. Building on foundational network-mining techniques, our method represents time slices of traffic as a graph, then counts graphlets\\textemdash small induced subgraphs that describe local topology. By performing outlier detection on the sequence of graphlet counts, anomalous intervals of traffic are identified, and furthermore, individual IPs experiencing abnormal behavior are singled-out. Initial testing of GraphPrints is performed on real network data with an implanted anomaly. Evaluation shows false positive rates bounded by 2.84\\% at the time-interval level, and 0.05\\% at the IP-level with 100\\% true positive rates at both.
StreamWorks - A system for Dynamic Graph Search
Choudhury, Sutanay; Holder, Larry; Chin, George; Ray, Abhik; Beus, Sherman J.; Feo, John T.
2013-06-11
Acting on time-critical events by processing ever growing social media, news or cyber data streams is a major technical challenge. Many of these data sources can be modeled as multi-relational graphs. Mining and searching for subgraph patterns in a continuous setting requires an efficient approach to incremental graph search. The goal of our work is to enable real-time search capabilities for graph databases. This demonstration will present a dynamic graph query system that leverages the structural and semantic characteristics of the underlying multi-relational graph.
Modular Environment for Graph Research and Analysis with a Persistent
Energy Science and Technology Software Center (OSTI)
2009-11-18
The MEGRAPHS software package provides a front-end to graphs and vectors residing on special-purpose computing resources. It allows these data objects to be instantiated, destroyed, and manipulated. A variety of primitives needed for typical graph analyses are provided. An example program illustrating how MEGRAPHS can be used to implement a PageRank computation is included in the distribution.The MEGRAPHS software package is targeted towards developers of graph algorithms. Programmers using MEGRAPHS would write graph analysis programsmore » in terms of high-level graph and vector operations. These computations are transparently executed on the Cray XMT compute nodes.« less
Knowledge Representation Issues in Semantic Graphs for Relationship Detection
Barthelemy, M; Chow, E; Eliassi-Rad, T
2005-02-02
An important task for Homeland Security is the prediction of threat vulnerabilities, such as through the detection of relationships between seemingly disjoint entities. A structure used for this task is a ''semantic graph'', also known as a ''relational data graph'' or an ''attributed relational graph''. These graphs encode relationships as typed links between a pair of typed nodes. Indeed, semantic graphs are very similar to semantic networks used in AI. The node and link types are related through an ontology graph (also known as a schema). Furthermore, each node has a set of attributes associated with it (e.g., ''age'' may be an attribute of a node of type ''person''). Unfortunately, the selection of types and attributes for both nodes and links depends on human expertise and is somewhat subjective and even arbitrary. This subjectiveness introduces biases into any algorithm that operates on semantic graphs. Here, we raise some knowledge representation issues for semantic graphs and provide some possible solutions using recently developed ideas in the field of complex networks. In particular, we use the concept of transitivity to evaluate the relevance of individual links in the semantic graph for detecting relationships. We also propose new statistical measures for semantic graphs and illustrate these semantic measures on graphs constructed from movies and terrorism data.
Graph processing platforms at scale: practices and experiences
Lim, Seung-Hwan; Lee, Sangkeun; Brown, Tyler C; Sukumar, Sreenivas R; Ganesh, Gautam
2015-01-01
Graph analysis unveils hidden associations of data in many phenomena and artifacts, such as road network, social networks, genomic information, and scientific collaboration. Unfortunately, a wide diversity in the characteristics of graphs and graph operations make it challenging to find a right combination of tools and implementation of algorithms to discover desired knowledge from the target data set. This study presents an extensive empirical study of three representative graph processing platforms: Pegasus, GraphX, and Urika. Each system represents a combination of options in data model, processing paradigm, and infrastructure. We benchmarked each platform using three popular graph operations, degree distribution, connected components, and PageRank over a variety of real-world graphs. Our experiments show that each graph processing platform shows different strength, depending the type of graph operations. While Urika performs the best in non-iterative operations like degree distribution, GraphX outputforms iterative operations like connected components and PageRank. In addition, we discuss challenges to optimize the performance of each platform over large scale real world graphs.
Frequent Subgraph Discovery in Large Attributed Streaming Graphs
Ray, Abhik; Holder, Larry; Choudhury, Sutanay
2014-08-13
The problem of finding frequent subgraphs in large dynamic graphs has so far only consid- ered a dynamic graph as being represented by a series of static snapshots taken at various points in time. This representation of a dynamic graph does not lend itself well to real time processing of real world graphs like social networks or internet traffic which consist of a stream of nodes and edges. In this paper we propose an algorithm that discovers the frequent subgraphs present in a graph represented by a stream of labeled nodes and edges. Our algorithm is efficient and consists of tunable parameters that can be tuned by the user to get interesting patterns from various kinds of graph data. In our model updates to the graph arrive in the form of batches which contain new nodes and edges. Our algorithm con- tinuously reports the frequent subgraphs that are estimated to be found in the entire graph as each batch arrives. We evaluate our system using 5 large dynamic graph datasets: the Hetrec 2011 challenge data, Twitter, DBLP and two synthetic. We evaluate our approach against two popular large graph miners, i.e., SUBDUE and GERM. Our experimental re- sults show that we can find the same frequent subgraphs as a non-incremental approach applied to snapshot graphs, and in less time.
Jargon and Graph Modularity on Twitter
Dowling, Chase P.; Corley, Courtney D.; Farber, Robert M.; Reynolds, William
2013-09-01
The language of conversation is just as dependent upon word choice as it is on who is taking part. Twitter provides an excellent test-bed in which to conduct experiments not only on language usage but on who is using what language with whom. To this end, we combine large scale graph analytical techniques with known socio-linguistic methods. In this article we leverage both expert curated vocabularies and naive mathematical graph analyses to determine if network behavior on Twitter corroborates with the current understanding of language usage. The results reported indicate that, based on networks constructed from user to user communication and communities identified using the Clauset- Newman greedy modularity algorithm we find that more prolific users of these curated vocabularies are concentrated in distinct network communities.
A Graph Search Heuristic for Shortest Distance Paths
Chow, E
2005-03-24
This paper presents a heuristic for guiding A* search for finding the shortest distance path between two vertices in a connected, undirected, and explicitly stored graph. The heuristic requires a small amount of data to be stored at each vertex. The heuristic has application to quickly detecting relationships between two vertices in a large information or knowledge network. We compare the performance of this heuristic with breadth-first search on graphs with various topological properties. The results show that one or more orders of magnitude improvement in the number of vertices expanded is possible for large graphs, including Poisson random graphs.
Sequoia supercomputer tops Graph 500 | National Nuclear Security...
National Nuclear Security Administration (NNSA)
Lawrence Livermore National Laboratory scientists' search for new ways to solve large complex national security problems led to the top ranking on Graph 500 and new techniques for ...
Mining Graphs for Understanding Time-Varying Volumetric Data...
Office of Scientific and Technical Information (OSTI)
SciTech Connect Search Results Journal Article: Mining Graphs for Understanding ... DOE Contract Number: AC02-06CH11357 Resource Type: Journal Article Resource Relation: ...
Two linear time, low overhead algorithms for graph layout
Energy Science and Technology Software Center (OSTI)
2008-01-10
The software comprises two algorithms designed to perform a 2D layout of a graph structure in time linear with respect to the vertices and edges in the graph, whereas most other layout algorithms have a running time that is quadratic with respect to the number of vertices or greater. Although these layout algorithms run in a fraction of the time as their competitors, they provide competitive results when applied to most real-world graphs. These algorithmsmore » also have a low constant running time and small memory footprint, making them useful for small to large graphs.« less
International energy indicators. [Statistical tables and graphs
Bauer, E.K.
1980-05-01
International statistical tables and graphs are given for the following: (1) Iran - Crude Oil Capacity, Production and Shut-in, June 1974-April 1980; (2) Saudi Arabia - Crude Oil Capacity, Production, and Shut-in, March 1974-Apr 1980; (3) OPEC (Ex-Iran and Saudi Arabia) - Capacity, Production and Shut-in, June 1974-March 1980; (4) Non-OPEC Free World and US Production of Crude Oil, January 1973-February 1980; (5) Oil Stocks - Free World, US, Japan, and Europe (Landed, 1973-1st Quarter, 1980); (6) Petroleum Consumption by Industrial Countries, January 1973-December 1979; (7) USSR Crude Oil Production and Exports, January 1974-April 1980; and (8) Free World and US Nuclear Generation Capacity, January 1973-March 1980. Similar statistical tables and graphs included for the United States include: (1) Imports of Crude Oil and Products, January 1973-April 1980; (2) Landed Cost of Saudi Oil in Current and 1974 Dollars, April 1974-January 1980; (3) US Trade in Coal, January 1973-March 1980; (4) Summary of US Merchandise Trade, 1976-March 1980; and (5) US Energy/GNP Ratio, 1947 to 1979.
Scaling Semantic Graph Databases in Size and Performance
Morari, Alessandro; Castellana, Vito G.; Villa, Oreste; Tumeo, Antonino; Weaver, Jesse R.; Haglin, David J.; Choudhury, Sutanay; Feo, John T.
2014-08-06
In this paper we present SGEM, a full software system for accelerating large-scale semantic graph databases on commodity clusters. Unlike current approaches, SGEM addresses semantic graph databases by only employing graph methods at all the levels of the stack. On one hand, this allows exploiting the space efficiency of graph data structures and the inherent parallelism of graph algorithms. These features adapt well to the increasing system memory and core counts of modern commodity clusters. On the other hand, however, these systems are optimized for regular computation and batched data transfers, while graph methods usually are irregular and generate fine-grained data accesses with poor spatial and temporal locality. Our framework comprises a SPARQL to data parallel C compiler, a library of parallel graph methods and a custom, multithreaded runtime system. We introduce our stack, motivate its advantages with respect to other solutions and show how we solved the challenges posed by irregular behaviors. We present the result of our software stack on the Berlin SPARQL benchmarks with datasets up to 10 billion triples (a triple corresponds to a graph edge), demonstrating scaling in dataset size and in performance as more nodes are added to the cluster.
EAGLE: 'EAGLE'Is an' Algorithmic Graph Library for Exploration
2015-01-16
The Resource Description Framework (RDF) and SPARQL Protocol and RDF Query Language (SPARQL) were introduced about a decade ago to enable flexible schema-free data interchange on the Semantic Web. Today data scientists use the framework as a scalable graph representation for integrating, querying, exploring and analyzing data sets hosted at different sources. With increasing adoption, the need for graph mining capabilities for the Semantic Web has emerged. Today there is no tools to conduct "graph mining" on RDF standard data sets. We address that need through implementation of popular iterative Graph Mining algorithms (Triangle count, Connected component analysis, degree distribution, diversity degree, PageRank, etc.). We implement these algorithms as SPARQL queries, wrapped within Python scripts and call our software tool as EAGLE. In RDF style, EAGLE stands for "EAGLE 'Is an' algorithmic graph library for exploration. EAGLE is like 'MATLAB' for 'Linked Data.'
An Experiment on Graph Analysis Methodologies for Scenarios
Brothers, Alan J.; Whitney, Paul D.; Wolf, Katherine E.; Kuchar, Olga A.; Chin, George
2005-09-30
Visual graph representations are increasingly used to represent, display, and explore scenarios and the structure of organizations. The graph representations of scenarios are readily understood, and commercial software is available to create and manage these representations. The purpose of the research presented in this paper is to explore whether these graph representations support quantitative assessments of the underlying scenarios. The underlying structure of the scenarios is the information that is being targeted in the experiment and the extent to which the scenarios are similar in content. An experiment was designed that incorporated both the contents of the scenarios and analysts’ graph representations of the scenarios. The scenarios’ content was represented graphically by analysts, and both the structure and the semantics of the graph representation were attempted to be used to understand the content. The structure information was not found to be discriminating for the content of the scenarios in this experiment; but, the semantic information was discriminating.
Query optimization for graph analytics on linked data using SPARQL
Hong, Seokyong; Lee, Sangkeun; Lim, Seung -Hwan; Sukumar, Sreenivas R.; Vatsavai, Ranga Raju
2015-07-01
Triplestores that support query languages such as SPARQL are emerging as the preferred and scalable solution to represent data and meta-data as massive heterogeneous graphs using Semantic Web standards. With increasing adoption, the desire to conduct graph-theoretic mining and exploratory analysis has also increased. Addressing that desire, this paper presents a solution that is the marriage of Graph Theory and the Semantic Web. We present software that can analyze Linked Data using graph operations such as counting triangles, finding eccentricity, testing connectedness, and computing PageRank directly on triple stores via the SPARQL interface. We describe the process of optimizing performance of the SPARQL-based implementation of such popular graph algorithms by reducing the space-overhead, simplifying iterative complexity and removing redundant computations by understanding query plans. Our optimized approach shows significant performance gains on triplestores hosted on stand-alone workstations as well as hardware-optimized scalable supercomputers such as the Cray XMT.
Graph facilitates tracking water and gas influx
Gruy, H.J. )
1990-03-26
Graphing the vertical distribution of reservoir volume is an easy method for estimating the acre-ft remaining to be exploited in reservoirs with water or gas encroachment. To evaluate reservoir performance and estimate oil and gas reserves in water-drive reservoirs or oil reservoirs with a gas cap, it is necessary to determine the magnitude of the movement of oil-water and gas-oil contact surfaces. In reviewing reserve estimates and reservoir studies done by others, the authors have found that very few reservoir engineers or geologists have an easy method for tracking the movement of these surfaces and estimating the volumes of oil displaced water encroachment, gas cap expansion, or the volumes of oil lost by wetting the gas cap. The following method evolved from the author's studies of the East Texas field starting in 1942, and it took this form in the early 1950s.
Composing Data Parallel Code for a SPARQL Graph Engine
Castellana, Vito G.; Tumeo, Antonino; Villa, Oreste; Haglin, David J.; Feo, John
2013-09-08
Big data analytics process large amount of data to extract knowledge from them. Semantic databases are big data applications that adopt the Resource Description Framework (RDF) to structure metadata through a graph-based representation. The graph based representation provides several benefits, such as the possibility to perform in memory processing with large amounts of parallelism. SPARQL is a language used to perform queries on RDF-structured data through graph matching. In this paper we present a tool that automatically translates SPARQL queries to parallel graph crawling and graph matching operations. The tool also supports complex SPARQL constructs, which requires more than basic graph matching for their implementation. The tool generates parallel code annotated with OpenMP pragmas for x86 Shared-memory Multiprocessors (SMPs). With respect to commercial database systems such as Virtuoso, our approach reduces memory occupation due to join operations and provides higher performance. We show the scaling of the automatically generated graph-matching code on a 48-core SMP.
Parallel Algorithms for Graph Optimization using Tree Decompositions
Sullivan, Blair D; Weerapurage, Dinesh P; Groer, Christopher S
2012-06-01
Although many $\\cal{NP}$-hard graph optimization problems can be solved in polynomial time on graphs of bounded tree-width, the adoption of these techniques into mainstream scientific computation has been limited due to the high memory requirements of the necessary dynamic programming tables and excessive runtimes of sequential implementations. This work addresses both challenges by proposing a set of new parallel algorithms for all steps of a tree decomposition-based approach to solve the maximum weighted independent set problem. A hybrid OpenMP/MPI implementation includes a highly scalable parallel dynamic programming algorithm leveraging the MADNESS task-based runtime, and computational results demonstrate scaling. This work enables a significant expansion of the scale of graphs on which exact solutions to maximum weighted independent set can be obtained, and forms a framework for solving additional graph optimization problems with similar techniques.
Must all charting and graphing code be written in javascript...
Must all charting and graphing code be written in javascript? Home > Groups > Databus In the documentation chapter entitled Developing charts using 3rd party api, we are told that...
EAGLE: 'EAGLE'Is an' Algorithmic Graph Library for Exploration
Energy Science and Technology Software Center (OSTI)
2015-01-16
The Resource Description Framework (RDF) and SPARQL Protocol and RDF Query Language (SPARQL) were introduced about a decade ago to enable flexible schema-free data interchange on the Semantic Web. Today data scientists use the framework as a scalable graph representation for integrating, querying, exploring and analyzing data sets hosted at different sources. With increasing adoption, the need for graph mining capabilities for the Semantic Web has emerged. Today there is no tools to conduct "graphmore » mining" on RDF standard data sets. We address that need through implementation of popular iterative Graph Mining algorithms (Triangle count, Connected component analysis, degree distribution, diversity degree, PageRank, etc.). We implement these algorithms as SPARQL queries, wrapped within Python scripts and call our software tool as EAGLE. In RDF style, EAGLE stands for "EAGLE 'Is an' algorithmic graph library for exploration. EAGLE is like 'MATLAB' for 'Linked Data.'« less
Data Sources For Emerging Technologies Program MYPP Target Graphs
Broader source: Energy.gov [DOE]
The BTO Emerging Technologies Accomplishments and Outcomes – 2015 page contains graphs on Multi-Year Program Plan R&D targets for certain technologies. This page contains information on data...
TIFF Image Writer patch for OpenSceneGraph
Energy Science and Technology Software Center (OSTI)
2012-01-05
This software consists of code modifications to the open-source OpenSceneGraph software package to enable the creation of TlFF images containing 16 bit unsigned data. They also allow the user to disable compression and set the DPI tags in the resulting TIFF Images. Some image analysis programs require uncompressed, 16 bit unsigned input data. These code modifications allow programs based on OpenSceneGraph to write out such images, improving connectivity between applications.
Highly Asynchronous VisitOr Queue Graph Toolkit
Energy Science and Technology Software Center (OSTI)
2012-10-01
HAVOQGT is a C++ framework that can be used to create highly parallel graph traversal algorithms. The framework stores the graph and algorithmic data structures on external memory that is typically mapped to high performance locally attached NAND FLASH arrays. The framework supports a vertex-centered visitor programming model. The frameworkd has been used to implement breadth first search, connected components, and single source shortest path.
The peculiar phase structure of random graph bisection
Percus, Allon G; Istrate, Gabriel; Goncalves, Bruno T; Sumi, Robert Z
2008-01-01
The mincut graph bisection problem involves partitioning the n vertices of a graph into disjoint subsets, each containing exactly n/2 vertices, while minimizing the number of 'cut' edges with an endpoint in each subset. When considered over sparse random graphs, the phase structure of the graph bisection problem displays certain familiar properties, but also some surprises. It is known that when the mean degree is below the critical value of 2 log 2, the cutsize is zero with high probability. We study how the minimum cutsize increases with mean degree above this critical threshold, finding a new analytical upper bound that improves considerably upon previous bounds. Combined with recent results on expander graphs, our bound suggests the unusual scenario that random graph bisection is replica symmetric up to and beyond the critical threshold, with a replica symmetry breaking transition possibly taking place above the threshold. An intriguing algorithmic consequence is that although the problem is NP-hard, we can find near-optimal cutsizes (whose ratio to the optimal value approaches 1 asymptotically) in polynomial time for typical instances near the phase transition.
Algorithms and architectures for high performance analysis of semantic graphs.
Hendrickson, Bruce Alan
2005-09-01
Semantic graphs offer one promising avenue for intelligence analysis in homeland security. They provide a mechanism for describing a wide variety of relationships between entities of potential interest. The vertices are nouns of various types, e.g. people, organizations, events, etc. Edges in the graph represent different types of relationships between entities, e.g. 'is friends with', 'belongs-to', etc. Semantic graphs offer a number of potential advantages as a knowledge representation system. They allow information of different kinds, and collected in differing ways, to be combined in a seamless manner. A semantic graph is a very compressed representation of some of relationship information. It has been reported that the semantic graph can be two orders of magnitude smaller than the processed intelligence data. This allows for much larger portions of the data universe to be resident in computer memory. Many intelligence queries that are relevant to the terrorist threat are naturally expressed in the language of semantic graphs. One example is the search for 'interesting' relationships between two individuals or between an individual and an event, which can be phrased as a search for short paths in the graph. Another example is the search for an analyst-specified threat pattern, which can be cast as an instance of subgraph isomorphism. It is important to note than many kinds of analysis are not relationship based, so these are not good candidates for semantic graphs. Thus, a semantic graph should always be used in conjunction with traditional knowledge representation and interface methods. Operations that involve looking for chains of relationships (e.g. friend of a friend) are not efficiently executable in a traditional relational database. However, the semantic graph can be thought of as a pre-join of the database, and it is ideally suited for these kinds of operations. Researchers at Sandia National Laboratories are working to facilitate semantic graph
Fast Search for Dynamic Multi-Relational Graphs
Choudhury, Sutanay; Holder, Larry; Chin, George; Feo, John T.
2013-06-23
Acting on time-critical events by processing ever growing social media or news streams is a major technical challenge. Many of these data sources can be modeled as multi-relational graphs. Continuous queries or techniques to search for rare events that typically arise in monitoring applications have been studied extensively for relational databases. This work is dedicated to answer the question that emerges naturally: how can we efficiently execute a continuous query on a dynamic graph? This paper presents an exact subgraph search algorithm that exploits the temporal characteristics of representative queries for online news or social media monitoring. The algorithm is based on a novel data structure called the that leverages the structural and semantic characteristics of the underlying multi-relational graph. The paper concludes with extensive experimentation on several real-world datasets that demonstrates the validity of this approach.
Mining Large Heterogeneous Graphs using Cray s Urika
Sukumar, Sreenivas R; Bond, Nathaniel A
2013-01-01
Pattern discovery and predictive modeling from seemingly related Big Data represented as massive, ad-hoc, heterogeneous networks (e.g., extremely large graphs with complex, possibly unknown structure) is an outstanding problem in many application domains. To address this problem, we are designing graph-mining algorithms capable of discovering relationship-patterns from such data and using those discovered patterns as features for classification and predictive modeling. Specifically, we are: (i) exploring statistical properties, mechanics and generative models of behavior patterns in heterogeneous information networks, (ii) developing novel, automated and scalable graph-pattern discovery algorithms and (iii) applying our relationship-analytics (data science + network science) expertise to domains spanning healthcare to homeland security.
On the mixing time of geographical threshold graphs
Bradonjic, Milan
2009-01-01
In this paper, we study the mixing time of random graphs generated by the geographical threshold graph (GTG) model, a generalization of random geometric graphs (RGG). In a GTG, nodes are distributed in a Euclidean space, and edges are assigned according to a threshold function involving the distance between nodes as well as randomly chosen node weights. The motivation for analyzing this model is that many real networks (e.g., wireless networks, the Internet, etc.) need to be studied by using a 'richer' stochastic model (which in this case includes both a distance between nodes and weights on the nodes). We specifically study the mixing times of random walks on 2-dimensional GTGs near the connectivity threshold. We provide a set of criteria on the distribution of vertex weights that guarantees that the mixing time is {Theta}(n log n).
Integrated Network Decompositions and Dynamic Programming for Graph Optimization (INDDGO)
Energy Science and Technology Software Center (OSTI)
2012-05-31
The INDDGO software package offers a set of tools for finding exact solutions to graph optimization problems via tree decompositions and dynamic programming algorithms. Currently the framework offers serial and parallel (distributed memory) algorithms for finding tree decompositions and solving the maximum weighted independent set problem. The parallel dynamic programming algorithm is implemented on top of the MADNESS task-based runtime.
In-Memory Graph Databases for Web-Scale Data
Castellana, Vito G.; Morari, Alessandro; Weaver, Jesse R.; Tumeo, Antonino; Haglin, David J.; Villa, Oreste; Feo, John
2015-03-01
RDF databases have emerged as one of the most relevant way for organizing, integrating, and managing expo- nentially growing, often heterogeneous, and not rigidly structured data for a variety of scientific and commercial fields. In this paper we discuss the solutions integrated in GEMS (Graph database Engine for Multithreaded Systems), a software framework for implementing RDF databases on commodity, distributed-memory high-performance clusters. Unlike the majority of current RDF databases, GEMS has been designed from the ground up to primarily employ graph-based methods. This is reflected in all the layers of its stack. The GEMS framework is composed of: a SPARQL-to-C++ compiler, a library of data structures and related methods to access and modify them, and a custom runtime providing lightweight software multithreading, network messages aggregation and a partitioned global address space. We provide an overview of the framework, detailing its component and how they have been closely designed and customized to address issues of graph methods applied to large-scale datasets on clusters. We discuss in details the principles that enable automatic translation of the queries (expressed in SPARQL, the query language of choice for RDF databases) to graph methods, and identify differences with respect to other RDF databases.
STRUCTURAL ANNOTATION OF EM IMAGES BY GRAPH CUT
Chang, Hang; Auer, Manfred; Parvin, Bahram
2009-05-08
Biological images have the potential to reveal complex signatures that may not be amenable to morphological modeling in terms of shape, location, texture, and color. An effective analytical method is to characterize the composition of a specimen based on user-defined patterns of texture and contrast formation. However, such a simple requirement demands an improved model for stability and robustness. Here, an interactive computational model is introduced for learning patterns of interest by example. The learned patterns bound an active contour model in which the traditional gradient descent optimization is replaced by the more efficient optimization of the graph cut methods. First, the energy function is defined according to the curve evolution. Next, a graph is constructed with weighted edges on the energy function and is optimized with the graph cut algorithm. As a result, the method combines the advantages of the level set method and graph cut algorithm, i.e.,"topological" invariance and computational efficiency. The technique is extended to the multi-phase segmentation problem; the method is validated on synthetic images and then applied to specimens imaged by transmission electron microscopy(TEM).
Cyber Graph Queries for Geographically Distributed Data Centers
Berry, Jonathan W.; Collins, Michael; Kearns, Aaron; Phillips, Cynthia A.; Saia, Jared
2015-05-01
We present new algorithms for a distributed model for graph computations motivated by limited information sharing we first discussed in [20]. Two or more independent entities have collected large social graphs. They wish to compute the result of running graph algorithms on the entire set of relationships. Because the information is sensitive or economically valuable, they do not wish to simply combine the information in a single location. We consider two models for computing the solution to graph algorithms in this setting: 1) limited-sharing: the two entities can share only a polylogarithmic size subgraph; 2) low-trust: the entities must not reveal any information beyond the query answer, assuming they are all honest but curious. We believe this model captures realistic constraints on cooperating autonomous data centers. We have algorithms in both setting for s - t connectivity in both models. We also give an algorithm in the low-communication model for finding a planted clique. This is an anomaly- detection problem, finding a subgraph that is larger and denser than expected. For both the low- communication algorithms, we exploit structural properties of social networks to prove perfor- mance bounds better than what is possible for general graphs. For s - t connectivity, we use known properties. For planted clique, we propose a new property: bounded number of triangles per node. This property is based upon evidence from the social science literature. We found that classic examples of social networks do not have the bounded-triangles property. This is because many social networks contain elements that are non-human, such as accounts for a business, or other automated accounts. We describe some initial attempts to distinguish human nodes from automated nodes in social networks based only on topological properties.
LDRD final report : first application of geospatial semantic graphs to SAR image data.
Brost, Randolph C.; McLendon, William Clarence,
2013-01-01
Modeling geospatial information with semantic graphs enables search for sites of interest based on relationships between features, without requiring strong a priori models of feature shape or other intrinsic properties. Geospatial semantic graphs can be constructed from raw sensor data with suitable preprocessing to obtain a discretized representation. This report describes initial work toward extending geospatial semantic graphs to include temporal information, and initial results applying semantic graph techniques to SAR image data. We describe an efficient graph structure that includes geospatial and temporal information, which is designed to support simultaneous spatial and temporal search queries. We also report a preliminary implementation of feature recognition, semantic graph modeling, and graph search based on input SAR data. The report concludes with lessons learned and suggestions for future improvements.
A Graph Analytic Metric for Mitigating Advanced Persistent Threat
Johnson, John R.; Hogan, Emilie A.
2013-06-04
This paper introduces a novel graph analytic metric that can be used to measure the potential vulnerability of a cyber network to specific types of attacks that use lateral movement and privilege escalation such as the well known Pass The Hash, (PTH). The metric is computed from an oriented subgraph of the underlying cyber network induced by selecting only those edges for which a given property holds between the two vertices of the edge. The metric with respect to a select node on the subgraph is defined as the likelihood that the select node is reachable from another arbitrary node in the graph. This metric can be calculated dynamically from the authorization and auditing layers during the network security authorization phase and will potentially enable predictive deterrence against attacks such as PTH.
Codesign Lessons Learned from Implementing Graph Matching on Multithreaded Architectures
Halappanavar, Mahantesh; Pothen, Alex; Azad, Md Ariful; Manne, Fredrik; Langguth, Johannes; Khan, Arif
2015-08-12
Co-design of algorithms and architectures is an effective way to address the performance of irregular applications on multithreaded architectures. We explore the interplay between algorithm design and architectural features using graph matching as a case study. We present the key lessons that we have learnt as a means to influence co-design of algorithms and architecture for execution of data-intensive irregular workloads.
Encoding and analyzing aerial imagery using geospatial semantic graphs
Watson, Jean-Paul; Strip, David R.; McLendon, William C.; Parekh, Ojas D.; Diegert, Carl F.; Martin, Shawn Bryan; Rintoul, Mark Daniel
2014-02-01
While collection capabilities have yielded an ever-increasing volume of aerial imagery, analytic techniques for identifying patterns in and extracting relevant information from this data have seriously lagged. The vast majority of imagery is never examined, due to a combination of the limited bandwidth of human analysts and limitations of existing analysis tools. In this report, we describe an alternative, novel approach to both encoding and analyzing aerial imagery, using the concept of a geospatial semantic graph. The advantages of our approach are twofold. First, intuitive templates can be easily specified in terms of the domain language in which an analyst converses. These templates can be used to automatically and efficiently search large graph databases, for specific patterns of interest. Second, unsupervised machine learning techniques can be applied to automatically identify patterns in the graph databases, exposing recurring motifs in imagery. We illustrate our approach using real-world data for Anne Arundel County, Maryland, and compare the performance of our approach to that of an expert human analyst.
Proximity graphs based multi-scale image segmentation
Skurikhin, Alexei N
2008-01-01
We present a novel multi-scale image segmentation approach based on irregular triangular and polygonal tessellations produced by proximity graphs. Our approach consists of two separate stages: polygonal seeds generation followed by an iterative bottom-up polygon agglomeration into larger chunks. We employ constrained Delaunay triangulation combined with the principles known from the visual perception to extract an initial ,irregular polygonal tessellation of the image. These initial polygons are built upon a triangular mesh composed of irregular sized triangles and their shapes are ad'apted to the image content. We then represent the image as a graph with vertices corresponding to the polygons and edges reflecting polygon relations. The segmentation problem is then formulated as Minimum Spanning Tree extraction. We build a successive fine-to-coarse hierarchy of irregular polygonal grids by an iterative graph contraction constructing Minimum Spanning Tree. The contraction uses local information and merges the polygons bottom-up based on local region-and edge-based characteristics.
New Developments in MadGraph/MadEvent
Alwall, Johan; Artoisenet, Pierre; de Visscher, Simon; Duhr, Claude; Frederix, Rikkert; Herquet, Michel; Mattelaer, Olivier; /IBA, Louvain-la-Neuve
2011-11-08
We here present some recent developments of MadGraph/MadEvent since the latest published version, 4.0. These developments include: Jet matching with Pythia parton showers for both Standard Model and Beyond the Standard Model processes, decay chain functionality, decay width calculation and decay simulation, process generation for the Grid, a package for calculation of quarkonium amplitudes, calculation of Matrix Element weights for experimental events, automatic dipole subtraction for next-to-leading order calculations, and an interface to FeynRules, a package for automatic calculation of Feynman rules and model files from the Lagrangian of any New Physics model.
Constructing compact and effective graphs for recommender systems via node and edge aggregations
DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)
Lee, Sangkeun; Kahng, Minsuk; Lee, Sang-goo
2014-12-10
Exploiting graphs for recommender systems has great potential to flexibly incorporate heterogeneous information for producing better recommendation results. As our baseline approach, we first introduce a naive graph-based recommendation method, which operates with a heterogeneous log-metadata graph constructed from user log and content metadata databases. Although the na ve graph-based recommendation method is simple, it allows us to take advantages of heterogeneous information and shows promising flexibility and recommendation accuracy. However, it often leads to extensive processing time due to the sheer size of the graphs constructed from entire user log and content metadata databases. In this paper, we proposemore » node and edge aggregation approaches to constructing compact and e ective graphs called Factor-Item bipartite graphs by aggregating nodes and edges of a log-metadata graph. Furthermore, experimental results using real world datasets indicate that our approach can significantly reduce the size of graphs exploited for recommender systems without sacrificing the recommendation quality.« less
Detailed Hydrographic Feature Extraction from High-Resolution LiDAR Data
Danny L. Anderson
2012-05-01
Detailed hydrographic feature extraction from high-resolution light detection and ranging (LiDAR) data is investigated. Methods for quantitatively evaluating and comparing such extractions are presented, including the use of sinuosity and longitudinal root-mean-square-error (LRMSE). These metrics are then used to quantitatively compare stream networks in two studies. The first study examines the effect of raster cell size on watershed boundaries and stream networks delineated from LiDAR-derived digital elevation models (DEMs). The study confirmed that, with the greatly increased resolution of LiDAR data, smaller cell sizes generally yielded better stream network delineations, based on sinuosity and LRMSE. The second study demonstrates a new method of delineating a stream directly from LiDAR point clouds, without the intermediate step of deriving a DEM. Direct use of LiDAR point clouds could improve efficiency and accuracy of hydrographic feature extractions. The direct delineation method developed herein and termed “mDn”, is an extension of the D8 method that has been used for several decades with gridded raster data. The method divides the region around a starting point into sectors, using the LiDAR data points within each sector to determine an average slope, and selecting the sector with the greatest downward slope to determine the direction of flow. An mDn delineation was compared with a traditional grid-based delineation, using TauDEM, and other readily available, common stream data sets. Although, the TauDEM delineation yielded a sinuosity that more closely matches the reference, the mDn delineation yielded a sinuosity that was higher than either the TauDEM method or the existing published stream delineations. Furthermore, stream delineation using the mDn method yielded the smallest LRMSE.
Discrete Mathematical Approaches to Graph-Based Traffic Analysis
Joslyn, Cliff A.; Cowley, Wendy E.; Hogan, Emilie A.; Olsen, Bryan K.
2014-04-01
Modern cyber defense and anlaytics requires general, formal models of cyber systems. Multi-scale network models are prime candidates for such formalisms, using discrete mathematical methods based in hierarchically-structured directed multigraphs which also include rich sets of labels. An exemplar of an application of such an approach is traffic analysis, that is, observing and analyzing connections between clients, servers, hosts, and actors within IP networks, over time, to identify characteristic or suspicious patterns. Towards that end, NetFlow (or more generically, IPFLOW) data are available from routers and servers which summarize coherent groups of IP packets flowing through the network. In this paper, we consider traffic analysis of Netflow using both basic graph statistics and two new mathematical measures involving labeled degree distributions and time interval overlap measures. We do all of this over the VAST test data set of 96M synthetic Netflow graph edges, against which we can identify characteristic patterns of simulated ground-truth network attacks.
INDDGO: Integrated Network Decomposition & Dynamic programming for Graph Optimization
Groer, Christopher S; Sullivan, Blair D; Weerapurage, Dinesh P
2012-10-01
It is well-known that dynamic programming algorithms can utilize tree decompositions to provide a way to solve some \\emph{NP}-hard problems on graphs where the complexity is polynomial in the number of nodes and edges in the graph, but exponential in the width of the underlying tree decomposition. However, there has been relatively little computational work done to determine the practical utility of such dynamic programming algorithms. We have developed software to construct tree decompositions using various heuristics and have created a fast, memory-efficient dynamic programming implementation for solving maximum weighted independent set. We describe our software and the algorithms we have implemented, focusing on memory saving techniques for the dynamic programming. We compare the running time and memory usage of our implementation with other techniques for solving maximum weighted independent set, including a commercial integer programming solver and a semi-definite programming solver. Our results indicate that it is possible to solve some instances where the underlying decomposition has width much larger than suggested by the literature. For certain types of problems, our dynamic programming code runs several times faster than these other methods.
Multi-Level Anomaly Detection on Time-Varying Graph Data
Bridges, Robert A; Collins, John P; Ferragut, Erik M; Laska, Jason A; Sullivan, Blair D
2015-01-01
This work presents a novel modeling and analysis framework for graph sequences which addresses the challenge of detecting and contextualizing anomalies in labelled, streaming graph data. We introduce a generalization of the BTER model of Seshadhri et al. by adding flexibility to community structure, and use this model to perform multi-scale graph anomaly detection. Specifically, probability models describing coarse subgraphs are built by aggregating probabilities at finer levels, and these closely related hierarchical models simultaneously detect deviations from expectation. This technique provides insight into a graph's structure and internal context that may shed light on a detected event. Additionally, this multi-scale analysis facilitates intuitive visualizations by allowing users to narrow focus from an anomalous graph to particular subgraphs or nodes causing the anomaly. For evaluation, two hierarchical anomaly detectors are tested against a baseline Gaussian method on a series of sampled graphs. We demonstrate that our graph statistics-based approach outperforms both a distribution-based detector and the baseline in a labeled setting with community structure, and it accurately detects anomalies in synthetic and real-world datasets at the node, subgraph, and graph levels. To illustrate the accessibility of information made possible via this technique, the anomaly detector and an associated interactive visualization tool are tested on NCAA football data, where teams and conferences that moved within the league are identified with perfect recall, and precision greater than 0.786.
A Space-Filling Visualization Technique for Multivariate Small World Graphs
Wong, Pak C.; Foote, Harlan P.; Mackey, Patrick S.; Chin, George; Huang, Zhenyu; Thomas, James J.
2012-03-15
We introduce an information visualization technique, known as GreenCurve, for large sparse graphs that exhibit small world properties. Our fractal-based design approach uses spatial cues to approximate the node connections and thus eliminates the links between the nodes in the visualization. The paper describes a sophisticated algorithm to order the neighboring nodes of a large sparse graph by solving the Fiedler vector of its graph Laplacian, and then fold the graph nodes into a space-filling fractal curve based on the Fiedler vector. The result is a highly compact visualization that gives a succinct overview of the graph with guaranteed visibility of every graph node. We show in the paper that the GreenCurve technology is (1) theoretically sustainable by introducing an error estimation metric to measure the fidelity of the new graph representation, (2) empirically rigorous by conducting a usability study to investigate its strengths and weaknesses against the traditional graph layout, and (3) pragmatically feasible by applying it to analyze stressed conditions of the large scale electric power grid on the west coast.
Have Green – A Visual Analytics Framework for Large Semantic Graphs
Wong, Pak C.; Chin, George; Foote, Harlan P.; Mackey, Patrick S.; Thomas, James J.
2006-10-29
A semantic graph is a network of heterogeneous nodes and links annotated with a domain ontology. In intelligence analysis, investigators use semantic graphs to organize concepts and relationships as graph nodes and links in hopes of discovering key trends, patterns, and insights. However, as new information continues to arrive from a multitude of sources, the size and complexity of the semantic graphs will soon overwhelm an investigator's cognitive capacity to carry out significant analyses. We introduce a powerful visual analytics framework designed to enhance investigators--natural analytical capabilities to comprehend and analyze large semantic graphs. The paper describes the overall framework design, presents major development accomplishments to date, and discusses future directions of a new visual analytics system known as Have Green.
A framework for graph-based synthesis, analysis, and visualization of HPC cluster job data.
Mayo, Jackson R.; Kegelmeyer, W. Philip, Jr.; Wong, Matthew H.; Pebay, Philippe Pierre; Gentile, Ann C.; Thompson, David C.; Roe, Diana C.; De Sapio, Vincent; Brandt, James M.
2010-08-01
The monitoring and system analysis of high performance computing (HPC) clusters is of increasing importance to the HPC community. Analysis of HPC job data can be used to characterize system usage and diagnose and examine failure modes and their effects. This analysis is not straightforward, however, due to the complex relationships that exist between jobs. These relationships are based on a number of factors, including shared compute nodes between jobs, proximity of jobs in time, etc. Graph-based techniques represent an approach that is particularly well suited to this problem, and provide an effective technique for discovering important relationships in job queuing and execution data. The efficacy of these techniques is rooted in the use of a semantic graph as a knowledge representation tool. In a semantic graph job data, represented in a combination of numerical and textual forms, can be flexibly processed into edges, with corresponding weights, expressing relationships between jobs, nodes, users, and other relevant entities. This graph-based representation permits formal manipulation by a number of analysis algorithms. This report presents a methodology and software implementation that leverages semantic graph-based techniques for the system-level monitoring and analysis of HPC clusters based on job queuing and execution data. Ontology development and graph synthesis is discussed with respect to the domain of HPC job data. The framework developed automates the synthesis of graphs from a database of job information. It also provides a front end, enabling visualization of the synthesized graphs. Additionally, an analysis engine is incorporated that provides performance analysis, graph-based clustering, and failure prediction capabilities for HPC systems.
A weak zero-one law for sequences of random distance graphs
Zhukovskii, Maksim E
2012-07-31
We study zero-one laws for properties of random distance graphs. Properties written in a first-order language are considered. For p(N) such that pN{sup {alpha}}{yields}{infinity} as N{yields}{infinity}, and (1-p)N{sup {alpha}} {yields} {infinity} as N {yields} {infinity} for any {alpha}>0, we succeed in refuting the law. In this connection, we consider a weak zero-one j-law. For this law, we obtain results for random distance graphs which are similar to the assertions concerning the classical zero-one law for random graphs. Bibliography: 18 titles.
Exotic equilibria of Harary graphs and a new minimum degree lower bound for synchronization
Canale, Eduardo A.; Monzn, Pablo
2015-02-15
This work is concerned with stability of equilibria in the homogeneous (equal frequencies) Kuramoto model of weakly coupled oscillators. In 2012 [R. Taylor, J. Phys. A: Math. Theor. 45, 115 (2012)], a sufficient condition for almost global synchronization was found in terms of the minimum degreeorder ratio of the graph. In this work, a new lower bound for this ratio is given. The improvement is achieved by a concrete infinite sequence of regular graphs. Besides, non standard unstable equilibria of the graphs studied in Wiley et al. [Chaos 16, 015103 (2006)] are shown to exist as conjectured in that work.
Omega: an Overlap-graph de novo Assembler for Meta-genomics
Haider, Bahlul; Ahn, Tae-Hyuk; Bushnell, Brian; Chai, JJ; Copeland, Alex; Pan, Chongle
2014-01-01
Motivation: Metagenomic sequencing allows reconstruction of mi-crobial genomes directly from environmental samples. Omega (overlap-graph metagenome assembler) was developed here for assembling and scaffolding Illumina sequencing data of microbial communities. Results: Omega found overlaps between reads using a prefix/suffix hash table. The overlap graph of reads was simplified by removing transitive edges and trimming small branches. Unitigs were generat-ed based on minimum cost flow analysis of the overlap graph. Obtained unitigs were merged to contigs and scaffolds using mate-pair information. Omega was compared with two de Bruijn graph assemblers, SOAPdenovo and IDBA-UD, using a publically-available Illumina sequencing dataset of a 64-genome mock com-munity. The assembly results were verified by their alignment with reference genomes. The overall performances of the three assem-blers were comparable and each assembler provided best results for a subset of genomes.
Office of Legacy Management (LM)
.........5 Water Sampling Field Activities Verification ... Groundwater Quality Data Static Water Level Data Hydrographs Time-Concentration ...
Office of Legacy Management (LM)
.........5 Water Sampling Field Activities Verification ... Groundwater Quality Data Static Water Level Data Hydrograph Time-Concentration ...
Wedge sampling for computing clustering coefficients and triangle counts on large graphs
DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)
Seshadhri, C.; Pinar, Ali; Kolda, Tamara G.
2014-05-08
Graphs are used to model interactions in a variety of contexts, and there is a growing need to quickly assess the structure of such graphs. Some of the most useful graph metrics are based on triangles, such as those measuring social cohesion. Despite the importance of these triadic measures, algorithms to compute them can be extremely expensive. We discuss the method of wedge sampling. This versatile technique allows for the fast and accurate approximation of various types of clustering coefficients and triangle counts. Furthermore, these techniques are extensible to counting directed triangles in digraphs. Our methods come with provable andmore » practical time-approximation tradeoffs for all computations. We provide extensive results that show our methods are orders of magnitude faster than the state of the art, while providing nearly the accuracy of full enumeration.« less
al-Saffar, Sinan; Joslyn, Cliff A.; Chappell, Alan R.
2011-07-18
As semantic datasets grow to be very large and divergent, there is a need to identify and exploit their inherent semantic structure for discovery and optimization. Towards that end, we present here a novel methodology to identify the semantic structures inherent in an arbitrary semantic graph dataset. We first present the concept of an extant ontology as a statistical description of the semantic relations present amongst the typed entities modeled in the graph. This serves as a model of the underlying semantic structure to aid in discovery and visualization. We then describe a method of ontological scaling in which the ontology is employed as a hierarchical scaling filter to infer different resolution levels at which the graph structures are to be viewed or analyzed. We illustrate these methods on three large and publicly available semantic datasets containing more than one billion edges each. Keywords-Semantic Web; Visualization; Ontology; Multi-resolution Data Mining;
Graph of Total Number of Oligos Within Windows of a Sequence
Energy Science and Technology Software Center (OSTI)
1995-11-28
SEQWIN is user-friendly software which graphs the total number of oligos present in a sequence. The sequence is scanned one window at a time; windows can be overlapping. Each bar on the graph represents a single window down the sequence. The user specifies the sequence of interest and a list of oligos as program input. If the sequence is known, locations of specific structure or sequences can be specified and compared with the bars onmore » a graph. The window size, amount of overlap of the windows, number of windows to be considered, and the starting position of the first window used can be adjusted at the user's discretion.« less
Powers, Sarah S.; Lothian, Joshua
2014-12-01
The benchmarking effort within the Extreme Scale Systems Center at Oak Ridge National Laboratory seeks to provide High Performance Computing benchmarks and test suites of interest to the DoD sponsor. The work described in this report is a part of the effort focusing on graph generation. A previously developed benchmark, SystemBurn, allows the emulation of a broad spectrum of application behavior profiles within a single framework. To complement this effort, similar capabilities are desired for graph-centric problems. This report described the in-depth analysis of the generated synthetic graphs' properties at a variety of scales using different generator implementations and examines their applicability to replicating real world datasets.
Sabine, C.L.; Key, R.M.; Hall, M.; Kozyr, A.
1999-08-01
This data documentation discusses the procedures and methods used to measure total carbon dioxide (TCO2), total alkalinity (TALK), and radiocarbon (delta 14C), at hydrographic stations, as well as the underway partial pressure of CO2 (pCO2) during the R/V Thomas G. Thompson oceanographic cruise in the Pacific Ocean (Section P10). Conducted as part of the World Ocean Circulation Experiment (WOCE), the cruise began in Suva, Fiji, on October 5, 1993, and ended in Yokohama, Japan, on November 10, 1993. Measurements made along WOCE Section P10 included pressure, temperature, salinity [measured by conductivity temperature, and depth sensor (CTD)], bottle salinity, bottle oxygen, phosphate, nitrate, silicate, chlorofluorocarbons (CFC-11, CFC-12), TCO2, TALK, delta 14C, and underway pCO2.
Aizenman, Michael; Warzel, Simone
2012-09-15
We discuss the dynamical implications of the recent proof that for a quantum particle in a random potential on a regular tree graph absolutely continuous (ac) spectrum occurs non-perturbatively through rare fluctuation-enabled resonances. The main result is spelled in the title.
Quantum dynamics via Planck-scale-stepped action-carrying 'Graph Paths'
Chew, Geoffrey F.
2003-05-05
A divergence-free, parameter-free, path-based discrete-time quantum dynamics is designed to not only enlarge the achievements of general relativity and the standard particle model, by approximations at spacetime scales far above Planck scale while far below Hubble scale, but to allow tackling of hitherto inaccessible questions. ''Path space'' is larger than and precursor to Hilbert-space basis. The wave-function-propagating paths are action-carrying structured graphs-cubic and quartic structured vertices connected by structured ''fermionic'' or ''bosonic'' ''particle'' and ''nonparticle'' arcs. A Planck-scale path step determines the gravitational constant while controlling all graph structure. The basis of the theory's (zero-rest-mass) elementary-particle Hilbert space (which includes neither gravitons nor scalar bosons) resides in particle arcs. Nonparticle arcs within a path are responsible for energy and rest mass.
Exact scattering matrix of graphs in magnetic field and quantum noise
Caudrelier, Vincent; Mintchev, Mihail; Ragoucy, Eric
2014-08-15
We consider arbitrary quantum wire networks modelled by finite, noncompact, connected quantum graphs in the presence of an external magnetic field. We find a general formula for the total scattering matrix of the network in terms of its local scattering properties and its metric structure. This is applied to a quantum ring with N external edges. Connecting the external edges of the ring to heat reservoirs, we study the quantum transport on the graph in ambient magnetic field. We consider two types of dynamics on the ring: the free Schrdinger and the free massless Dirac equations. For each case, a detailed study of the thermal noise is performed analytically. Interestingly enough, in presence of a magnetic field, the standard linear Johnson-Nyquist law for the low temperature behaviour of the thermal noise becomes nonlinear. The precise regime of validity of this effect is discussed and a typical signature of the underlying dynamics is observed.
The d-edge shortest-path problem for a Monge graph
Bein, W.W.; Larmore, L.L.; Park, J.K.
1992-07-14
A complete edge-weighted directed graph on vertices 1,2,...,n that assigns cost c(i,j) to the edge (i,j) is called Monge if its edge costs form a Monge array, i.e., for all i < k and j < l, c[i, j]+c[k,l]{le} < c[i,l]+c[k,j]. One reason Monge graphs are interesting is that shortest paths can be computed quite quickly in such graphs. In particular, Wilber showed that the shortest path from vertex 1 to vertex n of a Monge graph can be computed in O(n) time, and Aggarwal, Klawe, Moran, Shor, and Wilber showed that the shortest d-edge 1-to-n path (i.e., the shortest path among all 1-to-n paths with exactly d edges) can be computed in O(dn) time. This paper`s contribution is a new algorithm for the latter problem. Assuming 0 {le} c[i,j] {le} U and c[i,j + 1] + c[i + 1,j] {minus} c[i,j] {minus} c[i + 1, j + 1] {ge} L > 0 for all i and j, our algorithm runs in O(n(1 + 1g(U/L))) time. Thus, when d {much_gt} 1 + 1g(U/L), our algorithm represents a significant improvement over Aggarwal et al.`s O(dn)-time algorithm. We also present several applications of our algorithm; they include length-limited Huffman coding, finding the maximum-perimeter d-gon inscribed in a given convex n-gon, and a digital-signal-compression problem.
2007 CBECS Large Hospital Building FAQs: 2003-2007 Comparison Graphs
Gasoline and Diesel Fuel Update (EIA)
FAQs: 2003-2007 Comparison Graphs Main Report | Methodology | FAQ | List of Tables CBECS 2007 - Release date: August 17, 2012 Jump to: Figure 1 | Figure 2 | Figure 3 | Figure 4 | Figure 5 Figure 1 Number of Large Hospital Buildings and 95% Confidence Intervals by Census Region, 2003 and 2007 Figure 2 Total Floorspace and 95% Confidence Intervals in Large Hospital Buildings by Census Region, 2003 and 2007 Figure 3 Major Fuel Intensity and 95% Confidence Intervals by Census Region, 2003 and 2007
Madduri, Kamesh; Bader, David A.
2009-02-15
Graph-theoretic abstractions are extensively used to analyze massive data sets. Temporal data streams from socioeconomic interactions, social networking web sites, communication traffic, and scientific computing can be intuitively modeled as graphs. We present the first study of novel high-performance combinatorial techniques for analyzing large-scale information networks, encapsulating dynamic interaction data in the order of billions of entities. We present new data structures to represent dynamic interaction networks, and discuss algorithms for processing parallel insertions and deletions of edges in small-world networks. With these new approaches, we achieve an average performance rate of 25 million structural updates per second and a parallel speedup of nearly28 on a 64-way Sun UltraSPARC T2 multicore processor, for insertions and deletions to a small-world network of 33.5 million vertices and 268 million edges. We also design parallel implementations of fundamental dynamic graph kernels related to connectivity and centrality queries. Our implementations are freely distributed as part of the open-source SNAP (Small-world Network Analysis and Partitioning) complex network analysis framework.
Scaling Graph Community Detection on the Tilera Many-core Architecture
Chavarría-Miranda, Daniel; Halappanavar, Mahantesh; Kalyanaraman, Anantharaman
2014-12-01
In an era when power constraints and data movement are proving to be significant barriers for the application of high-end computing, the Tilera many-core architecture offers a low-power platform exhibiting many important characteristics of future systems, including a large number of simple cores, a sophisticated network-on-chip, and fine-grained control over memory and caching policies. While this emerging architecture has been previously studied for structured compute-intensive kernels, benchmarking the platform for data-bound, irregular applications present significant challenges that have remained unexplored. Community detection is an advanced prototypical graph-theoretic operation with applications in numerous scientific domains including life sciences, cyber security, and power systems. In this work, we explore multiple design strategies toward developing a scalable tool for community detection on the Tilera platform. Using several memory layout and work scheduling techniques we demonstrate speedups of up to 46x on 36 cores of the Tilera TileGX36 platform over the best serial implementation, and also show results that have comparable quality and performance to mainstream x86 platforms. To the best of our knowledge this is the first work addressing graph algorithms on the Tilera platform. This study demonstrates that through careful design space exploration, low-power many-core platforms like Tilera can be effectively exploited for graph algorithms that that embody all the essential characteristics of an irregular application.
Grines, V Z; Pochinka, O V; Kapkaeva, S Kh
2014-10-31
In apaper of Oshemkov and Sharko, three-colour graphs were used to make the topological equivalence of Morse-Smale flows on surfaces obtained by Peixoto more precise. In the present paper, in the language of three-colour graphs equipped with automorphisms, we obtain acomplete (including realization) topological classification of gradient-like cascades on surfaces. Bibliography: 25 titles.
Contig Graph Tool: A graphical interface for Contig Physical Map assembly
Pecherer, R.M.
1992-01-01
A Contig Physical Map of a chromosome is a collection of DNA clones organized into ordered, overlapping sets called contigs which cover contiguous regions of the chromosome. Contigs may be assembled from a knowledge of the binary overlap relation between all clone pairs in a clone set which covers all or part of the chromosome, and contigs may be positioned along the chromosome by in situ hybridization using unique probes from each contig. Clone overlap is determined experimentally by factoring each clone into restriction fragments that are characterized by size and hybridization probe signals. Clones which overlap therefore share common restriction fragments, making overlap detectable. However, non-uniqueness of restriction fragments and experimental error lead to incorrect determination of the overlap relation and errors in the contig map. The Contig Graph Tool was developed to detect and correct overlap errors using editable visualizations of an abstract graph representation for clones and overlaps. This interactive tool is integrated with an electronic, laboratory notebook and introduces several concepts useful for solving problems with discrete, scientific visualization.
Pattern analysis of directed graphs using DEDICOM: an application to Enron email.
Bader, Brett William; Harshman, Richard A. (University of Western Ontario London, Ontario, Canada); Kolda, Tamara Gibson
2006-12-01
DEDICOM is a linear algebra model for analyzing intrinsically asymmetric relationships, such as trade among nations or the exchange of emails among individuals. DEDICOM decomposes a complex pattern of observed relations among objects into a sum of simpler patterns of inferred relations among latent components of the objects. Three-way DEDICOM is a higher-order extension of the model that incorporates a third mode of the data, such as time, giving it stronger uniqueness properties and consequently enhancing interpretability of solutions. In this paper, we present algorithms for computing these decompositions on large, sparse data as well as a variant for computing an asymmetric nonnegative factorization. When we apply these techniques to adjacency arrays arising from directed graphs with edges labeled by time, we obtain a smaller graph on latent semantic dimensions and gain additional information about their changing relationships over time. We demonstrate these techniques on the Enron email corpus to learn about the social networks and their transient behavior. The mixture of roles assigned to individuals by DEDICOM showed strong correspondence with known job classifications and revealed the patterns of communication between these roles. Changes in the communication pattern over time, e.g., between top executives and the legal department, were also apparent in the solutions.
A Selectivity based approach to Continuous Pattern Detection in Streaming Graphs
Choudhury, Sutanay; Holder, Larry; Chin, George; Agarwal, Khushbu; Feo, John T.
2015-02-02
Cyber security is one of the most significant technical challenges in current times. Detecting adversarial activities, prevention of theft of intellectual properties and customer data is a high priority for corporations and government agencies around the world. Cyber defenders need to analyze massive-scale, high-resolution network flows to identify, categorize, and mitigate attacks involving net- works spanning institutional and national boundaries. Many of the cyber attacks can be described as subgraph patterns, with promi- nent examples being insider infiltrations (path queries), denial of service (parallel paths) and malicious spreads (tree queries). This motivates us to explore subgraph matching on streaming graphs in a continuous setting. The novelty of our work lies in using the subgraph distributional statistics collected from the streaming graph to determine the query processing strategy. We introduce a Lazy Search" algorithm where the search strategy is decided on a vertex-to-vertex basis depending on the likelihood of a match in the vertex neighborhood. We also propose a metric named Relative Selectivity" that is used to se- lect between different query processing strategies. Our experiments performed on real online news, network traffic stream and a syn- thetic social network benchmark demonstrate 10-100x speedups over selectivity agnostic approaches.
Stracuzzi, David John; Brost, Randolph C.; Phillips, Cynthia A.; Robinson, David G.; Wilson, Alyson G.; Woodbridge, Diane M. -K.
2015-09-26
Geospatial semantic graphs provide a robust foundation for representing and analyzing remote sensor data. In particular, they support a variety of pattern search operations that capture the spatial and temporal relationships among the objects and events in the data. However, in the presence of large data corpora, even a carefully constructed search query may return a large number of unintended matches. This work considers the problem of calculating a quality score for each match to the query, given that the underlying data are uncertain. As a result, we present a preliminary evaluation of three methods for determining both match quality scores and associated uncertainty bounds, illustrated in the context of an example based on overhead imagery data.
DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)
Stracuzzi, David John; Brost, Randolph C.; Phillips, Cynthia A.; Robinson, David G.; Wilson, Alyson G.; Woodbridge, Diane M. -K.
2015-09-26
Geospatial semantic graphs provide a robust foundation for representing and analyzing remote sensor data. In particular, they support a variety of pattern search operations that capture the spatial and temporal relationships among the objects and events in the data. However, in the presence of large data corpora, even a carefully constructed search query may return a large number of unintended matches. This work considers the problem of calculating a quality score for each match to the query, given that the underlying data are uncertain. As a result, we present a preliminary evaluation of three methods for determining both match qualitymore » scores and associated uncertainty bounds, illustrated in the context of an example based on overhead imagery data.« less
Kozyr, Alex
2005-06-30
This documentation discusses the procedures and methods used to measure total carbon dioxide (TCO_{2}), total alkalinity (TALK), and pH at hydrographic stations during the R/V Maurice Ewing cruise in the South Atlantic Ocean on the A17 WOCE section. Conducted as part of the World Ocean Circulation Experiment (WOCE), this cruise was also a part of the French WOCE program consisting of three expeditions (CITHER 1, 2, and 3) focused on the South Atlantic Ocean. The A17 section was occupied during the CITHER 2 expedition, which began in Montevideo, Uruguay, on January 4, 1994 and finished in Cayenne, French Guyana, on March 21, 1994. During this period the ship stopped in Salvador de Bahia and Recife, Brazil, to take on supplies and exchange personnel. Upon completion of the cruise the ship transited to Fort de France, Martinique. Instructions for accessing the data are provided.
Lamb, M.F.; Feely, R.A.; Moore, L.
1995-10-01
In support of the National Oceanic and Atmospheric Administration (NOAA) Climate and Global Change (C&GC) Program, Pacific Marine Environmental Laboratory (PMEL) scientists have been measuring the growing burden of greenhouse gases in the thermocline waters of the Pacific Ocean since 1980. Collection of data at a series of hydrographic stations along longitude 170{degrees} W during austral autumn of 1990 was designed to enhance understanding of the increase in the column burden of chlorofluorocarbons and carbon dioxide in the thermocline waters since the last expedition in 1984. This document presents the procedures and methods used to obtain total carbon dioxide (TCO{sub 2}), hydrographic, and nitrate data during the NOAA/PMEL research vessel (R/V) Malcolm Baldrige CGC-90 Cruise. Data were collected along two legs; sampling for Leg 1 began along 170{degrees} W from 15{degrees} S to 60{degrees} S, then angled northwest toward New Zealand across the Western Boundary Current. Leg 2 included a reoccupation of some stations between 30{degrees} S and 15{degrees} S on 170{degrees} W and measurements from 15{degrees} S to 5{degrees} N along 170{degrees} W. The following data report summarizes the TCO{sub 2}, salinity, temperature, and nitrate measurements from 63 stations. The TCO, concentration in seawater samples was measured using a coulometric/extraction system (Models 5011 and 5030, respectively) originated by Ken Johnson. The NOAA/PMEL R/V Malcolm Baldrige CGC-90 Cruise data set is available without charge as a numeric data package (NDP) from the Carbon Dioxide Information Analysis Center. The NDP consists of two oceanographic data files, two FORTRAN 77 data retrieval routine files, a {open_quotes}readme{close_quotes} file, and this printed documentation, which describes the contents and format of all files as well as the procedures and methods used to obtain the data.
PyDecay/GraphPhys: A Unified Language and Storage System for Particle Decay Process Descriptions
Dunietz, Jesse N.; /MIT /SLAC
2011-06-22
To ease the tasks of Monte Carlo (MC) simulation and event reconstruction (i.e. inferring particle-decay events from experimental data) for long-term BaBar data preservation and analysis, the following software components have been designed: a language ('GraphPhys') for specifying decay processes, common to both simulation and data analysis, allowing arbitrary parameters on particles, decays, and entire processes; an automated visualization tool to show graphically what decays have been specified; and a searchable database storage mechanism for decay specifications. Unlike HepML, a proposed XML standard for HEP metadata, the specification language is designed not for data interchange between computer systems, but rather for direct manipulation by human beings as well as computers. The components are interoperable: the information parsed from files in the specification language can easily be rendered as an image by the visualization package, and conversion between decay representations was implemented. Several proof-of-concept command-line tools were built based on this framework. Applications include building easier and more efficient interfaces to existing analysis tools for current projects (e.g. BaBar/BESII), providing a framework for analyses in future experimental settings (e.g. LHC/SuperB), and outreach programs that involve giving students access to BaBar data and analysis tools to give them a hands-on feel for scientific analysis.
PylotDB - A Database Management, Graphing, and Analysis Tool Written in Python
2012-01-04
PylotDB, written completely in Python, provides a user interface (UI) with which to interact with, analyze, graph data from, and manage open source databases such as MySQL. The UI mitigates the user having to know in-depth knowledge of the database application programming interface (API). PylotDB allows the user to generate various kinds of plots from user-selected data; generate statistical information on text as well as numerical fields; backup and restore databases; compare database tables across different databases as well as across different servers; extract information from any field to create new fields; generate, edit, and delete databases, tables, and fields; generate or read into a table CSV data; and similar operations. Since much of the database information is brought under control of the Python computer language, PylotDB is not intended for huge databases for which MySQL and Oracle, for example, are better suited. PylotDB is better suited for smaller databases that might be typically needed in a small research group situation. PylotDB can also be used as a learning tool for database applications in general.
Streaming data analytics via message passing with application to graph algorithms
Plimpton, Steven J.; Shead, Tim
2014-05-06
The need to process streaming data, which arrives continuously at high-volume in real-time, arises in a variety of contexts including data produced by experiments, collections of environmental or network sensors, and running simulations. Streaming data can also be formulated as queries or transactions which operate on a large dynamic data store, e.g. a distributed database. We describe a lightweight, portable framework named PHISH which enables a set of independent processes to compute on a stream of data in a distributed-memory parallel manner. Datums are routed between processes in patterns defined by the application. PHISH can run on top of either message-passing via MPI or sockets via ZMQ. The former means streaming computations can be run on any parallel machine which supports MPI; the latter allows them to run on a heterogeneous, geographically dispersed network of machines. We illustrate how PHISH can support streaming MapReduce operations, and describe streaming versions of three algorithms for large, sparse graph analytics: triangle enumeration, subgraph isomorphism matching, and connected component finding. Lastly, we also provide benchmark timings for MPI versus socket performance of several kernel operations useful in streaming algorithms.
Streaming data analytics via message passing with application to graph algorithms
DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)
Plimpton, Steven J.; Shead, Tim
2014-05-06
The need to process streaming data, which arrives continuously at high-volume in real-time, arises in a variety of contexts including data produced by experiments, collections of environmental or network sensors, and running simulations. Streaming data can also be formulated as queries or transactions which operate on a large dynamic data store, e.g. a distributed database. We describe a lightweight, portable framework named PHISH which enables a set of independent processes to compute on a stream of data in a distributed-memory parallel manner. Datums are routed between processes in patterns defined by the application. PHISH can run on top of eithermore » message-passing via MPI or sockets via ZMQ. The former means streaming computations can be run on any parallel machine which supports MPI; the latter allows them to run on a heterogeneous, geographically dispersed network of machines. We illustrate how PHISH can support streaming MapReduce operations, and describe streaming versions of three algorithms for large, sparse graph analytics: triangle enumeration, subgraph isomorphism matching, and connected component finding. Lastly, we also provide benchmark timings for MPI versus socket performance of several kernel operations useful in streaming algorithms.« less
PylotDB - A Database Management, Graphing, and Analysis Tool Written in Python
Energy Science and Technology Software Center (OSTI)
2012-01-04
PylotDB, written completely in Python, provides a user interface (UI) with which to interact with, analyze, graph data from, and manage open source databases such as MySQL. The UI mitigates the user having to know in-depth knowledge of the database application programming interface (API). PylotDB allows the user to generate various kinds of plots from user-selected data; generate statistical information on text as well as numerical fields; backup and restore databases; compare database tables acrossmore » different databases as well as across different servers; extract information from any field to create new fields; generate, edit, and delete databases, tables, and fields; generate or read into a table CSV data; and similar operations. Since much of the database information is brought under control of the Python computer language, PylotDB is not intended for huge databases for which MySQL and Oracle, for example, are better suited. PylotDB is better suited for smaller databases that might be typically needed in a small research group situation. PylotDB can also be used as a learning tool for database applications in general.« less
A Reasoning And Hypothesis-Generation Framework Based On Scalable Graph Analytics
Sukumar, Sreenivas Rangan
2016-01-01
Finding actionable insights from data has always been difficult. As the scale and forms of data increase tremendously, the task of finding value becomes even more challenging. Data scientists at Oak Ridge National Laboratory are leveraging unique leadership infrastructure (e.g. Urika-XA and Urika-GD appliances) to develop scalable algorithms for semantic, logical and statistical reasoning with unstructured Big Data. We present the deployment of such a framework called ORiGAMI (Oak Ridge Graph Analytics for Medical Innovations) on the National Library of Medicine s SEMANTIC Medline (archive of medical knowledge since 1994). Medline contains over 70 million knowledge nuggets published in 23.5 million papers in medical literature with thousands more added daily. ORiGAMI is available as an open-science medical hypothesis generation tool - both as a web-service and an application programming interface (API) at http://hypothesis.ornl.gov . Since becoming an online service, ORIGAMI has enabled clinical subject-matter experts to: (i) discover the relationship between beta-blocker treatment and diabetic retinopathy; (ii) hypothesize that xylene is an environmental cancer-causing carcinogen and (iii) aid doctors with diagnosis of challenging cases when rare diseases manifest with common symptoms. In 2015, ORiGAMI was featured in the Historical Clinical Pathological Conference in Baltimore as a demonstration of artificial intelligence to medicine, IEEE/ACM Supercomputing and recognized as a Centennial Showcase Exhibit at the Radiological Society of North America (RSNA) Conference in Chicago. The final paper will describe the workflow built for the Cray Urika-XA and Urika-GD appliances that is able to reason with the knowledge of every published medical paper every time a clinical researcher uses the tool.
Office of Legacy Management (LM)
.........7 Water Sampling Field Activities Verification ... Groundwater Quality Data Static Water Level Data Time-Concentration Graphs ...
Office of Legacy Management (LM)
.........5 Water Sampling Field Activities Verification ... Groundwater Quality Data Surface Water Quality Data Time-Concentration Graph ...
Office of Legacy Management (LM)
.........5 Water Sampling Field Activities Verification ... Quality Data Equipment Blank Data Static Water Level Data Time-Concentration Graphs ...
Office of Legacy Management (LM)
.........5 Water Sampling Field Activities Verification ... Groundwater Quality Data Static Water Level Data Time-Concentration Graphs ...
Office of Legacy Management (LM)
.........3 Water Sampling Field Activities Verification ... Groundwater Quality Data Surface Water Quality Data Time-Concentration Graphs ...
Guenther, P.R.; Keeling, C.D.; Emanuele, G. III
1991-12-31
The Office of Health and Environmental Research, of the US Department of Energy (DOE), actively supports global survey investigations of carbon dioxide in the oceans. This large scale study is in conjunction with the hydrographic program of the World Ocean Circulation Experiment (WOCE/HP). On ocean cruises operated by WOCE/HP, carbon dioxide analysis groups, from various oceanographic institutions, perform shipboard chemical measurements of the inorganic carbon system in the ocean. Measurements of total dissolved inorganic carbon (DIC) are of central importance to this carbon survey. Shipboard measurements of DIC were made by employing a coulometric technique. The majority of coulometric measurements were made on an integrated automatic device, the Single Operator Multi-Parameter Metabolic Analyzer (SOMMA). In addition to DIC determinations, shipboard analytical groups measured at least one additional parameter of sea water carbon chemistry. This was done to more fully characterize the inorganic carbon system of the sea water sample. This thechnical data report presents DIC and ALK measurements performed in the SIO laboratory on replicate samples collected on the five expedition legs of the WOCE/HP cruises.
3D liver segmentation using multiple region appearances and graph cuts
Peng, Jialin Zhang, Hongbo; Hu, Peijun; Lu, Fang; Kong, Dexing; Peng, Zhiyi
2015-12-15
Purpose: Efficient and accurate 3D liver segmentations from contrast-enhanced computed tomography (CT) images play an important role in therapeutic strategies for hepatic diseases. However, inhomogeneous appearances, ambiguous boundaries, and large variance in shape often make it a challenging task. The existence of liver abnormalities poses further difficulty. Despite the significant intensity difference, liver tumors should be segmented as part of the liver. This study aims to address these challenges, especially when the target livers contain subregions with distinct appearances. Methods: The authors propose a novel multiregion-appearance based approach with graph cuts to delineate the liver surface. For livers with multiple subregions, a geodesic distance based appearance selection scheme is introduced to utilize proper appearance constraint for each subregion. A special case of the proposed method, which uses only one appearance constraint to segment the liver, is also presented. The segmentation process is modeled with energy functions incorporating both boundary and region information. Rather than a simple fixed combination, an adaptive balancing weight is introduced and learned from training sets. The proposed method only calls initialization inside the liver surface. No additional constraints from user interaction are utilized. Results: The proposed method was validated on 50 3D CT images from three datasets, i.e., Medical Image Computing and Computer Assisted Intervention (MICCAI) training and testing set, and local dataset. On MICCAI testing set, the proposed method achieved a total score of 83.4 ± 3.1, outperforming nonexpert manual segmentation (average score of 75.0). When applying their method to MICCAI training set and local dataset, it yielded a mean Dice similarity coefficient (DSC) of 97.7% ± 0.5% and 97.5% ± 0.4%, respectively. These results demonstrated the accuracy of the method when applied to different computed tomography (CT) datasets
Hively, Lee M.
2014-09-16
Data collected from devices and human condition may be used to forewarn of critical events such as machine/structural failure or events from brain/heart wave data stroke. By monitoring the data, and determining what values are indicative of a failure forewarning, one can provide adequate notice of the impending failure in order to take preventive measures. This disclosure teaches a computer-based method to convert dynamical numeric data representing physical objects (unstructured data) into discrete-phase-space states, and hence into a graph (structured data) for extraction of condition change.
3D automatic anatomy segmentation based on iterative graph-cut-ASM
Chen, Xinjian; Bagci, Ulas
2011-08-15
Purpose: This paper studies the feasibility of developing an automatic anatomy segmentation (AAS) system in clinical radiology and demonstrates its operation on clinical 3D images. Methods: The AAS system, the authors are developing consists of two main parts: object recognition and object delineation. As for recognition, a hierarchical 3D scale-based multiobject method is used for the multiobject recognition task, which incorporates intensity weighted ball-scale (b-scale) information into the active shape model (ASM). For object delineation, an iterative graph-cut-ASM (IGCASM) algorithm is proposed, which effectively combines the rich statistical shape information embodied in ASM with the globally optimal delineation capability of the GC method. The presented IGCASM algorithm is a 3D generalization of the 2D GC-ASM method that they proposed previously in Chen et al.[Proc. SPIE, 7259, 72590C1-72590C-8 (2009)]. The proposed methods are tested on two datasets comprised of images obtained from 20 patients (10 male and 10 female) of clinical abdominal CT scans, and 11 foot magnetic resonance imaging (MRI) scans. The test is for four organs (liver, left and right kidneys, and spleen) segmentation, five foot bones (calcaneus, tibia, cuboid, talus, and navicular). The recognition and delineation accuracies were evaluated separately. The recognition accuracy was evaluated in terms of translation, rotation, and scale (size) error. The delineation accuracy was evaluated in terms of true and false positive volume fractions (TPVF, FPVF). The efficiency of the delineation method was also evaluated on an Intel Pentium IV PC with a 3.4 GHZ CPU machine. Results: The recognition accuracies in terms of translation, rotation, and scale error over all organs are about 8 mm, 10 deg. and 0.03, and over all foot bones are about 3.5709 mm, 0.35 deg. and 0.025, respectively. The accuracy of delineation over all organs for all subjects as expressed in TPVF and FPVF is 93.01% and 0.22%, and
Wallace, D.W.R.; Behrens, W.J.; Hopkins, T.S.; Kinder, C.; Deming, J.; Smith, W.O.; Top, Z.; Walsh, I.D.
1995-06-01
The Northeast Water Polynya (NEW) off the northeast coast of Greenland was the focus of two cruises aboard the USCGC Polar Sea during the summers of 1992 and 1993. The cruises were supported by the National Science Foundation Arctic Systems Science (ARCSS) program and were part of the Arctic Ocean Science Board`s International Arctic Polynya Program. The Polar Sea cruises were designed as multidisciplinary studies to test hypotheses about the mechanisms of heat, water and carbon flow within and beyond the boundaries of the polynya. Preliminary results of the 1992 study have been described elsewhere. A collection of papers arising from the 1992 cruise have been published in a Special Section of the Journal of Geophysical Research. This data report presents the hydrographic and basic chemical observations made from CTD/Rosette casts during the 1992 cruise. The station positions cruise are plotted in Figure 1. Also included in the report are selected section plots and vertical profiles. A total of 130 CTD casts were made during the cruise, measuring pressure, temperature, conductivity, dissolved oxygen, fluorescence and light transmission. Discrete samples were collected in 10-liter, rosette-mounted, Niskin bottles and analyzed, from most casts, for: salinity, dissolved nutrients, dissolved oxygen, anthropogenic halocarbons (e.g., Freon gases), pigments, particulate organic carbon and nitrogen. Suspended particulate matter was analyzed at selected stations and these data were used to calibrate the CTD-transmissometer. Samples were collected from selected stations and depths for tritium and helium analyses, carbonate chemistry, as well as for measurements of bacterial abundance.
On the Ramsey numbers for complete distance graphs with vertices in {l_brace}0,1{r_brace}{sup n}
Mikhailov, Kirill A; Raigorodskii, Andrei M [M. V. Lomonosov Moscow State University, Faculty of Mechanics and Mathematics, Moscow (Russian Federation)
2009-12-31
A new problem of Ramsey type is posed for complete distance graphs in R{sup n} with vertices in the Boolean cube. This problem is closely related to the classical Nelson-Erdos-Hadwiger problem on the chromatic number of a space. Several quite sharp estimates are obtained for certain numerical characteristics that appear in the framework of the problem. Bibliography: 15 titles.
Rubin, S.; Goddard, J.G.; Chipman, D.W.; Takahashi, Taro; Sutherland, S.C.; Reid, J.L.; Swift, J.H.; Talley, L.D.
1998-06-01
This data documentation discusses the procedures and methods used to measure total carbon dioxide concentration (TCO{sub 2}) and partial pressure of CO{sub 2} (pCO{sub 2}) in discrete water samples collected during three expeditions of the Research Vessel (R/V) Knorr in the South Pacific Ocean. Conducted as part of the World Ocean Circulation Experiment (WOCE), the first cruise (WOCE Section P16A/P17A) began in Papeete, Tahiti, French Polynesia, on October 6, 1992, and returned to Papeete on November 25, 1992. The second cruise (WOCE Section P17E/P19S) began in Papeete on December 4, 1992, and finished in Punta Arenas, Chile, on January 22, 1993. The third expedition (WOCE Section P19C) started in Punta Arenas, on February 22 and finished in Panama City, Panama, on April 13, 1993. During the three expeditions, 422 hydrographic stations were occupied. Hydrographic and chemical measurements made along WOCE Sections P16A/P17A, P17E/P19S, and P19C included pressure, temperature, salinity, and oxygen [measured by conductivity, temperature, and depth (CTD) sensor], as well as discrete measurements of salinity, oxygen, phosphate, nitrate, nitrite, silicate, chlorofluorocarbons (CFC-11, CFC-12), TCO{sub 2}, and pCO{sub 2} measured at 4 and 20 C. In addition, potential temperatures were calculated from the measured variables.
Spin polarisation of tt¯γγ production at NLO+PS with GoSam interfaced to MadGraph5_aMC@NLO
DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)
van Deurzen, Hans; Frederix, Rikkert; Hirschi, Valentin; Luisoni, Gionata; Mastrolia, Pierpaolo; Ossola, Giovanni
2016-04-22
Here, we present an interface between the multipurpose Monte Carlo tool MadGraph5_aMC@NLO and the automated amplitude generator GoSam. As a first application of this novel framework, we compute the NLO corrections to pp→ tt¯H and pp→ tt¯γγ matched to a parton shower. In the phenomenological analyses of these processes, we focus our attention on observables which are sensitive to the polarisation of the top quarks.
1996-03-01
This article is the February 1996 data report, which includes: (1) a summary of February`s transactions, (2) monthly price range data for the previous 15 years, (3) contract prices for natural uranium, and (4) separative work unit price data.
Energy Science and Technology Software Center (OSTI)
2014-08-14
RolX takes the features from Re-FeX or any other feature matrix as input and outputs role assignments (clusters). The output of RolX is a csv file containing the node-role memberships and a csv file containing the role-feature definitions.
1991-12-31
This data documentation discusses the procedures and methods used to measure total carbon dioxide (TCO{sub 2}), discrete partial pressure of TCO{sub 2} (pCO{sub 2}), and total alkalinity (TALK), during the Research Vessel (R/V) Thomas Washington TUNES Leg 2 Expedition in the central South Pacific Ocean. Conducted as part of the World Ocean Circulation Experiment (WOCE), the cruise began in Papeete, Tahiti, French Polynesia, on July 16, 1991, and returned to Papeete on August 25, 1991. WOCE Meridional Sections P17S along 135{degrees} W and P16S along 150{degrees} W were completed during the 40-day expedition. A total of 97 hydrographic stations were occupied. Hydrographic and chemical measurements made along WOCE Sections P17S and P16S included pressure, temperature, salinity, and oxygen measured by conductivity, temperature and depth sensor; bottle salinity; oxygen; phosphate; nitrate; nitrite; silicate; CFC-12; CFC- 11; TCO{sub 2}; TALK; and pCO{sub 2} measured at 20{degrees}C. The TCO{sub 2} concentration in 1000 seawater samples was determined with a coulometric analysis system, the pCO{sub 2} in 940 water samples was determined with an equilibrator/gas chromatograph system, while the TALK concentration in 139 samples was determined on shore at the laboratory of C. Goyet of Woods Hole Oceanographic Institution with an alkalinity titration system. In addition, 156 coulometric measurements for the Certified Reference Material (Batch {number_sign}6) were made and yielded a mean value of 2303.2 {plus_minus} 1.5 {mu}mol/kg. This mean value agrees within a standard deviation of the 2304.6 {plus_minus} 1.6 {mu}mol/kg (N=9) value determined with the manometer of C. D. Keeling at Scripps Institution of Oceanography (SIO). Replicate samples from 11 Niskin bottles at 4 stations were also collected for later shore-based reference analyses of TCO{sub 2} and TALK by vacuum extraction and manometry in the laboratory of C. D. Keeling of SIO.
Kozyr, Alex
2006-08-30
This report presents methods, and analytical and quality control procedures for salinity, oxygen, nutrient, inorganic carbon, organic carbon, chlorofluorocarbon (CFC), and bomb ^{14}C system parameters performed during the A16S_2005 cruise, which took place from January 11 to February 24, 2005, aboard research vessel (R/V) Ronald H. Brown under the auspices of the National Oceanic and Atmospheric Administration (NOAA). The R/V Ronald H. Brown departed Punta Arenas, Chile, on January 11, 2005, and ended its cruise in Fortaleza, Brazil, on February 24, 2005. The research conducted was one of a series of repeat hydrography sections jointly funded by NOAA and the National Science Foundation as part of the CLIVAR/CO_{2}/repeat hydrography/tracer program. Samples were taken from 36 depths at 121 stations. The data presented in this report include the analyses of water samples for total inorganic carbon (TCO_{2}), fugacity of CO_{2} (fCO_{2}), total alkalinity (TALK), pH, dissolved organic carbon (DOC), CFC, ^{14}C, hydrographic, and other chemical measurements. The R/V Ronald H. Brown A16S_2005 data set is available free of charge as a numeric data package (NDP) from the Carbon Dioxide Information Analysis Center (CDIAC). The NDP consists of the oceanographic data files and this printed documentation, which describes the procedures and methods used to obtain the data.
Kozyr, A.
1998-12-01
This data documentation discusses the procedures and methods used to measure total carbon dioxide (TCO{sub 2}) and total alkalinity (TALK) at hydrographic stations, as well as the underway partial pressure of CO{sub 2} (pCO{sub 2}) during the R/V Meteor Cruise 22/5 in the South Atlantic Ocean (Section A10). Conducted as part of the World Ocean Circulation Experiment (WOCE), the cruise began in Rio de Janeiro on December 27, 1992, and ended after 36 days at sea in Capetown, South Africa, on January 31, 1993. Measurements made along WOCE Section A10 included pressure, temperature, and salinity [measured by conductivity, temperature, and depth (CTD) sensor], bottle salinity, bottle oxygen, phosphate, nitrate, nitrite, silicate, chlorofluorocarbons (CFC-1 1 , CFC-12), TCO{sub 2}, TALK, and underway pCO{sub 2}. The TCO{sub 2} was measured by using two Single-Operator Multiparameter Metabolic Analyzers (SOMMAs) for extracting CO{sub 2} from seawater samples that were coupled to a coulometer for detection of the extracted CO{sub 2}. The overall precision and accuracy of the analyses was {+-} 1.9 {micro}mol/kg. Samples collected for TALK were measured by potentiometric titration; precision was {+-}2.0 {micro}mol/kg. Underway pCO{sub 2} was measured by infrared photometry with a precision of {+-} 2.0 {micro}atm. The work aboard the R/V Meteor was supported by the U.S. Department of Energy under contract DE-AC02-76CHOO016, and the Bundesministerium fir Forschung und Technologies through grants 03F0545A and MPG 099/1.
Kozyr, A.
2002-05-09
This data documentation discusses the procedures and methods used to measure total carbon dioxide (TCO{sub 2}) and the fugacity of CO{sub 2} (fCO{sub 2}) at hydrographic stations during the R/V Meteor oceanographic cruise 28/1 in the South Atlantic Ocean (Section A8). Conducted as part of the World Ocean Circulation Experiment (WOCE), the cruise began in Recife, Brazil, on March 29, 1994, and ended after 35 days at sea in Walvis Bay, Namibia, on May 12, 1994. Instructions for accessing the data are provided. TCO{sub 2} was measured using two single-operator multiparameter metabolic analyzers (SOMMA) coupled to a coulometer for extracting and detecting CO{sub 2} from seawater samples. The overall precision and accuracy of the analyses was {+-}1.17 {micro}mol/kg. For the second carbonate system parameter, the fCO{sub 2} was measured in discrete samples by equilibrating a known volume of liquid phase (seawater) with a known volume of a gas phase containing a known mixture of CO{sub 2} in gaseous nitrogen (N{sub 2}). After equilibration, the gas phase CO{sub 2} concentration was determined by flame ionization detection following the catalytic conversion of CO{sub 2} to methane (CH{sub 4}). The precision of these measurements was less than or equal to 1.0%. The R/V Meteor Cruise 28/1 data set is available free of charge as a numeric data package (NDP) from the Carbon Dioxide Information Analysis Center. The NDP consists of two oceanographic data files, two FORTRAN 90 data retrieval routine files, a readme file, and this printed documentation that describes the contents and format of all files as well as the procedures and methods used to obtain the data.
Graph Characterization and Sampling Algorithms
Office of Scientific and Technical Information (OSTI)
Sandia National Laboratories ubiquitous Computer traffic Social networks Biological ... conference on Innovations in theoretical computer science, pp. 471-482, 2014, doi:10.1145...
Data report - charts and graphs
1996-01-01
This article is the continuing data report on a number of parameters in the nucelar fuels market. Items include: (1) summary of December 1995 transactions, (2) uranium price data for the previous 10 years, broken down by month and range, (3) SWU price data, and (4) economic indicators for the United States, Europe, and Japan.
Efficient Graph Analytics for Genomics
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Design » Types of Homes » Efficient Earth-Sheltered Homes Efficient Earth-Sheltered Homes This house in Tempe, Arizona, uses earth-sheltered construction methods to help decrease cooling costs. | Photo by Pamm McFadden This house in Tempe, Arizona, uses earth-sheltered construction methods to help decrease cooling costs. | Photo by Pamm McFadden If you are looking for a home with energy-efficient features that will provide a comfortable, tranquil, weather-resistant dwelling, an earth-sheltered
Kozyr, Alex
2008-09-30
This report presents methods, and analytical and quality control procedures for salinity, oxygen, nutrient, inorganic carbon, organic carbon, chlorofluorocarbon (CFC), and bomb carbon-14 system parameters performed during the A20_2003 and A22_2003 cruises, which took place between September 22 and November 13, 2003, aboard research vessel (R/V) Knorr under the auspices of the National Oceanic and Atmospheric Administration (NOAA) and National Science Foundation (NSF). The R/V Knorr departed Woods Hole, Massachusetts, on September 22 for the Repeat Section A20, and ended this line in Port of Spain, Trinidad, on October 20. The Repeat Section A22 started on October 23 in Port of Spain, Trinidad, and finished on November 13, 2003, in Woods Hole, Massachusetts. The research conducted was one of a series of repeat hydrography sections jointly funded by NOAA and NSF as part of the Climate Variability Program (CLIVAR)/CO2/repeat hydrography/tracer program. Samples were taken from 36 depths at 88 stations on section A20 and 82 stations on section A22. The data presented in this report include the analyses of water samples for total inorganic carbon (TCO_{2}), total alkalinity (TALK), dissolved organic carbon (DOC), CFC, carbon-14, hydrographic, and other chemical measurements.
Kozyr, A.V.
2003-09-15
This document describes the procedures and methods used to measure total carbon dioxide (TCO{sub 2}) and total alkalinity (TALK) at hydrographic stations taken during the R/V Knorr Indian Ocean cruises (Sections I8SI9S, I9N, I8NI5E, I3, I5WI4, I7N, I1, I10, and I2) in 1994-1996. The measurements were conducted as part of the World Ocean Circulation Experiment (WOCE). The expedition began in Fremantle, Australia, on December 1, 1994, and ended in Mombasa, Kenya, on January 22, 1996. During the nine cruises, 12 WOCE sections were occupied. Total carbon dioxide was extracted from water samples and measured using single-operator multiparameter metabolic analyzers (SOMMAs) coupled to coulometers. The overall precision and accuracy of the analyses was {+-} 1.20 {micro}mol/kg. The second carbonate system parameter, TALK, was determined by potentiometric titration. The precision of the measurements determined from 962 analyses of certified reference material was {+-} 4.2 {micro}mol/kg (REFERENCE). This work was supported by grants from the National Science Foundation, the U. S. Department of Energy, and the National Oceanographic and Atmospheric Administration. The R/V Knorr Indian Ocean data set is available as a numeric data package (NDP) from the Carbon Dioxide Information Analysis Center (CDIAC). The NDP consists of 18 oceanographic data files, two FORTRAN 77 data retrieval routine files, a readme file, and this printed documentation, which describes the contents and format of all files as well as the procedures and methods used to obtain the data. Instructions for accessing the data are provided.
BASSET: Scalable Gateway Finder in Large Graphs
Tong, H; Papadimitriou, S; Faloutsos, C; Yu, P S; Eliassi-Rad, T
2010-11-03
Given a social network, who is the best person to introduce you to, say, Chris Ferguson, the poker champion? Or, given a network of people and skills, who is the best person to help you learn about, say, wavelets? The goal is to find a small group of 'gateways': persons who are close enough to us, as well as close enough to the target (person, or skill) or, in other words, are crucial in connecting us to the target. The main contributions are the following: (a) we show how to formulate this problem precisely; (b) we show that it is sub-modular and thus it can be solved near-optimally; (c) we give fast, scalable algorithms to find such gateways. Experiments on real data sets validate the effectiveness and efficiency of the proposed methods, achieving up to 6,000,000x speedup.
Graph Characterization and Sampling Algorithms. (Conference)...
Office of Scientific and Technical Information (OSTI)
Resource Type: Conference Resource Relation: Conference: Proposed for presentation at the Computer Information Science (CIS) Review held April 21-23, 2015 in Albuquerque, NM. ...
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
We want USDOE to vitrify all Low Activity Waste (second LAW plant) -- Alternative 2B. 2 For all glass options, most of the impacts come from secondary waste. Secondary waste causes significant groundwater impacts and needs robust mitigation to get below levels of concern. Peak Groundwater Results from Various Waste Forms and Secondary Waste Glass Glass and Bulk Vit Glass and Cast Stone Glass and Steam Reforming Benchmark iodine-129 (pCi/L) 1.4 1.7 10.7 10.7 1 technetium-99 (pCi/L) 471
A graph-based method for improving GSAT
Kask, K.; Dechter, R.
1996-12-31
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satisfiability and constraint satisfaction problems. We present an improvement to GSAT that is sensitive to the problem`s structure. When the problem has a tree structure the algorithm is guaranteed to find a solution in linear time. For non-tree networks, the algorithm designates a subset of nodes, called cutset, and executes a regular GSAT algorithm on this set of variables. On all the rest of the variables it executes a specialized local search algorithm for trees. This algorithm finds an assignment that, like GSAT, locally minimizes the sum of unsatisfied constraints and also globally minimizes the number of conflicts in every tree-like sub-network. We will present results of experiments showing that this new algorithm outperforms regular GSAT on sparse networks whose cycle-cutset size is bounded by 30% of the nodes.
Graph Analytics for Signature Discovery (Conference) | SciTech...
Office of Scientific and Technical Information (OSTI)
Resource Relation: Conference: IEEE International Conference on Intelligence and Security Informatics (ISI 2013), June 4-7, 2013, Seattle, Washington, 315-320 Publisher: IEEE, ...
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Aggregate Aggregate Daily Graph: Weekly Graph: Monthly Graph: Yearly Graph: 2 Year Graph: Last edited: 2016-04-29 11:34:30
Microsoft Word - CY11_draft_appxa.doc
Office of Legacy Management (LM)
Station WOMPOC A.3 Groundwater Level Data for CY 2011 A.4 Groundwater Hydrographs A.4.1 Hydrographs for Manually Collected Water Level Data A.4.2 Hydrographs for Automated Water ...
Effective software design and development for the new graph architecture HPC machines.
Dechev, Damian
2012-03-01
Software applications need to change and adapt as modern architectures evolve. Nowadays advancement in chip design translates to increased parallelism. Exploiting such parallelism is a major challenge in modern software engineering. Multicore processors are about to introduce a significant change in the way we design and use fundamental data structures. In this work we describe the design and programming principles of a software library of highly concurrent scalable and nonblocking data containers. In this project we have created algorithms and data structures for handling fundamental computations in massively multithreaded contexts, and we have incorporated these into a usable library with familiar look and feel. In this work we demonstrate the first design and implementation of a wait-free hash table. Our multiprocessor data structure design allows a large number of threads to concurrently insert, remove, and retrieve information. Non-blocking designs alleviate the problems traditionally associated with the use of mutual exclusion, such as bottlenecks and thread-safety. Lock-freedom provides the ability to share data without some of the drawbacks associated with locks, however, these designs remain susceptible to starvation. Furthermore, wait-freedom provides all of the benefits of lock-free synchronization with the added assurance that every thread makes progress in a finite number of steps. This implies deadlock-freedom, livelock-freedom, starvation-freedom, freedom from priority inversion, and thread-safety. The challenges of providing the desirable progress and correctness guarantees of wait-free objects makes their design and implementation difficult. There are few wait-free data structures described in the literature. Using only standard atomic operations provided by the hardware, our design is portable; therefore, it is applicable to a variety of data-intensive applications including the domains of embedded systems and supercomputers.Our experimental evaluation shows that our hash table design outperforms the most advanced locking solution, provided by Intel's TBB library, by 22%. When compared to more traditional locking designs we show a performance improvement by a factor of 7.92. When compared to alternative non-blocking designs, our hash table demonstrates solid performance gains in a large majority of cases, typically by a factor of 3.44.
Automatic Transformation of MPI Programs to Asynchronous, Graph-Driven Form
Baden, Scott B; Weare, John H; Bylaska, Eric J
2013-04-30
The goals of this project are to develop new, scalable, high-fidelity algorithms for atomic-level simulations and program transformations that automatically restructure existing applications, enabling them to scale forward to Petascale systems and beyond. The techniques enable legacy MPI application code to exploit greater parallelism though increased latency hiding and improved workload assignment. The techniques were successfully demonstrated on high-end scalable systems located at DOE laboratories. Besides the automatic MPI program transformations efforts, the project also developed several new scalable algorithms for ab-initio molecular dynamics, including new massively parallel algorithms for hybrid DFT and new parallel in time algorithms for molecular dynamics and ab-initio molecular dynamics. These algorithms were shown to scale to very large number of cores, and they were designed to work in the latency hiding framework developed in this project. The effectiveness of the developments was enhanced by the direct application to real grand challenge simulation problems covering a wide range of technologically important applications, time scales and accuracies. These included the simulation of the electronic structure of mineral/fluid interfaces, the very accurate simulation of chemical reactions in microsolvated environments, and the simulation of chemical behavior in very large enzyme reactions.
Multi-Level Anomaly Detection on Time-Varying Graph Data (Conference...
Office of Scientific and Technical Information (OSTI)
... Close Cite: Bibtex Format Close 0 pages in this document matching the terms "" Search For Terms: Enter terms in the toolbar above to search the full text of this document for ...
Energy Science and Technology Software Center (OSTI)
002928WKSTN00 graphMC: A package for testing the independence of graphs www.sandia.gov/~apinar/graphMC/graphMC
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Running Jobs by Group Running Jobs by Group Daily Graph: Weekly Graph: Monthly Graph: Yearly Graph: 2 Year Graph: Last edited: 2016-04-29 11:34:43
Weighted Running Jobs by Group
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Weighted Running Jobs by Group Weighted Running Jobs by Group Daily Graph: Weekly Graph: Monthly Graph: Yearly Graph: 2 Year Graph: Last edited: 2016-04-29 11:34:54
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Running Jobs by Group Running Jobs by Group Daily Graph: Weekly Graph: Monthly Graph: Yearly Graph: 2 Year Graph: Last edited: 2011-04-05 13:59:48...
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Pending Jobs by Group Pending Jobs by Group Daily Graph: Weekly Graph: Monthly Graph: Yearly Graph: 2 Year Graph: Last edited: 2011-04-05 14:00:14...
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Pending Jobs by Group Pending Jobs by Group Daily Graph: Weekly Graph: Monthly Graph: Yearly Graph: 2 Year Graph: Last edited: 2016-04-29 11:35:04
1996-04-01
This article is the uranium market data summary. It contains data for the following subjects: (1) March 1996 transactions, (2) Uranium price range data, (3) Historical uranium price range data, (4) DOE and Euratom average contract prices for natural uranium, (5) SWU historical price data, (6) SWU/spot/secondary price range data, and (7) DOE SWU prices data.
Office of Legacy Management (LM)
Station WOMPOC A.3 Groundwater Level Data for CY 2012 A.4 Groundwater Hydrographs A.4.1 Hydrographs for Manually Collected Water Level Data Appendix A, Page 1 Appendix A: ...
file://C:\\Users\\deborahs\\AppData\\Local\\Temp\\tmp2581.tmp.htm
National Nuclear Security Administration (NNSA)
stateengineerbasinboundaries Shapefile Tags Hydrographic Basin Boundaries Summary The ... reviewed for agreement with State Engineer Basin Designation Orders and ...
Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site
* Technical assistance, regional planning and project management * Provide synergy between ... hydrograph from stream gauging data collection EIA Generation data from ...
Energy Science and Technology Software Center (OSTI)
2010-09-30
The Umbra gbs (Graph-Based Search) library provides implementations of graph-based search/planning algorithms that can be applied to legacy graph data structures. Unlike some other graph algorithm libraries, this one does not require your graph class to inherit from a specific base class. Implementations of Dijkstra's Algorithm and A-Star search are included and can be used with graphs that are lazily-constructed.
Comparing Clouds Using Cloud Radar
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
How To Graph Goals: The goal of this activity is to learn how to make a coordinate or line graph. Materials: Graph paper Pencil Introduction: Graphs and charts are great because they communicate information visually. Graphs are often used by scientists, but also by newspapers, magazines and businesses around the world. Sometimes, complicated information is difficult to understand and needs an illustration. Other times, a graph or chart helps impress people by getting the point across quickly and
Livingston, Hugh D.
1996-07-01
Conducted planning and implementation of ocean carbon dioxide hydrographic surveys ocean process studies, time-series studies of Bermuda and Hawaii, and sponsored scientific workshops for those activities.
Trends in Commercial Buildings--Total Primary Energy Detail
U.S. Energy Information Administration (EIA) Indexed Site
Energy Consumption and Graph Total Primary Energy Consumption Graph Detail and Data Table 1979 to 1992 primary consumption trend with 95% confidence ranges 1979 to 1992 primary...
Trends in Commercial Buildings--Total Site Energy Detail
U.S. Energy Information Administration (EIA) Indexed Site
Energy Consumption and Graph Total Site Energy Consumption Graph Detail and Data Table 1979 to 1992 site consumption trend with 95% confidence ranges 1979 to 1992 site...
Concurrent Transfers Last 8 Days
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
graphs are autoscaling - check the scales on each axis before you compare graphs. Concurrency (Both Systems) Concurrency (Both Systems) Concurrency (Both Systems) Concurrency...
Bandwidth and Transfer Activity
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
average. Graphs for the last 8 days. Historical yearly peak days. Daily Storage Concurrency Transfer Activity This graph shows the number of transfers to the storage systems...
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
principally in parallel algorithm development, sparse iterative methods and applied graph theory. There he co- authored Chaco, a graph partitioning and sequencing toolkit widely...
Joaquin Correa JoaquinCorrea@lbl.gov NERSC Data...
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Climate, Cosmology, Kbase, Materials, BioImaging, Your science Statistics, Machine Learning R, python, MLBase Image Processing MATLAB OMERO, Fiji Graph Analytics GraphX...
Springboarding Building Energy Savings in India and the U.S....
Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site
of the first graph that tracks monthly energy use and provides longitudinal benchmarking. (Source: LBNL) Figure 3: Close-up of the first graph that tracks monthly energy...
Working Gas in Underground Storage Figure
Annual Energy Outlook [U.S. Energy Information Administration (EIA)]
Gas in Underground Storage Figure Working Gas in Underground Storage Compared with 5-Year Range Graph...
January 2015 Groundwater Sampling at the Gnome-Coach, New Mexico, Site
Findlay, Rick; Kautsky, Mark
2015-12-01
Annual sampling was conducted January 27, 2015, to monitor groundwater for potential radionuclide contamination at the Gnome-Coach site in New Mexico. Samples were collected from wells USGS-1, USGS-4, and USGS-8 during this monitoring event. The sampling was performed as specified in the Sampling and Analysis Plan for US. Department of Energy Office of Legacy Management Sites (LMS/PRO/S04351, continually updated). A duplicate sample was collected from well USGS-8 and water levels were measured in all the monitoring wells onsite. Refer to the sample location map for well locations. Samples were analyzed by GEL Laboratories in Charleston, South Carolina. Samples were analyzed for gamma-emitting radionuclides by high-resolution gamma spectrometry, strontium-90, and tritium. The sample from well USGS-1 was analyzed for tritium using the enrichment method to achieve a lower minimum detectable concentration (MDC). Radionuclide contaminants were detected in wells USGS-4 and USGS-8. The detection of radionuclides in these wells was expected because the U.S. Geological Survey conducted a tracer test between these wells in 1963 using the dissolved radionuclides tritium, strontium-90, and cesium-137 as tracers. Radionuclide time-concentration graphs are included in this report for these wells. Analytical data obtained from this and past sampling events are also available in electronic format on the U.S. Department of Energy Office of Legacy Management Geospatial Environmental Mapping System website at http://gems.lm.doe.gov/#site=GNO.
Energy Science and Technology Software Center (OSTI)
2014-01-07
PathFinder is a graph search program, traversing a directed cyclic graph to find pathways between labeled nodes. Searches for paths through ordered sequences of labels are termed signatures. Determining the presence of signatures within one or more graphs is the primary function of Path Finder. Path Finder can work in either batch mode or interactively with an analyst. Results are limited to Path Finder whether or not a given signature is present in the graph(s).
Perkins, S.T.; Cullen, D.E. ); Seltzer, S.M. , Gaithersburg, MD . Center for Radiation Research)
1991-11-12
Energy-dependent evaluated electron interaction cross sections and related parameters are presented for elements H through Fm (Z = 1 to 100). Data are given over the energy range from 10 eV to 100 GeV. Cross sections and average energy deposits are presented in tabulated and graphic form. In addition, ionization cross sections and average energy deposits for each shell are presented in graphic form. This information is derived from the Livermore Evaluated Electron Data Library (EEDL) as of July, 1991.
Kozyr, Alex; Feely, R. A.; Sabine, C. L.; Millero, F. J.; Langdon, C.; Dickson, A. G.; Fine, R. A.; Bullister, J. L.; Hansell, D. A.; Carlson, C. A.; Sloyan, B. M.; McNichol, A. P.; Key, R. M.; Byrne, R. H.; Wanninkhof, R.
2009-05-01
This report presents methods, and analytical and quality control procedures for salinity, oxygen, nutrients, total carbon dioxide (TCO_{2}), total alkalinity (TALK), pH, discrete CO_{2} partial pressure (pCO_{2}), dissolved organic carbon (DOC), chlorofluorocarbons (CFCs), radiocarbon, δ13C, and underway carbon measurements performed during the P16S-2005 (9 January - 19 February 2005) and P16N-2006 (13 February - 30 March, 2006) cruises in the Pacific Ocean. The research vessel (R/V) Roger Revelle departed Papeete, Tahiti, on January 9, 2005 for the Repeat Section P16S, nominally along 150°W, ending in Wellington, New Zealand, on February 19. During this cruise, samples were taken from 36 depths at 111 CTD stations between 16°S and 71°S. The Repeat Section P16N, nominally along 152°W, consisted of two legs. Leg 1 started on February 13, 2006 in Papeete, Tahiti, and finished on March 3, in Honolulu, Hawaii. The R/V Thomas G. Thompson departed Honolulu for Leg 2 on March 10, 2006 and arrived in Kodiak, Alaska, on March 30. During the P16N cruises, samples were taken from 34 or 36 depths at 84 stations between 17°S and 56.28°N. The research conducted on these cruises was part of a series of repeat hydrography sections jointly funded by the National Oceanic and Atmospheric Administration (NOAA) and the National Science Foundation (NSF) as part of the Climate Variability Program (CLIVAR)/CO_{2} Repeat Hydrography Program. The P16S and P16N data sets are available free of charge as a numeric data package (NDP) from the Carbon Dioxide Information Analysis Center (CDIAC). The NDP consists of the oceanographic data files and this printed documentation, which describes the procedures and methods used to obtain the data.
CX-011841: Categorical Exclusion Determination
Broader source: Energy.gov [DOE]
Hydrographics, NCR KCP14-02 CX(s) Applied: B1.31 Date: 02/12/2014 Location(s): Missouri Offices(s): Kansas City Site Office
Office of Legacy Management (LM)
Upstream of A-1 Bypass A.2 Precipitation Data A.2.1 PG58: Gaging Station GS01 A.2.2 ... Flats Met Tower A.3 Groundwater Level Data for CY 2014 A.4 Groundwater Hydrographs ...
Office of Legacy Management (LM)
Upstream of A-1 Bypass A.2 Precipitation Data A.2.1 PG58: Gaging Station GS01 A.2.2 ... Repeater Node RTU2 A.3 Groundwater Level Data for CY 2009 A.4 Groundwater Hydrographs ...
Office of Legacy Management (LM)
Upstream of A-1 Bypass A.2 Precipitation Data A.2.1 PG58: Gaging Station GS01 A.2.2 ... Station WOMPOC A.3 Groundwater Level Data for CY 2013 A.4 Groundwater Hydrographs ...
This Week In Petroleum Distillate Section
Annual Energy Outlook [U.S. Energy Information Administration (EIA)]
On-highway diesel fuel prices (dollars per gallon) U.S. Regional U.S. on-highway diesel fuel prices graph Regional on-highway diesel fuel prices graph On-highway diesel fuel prices ...
The equation of state of nuclear matter
Gandolfi, Stefano; Carlson, Joseph Allen
2015-06-30
A brief status report of research on equation of state (EOS) of nuclear matter is provided, along with two graphs.
Controlled Hydrogen Fleet and Infrastructure Demonstration and Validation Project
Wipke, K.; Spirk, S.; Kurtz, J.; Ramsden, T.
2010-09-01
Graphs of composite data products produced by DOE's Controlled Hydrogen Fleet and Infrastructure Demonstration and Validation project through September 2010.
Controlled Hydrogen Fleet and Infrastructure Demonstration and Validation Project: Fall 2008
Wipke, K.; Sprik, S.; Kurtz, J.; Ramsden, T.
2008-10-01
Graphs of composite data products produced by DOE's Controlled Hydrogen Fleet and Infrastructure Demonstration and Validation project through September 2008.
Wipke, K.; Sprik, S.; Kurtz, J.; Ramsden, T.
2010-05-01
Graphs of composite data products produced by DOE's Controlled Hydrogen Fleet and Infrastructure Demonstration and Validation project through March 2010.
Energy Science and Technology Software Center (OSTI)
002861MLTPL00 Integrated Network Decompositions and Dynamic Programming for Graph Optimization (INDDGO) http://github.org/bdsullivan/INDDGO
Energy Science and Technology Software Center (OSTI)
003500WKSTN00 EAGLE: 'EAGLE'Is an' Algorithmic Graph Library for Exploration https://github.com/ssrangan
Alternative Fuels Data Center: Maps and Data
idle-reduction Go Generated_thumb20141209-960-mjqcb8 Clean Cities Petroleum Savings by Idle Reduction Generated_thumb20141209-960-mjqcb8 Trend of displacement by idle reduction policies and technologies from 2004-2013 Last update December 2014 View Graph Graph Download Data 10568_vehicle_idle_20130906 Estimated Fuel Used by Commercial Trucks While Idling 10568_vehicle_idle_20130906 Comparison of idling percentage for different commercial trucks. Last update September 2013 View Graph Graph
Energy Science and Technology Software Center (OSTI)
2004-05-17
NetworkX (abbreviated NX in the software and documentation) is a package for studying network structure using graph theory.
Sandia National Laboratories is a multi-program laboratory managed...
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
time windows) Some problems have strong compute requirements Eigensolves, LSA, LMSA (lots of matrix multiplies) Graph algorithms Some problems have...
Energy Science and Technology Software Center (OSTI)
002444SUPER00 Modular Environment for Graph Research and Analysis with a Persistent http://software.sandia.gov/trac/megraphs
Wipke, K.; Sprik, S.; Kurtz, J.; Ramsden, T.
2009-09-01
Graphs of composite data products produced by DOE's Controlled Hydrogen Fleet and Infrastructure Demonstration and Validation project through September 2009.
Quality assurance and data management
Lockrem, L.L.
1998-01-12
This report contains graphs and tables relating to quality assurance and data management for environmental quality at Hanford Reservation.
Energy Science and Technology Software Center (OSTI)
002909WKSTN00 Highly Asynchronous VisitOr Queue Graph Toolkit https://bitbucket.org/PerMA/havoggt/
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Activity Last 8 Days Transfer Activity Last 8 Days These graphs show the transfer activity statistics for the past eight days with the most recent day shown first. BE CAREFUL because the graphs are autoscaling - check the scales on each axis before you compare graphs. Transfers started/in progress (Both Systems) Transfers started/in progress (Both Systems) Transfers started/in progress (Both Systems) Transfers started/in progress (Both Systems) Transfers started/in progress (Both Systems)
On the exact evaluation of spin networks
Freidel, Laurent; Hnybida, Jeff; Department of Physics, University of Waterloo, Waterloo, Ontario N2L 3G1
2013-11-15
We introduce a fully coherent spin network amplitude whose expansion generates all SU(2) spin networks associated with a given graph. We then give an explicit evaluation of this amplitude for an arbitrary graph. We show how this coherent amplitude can be obtained from the specialization of a generating functional obtained by the contraction of parametrized intertwiners la Schwinger. We finally give the explicit evaluation of this generating functional for arbitrary graphs.
Aggregate Transfers Historical Yearly Peak
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Transfers Historical Yearly Peak Aggregate Transfers Historical Yearly Peak These plots show the yearly peak days from 2000 to the present. BE CAREFUL because the graphs are autoscaling - check the scales on each axis before you compare graphs. Note that the graph for current year shows the data for the year-to-date peak. Daily Aggregate Bandwidth Daily Aggregate Bandwidth Daily Aggregate Bandwidth Daily Aggregate Bandwidth Daily Aggregate Bandwidth Daily Aggregate Bandwidth Daily Aggregate
Concurrent Transfers Historical Yearly Peak
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Transfers Historical Yearly Peak Concurrent Transfers Historical Yearly Peak These plots show the yearly peak days from 2000 to present. BE CAREFUL because the graphs are autoscaling - check the scales on each axis before you compare graphs. Note that the graph for current year shows the data for the year-to-date peak. Daily Storage Concurrency Daily Storage Concurrency Daily Storage Concurrency Daily Storage Concurrency Daily Storage Concurrency Daily Storage Concurrency Daily Storage
Optimizing Approximate Weighted Matching on Nvidia Kepler K40...
Office of Scientific and Technical Information (OSTI)
Matching is a fundamental graph problem with numerous applications in science and ... The new algorithms and implementations provided in this paper will have a direct impact on ...
Fact #857 January 26, 2015 Number of Partner Workplaces Offering...
Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site
Number of Partner Workplaces with Electric Vehicle Charging Stations, November 2014 Graph showing number of partner workplaces with electric vehicle charging stations from the ...
Microsoft PowerPoint - FeoSalishan_10
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
or non-planar Non-planar Difficult to partition Spanning trees Connected components Graph isomorphism Static or dynamic Weighted or unweighted Concurrent inserts and...
Integrating multiple data sources for malware classification
Anderson, Blake Harrell; Storlie, Curtis B; Lane, Terran
2015-04-28
Disclosed herein are representative embodiments of tools and techniques for classifying programs. According to one exemplary technique, at least one graph representation of at least one dynamic data source of at least one program is generated. Also, at least one graph representation of at least one static data source of the at least one program is generated. Additionally, at least using the at least one graph representation of the at least one dynamic data source and the at least one graph representation of the at least one static data source, the at least one program is classified.
Working Gas in Underground Storage Figure
Annual Energy Outlook [U.S. Energy Information Administration (EIA)]
Working Gas in Underground Storage Figure Working Gas in Underground Storage Figure Working Gas in Underground Storage Compared with 5-Year Range Graph....
Natural Gas Weekly Update, Printer-Friendly Version
Gasoline and Diesel Fuel Update (EIA)
Market Trends). NYMEX Natural Gas Futures Near-Month Contract Settlement Price, West Texas Intermediate Crude Oil Spot Price, and Henry Hub Natural Gas Spot Price Graph More...
The Apache Software Foundation Announces Apache® TinkerPop(tm) as a
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Top-Level Project Apache® TinkerPop(tm) The Apache Software Foundation Announces Apache® TinkerPop(tm) as a Top-Level Project Apache TinkerPop is a graph computing framework that provides developers with the tools required to build modern graph applications in any application domain and at any scale. May 23, 2016 Apache tinkerpop logo Apache TinkerPop is a graph computing framework that provides developers with the tools required to build modern graph applications in any application domain
Gasoline and Diesel Fuel Update (EIA)
inventory" on the stock graphs are the lower end of the demonstrated operational inventory range updated for known and definable changes in the petroleum delivery system....
Thermodynamic and transport properties of sodium liquid and vapor...
Office of Scientific and Technical Information (OSTI)
Transport properties of liquid sodium that have been assessed include: viscosity and thermal conductivity. For each property, recommended values and their uncertainties are graphed ...
Search for: All records | DOE PAGES
Office of Scientific and Technical Information (OSTI)
Filter Results Filter by Author Fradkin, Eduardo (11) Cho, Gil Young (3) Kumar, Krishna ... Discretized Abelian Chern-Simons gauge theory on arbitrary graphs Sun, Kai ; Kumar, ...
Polyamine-Tethered Porous Polymer Networks for Carbon Dioxide...
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
and the largest selectivity (see graph) of any porous material reported to date. It also had outstanding physicochemical stability and could be regenerated under mild conditions...
SEP Special Projects Report: Future Outlook and Appendix
None
2000-07-01
The Sharing Success appendix provides the future outlook for SEP as well as charts and graphs for grants and Special Projects.
This Week In Petroleum Gasoline Section
Gasoline and Diesel Fuel Update (EIA)
Regular gasoline retail prices (dollars per gallon) U.S. Average Conventional Reformulated U.S. retail regular gasoline prices graph Retail average regular gasoline prices graph Retail conventional regular gasoline prices graph Retail reformulated regular gasoline prices graph Retail average regular gasoline prices (dollars per gallon) more price data › Year ago Most recent 08/31/15 08/29/16 08/22/16 08/15/16 08/08/16 08/01/16 07/25/16 07/18/16 U.S. 2.510 2.237 2.193 2.149 2.150 2.159 2.182
Exploring network structure, dynamics, and function using networkx
Hagberg, Aric; Swart, Pieter; S Chult, Daniel
2008-01-01
NetworkX is a Python language package for exploration and analysis of networks and network algorithms. The core package provides data structures for representing many types of networks, or graphs, including simple graphs, directed graphs, and graphs with parallel edges and self loops. The nodes in NetworkX graphs can be any (hashable) Python object and edges can contain arbitrary data; this flexibility mades NetworkX ideal for representing networks found in many different scientific fields. In addition to the basic data structures many graph algorithms are implemented for calculating network properties and structure measures: shortest paths, betweenness centrality, clustering, and degree distribution and many more. NetworkX can read and write various graph formats for eash exchange with existing data, and provides generators for many classic graphs and popular graph models, such as the Erdoes-Renyi, Small World, and Barabasi-Albert models, are included. The ease-of-use and flexibility of the Python programming language together with connection to the SciPy tools make NetworkX a powerful tool for scientific computations. We discuss some of our recent work studying synchronization of coupled oscillators to demonstrate how NetworkX enables research in the field of computational networks.
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
in a database, rather than the current inefficient method of sifting through emails. ... Those custom fields can be searched, reported on, graphed, and referenced in emails. ...
Alternative Fuels Data Center: Maps and Data
50 results AFVs and HEVs - Generated_thumb20160830-4976-kgi9ks AFV Acquisitions by Regulated Fleets (by Fleet Type) Generated_thumb20160830-4976-kgi9ks Trend of S&FP AFV acquisitions by fleet type from 1992-2014 Last update August 2016 View Graph Graph Download Data Generated_thumb20160830-26541-m8i0e0 AFV Acquisitions by Regulated Fleets (by Fuel Type) Generated_thumb20160830-26541-m8i0e0 Trend of S&FP AFV acquisitions by fuel type from 1992-2015 Last update August 2016 View Graph Graph
Alternative Fuels Data Center: Maps and Data
biodiesel Go Generated_thumb20150619-21703-z84lxx U.S. Biodiesel Production, Exports, and Consumption Generated_thumb20150619-21703-z84lxx Trend of U.S. biodiesel production, exports, and consumption from 2001-2014 Last update June 2015 View Graph Graph Download Data Generated_thumb20160208-27007-1cmv4kl Biomass-Based Diesel RFS2 Mandates and RINs Generated Generated_thumb20160208-27007-1cmv4kl Last update February 2016 View Graph Graph Download Data Generated_thumb20130810-31804-s6una1 U.S.
Alternative Fuels Data Center: Maps and Data
driving-behavior Go Generated_thumb20130810-31804-1jtc9qa Fuel Economy at Various Driving Speeds Generated_thumb20130810-31804-1jtc9qa Trend of fuel efficiency at different speeds, grouped by vehicle age Last update April 2013 View Graph Graph Download Data Generated_thumb20130810-31804-pe0nga Average Vehicle Trip Length by Purpose Generated_thumb20130810-31804-pe0nga Average trip length and distribution by trip type in U.S., 2009 Last update May 2012 View Graph Graph Download Data
Alternative Fuels Data Center: Maps and Data
ethanol Go Generated_thumb20160329-22390-r7vnqb Global Ethanol Production Generated_thumb20160329-22390-r7vnqb Quantity of ethanol produced by country from 2007-2014 Last update March 2016 View Graph Graph Download Data Generated_thumb20151113-26762-c7ez9d U.S. Production, Consumption, and Trade of Ethanol Generated_thumb20151113-26762-c7ez9d Trend of total ethanol fuel production and consumption from 1981-2014 Last update July 2015 View Graph Graph Download Data
Alternative Fuels Data Center: Maps and Data
hydrogen Go Hydrogen-stations Hydrogen Fueling Station Locations by State Hydrogen-stations View Map Graph Hydrogen_li_by_state Hydrogen Incentives and Laws, by State Hydrogen_li_by_state View Map Graph Generated_thumb20160914-24960-10gn0o4 Annual Percent Growth of Vehicles in Operation Generated_thumb20160914-24960-10gn0o4 Last update September 2016 View Graph Graph Download Data Generated_thumb20150820-7666-dq3brm Greenhouse Gas Emissions by Fuel Type Generated_thumb20150820-7666-dq3brm
Alternative Fuels Data Center: Maps and Data
propane Go Propane_li_by_state Propane Incentives and Laws, by State Propane_li_by_state View Map Graph Propane-stations Propane Fueling Station Locations by State Propane-stations View Map Graph 10561_expenditures_by_sector_20130906 Per Capita Energy Expenditures by Sector 10561_expenditures_by_sector_20130906 Trend of transportation and residential energy expenditures from 1970-2010 Last update September 2013 View Graph Graph Download Data Generated_thumb20140826-27944-1rznsji Alternative Fuel
K-12 Energy Lesson Plans and Activities Web site (EERE)
Students use graphs of historical data and research historical and societal events to determine and analyze energy trends in the United States over the past 50 years.
Quarks Pair Up in Protons (and Neutrons) | Jefferson Lab
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Quarks Pair Up in Protons (and Neutrons) Graph of up quarkdown quark contributions Researchers have published intriguing new observations for how the different kinds of quarks ...
Reduce Air Infiltration in Furnaces; Industrial Technologies...
Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site
they rise, creating a differential pressure between the top and the bottom of the furnace. ... can be calculated by using the equations and graphs given in Industrial Furnaces ...
Search results | Department of Energy
Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site
smell and taste-rate which they prefer, and graph the results of the experiment as a class. http:energy.goveereeducationdownloadswhats-cooking Download Photovoltaics and...
Identifying Renewable Energy Projects for Federal Agencies |...
Broader source: Energy.gov (indexed) [DOE]
U.S. Department of Energy's Federal Energy Management Program (FEMP) is researching ... As an example, FEMP created a series of maps and graphs that illustrate federal facility ...
Search for: All records | SciTech Connect
Office of Scientific and Technical Information (OSTI)
... We explore the interplay between algorithm design and architectural features using graph ... matching. less May 2012 , IEEE Computer Society, Los Alamitos, CA, United States(US). ...
Search for: All records | SciTech Connect
Office of Scientific and Technical Information (OSTI)
... The goal of this research is to develop and implement artificial intelligence methods for the design, modeling and analysis of dynamic physical systems. Bond graphs and a library ...
Fact #558: February 16, 2009 Transit Vehicle Age and Cost | Department...
Broader source: Energy.gov (indexed) [DOE]
Average Age of Transit Vehicles, 2007 Graph showing the average age of transit vehicles (bus, trolleybus, vanpool, demand response, light rail, commuter rail, commuter rail ...
Concurrent Transfers Historical Yearly Peak
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
the graph for current year shows the data for the year-to-date peak. Daily Storage Concurrency Daily Storage Concurrency Daily Storage Concurrency Daily Storage Concurrency Daily...
Broader source: Energy.gov (indexed) [DOE]
The NE Infrastructure DB haswill have the ability to: 3. Feed directly into a visualization system for custom maps * Future implementation of GIS technology * Graph network system ...
De Novo Ultrascale Atomistic Simulations On High-End Parallel...
Office of Scientific and Technical Information (OSTI)
complexity and tight error control. The EDC framework also enables adaptive hierarchical simulation with automated model transitioning assisted by graph-based event tracking. ...
DISPLAYING AND INTERPRETING FLUID INCLUSION STRATIGRAPHY ANALYSES...
DISPLAYING AND INTERPRETING FLUID INCLUSION STRATIGRAPHY ANALYSES ON MUDLOG GRAPHS Jump to: navigation, search OpenEI Reference LibraryAdd to library Conference Proceedings:...
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Organization area to allow the movement and radio-graphing of component for evaluation to determine the proper Project Execution Plan for dismantlement. Evaluation Project...
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Static and dynamic radio- graphs of experimental system compared to pre- dicted (synthetic) radiograph from simulation codes. Modified for the Web several changes to the technical ...
Energy Science and Technology Software Center (OSTI)
002728IBMPC02 PylotDB - A Database Management, Graphing, and Analysis Tool Written in Python http://pmatwiki.sandia.gov/pmatwiki/how-to-use-pylot
Search for: All records | SciTech Connect
Office of Scientific and Technical Information (OSTI)
... Approximate Weighted Matching On Emerging Manycore and Multithreaded Architectures Halappanavar, Mahantesh ; Feo, John T. ; Villa, Oreste ; Tumeo, Antonino ; Pothen, Alex Graph ...
Fact #705: December 12, 2011 Fuel Consumption Standards for Combinatio...
Broader source: Energy.gov (indexed) [DOE]
published a final rule setting fuel consumption standards for heavy trucks in September ... Combination Tractor Fuel Consumption Standards, Model Years (MY) 2014-2017 Graph showing ...
EIA Energy Information Administration
U.S. Energy Information Administration (EIA) Indexed Site
and the East last week as the four cities monitored for this report recorded gradually rising temperatures (see Temperature graph). Despite the expected slack demand...
Solar Background Document 5 | Department of Energy
Office of Environmental Management (EM)
5 Solar Background Document 5 Graph illustrating Chinese Development Bank financing to Chinese solar companies. Solar Background Document 5.pdf (29.35 KB) More Documents & ...
Solar Background Document 4 | Department of Energy
Office of Environmental Management (EM)
4 Solar Background Document 4 Graph illustrating global distribution of solar manufacturing market share from 1990 to 2010. Solar Background Document 4.pdf (57.32 KB) More ...
Sandia Energy - Sandia Magnetized Fusion Technique Produces Significan...
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
an automobile's cylinders firing. Sandia researchers Paul Schmit, left, and Patrick Knapp discuss equations and graphs that describe aspects of Sandia's Z Machine. (Photo by...
Tank Closure and Waste Management Environmental Impact Statement...
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
justice, waste management, and spent nuclear fuel. 3.1 APPROACH TO DEFINING THE AFFECTED ... machinery, photographs and graphs, publications, control room panels, and models. ...
A new augmentation based algorithm for extracting maximal chordal...
Office of Scientific and Technical Information (OSTI)
solutions to a range of NP-hard graph problems, and practically, since they arise in many applications including sparse linear algebra, computer vision, and computational biology. ...