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.
U.S. Department of Energy (DOE) - all 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
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
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
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
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
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.
Spectral fluctuations of quantum graphs
Pluhař, Z.; Weidenmüller, H. A.
2014-10-15
We prove the Bohigas-Giannoni-Schmit conjecture in its most general form for completely connected simple graphs with incommensurate bond lengths. We show that for graphs that are classically mixing (i.e., graphs for which the spectrum of the classical Perron-Frobenius operator possesses a finite gap), the generating functions for all (P,Q) correlation functions for both closed and open graphs coincide (in the limit of infinite graph size) with the corresponding expressions of random-matrix theory, both for orthogonal and for unitary symmetry.
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
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
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
Generalized graph states based on Hadamard matrices
Cui, Shawn X.; Yu, Nengkun; Zeng, Bei
2015-07-15
Graph states are widely used in quantum information theory, including entanglement theory, quantum error correction, and one-way quantum computing. Graph states have a nice structure related to a certain graph, which is given by either a stabilizer group or an encoding circuit, both can be directly given by the graph. To generalize graph states, whose stabilizer groups are abelian subgroups of the Pauli group, one approach taken is to study non-abelian stabilizers. In this work, we propose to generalize graph states based on the encoding circuit, which is completely determined by the graph and a Hadamard matrix. We study the entanglement structures of these generalized graph states and show that they are all maximally mixed locally. We also explore the relationship between the equivalence of Hadamard matrices and local equivalence of the corresponding generalized graph states. This leads to a natural generalization of the Pauli (X, Z) pairs, which characterizes the local symmetries of these generalized graph states. Our approach is also naturally generalized to construct graph quantum codes which are beyond stabilizer codes.
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 timemore » at most ο(n(logn)²). As an example, we show how to generate samples of power-law degree distribution graphs with tunable assortativity.« 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.
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...
U.S. Department of Energy (DOE) - all 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.
Massive graph visualization : LDRD final report.
Wylie, Brian Neil; Moreland, Kenneth D.
2007-10-01
Graphs are a vital way of organizing data with complex correlations. A good visualization of a graph can fundamentally change human understanding of the data. Consequently, there is a rich body of work on graph visualization. Although there are many techniques that are effective on small to medium sized graphs (tens of thousands of nodes), there is a void in the research for visualizing massive graphs containing millions of nodes. Sandia is one of the few entities in the world that has the means and motivation to handle data on such a massive scale. For example, homeland security generates graphs from prolific media sources such as television, telephone, and the Internet. The purpose of this project is to provide the groundwork for visualizing such massive graphs. The research provides for two major feature gaps: a parallel, interactive visualization framework and scalable algorithms to make the framework usable to a practical application. Both the frameworks and algorithms are designed to run on distributed parallel computers, which are already available at Sandia. Some features are integrated into the ThreatView{trademark} application and future work will integrate further parallel algorithms.
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 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
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.
The MultiThreaded Graph Library (MTGL)
Energy Science and Technology Software Center
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
OpenEI (Open Energy Information) [EERE & EIA]
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
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.
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.
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.
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
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.
Modular Environment for Graph Research and Analysis with a Persistent
Energy Science and Technology Software Center
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
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.
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.
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.
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.
Implementing Graph Pattern Queries on a Relational Database
Kaplan, I L; Abdulla, G M; Brugger, S T; Kohn, S R
2007-12-26
When a graph database is implemented on top of a relational database, queries in the graph query language are translated into relational SQL queries. Graph pattern queries are an important feature of a graph query language. Translating graph pattern queries into single SQL statements results in very poor query performance. By taking into account the pattern query structure and generating multiple SQL statements, pattern query performance can be dramatically improved. The performance problems encountered with the single SQL statements generated for pattern queries reflects a problem in the SQL query planner and optimizer. Addressing this problem would allow relational databases to better support semantic graph databases. Relational database systems that provide good support for graph databases may also be more flexible platforms for data warehouses.
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
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.
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.
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.
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.
Must all charting and graphing code be written in javascript...
OpenEI (Open Energy Information) [EERE & EIA]
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...
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.
EAGLE: 'EAGLE'Is an' Algorithmic Graph Library for Exploration
Energy Science and Technology Software Center
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
Office of Energy Efficiency and Renewable Energy (EERE)
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...
Highly Asynchronous VisitOr Queue Graph Toolkit
Energy Science and Technology Software Center
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.
TIFF Image Writer patch for OpenSceneGraph
Energy Science and Technology Software Center
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.
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
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.
High Performance Descriptive Semantic Analysis of Semantic Graph Databases
Joslyn, Cliff A.; Adolf, Robert D.; al-Saffar, Sinan; Feo, John T.; Haglin, David J.; Mackey, Greg E.; Mizell, David W.
2011-06-02
As semantic graph database technology grows to address components ranging from extant large triple stores to SPARQL endpoints over SQL-structured relational databases, it will become increasingly important to be able to understand their inherent semantic structure, whether codified in explicit ontologies or not. Our group is researching novel methods for what we call descriptive semantic analysis of RDF triplestores, to serve purposes of analysis, interpretation, visualization, and optimization. But data size and computational complexity makes it increasingly necessary to bring high performance computational resources to bear on this task. Our research group built a novel high performance hybrid system comprising computational capability for semantic graph database processing utilizing the large multi-threaded architecture of the Cray XMT platform, conventional servers, and large data stores. In this paper we describe that architecture and our methods, and present the results of our analyses of basic properties, connected components, namespace interaction, and typed paths such for the Billion Triple Challenge 2010 dataset.
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
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
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.
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.
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.
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.
GRADIENT: Graph Analytic Approach for Discovering Irregular Events, Nascent and Temporal
Hogan, Emilie
2015-03-31
Finding a time-ordered signature within large graphs is a computationally complex problem due to the combinatorial explosion of potential patterns. GRADIENT is designed to search and understand that problem space.
Wedge sampling for computing clustering coefficients and triangle counts on large graphs
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
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.
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.
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.
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.
High performance semantic factoring of giga-scale semantic graph databases.
al-Saffar, Sinan; Adolf, Bob; Haglin, David; Mackey, Greg Edward; Goodman, Eric L.; Joslyn, Cliff A.; Feo, John; Mizell, David
2010-10-01
As semantic graph database technology grows to address components ranging from extant large triple stores to SPARQL endpoints over SQL-structured relational databases, it will become increasingly important to be able to bring high performance computational resources to bear on their analysis, interpretation, and visualization, especially with respect to their innate semantic structure. Our research group built a novel high performance hybrid system comprising computational capability for semantic graph database processing utilizing the large multithreaded architecture of the Cray XMT platform, conventional clusters, and large data stores. In this paper we describe that architecture, and present the results of our deploying that for the analysis of the Billion Triple dataset with respect to its semantic factors, including basic properties, connected components, namespace interaction, and typed paths.
High Performance Semantic Factoring of Giga-Scale Semantic Graph Databases
Joslyn, Cliff A.; Adolf, Robert D.; Al-Saffar, Sinan; Feo, John T.; Goodman, Eric L.; Haglin, David J.; Mackey, Greg E.; Mizell, David W.
2010-10-04
As semantic graph database technology grows to address components ranging from extant large triple stores to SPARQL endpoints over SQL-structured relational databases, it will become increasingly important to be able to bring high performance computational resources to bear on their analysis, interpretation, and visualization, especially with respect to their innate semantic structure. Our research group built a novel high performance hybrid system comprising computational capability for semantic graph database processing utilizing the large multithreaded architecture of the Cray XMT platform, conventional clusters, and large data stores. In this paper we describe that architecture, and present the results of our deploying that for the analysis of the Billion Triple dataset with respect to its semantic factors.
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
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
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.
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.
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.
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.
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.
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.
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.
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
Analysis of weblike network structures of directed graphs for chemical reactions in methane plasmas
Sakai, Osamu Nobuto, Kyosuke; Miyagi, Shigeyuki; Tachibana, Kunihide
2015-10-15
Chemical reactions of molecular gases like methane are so complicated that a chart of decomposed and/or synthesized species originating from molecules in plasma resembles a weblike network in which we write down species and reactions among them. Here we consider properties of the network structures of chemical reactions in methane plasmas. In the network, atoms/molecules/radical species are assumed to form nodes and chemical reactions correspond to directed edges in the terminology of graph theory. Investigation of the centrality index reveals importance of CH{sub 3} in the global chemical reaction, and difference of an index for each radical species between cases with and without electrons clarifies that the electrons are at an influential position to tighten the network structure.
Saad, Tony; Sutherland, James C.
2016-05-04
To address the coding and software challenges of modern hybrid architectures, we propose an approach to multiphysics code development for high-performance computing. This approach is based on using a Domain Specific Language (DSL) in tandem with a directed acyclic graph (DAG) representation of the problem to be solved that allows runtime algorithm generation. When coupled with a large-scale parallel framework, the result is a portable development framework capable of executing on hybrid platforms and handling the challenges of multiphysics applications. In addition, we share our experience developing a code in such an environment – an effort that spans an interdisciplinarymore » team of engineers and computer scientists.« less
Downloaded 09 Feb 2007 to 128.104.165.60. Redistribution subject to AIP license
U.S. Department of Energy (DOE) - all webpages (Extended Search)
Downloaded
U.S. Department of Energy (DOE) - all webpages (Extended Search)
Power http:www.anl.govdownloadstiny-particles-big-magnetic-power Magnetic nanofibers have wide-ranging applications October 6, 2015 Downloads Feed Harnessing Light in...
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
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
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
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.
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.
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
NLO Higgs Boson Production Plus One and Two Jets Using the POWHEG BOX, MadGraph4 and MCFM
Campbell, John M.; Ellis, R. Keith; Frederix, Rikkert; Nason, Paolo; Oleari, Carlo; Williams, Ciaran
2012-07-01
We present a next-to-leading order calculation of Higgs boson production plus one and two jets via gluon fusion interfaced to shower Monte Carlo programs, implemented according to the POWHEG method. For this implementation we have used a new interface of the POWHEG BOX with MadGraph4, that generates the codes for generic Born and real processes automatically. The virtual corrections have been taken from the MCFM code. We carry out a simple phenomenological study of our generators, comparing them among each other and with fixed next-to-leading order results.
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.
Chin, George; Marquez, Andres; Choudhury, Sutanay; Feo, John T.
2012-09-01
Triadic analysis encompasses a useful set of graph mining methods that is centered on the concept of a triad, which is a subgraph of three nodes and the configuration of directed edges across the nodes. Such methods are often applied in the social sciences as well as many other diverse fields. Triadic methods commonly operate on a triad census that counts the number of triads of every possible edge configuration in a graph. Like other graph algorithms, triadic census algorithms do not scale well when graphs reach tens of millions to billions of nodes. To enable the triadic analysis of large-scale graphs, we developed and optimized a triad census algorithm to efficiently execute on shared memory architectures. We will retrace the development and evolution of a parallel triad census algorithm. Over the course of several versions, we continually adapted the code’s data structures and program logic to expose more opportunities to exploit parallelism on shared memory that would translate into improved computational performance. We will recall the critical steps and modifications that occurred during code development and optimization. Furthermore, we will compare the performances of triad census algorithm versions on three specific systems: Cray XMT, HP Superdome, and AMD multi-core NUMA machine. These three systems have shared memory architectures but with markedly different hardware capabilities to manage parallelism.
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
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.
Spin polarisation of tt¯γγ production at NLO+PS with GoSam interfaced to MadGraph5_aMC@NLO
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.
Energy Science and Technology Software Center
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.
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.
SRI2007 Conference - Poster Download
U.S. Department of Energy (DOE) - all webpages (Extended Search)
SRI Poster Download Click here to download poster (30MB pdf)
OpenEI (Open Energy Information) [EERE & EIA]
download Home Graham7781's picture Submitted by Graham7781(2017) Super contributor 15 March, 2013 - 10:23 Quarterly Smart Grid Data available for download on OpenEI data download...
Downloads | Argonne National Laboratory
U.S. Department of Energy (DOE) - all webpages (Extended Search)
Downloads Topic - Any - General Argonne Information -Awards -Honors Energy -Energy efficiency --Vehicles ---Alternative fuels ---Automotive engineering ---Biofuels ---Diesel ---Electric drive technology ---Fuel economy ---Fuel injection ---Heavy-duty vehicles ---Hybrid & electric vehicles ---Hydrogen & fuel cells ---Internal combustion ---Maglev systems ---Powertrain research ---Vehicle testing --Building design ---Construction ---Industrial heating & cooling ---Industrial lighting
Downloads | Argonne National Laboratory
U.S. Department of Energy (DOE) - all webpages (Extended Search)
Downloads Topic - Any - General Argonne Information -Awards -Honors Energy -Energy efficiency --Vehicles ---Alternative fuels ---Automotive engineering ---Biofuels ---Diesel ---Electric drive technology ---Fuel economy ---Fuel injection ---Heavy-duty vehicles ---Hybrid & electric vehicles ---Hydrogen & fuel cells ---Internal combustion ---Maglev systems ---Powertrain research ---Vehicle testing --Building design ---Construction ---Industrial heating & cooling ---Industrial lighting
Downloads | Argonne National Laboratory
U.S. Department of Energy (DOE) - all webpages (Extended Search)
Downloads Topic - Any - General Argonne Information -Awards -Honors Energy -Energy efficiency --Vehicles ---Alternative fuels ---Automotive engineering ---Biofuels ---Diesel ---Electric drive technology ---Fuel economy ---Fuel injection ---Heavy-duty vehicles ---Hybrid & electric vehicles ---Hydrogen & fuel cells ---Internal combustion ---Maglev systems ---Powertrain research ---Vehicle testing --Building design ---Construction ---Industrial heating & cooling ---Industrial lighting
Downloads | Argonne National Laboratory
U.S. Department of Energy (DOE) - all webpages (Extended Search)
Downloads Topic - Any - General Argonne Information -Awards -Honors Energy -Energy efficiency --Vehicles ---Alternative fuels ---Automotive engineering ---Biofuels ---Diesel ---Electric drive technology ---Fuel economy ---Fuel injection ---Heavy-duty vehicles ---Hybrid & electric vehicles ---Hydrogen & fuel cells ---Internal combustion ---Maglev systems ---Powertrain research ---Vehicle testing --Building design ---Construction ---Industrial heating & cooling ---Industrial lighting
Downloads | Argonne National Laboratory
U.S. Department of Energy (DOE) - all webpages (Extended Search)
News Press Releases Feature Stories Research Highlights In the News Fact Sheets and Other Publications Photos Videos Downloads Topic - Any - General Argonne Information -Awards -Honors Energy -Energy efficiency --Vehicles ---Alternative fuels ---Automotive engineering ---Biofuels ---Diesel ---Electric drive technology ---Fuel economy ---Fuel injection ---Heavy-duty vehicles ---Hybrid & electric vehicles ---Hydrogen & fuel cells ---Internal combustion ---Maglev systems ---Powertrain
Downloads | Argonne National Laboratory
U.S. Department of Energy (DOE) - all webpages (Extended Search)
Technologies Available for Licensing Energy Storage Industrial & Manufacturing Processes Instrumentation & Devices Licensable Software Life Sciences Materials Transportation Fact Sheets and Forms Downloads Topic - Any - General Argonne Information -Awards -Honors Energy -Energy efficiency --Vehicles ---Alternative fuels ---Automotive engineering ---Biofuels ---Diesel ---Electric drive technology ---Fuel economy ---Fuel injection ---Heavy-duty vehicles ---Hybrid & electric vehicles
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.
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...
Efficient Graph Analytics for Genomics
U.S. Department of Energy (DOE) - all 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
Software & Downloads | Open Energy Information
OpenEI (Open Energy Information) [EERE & EIA]
Wind Industry Careers Skystream 3.7 Downloads These resources require a Windows computer. Skyview is the manufacturer-provided wind turbine communication software. It is...
Download GETEM, August 2012 Beta | Department of Energy
Office of Energy Efficiency and Renewable Energy (EERE) (indexed site)
Download GETEM, August 2012 Beta Download GETEM, August 2012 Beta
Alternative Fuels Data Center: Data Downloads
Alternative Fuels and Advanced Vehicles Data Center
Tools Printable Version Share this resource Send a link to Alternative Fuels Data Center: Data Downloads to someone by E-mail Share Alternative Fuels Data Center: Data Downloads on Facebook Tweet about Alternative Fuels Data Center: Data Downloads on Twitter Bookmark Alternative Fuels Data Center: Data Downloads on Google Bookmark Alternative Fuels Data Center: Data Downloads on Delicious Rank Alternative Fuels Data Center: Data Downloads on Digg Find More places to share Alternative Fuels Data
Alternative Fuels Data Center: Video Download Help
Alternative Fuels and Advanced Vehicles Data Center
Case Studies Printable Version Share this resource Send a link to Alternative Fuels Data Center: Video Download Help to someone by E-mail Share Alternative Fuels Data Center: Video Download Help on Facebook Tweet about Alternative Fuels Data Center: Video Download Help on Twitter Bookmark Alternative Fuels Data Center: Video Download Help on Google Bookmark Alternative Fuels Data Center: Video Download Help on Delicious Rank Alternative Fuels Data Center: Video Download Help on Digg Find More
Download Energy Halloween Pumpkin Carving Stencils | Department...
U.S. Department of Energy (DOE) - all webpages (Extended Search)
Download Energy Halloween Pumpkin Carving Stencils Download Energy Halloween Pumpkin Carving Stencils Energy Pumpkins 1 of 6 Energy Pumpkins Boo Geek out this Halloween with ...
OHA Archive Download Page | Department of Energy
Office of Energy Efficiency and Renewable Energy (EERE) (indexed site)
OHA Archive Download Page OHA Archive Download Page OHA FOIA Cases Archive File OHA Security Cases Archive File OHA Whistleblower Cases Archive File OHA EIA Cases Archive File OHA ...
Acquisition Forecast Download | Department of Energy
Office of Energy Efficiency and Renewable Energy (EERE) (indexed site)
Acquisition Forecast Download Acquisition Forecast Download Click on the link to download a copy of the DOE HQ Acquisition Forecast. Acquisition-Forecast-2016-11-10.xlsx (70.03 KB) More Documents & Publications National Nuclear Security Administration - Juliana Heynes Small Business Program Manager Directory EA-1900: Notice of Availability of a Draft Environmental Assessment
Energy.gov File Naming Conventions for Downloads | Department...
Office of Energy Efficiency and Renewable Energy (EERE) (indexed site)
File Naming Conventions for Downloads Energy.gov File Naming Conventions for Downloads When uploading files to download pages in Energy.gov's content management system (CMS), ...
Downloads: August 6-8, 2013 National Veterans Small Business...
Office of Energy Efficiency and Renewable Energy (EERE) (indexed site)
Downloads: August 6-8, 2013 National Veterans Small Business Conference Downloads: August 6-8, 2013 National Veterans Small Business Conference Download materials from the August ...
U.S. Department of Energy (DOE) - all 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
Revolution Now- Infographic and Cost Reduction Graph
Office of Environmental Management (EM)
s s t MILLION DOLLAR LISTING - DISTRIBUTED SOLAR PV The millionth di tribu ed photovoltaic sy tem was in talled early in 2016 SHINING BRIGHT ON A-TYPES - LEDS Total A-Type LED bulb ...
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. ...
Revolution Now- Infographic and Cost Reduction Graph
Office of Energy Efficiency and Renewable Energy (EERE) (indexed site)
s s t MILLION DOLLAR LISTING - DISTRIBUTED SOLAR PV The millionth di tribu ed photovoltaic sy tem was in talled early in 2016 SHINING BRIGHT ON A-TYPES - LEDS Total A-Type LED bulb installations surpassed 200 million in 2015, more than doubling since the previous year HOLD ON TO YOUR HATS - LAND-BASED WIND Wind accounted for 41% of all new generation capacity installed in the US in 2015 CRUISE CONTROL - EVS Over 490,000 EVs have been sold through August of 2016 IT JUST KEEPS GETTING BIGGER -
AVTA: 2012 Chevrolet Volt PHEV Downloadable Dynamometer Database...
Office of Energy Efficiency and Renewable Energy (EERE) (indexed site)
Chevrolet Volt PHEV Downloadable Dynamometer Database Reports AVTA: 2012 Chevrolet Volt PHEV Downloadable Dynamometer Database Reports The Vehicle Technologies Office's Advanced ...
AVTA: 2012 Toyota Prius PHEV Downloadable Dynamometer Database...
Office of Energy Efficiency and Renewable Energy (EERE) (indexed site)
Toyota Prius PHEV Downloadable Dynamometer Database Reports AVTA: 2012 Toyota Prius PHEV Downloadable Dynamometer Database Reports The Vehicle Technologies Office's Advanced ...
Download the Final Agenda | Department of Energy
Office of Energy Efficiency and Renewable Energy (EERE) (indexed site)
Final Agenda Download the Final Agenda SunShot Summit Agenda FINAL.pdf (1.11 MB) More Documents & Publications 2014 SunShot Summit Awardee Poster List Technology Forum Map and List of Awardees' Posters and Exhibits 2014 SunShot Initiative Concentrating Solar Power Subprogram Overview
SunShot Solar Projects Download
Office of Energy Efficiency and Renewable Energy (EERE)
The Department of Energy's SunShot Initiative funds projects by private companies, universities, state and local governments, nonprofit organizations, and national laboratories to drive down the cost of solar electricity. We work to make it faster, easier, and more affordable for Americans to choose solar energy in their daily lives. Download the data driving the SunShot Project map [link], including SunShot’s active and inactive projects, funding amounts, and program areas.
Energy Escalation Rate Calculator Download | Department of Energy
Office of Energy Efficiency and Renewable Energy (EERE) (indexed site)
You can download EERC 2.0-15 by clicking on the link for your operating system below. ... Mac OS X: After downloading, double click eercinstall. Please note you must have Java 1.7 ...
Energy Intensity Indicators: Methodology Downloads | Department of Energy
Office of Energy Efficiency and Renewable Energy (EERE) (indexed site)
Indicators: Methodology Downloads Energy Intensity Indicators: Methodology Downloads The files listed below contain methodology documentation and related studies that support the information presented on this website. The files are available to view and/or download as Adobe Acrobat PDF files. Energy Indicators System: Index Construction Methodology (101.17 KB) Changing the Base Year for the Index (23.98 KB) "A Note on the Fisher Ideal Index Decomposition for Structural Change in Energy
Biographies Download: Ambassadors for the Minorities in Energy...
Energy.gov [DOE] (indexed site)
economic development, STEM education, and climate change. Download the biographies and photos of our Ambassadors below. Ambassador Bios More Documents & Publications MIE Milestone...
Gasoline and Diesel Fuel Update
data graph Sheet3
Download Energy.gov's Women's History Month Illustrations
During Women's History Month we rolled out some beautiful illustrations of Mae Jemison, Annie Easley, Chien-Shiung Wu and Ellen Ochoa. You can now download the poster-sized versions of these illustrations.
Download LPO's Illustrated Poster Series | Department of Energy
Want to print your own? Download the high-resolution PDF files below: ADVANCED NUCLEAR ENERGY POSTER (2.85 MB) BIOENERGY & BIOFUELS POSTER (9.26 MB) CLEAN VEHICLE MANUFACTURING ...
Microsoft Word - Using Green Button Download.doc
Office of Environmental Management (EM)
How a Customer Accesses Green Button Data on PGE.com Step 1: Log in to pge.com account with username and password. Step 2: Click on "My Usage" tab. Step 3: Select "Download My ...
Management & Operating Subcontract Reporting Capability (MOSRC) Downloads |
Office of Energy Efficiency and Renewable Energy (EERE) (indexed site)
Department of Energy Management & Operating Subcontract Reporting Capability (MOSRC) Downloads Management & Operating Subcontract Reporting Capability (MOSRC) Downloads FY2015 MO Small Business Subcontracting Summary Report (13.31 KB) MOSRC Field Definitions (86.31 KB) FY2015 MO Small Business Subcontracting Report_Public.xlsx (183.75 KB) More Documents & Publications Service Contract Inventory Federal Reporting Recipient Information Federal Reporting Recipient Information
Small Business Regulatory Enforcement Fairness Act Download | Department of
Office of Energy Efficiency and Renewable Energy (EERE) (indexed site)
Energy Regulatory Enforcement Fairness Act Download Small Business Regulatory Enforcement Fairness Act Download Attachment-1-1-Non-Retaliation-Policy-Internal.pdf (227.36 KB) ONO-SBA-Report-to-Congress-2014.pdf (4.63 MB) More Documents & Publications Federal Acquisition Circular (FAC) 2005-91 The Role of Ombudsmen in Dispute Resolution Human Capital: The Role of Ombudsmen in Dispute Resolution
Energy 101 Dialogue Series Downloads | Department of Energy
Office of Energy Efficiency and Renewable Energy (EERE) (indexed site)
Dialogue Series Downloads Energy 101 Dialogue Series Downloads The Energy 101 dialogue series goals are to identify best practices surrounding teaching energy in the post-secondary setting, to amplify those best practices, and to support the creation of a community of practice of energy education experts. The first dialogue concentrated on issues surrounding teaching energy fundamentals in the classroom within the first two years of post-secondary education and featured presentations from energy
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, ...
Alternative Fuels Data Center: Maps and Data
U.S. Department of Energy (DOE) - all webpages (Extended Search)
biodiesel Go Generatedthumb20160208-27007-1cmv4kl Biomass-Based Diesel RFS2 Mandates and ... View Graph Graph Download Data Biodiesel-stations Biodiesel Fueling Station Locations by ...
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...
Search results | Department of Energy
Office of Energy Efficiency and Renewable Energy (EERE) (indexed site)
current-switch-clean-energy-activity-book Download Energy Analysis Students use graphs of historical data and research historical and societal events to determine and analyze...
Search results | Department of Energy
Office of Energy Efficiency and Renewable Energy (EERE) (indexed site)
Search Showing 31 - 40 of 31 results. Download Energy Analysis Students use graphs of historical data and research historical and societal events to determine and analyze...
Alternative Fuels Data Center: Maps and Data
Alternative Fuels and Advanced Vehicles Data Center
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
Downloads: August 6-8, 2013 National Veterans Small Business Conference |
Office of Energy Efficiency and Renewable Energy (EERE) (indexed site)
Department of Energy Downloads: August 6-8, 2013 National Veterans Small Business Conference Downloads: August 6-8, 2013 National Veterans Small Business Conference Download materials from the August 6-8, 2013 - National Veterans Small Business Conference, in St. Louis, Missouri. John Hale on Small Business Funding Aug 2013 (349.4 KB) Nickolas Demer on Doing Business with Energy (2.33 MB) More Documents & Publications Business Opportunity Session July 29 2013 December 12, 2013 Business
U.S. Department of Energy (DOE) - all webpages (Extended Search)
Aggregate Aggregate Daily Graph: Weekly Graph: Monthly Graph: Yearly Graph: 2 Year Graph: Last edited: 2016-04-29 11:34:30
ChallengeHER 10-26-2016 Downloadable Flyer | Department of Energy
Office of Energy Efficiency and Renewable Energy (EERE) (indexed site)
ChallengeHER 10-26-2016 Downloadable Flyer ChallengeHER 10-26-2016 Downloadable Flyer Opportunities for Women in Federal Contracting Event ChallengeHER-10-26-2016-rev2.pdf (597.08 KB) More Documents & Publications ChallengeHER-2015-Flyer Contract Connections @ ChallengeHER, Norfolk VA, October 14 Overview of Various Socioeconomic Categories - Ann Sullivan
Downloaded 01 Jul 2002 to 128.104.222.103. Redistribution subject...
U.S. Department of Energy (DOE) - all webpages (Extended Search)
1 Jul 2002 to 128.104.222.103. Redistribution subject to AIP license or copyright, see http:ojps.aip.orgpoppopcr.jsp Downloaded 01 Jul 2002 to 128.104.222.103. Redistribution...
Downloaded 10 Jan 2005 to 128.104.223.90. Redistribution subject...
U.S. Department of Energy (DOE) - all webpages (Extended Search)
10 Jan 2005 to 128.104.223.90. Redistribution subject to AIP license or copyright, see http:pof.aip.orgpofcopyright.jsp Downloaded 10 Jan 2005 to 128.104.223.90. Redistribution...
Alternative Fuels Data Center: Maps and Data
Alternative Fuels and Advanced Vehicles Data Center
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
Alternative Fuels and Advanced Vehicles Data Center
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_thumb20160919-25948-dzcomb U.S. Production, Consumption, and Trade of Ethanol Generated_thumb20160919-25948-dzcomb Trend of total ethanol fuel production and consumption from 1981-2015 Last update September 2016 View Graph Graph Download Data
Download the SunShot Initiative 2014 Portfolio | Department of Energy
Office of Energy Efficiency and Renewable Energy (EERE) (indexed site)
SunShot Initiative 2014 Portfolio Download the SunShot Initiative 2014 Portfolio SunShot Initiative_Tackling Challenges in Solar_2014 Portfolio.pdf (8.3 MB) More Documents & Publications 2014 SunShot Initiative Portfolio Book: Tackling Challenges in Solar Energy 2014 SunShot Initiative Portfolio Book: Photovoltaics 2014 SunShot Initiative Portfolio Book: Systems Integration
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 ...
Trend Motif: A Graph Mining Approach for Analysis of Dynamic Complex Networks
Jin, R; McCallen, S; Almaas, E
2007-05-28
Complex networks have been used successfully in scientific disciplines ranging from sociology to microbiology to describe systems of interacting units. Until recently, studies of complex networks have mainly focused on their network topology. However, in many real world applications, the edges and vertices have associated attributes that are frequently represented as vertex or edge weights. Furthermore, these weights are often not static, instead changing with time and forming a time series. Hence, to fully understand the dynamics of the complex network, we have to consider both network topology and related time series data. In this work, we propose a motif mining approach to identify trend motifs for such purposes. Simply stated, a trend motif describes a recurring subgraph where each of its vertices or edges displays similar dynamics over a userdefined period. Given this, each trend motif occurrence can help reveal significant events in a complex system; frequent trend motifs may aid in uncovering dynamic rules of change for the system, and the distribution of trend motifs may characterize the global dynamics of the system. Here, we have developed efficient mining algorithms to extract trend motifs. Our experimental validation using three disparate empirical datasets, ranging from the stock market, world trade, to a protein interaction network, has demonstrated the efficiency and effectiveness of our approach.
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.
View and download all Security Smarts for your safety and security meetings
U.S. Department of Energy (DOE) - all webpages (Extended Search)
and download all Security Smarts for your safety and security meetings http://int.lanl.gov/security/documents/index.shtml#security-smarts Note: Security Smarts are current as of the date of publication. SecuritySmart Proof of United States Citizenship for the Badge Offce The Badge Offce is required by law to verify US citizenship. The following lists the acceptable documents that individuals can bring to the Badge Offce. Native-born US Citizens Primary Evidence For an individual born in the
Energy Science and Technology Software Center
002928WKSTN00 graphMC: A package for testing the independence of graphs www.sandia.gov/~apinar/graphMC/graphMC
Alternative Fuels Data Center: Maps and Data
Alternative Fuels and Advanced Vehicles Data Center
Mapthumbnail Last update May 2013 View Graph Graph Mapthumbnail Workplace Charging Challenge Partner Stations Mapthumbnail View Graph Graph Daily Truck Freight Tons Source: ...
Alternative Fuels Data Center: Maps and Data
Alternative Fuels and Advanced Vehicles Data Center
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 October 2016 View Graph Graph Download Data Generated_thumb20150820-7666-dq3brm Greenhouse Gas Emissions by Fuel Type Generated_thumb20150820-7666-dq3brm
U.S. Department of Energy (DOE) - all 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...
U.S. Department of Energy (DOE) - all 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...
U.S. Department of Energy (DOE) - all 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
U.S. Department of Energy (DOE) - all 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
Weighted Running Jobs by Group
U.S. Department of Energy (DOE) - all 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
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.
Alternative Fuels Data Center: Maps and Data
Alternative Fuels and Advanced Vehicles Data Center
electricity Go Generated_thumb20150820-7666-dq3brm Greenhouse Gas Emissions by Fuel Type Generated_thumb20150820-7666-dq3brm Life-cycle GHG emissions from different light-duty vehicle and fuel pathways Last update August 2015 View Graph Graph Download Data Electric-charging-stations Electric Charging Station Locations by State Electric-charging-stations View Map Graph Generated_thumb20160203-7437-1ibymns U.S. Plug-in Electric Vehicle Sales by Model Generated_thumb20160203-7437-1ibymns Monthly
Office of Energy Efficiency and Renewable Energy (EERE) (indexed site)
DE-DT0010963 PAGE NO (a) (b) (c) (d) (e) (f) (g) DE-EM0003586/0455/15/501866/01 Period of Performance: 03/15/2016 to 03/14/2017 00001 Task 1 - LANL Land Conveyance and Transfers 121,845.38 2016 Line item value is:$121,845.38 Incrementally Funded Amount: $121,845.38 Prescribed by GSA FAR (48 CFR) 53.213(f) OPTIONAL FORM 348 (Rev. 4/2006) AUTHORIZED FOR LOCAL REPODUCTION PREVIOUS EDITION NOT USABLE TOTAL CARRIED FORWARD TO 1ST PAGE (ITEM 17(H)) $121,845.38 Contract DE-EM0003586 Task Order
Downloads | Argonne National Laboratory
U.S. Department of Energy (DOE) - all webpages (Extended Search)
---Industrial heating & cooling ---Industrial lighting --Manufacturing -Energy sources --Renewable energy ---Bioenergy ---Geothermal energy ---Hydropower ---Solar energy ---Wind...
Downloads | Argonne National Laboratory
U.S. Department of Energy (DOE) - all webpages (Extended Search)
... Bioluminescence more accurate, forgiving than typical targeting methods October 6, 2015 CNM Scientific Contact List A list of scientific contacts for the Center for Nanoscale ...
Downloads | Argonne National Laboratory
U.S. Department of Energy (DOE) - all webpages (Extended Search)
transmission --Smart Grid -Energy economy --Energy policy Environment -Biology --Computational biology ---Bioinformatics ---Molecular dynamics --Environmental biology ...
Downloads | Argonne National Laboratory
U.S. Department of Energy (DOE) - all webpages (Extended Search)
computing, & computer science --Agent-based modeling --Applied mathematics --Artificial intelligence --Cloud computing --Computational differentiation --Geographic information ...
U.S. Department of Energy (DOE) - all webpages (Extended Search)
... Bahrain, Canada, Chile, Colombia, Costa Rica, Dominican Republic, El Salvador, Guatemala, Honduras, Korea (Republic of), Mexico, Morocco, Nicaragua, Oman, Panama, Peru, or ...
Downloads | Argonne National Laboratory
U.S. Department of Energy (DOE) - all webpages (Extended Search)
... opportunities --Postdoctoral Program --Science Bowl --Teacher training --Introduce a Girl to Engineering Day --Rube Goldberg Machine Contest --Science Careers in Search of Women ...
Downloads | Argonne National Laboratory
U.S. Department of Energy (DOE) - all webpages (Extended Search)
interactions --Catalysis & energy conversion --Electrochemical energy storage ... Title Date Posted sort ascending Energy Systems Organization Charts Charts showing ...
U.S. Department of Energy (DOE) - all webpages (Extended Search)
4 +4 67 ''%"). ), )+ 11#%1# . %) + . 5 8 695 % 5 : . 4 6; . % ' ! .& '%+$ '%+$ 6< + .$+ 6< -%+ ' . %) % '%).# '.=%#+$# )% > + .$+ > -$)+-$). % 2%! ' . . %) )% '%+$ 8 ) -$ )+ ++#$22 % '%).# '.%# ? +- ) 2.$#$+ & ! '%+$ @ 22"$+ & 1 ,$ % 1 ,$2 ; #$A" 2 . %)=1"#'0 2$ #$A )% B $ $'. /$ + .$ 7 -$)+-$).=-%+ ' . %) )% 9 1#%3$'. )% ""# $# 6 '%).# '. + '%+$ 4 4 %..#5 66
U.S. Department of Energy (DOE) - all webpages (Extended Search)
()4 67 ''%"). ), )+ 11#%1# . %) + . 5 8 695 % 5 : . 4 6; . % ' ! .& '%+$ '%+$ 6< + .$+ 6< -%+ ' . %) % '%).# '.=%#+$# )% > + .$+ > -$)+-$). % 2%! ' . . %) )% '%+$ 8 ) -$ )+ ++#$22 % '%).# '.%# ? +- ) 2.$#$+ & ! '%+$ @ 22"$+ & 1 ,$ % 1 ,$2 ; #$A" 2 . %)=1"#'0 2$ #$A )% B $ $'. /$ + .$ 7 -$)+-$).=-%+ ' . %) )% 9 1#%3$'. )% ""# $# 6 '%).# '. + '%+$ 5 5 %..#6
U.S. Department of Energy (DOE) - all webpages (Extended Search)
! "#$%&'(( )!)*+ , '- "#$%!./0%1+2!"/ )) /.%013/1+ /04
U.S. Department of Energy (DOE) - all webpages (Extended Search)
!"#$%&& ''() * %+ !"#,-".!)#/00! ' ' ,"-.1#.)0 #-23
U.S. Department of Energy (DOE) - all webpages (Extended Search)
) ,5 67 ''%"). ), )+ 11#%1# . %) + . 5 8 695 % 5 : . 4 6; . % ' ! .& '%+$ '%+$ 6< + .$+ 6< -%+ ' . %) % '%).# '.=%#+$# )% > + .$+ > -$)+-$). % 2%! ' . . %) )% '%+$ 8 ) -$ )+ ++#$22 % '%).# '.%# ? +- ) 2.$#$+ & ! '%+$ @ 22"$+ & 1 ,$ % 1 ,$2 ; #$A" 2 . %)=1"#'0 2$ #$A )% B $ $'. /$ + .$ 7 -$)+-$).=-%+ ' . %) )% 9 1#%3$'. )% ""# $# 6 '%).# '. + '%+$ 6 6
Downloads | Argonne National Laboratory
U.S. Department of Energy (DOE) - all webpages (Extended Search)
research ---Vehicle testing --Building design ---Construction ---Industrial ... system technologies & diagnostics -Energy usage --Energy life-cycle analysis --Energy ...
Downloads | Argonne National Laboratory
U.S. Department of Energy (DOE) - all webpages (Extended Search)
& fuel cells ---Internal combustion ---Maglev systems ---Powertrain research ---Vehicle testing --Building design ---Construction ---Industrial heating & cooling...
U.S. Department of Energy (DOE) - all webpages (Extended Search)
and Application Center for Hydrogen Energy Research Programs ARPA-E Basic Energy Sciences ... Sea State Contour) Code Online Abstracts and Reports Water Power Personnel ...
U.S. Department of Energy (DOE) - all webpages (Extended Search)
and Application Center for Hydrogen Energy Research Programs ARPA-E Basic Energy Sciences ... Sea State Contour) Code Online Abstracts and Reports Water Power Personnel ...
Downloads | Argonne National Laboratory
U.S. Department of Energy (DOE) - all webpages (Extended Search)
--Environmental policy & planning --Geochemistry ... -Decision science --Emergency & disaster management ... the nation to solve society's complex scientific problems. ...
U.S. Department of Energy (DOE) - all webpages (Extended Search)
&14; &15;&16; &17;&18;&16; &17; &19; &20; &21;&22; &15; &23;&17; &24;&25; &18;&26; &17;&26; &27; &14; &15;&16; &17;&18;&16; &17; &17; &15; &14; &22; &14; &27; &28;&20;&16; &18; &19; &27; &21;&22; &15;&27;&15; &25; &27; &27; &25; &26;&27;&15;&16; &24;&14; &14; &17; &25;&28;&18; &15; &27; &27; &17; &14; &25; &15; &17; &15;&17;&18; &15;&16; &17;&18;&16; &17; &17;&28;&16;&20; &27; &29; &30;&31; " %&30; &%" &31;'()%*+,-). .% &21; '...
U.S. Department of Energy (DOE) - all webpages (Extended Search)
&14; &15; &14; &14; &15; &16; &15; &17;&14; &15;&18;&19;&20; &17; &21; &14; &15; &15;&18;&19;&20; &17; &22; &18; &23; &20; &23; &24; &14;&23;&23;&17; &17; &25; &26; &27;&28;&29;&30;&31; &28;&29; &28;&30;" &22; &17;&23; &17; &18;&15;&23; &17; &23; &14; &25;% &17; &22;&& ' &17; (&18; &15;) &18;&17; *&14; &15;&18;&19;&20; &17; &16; &17; &18;&19;&20;&21;&19;&22; &23;&24;&22; &18;&25;&21;&24;&26;&24;&27;&20;&27;&24;&25;&17;&18; &28;&25;&29;&29;&19;&30;&28; &20;&17;&22; &28;&25;&29;&29;&19;&30;&25;&30;&28;...
U.S. Department of Energy (DOE) - all webpages (Extended Search)
&25;"87 %"&30;&28;)%"&31; &28;%9 &26;8 &25; %"%&30;&25;& :&30; &29;& 2(&26; &22;%&28;&28;%"&31; %"&&26;)&30;&%(" (" &' &26; 9 &26; 7 &'% &28;%9 &26;8 (&26; &26; % )&22;; &30;& &( %"&&26;)&30;&%(" &30;("&&25;%" (" &'% % ("&28;8 (2 &'% 2(&26;* &25;" %...
U.S. Department of Energy (DOE) - all webpages (Extended Search)
! " " " # $ % &'()*+ ,-.*++ '/0*12)+* +(*&)3)*4 5 $ 6 5 $$ & & " $$ 7 " " 8 $ " $ 8 8 " 9 $ 9 $ $ $ 5 6 6 " " 6 " $ $ $ 6 9 $ : 8 $ $ : : : $ 5 9 8 8 8 8 8 8 8 8 8 " ! ; " " ! '-/1<&/'1 <=1**+ /' 3,1-)+0 <-4 4*.)>*1 <.. )/*?+ '1 (*13'1? <.. /0* +*1>)&*+ +*/ 3'1/0 '1 '/0*12)+* )4*-/)3)*4 <@'>* <-4 '- <-A &'-/)-,</)'- +0**/+ 3'1 /0* &'-+)4*1</)'- +/</*4
U.S. Department of Energy (DOE) - all webpages (Extended Search)
Policies User Surveys NERSC Users Group Help Staff Blogs Request Repository Mailing List Need Help? Out-of-hours Status and Password help Call operations: 1-800-66-NERSC, option 1 ...
Alternative Fuels Data Center: Maps and Data
Alternative Fuels and Advanced Vehicles Data Center
2 results Generated_thumb20160118-19920-ynpbqh Clean Cities Alternative Fuel and Advanced Vehicle Inventory Generated_thumb20160118-19920-ynpbqh Advanced fuel and advanced vehicle inventory reported by Clean Cities coalitions 2004-2014 Last update January 2016 View Graph Graph Download Data Generated_thumb20160307-8286-1s0ziiw Clean Cities Petroleum Savings by AFV Type Generated_thumb20160307-8286-1s0ziiw Trend of displacement by fuels used in AFVs from 2004-2014 Last update March 2016 View
EERC computes an average annual escalation rate for a specified time period, which can be used as an escalation rate for contract payments in energy savings performance contracts and utility energy services contracts.
Energy Escalation Rate Calculator Download
Energy Escalation Rate Calculator (EERC) computes an average annual escalation rate for a specified time period, which can be used as an escalation rate for contract payments in energy savings performance contracts and utility energy services contracts.
Energy Science and Technology Software Center
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.
Ion Beams - Radiation Effects Facility / Cyclotron Institute...
U.S. Department of Energy (DOE) - all webpages (Extended Search)
Various ion beams have been developed specifically for the Radiation Effects Facility. ... Range Graph 40 Mevu LET vs Range Graph Radiation Effects Facility Cyclotron Institute ...
Trends in Commercial Buildings--Total Primary Energy Detail
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
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
U.S. Department of Energy (DOE) - all 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
U.S. Department of Energy (DOE) - all 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...
U.S. Department of Energy (DOE) - all 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...
U.S. Department of Energy (DOE) - all 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...
U.S. Department of Energy (DOE) - all webpages (Extended Search)
HEP Meeting Materials Meeting Materials Here you will find various items to be used before and during the requirements review. The following documents are included: Case study worksheet to be filled in by meeting participants Sample of a completed case study from a Nuclear Physics requirements workshop held in 2011 A graph of NERSC and HEP usage as a function of time A powerpoint template you can use at the requirements review Downloads CaseStudyTemplate.docx | unknown Case Study Worksheet -
Working Gas in Underground Storage Figure
Gas in Underground Storage Figure Working Gas in Underground Storage Compared with 5-Year Range Graph...
Energy Science and Technology Software Center
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).
Plechaty, E.F.; Cullen, D.E.; Howerton, R.J.
1981-11-11
Energy-dependent evaluated photon interaction cross sections and related parameters are presented for elements H through Cf(Z = 1 to 98). Data are given over the energy range from 0.1 keV to 100 MeV. The related parameters include form factors and average energy deposits per collision (with and without fluorescence). Fluorescence information is given for all atomic shells that can emit a photon with a kinetic energy of 0.1 keV or more. In addition, the following macroscopic properties are given: total mean free path and energy deposit per centimeter. This information is derived from the Livermore Evaluated-Nuclear-Data Library (ENDL) as of October 1978.
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.
QTR 2015 - Downloads | Department of Energy
Office of Energy Efficiency and Renewable Energy (EERE) (indexed site)
Chapter 6 - Innovating Clean Energy Technologies in Advanced Manufacturing Chapter 7 - Advancing Systems and Technologies to Produce Cleaner Fuels Chapter 8 - Advancing Clean ...
EERC Linux Download | Department of Energy
Office of Energy Efficiency and Renewable Energy (EERE) (indexed site)
energy price projections used for calculating the Federal Energy Management Program (FEMP) discount factors and on EIA projections adjusted by NIST for potential carbon pricing. ...
Women @ Energy Poster Download: Terri Quinn
Office of Energy Efficiency and Renewable Energy (EERE)
Women @ Energy showcases outstanding Energy Department employees who are helping change the world, ensuring America’s security and prosperity through transformative science and technology solutions...
Download Sandia's Microgrid Design Toolkit (MDT)
U.S. Department of Energy (DOE) - all webpages (Extended Search)
... Permalink International Conference on Integration of Renewable and Distributed Energy Resources (IRED): Coming October 2016 Sandia Labs Presents Grid Integration Research at IEEE ...
Downloadable Dynamometer Database | Argonne National Laboratory
U.S. Department of Energy (DOE) - all webpages (Extended Search)
Hybrid Electric Vehicles Plug-In Hybrid Electric Vehicles Electric Vehicles Conventional Vehicles Conventional Start-Stop Vehicles Alternative Fuel Vehicles Facilities Publications News About Us For ES Employees Staff Directory About Us For ES Employees Staff Directory Argonne National Laboratory Energy Systems Research Facilities Publications News Research Advanced Materials and Manufacturing Advanced Vehicle Technologies Buildings and Climate-Environment Education and Outreach Energy, Power,
Annual Energy Review - Energy Information Administration
Energy Information Administration (EIA) (indexed site)
... shipments by market sector, end use, and type, 2000- PDF XLS GRAPH 10.8 Photovoltaic cell and module shipments by type, trade, and prices, 1982- PDF XLS GRAPH 10.9 ...
Energy Science and Technology Software Center
003500WKSTN00 EAGLE: 'EAGLE'Is an' Algorithmic Graph Library for Exploration https://github.com/ssrangan
Energy Science and Technology Software Center
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...
U.S. Department of Energy (DOE) - all webpages (Extended Search)
time windows) Some problems have strong compute requirements Eigensolves, LSA, LMSA (lots of matrix multiplies) Graph algorithms Some problems have...
U.S. Department of Energy (DOE) - all webpages (Extended Search)
... networks, integer programming, graph algorithms, vehicle routing, computational biology, experimental algorithmics, complex network analysis, cybersecurity Education and ...
Energy Science and Technology Software Center
002909WKSTN00 Highly Asynchronous VisitOr Queue Graph Toolkit https://bitbucket.org/PerMA/havoggt/
Energy Science and Technology Software Center
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
002861MLTPL00 Integrated Network Decompositions and Dynamic Programming for Graph Optimization (INDDGO) http://github.org/bdsullivan/INDDGO
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.
Working Gas in Underground Storage Figure
Gasoline and Diesel Fuel Update
Working Gas in Underground Storage Figure Working Gas in Underground Storage Compared with 5-Year Range Graph.
Office of Legacy Management (LM)
.........7 Water Sampling Field Activities Verification ... Groundwater Quality Data Static Water Level Data Time-Concentration Graphs ...
NREL: Jobs and Economic Development Impact (JEDI) Models - Downloading...
U.S. Department of Energy (DOE) - all webpages (Extended Search)
C10.13.14. (Excel 341 KB) JEDI Hydroelectric Power Models ... P11.04.14. (Excel 4.3 MB) JEDI Transmission Line Model JEDI ... Office of Energy Efficiency and Renewable Energy, ...
Geothermal Technologies Office: Download GETEM, August 2012 Beta
Office of Energy Efficiency and Renewable Energy (EERE) (indexed site)
Seychelles Sierra Leone Singapore Slovak Republic Slovenia South Africa South Korea Spain Sri Lanka Sudan Suriname Swaziland Sweden Switzerland Syria Taiwan Tanzania Thailand...
5 Reasons to Download the New Building America Solutions App
With the new Building America Solutions app, residential building professionals will have access to accurate, reliable, and expert information anytime and everywhere.
Small Business Award to Sage Energy Trading Download | Department...
Small-Business-Award-to-Sage-Energy-Trading.pdf (118.95 KB) More Documents & Publications DOE Employee Concerns Program Contact List LANL Natural Resource Damage Assessment ...
AVTA: 2012 Chevrolet Volt PHEV Downloadable Dynamometer Database Reports
The Vehicle Technologies Office's Advanced Vehicle Testing Activity carries out testing on a wide range of advanced vehicles and technologies on dynamometers, closed test tracks, and on-the-road. ...
AVTA: 2012 Toyota Prius PHEV Downloadable Dynamometer Database Reports
The Vehicle Technologies Office's Advanced Vehicle Testing Activity carries out testing on a wide range of advanced vehicles and technologies on dynamometers, closed test tracks, and on-the-road. ...
AVTA: 2009 Volkswagen Jetta TDI Diesel Downloadable Dynamometer Database Reports
The Vehicle Technologies Office's Advanced Vehicle Testing Activity carries out testing on a wide range of advanced vehicles and technologies on dynamometers, closed test tracks, and on-the-road. ...
Wind and Water Materials and Structures Database Download
U.S. Department of Energy (DOE) - all webpages (Extended Search)
Safety, Security & Resilience of the Energy Infrastructure Energy Storage Nuclear Power & ... Eritrea Estonia Ethiopia Fiji Finland France French Polynesia Gabon Gambia Georgia ...
This content has been downloaded from IOPscience. Please scroll...
U.S. Department of Energy (DOE) - all webpages (Extended Search)
... At fusion-grade temperatures this can introduce non-negligible error. The results above ... spectrum calculation as well as optimization of scattered intensity for cold electrons. ...
This content has been downloaded from IOPscience. Please scroll...
U.S. Department of Energy (DOE) - all webpages (Extended Search)
... KEYWORDS: Detector alignment and calibration methods (lasers, sources, particle-beams); Plasma diagnostics - interferometry, spectroscopy and imaging; Analysis and statistical ...
5 Reasons to Download the New Building America Solutions App...
Office of Energy Efficiency and Renewable Energy (EERE) (indexed site)
ducts, insulation, HVAC and over 150 specific measures for constructing high-performance, energy-efficient buildings. 4. With the Building America Solutions app, registered users...
This content has been downloaded from IOPscience. Please scroll...
U.S. Department of Energy (DOE) - all webpages (Extended Search)
... At low currents, there is up to a 40% drop in flashlamp energy and 30% drop in laser pulse energy, but this saturates to about a 10% drop at higher currents. voltage specification ...
DOE Booth Presentations From Grainger Show 2015 Downloads
DOE hosted its solid-state lighting informational booth February 16–18 at the annual Grainger Show in Orlando, FL. With over 17,000 attendees and over 750 exhibitors, the show gathered a wide range of Grainger customers—from universities to large hotel chains as well as Grainger team members to learn the latest about LED lighting.
Fleet DNA Project Data Dictionary for Public Download Files
U.S. Department of Energy (DOE) - all webpages (Extended Search)
Files A. Duran, E. Burton, K. Kelly, and K. Walkowicz Technical Report NRELTP-5400-62572 September 2014 NREL is a national laboratory of the U.S. Department of Energy ...
Fleet DNA Project - Data Dictionary for Public Download Files
Duran, A.; Burton, E.; Kelly, K.; Walkowicz, K.
2014-09-01
Reference document for the Fleet DNA results data shared on the NREL public website. The document includes variable definitions and descriptions to assist users in understanding data.
This content has been downloaded from IOPscience. Please scroll...
U.S. Department of Energy (DOE) - all webpages (Extended Search)
... L F r r m n r r r m n n m n g m n m n rG r r gF r rG g mn Gg m n n gG F m n d d d d 1 2 ( ) ( ) 1 d d d ( ) d 2 2 ( ) , 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 (10) ...
This content has been downloaded from IOPscience. Please scroll...
U.S. Department of Energy (DOE) - all webpages (Extended Search)
... sent through the chain, again possibly exceeding the damage threshold. To avoid the problems described above, the laser source was specified to operate with less than 0.2% rms ...
This content has been downloaded from IOPscience. Please scroll...
U.S. Department of Energy (DOE) - all webpages (Extended Search)
Please note that terms and conditions apply. Control of 3D ... Home Search Collections Journals About Contact us My ... poloidal magnetic field to enter the interior of the thick ...
Download the SunShot Initiative 2014 Portfolio | Department of...
Office of Energy Efficiency and Renewable Energy (EERE) (indexed site)
More Documents & Publications 2014 SunShot Initiative Portfolio Book: Tackling Challenges in Solar Energy 2014 SunShot Initiative Portfolio Book: Photovoltaics Revitalizing ...
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
U.S. Department of Energy (DOE) - all 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
U.S. Department of Energy (DOE) - all 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)
Concurrent Transfers Historical Yearly Peak
U.S. Department of Energy (DOE) - all 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
U.S. Department of Energy (DOE) - all 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. ...
Office of Energy Efficiency and Renewable Energy (EERE) (indexed site)
Equipment (check) 12. Other Equipment (check) 13. If Audio Recording Requested, DOE Br. ... No Projection Services Required Projectors (vu-graph) Projectors: 35mm Audio Tape Player ...
Fact #920: April 11, 2016 Electric Charging Stations are the...
Office of Energy Efficiency and Renewable Energy (EERE) (indexed site)
The other fuel types (biodiesel, liquefied natural gas (LNG) and hydrogen) altogether have ... Graph showing alternative fueling stations by futel type (E85, CNG, Biodiesel, Hydrogen, ...
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). ...
Concurrent Transfers Historical Yearly Peak
U.S. Department of Energy (DOE) - all 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...
The Apache Software Foundation Announces Apache® TinkerPop(tm) as a
U.S. Department of Energy (DOE) - all 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
Microsoft Word - S07834_2011 Ann Rpt_ag comment revs
Office of Legacy Management (LM)
... of sparklines, which are simple condensed plots intended as a big-picture overview. Essentially, this figure combines data that might require 10 graphs to present adequately. ...
EIA Energy Information Administration
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...
Fact #705: December 12, 2011 Fuel Consumption Standards for Combinatio...
Energy.gov [DOE] (indexed site)
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 ...
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 ...
Gasoline and Diesel Fuel Update
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....
Fact #575: June 15, 2009 Diesel Car Sales in Europe Still Over...
Energy.gov [DOE] (indexed site)
Western Europe Diesel Car Market Share, 1999-2008 Graph showing the Western Europe (Belgium, France, Germany, Italy, Norway, Spain, Switzerland, and United Kingdom) Diesel Car ...
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, ...
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 ...
Energy Science and Technology Software Center
002728IBMPC02 PylotDB - A Database Management, Graphing, and Analysis Tool Written in Python http://pmatwiki.sandia.gov/pmatwiki/how-to-use-pylot
Polyamine-Tethered Porous Polymer Networks for Carbon Dioxide...
U.S. Department of Energy (DOE) - all 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...
Webinar: Overview of Funding Opportunity Announcement DE-FOA...
Office of Energy Efficiency and Renewable Energy (EERE) (indexed site)
the DOE's Office of Energy Efficiency and Renewable Energy. ... via microbial biomass conversion; low platinum group ... The concept paper can also include graphs, charts, or other ...
DOE-NE-STD-1004-92; Root Cause Analysis Guidance Document
Office of Environmental Management (EM)
February 1992 U.S. Department of Energy Office of Nuclear ... processing plants, coal conversion plants, ... Radiological surveys Trend charts and graphs Facility ...
SEP Special Projects Report: Future Outlook and Appendix
2000-07-01
The Sharing Success appendix provides the future outlook for SEP as well as charts and graphs for grants and Special Projects.
DISPLAYING AND INTERPRETING FLUID INCLUSION STRATIGRAPHY ANALYSES...
OpenEI (Open Energy Information) [EERE & EIA]
DISPLAYING AND INTERPRETING FLUID INCLUSION STRATIGRAPHY ANALYSES ON MUDLOG GRAPHS Jump to: navigation, search OpenEI Reference LibraryAdd to library Conference Proceedings:...
U.S. Department of Energy (DOE) - all 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...
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. ...
U.S. Department of Energy (DOE) - all 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 ...
Quarks Pair Up in Protons (and Neutrons) | Jefferson Lab
U.S. Department of Energy (DOE) - all 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 ...
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.
ASC eNews Quarterly Newsletter June 2012 | National Nuclear Security...
National Nuclear Security Administration (NNSA)
... simulations, vortices (swirls of water) in the Indian Ocean. ... of the dynamics for hot-spot initiation at ... Lane, T. (2011). "Graph-based malware detection using ...
U.S. Department of Energy (DOE) - all webpages (Extended Search)
this figure, please see http:www.arm.govdocsdocumentstechnicalconf9803austin-98.pdf.) Session Papers 41 Figure 2. These graphs show various optical properties obtained...
Working Gas in Underground Storage Figure
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
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...
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.
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 ...
Microsoft PowerPoint - FeoSalishan_10
U.S. Department of Energy (DOE) - all 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...
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.
NREL: Transportation Research - Capabilities
U.S. Department of Energy (DOE) - all webpages (Extended Search)
A Vision for Sustainable Transportation Line graph illustrating three pathways (biofuel, hydrogen, and electric vehicle) to reduce energy use and greenhouse gas emissions. Electric ...
Fact #795: September 2, 2013 Electric Vehicle Charging Stations...
Energy.gov [DOE] (indexed site)
Charger installations have risen in nearly all states, but a dozen states, shown in the graph below, account for a majority of all installations. Electric Vehicle Charging Stations ...
Fact #910: February 1, 2016 Study Shows Average Cost of Electric...
Energy.gov [DOE] (indexed site)
site and other factors such as permit and inspection fees. Installation Costs of Electric Vehicle Charging Stations by Type, 2011-2013 (INL Study) Graph showing installation costs ...
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. ...
Office of Energy Efficiency and Renewable Energy (EERE) (indexed site)
... Data for the graph courtesy Karl Stum; Summit Engineering Verification and Prestart Checks Functional Testing Opposite Season Testing Trend Analysis Responsibility Shifting from ...
Solar Background Document 4 | Department of Energy
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 ...
Solar Background Document 5 | Department of Energy
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 & ...
Sandia Energy - Sandia Magnetized Fusion Technique Produces Significan...
U.S. Department of Energy (DOE) - all 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...
Search for: All records | SciTech Connect
Office of Scientific and Technical Information (OSTI)
... paper will benefit other researchers implementing graph algorithms on modern GPU architectures. less September 2015 , IEEE Computer Society, Los Alamitos, CA, United States(US). ...
Search for: All records | SciTech Connect
Office of Scientific and Technical Information (OSTI)
... paper will benefit other researchers implementing graph algorithms on modern GPU architectures. less September 2015 , IEEE Computer Society, Los Alamitos, CA, United States(US).
This Week In Petroleum Gasoline Section
Gasoline and Diesel Fuel Update
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 11/16/15 11/14/16 11/07/16 10/31/16 10/24/16 10/17/16 10/10/16 10/03/16 U.S. 2.178 2.184 2.233 2.230 2.243 2.257 2.272
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 ...
Gasoline and Diesel Fuel Update
and accurate; and developing tables and graphs for electronic publication on the web. * Manage lists of respondents, to ensure that they are accurate and up-to-date * ...
AmeriFlux Network Data from the ORNL AmeriFlux Website
The AmeriFlux network was established in 1996 to provide continuous observations of ecosystem level exchanges of CO2, water, energy and momentum spanning diurnal, synoptic, seasonal, and interannual time scales. It is fed by sites from North America, Central America, and South America. DOE's CDIAC stores and maintains AmeriFlux data, and this web site explains the different levels of data available there, with links to the CDIAC ftp site. A separate web-based data interface is also provided; it allows users to graph, query, and download Level 2 data for up to four sites at a time. Data may be queried by site, measurement period, or parameter. More than 550 site-years of level 2 data are available from AmeriFlux sites through the interface.
A representation for efficient temporal reasoning
Delgrande, J.P.; Gupta, A.
1996-12-31
It has been observed that the temporal reasoning component in a knowledge-based system is frequently a bottleneck. We investigate here a class of graphs appropriate for an interesting class of temporal domains and for which very efficient algorithms for reasoning are obtained, that of series-parallel graphs. These graphs can be used for example to model process execution, as well as various planning or scheduling activities. Events are represented by nodes of a graph and relationships are represented by edges labeled by {le} or <. Graphs are composed using a sequence of series and parallel steps (recursively) on series-parallel graphs. We show that there is an O(n) time preprocessing algorithm that allows us to answer queries about the events in O(l) time. Our results make use of a novel embedding of the graphs on the plane that is of independent interest. Finally we argue that these results may be incorporated in general graphs representing temporal events by extending the approach of Gerevini and Schubert.
Multidimensional spectral load balancing
Hendrickson, Bruce A.; Leland, Robert W.
1996-12-24
A method of and apparatus for graph partitioning involving the use of a plurality of eigenvectors of the Laplacian matrix of the graph of the problem for which load balancing is desired. The invention is particularly useful for optimizing parallel computer processing of a problem and for minimizing total pathway lengths of integrated circuits in the design stage.
National Nuclear Security Administration (NNSA)
D bo a 10 12 15 18 21 24 Hour of Day MST Graph HI-20. Daily March of Wind Speed, 7-Year Averages (1 961-1967), July 53 Hour of Day MST. Graph ni-21. Daily March of Wind Speed,...
Statistically significant relational data mining :
Berry, Jonathan W.; Leung, Vitus Joseph; Phillips, Cynthia Ann; Pinar, Ali; Robinson, David Gerald; Berger-Wolf, Tanya; Bhowmick, Sanjukta; Casleton, Emily; Kaiser, Mark; Nordman, Daniel J.; Wilson, Alyson G.
2014-02-01
This report summarizes the work performed under the project (3z(BStatitically significant relational data mining.(3y (BThe goal of the project was to add more statistical rigor to the fairly ad hoc area of data mining on graphs. Our goal was to develop better algorithms and better ways to evaluate algorithm quality. We concetrated on algorithms for community detection, approximate pattern matching, and graph similarity measures. Approximate pattern matching involves finding an instance of a relatively small pattern, expressed with tolerance, in a large graph of data observed with uncertainty. This report gathers the abstracts and references for the eight refereed publications that have appeared as part of this work. We then archive three pieces of research that have not yet been published. The first is theoretical and experimental evidence that a popular statistical measure for comparison of community assignments favors over-resolved communities over approximations to a ground truth. The second are statistically motivated methods for measuring the quality of an approximate match of a small pattern in a large graph. The third is a new probabilistic random graph model. Statisticians favor these models for graph analysis. The new local structure graph model overcomes some of the issues with popular models such as exponential random graph models and latent variable models.
Scalable Association Rule Mining with Predicates on Semantic Representations of Data
Tsay, Li-Shiang; Sukumar, Sreenivas R; Roberts, Larry W
2015-01-01
Finding semantic associations from a vast amount of heterogeneous data is an important and useful task in various applications. We present a framework to extract semantic association patterns directly from a very large graph dataset without the extra step of converting graph data into transaction data.
Energy Science and Technology Software Center
2009-06-08
Nem_slice reads in a finite element model description of the geometry of a problem from an ExodusII file and generates either a nodal or elemental graph of the problem. It then calls Chaco to load balance the graph and then outputs a NemesisI load-balance file.
Scenario driven data modelling: a method for integrating diverse sources of data and data streams
Brettin, Thomas S.; Cottingham, Robert W.; Griffith, Shelton D.; Quest, Daniel J.
2015-09-08
A system and method of integrating diverse sources of data and data streams is presented. The method can include selecting a scenario based on a topic, creating a multi-relational directed graph based on the scenario, identifying and converting resources in accordance with the scenario and updating the multi-directed graph based on the resources, identifying data feeds in accordance with the scenario and updating the multi-directed graph based on the data feeds, identifying analytical routines in accordance with the scenario and updating the multi-directed graph using the analytical routines and identifying data outputs in accordance with the scenario and defining queries to produce the data outputs from the multi-directed graph.
Enhancing Community Detection By Affinity-based Edge Weighting Scheme
Yoo, Andy; Sanders, Geoffrey; Henson, Van; Vassilevski, Panayot
2015-10-05
Community detection refers to an important graph analytics problem of finding a set of densely-connected subgraphs in a graph and has gained a great deal of interest recently. The performance of current community detection algorithms is limited by an inherent constraint of unweighted graphs that offer very little information on their internal community structures. In this paper, we propose a new scheme to address this issue that weights the edges in a given graph based on recently proposed vertex affinity. The vertex affinity quantifies the proximity between two vertices in terms of their clustering strength, and therefore, it is ideal for graph analytics applications such as community detection. We also demonstrate that the affinity-based edge weighting scheme can improve the performance of community detection algorithms significantly.
Predicting and Detecting Emerging Cyberattack Patterns Using StreamWorks
Chin, George; Choudhury, Sutanay; Feo, John T.; Holder, Larry
2014-06-30
The number and sophistication of cyberattacks on industries and governments have dramatically grown in recent years. To counter this movement, new advanced tools and techniques are needed to detect cyberattacks in their early stages such that defensive actions may be taken to avert or mitigate potential damage. From a cybersecurity analysis perspective, detecting cyberattacks may be cast as a problem of identifying patterns in computer network traffic. Logically and intuitively, these patterns may take on the form of a directed graph that conveys how an attack or intrusion propagates through the computers of a network. Such cyberattack graphs could provide cybersecurity analysts with powerful conceptual representations that are natural to express and analyze. We have been researching and developing graph-centric approaches and algorithms for dynamic cyberattack detection. The advanced dynamic graph algorithms we are developing will be packaged into a streaming network analysis framework known as StreamWorks. With StreamWorks, a scientist or analyst may detect and identify precursor events and patterns as they emerge in complex networks. This analysis framework is intended to be used in a dynamic environment where network data is streamed in and is appended to a large-scale dynamic graph. Specific graphical query patterns are decomposed and collected into a graph query library. The individual decomposed subpatterns in the library are continuously and efficiently matched against the dynamic graph as it evolves to identify and detect early, partial subgraph patterns. The scalable emerging subgraph pattern algorithms will match on both structural and semantic network properties.
Large-Scale Continuous Subgraph Queries on Streams
Choudhury, Sutanay; Holder, Larry; Chin, George; Feo, John T.
2011-11-30
Graph pattern matching involves finding exact or approximate matches for a query subgraph in a larger graph. It has been studied extensively and has strong applications in domains such as computer vision, computational biology, social networks, security and finance. The problem of exact graph pattern matching is often described in terms of subgraph isomorphism which is NP-complete. The exponential growth in streaming data from online social networks, news and video streams and the continual need for situational awareness motivates a solution for finding patterns in streaming updates. This is also the prime driver for the real-time analytics market. Development of incremental algorithms for graph pattern matching on streaming inputs to a continually evolving graph is a nascent area of research. Some of the challenges associated with this problem are the same as found in continuous query (CQ) evaluation on streaming databases. This paper reviews some of the representative work from the exhaustively researched field of CQ systems and identifies important semantics, constraints and architectural features that are also appropriate for HPC systems performing real-time graph analytics. For each of these features we present a brief discussion of the challenge encountered in the database realm, the approach to the solution and state their relevance in a high-performance, streaming graph processing framework.
Conceptual Framework to Enable Early Warning of Relevant Phenomena (Emerging Phenomena and Big Data)
Schlicher, Bob G; Abercrombie, Robert K; Hively, Lee M
2013-01-01
Graphs are commonly used to represent natural and man-made dynamic systems such as food webs, economic and social networks, gene regulation, and the internet. We describe a conceptual framework to enable early warning of relevant phenomena that is based on an artificial time-based, evolving network graph that can give rise to one or more recognizable structures. We propose to quantify the dynamics using the method of delays through Takens Theorem to produce another graph we call the Phase Graph. The Phase Graph enables us to quantify changes of the system that form a topology in phase space. Our proposed method is unique because it is based on dynamic system analysis that incorporates Takens Theorem, Graph Theory, and Franzosi-Pettini (F-P) theorem about topology and phase transitions. The F-P Theorem states that the necessary condition for phase transition is a change in the topology. By detecting a change in the topology that we represent as a set of M-order Phase Graphs, we conclude a corresponding change in the phase of the system. The onset of this phase change enables early warning of emerging relevant phenomena.
Final Report for Project DE-FC02-06ER25755 [Pmodels2
Panda, Dhabaleswar; Sadayappan, P
2014-03-12
In this report, we describe the research accomplished by the OSU team under the Pmodels2 project. The team has worked on various angles: designing high performance MPI implementations on modern networking technologies (Mellanox InfiniBand (including the new ConnectX2 architecture and Quad Data Rate), QLogic InfiniPath, the emerging 10GigE/iWARP and RDMA over Converged Enhanced Ethernet (RoCE) and Obsidian IB-WAN), studying MPI scalability issues for multi-thousand node clusters using XRC transport, scalable job start-up, dynamic process management support, efficient one-sided communication, protocol offloading and designing scalable collective communication libraries for emerging multi-core architectures. New designs conforming to the Argonne’s Nemesis interface have also been carried out. All of these above solutions have been integrated into the open-source MVAPICH/MVAPICH2 software. This software is currently being used by more than 2,100 organizations worldwide (in 71 countries). As of January ’14, more than 200,000 downloads have taken place from the OSU Web site. In addition, many InfiniBand vendors, server vendors, system integrators and Linux distributors have been incorporating MVAPICH/MVAPICH2 into their software stacks and distributing it. Several InfiniBand systems using MVAPICH/MVAPICH2 have obtained positions in the TOP500 ranking of supercomputers in the world. The latest November ’13 ranking include the following systems: 7th ranked Stampede system at TACC with 462,462 cores; 11th ranked Tsubame 2.5 system at Tokyo Institute of Technology with 74,358 cores; 16th ranked Pleiades system at NASA with 81,920 cores; Work on PGAS models has proceeded on multiple directions. The Scioto framework, which supports taskparallelism in one-sided and global-view parallel programming, has been extended to allow multi-processor tasks that are executed by processor groups. A quantum Monte Carlo application is being ported onto the extended Scioto framework. A
bbnp_bb_an_0003578_pmc_dashboard_y13-q3.xls
Office of Energy Efficiency and Renewable Energy (EERE) (indexed site)
7T21:49:33Z docProps/ xl/_rels/workbook.xml.rels xl/_rels/ xl/calcChain.xml xl/charts/chart1.xml Better Buildings Neighborhood Program Grantee ExpendituresCumulative Data - Award Start to September 30, 2013 'Expenditure Graph Data'!$D$4BBNP Award Spending'Expenditure Graph Data'!$B$5:$B$162010-Q42011-Q12011-Q22011-Q32011-Q42012-Q12012-Q22012-Q32012-Q42013-Q12013-Q22013-Q3'Expenditure Graph
Bandwidth Historical Peak Days
U.S. Department of Energy (DOE) - all webpages (Extended Search)
Bandwidth Historical Peak Days Bandwidth Historical Peak Days These plots show 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. Transfer Rate vs. Size Transfer Rate vs. Size Transfer Rate vs. Size Transfer Rate vs. Size Transfer Rate vs. Size Transfer Rate vs. Size Transfer Rate vs. Size Transfer Rate vs. Size Transfer
Bandwidth and Transfer Activity
U.S. Department of Energy (DOE) - all webpages (Extended Search)
Activity Bandwidth and Transfer Activity Data Rate vs. File Size The graph below shows the bandwidth for individual file transfers for one day. The graph also gives a quick overview of the traffic and maximum bandwidth and file size for a given day. Historical yearly peak days Daily Rate vs. Size Aggregate Transfer Bandwidth This graph shows the aggregate transfer rate to the storage systems as a function of time of day. The red line is the peak bandwidth observed within each one minute
Code System for Data Plotting and Curve Fitting.
Energy Science and Technology Software Center
2001-07-23
Version 00 PLOTnFIT is used for plotting and analyzing data by fitting nth degree polynomials of basis functions to the data interactively and printing graphs of the data and the polynomial functions. It can be used to generate linear, semilog, and log-log graphs and can automatically scale the coordinate axes to suit the data. Multiple data sets may be plotted on a single graph. An auxiliary program, READ1ST, is included which produces an on-line summarymore » of the information contained in the PLOTnFIT reference report.« less
Energy Science and Technology Software Center
2013-12-19
The software implements the generative graph algorithm described in the following reference: T. G. Kolda, A. Pinar, T. Plantenga and C. Seshadhri. A Scalable Generative Graph Model with Community Structure, arXiv:1302.6636, March 2013, http:l/arxiv.org/abs/1302.6636. The software also implements the clustering coefficient algorithms described in C. Seshadhri, A. Pinar and T. G. Kolda. Triadic Measures on Graphs: The Power of Wedge Sampling, in Proc. 2013 SIAM International Conference on Data Mining {SDM), May 2013.
Transfer Activity Historical Yearly Peak
U.S. Department of Energy (DOE) - all webpages (Extended Search)
Activity Historical Yearly Peak Transfer Activity Historical Yearly Peak The plots below 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 the current year shows the data for the year-to-date peak. Transfers Started/In Progress Transfers Started/In Progress Transfers Started/In Progress Transfers Started/In Progress Transfers Started/In Progress Transfers Started/In
Multicomponent Geothermometers | Open Energy Information
OpenEI (Open Energy Information) [EERE & EIA]
of using full chemical analyses of water samples to compute the saturation indices (log(QK)) of reservoir minerals over a range of temperatures. The saturation indices are graphed...
Fact #606: January 18, 2010 New Vehicles Trend Toward Smaller Engines
In 2008, the number of 4-cylinder engine installations rose to 57% of all cars manufactured in that year. The graph below shows that the cars produced in 1999 and 2003 were very close to the same...
Search results | Department of Energy
Office of Energy Efficiency and Renewable Energy (EERE) (indexed site)
tea brewed by boiling water. Students will compare their two samples on four criteria-color, clarity, smell and taste-rate which they prefer, and graph the results of the...
Fact #911: February 8, 2016 Workplace Charging Increases VMT...
Office of Energy Efficiency and Renewable Energy (EERE) (indexed site)
Those with WPC averaged an additional 2,336 miles on electricity and eVMT rose to 83% of their overall VMT. The bottom bar of the graph shows the national average annual VMT for ...
Microsoft Word - 2012 Abstract Book FINAL.docx
U.S. Department of Energy (DOE) - all webpages (Extended Search)
... Rugged Sensor MPA---CINT C enter f or I ntegrated N ... Science 57 Baumbach, Ryan Search for Quantum Criticality in ... attacks in terms of the graph of the power network. ...
U.S. Department of Energy (DOE) - all webpages (Extended Search)
...1.51 is used for comparison on other figures, is obtained from this graph. Bottom, Right: The average spectrum for each month's NOAA 12 (AVHRR) data is shown here. The spectra area ...
West Virginia Smart Grid Implementation Plan (WV SGIP) Project
U.S. Department of Energy (DOE) - all webpages (Extended Search)
in Table 1 and the graphs shown in Figure 2 that the total of customer reported problems for voltage quality and power outages have approximately doubled in the past ten years. ...
Eia.gov BETA - Data - U.S. Energy Information Administration...
... Can we export just selected data series in the same way that we can now graph them? That ... This might not matter over the short-term but makes a big difference over the span of ...
Building America Case Study: Long-Term Monitoring of Mini-Split...
Office of Energy Efficiency and Renewable Energy (EERE) (indexed site)
... Image credit: All images were created by the BSC team. On-Off Operation (Varying Set Point) House (1,132 ft 2 ) Constant Set Point Operation House (1,239 ft 2 ) Graphs comparing ...
Coram, Jamie L.; Morrow, James D.; Perkins, David Nikolaus
2015-09-01
This document describes the PANTHER R&D Application, a proof-of-concept user interface application developed under the PANTHER Grand Challenge LDRD. The purpose of the application is to explore interaction models for graph analytics, drive algorithmic improvements from an end-user point of view, and support demonstration of PANTHER technologies to potential customers. The R&D Application implements a graph-centric interaction model that exposes analysts to the algorithms contained within the GeoGraphy graph analytics library. Users define geospatial-temporal semantic graph queries by constructing search templates based on nodes, edges, and the constraints among them. Users then analyze the results of the queries using both geo-spatial and temporal visualizations. Development of this application has made user experience an explicit driver for project and algorithmic level decisions that will affect how analysts one day make use of PANTHER technologies.
Search results | Department of Energy
Office of Energy Efficiency and Renewable Energy (EERE) (indexed site)
Students will compare their two samples on four criteria-color, clarity, smell and taste-rate which they prefer, and graph the results of the experiment as a class. http:...
Fact #841: October 6, 2014 Vehicles per Thousand People: U.S. vs. Other World Regions
Office of Energy Efficiency and Renewable Energy (EERE)
The graphs below show the number of motor vehicles per thousand people for select countries and regions. The data for the United States are displayed in the line which goes from 1900 to 2012. The...
Fact #635: August 9, 2010 Fuel Consumption from Lawn and Garden...
Energy.gov [DOE] (indexed site)
The fuel used in this equipment accounts for only 1.8% of total gasoline use. Fuel Consumption from Lawn and Garden Equipment, 2008 Bar graph showing the fuel consumption ...
Go Green! How Driving a Hybrid Vehicle Can Help You Cut Down...
Office of Energy Efficiency and Renewable Energy (EERE) (indexed site)
linear relationship in terms of rate and starting point, using a graph, a table or an equation. Be able to find the y-intercept and the x-intercept of a linear relationship,...
Energy Perspectives: Trends and Milestones
2011-01-01
Energy Perspectives is a graphical overview of energy history in the United States. The 43 graphs shown here reveal sweeping trends related to the nation's production, consumption, and trade of energy from 1949 through 2011.
Fact #641: September 20, 2010 Top States for the Production of...
Office of Energy Efficiency and Renewable Energy (EERE) (indexed site)
Missouri was the second largest producer of trucks for that year. Top States for Car Production, Calendar Year 2009 Graph showing the top states for car production in 2009. ...
Fact #847: November 17, 2014 Cars were Over 50% of Light Vehicle...
Energy.gov [DOE] (indexed site)
in 1990 to one-third of the production in 2014 (counting both car SUVs and truck SUVs). ... Graph showing shares of light vehicle production by type (Car, Car SUV, Truck SUV, Van, ...
Fact #647: November 1, 2010 Sales Shifting from Light Trucks to Cars
Office of Energy Efficiency and Renewable Energy (EERE)
From 2005 to 2009 light vehicle sales have gradually shifted toward cars over light trucks. The graph below shows this trend broken down by the major manufacturers. This trend is more evident among...
This Week In Petroleum Printer-Friendly Version
U.S. Department of Energy (DOE) - all webpages (Extended Search)
to what is currently happening in the U.S. oil market following the disruption in Venezuela oil exports. U.S. Crude Oil Refinery Inputs and Commercial Inventory Levels Graph...
Project planning workshop 6-GeV synchrotron light source: Volume 2
Not Available
1986-01-01
A series of work sheets, graphs, and printouts are given which detail the work breakdown structure, cost, and manpower requirements for the 6 GeV Synchrotron Light Source. (LEW)
Proposed "OneEERE" Work Plan Structure
Office of Energy Efficiency and Renewable Energy (EERE) (indexed site)
The intent of this FOA is to promote the advancement of geothermal energy conversion processes ... Concept Paper can also include graphs, charts, or other data (limited to 3 pages) * ...
V-200: Apache Struts DefaultActionMapper Redirection and OGNL...
Office of Energy Efficiency and Renewable Energy (EERE) (indexed site)
tcher.mapper.DefaultActionMapper) can be exploited to e.g. inject and execute arbitrary Java code via OGNL (Object-Graph Navigation Language) expressions. IMPACT: Security Bypass...
Fact #584: August 17, 2009 The Price of Gasoline and Vehicle Travel: How Do They Relate?
Office of Energy Efficiency and Renewable Energy (EERE)
The price of gasoline is one factor that can have an effect on the number of highway vehicle miles traveled (VMT). The graph below shows a three-month moving average of the percentage change of...
Schlumberger soundings, audio-magnetotelluric soundings and telluric...
OpenEI (Open Energy Information) [EERE & EIA]
and interpreted data are shown in the graphs given in appendixes I and II. Authors Jackson, D.B. ODonnell, J.E.; Gregory and D. I. Published DOE Information Bridge, 111977...
Passive solar heating analysis
Balcomb, J.D.; Jones, R.W.; Mc Farland, R.D.; Wray, W.O.
1984-01-01
This book discusses about the design of solar heating systems. The terms and symbols are clearly defined. Step-by-step procedures are indicated. Worked examples are given with tables, graphs, appendixes.
OpenEI (Open Energy Information) [EERE & EIA]
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...
OpenEI (Open Energy Information) [EERE & EIA]
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...
Search results | Department of Energy
Office of Energy Efficiency and Renewable Energy (EERE) (indexed site)
boiling water. Students will compare their two samples on four criteria-color, clarity, smell and taste-rate which they prefer, and graph the results of the experiment as a class....
Search results | Department of Energy
Office of Energy Efficiency and Renewable Energy (EERE) (indexed site)
boiling water. Students will compare their two samples on four criteria-color, clarity, smell and taste-rate which they prefer, and graph the results of the experiment as a...
Nevada Bureau of Mines and Geology Open-File Report 12-3: Data...
OpenEI (Open Energy Information) [EERE & EIA]
2012 Jump to: navigation, search OpenEI Reference LibraryAdd to library Report: Nevada Bureau of Mines and Geology Open-File Report 12-3: Data Tables and graphs of geothermal power...
Petroleum Supply Monthly September 2004
Ranges in Inventory Graphs XLS HTML Entire . The entire report as a single file. PDF 1.2MB . . Front Matter . Petroleum Supply Monthly Cover Page, Preface, and Table of...
Solar Background Document 6 | Department of Energy
Office of Energy Efficiency and Renewable Energy (EERE) (indexed site)
6 Solar Background Document 6 Graph illustrating solar cell production in the United States and China from 2002 to 2010. Solar Background Document 6.pdf (38.97 KB) More Documents & ...
This Week In Petroleum Printer-Friendly Version
U.S. Department of Energy (DOE) - all webpages (Extended Search)
at least through the end of 2009. The decline in consumption is the result of slowing economic growth combined with the rapid increase in retail gasoline prices. The graph...
EIA Energy Information Administration
Energy Information Administration (EIA) (indexed site)
monitored for this report was above normal only 1 of 7 days (see graph). Despite the cold front, the spot price at the Henry Hub ended Friday at 5.05 per MMBtu, down 0.42...
January 2011 Monthly News Roundup | U.S. DOE Office of Science...
... The work is funded by the Defense Advanced Research Projects Agency (DARPA). Murphy also led the launch this year of the newly created Graph500 test, an internationally used ...
Natural Gas Weekly Update, Printer-Friendly Version
Gasoline and Diesel Fuel Update
Price, West Texas Intermediate Crude Oil Spot Price, and Henry Hub Natural Gas Spot Price Graph More Summary Data Prices Prices increased at all trading locations during the week,...
Price, West Texas Intermediate Crude Oil Spot Price, and Henry Hub Natural Gas Spot Price Graph More Summary Data Prices Prices increased at all trading locations during the week,...
Fact #842: October 13, 2014 Vehicles and Vehicle Travel Trends...
Office of Energy Efficiency and Renewable Energy (EERE) (indexed site)
As the U.S. population has doubled from 1950 to 2012, the number of vehicles has grown ... Population and Vehicle Growth Comparison, 1950-2012 Graph showing population and vehicle ...
First AEO2014 Transportation Working Group Meeting Summary
Energy Information Administration (EIA) (indexed site)
inform HDV model year, vehicle type and VMT aspects using the Polk data. 4. What does the measure "E85 market share" represent on the Consumer choice for E85 graph on slide 11? a. ...
Department of Energy Names Virginia and Illinois Electric Cooperatives...
Office of Energy Efficiency and Renewable Energy (EERE) (indexed site)
March 31, 2014 - 10:31am Addthis A photo graph of three people standing in front of a brown drape. The U.S. Department of Energy and the National Rural Electric Cooperative ...
Comparing Clouds Using Cloud Radar
U.S. Department of Energy (DOE) - all webpages (Extended Search)
Year Weight (kg) 1998 102 1999 104 2000 98 2001 91 2002 86 1. Now you will need to draw the axes of your graph. These are lines that tell you where to put information. On the...
Office of Legacy Management (LM)
... 12 DEPARTMENT OF THE INTERIOR UNITED STATES GEOLOGICAL SURVEY IJSGS-474-16 ( R u l i ... illustration authorized by the A u a t d Oil Company, h e 0 0 0 @ FIGURE 4.- Graphs of ...
Fact #594: October 26, 2009 Fuel Economy and Annual Fuel Cost Ranges for Vehicle Classes
The graph below shows the range of the lowest and highest fuel economy for each vehicle class, along with the lowest and highest annual fuel cost (in parentheses). For example, the two-seater model...
Transportation Energy Data Book: Edition 31 (Technical Report...
Office of Scientific and Technical Information (OSTI)
graphs. The latest edition of the Data Book is available to a larger audience via the Internet (cta.ornl.govdata). This edition of the Data Book has 12 chapters which focus on...
Transportation Energy Data Book: Edition 32 (Technical Report...
Office of Scientific and Technical Information (OSTI)
graphs. The latest edition of the Data Book is available to a larger audience via the Internet (cta.ornl.govdata). This edition of the Data Book has 12 chapters which focus on...
Transportation Energy Data Book: Edition 34 (Technical Report...
Office of Scientific and Technical Information (OSTI)
graphs. The latest edition of the Data Book is available to a larger audience via the Internet (cta.ornl.govdata). This edition of the Data Book has 12 chapters which focus on...
This is Y-12 | Y-12 National Security Complex
U.S. Department of Energy (DOE) - all webpages (Extended Search)
Crude oil futures and estimated contract prices (dollars per barrel) Contract 1 Contract 2 Contract 3 Contract 4 Crude oil futures price contract 1 graph Crude oil futures price contract 2 graph Crude oil futures price contract 3 graph Crude oil futures price contract 4 graph Crude oil futures and estimated contract prices (dollars per barrel)more price data › Year ago Most recent 11/13/15 11/10/16 11/04/16 10/28/16 10/21/16 10/14/16 10/07/16 09/30/16 Contract 1 40.74 44.66 44.07 48.70 50.85
Poster Guidelines - Cyclotron Institute REU Program
U.S. Department of Energy (DOE) - all webpages (Extended Search)
background is preferred (this will save plotting time and our inkjet supplies) * Use of color (in pictures, graphs, etc.) is fine; just don't go overboard * Be sure to save a final...
Boman, Erik G.; Catalyurek, Umit V.; Chevalier, Cedric; Devine, Karen D.; Gebremedhin, Assefaw H.; Hovland, Paul D.; Pothen, Alex; Rajamanickam, Sivasankaran; Safro, Ilya; Wolf, Michael M.; Zhou, Min
2015-01-16
This final progress report summarizes the work accomplished at the Combinatorial Scientific Computing and Petascale Simulations Institute. We developed Zoltan, a parallel mesh partitioning library that made use of accurate hypergraph models to provide load balancing in mesh-based computations. We developed several graph coloring algorithms for computing Jacobian and Hessian matrices and organized them into a software package called ColPack. We developed parallel algorithms for graph coloring and graph matching problems, and also designed multi-scale graph algorithms. Three PhD students graduated, six more are continuing their PhD studies, and four postdoctoral scholars were advised. Six of these students and Fellows have joined DOE Labs (Sandia, Berkeley), as staff scientists or as postdoctoral scientists. We also organized the SIAM Workshop on Combinatorial Scientific Computing (CSC) in 2007, 2009, and 2011 to continue to foster the CSC community.
U.S. Energy Information Administration (EIA)
a smaller portion of total U.S. production today than 5 to 10 years ago due to the dual effect of waning GOM production and increasing onshore production. The graph to the...
Standard's Guide to Learning Middle School Hands-On Science Elective...
Office of Energy Efficiency and Renewable Energy (EERE) (indexed site)
Guide to Learning Middle School Hands-On Science Elective Class Student: Grade: Date: Math B Proficiency Levels PP P A Collect, organize, analyze, and graph (e.g., line plots,...
Fact# 904: December 21, 2015 Gross Domestic Product and Vehicle...
Office of Energy Efficiency and Renewable Energy (EERE) (indexed site)
With the growth of VMT in 2015, the gap between the two series has narrowed for the first time since the Great Recession. GDP and VMT Trends, 1960-2015 Graph showing gross national ...
System Advisor Model (SAM) | Open Energy Information
OpenEI (Open Energy Information) [EERE & EIA]
graphs, which can be exported for use in reports or for further analysis in other models. History SAM was first developed in 2006 by the National Renewable Energy Laboratory...
Downloaded 09 Feb 2007 to 128.104.165.60. Redistribution subject to AIP license
U.S. Department of Energy (DOE) - all webpages (Extended Search)
View and download all Security Smarts for your safety and security...
U.S. Department of Energy (DOE) - all webpages (Extended Search)
Primary Evidence For an individual born in the United States, a current United States passport or a birth certificate are the primary and preferred means of citizenship...
AVTA: 2010 Honda CR-Z Hybrid Downloadable Dynamometer Database Reports
The Vehicle Technologies Office's Advanced Vehicle Testing Activity carries out testing on a wide range of advanced vehicles and technologies on dynamometers, closed test tracks, and on-the-road. ...
PatentAwarenessProgram_FY2014_09.2015_download.indd
U.S. Department of Energy (DOE) - all webpages (Extended Search)
Patent Awareness Program Recognition Dinner Fiscal Year 2014 ENERGY U.S. DEPARTMENT OF U.S. DEPARTMENT OF ENERGY U.S. DEPARTMENT OF ENERGY U.S. DEPARTMENT OF U.S. DEPARTMENT OF U.S. Department of Energy's Princeton Plasma Physics Laboratory Princeton, New Jersey Committee on Inventions Adam B. Cohen (Ex Officio Chair) Laurie Bagley (Co-Chair) Susan E. Dever Philip C. Efthimion Charles A. Gentile Erik Gilson Terry E. Greenberg Robert Kaita Lewis D. Meixler (Co-Chair) Jaclyn Pursell Charles H.
Quarterly Smart Grid Data available for download on OpenEI |...
OpenEI (Open Energy Information) [EERE & EIA]
You must login in order to post into this group. Latest blog post comments Mike o spectacular dataset Posted: 9 Aug 2015 - 14:46 by: Mike o Calum Residential idf Files Posted:...
This content has been downloaded from IOPscience. Please scroll down to see the
U.S. Department of Energy (DOE) - all webpages (Extended Search)
1/11/2015 at 14:46 Please note that terms and conditions apply. Determination of Z eff by integrating measurements from x-ray tomography and charge exchange recombination spectroscopy View the table of contents for this issue, or go to the journal homepage for more 2015 Nucl. Fusion 55 123016 (http://iopscience.iop.org/0029-5515/55/12/123016) Home Search Collections Journals About Contact us My IOPscience 1 © 2015 IAEA, Vienna Printed in the UK 1. Introduction The effective ionic charge (Z eff
This content has been downloaded from IOPscience. Please scroll down to see the
U.S. Department of Energy (DOE) - all webpages (Extended Search)
40 Please note that terms and conditions apply. Effect of beryllium filter purity on x-ray emission measurements View the table of contents for this issue, or go to the journal homepage for more 2014 Plasma Phys. Control. Fusion 56 125018 (http://iopscience.iop.org/0741-3335/56/12/125018) Home Search Collections Journals About Contact us My IOPscience 1 © 2014 IOP Publishing Ltd Printed in the UK 1. Introduction Soft x-ray (SXR) emission provides information about mag- netic field structure,
This content has been downloaded from IOPscience. Please scroll down to see the
U.S. Department of Energy (DOE) - all webpages (Extended Search)
23/07/2015 at 15:15 Please note that terms and conditions apply. Dynamo and anomalous transport in the reversed field pinch View the table of contents for this issue, or go to the journal homepage for more 1999 Plasma Phys. Control. Fusion 41 A129 (http://iopscience.iop.org/0741-3335/41/3A/008) Home Search Collections Journals About Contact us My IOPscience Plasma Phys. Control. Fusion 41 (1999) A129-A142. Printed in the UK PII: S0741-3335(99)97508-5 Dynamo and anomalous transport in the
PatentAwarenessProgram_FY2014_09.2015_download.indd
U.S. Department of Energy (DOE) - all webpages (Extended Search)
Princeton Plasma Physics Laboratory Princeton, New Jersey Committee on Inventions Adam B. ... Patent Awareness Program Objectives To foster the disclosure of inventions To raise the ...
Energy Science and Technology Software Center
2001-01-31
This software reduces the data from two-dimensional kSA MOS program, k-Space Associates, Ann Arbor, MI. Initial MOS data is recorded without headers in 38 columns, with one row of data per acquisition per lase beam tracked. The final MOSS 2d data file is reduced, graphed, and saved in a tab-delimited column format with headers that can be plotted in any graphing software.
Aggregate Transfers Last 8 Days
U.S. Department of Energy (DOE) - all webpages (Extended Search)
Transfers Last 8 Days Aggregate Transfers Last 8 Days These plots show the aggregate bandwidth 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. BW (Both Systems) BW (Both Systems) BW (Both Systems) BW (Both Systems) BW (Both Systems) BW (Both Systems) BW (Both Systems) BW (Both Systems) Last edited: 2016-10-21 12:13:03
Isorropia Partitioning and Load Balancing Package
Energy Science and Technology Software Center
2006-09-01
Isorropia is a partitioning and load balancing package which interfaces with the Zoltan library. Isorropia can accept input objects such as matrices and matrix-graphs, and repartition/redistribute them into a better data distribution on parallel computers. Isorropia is primarily an interface package, utilizing graph and hypergraph partitioning algorithms that are in the Zoltan library which is a third-party library to Tilinos.
Concurrent Transfers Last 8 Days
U.S. Department of Energy (DOE) - all webpages (Extended Search)
Transfers Last 8 Days Concurrent Transfers Last 8 Days These plots show the concurrent transfers 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. Concurrency (Both Systems) Concurrency (Both Systems) Concurrency (Both Systems) Concurrency (Both Systems) Concurrency (Both Systems) Concurrency (Both Systems) Concurrency (Both Systems) Concurrency (Both Systems) Last
Joaquin Correa JoaquinCorrea@lbl.gov NERSC Data and Analytics Services
U.S. Department of Energy (DOE) - all webpages (Extended Search)
Joaquin Correa JoaquinCorrea@lbl.gov NERSC Data and Analytics Services NERSC User Meeting August, 2015 Data Analytics at NERSC Data analytics at NERSC Hardware Resource Management Runtime Framework Tools + Libraries Analytics Capabilities Science Applications Climate, Cosmology, Kbase, Materials, BioImaging, Your science! Statistics, Machine Learning R, python, MLBase Image Processing MATLAB OMERO, Fiji Graph Analytics GraphX Database Operations SQL MPI Spark SciDB Filesystems (Lustre),
System Advisor Model, SAM 2014.1.14: General Description
Blair, N.; Dobos, A. P.; Freeman, J.; Neises, T.; Wagner, M.; Ferguson, T.; Gilman, P.; Janzou, S.
2014-02-01
This document describes the capabilities of the U.S. Department of Energy and National Renewable Energy Laboratory's System Advisor Model (SAM), Version 2013.9.20, released on September 9, 2013. SAM is a computer model that calculates performance and financial metrics of renewable energy systems. Project developers, policy makers, equipment manufacturers, and researchers use graphs and tables of SAM results in the process of evaluating financial, technology, and incentive options for renewable energy projects. SAM simulates the performance of photovoltaic, concentrating solar power, solar water heating, wind, geothermal, biomass, and conventional power systems. The financial model can represent financial structures for projects that either buy and sell electricity at retail rates (residential and commercial) or sell electricity at a price determined in a power purchase agreement (utility). SAM's advanced simulation options facilitate parametric and sensitivity analyses, and statistical analysis capabilities are available for Monte Carlo simulation and weather variability (P50/P90) studies. SAM can also read input variables from Microsoft Excel worksheets. For software developers, the SAM software development kit (SDK) makes it possible to use SAM simulation modules in their applications written in C/C++, C#, Java, Python, and MATLAB. NREL provides both SAM and the SDK as free downloads at http://sam.nrel.gov. Technical support and more information about the software are available on the website.
System Advisor Model, SAM 2011.12.2: General Description
Gilman, P.; Dobos, A.
2012-02-01
This document describes the capabilities of the U.S. Department of Energy and National Renewable Energy Laboratory's System Advisor Model (SAM), Version 2011.12.2, released on December 2, 2011. SAM is software that models the cost and performance of renewable energy systems. Project developers, policy makers, equipment manufacturers, and researchers use graphs and tables of SAM results in the process of evaluating financial, technology, and incentive options for renewable energy projects. SAM simulates the performance of solar, wind, geothermal, biomass, and conventional power systems. The financial model can represent financing structures for projects that either buy and sell electricity at retail rates (residential and commercial) or sell electricity at a price determined in a power purchase agreement (utility). Advanced analysis options facilitate parametric, sensitivity, and statistical analyses, and allow for interfacing SAM with Microsoft Excel or with other computer programs. SAM is available as a free download at http://sam.nrel.gov. Technical support and more information about the software are available on the website.
TIS (Technology Information System): The Intelligent Gateway Processor (IGP)
Hampel, V.E.; Barker, R.; Berch, M.; Kawin, R.; Lann, N.; McGrogan, S.; Sharpe, N.; Winiger, G.
1984-10-01
The Technology Information System (TIS) is an Intelligent Gateway Processor (IGP) capable of interconnecting heterogeneous information resources at geographically distributed locations in an automated, unified, and controlled manner. It augments the capabilities of personal computers and workstations of scientists and engineers by providing a shared directory to worldwide bibliographic and numeric resources and a library of self-guided procedures by which test, data, and graphs can be downloaded, reformatted, aggregated, analyzed, and shared among users and different host machines. The TIS link capability is used routinely for transcontinental tutorials and as a proactical means for the audiovisual linking of TIS users with experts at their respective locations. The IGP universal user interface permits changes and additions of available resources while running non-stop. The TIS/IGP at th Lawrence Livermore National Laboratory (LLNL) serves as the host system for several different communities of users who develop integrated information systems for personal and shared programmatic resources. The TIS local area network utilizes a 10 Mbps Ethernet which serves as a testbed for high-technology hardware and software.
Incremental k-core decomposition: Algorithms and evaluation
Sariyuce, Ahmet Erdem; Gedik, Bugra; Jacques-SIlva, Gabriela; Wu, Kun -Lung; Catalyurek, Umit V.
2016-02-01
A k-core of a graph is a maximal connected subgraph in which every vertex is connected to at least k vertices in the subgraph. k-core decomposition is often used in large-scale network analysis, such as community detection, protein function prediction, visualization, and solving NP-hard problems on real networks efficiently, like maximal clique finding. In many real-world applications, networks change over time. As a result, it is essential to develop efficient incremental algorithms for dynamic graph data. In this paper, we propose a suite of incremental k-core decomposition algorithms for dynamic graph data. These algorithms locate a small subgraph that ismore » guaranteed to contain the list of vertices whose maximum k-core values have changed and efficiently process this subgraph to update the k-core decomposition. We present incremental algorithms for both insertion and deletion operations, and propose auxiliary vertex state maintenance techniques that can further accelerate these operations. Our results show a significant reduction in runtime compared to non-incremental alternatives. We illustrate the efficiency of our algorithms on different types of real and synthetic graphs, at varying scales. Furthermore, for a graph of 16 million vertices, we observe relative throughputs reaching a million times, relative to the non-incremental algorithms.« less
An In-Depth Analysis of the Chung-Lu Model
Winlaw, M.; DeSterck, H.; Sanders, G.
2015-10-28
In the classic Erd}os R enyi random graph model [5] each edge is chosen with uniform probability and the degree distribution is binomial, limiting the number of graphs that can be modeled using the Erd}os R enyi framework [10]. The Chung-Lu model [1, 2, 3] is an extension of the Erd}os R enyi model that allows for more general degree distributions. The probability of each edge is no longer uniform and is a function of a user-supplied degree sequence, which by design is the expected degree sequence of the model. This property makes it an easy model to work with theoretically and since the Chung-Lu model is a special case of a random graph model with a given degree sequence, many of its properties are well known and have been studied extensively [2, 3, 13, 8, 9]. It is also an attractive null model for many real-world networks, particularly those with power-law degree distributions and it is sometimes used as a benchmark for comparison with other graph generators despite some of its limitations [12, 11]. We know for example, that the average clustering coe cient is too low relative to most real world networks. As well, measures of a nity are also too low relative to most real-world networks of interest. However, despite these limitations or perhaps because of them, the Chung-Lu model provides a basis for comparing new graph models.
RAG-3D: A search tool for RNA 3D substructures
Zahran, Mai; Sevim Bayrak, Cigdem; Elmetwaly, Shereef; Schlick, Tamar
2015-08-24
In this study, to address many challenges in RNA structure/function prediction, the characterization of RNA's modular architectural units is required. Using the RNA-As-Graphs (RAG) database, we have previously explored the existence of secondary structure (2D) submotifs within larger RNA structures. Here we present RAG-3D—a dataset of RNA tertiary (3D) structures and substructures plus a web-based search tool—designed to exploit graph representations of RNAs for the goal of searching for similar 3D structural fragments. The objects in RAG-3D consist of 3D structures translated into 3D graphs, cataloged based on the connectivity between their secondary structure elements. Each graph is additionally described in terms of its subgraph building blocks. The RAG-3D search tool then compares a query RNA 3D structure to those in the database to obtain structurally similar structures and substructures. This comparison reveals conserved 3D RNA features and thus may suggest functional connections. Though RNA search programs based on similarity in sequence, 2D, and/or 3D structural elements are available, our graph-based search tool may be advantageous for illuminating similarities that are not obvious; using motifs rather than sequence space also reduces search times considerably. Ultimately, such substructuring could be useful for RNA 3D structure prediction, structure/function inference and inverse folding.
RAG-3D: A search tool for RNA 3D substructures
Zahran, Mai; Sevim Bayrak, Cigdem; Elmetwaly, Shereef; Schlick, Tamar
2015-08-24
In this study, to address many challenges in RNA structure/function prediction, the characterization of RNA's modular architectural units is required. Using the RNA-As-Graphs (RAG) database, we have previously explored the existence of secondary structure (2D) submotifs within larger RNA structures. Here we present RAG-3D—a dataset of RNA tertiary (3D) structures and substructures plus a web-based search tool—designed to exploit graph representations of RNAs for the goal of searching for similar 3D structural fragments. The objects in RAG-3D consist of 3D structures translated into 3D graphs, cataloged based on the connectivity between their secondary structure elements. Each graph is additionally describedmore » in terms of its subgraph building blocks. The RAG-3D search tool then compares a query RNA 3D structure to those in the database to obtain structurally similar structures and substructures. This comparison reveals conserved 3D RNA features and thus may suggest functional connections. Though RNA search programs based on similarity in sequence, 2D, and/or 3D structural elements are available, our graph-based search tool may be advantageous for illuminating similarities that are not obvious; using motifs rather than sequence space also reduces search times considerably. Ultimately, such substructuring could be useful for RNA 3D structure prediction, structure/function inference and inverse folding.« less
Energy Science and Technology Software Center
2007-09-25
The ThreatView project is based on our prior work with the existing ParaView open-source scientific visualization application. Where ParaView provides a grapical client optimized scientific visualization over the VTK parallel client server architecture, ThreatView provides a client optimized for more generic visual analytics over the same architecture. Because ThreatView is based on the VTK parallel client-server architecture, data sources can reside on remote hosts, and processing and rendering can be performed in parallel. As seenmore » in Fig. 1, ThreatView provides four main methods for visualizing data: Landscape View, which displays a graph using a landscape metaphor where clusters of graph nodes produce "hills" in the landscape; Graph View, which displays a graph using a traditional "ball-and-stick" style; Table View, which displays tabular data in a standard spreadsheet; and Attribute View, which displays a tabular "histogram" of input data - for a selected table column, the Attribute View displays each unique value within the column, and the number of times that value appears in the data. There are two supplemental view types: Text View, which displays tabular data one-record-at-a-time; and the Statistics View, which displays input metadata, such as the number of vertices and edges in a graph, the number of rows in a table, etc.« less
Orbit-product representation and correction of Gaussian belief propagation
Johnson, Jason K; Chertkov, Michael; Chernyak, Vladimir
2009-01-01
We present a new interpretation of Gaussian belief propagation (GaBP) based on the 'zeta function' representation of the determinant as a product over orbits of a graph. We show that GaBP captures back-tracking orbits of the graph and consider how to correct this estimate by accounting for non-backtracking orbits. We show that the product over non-backtracking orbits may be interpreted as the determinant of the non-backtracking adjacency matrix of the graph with edge weights based on the solution of GaBP. An efficient method is proposed to compute a truncated correction factor including all non-backtracking orbits up to a specified length.
An exact, finite, gauge-invariant, non-perturbative approach to QCD renormalization
Fried, H.M.; Tsang, P.H.; Gabellini, Y.; Grandou, T.; Sheu, Y.-M.
2015-08-15
A particular choice of renormalization, within the simplifications provided by the non-perturbative property of Effective Locality, leads to a completely finite, non-perturbative approach to renormalized QCD, in which all correlation functions can, in principle, be defined and calculated. In this Model of renormalization, only the Bundle chain-Graphs of the cluster expansion are non-zero. All Bundle graphs connecting to closed quark loops of whatever complexity, and attached to a single quark line, provided no ‘self-energy’ to that quark line, and hence no effective renormalization. However, the exchange of momentum between one quark line and another, involves only the cluster-expansion’s chain graphs, and yields a set of contributions which can be summed and provide a finite color-charge renormalization that can be incorporated into all other QCD processes. An application to High Energy elastic pp scattering is now underway.
A numerical test of KPZ scaling; Potts models coupled to two-dimensional quantum gravity
Baillie, C.F. , 91 - Nozay ); Johnston, D.A. . Dept. of Mathematics)
1992-06-07
In this paper, the authors perform Monte-Carlo simulations using the Wolff cluster algorithm of the q = 2 (Ising), 3, 4 and q = 10 Potts models on dynamical phi-cubed graphs of spherical topology with up to 5000 nodes. The authors find that the measured critical exponents are in reasonable agreement with those from the exact solution of the Ising model and with those calculated from KPZ scaling for q = 3, 4 where no exact solution is available. Using Binder's cumulant, the authors find that the q = 10 Potts model displays a first order phase transition on a dynamical graph, as it does on a fixed lattice. The authors also examine the internal geometry of the graphs generated in the simulation, finding a linear relationship between ring length probabilities and the central charge of the Potts model.
Feynman rules for Coulomb gauge QCD
Andrasi, A.; Taylor, J.C.
2012-10-15
The Coulomb gauge in nonabelian gauge theories is attractive in principle, but beset with technical difficulties in perturbation theory. In addition to ordinary Feynman integrals, there are, at 2-loop order, Christ-Lee (CL) terms, derived either by correctly ordering the operators in the Hamiltonian, or by resolving ambiguous Feynman integrals. Renormalization theory depends on the sub-graph structure of ordinary Feynman graphs. The CL terms do not have a sub-graph structure. We show how to carry out renormalization in the presence of CL terms, by re-expressing these as 'pseudo-Feynman' integrals. We also explain how energy divergences cancel. - Highlights: Black-Right-Pointing-Pointer In Coulomb gauge QCD, we re-express Christ-Lee terms in the Hamiltonian as pseudo-Feynman integrals. Black-Right-Pointing-Pointer This gives a subgraph structure, and allows the ordinary renormalization process. Black-Right-Pointing-Pointer It also leads to cancellation of energy-divergences.
Monte Carlo analysis of critical phenomenon of the Ising model on memory stabilizer structures
Viteri, C. Ricardo; Tomita, Yu; Brown, Kenneth R.
2009-10-15
We calculate the critical temperature of the Ising model on a set of graphs representing a concatenated three-bit error-correction code. The graphs are derived from the stabilizer formalism used in quantum error correction. The stabilizer for a subspace is defined as the group of Pauli operators whose eigenvalues are +1 on the subspace. The group can be generated by a subset of operators in the stabilizer, and the choice of generators determines the structure of the graph. The Wolff algorithm, together with the histogram method and finite-size scaling, is used to calculate both the critical temperature and the critical exponents of each structure. The simulations show that the choice of stabilizer generators, both the number and the geometry, has a large effect on the critical temperature.
Energy Science and Technology Software Center
2010-02-24
Umbra is a software package that has been in development at Sandia National Laboratories since 1995, under the name Umbra since 1997. Umbra is a software framework written in C++ and Tcl/Tk that has been applied to many operations, primarily dealing with robotics and simulation. Umbra executables are C++ libraries orchestrated with Tcl/Tk scripts. Two major feature upgrades occurred from 4.7 to 4.8 1. System Umbra Module with its own Update Graph within the C++more » framework. 2. New terrain graph for fast line-of-sight calculations All else were minor updates such as later versions of Visual Studio, OpenSceneGraph and Boost.« less
Quist, Daniel A.; Gavrilov, Eugene M.; Fisk, Michael E.
2008-01-15
A method enables the topology of an acyclic fully propagated network to be discovered. A list of switches that comprise the network is formed and the MAC address cache for each one of the switches is determined. For each pair of switches, from the MAC address caches the remaining switches that see the pair of switches are located. For each pair of switches the remaining switches are determined that see one of the pair of switches on a first port and the second one of the pair of switches on a second port. A list of insiders is formed for every pair of switches. It is determined whether the insider for each pair of switches is a graph edge and adjacent ones of the graph edges are determined. A symmetric adjacency matrix is formed from the graph edges to represent the topology of the data link network.
Dynamic extension of the Simulation Problem Analysis Kernel (SPANK)
Sowell, E.F. . Dept. of Computer Science); Buhl, W.F. )
1988-07-15
The Simulation Problem Analysis Kernel (SPANK) is an object-oriented simulation environment for general simulation purposes. Among its unique features is use of the directed graph as the primary data structure, rather than the matrix. This allows straightforward use of graph algorithms for matching variables and equations, and reducing the problem graph for efficient numerical solution. The original prototype implementation demonstrated the principles for systems of algebraic equations, allowing simulation of steady-state, nonlinear systems (Sowell 1986). This paper describes how the same principles can be extended to include dynamic objects, allowing simulation of general dynamic systems. The theory is developed and an implementation is described. An example is taken from the field of building energy system simulation. 2 refs., 9 figs.
Geometric universality of currents in an open network of interacting particles
Sinitsyn, Nikolai A; Chernyak, Vladimir Y; Chertkov, Michael
2010-01-01
We discuss a non-equilibrium statistical system on a graph or network. Identical particles are injected, interact with each other, traverse, and leave the graph in a stochastic manner described in terms of Poisson rates, possibly dependent on time and instantaneous occupation numbers at the nodes of the graph. We show that under the assumption of the relative rates constancy, the system demonstrates a profound statistical symmetry, resulting in geometric universality of the particle currents statistics. The phenomenon applies broadly to many man-made and natural open stochastic systems, such as queuing of packages over internet, transport of electrons and quasi-particles in mesoscopic systems, and chains of reactions in bio-chemical networks. We illustrate the utility of the general approach using two enabling examples from the two latter disciplines.
Analyst-Driven Knowledge Enhancement & Analysis version 1.0
Energy Science and Technology Software Center
2008-06-27
AKEA provides tools for the creation, maintenance, visualization, and analysis of information expressed in semantic graph form. It is capable of taking information expressed in unstructured text documents or structured data documents (e.g., spreadsheets, databases), ingesting it and extracting entities and relationships of interest, then presenting said information in graphical form. In addition, it contains tools for applying traditional social network analysis algorithms to the generated graphs in order to identify key players or entitiesmorewith particular characteristics, geospatial and temporal visualization of said data, and user-controlled storage of information to support future analysis needs.less
Analyst-Driven Knowledge Enhancement & Analysis version 1.0
Energy Science and Technology Software Center
2008-06-27
AKEA provides tools for the creation, maintenance, visualization, and analysis of information expressed in semantic graph form. It is capable of taking information expressed in unstructured text documents or structured data documents (e.g., spreadsheets, databases), ingesting it and extracting entities and relationships of interest, then presenting said information in graphical form. In addition, it contains tools for applying traditional social network analysis algorithms to the generated graphs in order to identify key players or entitiesmore » with particular characteristics, geospatial and temporal visualization of said data, and user-controlled storage of information to support future analysis needs.« less
Croff, A.G.; Liberman, M.S.; Morrison, G.W.
1982-01-01
Based on the results of ORIGEN2 and a newly developed code called ORMANG, graphical and summary tabular characteristics of spent fuel, high-level waste, and fuel assembly structural material (cladding) waste are presented for a generic pressurized-water reactor (PWR), a liquid-metal fast breeder reactor (LMFBR), and the Fast Flux Test Facility (FFTF). The characteristics include radioactivity, thermal power, and toxicity (water dilution volume). Given are graphs and summary tables containing characteristic totals and the principal nuclide contributors as well as graphs comparing the three reactors for a single material and the three materials for a single reactor.
Berkolaiko, G.; Kuipers, J.
2013-12-15
Electronic transport through chaotic quantum dots exhibits universal behaviour which can be understood through the semiclassical approximation. Within the approximation, calculation of transport moments reduces to codifying classical correlations between scattering trajectories. These can be represented as ribbon graphs and we develop an algorithmic combinatorial method to generate all such graphs with a given genus. This provides an expansion of the linear transport moments for systems both with and without time reversal symmetry. The computational implementation is then able to progress several orders further than previous semiclassical formulae as well as those derived from an asymptotic expansion of random matrix results. The patterns observed also suggest a general form for the higher orders.
A Novel Vertex Affinity for Community Detection
Yoo, Andy; Sanders, Geoffrey; Henson, Van; Vassilevski, Panayot
2015-10-05
We propose a novel vertex affinity measure in this paper. The new vertex affinity quantifies the proximity between two vertices in terms of their clustering strength and is ideal for such graph analytics applications as community detection. We also developed a framework that combines simple graph searches and resistance circuit formulas to compute the vertex affinity efficiently. We study the properties of the new affinity measure empirically in comparison to those of other popular vertex proximity metrics. Our results show that the existing metrics are ill-suited for community detection due to their lack of fundamental properties that are essential for correctly capturing inter- and intra-cluster vertex proximity.
Analyst-Driven Knowledge Enhancement & Analysis version 1.0
2008-06-27
AKEA provides tools for the creation, maintenance, visualization, and analysis of information expressed in semantic graph form. It is capable of taking information expressed in unstructured text documents or structured data documents (e.g., spreadsheets, databases), ingesting it and extracting entities and relationships of interest, then presenting said information in graphical form. In addition, it contains tools for applying traditional social network analysis algorithms to the generated graphs in order to identify key players or entities with particular characteristics, geospatial and temporal visualization of said data, and user-controlled storage of information to support future analysis needs.
Energy Science and Technology Software Center
2006-03-29
GreenArrow is a visualization program for displaying directed graphs that can use text in place of lines to represent the edges between nodes. This text can be animated to show the link direction, and allow for more text to be displayed then would normally be allowed. The text is also tapered and arced to show direction. The node labels can be wrapped around the node to avoid label crossing as well. The program is interactive,more » and allows the user to zoom, pan and rotate a graph, as well as manipulate the individual nodes.« less
Region and edge-adaptive sampling and boundary completion for segmentation
Dillard, Scott E; Prasad, Lakshman; Grazzini, Jacopo A
2010-01-01
Edge detection produces a set of points that are likely to lie on discontinuities between objects within an image. We consider faces of the Gabriel graph of these points, a sub-graph of the Delaunay triangulation. Features are extracted by merging these faces using size, shape and color cues. We measure regional properties of faces using a novel shape-dependant sampling method that overcomes undesirable sampling bias of the Delaunay triangles. Instead, sampling is biased so as to smooth regional statistics within the detected object boundaries, and this smoothing adapts to local geometric features of the shape such as curvature, thickness and straightness.
Adsorbent materials development and testing for the extraction of uranium from seawater
Felker, L.K.; Dai, S.; Hay, B.P.; Janke, C.J.; Mayes, R.T.; Sun, X.; Tsouris, C.
2013-07-01
The extraction of uranium from seawater has been the focus of a research project for the U.S. Department of Energy to develop amidoxime functional group adsorbents using radiation-induced graphing on polymer-based fiber materials and subsequent chemical conversion of the radical sites to form the desired adsorbent material. Materials with promising uranium adsorption capacities were prepared through a series of parametric studies on radiation dose, time, temperature, graphing solutions, and properties of the base polymer materials. A laboratory screening protocol was developed to determine the uranium adsorption capacity to identify the most promising candidate materials for seawater testing. (authors)
Second SIAM conference on sparse matrices: Abstracts. Final technical report
1996-12-31
This report contains abstracts on the following topics: invited and long presentations (IP1 & LP1); sparse matrix reordering & graph theory I; sparse matrix tools & environments I; eigenvalue computations I; iterative methods & acceleration techniques I; applications I; parallel algorithms I; sparse matrix reordering & graphy theory II; sparse matrix tool & environments II; least squares & optimization I; iterative methods & acceleration techniques II; applications II; eigenvalue computations II; least squares & optimization II; parallel algorithms II; sparse direct methods; iterative methods & acceleration techniques III; eigenvalue computations III; and sparse matrix reordering & graph theory III.
Energy Science and Technology Software Center
2001-01-31
This program reduces the data from one-dimensional laser beam arrays from kSA MOS program, k-Space Associates, Ann Arbor, MI. Initial data is recorded without headers in 38 columns, with one row of data per acquisition per laser beam tracked. MOSS Patch can merge several data files together, filters out beam overlaps, and reduces the data. The final data is graphed and saved in a tab-delimited column format with headers that can be plotted in anymore » graphing software.« less
SunShot Incubator Spurs Solar Industry Innovation | Department of Energy
Office of Energy Efficiency and Renewable Energy (EERE) (indexed site)
Spurs Solar Industry Innovation SunShot Incubator Spurs Solar Industry Innovation November 18, 2011 - 11:15am Addthis As much as half of the price of solar energy, represented in red above graph, is made up of non-hardware costs. | Data source: Goodrich et al 2011. | Image courtesy of the Energy Department's SunShot Initiative. As much as half of the price of solar energy, represented in red above graph, is made up of non-hardware costs. | Data source: Goodrich et al 2011. | Image courtesy of
Visual Matrix Clustering of Social Networks
Wong, Pak C.; Mackey, Patrick S.; Foote, Harlan P.; May, Richard A.
2013-07-01
The prevailing choices to graphically represent a social network in todays literature are a node-link graph layout and an adjacency matrix. Both visualization techniques have unique strengths and weaknesses when applied to different domain applications. In this article, we focus our discussion on adjacency matrix and how to turn the matrix-based visualization technique from merely showing pairwise associations among network actors (or graph nodes) to depicting clusters of a social network. We also use node-link layouts to supplement the discussion.
U.S. Department of Energy (DOE) - all webpages (Extended Search)
Los Alamos National Laboratory Go to the Lab's home page Search for people in the Lab's directory Search the Laboratory's Web site CartaBlanca, A Pure Java, Component-based, Object-Oriented, Systems Simulation Tool for Non-Linear Physics On Unstructured Grids and Graphs CartaBlanca, a 2005 R&D100 award-winning project, concerns the development of a pure Java, component-based systems simulation and prototyping tool for non-linear physics on unstructured grids and graphs. (See also R&D 100
Energy Science and Technology Software Center
2004-03-01
A package of classes for constructing and using distributed sparse and dense matrices, vectors and graphs, written in Java. Jpetra is intended to provide the foundation for basic matrix and vector operations for Java developers. Jpetra provides distributed memory operations via an abstract parallel machine interface. The most common implementation of this interface will be Java sockets.
Students in small groups conduct an investigation into the similarities and differences between solar tea and tea brewed by boiling water. Students will compare their two samples on four criteria—color, clarity, smell and taste—rate which they prefer, and graph the results of the experiment as a class.
Vibrationally resolved transitions in ion-molecule and atom-molecular ion slow collisions
The data tables and interactive graphs made available here contain theoretical integral cross sections for vibrational excitation and vibrationally resolved charge transfer from vibrationally excited states of H2 and H2+ with protons and hydrogen atoms, respectively. [From http://www-cfadc.phy.ornl.gov/h2mol/home.html] (Specialized Interface)
The very particular structure of the very hard instances
Vlasie, D.R.
1996-12-31
We show that the algorithms which behave well on average may have difficulty only for highly structured, non-random inputs, except in a finite number of cases. The formal framework is provided by the theory of Kolmogorov complexity. An experimental verification is done for graph 3-colorability with Brelaz`s algorithm.
U.S. LNG imports, exports to grow steadily through 2000
Swain, E.J.
1996-02-12
This paper shows historical trends in the import and export market of liquefied natural gas in the US. It makes predictions on future markets and shows the capacities of import and export terminals. It then gives historical pricing information and makes predictions on the future trends. The paper contains numerous graphs and tables on these predictions and historic values.
Data report - June`s transactions
1996-07-01
This article is the June 1996 data summary. It contains charts and graphs on the following subjects: (1) June`s transactions, (2) Uranium price range data, (3) Uranium historical price data, (4) US/DOE and Euratom average contract prices for natural uranium, (5) SWU historical price data, (6) SWU spot/secondary market data, and (7) US DOE SWU price data.
Human Factors Evaluation of Advanced Electric Power Grid Visualization Tools
Greitzer, Frank L.; Dauenhauer, Peter M.; Wierks, Tamara G.; Podmore, Robin
2009-04-01
This report describes initial human factors evaluation of four visualization tools (Graphical Contingency Analysis, Force Directed Graphs, Phasor State Estimator and Mode Meter/ Mode Shapes) developed by PNNL, and proposed test plans that may be implemented to evaluate their utility in scenario-based experiments.
Energy Science and Technology Software Center
2014-07-01
Chizu is a tool for Mapping MPI processes or tasks to physical processors or nodes for optimizing communication performance. It takes the communication graph of a High Performance Computing (HPC) application and the interconnection topology of a supercomputer as input. It outputs a new MPI rand to processor mapping, which can be used when launching the HPC application.
Critical Configurations of Hard Disks on the Torus
Mason, J.
2013-04-16
CCHDT constructs and classifies various arrangements of hard disks of a single radius places on the unit square with periodic boundary conditions. Specifially, a given configuration is evolved to the nearest critical point on a smoothed hard disk energy fuction, and is classified by the adjacency matrix of the canonically labelled contact graph.
DEMO: Action Recommendation for Cyber Resilience
Rodriguez, Luke R.; Curtis, Darren S.; Choudhury, Sutanay; Oler, Kiri J.; Nordquist, Peter L.; Chen, Pin-Yu; Ray, Indrajit
2015-09-01
In this demonstration we show the usefulness of our unifying graph-based model for the representation of infrastructure, behavior, and missions of cyber enterprise in both a software simulation and on an Amazon Web Services (AWS) instance. We show the effectiveness of our recommendation algorithm for preserving various system health metrics in both cases.
National Nuclear Security Administration (NNSA)
Averages (1981-1967), October 56 I i i i i i i 12 15 18 21 24 Hour of Day MST Graph HI-24. Daily March of Wind Speed, 7-Year Averages (1961-1967), November 57 w -*-> o Ti O "S...
U.S. Department of Energy (DOE) - all webpages (Extended Search)
Research Methods Research Methods being developed by MANTISSA Researchers Celeste: Bayesian modeling for astronomical images Randomized Linear Algebra for BioImaging Large-Scale PCA for Climate Efficient Graph Analytics for Genomics Unsupervised Learning for Neuroscience Deep Learning for Object Recognition Deep Learning for Daya Bay Unsupervised Learning in Neuroscience Last edited: 2016-11-01 15:21:22
STORM: A STatistical Object Representation Model
Rafanelli, M. ); Shoshani, A. )
1989-11-01
In this paper we explore the structure and semantic properties of the entities stored in statistical databases. We call such entities statistical objects'' (SOs) and propose a new statistical object representation model,'' based on a graph representation. We identify a number of SO representational problems in current models and propose a methodology for their solution. 11 refs.
Parallel Breadth-First Search on Distributed Memory Systems
Computational Research Division; Buluc, Aydin; Madduri, Kamesh
2011-04-15
Data-intensive, graph-based computations are pervasive in several scientific applications, and are known to to be quite challenging to implement on distributed memory systems. In this work, we explore the design space of parallel algorithms for Breadth-First Search (BFS), a key subroutine in several graph algorithms. We present two highly-tuned par- allel approaches for BFS on large parallel systems: a level-synchronous strategy that relies on a simple vertex-based partitioning of the graph, and a two-dimensional sparse matrix- partitioning-based approach that mitigates parallel commu- nication overhead. For both approaches, we also present hybrid versions with intra-node multithreading. Our novel hybrid two-dimensional algorithm reduces communication times by up to a factor of 3.5, relative to a common vertex based approach. Our experimental study identifies execu- tion regimes in which these approaches will be competitive, and we demonstrate extremely high performance on lead- ing distributed-memory parallel systems. For instance, for a 40,000-core parallel execution on Hopper, an AMD Magny- Cours based system, we achieve a BFS performance rate of 17.8 billion edge visits per second on an undirected graph of 4.3 billion vertices and 68.7 billion edges with skewed degree distribution.
Curtis, Darren S.; Phillips, Aaron R.; McCue, Lee Ann
2013-04-15
SPOCS implements a graph-based ortholog prediction method to generate a simple tab-delimited table of orthologs, and in addition, html files that provide a visualization of the ortholog/paralog relationships to which gene/protein expression metadata may be overlaid.
Renewable Electricity Futures Study - Volume One
Hand, Maureen; Mai, Treui; Baldwin, Sam; Brinkman, Greg; Sandor, Debbie; Denholm, Paul; Heath, Garvin; Wiser, Ryan
2016-06-01
Renewable Electricity Futures Study - Volume One. This is part of a series of four volumes describing exploring a high-penetration renewable electricity future for the United States of America. This data set is provides data for the entire volume one document and includes all data for the charts and graphs included in the document.
The Climate at Los Alamos; Are we measurement changes?
Dewart, Jean Marie
2015-04-16
A new report shows new graphic displays of the weather trends in Los Alamos, New Mexico, and at the Los Alamos National Laboratory (LANL). The graphs show trends of average, minimum average, and maximum average temperature for summer and winter months going back decades. Records of summer and winter precipitation are also included in the report.
U.S. Department of Energy (DOE) - all webpages (Extended Search)
are listed in Table 20.4 Resonances in 19F(n, )16N (in PDF or PS) (BO55A, MA55L: see graph in (HU58)). See also (WI37E, BO55D, GR55D, KO58A). 15. 19F(d, p)20F Qm 4.379 Q0 ...
Control algorithms for autonomous robot navigation
Jorgensen, C.C.
1985-09-20
This paper examines control algorithm requirements for autonomous robot navigation outside laboratory environments. Three aspects of navigation are considered: navigation control in explored terrain, environment interactions with robot sensors, and navigation control in unanticipated situations. Major navigation methods are presented and relevance of traditional human learning theory is discussed. A new navigation technique linking graph theory and incidental learning is introduced.
A Novel Coarsening Method for Scalable and Efficient Mesh Generation
Yoo, A; Hysom, D; Gunney, B
2010-12-02
In this paper, we propose a novel mesh coarsening method called brick coarsening method. The proposed method can be used in conjunction with any graph partitioners and scales to very large meshes. This method reduces problem space by decomposing the original mesh into fixed-size blocks of nodes called bricks, layered in a similar way to conventional brick laying, and then assigning each node of the original mesh to appropriate brick. Our experiments indicate that the proposed method scales to very large meshes while allowing simple RCB partitioner to produce higher-quality partitions with significantly less edge cuts. Our results further indicate that the proposed brick-coarsening method allows more complicated partitioners like PT-Scotch to scale to very large problem size while still maintaining good partitioning performance with relatively good edge-cut metric. Graph partitioning is an important problem that has many scientific and engineering applications in such areas as VLSI design, scientific computing, and resource management. Given a graph G = (V,E), where V is the set of vertices and E is the set of edges, (k-way) graph partitioning problem is to partition the vertices of the graph (V) into k disjoint groups such that each group contains roughly equal number of vertices and the number of edges connecting vertices in different groups is minimized. Graph partitioning plays a key role in large scientific computing, especially in mesh-based computations, as it is used as a tool to minimize the volume of communication and to ensure well-balanced load across computing nodes. The impact of graph partitioning on the reduction of communication can be easily seen, for example, in different iterative methods to solve a sparse system of linear equation. Here, a graph partitioning technique is applied to the matrix, which is basically a graph in which each edge is a non-zero entry in the matrix, to allocate groups of vertices to processors in such a way that many of
Webster, Jennifer B.; Erikson, Luke E.; Gastelum, Zoe N.; Lewis, Valerie A.; Best, Daniel M.; Hogan, Emilie A.; Chikkagoudar, Satish
2014-05-12
strategic goods into a challenge problem for testing their methodology and tools. As a first step towards the detection and characterization of illicit procurement networks, our research examines procurement networks as defined by a system of entities (people or companies) that enter into transactions of specific items with one another. Once we have defined such networks, we are interested in answering questions about the behavior and characterization of such networks. The questions we wish to answer regarding procurement networks are, first, Can we detect networks within large, noisy datasets? and second, To what extent can we compare multiple networks and identify their similarities? As procurement networks can be naturally viewed as a graph, we have employed several graph analytic tools to aid in these tasks. In particular, Graphscape, an SDI tool, uses a novel method to approximate edit distance, a graph distance measure based on the number of changes needed to transform one graph into another, in order to measure how similar two given graphs are to each other. Given a set of graphs where vertices represent companies and edges represent a shipment from company A to company B, we can calculate an all-for-all comparison of graphs. In this way, we are able to determine which graphs are most similar, and which require more changes to transform one into the other. The set of graphs to be compared can be further specialized to provide more insight, e.g., using different time periods to explore events in a company life cycle.
U.S. Department of Energy (DOE) - all webpages (Extended Search)
Clean Combustion Engines with Predictive Simulation Tools (555 downloads) Hyperspectral Imaging (683 downloads) Cell-Like Vesicle Encapsulation (815 downloads) ...
EMAB Meetings | Department of Energy
Office of Energy Efficiency and Renewable Energy (EERE) (indexed site)
EMAB Meetings EMAB Meetings No downloads
Vehicle Technologies Fact of the Week 2013
Davis, Stacy Cagle; Williams, Susan E; Moore, Sheila A; Boundy, Robert Gary
2014-03-01
Each week the U.S. Department of Energy s Vehicle Technology Office (VTO) posts a Fact of the Week on their website: http://www1.eere.energy.gov/vehiclesandfuels/ . These Facts provide statistical information, usually in the form of charts and tables, on vehicle sales, fuel economy, gasoline prices, and other transportation-related trends. Each Fact is a stand-alone page that includes a graph, text explaining the significance of the data, the supporting information on which the graph was based, and the source of the data. A link to the current week s Fact is available on the VTO homepage, but older Facts are archived and still available at: http://www1.eere.energy.gov/vehiclesandfuels/facts/. This report is a compilation of the Facts that were posted during calendar year 2013. The Facts were written and prepared by staff in Oak Ridge National Laboratory's Center for Transportation Analysis.
Vehicle Technologies’ Fact of the Week 2013
Davis, Stacy Cagle; Diegel, Susan W.; Moore, Sheila A.; Boundy, Robert Gary
2014-04-01
Each week the U.S. Department of Energy’s Vehicle Technology Office (VTO) posts a Fact of the Week on their website: http://www1.eere.energy.gov/vehiclesandfuels/ . These Facts provide statistical information, usually in the form of charts and tables, on vehicle sales, fuel economy, gasoline prices, and other transportation-related trends. Each Fact is a stand-alone page that includes a graph, text explaining the significance of the data, the supporting information on which the graph was based, and the source of the data. A link to the current week’s Fact is available on the VTO homepage, but older Facts are archived and still available at: http://www1.eere.energy.gov/vehiclesandfuels/facts/. This report is a compilation of the Facts that were posted during calendar year 2013. The Facts were written and prepared by staff in Oak Ridge National Laboratory's Center for Transportation Analysis.
MPI Runtime Error Detection with MUST: Advances in Deadlock Detection
Hilbrich, Tobias; Protze, Joachim; Schulz, Martin; de Supinski, Bronis R.; Müller, Matthias S.
2013-01-01
The widely used Message Passing Interface (MPI) is complex and rich. As a result, application developers require automated tools to avoid and to detect MPI programming errors. We present the Marmot Umpire Scalable Tool (MUST) that detects such errors with significantly increased scalability. We present improvements to our graph-based deadlock detection approach for MPI, which cover future MPI extensions. Our enhancements also check complex MPI constructs that no previous graph-based detection approach handled correctly. Finally, we present optimizations for the processing of MPI operations that reduce runtime deadlock detection overheads. Existing approaches often require 𝒪( p ) analysis timemore » per MPI operation, for p processes. We empirically observe that our improvements lead to sub-linear or better analysis time per operation for a wide range of real world applications.« less
Baldwin, Nicole E.; Chesler, Elissa J.; Kirov, Stefan; Langston, Michael A.; Snoddy, Jay R.; Williams, Robert W.; Zhang, Bing
2005-01-01
Gene expression microarray data can be used for the assembly of genetic coexpression network graphs. Using mRNA samples obtained from recombinant inbred Mus musculus strains, it is possible to integrate allelic variation with molecular and higher-order phenotypes. The depth of quantitative genetic analysis of microarray data can be vastly enhanced utilizing this mouse resource in combination with powerful computational algorithms, platforms, and data repositories. The resulting network graphs transect many levels of biological scale. This approach is illustrated with the extraction of cliques of putatively co-regulated genes and their annotation using gene ontology analysis and cis -regulatory element discovery.more » The causal basis for co-regulation is detected through the use of quantitative trait locus mapping.« less
Generalized constructive tree weights
Rivasseau, Vincent E-mail: adrian.tanasa@ens-lyon.org; Tanasa, Adrian E-mail: adrian.tanasa@ens-lyon.org
2014-04-15
The Loop Vertex Expansion (LVE) is a quantum field theory (QFT) method which explicitly computes the Borel sum of Feynman perturbation series. This LVE relies in a crucial way on symmetric tree weights which define a measure on the set of spanning trees of any connected graph. In this paper we generalize this method by defining new tree weights. They depend on the choice of a partition of a set of vertices of the graph, and when the partition is non-trivial, they are no longer symmetric under permutation of vertices. Nevertheless we prove they have the required positivity property to lead to a convergent LVE; in fact we formulate this positivity property precisely for the first time. Our generalized tree weights are inspired by the Brydges-Battle-Federbush work on cluster expansions and could be particularly suited to the computation of connected functions in QFT. Several concrete examples are explicitly given.
Wind energy resource atlas. Volume 8. The southern Rocky Mountain region
Andersen, S.R.; Freeman, D.L.; Hadley, D.L.; Elliott, D.L.; Barchet, W.R.; George, R.L.
1981-03-01
The Southern Rocky Mountain atlas assimilates five collections of wind resource data: one for the region and one for each of the four states that compose the Southern Rocky Mountain region (Arizona, Colorado, New Mexico, and Utah). At the state level, features of the climate, topography and wind resource are discussed in greater detail than is provided in the regional discussion, and the data locations on which the assessment is based are mapped. Variations, over several time scales, in the wind resource at selected stations in each state are shown on graphs of monthly average and interannual wind speed and power, and hourly average wind speed for each season. Other graphs present speed, direction, and duration frequencies of the wind at these locations.
Vehicle Technologies' Fact of the Week 2011
Davis, Stacy Cagle; Diegel, Susan W; Boundy, Robert Gary
2012-04-01
Each week the U.S. Department of Energy s Vehicle Technology Program (VTP) posts a Fact of the Week on their website: http://www1.eere.energy.gov/vehiclesandfuels/. These Facts provide statistical information, usually in the form of charts and tables, on vehicle sales, fuel economy, gasoline prices, and other transportation-related trends. Each Fact is a stand-alone page that includes a graph, text explaining the significance of the data, the supporting information on which the graph was based, and the source of the data. A link to the current Fact is available Monday through Friday on the VTP homepage, but older Facts are archived and still available at: http://www1.eere.energy.gov/vehiclesandfuels/facts/. This report is a compilation of the Facts that were posted during calendar year 2011. The Facts were written and prepared by staff in Oak Ridge National Laboratory's Center for Transportation Analysis.
Vehicle Technologies' Fact of the Week 2012
Davis, Stacy Cagle; Diegel, Susan W; Moore, Sheila A; Boundy, Robert Gary
2013-02-01
Each week the U.S. Department of Energy s Vehicle Technology Office (VTO) posts a Fact of the Week on their website: http://www1.eere.energy.gov/vehiclesandfuels/ . These Facts provide statistical information, usually in the form of charts and tables, on vehicle sales, fuel economy, gasoline prices, and other transportation-related trends. Each Fact is a stand-alone page that includes a graph, text explaining the significance of the data, the supporting information on which the graph was based, and the source of the data. A link to the current week s Fact is available on the VTO homepage, but older Facts are archived and still available at: http://www1.eere.energy.gov/vehiclesandfuels/facts/. This report is a compilation of the Facts that were posted during calendar year 2012. The Facts were written and prepared by staff in Oak Ridge National Laboratory's Center for Transportation Analysis.
Translating Non-Trivial Algorithms from the Circuit Model to the Measurement
Smith IV, Amos M; Alsing, Paul; Lott, Capt. Gordon; Fanto, Michael
2015-01-01
We provide a set of prescriptions for implementing a circuit model algorithm as measurement based quantum computing via a large discrete cluster state constructed sequentially, from qubits implemented as single photons. We describe a large optical discrete graph state capable of searching logical 4 and 8 element lists as an example. To do so we have developed several prescriptions based on analytic evaluation of the evolution of discrete cluster states and graph state equations. We describe the cluster state as a sequence of repeated entanglement and measurement steps using a small number of single photons for each step. These prescriptions can be generalized to implement any logical circuit model operation with appropriate single photon measurements and feed forward error corrections. Such a cluster state is not guaranteed to be optimal (i.e. minimum number of photons, measurements, run time).
The Inhibiting Bisection Problem
Pinar, Ali; Fogel, Yonatan; Lesieutre, Bernard
2006-12-18
Given a graph where each vertex is assigned a generation orconsumption volume, we try to bisect the graph so that each part has asignificant generation/consumption mismatch, and the cutsize of thebisection is small. Our motivation comes from the vulnerability analysisof distribution systems such as the electric power system. We show thatthe constrained version of the problem, where we place either the cutsizeor the mismatch significance as a constraint and optimize the other, isNP-complete, and provide an integer programming formulation. We alsopropose an alternative relaxed formulation, which can trade-off betweenthe two objectives and show that the alternative formulation of theproblem can be solved in polynomial time by a maximum flow solver. Ourexperiments with benchmark electric power systems validate theeffectiveness of our methods.
Network Intrusion Detection and Visualization using Aggregations in a Cyber Security Data Warehouse
Czejdo, Bogdan; Ferragut, Erik M; Goodall, John R; Laska, Jason A
2012-01-01
The challenge of achieving situational understanding is a limiting factor in effective, timely, and adaptive cyber-security analysis. Anomaly detection fills a critical role in network assessment and trend analysis, both of which underlie the establishment of comprehensive situational understanding. To that end, we propose a cyber security data warehouse implemented as a hierarchical graph of aggregations that captures anomalies at multiple scales. Each node of our pro-posed graph is a summarization table of cyber event aggregations, and the edges are aggregation operators. The cyber security data warehouse enables domain experts to quickly traverse a multi-scale aggregation space systematically. We describe the architecture of a test bed system and a summary of results on the IEEE VAST 2012 Cyber Forensics data.
Towards A Network-of-Networks Framework for Cyber Security
Halappanavar, Mahantesh; Choudhury, Sutanay; Hogan, Emilie A.; Hui, Peter SY; Johnson, John R.; Ray, Indrajit; Holder, Lawrence B.
2013-06-07
Networks-of-networks (NoN) is a graph-theoretic model of interdependent networks that have distinct dynamics at each network (layer). By adding special edges to represent relationships between nodes in different layers, NoN provides a unified mechanism to study interdependent systems intertwined in a complex relationship. While NoN based models have been proposed for cyber-physical systems, in this paper we build towards a three-layer NoN model for an enterprise cyber system. Each layer captures a different facet of a cyber system. We then discuss the potential benefits of graph-theoretic analysis enabled from such a model. Our goal is to provide a novel and powerful tool for modeling and analyzing problems in cyber security.
Wind energy resource atlas. Volume 7. The south central region
Edwards, R.L.; Graves, L.F.; Sprankle, A.C.; Elliott, D.L.; Barchet, W.R.; George, R.L.
1981-03-01
This atlas of the south central region combines seven collections of wind resource data: one for the region, and one for each of the six states (Arkansas, Kansas, Louisiana, Missouri, Oklahoma, and Texas). At the state level, features of the climate, topography, and wind resource are discussed in greater detail than that provided in the regional discussion, and the data locations on which the assessment is based are mapped. Variations, over several time scales, in the wind resource at selected stations in each state are shown on graphs of monthly average and interannual wind speed and power, and hourly average wind speed for each season. Other graphs present speed, direction, and duration frequencies of the wind at these locations.
Performance evaluation of a parallel sparse lattice Boltzmann solver
Axner, L. Bernsdorf, J. Zeiser, T. Lammers, P. Linxweiler, J. Hoekstra, A.G.
2008-05-01
We develop a performance prediction model for a parallelized sparse lattice Boltzmann solver and present performance results for simulations of flow in a variety of complex geometries. A special focus is on partitioning and memory/load balancing strategy for geometries with a high solid fraction and/or complex topology such as porous media, fissured rocks and geometries from medical applications. The topology of the lattice nodes representing the fluid fraction of the computational domain is mapped on a graph. Graph decomposition is performed with both multilevel recursive-bisection and multilevel k-way schemes based on modified Kernighan-Lin and Fiduccia-Mattheyses partitioning algorithms. Performance results and optimization strategies are presented for a variety of platforms, showing a parallel efficiency of almost 80% for the largest problem size. A good agreement between the performance model and experimental results is demonstrated.
Welcome to the Labs presentation template!
U.S. Department of Energy (DOE) - all webpages (Extended Search)
A programmable embedder Marcus Daniels <mdaniels@lanl.gov> 2016-09-29 LA-UR-16-27277 A staged approach for mapping problems to the Chimera graph Embedding Finding a minor in a bipartite graph 10/21/2016 | 2 Los Alamos National Laboratory � + � < �
Communication: Theoretical prediction of free-energy landscapes for complex self-assembly
Jacobs, William M.; Reinhardt, Aleks; Frenkel, Daan
2015-01-14
We present a technique for calculating free-energy profiles for the nucleation of multicomponent structures that contain as many species as building blocks. We find that a key factor is the topology of the graph describing the connectivity of the target assembly. By considering the designed interactions separately from weaker, incidental interactions, our approach yields predictions for the equilibrium yield and nucleation barriers. These predictions are in good agreement with corresponding Monte Carlo simulations. We show that a few fundamental properties of the connectivity graph determine the most prominent features of the assembly thermodynamics. Surprisingly, we find that polydispersity in the strengths of the designed interactions stabilizes intermediate structures and can be used to sculpt the free-energy landscape for self-assembly. Finally, we demonstrate that weak incidental interactions can preclude assembly at equilibrium due to the combinatorial possibilities for incorrect association.
Dr. George L. Mesina; Steven P. Miller
2004-08-01
The XMGR5 graphing package [1] for drawing RELAP5 [2] plots is being re-written in Java [3]. Java is a robust programming language that is available at no cost for most computer platforms from Sun Microsystems, Inc. XMGR5 is an extension of an XY plotting tool called ACE/gr extended to plot data from several US Nuclear Regulatory Commission (NRC) applications. It is also the most popular graphing package worldwide for making RELAP5 plots. In Section 1, a short review of XMGR5 is given, followed by a brief overview of Java. In Section 2, shortcomings of both tkXMGR [4] and XMGR5 are discussed and the value of converting to Java is given. Details of the conversion to Java are given in Section 3. The progress to date, some conclusions and future work are given in Section 4. Some screen shots of the Java version are shown.
Managing complexity in simulations of land surface and near-surface processes
Coon, Ethan T.; Moulton, J. David; Painter, Scott L.
2016-01-12
Increasing computing power and the growing role of simulation in Earth systems science have led to an increase in the number and complexity of processes in modern simulators. We present a multiphysics framework that specifies interfaces for coupled processes and automates weak and strong coupling strategies to manage this complexity. Process management is enabled by viewing the system of equations as a tree, where individual equations are associated with leaf nodes and coupling strategies with internal nodes. A dynamically generated dependency graph connects a variable to its dependencies, streamlining and automating model evaluation, easing model development, and ensuring models aremore » modular and flexible. Additionally, the dependency graph is used to ensure that data requirements are consistent between all processes in a given simulation. Here we discuss the design and implementation of these concepts within the Arcos framework, and demonstrate their use for verification testing and hypothesis evaluation in numerical experiments.« less
OPTICAL TRANSCRIBING OSCILLOSCOPE
Kerns, Q.A.
1961-09-26
A device is designed for producing accurate graphed waveforms of very fast electronic pulses. The fast pulse is slowly tracked on a cathode ray tube and a pair of photomultiplier tubes, exposed to the pulse trace, view separate vertical portions thereof at each side of a fixed horizontal reference. Each phototube produces an output signal indicative of vertical movement of the exposed trace, which simultaneous signals are compared in a difference amplifier. The amplifier produces a difference signal which, when applied to the cathode ray tube, maintains the trace on the reference. A graphic recorder receives the amplified difference signal at an x-axis input, while a y-axis input is synchronized with the tracking time of the cathode ray tube and therefore graphs the enlarged waveshape.
The inhibiting bisection problem.
Pinar, Ali
2010-11-01
Given a graph where each vertex is assigned a generation or consumption volume, we try to bisect the graph so that each part has a significant generation/consumption mismatch, and the cutsize of the bisection is small. Our motivation comes from the vulnerability analysis of distribution systems such as the electric power system. We show that the constrained version of the problem, where we place either the cutsize or the mismatch significance as a constraint and optimize the other, is NP-complete, and provide an integer programming formulation. We also propose an alternative relaxed formulation, which can trade-off between the two objectives and show that the alternative formulation of the problem can be solved in polynomial time by a maximum flow solver. Our experiments with benchmark electric power systems validate the effectiveness of our methods.
Carnes, J.R.; Kherani, N.P.
1987-11-01
Metal hydride information is not available for most hydrides in a consolidated quick-reference source. This report's objective is to fill the need for such a document providing basic thermodynamic data for as many metal hydrides as possible. We conduced a computerized library search to access as many sources as possible and screened each source for such thermodynamic data as pressure-temperature graphs, van't Hoff curves, and impurity effects. We included any other relevant information and commented on it. A primary concern to be investigated in the future is the behavior of metal tritides. This would be important in the area of emergency tritium cleanup systems. The hydride graphs are useful, however, as tritides may be expected in most cases to behave similarly and at least follow trends of their respective hydrides. 42 refs., 40 figs., 5 tabs.
Wind energy resource atlas. Volume 2. The North Central Region
Freeman, D.L.; Hadley, D.L.; Elliott, D.L.; Barchet, W.R.; George, R.L.
1981-02-01
The North Central atlas assimilates six collections of wind resource data: one for the region and one for each of the five states that compose the North Central region (Iowa, Minnesota, Nebraska, North Dakota, and South Dakota). At the state level, features of the climate, topography and wind resource are discussed in greater detail than is provided in the regional discussion, and that data locations on which the assessment is based are mapped. Variations, over several time scales, in the wind resource at selected stations in each state are shown on graphs of monthly average and international wind speed and power, and hourly average wind speed for each season. Other graphs present speed direction and duration frequencies of the wind at these locations.
Shocks and finite-time singularities in Hele-Shaw flow
Teodorescu, Razvan; Wiegmann, P; Lee, S-y
2008-01-01
Hele-Shaw flow at vanishing surface tension is ill-defined. In finite time, the flow develops cusplike singularities. We show that the ill-defined problem admits a weak dispersive solution when singularities give rise to a graph of shock waves propagating in the viscous fluid. The graph of shocks grows and branches. Velocity and pressure jump across the shock. We formulate a few simple physical principles which single out the dispersive solution and interpret shocks as lines of decompressed fluid. We also formulate the dispersive solution in algebro-geometrical terms as an evolution of Krichever-Boutroux complex curve. We study in details the most generic (2,3) cusp singularity which gives rise to an elementary branching event. This solution is self-similar and expressed in terms of elliptic functions.
Information processing systems, reasoning modules, and reasoning system design methods
Hohimer, Ryan E.; Greitzer, Frank L.; Hampton, Shawn D.
2015-08-18
Information processing systems, reasoning modules, and reasoning system design methods are described. According to one aspect, an information processing system includes working memory comprising a semantic graph which comprises a plurality of abstractions, wherein the abstractions individually include an individual which is defined according to an ontology and a reasoning system comprising a plurality of reasoning modules which are configured to process different abstractions of the semantic graph, wherein a first of the reasoning modules is configured to process a plurality of abstractions which include individuals of a first classification type of the ontology and a second of the reasoning modules is configured to process a plurality of abstractions which include individuals of a second classification type of the ontology, wherein the first and second classification types are different.
Information processing systems, reasoning modules, and reasoning system design methods
Hohimer, Ryan E; Greitzer, Frank L; Hampton, Shawn D
2014-03-04
Information processing systems, reasoning modules, and reasoning system design methods are described. According to one aspect, an information processing system includes working memory comprising a semantic graph which comprises a plurality of abstractions, wherein the abstractions individually include an individual which is defined according to an ontology and a reasoning system comprising a plurality of reasoning modules which are configured to process different abstractions of the semantic graph, wherein a first of the reasoning modules is configured to process a plurality of abstractions which include individuals of a first classification type of the ontology and a second of the reasoning modules is configured to process a plurality of abstractions which include individuals of a second classification type of the ontology, wherein the first and second classification types are different.