National Library of Energy BETA

Sample records for hydrographs time-concentration graphs

  1. Appendix D Surface Water and Ground Water Time-Concentration...

    Office of Legacy Management (LM)

    Surface Water and Ground Water Time-Concentration Plots, Stream Discharge Measurements, Ground Water Level Data, and Ground Water Well Hydrographs This page intentionally left ...

  2. Graph Theory

    SciTech Connect (OSTI)

    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.

  3. Utilization Graphs

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    that use data from the PDSF batch scheduler (SGE) to show the utilization of the cluster over the past 24 hours. The graphs were generated with RRDTool and are updated...

  4. Methods of visualizing graphs

    DOE Patents [OSTI]

    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.

  5. mpiGraph

    Energy Science and Technology Software Center (OSTI)

    2007-05-22

    MpiGraph consists of an MPI application called mpiGraph written in C to measure message bandwidth and an associated crunch_mpiGraph script written in Perl to process the application output into an HTMO report. The mpiGraph application is designed to inspect the health and scalability of a high-performance interconnect while under heavy load. This is useful to detect hardware and software problems in a system, such as slow nodes, links, switches, or contention in switch routing. Itmore » is also useful to characterize how interconnect performance changes with different settings or how one interconnect type compares to another.« less

  6. Graph Generator Survey

    SciTech Connect (OSTI)

    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.

  7. Graphs, matrices, and the GraphBLAS: Seven good reasons

    SciTech Connect (OSTI)

    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.

  8. Graphs, matrices, and the GraphBLAS: Seven good reasons

    DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)

    Kepner, Jeremy; Bader, David; Buluç, Aydın; Gilbert, John; Mattson, Timothy; Meyerhenke, Henning

    2015-01-01

    The analysis of graphs has become increasingly important to a wide range of applications. Graph analysis presents a number of unique challenges in the areas of (1) software complexity, (2) data complexity, (3) security, (4) mathematical complexity, (5) theoretical analysis, (6) serial performance, and (7) parallel performance. Implementing graph algorithms using matrix-based approaches provides a number of promising solutions to these challenges. The GraphBLAS standard (istcbigdata.org/GraphBlas) is being developed to bring the potential of matrix based graph algorithms to the broadest possible audience. The GraphBLAS mathematically defines a core set of matrix-based graph operations that can be used to implementmore » a wide class of graph algorithms in a wide range of programming environments. This paper provides an introduction to the GraphBLAS and describes how the GraphBLAS can be used to address many of the challenges associated with analysis of graphs.« less

  9. Subdominant pseudoultrametric on graphs

    SciTech Connect (OSTI)

    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.

  10. GraphLib

    Energy Science and Technology Software Center (OSTI)

    2013-02-19

    This library is used in several LLNL projects, including STAT (the Stack Trace Analysis Tool for scalable debugging) and some modules in P^nMPI (a tool MPI tool infrastructure). It can also be used standalone for creating and manipulationg graphs, but its API is primarily tuned to support these other projects

  11. Temporal Representation in Semantic Graphs

    SciTech Connect (OSTI)

    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.

  12. Simple and Flexible Scene Graph

    Energy Science and Technology Software Center (OSTI)

    2007-10-01

    The system implements a flexible and extensible scene graph for the visualization and analysis of scientific information.

  13. A Clustering Graph Generator

    SciTech Connect (OSTI)

    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.

  14. Recursive Feature Extraction in Graphs

    Energy Science and Technology Software Center (OSTI)

    2014-08-14

    ReFeX extracts recursive topological features from graph data. The input is a graph as a csv file and the output is a csv file containing feature values for each node in the graph. The features are based on topological counts in the neighborhoods of each nodes, as well as recursive summaries of neighbors' features.

  15. Graph Coarsening for Path Finding in Cybersecurity Graphs

    SciTech Connect (OSTI)

    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.

  16. Quantum Graph Analysis

    SciTech Connect (OSTI)

    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%.

  17. A Collection of Features for Semantic Graphs

    SciTech Connect (OSTI)

    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.

  18. Graph Partitioning and Sequencing Software

    Energy Science and Technology Software Center (OSTI)

    1995-09-19

    Graph partitioning is a fundemental problem in many scientific contexts. CHACO2.0 is a software package designed to partition and sequence graphs. CHACO2.0 allows for recursive application of several methods for finding small edge separators in weighted graphs. These methods include inertial, spectral, Kernighan Lin and multilevel methods in addition to several simpler strategies. Each of these approaches can be used to partition the graph into two, four, or eight pieces at each level of recursion.more » In addition, the Kernighan Lin method can be used to improve partitions generated by any of the other algorithms. CHACO2.0 can also be used to address various graph sequencing problems, with applications to scientific computing, database design, gene sequencing and other problems.« less

  19. Khovanov homology of graph-links

    SciTech Connect (OSTI)

    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.

  20. Graph Analytics for Signature Discovery

    SciTech Connect (OSTI)

    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.

  1. Graph modeling systems and methods

    SciTech Connect (OSTI)

    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.

  2. Dr.L: Distributed Recursive (Graph) Layout

    Energy Science and Technology Software Center (OSTI)

    2007-11-19

    Dr. L provides two-dimensional visualizations of very large abstract graph structures. it can be used for data mining applications including biology, scientific literature, and social network analysis. Dr. L is a graph layout program that uses a multilevel force-directed algorithm. A graph is input and drawn using a force-directed algorithm based on simulated annealing. The resulting layout is clustered using a single link algorithm. This clustering is used to produce a coarsened graph (fewer nodes)more » which is then re-drawn. this process is repeated until a sufficiently small graph is produced. The smallest graph is drawn and then used as a basis for drawing the original graph by refining the series of coarsened graphs that were produced. The layout engine can be run in serial or in parallel.« less

  3. API Requirements for Dynamic Graph Prediction

    SciTech Connect (OSTI)

    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.

  4. Fast generation of sparse random kernel graphs

    SciTech Connect (OSTI)

    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.

  5. Fast generation of sparse random kernel graphs

    DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)

    Hagberg, Aric; Lemons, Nathan; Du, Wen -Bo

    2015-09-10

    The development of kernel-based inhomogeneous random graphs has provided models that are flexible enough to capture many observed characteristics of real networks, and that are also mathematically tractable. We specify a class of inhomogeneous random graph models, called random kernel graphs, that produces sparse graphs with tunable graph properties, and we develop an efficient generation algorithm to sample random instances from this model. As real-world networks are usually large, it is essential that the run-time of generation algorithms scales better than quadratically in the number of vertices n. We show that for many practical kernels our algorithm runs in timemore » at most ο(n(logn)²). As an example, we show how to generate samples of power-law degree distribution graphs with tunable assortativity.« less

  6. Graph algorithms in the titan toolkit.

    SciTech Connect (OSTI)

    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.

  7. Enabling Graph Appliance for Genome Assembly

    SciTech Connect (OSTI)

    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.

  8. Useful Graphs and Charts - Ion Beams - Radiation Effects Facility...

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Times 15 MeVu LET vs Range Graph 25 MeVu LET vs Range Graph 40 Mevu LET vs Range Graph Radiation Effects Facility Cyclotron Institute Texas A&M University MS 3366 ...

  9. Graph Mining Meets the Semantic Web

    SciTech Connect (OSTI)

    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.

  10. GraphReduce: Processing Large-Scale Graphs on Accelerator-Based Systems

    SciTech Connect (OSTI)

    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.

  11. GraphReduce: Large-Scale Graph Analytics on Accelerator-Based HPC Systems

    SciTech Connect (OSTI)

    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.

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

    SciTech Connect (OSTI)

    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.

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

    DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)

    Lee, Sangkeun; Sukumar, Sreenivas R; Hong, Seokyong; Lim, Seung-Hwan

    2016-01-01

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

  14. The MultiThreaded Graph Library (MTGL)

    Energy Science and Technology Software Center (OSTI)

    2008-07-17

    The MultiThreaded Graph Library (MTGL) is a set of header files that implement graph algorithm in such a way that they can run on massively multithreaded architectures. It is based upon the Boost Graph Library, but doesn’t use Boost since the latter doesn’t run well on these architectures.

  15. Bipartite graph partitioning and data clustering

    SciTech Connect (OSTI)

    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.

  16. Visualization Graph | OpenEI Community

    Open Energy Info (EERE)

    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...

  17. Fault-tolerant dynamic task graph scheduling

    SciTech Connect (OSTI)

    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.

  18. Bayati Kim Saberi random graph sampler

    Energy Science and Technology Software Center (OSTI)

    2012-06-05

    This software package implements the algorithm from a paper by Bayati, Kim, and Saberi (first reference below) to generate a uniformly random sample of a graph with a prescribed degree distribution.

  19. Comparing English, Mandarin, and Russian Hydrographic and Terrain Categories

    SciTech Connect (OSTI)

    Feng, Chen-Chieh; Sorokine, Alexandre

    2013-01-01

    The paper compares hydrographic and terrain categories in the geospatial data standards of the US, Taiwan, and Russian Federation where the dominant languages used are from di erent language families. It aims to identify structural and semantic di erences between similar categories across three geospatial data standards. By formalizing the data standard structures and identifying the properties that di erentiate sibling categories in each geospatial data standard using well-known formal relations and quality universals, we develop a common basis on which hydrographic and terrain categories in the three data standards can be compared. The result suggests that all three data standards structure categories with a mixture of relations with di erent meaning even though most of them are well-known relations in top-level ontologies. Similar categories can be found across all three standards but exact match between similar categories are rare.

  20. Accelerating semantic graph databases on commodity clusters

    SciTech Connect (OSTI)

    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.

  1. Ocean Carbon and Repeat Hydrographic CLIVAR Program Data

    DOE Data Explorer [Office of Scientific and Technical Information (OSTI)]

    Effective management and archival of data is a fundamental requirement for successful scientific research endeavors, and future oceanographic research depends on the availability and clarity of existing data. Two data offices in the US deal with reference-quality global ocean CTD, water sample, and underway data, one (CDIAC) specializing in discrete CO2 and underway surface data, and the other (WHPO/CCHDO) specializing in CTD, hydrographic, and tracer data.

  2. Graph representation of protein free energy landscape

    SciTech Connect (OSTI)

    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.

  3. Ocean Carbon and Repeat Hydrographic CLIVAR Program Data

    DOE Data Explorer [Office of Scientific and Technical Information (OSTI)]

    A systematic and global re-occupation of select hydrographic sections is underway to quantify changes in storage and transport of heat, fresh water, carbon dioxide (CO2) and related parameters. By integrating the scientific needs of the carbon and hydrography/tracer communities, major synergies and cost savings are being achieved. The philosophy is that in addition to efficiency, a coordinated approach will produce scientific advances that exceed those of having individual carbon and hydrographic/tracer programs. These advances will contribute to the following overlapping scientific objectives: • Data for Model Calibration and Validation • Carbon System Studies • Heat and Freshwater Storage and Flux Studies • Deep and Shallow Water Mass and Ventilation Studies • Calibration of Autonomous Sensors Effective management and archival of data is a fundamental requirement for successful scientific research endeavors, and future oceanographic research depends on the availability and clarity of existing data. Two data offices in the US deal with reference-quality global ocean CTD, water sample, and underway data, one (CDIAC) specializing in discrete CO2 and underway surface data, and the other (WHPO/CCHDO) specializing in CTD, hydrographic, and tracer data.

  4. Continuous-time quantum walks on star graphs

    SciTech Connect (OSTI)

    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.

  5. Dynamic graph system for a semantic database

    DOE Patents [OSTI]

    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.

  6. Dynamic graph system for a semantic database

    DOE Patents [OSTI]

    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.

  7. Communication Graph Generator for Parallel Programs

    Energy Science and Technology Software Center (OSTI)

    2014-04-08

    Graphator is a collection of relatively simple sequential programs that generate communication graphs/matrices for commonly occurring patterns in parallel programs. Currently, there is support for five communication patterns: two-dimensional 4-point stencil, four-dimensional 8-point stencil, all-to-alls over sub-communicators, random near-neighbor communication, and near-neighbor communication.

  8. GraphPrints: Towards a Graph Analytic Method for Network Anomaly Detection

    SciTech Connect (OSTI)

    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.

  9. StreamWorks - A system for Dynamic Graph Search

    SciTech Connect (OSTI)

    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.

  10. Modular Environment for Graph Research and Analysis with a Persistent

    Energy Science and Technology Software Center (OSTI)

    2009-11-18

    The MEGRAPHS software package provides a front-end to graphs and vectors residing on special-purpose computing resources. It allows these data objects to be instantiated, destroyed, and manipulated. A variety of primitives needed for typical graph analyses are provided. An example program illustrating how MEGRAPHS can be used to implement a PageRank computation is included in the distribution.The MEGRAPHS software package is targeted towards developers of graph algorithms. Programmers using MEGRAPHS would write graph analysis programsmore » in terms of high-level graph and vector operations. These computations are transparently executed on the Cray XMT compute nodes.« less

  11. Knowledge Representation Issues in Semantic Graphs for Relationship Detection

    SciTech Connect (OSTI)

    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.

  12. Frequent Subgraph Discovery in Large Attributed Streaming Graphs

    SciTech Connect (OSTI)

    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.

  13. Graph processing platforms at scale: practices and experiences

    SciTech Connect (OSTI)

    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.

  14. Jargon and Graph Modularity on Twitter

    SciTech Connect (OSTI)

    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.

  15. 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: ...

  16. A Graph Search Heuristic for Shortest Distance Paths

    SciTech Connect (OSTI)

    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.

  17. 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 ...

  18. Two linear time, low overhead algorithms for graph layout

    Energy Science and Technology Software Center (OSTI)

    2008-01-10

    The software comprises two algorithms designed to perform a 2D layout of a graph structure in time linear with respect to the vertices and edges in the graph, whereas most other layout algorithms have a running time that is quadratic with respect to the number of vertices or greater. Although these layout algorithms run in a fraction of the time as their competitors, they provide competitive results when applied to most real-world graphs. These algorithmsmore » also have a low constant running time and small memory footprint, making them useful for small to large graphs.« less

  19. International energy indicators. [Statistical tables and graphs

    SciTech Connect (OSTI)

    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.

  20. Scaling Semantic Graph Databases in Size and Performance

    SciTech Connect (OSTI)

    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.

  1. EAGLE: 'EAGLE'Is an' Algorithmic Graph Library for Exploration

    SciTech Connect (OSTI)

    2015-01-16

    The Resource Description Framework (RDF) and SPARQL Protocol and RDF Query Language (SPARQL) were introduced about a decade ago to enable flexible schema-free data interchange on the Semantic Web. Today data scientists use the framework as a scalable graph representation for integrating, querying, exploring and analyzing data sets hosted at different sources. With increasing adoption, the need for graph mining capabilities for the Semantic Web has emerged. Today there is no tools to conduct "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.'

  2. Query optimization for graph analytics on linked data using SPARQL

    SciTech Connect (OSTI)

    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.

  3. An Experiment on Graph Analysis Methodologies for Scenarios

    SciTech Connect (OSTI)

    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.

  4. Graph facilitates tracking water and gas influx

    SciTech Connect (OSTI)

    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.

  5. Composing Data Parallel Code for a SPARQL Graph Engine

    SciTech Connect (OSTI)

    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.

  6. Parallel Algorithms for Graph Optimization using Tree Decompositions

    SciTech Connect (OSTI)

    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.

  7. Data Sources For Emerging Technologies Program MYPP Target Graphs

    Broader source: Energy.gov [DOE]

    The BTO Emerging Technologies Accomplishments and Outcomes – 2015 page contains graphs on Multi-Year Program Plan R&D targets for certain technologies. This page contains information on data...

  8. Must all charting and graphing code be written in javascript...

    Open Energy Info (EERE)

    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...

  9. EAGLE: 'EAGLE'Is an' Algorithmic Graph Library for Exploration

    Energy Science and Technology Software Center (OSTI)

    2015-01-16

    The Resource Description Framework (RDF) and SPARQL Protocol and RDF Query Language (SPARQL) were introduced about a decade ago to enable flexible schema-free data interchange on the Semantic Web. Today data scientists use the framework as a scalable graph representation for integrating, querying, exploring and analyzing data sets hosted at different sources. With increasing adoption, the need for graph mining capabilities for the Semantic Web has emerged. Today there is no tools to conduct "graphmore » mining" on RDF standard data sets. We address that need through implementation of popular iterative Graph Mining algorithms (Triangle count, Connected component analysis, degree distribution, diversity degree, PageRank, etc.). We implement these algorithms as SPARQL queries, wrapped within Python scripts and call our software tool as EAGLE. In RDF style, EAGLE stands for "EAGLE 'Is an' algorithmic graph library for exploration. EAGLE is like 'MATLAB' for 'Linked Data.'« less

  10. TIFF Image Writer patch for OpenSceneGraph

    Energy Science and Technology Software Center (OSTI)

    2012-01-05

    This software consists of code modifications to the open-source OpenSceneGraph software package to enable the creation of TlFF images containing 16 bit unsigned data. They also allow the user to disable compression and set the DPI tags in the resulting TIFF Images. Some image analysis programs require uncompressed, 16 bit unsigned input data. These code modifications allow programs based on OpenSceneGraph to write out such images, improving connectivity between applications.

  11. Highly Asynchronous VisitOr Queue Graph Toolkit

    Energy Science and Technology Software Center (OSTI)

    2012-10-01

    HAVOQGT is a C++ framework that can be used to create highly parallel graph traversal algorithms. The framework stores the graph and algorithmic data structures on external memory that is typically mapped to high performance locally attached NAND FLASH arrays. The framework supports a vertex-centered visitor programming model. The frameworkd has been used to implement breadth first search, connected components, and single source shortest path.

  12. The peculiar phase structure of random graph bisection

    SciTech Connect (OSTI)

    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.

  13. Algorithms and architectures for high performance analysis of semantic graphs.

    SciTech Connect (OSTI)

    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

  14. Mining Large Heterogeneous Graphs using Cray s Urika

    SciTech Connect (OSTI)

    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.

  15. Fast Search for Dynamic Multi-Relational Graphs

    SciTech Connect (OSTI)

    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.

  16. On the mixing time of geographical threshold graphs

    SciTech Connect (OSTI)

    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).

  17. Integrated Network Decompositions and Dynamic Programming for Graph Optimization (INDDGO)

    Energy Science and Technology Software Center (OSTI)

    2012-05-31

    The INDDGO software package offers a set of tools for finding exact solutions to graph optimization problems via tree decompositions and dynamic programming algorithms. Currently the framework offers serial and parallel (distributed memory) algorithms for finding tree decompositions and solving the maximum weighted independent set problem. The parallel dynamic programming algorithm is implemented on top of the MADNESS task-based runtime.

  18. In-Memory Graph Databases for Web-Scale Data

    SciTech Connect (OSTI)

    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.

  19. STRUCTURAL ANNOTATION OF EM IMAGES BY GRAPH CUT

    SciTech Connect (OSTI)

    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).

  20. Cyber Graph Queries for Geographically Distributed Data Centers

    SciTech Connect (OSTI)

    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.

  1. LDRD final report : first application of geospatial semantic graphs to SAR image data.

    SciTech Connect (OSTI)

    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.

  2. A Graph Analytic Metric for Mitigating Advanced Persistent Threat

    SciTech Connect (OSTI)

    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.

  3. Codesign Lessons Learned from Implementing Graph Matching on Multithreaded Architectures

    SciTech Connect (OSTI)

    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.

  4. Encoding and analyzing aerial imagery using geospatial semantic graphs

    SciTech Connect (OSTI)

    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.

  5. Proximity graphs based multi-scale image segmentation

    SciTech Connect (OSTI)

    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.

  6. New Developments in MadGraph/MadEvent

    SciTech Connect (OSTI)

    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.

  7. Constructing compact and effective graphs for recommender systems via node and edge aggregations

    DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)

    Lee, Sangkeun; Kahng, Minsuk; Lee, Sang-goo

    2014-12-10

    Exploiting graphs for recommender systems has great potential to flexibly incorporate heterogeneous information for producing better recommendation results. As our baseline approach, we first introduce a naive graph-based recommendation method, which operates with a heterogeneous log-metadata graph constructed from user log and content metadata databases. Although the na ve graph-based recommendation method is simple, it allows us to take advantages of heterogeneous information and shows promising flexibility and recommendation accuracy. However, it often leads to extensive processing time due to the sheer size of the graphs constructed from entire user log and content metadata databases. In this paper, we proposemore » node and edge aggregation approaches to constructing compact and e ective graphs called Factor-Item bipartite graphs by aggregating nodes and edges of a log-metadata graph. Furthermore, experimental results using real world datasets indicate that our approach can significantly reduce the size of graphs exploited for recommender systems without sacrificing the recommendation quality.« less

  8. Detailed Hydrographic Feature Extraction from High-Resolution LiDAR Data

    SciTech Connect (OSTI)

    Danny L. Anderson

    2012-05-01

    Detailed hydrographic feature extraction from high-resolution light detection and ranging (LiDAR) data is investigated. Methods for quantitatively evaluating and comparing such extractions are presented, including the use of sinuosity and longitudinal root-mean-square-error (LRMSE). These metrics are then used to quantitatively compare stream networks in two studies. The first study examines the effect of raster cell size on watershed boundaries and stream networks delineated from LiDAR-derived digital elevation models (DEMs). The study confirmed that, with the greatly increased resolution of LiDAR data, smaller cell sizes generally yielded better stream network delineations, based on sinuosity and LRMSE. The second study demonstrates a new method of delineating a stream directly from LiDAR point clouds, without the intermediate step of deriving a DEM. Direct use of LiDAR point clouds could improve efficiency and accuracy of hydrographic feature extractions. The direct delineation method developed herein and termed “mDn”, is an extension of the D8 method that has been used for several decades with gridded raster data. The method divides the region around a starting point into sectors, using the LiDAR data points within each sector to determine an average slope, and selecting the sector with the greatest downward slope to determine the direction of flow. An mDn delineation was compared with a traditional grid-based delineation, using TauDEM, and other readily available, common stream data sets. Although, the TauDEM delineation yielded a sinuosity that more closely matches the reference, the mDn delineation yielded a sinuosity that was higher than either the TauDEM method or the existing published stream delineations. Furthermore, stream delineation using the mDn method yielded the smallest LRMSE.

  9. Discrete Mathematical Approaches to Graph-Based Traffic Analysis

    SciTech Connect (OSTI)

    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.

  10. INDDGO: Integrated Network Decomposition & Dynamic programming for Graph Optimization

    SciTech Connect (OSTI)

    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.

  11. A Space-Filling Visualization Technique for Multivariate Small World Graphs

    SciTech Connect (OSTI)

    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.

  12. Multi-Level Anomaly Detection on Time-Varying Graph Data

    SciTech Connect (OSTI)

    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.

  13. Have Green – A Visual Analytics Framework for Large Semantic Graphs

    SciTech Connect (OSTI)

    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.

  14. A framework for graph-based synthesis, analysis, and visualization of HPC cluster job data.

    SciTech Connect (OSTI)

    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.

  15. Exotic equilibria of Harary graphs and a new minimum degree lower bound for synchronization

    SciTech Connect (OSTI)

    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.

  16. A weak zero-one law for sequences of random distance graphs

    SciTech Connect (OSTI)

    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.

  17. Omega: an Overlap-graph de novo Assembler for Meta-genomics

    SciTech Connect (OSTI)

    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.

  18. September 2004 Water Sampling

    Office of Legacy Management (LM)

    .........5 Water Sampling Field Activities Verification ... Groundwater Quality Data Static Water Level Data Hydrographs Time-Concentration ...

  19. September 2004 Water Sampling

    Office of Legacy Management (LM)

    .........5 Water Sampling Field Activities Verification ... Groundwater Quality Data Static Water Level Data Hydrograph Time-Concentration ...

  20. Structure Discovery in Large Semantic Graphs Using Extant Ontological Scaling and Descriptive Statistics

    SciTech Connect (OSTI)

    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;

  1. Wedge sampling for computing clustering coefficients and triangle counts on large graphs

    DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)

    Seshadhri, C.; Pinar, Ali; Kolda, Tamara G.

    2014-05-08

    Graphs are used to model interactions in a variety of contexts, and there is a growing need to quickly assess the structure of such graphs. Some of the most useful graph metrics are based on triangles, such as those measuring social cohesion. Despite the importance of these triadic measures, algorithms to compute them can be extremely expensive. We discuss the method of wedge sampling. This versatile technique allows for the fast and accurate approximation of various types of clustering coefficients and triangle counts. Furthermore, these techniques are extensible to counting directed triangles in digraphs. Our methods come with provable andmore » practical time-approximation tradeoffs for all computations. We provide extensive results that show our methods are orders of magnitude faster than the state of the art, while providing nearly the accuracy of full enumeration.« less

  2. Graph of Total Number of Oligos Within Windows of a Sequence

    Energy Science and Technology Software Center (OSTI)

    1995-11-28

    SEQWIN is user-friendly software which graphs the total number of oligos present in a sequence. The sequence is scanned one window at a time; windows can be overlapping. Each bar on the graph represents a single window down the sequence. The user specifies the sequence of interest and a list of oligos as program input. If the sequence is known, locations of specific structure or sequences can be specified and compared with the bars onmore » a graph. The window size, amount of overlap of the windows, number of windows to be considered, and the starting position of the first window used can be adjusted at the user's discretion.« less

  3. Synthetic graph generation for data-intensive HPC benchmarking: Scalability, analysis and real-world application

    SciTech Connect (OSTI)

    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.

  4. Carbon Dioxide, Hydrographic, and Chemical Data Obtained During the R/V Thomas G. Thompson Cruise in the Pacific Ocean

    SciTech Connect (OSTI)

    Sabine, C.L.; Key, R.M.; Hall, M.; Kozyr, A.

    1999-08-01

    This data documentation discusses the procedures and methods used to measure total carbon dioxide (TCO2), total alkalinity (TALK), and radiocarbon (delta 14C), at hydrographic stations, as well as the underway partial pressure of CO2 (pCO2) during the R/V Thomas G. Thompson oceanographic cruise in the Pacific Ocean (Section P10). Conducted as part of the World Ocean Circulation Experiment (WOCE), the cruise began in Suva, Fiji, on October 5, 1993, and ended in Yokohama, Japan, on November 10, 1993. Measurements made along WOCE Section P10 included pressure, temperature, salinity [measured by conductivity temperature, and depth sensor (CTD)], bottle salinity, bottle oxygen, phosphate, nitrate, silicate, chlorofluorocarbons (CFC-11, CFC-12), TCO2, TALK, delta 14C, and underway pCO2.

  5. Absolutely continuous spectrum implies ballistic transport for quantum particles in a random potential on tree graphs

    SciTech Connect (OSTI)

    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.

  6. Exact scattering matrix of graphs in magnetic field and quantum noise

    SciTech Connect (OSTI)

    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.

  7. Quantum dynamics via Planck-scale-stepped action-carrying 'Graph Paths'

    SciTech Connect (OSTI)

    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.

  8. The d-edge shortest-path problem for a Monge graph

    SciTech Connect (OSTI)

    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.

  9. 2007 CBECS Large Hospital Building FAQs: 2003-2007 Comparison Graphs

    Gasoline and Diesel Fuel Update (EIA)

    FAQs: 2003-2007 Comparison Graphs Main Report | Methodology | FAQ | List of Tables CBECS 2007 - Release date: August 17, 2012 Jump to: Figure 1 | Figure 2 | Figure 3 | Figure 4 | Figure 5 Figure 1 Number of Large Hospital Buildings and 95% Confidence Intervals by Census Region, 2003 and 2007 Figure 2 Total Floorspace and 95% Confidence Intervals in Large Hospital Buildings by Census Region, 2003 and 2007 Figure 3 Major Fuel Intensity and 95% Confidence Intervals by Census Region, 2003 and 2007

  10. Compact Graph Representations and Parallel Connectivity Algorithms for Massive Dynamic Network Analysis

    SciTech Connect (OSTI)

    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.

  11. Scaling Graph Community Detection on the Tilera Many-core Architecture

    SciTech Connect (OSTI)

    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.

  12. A three-colour graph as acomplete topological invariant for gradient-like diffeomorphisms of surfaces

    SciTech Connect (OSTI)

    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.

  13. Pattern analysis of directed graphs using DEDICOM: an application to Enron email.

    SciTech Connect (OSTI)

    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.

  14. Contig Graph Tool: A graphical interface for Contig Physical Map assembly

    SciTech Connect (OSTI)

    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.

  15. A Selectivity based approach to Continuous Pattern Detection in Streaming Graphs

    SciTech Connect (OSTI)

    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.

  16. Computing quality scores and uncertainty for approximate pattern matching in geospatial semantic graphs

    SciTech Connect (OSTI)

    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.

  17. Computing quality scores and uncertainty for approximate pattern matching in geospatial semantic graphs

    DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)

    Stracuzzi, David John; Brost, Randolph C.; Phillips, Cynthia A.; Robinson, David G.; Wilson, Alyson G.; Woodbridge, Diane M. -K.

    2015-09-26

    Geospatial semantic graphs provide a robust foundation for representing and analyzing remote sensor data. In particular, they support a variety of pattern search operations that capture the spatial and temporal relationships among the objects and events in the data. However, in the presence of large data corpora, even a carefully constructed search query may return a large number of unintended matches. This work considers the problem of calculating a quality score for each match to the query, given that the underlying data are uncertain. As a result, we present a preliminary evaluation of three methods for determining both match qualitymore » scores and associated uncertainty bounds, illustrated in the context of an example based on overhead imagery data.« less

  18. Carbon Dioxide, Hydrographic, and Chemical Data Obtained During the R/V Maurice Ewing Cruise in the Atlantic Ocean (WOCE Section A17, 4 January - 21 March 1994)

    SciTech Connect (OSTI)

    Kozyr, Alex

    2005-06-30

    This documentation discusses the procedures and methods used to measure total carbon dioxide (TCO2), total alkalinity (TALK), and pH at hydrographic stations during the R/V Maurice Ewing cruise in the South Atlantic Ocean on the A17 WOCE section. Conducted as part of the World Ocean Circulation Experiment (WOCE), this cruise was also a part of the French WOCE program consisting of three expeditions (CITHER 1, 2, and 3) focused on the South Atlantic Ocean. The A17 section was occupied during the CITHER 2 expedition, which began in Montevideo, Uruguay, on January 4, 1994 and finished in Cayenne, French Guyana, on March 21, 1994. During this period the ship stopped in Salvador de Bahia and Recife, Brazil, to take on supplies and exchange personnel. Upon completion of the cruise the ship transited to Fort de France, Martinique. Instructions for accessing the data are provided.

  19. Total carbon dioxide, hydrographic, and nitrate measurements in the Southwest Pacific during Austral autumn, 1990: Results from NOAA/PMEL CGC-90 cruise

    SciTech Connect (OSTI)

    Lamb, M.F.; Feely, R.A.; Moore, L.

    1995-10-01

    In support of the National Oceanic and Atmospheric Administration (NOAA) Climate and Global Change (C&GC) Program, Pacific Marine Environmental Laboratory (PMEL) scientists have been measuring the growing burden of greenhouse gases in the thermocline waters of the Pacific Ocean since 1980. Collection of data at a series of hydrographic stations along longitude 170{degrees} W during austral autumn of 1990 was designed to enhance understanding of the increase in the column burden of chlorofluorocarbons and carbon dioxide in the thermocline waters since the last expedition in 1984. This document presents the procedures and methods used to obtain total carbon dioxide (TCO{sub 2}), hydrographic, and nitrate data during the NOAA/PMEL research vessel (R/V) Malcolm Baldrige CGC-90 Cruise. Data were collected along two legs; sampling for Leg 1 began along 170{degrees} W from 15{degrees} S to 60{degrees} S, then angled northwest toward New Zealand across the Western Boundary Current. Leg 2 included a reoccupation of some stations between 30{degrees} S and 15{degrees} S on 170{degrees} W and measurements from 15{degrees} S to 5{degrees} N along 170{degrees} W. The following data report summarizes the TCO{sub 2}, salinity, temperature, and nitrate measurements from 63 stations. The TCO, concentration in seawater samples was measured using a coulometric/extraction system (Models 5011 and 5030, respectively) originated by Ken Johnson. The NOAA/PMEL R/V Malcolm Baldrige CGC-90 Cruise data set is available without charge as a numeric data package (NDP) from the Carbon Dioxide Information Analysis Center. The NDP consists of two oceanographic data files, two FORTRAN 77 data retrieval routine files, a {open_quotes}readme{close_quotes} file, and this printed documentation, which describes the contents and format of all files as well as the procedures and methods used to obtain the data.

  20. Streaming data analytics via message passing with application to graph algorithms

    SciTech Connect (OSTI)

    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.

  1. Streaming data analytics via message passing with application to graph algorithms

    DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)

    Plimpton, Steven J.; Shead, Tim

    2014-05-06

    The need to process streaming data, which arrives continuously at high-volume in real-time, arises in a variety of contexts including data produced by experiments, collections of environmental or network sensors, and running simulations. Streaming data can also be formulated as queries or transactions which operate on a large dynamic data store, e.g. a distributed database. We describe a lightweight, portable framework named PHISH which enables a set of independent processes to compute on a stream of data in a distributed-memory parallel manner. Datums are routed between processes in patterns defined by the application. PHISH can run on top of eithermore » message-passing via MPI or sockets via ZMQ. The former means streaming computations can be run on any parallel machine which supports MPI; the latter allows them to run on a heterogeneous, geographically dispersed network of machines. We illustrate how PHISH can support streaming MapReduce operations, and describe streaming versions of three algorithms for large, sparse graph analytics: triangle enumeration, subgraph isomorphism matching, and connected component finding. Lastly, we also provide benchmark timings for MPI versus socket performance of several kernel operations useful in streaming algorithms.« less

  2. PylotDB - A Database Management, Graphing, and Analysis Tool Written in Python

    Energy Science and Technology Software Center (OSTI)

    2012-01-04

    PylotDB, written completely in Python, provides a user interface (UI) with which to interact with, analyze, graph data from, and manage open source databases such as MySQL. The UI mitigates the user having to know in-depth knowledge of the database application programming interface (API). PylotDB allows the user to generate various kinds of plots from user-selected data; generate statistical information on text as well as numerical fields; backup and restore databases; compare database tables acrossmore » different databases as well as across different servers; extract information from any field to create new fields; generate, edit, and delete databases, tables, and fields; generate or read into a table CSV data; and similar operations. Since much of the database information is brought under control of the Python computer language, PylotDB is not intended for huge databases for which MySQL and Oracle, for example, are better suited. PylotDB is better suited for smaller databases that might be typically needed in a small research group situation. PylotDB can also be used as a learning tool for database applications in general.« less

  3. PyDecay/GraphPhys: A Unified Language and Storage System for Particle Decay Process Descriptions

    SciTech Connect (OSTI)

    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.

  4. PylotDB - A Database Management, Graphing, and Analysis Tool Written in Python

    SciTech Connect (OSTI)

    2012-01-04

    PylotDB, written completely in Python, provides a user interface (UI) with which to interact with, analyze, graph data from, and manage open source databases such as MySQL. The UI mitigates the user having to know in-depth knowledge of the database application programming interface (API). PylotDB allows the user to generate various kinds of plots from user-selected data; generate statistical information on text as well as numerical fields; backup and restore databases; compare database tables 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.

  5. A Reasoning And Hypothesis-Generation Framework Based On Scalable Graph Analytics

    SciTech Connect (OSTI)

    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.

  6. September 2004 Water Sampling

    Office of Legacy Management (LM)

    .........7 Water Sampling Field Activities Verification ... Groundwater Quality Data Static Water Level Data Time-Concentration Graphs ...

  7. September 2004 Water Sampling

    Office of Legacy Management (LM)

    .........5 Water Sampling Field Activities Verification ... Groundwater Quality Data Surface Water Quality Data Time-Concentration Graph ...

  8. September 2004 Water Sampling

    Office of Legacy Management (LM)

    .........5 Water Sampling Field Activities Verification ... Quality Data Equipment Blank Data Static Water Level Data Time-Concentration Graphs ...

  9. September 2004 Water Sampling

    Office of Legacy Management (LM)

    .........5 Water Sampling Field Activities Verification ... Groundwater Quality Data Static Water Level Data Time-Concentration Graphs ...

  10. September 2004 Water Sampling

    Office of Legacy Management (LM)

    .........3 Water Sampling Field Activities Verification ... Groundwater Quality Data Surface Water Quality Data Time-Concentration Graphs ...

  11. Oceanic CO{sub 2} measurements for the WOCE hydrographic survey in the Pacific Ocean, 1990--1991: Shore based analyses. Technical data report

    SciTech Connect (OSTI)

    Guenther, P.R.; Keeling, C.D.; Emanuele, G. III

    1991-12-31

    The Office of Health and Environmental Research, of the US Department of Energy (DOE), actively supports global survey investigations of carbon dioxide in the oceans. This large scale study is in conjunction with the hydrographic program of the World Ocean Circulation Experiment (WOCE/HP). On ocean cruises operated by WOCE/HP, carbon dioxide analysis groups, from various oceanographic institutions, perform shipboard chemical measurements of the inorganic carbon system in the ocean. Measurements of total dissolved inorganic carbon (DIC) are of central importance to this carbon survey. Shipboard measurements of DIC were made by employing a coulometric technique. The majority of coulometric measurements were made on an integrated automatic device, the Single Operator Multi-Parameter Metabolic Analyzer (SOMMA). In addition to DIC determinations, shipboard analytical groups measured at least one additional parameter of sea water carbon chemistry. This was done to more fully characterize the inorganic carbon system of the sea water sample. This thechnical data report presents DIC and ALK measurements performed in the SIO laboratory on replicate samples collected on the five expedition legs of the WOCE/HP cruises.

  12. 3D liver segmentation using multiple region appearances and graph cuts

    SciTech Connect (OSTI)

    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

  13. Graph-theoretic analysis of discrete-phase-space states for condition change detection and quantification of information

    DOE Patents [OSTI]

    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.

  14. 3D automatic anatomy segmentation based on iterative graph-cut-ASM

    SciTech Connect (OSTI)

    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

  15. Collaborative research on the Northeast Water Polynya: NEWP92 hydrographic data report. USCGC Polar Sea cruise, July 15--August 15, 1992

    SciTech Connect (OSTI)

    Wallace, D.W.R.; Behrens, W.J.; Hopkins, T.S.; Kinder, C.; Deming, J.; Smith, W.O.; Top, Z.; Walsh, I.D.

    1995-06-01

    The Northeast Water Polynya (NEW) off the northeast coast of Greenland was the focus of two cruises aboard the USCGC Polar Sea during the summers of 1992 and 1993. The cruises were supported by the National Science Foundation Arctic Systems Science (ARCSS) program and were part of the Arctic Ocean Science Board`s International Arctic Polynya Program. The Polar Sea cruises were designed as multidisciplinary studies to test hypotheses about the mechanisms of heat, water and carbon flow within and beyond the boundaries of the polynya. Preliminary results of the 1992 study have been described elsewhere. A collection of papers arising from the 1992 cruise have been published in a Special Section of the Journal of Geophysical Research. This data report presents the hydrographic and basic chemical observations made from CTD/Rosette casts during the 1992 cruise. The station positions cruise are plotted in Figure 1. Also included in the report are selected section plots and vertical profiles. A total of 130 CTD casts were made during the cruise, measuring pressure, temperature, conductivity, dissolved oxygen, fluorescence and light transmission. Discrete samples were collected in 10-liter, rosette-mounted, Niskin bottles and analyzed, from most casts, for: salinity, dissolved nutrients, dissolved oxygen, anthropogenic halocarbons (e.g., Freon gases), pigments, particulate organic carbon and nitrogen. Suspended particulate matter was analyzed at selected stations and these data were used to calibrate the CTD-transmissometer. Samples were collected from selected stations and depths for tritium and helium analyses, carbonate chemistry, as well as for measurements of bacterial abundance.

  16. On the Ramsey numbers for complete distance graphs with vertices in {l_brace}0,1{r_brace}{sup n}

    SciTech Connect (OSTI)

    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.

  17. Carbon dioxide, hydrographic, and chemical data obtained in the South Pacific Ocean (WOCE Sections P16A/P17A, P17E/P19S, and P19C, R/V Knorr, October 1992--April 1993)

    SciTech Connect (OSTI)

    Rubin, S.; Goddard, J.G.; Chipman, D.W.; Takahashi, Taro; Sutherland, S.C.; Reid, J.L.; Swift, J.H.; Talley, L.D.

    1998-06-01

    This data documentation discusses the procedures and methods used to measure total carbon dioxide concentration (TCO{sub 2}) and partial pressure of CO{sub 2} (pCO{sub 2}) in discrete water samples collected during three expeditions of the Research Vessel (R/V) Knorr in the South Pacific Ocean. Conducted as part of the World Ocean Circulation Experiment (WOCE), the first cruise (WOCE Section P16A/P17A) began in Papeete, Tahiti, French Polynesia, on October 6, 1992, and returned to Papeete on November 25, 1992. The second cruise (WOCE Section P17E/P19S) began in Papeete on December 4, 1992, and finished in Punta Arenas, Chile, on January 22, 1993. The third expedition (WOCE Section P19C) started in Punta Arenas, on February 22 and finished in Panama City, Panama, on April 13, 1993. During the three expeditions, 422 hydrographic stations were occupied. Hydrographic and chemical measurements made along WOCE Sections P16A/P17A, P17E/P19S, and P19C included pressure, temperature, salinity, and oxygen [measured by conductivity, temperature, and depth (CTD) sensor], as well as discrete measurements of salinity, oxygen, phosphate, nitrate, nitrite, silicate, chlorofluorocarbons (CFC-11, CFC-12), TCO{sub 2}, and pCO{sub 2} measured at 4 and 20 C. In addition, potential temperatures were calculated from the measured variables.

  18. Spin polarisation of tt¯γγ production at NLO+PS with GoSam interfaced to MadGraph5_aMC@NLO

    DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)

    van Deurzen, Hans; Frederix, Rikkert; Hirschi, Valentin; Luisoni, Gionata; Mastrolia, Pierpaolo; Ossola, Giovanni

    2016-04-22

    Here, we present an interface between the multipurpose Monte Carlo tool MadGraph5_aMC@NLO and the automated amplitude generator GoSam. As a first application of this novel framework, we compute the NLO corrections to pp→ tt¯H and pp→ tt¯γγ matched to a parton shower. In the phenomenological analyses of these processes, we focus our attention on observables which are sensitive to the polarisation of the top quarks.

  19. Data reports: Charts & graphs

    SciTech Connect (OSTI)

    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.

  20. Role Discovery in Graphs

    Energy Science and Technology Software Center (OSTI)

    2014-08-14

    RolX takes the features from Re-FeX or any other feature matrix as input and outputs role assignments (clusters). The output of RolX is a csv file containing the node-role memberships and a csv file containing the role-feature definitions.

  1. Carbon dioxide, hydrographic, and chemical data obtained in the Central South Pacific Ocean (WOCE sections P17S and P16S) during the tunes-2-expedition of the R/V Thomas Washington, July--August 1991

    SciTech Connect (OSTI)

    1991-12-31

    This data documentation discusses the procedures and methods used to measure total carbon dioxide (TCO{sub 2}), discrete partial pressure of TCO{sub 2} (pCO{sub 2}), and total alkalinity (TALK), during the Research Vessel (R/V) Thomas Washington TUNES Leg 2 Expedition in the central South Pacific Ocean. Conducted as part of the World Ocean Circulation Experiment (WOCE), the cruise began in Papeete, Tahiti, French Polynesia, on July 16, 1991, and returned to Papeete on August 25, 1991. WOCE Meridional Sections P17S along 135{degrees} W and P16S along 150{degrees} W were completed during the 40-day expedition. A total of 97 hydrographic stations were occupied. Hydrographic and chemical measurements made along WOCE Sections P17S and P16S included pressure, temperature, salinity, and oxygen measured by conductivity, temperature and depth sensor; bottle salinity; oxygen; phosphate; nitrate; nitrite; silicate; CFC-12; CFC- 11; TCO{sub 2}; TALK; and pCO{sub 2} measured at 20{degrees}C. The TCO{sub 2} concentration in 1000 seawater samples was determined with a coulometric analysis system, the pCO{sub 2} in 940 water samples was determined with an equilibrator/gas chromatograph system, while the TALK concentration in 139 samples was determined on shore at the laboratory of C. Goyet of Woods Hole Oceanographic Institution with an alkalinity titration system. In addition, 156 coulometric measurements for the Certified Reference Material (Batch {number_sign}6) were made and yielded a mean value of 2303.2 {plus_minus} 1.5 {mu}mol/kg. This mean value agrees within a standard deviation of the 2304.6 {plus_minus} 1.6 {mu}mol/kg (N=9) value determined with the manometer of C. D. Keeling at Scripps Institution of Oceanography (SIO). Replicate samples from 11 Niskin bottles at 4 stations were also collected for later shore-based reference analyses of TCO{sub 2} and TALK by vacuum extraction and manometry in the laboratory of C. D. Keeling of SIO.

  2. Carbon Dioxide, Hydrographic, and Chemical Data Obtained During the R/V Ronald H. Brown Repeat Hydrography Cruise in the Atlantic Ocean: CLIVAR CO2 Section A16S_2005 (11 January - 24 February, 2005)

    SciTech Connect (OSTI)

    Kozyr, Alex

    2006-08-30

    This report presents methods, and analytical and quality control procedures for salinity, oxygen, nutrient, inorganic carbon, organic carbon, chlorofluorocarbon (CFC), and bomb 14C system parameters performed during the A16S_2005 cruise, which took place from January 11 to February 24, 2005, aboard research vessel (R/V) Ronald H. Brown under the auspices of the National Oceanic and Atmospheric Administration (NOAA). The R/V Ronald H. Brown departed Punta Arenas, Chile, on January 11, 2005, and ended its cruise in Fortaleza, Brazil, on February 24, 2005. The research conducted was one of a series of repeat hydrography sections jointly funded by NOAA and the National Science Foundation as part of the CLIVAR/CO2/repeat hydrography/tracer program. Samples were taken from 36 depths at 121 stations. The data presented in this report include the analyses of water samples for total inorganic carbon (TCO2), fugacity of CO2 (fCO2), total alkalinity (TALK), pH, dissolved organic carbon (DOC), CFC, 14C, hydrographic, and other chemical measurements. The R/V Ronald H. Brown A16S_2005 data set is available free of charge as a numeric data package (NDP) from the Carbon Dioxide Information Analysis Center (CDIAC). The NDP consists of the oceanographic data files and this printed documentation, which describes the procedures and methods used to obtain the data.

  3. Carbon Dioxide, Hydrographic, and Chemical Data Obtained During the R/V Meteor Cruise 28/1 in the South Atlantic Ocean (WOCE Section A8, March 29 - May 12, 1994)

    SciTech Connect (OSTI)

    Kozyr, A.

    2002-05-09

    This data documentation discusses the procedures and methods used to measure total carbon dioxide (TCO{sub 2}) and the fugacity of CO{sub 2} (fCO{sub 2}) at hydrographic stations during the R/V Meteor oceanographic cruise 28/1 in the South Atlantic Ocean (Section A8). Conducted as part of the World Ocean Circulation Experiment (WOCE), the cruise began in Recife, Brazil, on March 29, 1994, and ended after 35 days at sea in Walvis Bay, Namibia, on May 12, 1994. Instructions for accessing the data are provided. TCO{sub 2} was measured using two single-operator multiparameter metabolic analyzers (SOMMA) coupled to a coulometer for extracting and detecting CO{sub 2} from seawater samples. The overall precision and accuracy of the analyses was {+-}1.17 {micro}mol/kg. For the second carbonate system parameter, the fCO{sub 2} was measured in discrete samples by equilibrating a known volume of liquid phase (seawater) with a known volume of a gas phase containing a known mixture of CO{sub 2} in gaseous nitrogen (N{sub 2}). After equilibration, the gas phase CO{sub 2} concentration was determined by flame ionization detection following the catalytic conversion of CO{sub 2} to methane (CH{sub 4}). The precision of these measurements was less than or equal to 1.0%. The R/V Meteor Cruise 28/1 data set is available free of charge as a numeric data package (NDP) from the Carbon Dioxide Information Analysis Center. The NDP consists of two oceanographic data files, two FORTRAN 90 data retrieval routine files, a readme file, and this printed documentation that describes the contents and format of all files as well as the procedures and methods used to obtain the data.

  4. Carbon Dioxide, Hydrographic, and Chemical Data Obtained During the R/V Meteor Cruise 22/5 in the South Atlantic Ocean (WOCE Section A10, December 1992-January 1993)

    SciTech Connect (OSTI)

    Kozyr, A.

    1998-12-01

    This data documentation discusses the procedures and methods used to measure total carbon dioxide (TCO{sub 2}) and total alkalinity (TALK) at hydrographic stations, as well as the underway partial pressure of CO{sub 2} (pCO{sub 2}) during the R/V Meteor Cruise 22/5 in the South Atlantic Ocean (Section A10). Conducted as part of the World Ocean Circulation Experiment (WOCE), the cruise began in Rio de Janeiro on December 27, 1992, and ended after 36 days at sea in Capetown, South Africa, on January 31, 1993. Measurements made along WOCE Section A10 included pressure, temperature, and salinity [measured by conductivity, temperature, and depth (CTD) sensor], bottle salinity, bottle oxygen, phosphate, nitrate, nitrite, silicate, chlorofluorocarbons (CFC-1 1 , CFC-12), TCO{sub 2}, TALK, and underway pCO{sub 2}. The TCO{sub 2} was measured by using two Single-Operator Multiparameter Metabolic Analyzers (SOMMAs) for extracting CO{sub 2} from seawater samples that were coupled to a coulometer for detection of the extracted CO{sub 2}. The overall precision and accuracy of the analyses was {+-} 1.9 {micro}mol/kg. Samples collected for TALK were measured by potentiometric titration; precision was {+-}2.0 {micro}mol/kg. Underway pCO{sub 2} was measured by infrared photometry with a precision of {+-} 2.0 {micro}atm. The work aboard the R/V Meteor was supported by the U.S. Department of Energy under contract DE-AC02-76CHOO016, and the Bundesministerium fir Forschung und Technologies through grants 03F0545A and MPG 099/1.

  5. Efficient Graph Analytics for Genomics

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Design » Types of Homes » Efficient Earth-Sheltered Homes Efficient Earth-Sheltered Homes This house in Tempe, Arizona, uses earth-sheltered construction methods to help decrease cooling costs. | Photo by Pamm McFadden This house in Tempe, Arizona, uses earth-sheltered construction methods to help decrease cooling costs. | Photo by Pamm McFadden If you are looking for a home with energy-efficient features that will provide a comfortable, tranquil, weather-resistant dwelling, an earth-sheltered

  6. 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...

  7. Data report - charts and graphs

    SciTech Connect (OSTI)

    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.

  8. Carbon Dioxide, Hydrographic, and Chemical Data Obtained During the R/V Knorr Repeat Hydrography Cruise in the Atlantic Ocean: CLIVAR CO2 Sections A20_2003 (22 September-20 October 2003) and A22_2003 (23 October-13 November, 2003)

    SciTech Connect (OSTI)

    Kozyr, Alex

    2008-09-30

    This report presents methods, and analytical and quality control procedures for salinity, oxygen, nutrient, inorganic carbon, organic carbon, chlorofluorocarbon (CFC), and bomb carbon-14 system parameters performed during the A20_2003 and A22_2003 cruises, which took place between September 22 and November 13, 2003, aboard research vessel (R/V) Knorr under the auspices of the National Oceanic and Atmospheric Administration (NOAA) and National Science Foundation (NSF). The R/V Knorr departed Woods Hole, Massachusetts, on September 22 for the Repeat Section A20, and ended this line in Port of Spain, Trinidad, on October 20. The Repeat Section A22 started on October 23 in Port of Spain, Trinidad, and finished on November 13, 2003, in Woods Hole, Massachusetts. The research conducted was one of a series of repeat hydrography sections jointly funded by NOAA and NSF as part of the Climate Variability Program (CLIVAR)/CO2/repeat hydrography/tracer program. Samples were taken from 36 depths at 88 stations on section A20 and 82 stations on section A22. The data presented in this report include the analyses of water samples for total inorganic carbon (TCO2), total alkalinity (TALK), dissolved organic carbon (DOC), CFC, carbon-14, hydrographic, and other chemical measurements.

  9. Carbon Dioxide, Hydrographic, and Chemical Data Obtained During the Nine R/V Korr Cruises Comprising the Indian Ocean CO2Survey (WOCE Sections I8SI9S, I9N, I8NI5E, I3, I5WI4, I7N, I1, I10, and I2; December 1, 1994-January 19, 1996)

    SciTech Connect (OSTI)

    Kozyr, A.V.

    2003-09-15

    This document describes the procedures and methods used to measure total carbon dioxide (TCO{sub 2}) and total alkalinity (TALK) at hydrographic stations taken during the R/V Knorr Indian Ocean cruises (Sections I8SI9S, I9N, I8NI5E, I3, I5WI4, I7N, I1, I10, and I2) in 1994-1996. The measurements were conducted as part of the World Ocean Circulation Experiment (WOCE). The expedition began in Fremantle, Australia, on December 1, 1994, and ended in Mombasa, Kenya, on January 22, 1996. During the nine cruises, 12 WOCE sections were occupied. Total carbon dioxide was extracted from water samples and measured using single-operator multiparameter metabolic analyzers (SOMMAs) coupled to coulometers. The overall precision and accuracy of the analyses was {+-} 1.20 {micro}mol/kg. The second carbonate system parameter, TALK, was determined by potentiometric titration. The precision of the measurements determined from 962 analyses of certified reference material was {+-} 4.2 {micro}mol/kg (REFERENCE). This work was supported by grants from the National Science Foundation, the U. S. Department of Energy, and the National Oceanographic and Atmospheric Administration. The R/V Knorr Indian Ocean data set is available as a numeric data package (NDP) from the Carbon Dioxide Information Analysis Center (CDIAC). The NDP consists of 18 oceanographic data files, two FORTRAN 77 data retrieval routine files, a readme file, and this printed documentation, which describes the contents and format of all files as well as the procedures and methods used to obtain the data. Instructions for accessing the data are provided.

  10. Graphs from Volume 1 Book 2

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

     We want USDOE to vitrify all Low Activity Waste (second LAW plant) -- Alternative 2B. 2  For all glass options, most of the impacts come from secondary waste. Secondary waste causes significant groundwater impacts and needs robust mitigation to get below levels of concern. Peak Groundwater Results from Various Waste Forms and Secondary Waste Glass Glass and Bulk Vit Glass and Cast Stone Glass and Steam Reforming Benchmark iodine-129 (pCi/L) 1.4 1.7 10.7 10.7 1 technetium-99 (pCi/L) 471

  11. BASSET: Scalable Gateway Finder in Large Graphs

    SciTech Connect (OSTI)

    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.

  12. 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. ...

  13. A graph-based method for improving GSAT

    SciTech Connect (OSTI)

    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.

  14. 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, ...

  15. Aggregate

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Aggregate Aggregate Daily Graph: Weekly Graph: Monthly Graph: Yearly Graph: 2 Year Graph: Last edited: 2016-04-29 11:34:30

  16. Microsoft Word - CY11_draft_appxa.doc

    Office of Legacy Management (LM)

    Station WOMPOC A.3 Groundwater Level Data for CY 2011 A.4 Groundwater Hydrographs A.4.1 Hydrographs for Manually Collected Water Level Data A.4.2 Hydrographs for Automated Water ...

  17. 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 ...

  18. Effective software design and development for the new graph architecture HPC machines.

    SciTech Connect (OSTI)

    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.

  19. Automatic Transformation of MPI Programs to Asynchronous, Graph-Driven Form

    SciTech Connect (OSTI)

    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.

  20. GRAPHMC

    Energy Science and Technology Software Center (OSTI)

    002928WKSTN00 graphMC: A package for testing the independence of graphs www.sandia.gov/~apinar/graphMC/graphMC

  1. Running Jobs by Group

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Running Jobs by Group Running Jobs by Group Daily Graph: Weekly Graph: Monthly Graph: Yearly Graph: 2 Year Graph: Last edited: 2011-04-05 13:59:48...

  2. Pending Jobs by Group

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Pending Jobs by Group Pending Jobs by Group Daily Graph: Weekly Graph: Monthly Graph: Yearly Graph: 2 Year Graph: Last edited: 2011-04-05 14:00:14...

  3. Pending Jobs by Group

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Pending Jobs by Group Pending Jobs by Group Daily Graph: Weekly Graph: Monthly Graph: Yearly Graph: 2 Year Graph: Last edited: 2016-04-29 11:35:04

  4. Running Jobs by Group

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Running Jobs by Group Running Jobs by Group Daily Graph: Weekly Graph: Monthly Graph: Yearly Graph: 2 Year Graph: Last edited: 2016-04-29 11:34:43

  5. Weighted Running Jobs by Group

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Weighted Running Jobs by Group Weighted Running Jobs by Group Daily Graph: Weekly Graph: Monthly Graph: Yearly Graph: 2 Year Graph: Last edited: 2016-04-29 11:34:54

  6. Charts and graphs: NUKEM Uranium price ange data; NUKEM Uranium historical price graph; U.S. DOE & euratom average contract prices for natural uranium; NUKEM SWU historical price graph; NUKEM SWU spot/secondary price range; U.S. DOE separative work prices data

    SciTech Connect (OSTI)

    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.

  7. Microsoft Word - appxa.docx

    Office of Legacy Management (LM)

    Station WOMPOC A.3 Groundwater Level Data for CY 2012 A.4 Groundwater Hydrographs A.4.1 Hydrographs for Manually Collected Water Level Data Appendix A, Page 1 Appendix A: ...

  8. file://C:\\Users\\deborahs\\AppData\\Local\\Temp\\tmp2581.tmp.htm

    National Nuclear Security Administration (NNSA)

    stateengineerbasinboundaries Shapefile Tags Hydrographic Basin Boundaries Summary The ... reviewed for agreement with State Engineer Basin Designation Orders and ...

  9. AEA Hydroelectric Program

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    * Technical assistance, regional planning and project management * Provide synergy between ... hydrograph from stream gauging data collection EIA Generation data from ...

  10. GBS 1.0

    Energy Science and Technology Software Center (OSTI)

    2010-09-30

    The Umbra gbs (Graph-Based Search) library provides implementations of graph-based search/planning algorithms that can be applied to legacy graph data structures. Unlike some other graph algorithm libraries, this one does not require your graph class to inherit from a specific base class. Implementations of Dijkstra's Algorithm and A-Star search are included and can be used with graphs that are lazily-constructed.

  11. Comparing Clouds Using Cloud Radar

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    How To Graph Goals: The goal of this activity is to learn how to make a coordinate or line graph. Materials: Graph paper Pencil Introduction: Graphs and charts are great because they communicate information visually. Graphs are often used by scientists, but also by newspapers, magazines and businesses around the world. Sometimes, complicated information is difficult to understand and needs an illustration. Other times, a graph or chart helps impress people by getting the point across quickly and

  12. NSF final project report planning and implementation of the U.S. Joint Global Ocean Flux Study (U.S. JGOFS)

    SciTech Connect (OSTI)

    Livingston, Hugh D.

    1996-07-01

    Conducted planning and implementation of ocean carbon dioxide hydrographic surveys ocean process studies, time-series studies of Bermuda and Hawaii, and sponsored scientific workshops for those activities.

  13. Trends in Commercial Buildings--Total Primary Energy Detail

    U.S. Energy Information Administration (EIA) Indexed Site

    Energy Consumption and Graph Total Primary Energy Consumption Graph Detail and Data Table 1979 to 1992 primary consumption trend with 95% confidence ranges 1979 to 1992 primary...

  14. Trends in Commercial Buildings--Total Site Energy Detail

    U.S. Energy Information Administration (EIA) Indexed Site

    Energy Consumption and Graph Total Site Energy Consumption Graph Detail and Data Table 1979 to 1992 site consumption trend with 95% confidence ranges 1979 to 1992 site...

  15. Concurrent Transfers Last 8 Days

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    graphs are autoscaling - check the scales on each axis before you compare graphs. Concurrency (Both Systems) Concurrency (Both Systems) Concurrency (Both Systems) Concurrency...

  16. Bandwidth and Transfer Activity

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    average. Graphs for the last 8 days. Historical yearly peak days. Daily Storage Concurrency Transfer Activity This graph shows the number of transfers to the storage systems...

  17. E

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    principally in parallel algorithm development, sparse iterative methods and applied graph theory. There he co- authored Chaco, a graph partitioning and sequencing toolkit widely...

  18. 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...

  19. Joaquin Correa JoaquinCorrea@lbl.gov NERSC Data...

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Climate, Cosmology, Kbase, Materials, BioImaging, Your science Statistics, Machine Learning R, python, MLBase Image Processing MATLAB OMERO, Fiji Graph Analytics GraphX...

  20. Working Gas in Underground Storage Figure

    Annual Energy Outlook [U.S. Energy Information Administration (EIA)]

    Gas in Underground Storage Figure Working Gas in Underground Storage Compared with 5-Year Range Graph...

  1. January 2015 Groundwater Sampling at the Gnome-Coach, New Mexico, Site

    SciTech Connect (OSTI)

    Findlay, Rick; Kautsky, Mark

    2015-12-01

    Annual sampling was conducted January 27, 2015, to monitor groundwater for potential radionuclide contamination at the Gnome-Coach site in New Mexico. Samples were collected from wells USGS-1, USGS-4, and USGS-8 during this monitoring event. The sampling was performed as specified in the Sampling and Analysis Plan for US. Department of Energy Office of Legacy Management Sites (LMS/PRO/S04351, continually updated). A duplicate sample was collected from well USGS-8 and water levels were measured in all the monitoring wells onsite. Refer to the sample location map for well locations. Samples were analyzed by GEL Laboratories in Charleston, South Carolina. Samples were analyzed for gamma-emitting radionuclides by high-resolution gamma spectrometry, strontium-90, and tritium. The sample from well USGS-1 was analyzed for tritium using the enrichment method to achieve a lower minimum detectable concentration (MDC). Radionuclide contaminants were detected in wells USGS-4 and USGS-8. The detection of radionuclides in these wells was expected because the U.S. Geological Survey conducted a tracer test between these wells in 1963 using the dissolved radionuclides tritium, strontium-90, and cesium-137 as tracers. Radionuclide time-concentration graphs are included in this report for these wells. Analytical data obtained from this and past sampling events are also available in electronic format on the U.S. Department of Energy Office of Legacy Management Geospatial Environmental Mapping System website at http://gems.lm.doe.gov/#site=GNO.

  2. Path Finder

    Energy Science and Technology Software Center (OSTI)

    2014-01-07

    PathFinder is a graph search program, traversing a directed cyclic graph to find pathways between labeled nodes. Searches for paths through ordered sequences of labels are termed signatures. Determining the presence of signatures within one or more graphs is the primary function of Path Finder. Path Finder can work in either batch mode or interactively with an analyst. Results are limited to Path Finder whether or not a given signature is present in the graph(s).

  3. Tables and graphs of electron-interaction cross sections from 10 eV to 100 GeV derived from the LLNL Evaluated Electron Data Library (EEDL), Z = 1--100

    SciTech Connect (OSTI)

    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.

  4. Carbon dioxide, hydrographic, and chemical data obtained during the R/Vs Roger Revelle and Thomas Thompson repeat hydrography cruises in the Pacific Ocean: CLIVAR CO2 sections P16S-2005 (9 January - 19 February, 2005) and P16N-2006 (13 February - 30 March, 2006)

    SciTech Connect (OSTI)

    Kozyr, Alex; Feely, R. A.; Sabine, C. L.; Millero, F. J.; Langdon, C.; Dickson, A. G.; Fine, R. A.; Bullister, J. L.; Hansell, D. A.; Carlson, C. A.; Sloyan, B. M.; McNichol, A. P.; Key, R. M.; Byrne, R. H.; Wanninkhof, R.

    2009-05-01

    This report presents methods, and analytical and quality control procedures for salinity, oxygen, nutrients, total carbon dioxide (TCO2), total alkalinity (TALK), pH, discrete CO2 partial pressure (pCO2), dissolved organic carbon (DOC), chlorofluorocarbons (CFCs), radiocarbon, δ13C, and underway carbon measurements performed during the P16S-2005 (9 January - 19 February 2005) and P16N-2006 (13 February - 30 March, 2006) cruises in the Pacific Ocean. The research vessel (R/V) Roger Revelle departed Papeete, Tahiti, on January 9, 2005 for the Repeat Section P16S, nominally along 150°W, ending in Wellington, New Zealand, on February 19. During this cruise, samples were taken from 36 depths at 111 CTD stations between 16°S and 71°S. The Repeat Section P16N, nominally along 152°W, consisted of two legs. Leg 1 started on February 13, 2006 in Papeete, Tahiti, and finished on March 3, in Honolulu, Hawaii. The R/V Thomas G. Thompson departed Honolulu for Leg 2 on March 10, 2006 and arrived in Kodiak, Alaska, on March 30. During the P16N cruises, samples were taken from 34 or 36 depths at 84 stations between 17°S and 56.28°N. The research conducted on these cruises was part of a series of repeat hydrography sections jointly funded by the National Oceanic and Atmospheric Administration (NOAA) and the National Science Foundation (NSF) as part of the Climate Variability Program (CLIVAR)/CO2 Repeat Hydrography Program. The P16S and P16N data sets are available free of charge as a numeric data package (NDP) from the Carbon Dioxide Information Analysis Center (CDIAC). The NDP consists of the oceanographic data files and this printed documentation, which describes the procedures and methods used to obtain the data.

  5. CX-011841: Categorical Exclusion Determination

    Broader source: Energy.gov [DOE]

    Hydrographics, NCR KCP14-02 CX(s) Applied: B1.31 Date: 02/12/2014 Location(s): Missouri Offices(s): Kansas City Site Office

  6. APPENDICES

    Office of Legacy Management (LM)

    Upstream of A-1 Bypass A.2 Precipitation Data A.2.1 PG58: Gaging Station GS01 A.2.2 ... Flats Met Tower A.3 Groundwater Level Data for CY 2014 A.4 Groundwater Hydrographs ...

  7. Microsoft Word - appxa.doc

    Office of Legacy Management (LM)

    Upstream of A-1 Bypass A.2 Precipitation Data A.2.1 PG58: Gaging Station GS01 A.2.2 ... Repeater Node RTU2 A.3 Groundwater Level Data for CY 2009 A.4 Groundwater Hydrographs ...

  8. APPENDICES

    Office of Legacy Management (LM)

    Upstream of A-1 Bypass A.2 Precipitation Data A.2.1 PG58: Gaging Station GS01 A.2.2 ... Station WOMPOC A.3 Groundwater Level Data for CY 2013 A.4 Groundwater Hydrographs ...

  9. This Week In Petroleum Distillate Section

    Annual Energy Outlook [U.S. Energy Information Administration (EIA)]

    On-highway diesel fuel prices (dollars per gallon) U.S. Regional U.S. on-highway diesel fuel prices graph Regional on-highway diesel fuel prices graph On-highway diesel fuel prices ...

  10. Alternative Fuels Data Center: Maps and Data

    Alternative Fuels and Advanced Vehicles Data Center [Office of Energy Efficiency and Renewable Energy (EERE)]

    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

  11. NetworkX

    Energy Science and Technology Software Center (OSTI)

    2004-05-17

    NetworkX (abbreviated NX in the software and documentation) is a package for studying network structure using graph theory.

  12. Sandia National Laboratories is a multi-program laboratory managed...

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    time windows) Some problems have strong compute requirements Eigensolves, LSA, LMSA (lots of matrix multiplies) Graph algorithms Some problems have...

  13. EAGLE

    Energy Science and Technology Software Center (OSTI)

    003500WKSTN00 EAGLE: 'EAGLE'Is an' Algorithmic Graph Library for Exploration https://github.com/ssrangan

  14. Quality assurance and data management

    SciTech Connect (OSTI)

    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.

  15. The equation of state of nuclear matter

    SciTech Connect (OSTI)

    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.

  16. Controlled Hydrogen Fleet and Infrastructure Demonstration and Validation Project

    SciTech Connect (OSTI)

    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.

  17. Controlled Hydrogen Fleet and Infrastructure Demonstration and Validation Project: Fall 2008

    SciTech Connect (OSTI)

    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.

  18. Controlled Hydrogen Fleet and Infrastructure Demonstration and Validation Project: Spring 2010; Composite Data Products, Final Version March 29, 2010

    SciTech Connect (OSTI)

    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.

  19. INDDGO

    Energy Science and Technology Software Center (OSTI)

    002861MLTPL00 Integrated Network Decompositions and Dynamic Programming for Graph Optimization (INDDGO) http://github.org/bdsullivan/INDDGO

  20. HAVOQGT

    Energy Science and Technology Software Center (OSTI)

    002909WKSTN00 Highly Asynchronous VisitOr Queue Graph Toolkit https://bitbucket.org/PerMA/havoggt/

  1. MEGA

    Energy Science and Technology Software Center (OSTI)

    002444SUPER00 Modular Environment for Graph Research and Analysis with a Persistent http://software.sandia.gov/trac/megraphs

  2. Controlled Hydrogen Fleet and Infrastructure Demonstration and Validation Project: Fall 2009; Composite Data Products, Final Version September 11, 2009

    SciTech Connect (OSTI)

    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.

  3. On the exact evaluation of spin networks

    SciTech Connect (OSTI)

    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.

  4. Aggregate Transfers Historical Yearly Peak

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Transfers Historical Yearly Peak Aggregate Transfers Historical Yearly Peak These plots show the yearly peak days from 2000 to the present. BE CAREFUL because the graphs are autoscaling - check the scales on each axis before you compare graphs. Note that the graph for current year shows the data for the year-to-date peak. Daily Aggregate Bandwidth Daily Aggregate Bandwidth Daily Aggregate Bandwidth Daily Aggregate Bandwidth Daily Aggregate Bandwidth Daily Aggregate Bandwidth Daily Aggregate

  5. Transfer Activity Last 8 Days

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Activity Last 8 Days Transfer Activity Last 8 Days These graphs show the transfer activity statistics for the past eight days with the most recent day shown first. BE CAREFUL because the graphs are autoscaling - check the scales on each axis before you compare graphs. Transfers started/in progress (Both Systems) Transfers started/in progress (Both Systems) Transfers started/in progress (Both Systems) Transfers started/in progress (Both Systems) Transfers started/in progress (Both Systems)

  6. Concurrent Transfers Historical Yearly Peak

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Transfers Historical Yearly Peak Concurrent Transfers Historical Yearly Peak These plots show the yearly peak days from 2000 to present. BE CAREFUL because the graphs are autoscaling - check the scales on each axis before you compare graphs. Note that the graph for current year shows the data for the year-to-date peak. Daily Storage Concurrency Daily Storage Concurrency Daily Storage Concurrency Daily Storage Concurrency Daily Storage Concurrency Daily Storage Concurrency Daily Storage

  7. ARM - Facility News Article

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    in a database, rather than the current inefficient method of sifting through emails. ... Those custom fields can be searched, reported on, graphed, and referenced in emails. ...

  8. Alternative Fuels Data Center: Maps and Data

    Alternative Fuels and Advanced Vehicles Data Center [Office of Energy Efficiency and Renewable Energy (EERE)]

    50 results AFVs and HEVs - Generated_thumb20160830-4976-kgi9ks AFV Acquisitions by Regulated Fleets (by Fleet Type) Generated_thumb20160830-4976-kgi9ks Trend of S&FP AFV acquisitions by fleet type from 1992-2014 Last update August 2016 View Graph Graph Download Data Generated_thumb20160830-26541-m8i0e0 AFV Acquisitions by Regulated Fleets (by Fuel Type) Generated_thumb20160830-26541-m8i0e0 Trend of S&FP AFV acquisitions by fuel type from 1992-2015 Last update August 2016 View Graph Graph

  9. Alternative Fuels Data Center: Maps and Data

    Alternative Fuels and Advanced Vehicles Data Center [Office of Energy Efficiency and Renewable Energy (EERE)]

    biodiesel Go Generated_thumb20150619-21703-z84lxx U.S. Biodiesel Production, Exports, and Consumption Generated_thumb20150619-21703-z84lxx Trend of U.S. biodiesel production, exports, and consumption from 2001-2014 Last update June 2015 View Graph Graph Download Data Generated_thumb20160208-27007-1cmv4kl Biomass-Based Diesel RFS2 Mandates and RINs Generated Generated_thumb20160208-27007-1cmv4kl Last update February 2016 View Graph Graph Download Data Generated_thumb20130810-31804-s6una1 U.S.

  10. Alternative Fuels Data Center: Maps and Data

    Alternative Fuels and Advanced Vehicles Data Center [Office of Energy Efficiency and Renewable Energy (EERE)]

    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

  11. Alternative Fuels Data Center: Maps and Data

    Alternative Fuels and Advanced Vehicles Data Center [Office of Energy Efficiency and Renewable Energy (EERE)]

    ethanol Go Generated_thumb20160329-22390-r7vnqb Global Ethanol Production Generated_thumb20160329-22390-r7vnqb Quantity of ethanol produced by country from 2007-2014 Last update March 2016 View Graph Graph Download Data Generated_thumb20151113-26762-c7ez9d U.S. Production, Consumption, and Trade of Ethanol Generated_thumb20151113-26762-c7ez9d Trend of total ethanol fuel production and consumption from 1981-2014 Last update July 2015 View Graph Graph Download Data

  12. Alternative Fuels Data Center: Maps and Data

    Alternative Fuels and Advanced Vehicles Data Center [Office of Energy Efficiency and Renewable Energy (EERE)]

    hydrogen Go Hydrogen-stations Hydrogen Fueling Station Locations by State Hydrogen-stations View Map Graph Hydrogen_li_by_state Hydrogen Incentives and Laws, by State Hydrogen_li_by_state View Map Graph Generated_thumb20160914-24960-10gn0o4 Annual Percent Growth of Vehicles in Operation Generated_thumb20160914-24960-10gn0o4 Last update September 2016 View Graph Graph Download Data Generated_thumb20150820-7666-dq3brm Greenhouse Gas Emissions by Fuel Type Generated_thumb20150820-7666-dq3brm

  13. Alternative Fuels Data Center: Maps and Data

    Alternative Fuels and Advanced Vehicles Data Center [Office of Energy Efficiency and Renewable Energy (EERE)]

    propane Go Propane_li_by_state Propane Incentives and Laws, by State Propane_li_by_state View Map Graph Propane-stations Propane Fueling Station Locations by State Propane-stations View Map Graph 10561_expenditures_by_sector_20130906 Per Capita Energy Expenditures by Sector 10561_expenditures_by_sector_20130906 Trend of transportation and residential energy expenditures from 1970-2010 Last update September 2013 View Graph Graph Download Data Generated_thumb20140826-27944-1rznsji Alternative Fuel

  14. Energy Analysis

    K-12 Energy Lesson Plans and Activities Web site (EERE)

    Students use graphs of historical data and research historical and societal events to determine and analyze energy trends in the United States over the past 50 years.

  15. Quarks Pair Up in Protons (and Neutrons) | Jefferson Lab

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Quarks Pair Up in Protons (and Neutrons) Graph of up quarkdown quark contributions Researchers have published intriguing new observations for how the different kinds of quarks ...

  16. Reduce Air Infiltration in Furnaces; Industrial Technologies...

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    they rise, creating a differential pressure between the top and the bottom of the furnace. ... can be calculated by using the equations and graphs given in Industrial Furnaces ...

  17. 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...

  18. Identifying Renewable Energy Projects for Federal Agencies |...

    Broader source: Energy.gov (indexed) [DOE]

    U.S. Department of Energy's Federal Energy Management Program (FEMP) is researching ... As an example, FEMP created a series of maps and graphs that illustrate federal facility ...

  19. 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). ...

  20. 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 ...

  1. Fact #558: February 16, 2009 Transit Vehicle Age and Cost | Department...

    Broader source: Energy.gov (indexed) [DOE]

    Average Age of Transit Vehicles, 2007 Graph showing the average age of transit vehicles (bus, trolleybus, vanpool, demand response, light rail, commuter rail, commuter rail ...

  2. Concurrent Transfers Historical Yearly Peak

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    the graph for current year shows the data for the year-to-date peak. Daily Storage Concurrency Daily Storage Concurrency Daily Storage Concurrency Daily Storage Concurrency Daily...

  3. Slide 1

    Broader source: Energy.gov (indexed) [DOE]

    The NE Infrastructure DB haswill have the ability to: 3. Feed directly into a visualization system for custom maps * Future implementation of GIS technology * Graph network system ...

  4. 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. ...

  5. DISPLAYING AND INTERPRETING FLUID INCLUSION STRATIGRAPHY ANALYSES...

    Open Energy Info (EERE)

    DISPLAYING AND INTERPRETING FLUID INCLUSION STRATIGRAPHY ANALYSES ON MUDLOG GRAPHS Jump to: navigation, search OpenEI Reference LibraryAdd to library Conference Proceedings:...

  6. Evaluation Project 4492

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Organization area to allow the movement and radio-graphing of component for evaluation to determine the proper Project Execution Plan for dismantlement. Evaluation Project...

  7. RussiaLANLV3-web.indd

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Static and dynamic radio- graphs of experimental system compared to pre- dicted (synthetic) radiograph from simulation codes. Modified for the Web several changes to the technical ...

  8. Natural Gas Weekly Update, Printer-Friendly Version

    Gasoline and Diesel Fuel Update (EIA)

    Market Trends). NYMEX Natural Gas Futures Near-Month Contract Settlement Price, West Texas Intermediate Crude Oil Spot Price, and Henry Hub Natural Gas Spot Price Graph More...

  9. The Apache Software Foundation Announces Apache® TinkerPop(tm) as a

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Top-Level Project Apache® TinkerPop(tm) The Apache Software Foundation Announces Apache® TinkerPop(tm) as a Top-Level Project Apache TinkerPop is a graph computing framework that provides developers with the tools required to build modern graph applications in any application domain and at any scale. May 23, 2016 Apache tinkerpop logo Apache TinkerPop is a graph computing framework that provides developers with the tools required to build modern graph applications in any application domain

  10. PSMSUMRY.CHP:Corel VENTURA

    Gasoline and Diesel Fuel Update (EIA)

    inventory" on the stock graphs are the lower end of the demonstrated operational inventory range updated for known and definable changes in the petroleum delivery system....

  11. 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 ...

  12. 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, ...

  13. Polyamine-Tethered Porous Polymer Networks for Carbon Dioxide...

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    and the largest selectivity (see graph) of any porous material reported to date. It also had outstanding physicochemical stability and could be regenerated under mild conditions...

  14. SEP Special Projects Report: Future Outlook and Appendix

    SciTech Connect (OSTI)

    None

    2000-07-01

    The Sharing Success appendix provides the future outlook for SEP as well as charts and graphs for grants and Special Projects.

  15. This Week In Petroleum Gasoline Section

    Gasoline and Diesel Fuel Update (EIA)

    Regular gasoline retail prices (dollars per gallon) U.S. Average Conventional Reformulated U.S. retail regular gasoline prices graph Retail average regular gasoline prices graph Retail conventional regular gasoline prices graph Retail reformulated regular gasoline prices graph Retail average regular gasoline prices (dollars per gallon) more price data › Year ago Most recent 08/31/15 08/29/16 08/22/16 08/15/16 08/08/16 08/01/16 07/25/16 07/18/16 U.S. 2.510 2.237 2.193 2.149 2.150 2.159 2.182

  16. 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. ...

  17. Commissioning

    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 ...

  18. Sandia Energy - Sandia Magnetized Fusion Technique Produces Significan...

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    an automobile's cylinders firing. Sandia researchers Paul Schmit, left, and Patrick Knapp discuss equations and graphs that describe aspects of Sandia's Z Machine. (Photo by...

  19. 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). ...

  20. 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).

  1. 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...

  2. 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...

  3. Tank Closure and Waste Management Environmental Impact Statement...

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    justice, waste management, and spent nuclear fuel. 3.1 APPROACH TO DEFINING THE AFFECTED ... machinery, photographs and graphs, publications, control room panels, and models. ...

  4. EIA Energy Information Administration

    U.S. Energy Information Administration (EIA) Indexed Site

    and the East last week as the four cities monitored for this report recorded gradually rising temperatures (see Temperature graph). Despite the expected slack demand...

  5. Solar Background Document 5 | Department of Energy

    Office of Environmental Management (EM)

    5 Solar Background Document 5 Graph illustrating Chinese Development Bank financing to Chinese solar companies. Solar Background Document 5.pdf (29.35 KB) More Documents & ...

  6. Solar Background Document 4 | Department of Energy

    Office of Environmental Management (EM)

    4 Solar Background Document 4 Graph illustrating global distribution of solar manufacturing market share from 1990 to 2010. Solar Background Document 4.pdf (57.32 KB) More ...

  7. Microsoft PowerPoint - FeoSalishan_10

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    or non-planar Non-planar Difficult to partition Spanning trees Connected components Graph isomorphism Static or dynamic Weighted or unweighted Concurrent inserts and...

  8. Integrating multiple data sources for malware classification

    DOE Patents [OSTI]

    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.

  9. Working Gas in Underground Storage Figure

    Annual Energy Outlook [U.S. Energy Information Administration (EIA)]

    Working Gas in Underground Storage Figure Working Gas in Underground Storage Figure Working Gas in Underground Storage Compared with 5-Year Range Graph....

  10. Fact #705: December 12, 2011 Fuel Consumption Standards for Combinatio...

    Broader source: Energy.gov (indexed) [DOE]

    published a final rule setting fuel consumption standards for heavy trucks in September ... Combination Tractor Fuel Consumption Standards, Model Years (MY) 2014-2017 Graph showing ...

  11. 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 ...

  12. Fact #857 January 26, 2015 Number of Partner Workplaces Offering...

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    Number of Partner Workplaces with Electric Vehicle Charging Stations, November 2014 Graph showing number of partner workplaces with electric vehicle charging stations from the ...

  13. Exploring network structure, dynamics, and function using networkx

    SciTech Connect (OSTI)

    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.

  14. PYLOTDB

    Energy Science and Technology Software Center (OSTI)

    002728IBMPC02 PylotDB - A Database Management, Graphing, and Analysis Tool Written in Python http://pmatwiki.sandia.gov/pmatwiki/how-to-use-pylot

  15. 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 ...

  16. Survey Statisticians

    Gasoline and Diesel Fuel Update (EIA)

    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 * ...

  17. Oceanic Trace Gases Numeric Data Packages from the Carbon Dioxide Information Analysis Center (CDIAC)

    DOE Data Explorer [Office of Scientific and Technical Information (OSTI)]

    CDIAC products include numeric data packages, publications, trend data, atlases, models, etc. and can be searched for by subject area, keywords, authors, product numbers, time periods, collection sites, spatial references, etc. Most data sets or packages, many with numerous data files, are free to download from CDIAC's ftp area. CDIAC lists the following numeric data packages under the broad heading of Oceanic Trace Gases: Carbon Dioxide, Hydrographic, and Chemical Data Obtained during the R/V Ronald H. Brown Repeat Hydrography Cruise in the Atlantic Ocean: CLIVAR CO2 Section A16S_2005 ( 01/11/05 - 022405) Determination of Carbon Dioxide, Hydrographic, and Chemical Parameters during the R/V Nathaniel B. Palmer Cruise in the Southern Indian Ocean (WOCE Section S04I, 050396 - 070496) Inorganic Carbon, Nutrient, and Oxygen Data from the R/V Ronald H. Brown Repeat Hydrography Cruise in the Atlantic Ocean: CLIVAR CO2 Section A16N_2003a (060403 081103) Carbon Dioxide, Hydrographic, and Chemical Data Obtained During the R/V Maurice Ewing Cruise in the Atlantic Ocean (WOCE Section A17, 010494 - 032194) Global Ocean Data Analysis Project GLODAP: Results and Data Carbon Dioxide, Hydrographic, and Chemical Data Obtained During the R/V Knorr Cruises in the North Atlantic Ocean on WOCE Sections AR24 (1102 120596) and A24, A20, and A22 (053097 090397) Carbon Dioxide, Hydrographic and Chemical Data Obtained During the Nine R/V Knorr Cruises Comprising the Indian Ocean CO2 Survey (WOCE Sections I8SI9S, I9N, I8NI5E, I3, I5WI4, I7N, I1, I10, and I2; 120 194 012296) Carbon Dioxide, Hydrographic, and Chemical Data Obtained During the R/V Meteor Cruise 28/1 in the South Atlantic Ocean (WOCE Section A8, 032994 - 051294) Carbon Dioxide, Hydrographic, and Chemical Data Obtained During the R/V Knorr Cruise 138-3, -4, and -5 in the South Pacific Ocean (WOCE Sections P6E, P6C, and P6W, 050292 - 073092) Global Distribution of Total Inorganic Carbon and Total

  18. CX-100281 Categorical Exclusion Determination

    Broader source: Energy.gov [DOE]

    Maximizing the habitat restoration potential of controlled releases at hydropower dams; Understanding impacts of hydrograph form on sediment transport - HRF - University of Idaho Award Number: DE-EE0002668/EE0006506 CX(s) Applied: A9 Water Power Program Date: 06/04/2015 Location(s): ID Office(s): Golden Field Office

  19. Multidimensional spectral load balancing

    DOE Patents [OSTI]

    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.

  20. OriginalPrototypes

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Original Prototypes (Status of detectors June, 1998) Ionization Chamber with one cell instrumented Ring 2-3 Silicon Detector Prototype CsI with dimensions approximately of Ring 2-3 Prototype CsI with PMT on Ring 2-3 prototype holder Silicon detectors also installed More Pictures: Recent data from NIMROD: Data Graph 1 Data Graph 2

  1. Statistically significant relational data mining :

    SciTech Connect (OSTI)

    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.

  2. Scalable Association Rule Mining with Predicates on Semantic Representations of Data

    SciTech Connect (OSTI)

    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.

  3. A representation for efficient temporal reasoning

    SciTech Connect (OSTI)

    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.

  4. Title

    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,...

  5. nem_slice ver. 3.34

    Energy Science and Technology Software Center (OSTI)

    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.

  6. Scenario driven data modelling: a method for integrating diverse sources of data and data streams

    SciTech Connect (OSTI)

    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.

  7. Enhancing Community Detection By Affinity-based Edge Weighting Scheme

    SciTech Connect (OSTI)

    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.

  8. Conceptual Framework to Enable Early Warning of Relevant Phenomena (Emerging Phenomena and Big Data)

    SciTech Connect (OSTI)

    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.

  9. Predicting and Detecting Emerging Cyberattack Patterns Using StreamWorks

    SciTech Connect (OSTI)

    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.

  10. Large-Scale Continuous Subgraph Queries on Streams

    SciTech Connect (OSTI)

    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.

  11. Alternative Fuels Data Center: Maps and Data

    Alternative Fuels and Advanced Vehicles Data Center [Office of Energy Efficiency and Renewable Energy (EERE)]

    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

  12. National Rotor Testbed Targets Future Wind Plant Research Needs |

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    Department of Energy Rotor Testbed Targets Future Wind Plant Research Needs National Rotor Testbed Targets Future Wind Plant Research Needs May 18, 2015 - 4:12pm Addthis Two illustrated graphs. The graph on the top shows a single line repeating in four quadrants, the bottom graph shows all colors The U.S. Department of Energy's (DOE's) Atmosphere to Electrons (A2e) initiative has identified the evolution of wakes in turbulent inflow as a key physical process affecting power production and

  13. Code System for Data Plotting and Curve Fitting.

    Energy Science and Technology Software Center (OSTI)

    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

  14. Transfer Activity Historical Yearly Peak

    Broader source: All U.S. Department of Energy (DOE) Office 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

  15. FEASTPACK v. 1.0

    Energy Science and Technology Software Center (OSTI)

    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.

  16. Bandwidth Historical Peak Days

    Broader source: All U.S. Department of Energy (DOE) Office 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

  17. Bandwidth and Transfer Activity

    Broader source: All U.S. Department of Energy (DOE) Office 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

  18. Multicomponent Geothermometers | Open Energy Information

    Open Energy Info (EERE)

    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...

  19. 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...

  20. 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 ...

  1. 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...

  2. 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...

  3. 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...

  4. Microsoft Word - 2012 Abstract Book FINAL.docx

    Broader source: All U.S. Department of Energy (DOE) Office 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. ...

  5. EIA Energy Information Administration

    U.S. 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...

  6. Solar Background Document 6 | Department of Energy

    Energy Savers [EERE]

    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 & ...

  7. Fact #778: May 6, 2013 Vehicles per Thousand Persons Rising Quickly...

    Broader source: Energy.gov (indexed) [DOE]

    of vehicles per thousand persons in China grew by nearly 200% from 2005 to 2011, ... Vehicles per Thousand Persons in China and India, 2005 - 2011 Graph showing the number of ...

  8. 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...

  9. Schlumberger soundings, audio-magnetotelluric soundings and telluric...

    Open Energy Info (EERE)

    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...

  10. Combinatorial Algorithms to Enable Computational Science and Engineering: The CSCAPES Institute

    SciTech Connect (OSTI)

    Pothen, Alex

    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 hyeprgraph 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.

  11. Passive solar heating analysis

    SciTech Connect (OSTI)

    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.

  12. SEDS | OpenEI Community

    Open Energy Info (EERE)

    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...

  13. Gapminder | OpenEI Community

    Open Energy Info (EERE)

    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...

  14. 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....

  15. 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...

  16. 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,...

  17. Energy Perspectives: Trends and Milestones

    Reports and Publications (EIA)

    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.

  18. This Week In Petroleum Printer-Friendly Version

    Broader source: All U.S. Department of Energy (DOE) Office 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...

  19. Project planning workshop 6-GeV synchrotron light source: Volume 2

    SciTech Connect (OSTI)

    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)

  20. 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 ...

  1. CoverSheet

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    ... Figure 1: Photo- graph of a laser sintered 3D-printed tensile specimen. Specimen is 2 cm ... specimens sheds light on material damage Three-dimensional printed materials offer ...

  2. The PANTHER User Experience

    SciTech Connect (OSTI)

    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.

  3. ARPES Provides Direct Evidence of Spin-Wave Coupling

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    shows up with high intensity, extending beyond 0.1 eV below the Fermi energy, EF. A graph of the dispersion (E vs. k||) of the surface state exhibits a weak "kink" in the...

  4. U.S. Energy Information Administration (EIA)

    Annual Energy Outlook [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...

  5. Poster Guidelines - Cyclotron Institute REU Program

    Broader source: All U.S. Department of Energy (DOE) Office 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...

  6. 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 ...

  7. Sac and Fox Tribe of the Mississippi in Iowa

    Office of Environmental Management (EM)

    hours data - from midnight to 6:00 AM * Run NRG Symphonie software daily. * Read Data and view wind speed graphs * Load the 24 hour file to site database. 2 Email Files Every Day ...

  8. 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,...

  9. Press Room - Press Releases - U.S. Energy Information Administration...

    Annual Energy Outlook [U.S. Energy Information Administration (EIA)]

    ... Figure 2 Graph Renewables meet much of the growth in electricity demand. Rising long-term natural gas prices, the high capital costs of newcoal and nuclear generation capacity, ...

  10. Reduce Radiation Losses from Heating Equipment; Industrial Technologie...

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    line of sight, and the rate of heat transfer increases with the fourth power of the ... These graphs give results that are within 5% of the results of using detailed view- factor ...

  11. Data Tools, Apps, and Maps - Intro - U.S. Energy Information...

    Gasoline and Diesel Fuel Update (EIA)

    Status of U.S. Nuclear Outages Maps and information on U.S. nuclear power plants and outages. Browse data Total Energy Data Browser Access and graph data on U.S. energy supply, ...

  12. West Virginia Smart Grid Implementation Plan (WV SGIP) Project

    Broader source: All U.S. Department of Energy (DOE) Office 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. ...

  13. January 2011 Monthly News Roundup | U.S. DOE Office of Science...

    Office of Science (SC) Website

    ... 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 ...

  14. Natural Gas Weekly Update, Printer-Friendly Version

    Gasoline and Diesel Fuel Update (EIA)

    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,...

  15. Natural Gas Weekly Update

    Annual Energy Outlook [U.S. Energy Information Administration (EIA)]

    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,...

  16. 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 ...

  17. 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:...

  18. 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 ...

  19. Petroleum Supply Monthly September 2004

    Annual Energy Outlook [U.S. Energy Information Administration (EIA)]

    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...

  20. Nevada Bureau of Mines and Geology Open-File Report 12-3: Data...

    Open Energy Info (EERE)

    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...

  1. About Cost Breakdown Structure for Wave Energy Device Created...

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    ... Sensitvity Graphs Mean Wave Height (m) Wave Power Density (kWm) LCoE - centskWh 1.5 10.390967780483027 160.88775532305041 1.7 14.407267528007228 126.74104631588072 1.9 ...

  2. 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...

  3. This Week In Petroleum Crude Oil Section

    Broader source: All U.S. Department of Energy (DOE) Office 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 ...

  4. Microsoft PowerPoint - 0709-NERSC-XT+ToolsTutorial.ppt

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Environment Director Cray Inc. ldr@cray.com September 18-20, 2007 Luiz DeRose (ldr@cray.com) Cray Inc. Slide 56 Cray Apprentice 2 Call graph profile Communication statistics ...

  5. System Advisor Model (SAM) | Open Energy Information

    Open Energy Info (EERE)

    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...

  6. This Week In Petroleum Printer-Friendly Version

    Broader source: All U.S. Department of Energy (DOE) Office 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...

  7. Atlantic Coastal Experiment VI: R/V KNORR cruise, 23 August--11 September 1980, data report

    SciTech Connect (OSTI)

    Behrens, W.; von Bock, K.

    1983-01-01

    An investigation of the influence of estuaries on the ecosystem of the Mid-Atlantic Bight was undertaken. Data were collected from excursions into the Hudson, Delaware and Chesapeake estuaries, three across-shelf and one along-shelf transects, and two time series stations. In all, 139 stations were occupied and 164 XBT soundings were taken. In addition to standard hydrographic measurements, nutrient , chlorophyll, particulate carbon and nitrogen, 14C, 15N, DNA, particle size, FTD, phytoplankton and zooplankton analyses were made.

  8. Numerical Simulation of Groundwater Withdrawal at the Nevada Test Site

    SciTech Connect (OSTI)

    Carroll, Rosemary; Giroux, Brian; Pohll, Greg; Hershey, Ronald; Russell, Charles; Howcroft, William

    2004-01-28

    Alternative uses of the Nevada Test Site (NTS) may require large amounts of water to construct and/or operate. The only abundant source of water at the NTS is groundwater. This report describes preliminary modeling to quantify the amount of groundwater available for development from three hydrographic areas at the NTS. Modeling was conducted with a three-dimensional transient numerical groundwater flow model.

  9. An Analysis of Wind Power Development in the Town of Hull, MA_Appendix 4_Geophysical Survey Report

    SciTech Connect (OSTI)

    Adams, Christopher

    2013-06-30

    CR Environmental, Inc. (CR) was contracted by GZA GeoEnvironmental, Inc. (GZA) to perform hydrographic and geophysical surveys of an approximately 3.35 square mile area off the eastern shore of Hull, Massachusetts. Survey components included: Single-beam bathymetry; 100-kHz and 500-kHz side scan sonar; Magnetometry; and Low to mid-frequency sub-bottom profiling.

  10. MOSS2D V1

    Energy Science and Technology Software Center (OSTI)

    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.

  11. Aggregate Transfers Last 8 Days

    Broader source: All U.S. Department of Energy (DOE) Office 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: 2011-04-04 10:44:03

  12. Isorropia Partitioning and Load Balancing Package

    Energy Science and Technology Software Center (OSTI)

    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.

  13. Joaquin Correa JoaquinCorrea@lbl.gov NERSC Data and Analytics Services

    Broader source: All U.S. Department of Energy (DOE) Office 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),

  14. Concurrent Transfers Last 8 Days

    Broader source: All U.S. Department of Energy (DOE) Office 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

  15. RAG-3D: A search tool for RNA 3D substructures

    DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)

    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

  16. RAG-3D: A search tool for RNA 3D substructures

    SciTech Connect (OSTI)

    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.

  17. ThreatView

    Energy Science and Technology Software Center (OSTI)

    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

  18. An In-Depth Analysis of the Chung-Lu Model

    SciTech Connect (OSTI)

    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.

  19. Incremental k-core decomposition: Algorithms and evaluation

    DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)

    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

  20. Alternative Fuels Data Center: Maps and Data

    Alternative Fuels and Advanced Vehicles Data Center [Office of Energy Efficiency and Renewable Energy (EERE)]

    natural-gas Go Generated_thumb20150717-8942-1al8gcg Consumption of Natural Gas in the U.S. Generated_thumb20150717-8942-1al8gcg U.S. natural gas consumption by different end uses in 2014 Last update July 2015 View Graph Graph Download Data L_i-ng Natural Gas Incentives and Laws, by State L_i-ng View Map Graph Generated_thumb20150717-9604-1y6czo1 U.S. Transit Buses by Fuel Type Generated_thumb20150717-9604-1y6czo1 Trend of buses powered by various fuels in the U.S. from 2007-2013 Last update July

  1. An exact, finite, gauge-invariant, non-perturbative approach to QCD renormalization

    SciTech Connect (OSTI)

    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.

  2. A numerical test of KPZ scaling; Potts models coupled to two-dimensional quantum gravity

    SciTech Connect (OSTI)

    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.

  3. Feynman rules for Coulomb gauge QCD

    SciTech Connect (OSTI)

    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.

  4. Orbit-product representation and correction of Gaussian belief propagation

    SciTech Connect (OSTI)

    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.

  5. Monte Carlo analysis of critical phenomenon of the Ising model on memory stabilizer structures

    SciTech Connect (OSTI)

    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.

  6. Network topology mapper

    DOE Patents [OSTI]

    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.

  7. Umbra Ver. 4.8

    Energy Science and Technology Software Center (OSTI)

    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

  8. Dynamic extension of the Simulation Problem Analysis Kernel (SPANK)

    SciTech Connect (OSTI)

    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.

  9. Geometric universality of currents in an open network of interacting particles

    SciTech Connect (OSTI)

    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.

  10. Groundwater Level Status Report for 2005 Los Alamos National Laboratory

    SciTech Connect (OSTI)

    S.P. Allen; R.J. Koch

    2006-05-15

    The status of groundwater level monitoring at Los Alamos National Laboratory (LANL) in 2005 is provided in this report. The Groundwater Level Monitoring Project was instituted in 2005 to provide a framework for the collection and processing of quality controlled groundwater level data. This report summarizes groundwater level data for 137 monitoring wells, including 41 regional aquifer wells, 22 intermediate wells, and 74 alluvial wells. Pressure transducers were installed in 118 monitoring wells for continuous monitoring of groundwater levels. Time-series hydrographs of groundwater level data are presented along with pertinent construction and location information for each well.

  11. Groundwater Level Status Report for Fiscal Year 2007 - Los Alamos National Laboratory

    SciTech Connect (OSTI)

    Shannon P. Allen, Richard J. Koch

    2008-03-17

    The status of groundwater level monitoring at Los Alamos National Laboratory in Fiscal Year 2007 is provided in this report. The Groundwater Level Monitoring Project was instituted in 2005 to provide a framework for the collection and processing of quality controlled groundwater level data. This report summarizes groundwater level data for 166 monitoring wells, including 45 regional aquifer wells, 25 intermediate wells, and 96 alluvial wells, and 11 water supply wells. Pressure transducers were installed in 133 monitoring wells for continuous monitoring of groundwater levels. Time-series hydrographs of groundwater level data are presented along with pertinent construction and location information for each well.

  12. Alternative Fuels Data Center: Maps and Data

    Alternative Fuels and Advanced Vehicles Data Center [Office of Energy Efficiency and Renewable Energy (EERE)]

    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

  13. Alternative Fuels Data Center: Maps and Data

    Alternative Fuels and Advanced Vehicles Data Center [Office of Energy Efficiency and Renewable Energy (EERE)]

    laws-incentives Go Generated_thumb20140130-31746-1vt8b52 Regulation Additions by Regulation Type Generated_thumb20140130-31746-1vt8b52 Trend of state enactments listed by regulation type from 2002-2013 Last update January 2014 View Graph Graph Download Data Generated_thumb20140128-29009-1lwk08e Incentive and Law Additions by Fuel/Technology Type Generated_thumb20140128-29009-1lwk08e Trend of state incentive and law enactments listed by the targeted technology or fuel type from 2002-2013 Last

  14. Alternative Fuels Data Center: Maps and Data

    Alternative Fuels and Advanced Vehicles Data Center [Office of Energy Efficiency and Renewable Energy (EERE)]

    system-efficiency Go Generated_thumb20140708-12454-1nsa79k U.S. Light-Duty Fuel Consumption and Vehicle Miles Traveled (VMT) Generated_thumb20140708-12454-1nsa79k Trend of per capita VMT and fuel use in U.S. light-duty vehicles from 1970-2012 Last update July 2014 View Graph Graph Download Data Generated_thumb20141209-960-hxf1gg Clean Cities Petroleum Savings by Fuel Economy and VMT Reductions Generated_thumb20141209-960-hxf1gg Trend of displacement by fuel economy improvement and VMT reduction

  15. SunShot Incubator Spurs Solar Industry Innovation | Department of Energy

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    Incubator 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

  16. Second SIAM conference on sparse matrices: Abstracts. Final technical report

    SciTech Connect (OSTI)

    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.

  17. Fact #647: November 1, 2010 Sales Shifting from Light Trucks to Cars |

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    Department of Energy 7: November 1, 2010 Sales Shifting from Light Trucks to Cars Fact #647: November 1, 2010 Sales Shifting from Light Trucks to Cars 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 the major import brands than the domestic brands. Share of Car Sales by Selected Manufacturer Graph showing share of car sales from 2005 to 2009

  18. Fact #648: November 8, 2010 Conventional and Alternative Fuel Prices |

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    Department of Energy 8: November 8, 2010 Conventional and Alternative Fuel Prices Fact #648: November 8, 2010 Conventional and Alternative Fuel Prices The Department of Energy's Clean Cities Alternative Fuel Price Report is a quarterly report that tracks prices for conventional and alternative fuels in the U.S. The graph below shows the nationwide average price for each fuel type in blue. The red bars in the graph show the nationwide average price on an energy-equivalent basis adjusted to a

  19. Analyst-Driven Knowledge Enhancement & Analysis version 1.0

    Energy Science and Technology Software Center (OSTI)

    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

  20. Region and edge-adaptive sampling and boundary completion for segmentation

    SciTech Connect (OSTI)

    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.

  1. Analyst-Driven Knowledge Enhancement & Analysis version 1.0

    SciTech Connect (OSTI)

    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.

  2. CartaBlanca

    Broader source: All U.S. Department of Energy (DOE) Office 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

  3. MOSSPATCH V1

    Energy Science and Technology Software Center (OSTI)

    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

  4. Visual Matrix Clustering of Social Networks

    SciTech Connect (OSTI)

    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.

  5. Analyst-Driven Knowledge Enhancement & Analysis version 1.0

    Energy Science and Technology Software Center (OSTI)

    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

  6. GreenArrow version 1.0

    Energy Science and Technology Software Center (OSTI)

    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

  7. PowerPoint Presentation

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    SDLE Center, VUV-Lab, Materials Science & Engineering Department, Roger H. French © 2012 http://sdle.case.edu 4/29/13, VuGraph 1 Module level power electronics: Taking commodity components and making them last. Reliability is linked with design, but is good design linked to reliability? Tim Peshek CWRU - SDLE SDLE Center, VUV-Lab, Materials Science & Engineering Department, Roger H. French © 2012 http://sdle.case.edu 4/29/13, VuGraph 2 Intro and scope of talk *Question: Can we make a

  8. Combinatorial theory of the semiclassical evaluation of transport moments II: Algorithmic approach for moment generating functions

    SciTech Connect (OSTI)

    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.

  9. A Novel Vertex Affinity for Community Detection

    SciTech Connect (OSTI)

    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.

  10. Graphical and tabular summaries of decay characteristics for once-through PWR, LMFBR, and FFTF fuel cycle materials. [Spent fuel, high-level waste fuel can scrap

    SciTech Connect (OSTI)

    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.

  11. Development of baseline water quality stormwater detention pond model for Chesapeake Bay catchments

    SciTech Connect (OSTI)

    Musico, W.J.; Yoon, J.

    1999-07-01

    An environmental impact assessment is required for every proposed development in the Commonwealth of Virginia to help identify areas of potential concerns. The purpose of the Chesapeake Bay Local Assistance Department (CBLAD), Guidance Calculation Procedures is to ensure that development of previously constructed areas do not further exacerbate current problems of stormwater-induced eutrophication and downstream flooding. The methodology is based on the post development conditions that will not generate greater peak flows and will result in a 10% overall reduction of total phosphorus. Currently, several well-known models can develop hydrographs and pollutographs that accurately model the real response of a given watershed to any given rainfall event. However, conventional method of achieving the desired peak flow reduction and pollutant removal is not a deterministic procedure, and is inherently a trail and error process. A method of quickly and accurately determining the required size of stormwater easements was developed to evaluate the effectiveness of alternative stormwater collection and treatment systems. In this method, predevelopment conditions were modeled first to estimate the peak flows and subsequent pollutants generation that can be used as a baseline for post development plan. Resulting stormwater easement estimates facilitate decision-making processes during the planning and development phase of a project. The design can be optimized for the minimum cost or the smallest-possible pond size required for peak flow reduction and detention time given the most basic data such as: inflow hydrograph and maximum allowable pond depth.

  12. PACIFICA (PACIFic ocean Interior CArbon) Database: A Data Synthesis Resource (NDP-92, ORNL/CDIAC-159)

    DOE Data Explorer [Office of Scientific and Technical Information (OSTI)]

    Suzuki, T.; Ishii, M.; Aoyama, M. R; Christian, J. R.; Enyo, K.; Kawano, T.; Key, R. M.; Kosugi, N.; Kozyr, A.; Miller, L. A.; Murata, A.; Nakano, T.; Ono, T.; Saino, T.; Sasaki, K.; Sasano, D; Takatani, Y.; Wakita, M.; Sabine, C.

    PACIFICA (PACIFic ocean Interior CArbon) was an international collaborative project for synthesis of data on ocean interior carbon and its related parameters in the Pacific Ocean. The North Pacific Marine Science Organization (PICES), Section on Carbon and Climate (S-CC) supported the project. Hydrographic/hydrochemical datasets have been merged from a total of 272 cruises, including those from cruises conducted between the late 1980s and 2000 but not included in GLODAP, as well as CLIVAR/CO2 Repeat Hydrography datasets from the 2000s. Adjustments were calculated to account for analytical offsets in dissolved inorganic carbon, total alkalinity, salinity, oxygen, and nutrients (nitrate and nitrite, phosphate, and silicic acid) for each cruise as a result of the secondary quality control procedure, based on crossover analysis using data from deep layers (Tanhua et al., 2010). A total of 59 adjusted datasets from Line P off the west coast of Canada were also merged. Finally, the authors have produced the adjusted PACIFICA database that consists of datasets from a total of 306 cruises that also includes 34 datasets from WOCE Hydrographic Program cruises in the Pacific Ocean conducted in the 1990s. The PACIFICA database is available free of charge as a numeric data package (NDP-92) from the Carbon Dioxide Information Analysis Center (CDIAC) and the primary PACIFICA data site at pacifica.pices.jp. The NDP consists of the original cruise data files, adjusted data product, and the documentation.

  13. GIS-BASED PREDICTION OF HURRICANE FLOOD INUNDATION

    SciTech Connect (OSTI)

    JUDI, DAVID; KALYANAPU, ALFRED; MCPHERSON, TIMOTHY; BERSCHEID, ALAN

    2007-01-17

    A simulation environment is being developed for the prediction and analysis of the inundation consequences for infrastructure systems from extreme flood events. This decision support architecture includes a GIS-based environment for model input development, simulation integration tools for meteorological, hydrologic, and infrastructure system models and damage assessment tools for infrastructure systems. The GIS-based environment processes digital elevation models (30-m from the USGS), land use/cover (30-m NLCD), stream networks from the National Hydrography Dataset (NHD) and soils data from the NRCS (STATSGO) to create stream network, subbasins, and cross-section shapefiles for drainage basins selected for analysis. Rainfall predictions are made by a numerical weather model and ingested in gridded format into the simulation environment. Runoff hydrographs are estimated using Green-Ampt infiltration excess runoff prediction and a 1D diffusive wave overland flow routing approach. The hydrographs are fed into the stream network and integrated in a dynamic wave routing module using the EPA's Storm Water Management Model (SWMM) to predict flood depth. The flood depths are then transformed into inundation maps and exported for damage assessment. Hydrologic/hydraulic results are presented for Tropical Storm Allison.

  14. What's Cooking

    K-12 Energy Lesson Plans and Activities Web site (EERE)

    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.

  15. Jpetra Kernel Package

    Energy Science and Technology Software Center (OSTI)

    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.

  16. Parallel Breadth-First Search on Distributed Memory Systems

    SciTech Connect (OSTI)

    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.

  17. SPOCS User Guide

    SciTech Connect (OSTI)

    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.

  18. The very particular structure of the very hard instances

    SciTech Connect (OSTI)

    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.

  19. U.S. LNG imports, exports to grow steadily through 2000

    SciTech Connect (OSTI)

    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.

  20. Vibrationally resolved transitions in ion-molecule and atom-molecular ion slow collisions

    DOE Data Explorer [Office of Scientific and Technical Information (OSTI)]

    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)

  1. STORM: A STatistical Object Representation Model

    SciTech Connect (OSTI)

    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.

  2. Title

    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...

  3. Human Factors Evaluation of Advanced Electric Power Grid Visualization Tools

    SciTech Connect (OSTI)

    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.

  4. Data report - June`s transactions

    SciTech Connect (OSTI)

    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.

  5. The Climate at Los Alamos; Are we measurement changes?

    SciTech Connect (OSTI)

    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.

  6. Methods Research

    Broader source: All U.S. Department of Energy (DOE) Office 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-07-18 16:52:3

  7. Chizu Task Mapping Tool

    Energy Science and Technology Software Center (OSTI)

    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.

  8. A=20F (1959AJ76)

    Broader source: All U.S. Department of Energy (DOE) Office 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 ...

  9. Control algorithms for autonomous robot navigation

    SciTech Connect (OSTI)

    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.

  10. Critical Configurations of Hard Disks on the Torus

    SciTech Connect (OSTI)

    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.

  11. DEMO: Action Recommendation for Cyber Resilience

    SciTech Connect (OSTI)

    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.

  12. Renewable Electricity Futures Study - Volume One

    DOE Data Explorer [Office of Scientific and Technical Information (OSTI)]

    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.

  13. A Novel Coarsening Method for Scalable and Efficient Mesh Generation

    SciTech Connect (OSTI)

    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

  14. SIGNATURES OF ILLICIT NUCLEAR PROCUREMENT NETWORKS: AN OVERVIEW OF PRELIMINARY APPROACHES AND RESULTS

    SciTech Connect (OSTI)

    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.

  15. Investigation of carbon dioxide in the central South Pacific Ocean (WOCE Sections P-16C and P-17C) during the TUNES/2 expedition of the R/V Thomas Washington, July--August, 1991. Final technical report

    SciTech Connect (OSTI)

    Takahashi, T.; Goddard, J.G.; Rubin, S.; Chipman, D.W.; Sutherland, S.C.

    1993-12-01

    This report summarizes the results of carbon dioxide and associated hydrographic measurements made during the oceanographic expedition, TUNES/2, aboard the R/V Thomas Washington in the central South Pacific Ocean. During the 40 day expedition, the total carbon dioxide concentration in 1000 seawater samples were determined using a coulometer system and the pCO(sub 2) in 940 seawater samples were determined using an equilibrator/gas chromatograph system. The alkalinity values in 900 water samples were computed using these measurements. In addition, 156 coulometric measurements were made for the Certified Reference Solutions (Batch No. 6) and yielded a mean value of 2303.2 +or- 1.5umol/kg. The chemical characteristics for the major water masses have been determined.

  16. Atlantic Coastal Experiment III: R/V KNORR cruise 68, 4-30 August 1977; FRV ALBATROSS IV cruise 77-07, 1-4, 16-31 August 1977. Data report, volume 1

    SciTech Connect (OSTI)

    Judkins, D.C.; von Bock, K.

    1983-03-01

    Data are reported from KNORR cruise 68, the major investigation of the third Atlantic Coastal Experiment (ACE), conducted during a period of pro-nounced water-column stratification. One hundred fifty-five stations, including 6 time-series sitings, were occupied within the shelf and shelf- break regimes of New York Bight. Measurements were made to assess water-mass characterization, nutrient cycling, carbon/nitrogen assimilation, bio-mass distribution and diel dynamics and benthic/water-column interfacial exchange. Data are also included from the cruise of ALBATROSS IV carried out contemporaneously with the KNORR investigations, in an area ranging from Nantucket Shoals to the upper reaches of the Gulf of Maine. 20 hydrographic stations were used to augment underway mapping in order to elucidate surface-layer chlorophyll and nutrient distributions occurring at an impor-tant boundary of the New York Bight.

  17. The Western Pond Turtle; Habitat and History, 1993-1994 Final Report.

    SciTech Connect (OSTI)

    Holland, Dan C.

    1994-08-01

    The western pond turtle is known from many areas of Oregon. The majority of sightings and other records occur in the major drainages of the Klamath, Rogue, Umpqua, Willamette and Columbia River systems. A brief overview is presented of the evolution of the Willamette-Puget Sound hydrographic basin. A synopsis is also presented of the natural history of the western pond turtle, as well as, the status of this turtle in the Willamette drainage basin. The reproductive ecology and molecular genetics of the western pond turtle are discussed. Aquatic movements and overwintering of the western pond turtle are evaluated. The effect of introduced turtle species on the status of the western pond turtle was investigated in a central California Pond. Experiments were performed to determine if this turtle could be translocated as a mitigation strategy.

  18. New numeric data packages from CDIAC

    SciTech Connect (OSTI)

    Hahn, C.J.; Warren, S.G.; London, J.

    1995-12-31

    This article describes 6 numerical data packages related to climate and greenhouse gas concentrations: Edited synoptic cloud reports from ships and land stations (1982-1991); Carbon dioxide concentrations in surface water and the atmosphere (1986-1989); Carbon-13 isotopic abundance and concentration of atmospheric methane for background air (1978-1989); Six and Three hourly meteorological observations from 223 USSR stations; Global, regional and national annual CO2 emission estimates from fossil-fuel burning, hydraulic-cement production, and gas flaring (1950-1992); continental-scale estimates of biotic carbon flux from land-cover change (1850-1980); Carbon dioxide, hydrographic and chemical data in the south Atlantic Ocean (February-March 1991).

  19. Study of biological processes on the US South Atlantic slope and rise. Phase 1: Benthic characterization. Volume 2. Final report

    SciTech Connect (OSTI)

    Blake, J.A.; Hecker, B.; Grassle, J.F.; Maciolek-Blake, N.; Brown, B.

    1985-06-01

    Concerns about the potential effects of oil and gas exploration on the U.S. Continental Slope and Rise led to the initiation of a deep-sea characterization study off North Carolina. The biological communities off North Carolina were poorly known, and prior to any drilling activities, a limited regional data base was required. The program included a seasonal characterization of biological and surficial geological properties at a limited number of slope and rise sites, with special emphasis on areas of high oil industry interest. A rich and highly diverse benthic infauna was discovered, with a large percentage of the 877 species being new to science. Annelids were the dominant taxa both in terms of density, numbers of species, and biomass. Foraminiferan tests comprised most of the sand fraction. Hydrographic data indicated some intrusion of colder water on the upper slope benthos from deeper water.

  20. Investigation of carbon dioxide in the South Atlantic and northern Weddell Sea areas (WOCE Sections A-12 and A-21) during the METEOR expedition 11/5, January--March 1990

    SciTech Connect (OSTI)

    Chipman, D.W.; Takahashi, Taro; Breger, D.; Sutherland, S.C.

    1991-12-01

    This report summarizes the results of investigation the oceanographic expedition aboard the F/S METEOR in South Atlantic Ocean including the Drake Passage, the northern Weddell Sea and the eastern South Atlantic during the austral summer of January through March 1990. The total CO{sub 2} concentration in about 1300 seawater samples and CO{sub 2} partial pressure (pCO{sub 2}) in about 870 seawater samples collected at 77 stations were determined aboard the ship using a coulometer and equilibrator/gas chromatograph system. The temperature, salinity, dissolved oxygen and nutrient salt data presented in this report were determined by other participants of the expedition including the members of the Oceanographic Data Facility of the Scripps Institution of Oceanography, Argentine Hydrographic Office and German institutions.

  1. Quantitative Cyber Risk Reduction Estimation Methodology for a Small Scada Control System

    SciTech Connect (OSTI)

    Miles A. McQueen; Wayne F. Boyer; Mark A. Flynn; George A. Beitel

    2006-01-01

    We propose a new methodology for obtaining a quick quantitative measurement of the risk reduction achieved when a control system is modified with the intent to improve cyber security defense against external attackers. The proposed methodology employs a directed graph called a compromise graph, where the nodes represent stages of a potential attack and the edges represent the expected time-to-compromise for differing attacker skill levels. Time-to-compromise is modeled as a function of known vulnerabilities and attacker skill level. The methodology was used to calculate risk reduction estimates for a specific SCADA system and for a specific set of control system security remedial actions. Despite an 86% reduction in the total number of vulnerabilities, the estimated time-to-compromise was increased only by about 3 to 30% depending on target and attacker skill level.

  2. Java XMGR

    SciTech Connect (OSTI)

    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.

  3. OPTICAL TRANSCRIBING OSCILLOSCOPE

    DOE Patents [OSTI]

    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.

  4. Managing complexity in simulations of land surface and near-surface processes

    DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)

    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

  5. Communication: Theoretical prediction of free-energy landscapes for complex self-assembly

    SciTech Connect (OSTI)

    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.

  6. MPI Runtime Error Detection with MUST: Advances in Deadlock Detection

    DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)

    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

  7. Computational, Integrative, and Comparative Methods for the Elucidation of Genetic Coexpression Networks

    DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)

    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

  8. Wind energy resource atlas. Volume 7. The south central region

    SciTech Connect (OSTI)

    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.

  9. Performance evaluation of a parallel sparse lattice Boltzmann solver

    SciTech Connect (OSTI)

    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.

  10. Vehicle Technologies’ Fact of the Week 2013

    SciTech Connect (OSTI)

    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.

  11. Vehicle Technologies' Fact of the Week 2011

    SciTech Connect (OSTI)

    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.

  12. Vehicle Technologies Fact of the Week 2013

    SciTech Connect (OSTI)

    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.

  13. Vehicle Technologies' Fact of the Week 2012

    SciTech Connect (OSTI)

    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.

  14. Network Intrusion Detection and Visualization using Aggregations in a Cyber Security Data Warehouse

    SciTech Connect (OSTI)

    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.

  15. Towards A Network-of-Networks Framework for Cyber Security

    SciTech Connect (OSTI)

    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.

  16. Translating Non-Trivial Algorithms from the Circuit Model to the Measurement

    SciTech Connect (OSTI)

    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).

  17. The Inhibiting Bisection Problem

    SciTech Connect (OSTI)

    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.

  18. Metal hydrides

    SciTech Connect (OSTI)

    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.

  19. Wind energy resource atlas. Volume 2. The North Central Region

    SciTech Connect (OSTI)

    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.

  20. Information processing systems, reasoning modules, and reasoning system design methods

    DOE Patents [OSTI]

    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.

  1. Information processing systems, reasoning modules, and reasoning system design methods

    DOE Patents [OSTI]

    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.

  2. The inhibiting bisection problem.

    SciTech Connect (OSTI)

    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.

  3. Method and tool for network vulnerability analysis

    DOE Patents [OSTI]

    Swiler, Laura Painton; Phillips, Cynthia A.

    2006-03-14

    A computer system analysis tool and method that will allow for qualitative and quantitative assessment of security attributes and vulnerabilities in systems including computer networks. The invention is based on generation of attack graphs wherein each node represents a possible attack state and each edge represents a change in state caused by a single action taken by an attacker or unwitting assistant. Edges are weighted using metrics such as attacker effort, likelihood of attack success, or time to succeed. Generation of an attack graph is accomplished by matching information about attack requirements (specified in "attack templates") to information about computer system configuration (contained in a configuration file that can be updated to reflect system changes occurring during the course of an attack) and assumed attacker capabilities (reflected in "attacker profiles"). High risk attack paths, which correspond to those considered suited to application of attack countermeasures given limited resources for applying countermeasures, are identified by finding "epsilon optimal paths."

  4. Generalized constructive tree weights

    SciTech Connect (OSTI)

    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.

  5. Wind energy resource atlas. Volume 8. The southern Rocky Mountain region

    SciTech Connect (OSTI)

    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.

  6. Shocks and finite-time singularities in Hele-Shaw flow

    SciTech Connect (OSTI)

    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.

  7. NREL Releases Updated Baseline of Cost and Performance Data for Electricity

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Generation Technologies - News Releases | NREL Releases Updated Baseline of Cost and Performance Data for Electricity Generation Technologies Webinar to be held on September 13 September 1, 2016 Graph-showing-NREL-2016-Annual-Technology-Baseline From NREL's 2016 Annual Technology Baseline, the projected Capital Expenditure (CAPEX) for electricity generating technologies in 2030. The Energy Department's National Renewable Energy Laboratory (NREL) has released the 2016 Annual Technology

  8. NREL: Hydrogen and Fuel Cells Research - Systems Analysis

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Systems Analysis Graphic showing a map and chart. Hydrogen infrastructure simulation models focus on the spatial and temporal deployment of vehicles and fueling infrastructure to provide insights into investment decisions and policy support options. Image of a generic bar graph. H2FAST: Hydrogen Financial Analysis Scenario Tool Delivers in-depth financial analysis for hydrogen fueling stations. NREL's hydrogen systems analysis activities provide direction, insight, and support for the

  9. NREL: Technology Deployment - Project Success Stories

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Project Success Stories NREL's technology deployment best practices, project support, and technical assistance, and technology acceleration activities are resulting in successful renewable energy and energy efficiency implementation in numerous locations. A photo of a brown camouflage shirt with the words U.S. Marines on the pocket. Photo by: Cpl. Raquel Barraza Microgrid Innovation Advances through Demonstration and Deployment at MCAS Miramar A screenshot of a yellow and orange graph from the

  10. NREL: Transportation Research - Capabilities

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Capabilities A Vision for Sustainable Transportation Line graph illustrating three pathways (biofuel, hydrogen, and electric vehicle) to reduce energy use and greenhouse gas emissions. Electric Vehicle Technologies & Targets 3-D illustration of electric car diagramming energy storage, power electronics, and climate control components. NREL uses 100% of its considerable transportation research, development, and deployment (RD&D) capabilities to pursue sustainable solutions that deliver

  11. Energy Landscapes and Their Application in Chemistry | Argonne National

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Consumption Survey (CBECS) Select Results from the Energy Assessor Experiment in the 2012 Commercial Buildings Energy Consumption Survey › Graph showing total U.S. manufacturing energy consumption for all purposes has declined 17 percent from 2002 to 2010. Source: EIA, Energy Assessor Experiment in the 2012 Commercial Buildings Energy Consumption Survey. A Look at the U.S. Commercial Building Stock: Results from EIA's 2012 CBECS › 2012 building stock results Source: U.S. Energy

  12. Macrophyte mapping in ten lakes of South Carolina with multispectral SPOT HRV data

    SciTech Connect (OSTI)

    Mackey, H.E. Jr.

    1989-01-01

    Fall and spring multispectral SPOT HRV data for 1987 and 1988 were used to evaluate the macrophyte distributions in ten freshwater reservoirs of South Carolina. The types of macrophyte and wetland communities present along the shoreline of the lakes varied depending on the age, water level fluctuations, water quality, and basin morphology. Seasonal satellite data were important for evaluation of the extent of persistent versus non-persistent macrophyte communities in the lakes. This paper contains only the view graphs of this process.

  13. Network traffic analysis using dispersion patterns

    Energy Science and Technology Software Center (OSTI)

    2010-03-15

    The Verilog code us used to map a measurement solution on FPGA to analyze network traffic. It realizes a set of Bloom filters and counters, besides associated control logic that can quickly measure statistics like InDegree, OutDegree, Depth, in the context of Traffic Dispersion Graphs. Such patterns are helpful in classification of network activity, like Peer to Peer and Port-Scanning, in the traffic.

  14. Radiation Exposure Information Reporting System (REIRS) Update, 2012

    SciTech Connect (OSTI)

    2013-01-01

    A series of graphs gives data through the year 2012 for annual collective doses, collective dose per reactor, number of individuals with measurable doses both in total and per reactor, number of reactors, electricity generated, measurable doses per individual and per megawatt-year, and collective outage hours. Reactors considered include BWR, PWR, and LWR. Also, the total effective dose equivalent for the period 2010-2012 is tabulated for each nuclear power plant considered, and the change over 2009-2011.

  15. Radiation Exposure Information Reporting System (REIRS) Update, 2012, Presented at the 32nd Annual International Dosimetry and Records Symposium, June 2-6, 2013

    SciTech Connect (OSTI)

    2013-01-01

    A series of graphs gives data through the year 2012 for annual collective doses, collective dose per reactor, number of individuals with measurable doses both in total and per reactor, number of reactors, electricity generated, measurable doses per individual and per megawatt-year, and collective outage hours. Reactors considered include BWR, PWR, and LWR. Also, the total effective dose equivalent for the period 2010-2012 is tabulated for each nuclear power plant considered, and the change over 2009-2011.

  16. Fact #565: April 6, 2009 Household Gasoline Expenditures by Income |

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    Department of Energy 5: April 6, 2009 Household Gasoline Expenditures by Income Fact #565: April 6, 2009 Household Gasoline Expenditures by Income In the annual Consumer Expenditure Survey, household incomes are grouped into five equal parts called quintiles (each quintile is 20%). Households in the second and third quintiles consistently have a higher share of spending on gasoline each year than households in the other quintiles. Household Gasoline Expenditures by Income Quintile Bar graph

  17. Fact #636: August 16, 2010 Transportation Energy Use by Mode | Department

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    of Energy 6: August 16, 2010 Transportation Energy Use by Mode Fact #636: August 16, 2010 Transportation Energy Use by Mode Highway vehicles were responsible for 80.7% of all transportation energy use in 2008. Light vehicles make up the majority of highway fuel use. Transportation Energy Use by Mode, 2008 Bar graph showing the transportation energy use by mode (buses, rail, pipeline, water, air, medium/heavy trucks, and light vehicles) for 2008. For more detailed information, see supporting

  18. Local Toolkit

    Energy Science and Technology Software Center (OSTI)

    2007-05-31

    The LOCAL Toolkit contains tools and libraries developed under the LLNL LOCAL LDRD project for managing and processing large unstructured data sets primrily from parallel numerical simulations, such as triangular, tetrahedral, and hexahedral meshes, point sets, and graphs. The tools have three main functionalities: cache-coherent, linear ordering of multidimensional data; lossy and lossless data compression optimized for different data types; and an out-of-core streaming I/O library with simple processing modules for unstructed data.

  19. Photon Source Parameters

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Photon Source Parameters Photon Source Parameters Print Summary Graph of Brightness Curves for All Insertion Devices Insertion Device and Bend Magnet Parameters Bend Magnet Superbend Magnet U30 Undulator U50 Undulator U80 Undulator U100 Undulator W114 Wiggler The ALS has six elliptically polarizing undulators, two in straight 4, two in straight 11, and one each in straights 6 and 7. All are arranged with chicanes so that two such devices can be installed to feed two independent beamlines. They

  20. Fact #940: August 29, 2016 Diverging Trends of Engine Compression Ratio and

    Broader source: Energy.gov (indexed) [DOE]

    Gasoline Octane Rating | Department of Energy From the 1920s to the 1970s, the evolution of engines (measured by compression ratio) and the evolution of fuels (measured by octane rating) occurred in tandem. Gasoline octane improvement during that period (red markers in the graph below) was likely due to refinery technology improvement and the addition of lead, which guards against engine knocking. In 1973, the Environmental Protection Agency (EPA) mandated a reduction in the lead content of

  1. Tpetra Next-Generation Templated Petra V1.0

    Energy Science and Technology Software Center (OSTI)

    2008-08-14

    A package of classes for constructing and using distributed sparse and dense matries, vectors and graphs. Templated o the scalar and ordinal types so that any valid floating-point type, as well as any valid integer type can be used with these classes. Other non-standard types, such as 3-by-3 matrices for the scalar type and mod-based integers for ordinal can also be used.

  2. Data-Intensive Benchmarking Suite

    Energy Science and Technology Software Center (OSTI)

    2008-11-26

    The Data-Intensive Benchmark Suite is a set of programs written for the study of data-or storage-intensive science and engineering problems, The benchmark sets cover: general graph searching (basic and Hadoop Map/Reduce breadth-first search), genome sequence searching, HTTP request classification (basic and Hadoop Map/Reduce), low-level data communication, and storage device micro-beachmarking

  3. Project Profile: Influence of Novel Behavioral Strategies in Promoting the

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    Diffusion of Solar Energy | Department of Energy Soft Costs » Project Profile: Influence of Novel Behavioral Strategies in Promoting the Diffusion of Solar Energy Project Profile: Influence of Novel Behavioral Strategies in Promoting the Diffusion of Solar Energy Logos of Yale University, New York University Stern School of Business, SmartPower, Clean Energy Finance and Investment Authority, and Solarize Connecticut. A line graph that highlights the social interactions for accelerating

  4. Fact #737: July 23, 2012 Upstream Emissions for Nissan Leaf | Department of

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    Energy 7: July 23, 2012 Upstream Emissions for Nissan Leaf Fact #737: July 23, 2012 Upstream Emissions for Nissan Leaf The all-electric Nissan Leaf does not emit tailpipe emissions like an internal combustion engine, but there are emissions associated with the production of electricity to fuel the Leaf, called upstream emissions. The Environmental Protection Agency (EPA) has estimated those upstream emissions using information about the electric utility fuel sources. The graph below shows

  5. Survey of lands held for uranium exploration, development, and production in fourteen western states for the six-month period ending December 31, 1982. [AZ, CA, CO, ID, MT, NV, NM, ND, OR, SD, TX, UT, WA, WY

    SciTech Connect (OSTI)

    Not Available

    1983-04-01

    Tables are presented showing the land held (in thousands of acres) for uranium exploration and development according to: (1) distribution by ownership for 14 western states; (2) distribution by state; distribution by land category. A graph is presented showing land held by uranium industry from January 1966 to January 1983. Land controlled by counties for each of the 14 states are also tabulated according to land category. (ATT)

  6. Survey of lands held for uranium exploration, development, and production in fourteen western states for the six-month period ending June 30, 1982. [AZ, CA, CO, ID, MT, NV, NM, ND, OR, SD, TX, UT, WA, WY

    SciTech Connect (OSTI)

    Not Available

    1982-10-01

    Tables are presented showing the land held (in thousands of acres) for uranium exploration according to: (1) distribution by ownership for 14 western states (state, claim, federally acquired, Indian and fee); (2) distribution by state (1976 to 1982); (3) distribution by land category (1976 to 1982). A graph is presented showing land held by uranium industry from January 1966 to January 1982. Land controlled by counties for each of the 14 states are also tabulated according to land category. (ATT)

  7. Membranes and MEAs at Freezing Temperatures

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    Au(111) j Disk mAcm 2 -6 -4 -2 0 I Ring A 0 10 20 2D Graph 5 E VRHE 0.0 0.4 0.8 1.2 j Disk mAcm 2 -6 -4 -2 0 I Ring A 0 10 20 295 K 274 K Pt-poly 0.1 M HClO 4 ...

  8. HPSS Yearly Network Traffic

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    HPSS Yearly Network Traffic HPSS Yearly Network Traffic Yearly Summary of I/O Traffic Between Storage and Network Destinations These bar charts show the total transfer traffic for each year between storage and network destinations (systems within and outside of NERSC). Traffic for the current year is an estimate derived by scaling the known months traffic up to 12 months. The years shown are calendar years. The first graph shows the overall growth in network traffic to storage over the years.

  9. Dialogs by Jerry Szymanski regarding the Yucca Mountain controversy from December, 1990 to March, 1991: Volume 2. Special report number 9, Contract number 92/94.0004

    SciTech Connect (OSTI)

    1993-07-01

    This report is a compilation of materials used as part of the Penrose Conference of Bodega Bay, California and the NRC/NAS panel field trip (April 23--25, 1991). The document contains extensive graphs on the hydrologic and geologic systems of the Yucca Mountain region. It outlines and diagrams hydrologic issues relative to geothermal gradients, geochemical pathways, hydraulic gradients, ground water chemistry, and ground water flow models. Specific anomalies in regards to geology or hydrology are addressed as separate issues.

  10. NREL: Measurements and Characterization - X-Ray and UV Photoelectron

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Spectroscopy X-Ray and UV Photoelectron Spectroscopy Example of graph made with cluster tool; plots counts (Y-axis) vs. binding energy (X-axis) for PET Carbon 1S. High-resolution XPS spectra of carbon 1s from polyethylene terephthalate backsheet material, showing excellent quantitative agreement between measured and predicted peak area ratios. Subtle differences in polymer functionality are assessed by deviations from stoichiometry. In photoemission techniques, we use either X-rays or

  11. A new augmentation based algorithm for extracting maximal chordal subgraphs

    DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)

    Bhowmick, Sanjukta; Chen, Tzu-Yi; Halappanavar, Mahantesh

    2014-10-18

    If every cycle of a graph is chordal length greater than three then it contains an edge between non-adjacent vertices. Chordal graphs are of interest both theoretically, since they admit polynomial time 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. A maximal chordal subgraph is a chordal subgraph that is not a proper subgraph of any other chordal subgraph. Existing algorithms for computing maximal chordal subgraphs depend on dynamically ordering the vertices, which is an inherently sequential process and therefore limits the algorithms’more » parallelizability. In our paper we explore techniques to develop a scalable parallel algorithm for extracting a maximal chordal subgraph. We demonstrate that an earlier attempt at developing a parallel algorithm may induce a non-optimal vertex ordering and is therefore not guaranteed to terminate with a maximal chordal subgraph. We then give a new algorithm that first computes and then repeatedly augments a spanning chordal subgraph. After proving that the algorithm terminates with a maximal chordal subgraph, we then demonstrate that this algorithm is more amenable to parallelization and that the parallel version also terminates with a maximal chordal subgraph. That said, the complexity of the new algorithm is higher than that of the previous parallel algorithm, although the earlier algorithm computes a chordal subgraph which is not guaranteed to be maximal. Finally, we experimented with our augmentation-based algorithm on both synthetic and real-world graphs. We provide scalability results and also explore the effect of different choices for the initial spanning chordal subgraph on both the running time and on the number of edges in the maximal chordal subgraph.« less

  12. Nonlinear Analysis for Event Forewarning (NLAfEW)

    Energy Science and Technology Software Center (OSTI)

    2013-05-23

    The NLAfEW computer code analyses noisy, experimental data to forewarn of adverse events. The functionality of the analysis is a follows: It removes artifacts from the data, converts the continuous data value to discrete values, constructs time-delay embedding vectors, comparents the unique nodes and links in one graph, and determines event forewarning on the basis of several successive occurrences of one (or more) of the dissimilarity measures above a threshold.

  13. Project SEEBECK Saving Energy Effectively By Engaging in Collaborative

    Broader source: Energy.gov (indexed) [DOE]

    Campaigns to Promote Solar Technology Diffusion through Data-Driven Behavior Modeling | Department of Energy Logos of Sandia National Laboratories, the Center of Sustainable Energy California, National Renewable Energy Laboratory, and the University of Pennsylvania Wharton School. A graph that highlights the solar social networks and helps to forecast how solar adoption patterns change under different business or policy scenarios. Sandia National Laboratories, along with partners at the

  14. A tool for the quantitative spatial analysis of mammary gland epithelium

    SciTech Connect (OSTI)

    Ortiz de Solorzano, Carlos; Fernandez-Gonzalez, Rodrigo

    2004-04-09

    In this paper we present a method for the spatial analysis of complex cellular systems based on a multiscale study of neighborhood relationships. A function to measure those relationships, M, is introduced. The refined Relative Neighborhood Graph is then presented as a method to establish vicinity relationships within layered cellular structures, and particularized to epithelial cell nuclei in the mammary gland. Finally, the method is illustrated with two examples that show interactions within one population of epithelial cells and between two different populations.

  15. International Conference on Infrared and Millimeter Waves, 15th, Orlando, FL, Dec. 10-14, 1990, Conference Digest

    SciTech Connect (OSTI)

    Temkin, R.J.

    1990-01-01

    Recent advances in IR and mm-wave (MMW) technology and applications are discussed in reviews and reports. Sections are devoted to MMW sources, high-Tc superconductors, atmospheric physics, FEL technology, astronomical instrumentation, MMW systems, measurement techniques, MMW guides, and MMW detectors and mixers. Also discussed are material properties, gyrotrons, guided propagation, semiconductors, submm detectors and devices, material characterization methods, ICs, MMW guides and plasma diagnostics, lasers, and MMW antennas. Diagrams, drawings, graphs, photographs, and tables of numerical data are provided.

  16. Project Profile: Halide and Oxy-Halide Eutectic Systems for

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    High-Performance, High-Temperature Heat Transfer Fluids | Department of Energy Halide and Oxy-Halide Eutectic Systems for High-Performance, High-Temperature Heat Transfer Fluids Project Profile: Halide and Oxy-Halide Eutectic Systems for High-Performance, High-Temperature Heat Transfer Fluids Logos from The University of Arizona, Arizona State University, and Georgia Institute of Technology, and Three side-by-side graphics showing the experimental design, a photomultiplier tube, and a graph

  17. Manufacturing Supply Chain

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Administration (EIA) ‹ Consumption & Efficiency Manufacturing Energy Consumption Survey (MECS) Glossary › FAQS › Overview Data 2010 2006 2002 1998 1994 1991 Archive Analysis & Projections Cost of Natural Gas Used in Manufacturing Sector Has Fallen Graph showing Cost of Natural Gas Used in Manufacturing Sector Has Fallen Source: U.S. Energy Information Administration, Manufacturing Energy Consumption Survey (MECS) 1998-2010, September 6, 2013. New 2010 Manufacturing Energy

  18. Meeting Materials

    Broader source: All U.S. Department of Energy (DOE) Office 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 -

  19. Microsoft PowerPoint - CCEI_Highlight_10.17.11

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Computational High Throughput Screening of Catalytic Materials Developed a first-principles based thermochemistry and kinetics toolbox for metal catalyzed heterogeneous reactions Predicted region for optimal catalyst activity via high throughput computing Captured experimental trends in activity and selectivity: Pt < Ni-Pt-Pt Proposed higher activity (subject to kinetics and thermodynamic constraints) for catalytic pyrolysis of ethylene glycol to syngas (CO, H 2 ) (middle graph) Salciccioli

  20. Phalanx V1.0

    Energy Science and Technology Software Center (OSTI)

    2008-07-14

    Phalanx is a software library to provide flexible dependency management for complex nonlinear partial differential equation operators. It breaks a complex set of equations into a manageable set of fields and evaluation routines. Users can flexibly swap evaluators to change the underlying dependency graph of the fields automatically. By constructing the dependency list, sensitivities can be calculated either analytically or by using embedded automatic differentiation software.

  1. CRC handbook of geophysical exploration at sea, 2nd edition

    SciTech Connect (OSTI)

    Geuer, R.A. )

    1990-01-01

    This book presents some of the most advanced research and operational information currently available about hard minerals and hydrocarbons. Information is provided in an integrated, interdisciplinary manner, stressing case histories and review chapters. Illustrations, graphs, tables, and color satellite images are used to graphically present the results of gravity, geodetic and seismic surveys, and 3-D sea floor sub-bottom visualizations. Data has been obtained from the Atlantic and Pacific Oceans, Gulf of Mexico, and Caribbean Sea using satellites, aircraft, and ships.

  2. Improved Cycle Life and Stability of Lithium Metal Anodes through Ultrathin

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    ALD Surface Treatments - Joint Center for Energy Storage Research September 11, 2015, Research Highlights Improved Cycle Life and Stability of Lithium Metal Anodes through Ultrathin ALD Surface Treatments Improved cycle life of Li metal anodes: control (black) vs. ALD (blue). Voltage in the upper graph represents overpotential in Li-Li symmetric cells and demonstrates how ALD can improve electrochemical lifetime. Micrographs show the improved resistance to dendrite growth after ALD

  3. Manufacturing Energy Consumption Survey (MECS) - U.S. Energy Information

    U.S. Energy Information Administration (EIA) Indexed Site

    Administration (EIA) ‹ Consumption & Efficiency Manufacturing Energy Consumption Survey (MECS) Glossary › FAQS › Overview Data 2010 2006 2002 1998 1994 1991 Archive Analysis & Projections Cost of Natural Gas Used in Manufacturing Sector Has Fallen Graph showing Cost of Natural Gas Used in Manufacturing Sector Has Fallen Source: U.S. Energy Information Administration, Manufacturing Energy Consumption Survey (MECS) 1998-2010, September 6, 2013. New 2010 Manufacturing Energy

  4. Solvation Structure and Transport Properties of Alkali Cations in Dimethyl

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Sulfoxide Under Exogenous Static Electric Fields - Joint Center for Energy Storage Research June 14, 2015, Research Highlights Solvation Structure and Transport Properties of Alkali Cations in Dimethyl Sulfoxide Under Exogenous Static Electric Fields Top: Snapshots of molecular dynamics simulations of alkali ions in DMSO at 298 K and zero-applied electric field: (left) Li+ and (right) Cs+. Sulfur atoms are shown in yellow, oxygen atoms in red, and methyl groups in gray. Graph: Average

  5. C:\Forms\DOE F 1350.4.cdr

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    INFORMATION SHEET DOE F 1350.4 (3--82) 1. Title of Briefing or Conference 2. Specify PRC Location 3. Date: 8. Presenters 11. Equipment (check) 12. Other Equipment (check) 13. If Audio Recording Requested, DOE Br. Chf. or above Sign Here: 14. Please Provide Utilization Information On Reverse Side No Projection Services Required Projectors (vu-graph) Projectors: 35mm Audio Tape Player Easel Other (explain) Video Tape Player Teleconference (Attach list giving names, area code, and telephone

  6. Stockpile Stewardship Q

    National Nuclear Security Administration (NNSA)

    2 | JUNE 2015 Office of Research, Development, Test, and Evaluation DOE/NA-0030 This issue of the Stockpile Stewardship Quarterly addresses some of our latest research areas, ranging from computing to manufacturing. The first article on the 20-petaflop Sequoia supercomputer describes why it is number one in the world according to the Graph 500 data analytics benchmark. This is a remarkable tool which supports a required capability for stockpile stewardship. High energy density physics

  7. An evaluation of pending energy and environmental policy

    SciTech Connect (OSTI)

    Eck, T.

    1995-12-31

    A very brief summary of the restructuring of the Amoco Corporation is provided. Also included in the paper are a number of graphs depicting historical data on energy supply and demand. The Amoco restructuring included elimination of middle management and staff to improve profitability, cost leadership, long-term growth, and customer focus. Data provided concern U.S. oil and natural gas consumption, gas prices, and emissions. 15 refs.

  8. Healthcare Energy: Spotlight on Medical Equipment | Department of Energy

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    Medical Equipment Healthcare Energy: Spotlight on Medical Equipment The Building Technologies Office conducted a healthcare energy end-use monitoring project in partnership with two hospitals. Additional plug load data from medical office buildings were provided by Mazzetti, Inc. See below for a few highlights from monitoring large medical imaging equipment and medical office building plug loads. Graphic showing the average weekday energy use of a CT machine. Graph showing average weekday energy

  9. Past Projects | Department of Energy

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    Commercial Buildings » Past Projects Past Projects Photo of NREL senior engineer Eric Kozubal examining a prototype airflow channel of the desiccant enhanced evaporative (DEVap) air conditioner with a graph superimposed on the photo that shows how hot humid air, in red, changes to cool dry air, in blue, as the air passes through the DEVap core. The Building Technologies Office (BTO) research portfolio of advanced technologies, systems, tools, and strategies aimed at improving the energy

  10. Supporting document for the historical tank content estimate for S tank farm

    SciTech Connect (OSTI)

    Brevick, C.H.; Gaddis, L.A.; Walsh, A.C.

    1994-06-01

    This document provides historical evaluations of the radioactive mixed wastes stored in the Hanford Site 200 West Area underground single-shell tanks (SSTs). A Historical Tank Content Estimate has been developed by reviewing the process histories, waste transfer data, and available physical and chemical characterization data from various Department of Energy (DOE) and Department of Defense (DOD) contractors. The historical data will supplement information gathered from in-tank core sampling activities that are currently underway. A tank history review that is accompanied by current characterization data creates a complete and reliable inventory estimate. Additionally, historical review of the tanks may reveal anomalies or unusual contents that are critical to characterization and post characterization activities. Complete and accurate tank waste characterizations are critical first steps for DOE and Westinghouse Hanford Company safety programs, waste pretreatment, and waste retrieval activities. The scope of this document is limited to all the SSTs in the S Tank Farm of the southwest quadrant of the 200 West Area. Nine appendices compile data on: tank level histories; temperature graphs; surface level graphs; drywell graphs; riser configuration and tank cross section; sampling data; tank photographs; unknown tank transfers; and tank layering comparison. 113 refs.

  11. Supporting document for the historical tank content estimate for BY Tank Farm

    SciTech Connect (OSTI)

    Brevick, C.H.; Gaddis, L.A.; Walsh, A.C.

    1994-06-01

    This document provides historical evaluations of the radioactive mixed wastes stored in the Hanford Site 200-East Area underground single-shell tanks (SSTs). A Historical Tank Content Estimate has been developed by reviewing the process histories, waste transfer data, and available physical and chemical characterization data from various Department of Energy (DOE) and Department of Defense (DOD) contractors. The historical data will supplement information gathered from in-tank core sampling activities that are currently underway. A tank history review that is accompanied by current characterization data creates a complete and reliable inventory estimate. Additionally, historical review of the tanks may reveal anomalies or unusual contents that are critical to characterization and post characterization activities. Complete and accurate tank waste characterizations are critical first steps for DOE and Westinghouse Hanford Company safety programs, waste pretreatment, and waste retrieval activities. The scope of this document is limited to the SSTs in the BY Tank Farm of the northeast quadrant of the 200 East Area. Nine appendices contain data on: tank level histories; temperature graphs; surface level graphs; drywell graphs; riser configuration and tank cross section; sampling data; tank photographs; unknown tank transfers; and tank layering comparison. 113 refs.

  12. Supporting document for the historical tank content estimate for B Tank Farm

    SciTech Connect (OSTI)

    Brevick, C.H.; Gaddis, L.A.; Johnson, E.D.

    1994-06-01

    This document provides historical evaluations of the radioactive mixed wastes stored in the Hanford Site 200-East Area underground single-shell tanks (SSTs). A Historical Tank Content Estimate has been developed by reviewing the process histories, waste transfer data, and available physical and chemical characterization data from various Department of Energy (DOE) and Department of Defense (DOD) contractors. The historical data will supplement information gathered from in-tank core sampling activities that are currently underway. A tank history review that is accompanied by current characterization data creates a complete and reliable inventory estimate. Additionally, historical review of the tanks may reveal anomalies or unusual contents that are critical to characterization and post characterization activities. Complete and accurate tank waste characterizations are critical first steps for DOE and Westinghouse Hanford Company safety programs, waste pretreatment, and waste retrieval activities. The scope of this document is limited to the SSTs in the B Tank Farm of the northeast quadrant of the 200 East Area. Nine appendices compile data on: tank level histories; temperature graphs; surface level graphs; drywell graphs; riser configuration and tank cross section; sampling data; tank photographs; unknown tank transfers; and tank layering comparison. 113 refs.

  13. Supporting document for the historical tank content estimate for A Tank Farm

    SciTech Connect (OSTI)

    Brevick, C.H.; Gaddis, L.A.; Walsh, A.C.

    1994-06-01

    This document provides historical evaluations of the radioactive mixed wastes stored in the Hanford Site 200-East Area underground single-shell tanks (SSTs). A Historical Tank Content Estimate has been developed by reviewing the process histories, waste transfer data, and available physical and chemical characterization data from various Department of Energy (DOE) and Department of Defense (DOD) contractors. The historical data will supplement information gathered from in-tank core sampling activities that are currently underway. A tank history review that is accompanied by current characterization data creates a complete and reliable inventory estimate. Additionally, historical review of the tanks may reveal anomalies or unusual contents that are critical to characterization and post characterization activities. Complete and accurate tank waste characterizations are critical first steps for DOE and Westinghouse Hanford Company safety programs, waste pretreatment, and waste retrieval activities. The scope of this document is limited to the SSTs in the A Tank Farm of the northeast quadrant of the 200 East Area. Nine appendices compile data on: tank level histories; temperature graphs; surface level graphs; drywell graphs; riser configuration and tank cross section; sampling data; tank photographs; unknown tank transfers; and tank layering comparison. 113 refs.

  14. On Parallel Push-Relabel based Algorithms for Bipartite Maximum Matching

    SciTech Connect (OSTI)

    Langguth, Johannes; Azad, Md Ariful; Halappanavar, Mahantesh; Manne, Fredrik

    2014-07-01

    We study multithreaded push-relabel based algorithms for computing maximum cardinality matching in bipartite graphs. Matching is a fundamental combinatorial (graph) problem with applications in a wide variety of problems in science and engineering. We are motivated by its use in the context of sparse linear solvers for computing maximum transversal of a matrix. We implement and test our algorithms on several multi-socket multicore systems and compare their performance to state-of-the-art augmenting path-based serial and parallel algorithms using a testset comprised of a wide range of real-world instances. Building on several heuristics for enhancing performance, we demonstrate good scaling for the parallel push-relabel algorithm. We show that it is comparable to the best augmenting path-based algorithms for bipartite matching. To the best of our knowledge, this is the first extensive study of multithreaded push-relabel based algorithms. In addition to a direct impact on the applications using matching, the proposed algorithmic techniques can be extended to preflow-push based algorithms for computing maximum flow in graphs.

  15. Advanced mobile networking, sensing, and controls.

    SciTech Connect (OSTI)

    Feddema, John Todd; Kilman, Dominique Marie; Byrne, Raymond Harry; Young, Joseph G.; Lewis, Christopher L.; Van Leeuwen, Brian P.; Robinett, Rush D. III; Harrington, John J.

    2005-03-01

    This report describes an integrated approach for designing communication, sensing, and control systems for mobile distributed systems. Graph theoretic methods are used to analyze the input/output reachability and structural controllability and observability of a decentralized system. Embedded in each network node, this analysis will automatically reconfigure an ad hoc communication network for the sensing and control task at hand. The graph analysis can also be used to create the optimal communication flow control based upon the spatial distribution of the network nodes. Edge coloring algorithms tell us that the minimum number of time slots in a planar network is equal to either the maximum number of adjacent nodes (or degree) of the undirected graph plus some small number. Therefore, the more spread out that the nodes are, the fewer number of time slots are needed for communication, and the smaller the latency between nodes. In a coupled system, this results in a more responsive sensor network and control system. Network protocols are developed to propagate this information, and distributed algorithms are developed to automatically adjust the number of time slots available for communication. These protocols and algorithms must be extremely efficient and only updated as network nodes move. In addition, queuing theory is used to analyze the delay characteristics of Carrier Sense Multiple Access (CSMA) networks. This report documents the analysis, simulation, and implementation of these algorithms performed under this Laboratory Directed Research and Development (LDRD) effort.

  16. De novo sequencing of peptides from top-down tandem mass spectra

    SciTech Connect (OSTI)

    Vyatkina, Kira; Wu, Si; Dekker, Leendert J.; vanDuijn, Martijn M.; Liu, Xiaowen; Tolic, Nikola; Dvorkin, Mikhail; Alexandrova, Sonya; Luider, Theo N.; Pasa-Tolic, Ljiljana; Pevzner, Pavel A.

    2015-09-28

    De novo sequencing of proteins and peptides is one of the most important problems in mass spectrometry-driven proteomics. A variety of methods have been developed to accomplish this task from a set of bottom-up tandem (MS/MS) mass spectra. However, a more recently emerged top-down technology, now gaining more and more popularity, opens new perspectives for protein analysis and characterization, implying a need in efficient algorithms for processing this kind of MS/MS data. Here we describe a method that allows to retrieve from a set of top-down MS/MS spectra long and accurate sequence fragments of the proteins contained in a sample. To this end, we outline a strategy for generating high-quality sequence tags from top-down spectra, and introduce the concept of a T-Bruijn graph by adapting to the case of tags the notion of an A-Bruijn graph widely used in genomics. The output of the proposed approach represents the set of amino acid strings spelled out by optimal paths in the connected components of a T-Bruijn graph. We illustrate its performance on top-down datasets acquired from carbonic anhydrase 2 (CAH2) and the Fab region of alemtuzumab.

  17. Single particle in quantum gravity and Braunstein-Ghosh-Severini entropy of a spin network

    SciTech Connect (OSTI)

    Rovelli, Carlo; Vidotto, Francesca

    2010-02-15

    Passerini and Severini have recently shown that the Braunstein-Ghosh-Severini (BGS) entropy S{sub {Gamma}}=-Tr[{rho}{sub {Gamma}}log{rho}{sub {Gamma}}] of a certain density matrix {rho}{sub {Gamma}} naturally associated to a graph {Gamma}, is maximized, among all graphs with a fixed number of links and nodes, by regular graphs. We ask if this result can play a role in quantum gravity, and be related to the apparent regularity of the physical geometry of space. We show that in loop quantum gravity the matrix {rho}{sub {Gamma}} is precisely the Hamiltonian operator (suitably normalized) of a nonrelativistic quantum particle interacting with the quantum gravitational field, if we restrict elementary area and volume eigenvalues to a fixed value. This operator provides a spectral characterization of the physical geometry, and can be interpreted as a state describing the spectral information about the geometry available when geometry is measured by its physical interaction with matter. It is then tempting to interpret its BGS entropy S{sub {Gamma}} as a genuine physical entropy: we discuss the appeal and the difficulties of this interpretation.

  18. Graphical calculus for Gaussian pure states

    SciTech Connect (OSTI)

    Menicucci, Nicolas C.; Flammia, Steven T.; Loock, Peter van

    2011-04-15

    We provide a unified graphical calculus for all Gaussian pure states, including graph transformation rules for all local and semilocal Gaussian unitary operations, as well as local quadrature measurements. We then use this graphical calculus to analyze continuous-variable (CV) cluster states, the essential resource for one-way quantum computing with CV systems. Current graphical approaches to CV cluster states are only valid in the unphysical limit of infinite squeezing, and the associated graph transformation rules only apply when the initial and final states are of this form. Our formalism applies to all Gaussian pure states and subsumes these rules in a natural way. In addition, the term 'CV graph state' currently has several inequivalent definitions in use. Using this formalism we provide a single unifying definition that encompasses all of them. We provide many examples of how the formalism may be used in the context of CV cluster states: defining the 'closest' CV cluster state to a given Gaussian pure state and quantifying the error in the approximation due to finite squeezing; analyzing the optimality of certain methods of generating CV cluster states; drawing connections between this graphical formalism and bosonic Hamiltonians with Gaussian ground states, including those useful for CV one-way quantum computing; and deriving a graphical measure of bipartite entanglement for certain classes of CV cluster states. We mention other possible applications of this formalism and conclude with a brief note on fault tolerance in CV one-way quantum computing.

  19. Evolution on folding landscapes in combinatorial structures

    SciTech Connect (OSTI)

    Fraser, S.M.; Reidys, C.M.

    1997-11-01

    In this paper the authors investigate the evolution of molecular structures by random point mutations. They will consider two types of molecular structures: (a) (RNA) secondary structures, and (b) random structures. In both cases structure consists of: (1) a contact graph, and (2) a family of relations imposed on its adjacent vertices. The vertex set of the contact graph is simply the set of all indices of a sequence, and its edges are the bonds. The corresponding relations associated with the edges are viewed as secondary base pairing rules and tertiary interaction rules respectively. Mapping of sequences into secondary and random structures are modeled and analyzed. Here, the set of all sequences that map into a particular structure is modeled as a random graph in the sequence space, the so called neutral network and they study how neutral networks are embedded in sequence space. A basic replication of deletion experiment reveals how effective secondary and random structures can be searched by random point mutations and to what extent the structure effects the dynamics of this optimization process. In particular the authors can report a nonlinear relation between the fraction of tertiary interactions in random structures, and the times taken for a population of sequences to find a high fitness target random structure.

  20. Man-made objects cuing in satellite imagery

    SciTech Connect (OSTI)

    Skurikhin, Alexei N

    2009-01-01

    We present a multi-scale framework for man-made structures cuing in satellite image regions. The approach is based on a hierarchical image segmentation followed by structural analysis. A hierarchical segmentation produces an image pyramid that contains a stack of irregular image partitions, represented as polygonized pixel patches, of successively reduced levels of detail (LOOs). We are jumping off from the over-segmented image represented by polygons attributed with spectral and texture information. The image is represented as a proximity graph with vertices corresponding to the polygons and edges reflecting polygon relations. This is followed by the iterative graph contraction based on Boruvka's Minimum Spanning Tree (MST) construction algorithm. The graph contractions merge the patches based on their pairwise spectral and texture differences. Concurrently with the construction of the irregular image pyramid, structural analysis is done on the agglomerated patches. Man-made object cuing is based on the analysis of shape properties of the constructed patches and their spatial relations. The presented framework can be used as pre-scanning tool for wide area monitoring to quickly guide the further analysis to regions of interest.

  1. Simulation and sequential dynamical systems

    SciTech Connect (OSTI)

    Mortveit, H.S.; Reidys, C.M.

    1999-06-01

    Computer simulations have a generic structure. Motivated by this the authors present a new class of discrete dynamical systems that captures this structure in a mathematically precise way. This class of systems consists of (1) a loopfree graph {Upsilon} with vertex set {l_brace}1,2,{hor_ellipsis},n{r_brace} where each vertex has a binary state, (2) a vertex labeled set of functions (F{sub i,{Upsilon}}:F{sub 2}{sup n} {yields} F{sub 2}{sup n}){sub i} and (3) a permutation {pi} {element_of} S{sub n}. The function F{sub i,{Upsilon}} updates the state of vertex i as a function of the states of vertex i and its {Upsilon}-neighbors and leaves the states of all other vertices fixed. The permutation {pi} represents the update ordering, i.e., the order in which the functions F{sub i,{Upsilon}} are applied. By composing the functions F{sub i,{Upsilon}} in the order given by {pi} one obtains the dynamical system (equation given in paper), which the authors refer to as a sequential dynamical system, or SDS for short. The authors will present bounds for the number of functionally different systems and for the number of nonisomorphic digraphs {Gamma}[F{sub {Upsilon}},{pi}] that can be obtained by varying the update order and applications of these to specific graphs and graph classes.

  2. Resolving local ambiguity using semantics of shape.

    SciTech Connect (OSTI)

    Diegert, Carl F.

    2010-05-01

    We demonstrate a new semantic method for automatic analysis of wide-area, high-resolution overhead imagery to tip and cue human intelligence analysts to human activity. In the open demonstration, we find and trace cars and rooftops. Our methodology, extended to analysis of voxels, may be applicable to understanding morphology and to automatic tracing of neurons in large-scale, serial-section TEM datasets. We defined an algorithm and software implementation that efficiently finds all combinations of image blobs that satisfy given shape semantics, where image blobs are formed as a general-purpose, first step that 'oversegments' image pixels into blobs of similar pixels. We will demonstrate the remarkable power (ROC) of this combinatorial-based work flow for automatically tracing any automobiles in a scene by applying semantics that require a subset of image blobs to fill out a rectangular shape, with width and height in given intervals. In most applications we find that the new combinatorial-based work flow produces alternative (overlapping) tracings of possible objects (e.g. cars) in a scene. To force an estimation (tracing) of a consistent collection of objects (cars), a quick-and-simple greedy algorithm is often sufficient. We will demonstrate a more powerful resolution method: we produce a weighted graph from the conflicts in all of our enumerated hypotheses, and then solve a maximal independent vertex set problem on this graph to resolve conflicting hypotheses. This graph computation is almost certain to be necessary to adequately resolve multiple, conflicting neuron topologies into a set that is most consistent with a TEM dataset.

  3. On sequential dynamical systems and simulation

    SciTech Connect (OSTI)

    Barrett, C.L.; Mortveit, H.S.; Reidys, C.M.

    1999-06-01

    The generic structure of computer simulations motivates a new class of discrete dynamical systems that captures this structure in a mathematically precise way. This class of systems consists of (1) a loopfree graph {Upsilon} with vertex set {l_brace}1,2,{hor_ellipsis},n{r_brace} where each vertex has a binary state, (2) a vertex labeled set of functions (F{sub i,{Upsilon}}:F{sub 2}{sup n} {r_arrow} F{sub 2}{sup n}){sub i} and (3) a permutation {pi} {element_of} S{sub n}. The function F{sub i,{Upsilon}} updates the state of vertex i as a function of the states of vertex i and its {Upsilon}-neighbors and leaves the states of all other vertices fixed. The permutation {pi} represents the update ordering, i.e., the order in which the functions F{sub i,{Upsilon}} are applied. By composing the functions F{sub i,{Upsilon}} in the order given by {pi} one obtains the dynamical system (equation given in paper) which the authors refer to as a sequential dynamical system, or SDS for short. The authors will present bounds for the number of functionally different systems and for the number of nonisomorphic digraphs {Gamma}[F{sub {Upsilon}},{pi}] that can be obtained by varying the update order and applications of these to specific graphs and graph classes. This will be done using both combinatorial/algebraic techniques and probabilistic techniques. Finally the authors give results on dynamical system properties for some special systems.

  4. Nonlinear instability of an Oldroyd elasticoviscous magnetic nanofluid saturated in a porous medium

    SciTech Connect (OSTI)

    Moatimid, Galal M.; Alali, Elham M. M. Ali, Hoda S. M.

    2014-09-15

    Through viscoelastic potential theory, a Kelvin-Helmholtz instability of two semi-infinite fluid layers, of Oldroydian viscoelastic magnetic nanofluids (MNF), is investigated. The system is saturated by porous medium through two semi-infinite fluid layers. The Oldroyd B model is utilized to describe the rheological behavior of viscoelastic MNF. The system is influenced by uniform oblique magnetic field that acts at the surface of separation. The model is used for the MNF incorporated the effects of uniform basic streaming and viscoelasticity. Therefore, a mathematical simplification must be considered. A linear stability analysis, based upon the normal modes analysis, is utilized to find out the solutions of the equations of motion. The onset criterion of stability is derived; analytically and graphs have been plotted by giving numerical values to the various parameters. These graphs depict the stability characteristics. Regions of stability and instability are identified and discussed in some depth. Some previous studies are recovered upon appropriate data choices. The stability criterion in case of ignoring the relaxation stress times is also derived. To relax the mathematical manipulation of the nonlinear approach, the linearity of the equations of motion is taken into account in correspondence with the nonlinear boundary conditions. Taylor's theory is adopted to expand the governing nonlinear characteristic equation according to of the multiple time scales technique. This analysis leads to the well-known GinzburgLandau equation, which governs the stability criteria. The stability criteria are achieved theoretically. To simplify the mathematical manipulation, a special case is considered to achieve the numerical estimations. The influence of orientation of the magnetic fields on the stability configuration, in linear as well as nonlinear approaches, makes a dual role for the magnetic field strength in the stability graphs. Stability diagram is plotted for

  5. Analysis of Ground-Water Levels and Associated Trends in Yucca Flat, Nevada Test Site, Nye County, Nevada, 1951-2003

    SciTech Connect (OSTI)

    J.M. Fenelon

    2005-10-05

    Almost 4,000 water-level measurements in 216 wells in the Yucca Flat area from 1951 to 2003 were quality assured and analyzed. An interpretative database was developed that describes water-level conditions for each water level measured in Yucca Flat. Multiple attributes were assigned to each water-level measurement in the database to describe the hydrologic conditions at the time of measurement. General quality, temporal variability, regional significance, and hydrologic conditions are attributed for each water-level measurement. The database also includes narratives that discuss the water-level history of each well. Water levels in 34 wells were analyzed for variability and for statistically significant trends. An attempt was made to identify the cause of many of the water-level fluctuations or trends. Potential causes include equilibration following well construction or development, pumping in the monitoring well, withdrawals from a nearby supply well, recharge from precipitation, earthquakes, underground nuclear tests, land subsidence, barometric pressure, and Earth tides. Some of the naturally occurring fluctuations in water levels may result from variations in recharge. The magnitude of the overall water-level change for these fluctuations generally is less than 2 feet. Long-term steady-state hydrographs for most of the wells open to carbonate rock have a very similar pattern. Carbonate-rock wells without the characteristic pattern are directly west of the Yucca and Topgallant faults in the southwestern part of Yucca Flat. Long-term steady-state hydrographs from wells open to volcanic tuffs or the Eleana confining unit have a distinctly different pattern from the general water-level pattern of the carbonate-rock aquifers. Anthropogenic water-level fluctuations were caused primarily by water withdrawals and nuclear testing. Nuclear tests affected water levels in many wells. Trends in these wells are attributed to test-cavity infilling or the effects of

  6. Word Pro - Untitled1

    U.S. Energy Information Administration (EIA) Indexed Site

    6 Crude Oil and Natural Gas Exploratory Wells, 1949-2010 Exploratory Wells Drilled by Well Type Exploratory Footage Drilled by Well Type Exploratory Wells Average Depth, All Wells Exploratory Wells Average Depth by Well Type 98 U.S. Energy Information Administration / Annual Energy Review 2011 Note: These graphs depict exploratory wells only; see Figure 4.5 for all wells and Figure 4.7 for development wells only. Source: Table 4.6. Dry Holes 1950 1960 1970 1980 1990 2000 2010 0 3 6 9 12 15

  7. Word Pro - Untitled1

    U.S. Energy Information Administration (EIA) Indexed Site

    7 Crude Oil and Natural Gas Development Wells, 1949-2010 Development Wells Drilled by Well Type Development Footage Drilled by Well Type Development Wells Average Depth, All Wells Development Wells Average Depth by Well Type 100 U.S. Energy Information Administration / Annual Energy Review 2011 Note: These graphs depict development wells only; see Figure 4.5 for all wells and Figure 4.6 for exploratory wells only. Source: Table 4.7. 1950 1960 1970 1980 1990 2000 2010 0 10 20 30 40 50 Thousand

  8. Specific heat loading in Nd:glass lasers

    SciTech Connect (OSTI)

    Krupke, W.F.

    1985-08-07

    The specific thermal load parameter, chi, for xenon flashlamp-pumped Nd:glass gain media is written as a function of neodymium concentration, pump pulse duration, and energy extraction efficiency. The currently available data on radiative and nonradiative decay probabilities of several commercial Nd:glasses are used to calculate and graph specific thermal load parameter values. By factoring these results into performance scaling relationships for zig-zag and disk lasers, specific Nd:glasses can be selected for optimized laser performance.

  9. Integer programming, fullerenes and nanotubes

    SciTech Connect (OSTI)

    Fowler, P.W.; Hansen, P.; Leroy, C.; Sachs, H.

    1994-12-31

    Graph theoretic and integer programming techniques provide answers to a series of questions in organic chemistry. We focus on problems on fullerenes, or closed carbon-cage molecules with large number of carbon atoms, and nanotubes, which are similar open or closed end tubes of carbon atoms with a few manometer diameter. These problems include isomer enumeration, counting Kekul{acute e} structures (or perfect matchings), finding Kekul{acute e} structures with a maximum number of resonant hexagons (i.e., determining the Clar and Fries numbers) and finding the stability number of fullerenes.

  10. Establishment of an oil and gas database for increased recovery and characterization of oil and gas carbonate reservoir heterogeneity. Appendix 1, Volume 1

    SciTech Connect (OSTI)

    Kopaska-Merkel, D.C.; Moore, H.E. Jr.; Mann, S.D.; Hall, D.R.

    1992-06-01

    This volume contains maps, well logging correlated to porosity and permeability, structural cross section, graph of production history, porosity vs. natural log permeability plot, detailed core log, paragenetic sequence and reservoir characterization sheet of the following fields in southwest Alabama: Appleton oil field; Barnett oil field; Barrytown oil field; Big Escambia Creek gas and condensate field; Blacksher oil field; Broken Leg Creed oil field; Bucatunna Creed oil field; Chappell Hill oil field; Chatom gas and condensate field; Choctaw Ridge oil field; Chunchula gas and condensate field; Cold Creek oil field; Copeland gas and condensate field; Crosbys Creed gas and condensate field; and East Barnett oil field. (AT)

  11. Establishment of an oil and gas database for increased recovery and characterization of oil and gas carbonate reservoir heterogeneity. [Jurassic Smackover Formation

    SciTech Connect (OSTI)

    Kopaska-Merkel, D.C.; Moore, H.E. Jr.; Mann, S.D.; Hall, D.R.

    1992-06-01

    This volume contains maps, well logging correlated to porosity and permeability, structural cross section, graph of production history, porosity vs. natural log permeability plot, detailed core log, paragenetic sequence and reservoir characterization sheet of the following fields in southwest Alabama: Appleton oil field; Barnett oil field; Barrytown oil field; Big Escambia Creek gas and condensate field; Blacksher oil field; Broken Leg Creed oil field; Bucatunna Creed oil field; Chappell Hill oil field; Chatom gas and condensate field; Choctaw Ridge oil field; Chunchula gas and condensate field; Cold Creek oil field; Copeland gas and condensate field; Crosbys Creed gas and condensate field; and East Barnett oil field. (AT)

  12. Distributions of topological observables in inclusive three- and four-jet events in pp collisions at ?s=7 TeV

    SciTech Connect (OSTI)

    Khachatryan, V.

    2015-07-01

    This paper presents distributions of topological observables in inclusive three- and four-jet events produced in pp collisions at a centre-of-mass energy of 7TeV with a data sample collected by the CMS experiment corresponding to a luminosity of 5.1fb-1. The distributions are corrected for detector effects, and compared with several event generators based on two- and multi-parton matrix elements at leading order. Among the considered calculations, MadGraph interfaced with pythia6 displays the overall best agreement with data.

  13. Fact #556: February 2, 2009 Change in Material Content of Light Vehicles |

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    Department of Energy 6: February 2, 2009 Change in Material Content of Light Vehicles Fact #556: February 2, 2009 Change in Material Content of Light Vehicles Light vehicles are made up of many different materials. The materials shown on the graph below are materials with substantial changes over the last ten years. The use of high and medium strength steel has increased from an average of 324 pounds per vehicle to 500 pounds per vehicle in 2006. The use of aluminum and plastics also

  14. Fact #564: March 30, 2009 Transportation and the Gross Domestic Product,

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    2007 | Department of Energy 4: March 30, 2009 Transportation and the Gross Domestic Product, 2007 Fact #564: March 30, 2009 Transportation and the Gross Domestic Product, 2007 Transportation plays a major role in the U.S. economy. About 10% of the U.S. Gross Domestic Product (GDP) in 2007 is related to transportation. Housing, health care, and food are the only categories with greater shares of the GDP. GDP by Category, 2007 Graph showing the Gross Domestic Product (GDP) for various

  15. Fact #566: April 13, 2009 Vehicle Travel and the Price of Gasoline |

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    Department of Energy 6: April 13, 2009 Vehicle Travel and the Price of Gasoline Fact #566: April 13, 2009 Vehicle Travel and the Price of Gasoline 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 monthly data from one year to the next (i.e., February 2001 data were compared with February 2000 data). In 2008, when gasoline prices were 20-30% higher,

  16. Fact #574: June 8, 2009 Vehicles per Licensed Driver Rising | Department of

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    Energy 4: June 8, 2009 Vehicles per Licensed Driver Rising Fact #574: June 8, 2009 Vehicles per Licensed Driver Rising The number of vehicles in operation per licensed driver has risen steadily since 1950. In 1985, for the first time, there was one vehicle for every licensed driver. Since 1985, the number of vehicles in operation has exceeded the number of licensed drivers reaching a level of 1.21 vehicles per licensed driver in 2007. Vehicles per Licensed Driver, 1950-2007 Line graph

  17. Fact #577: June 29, 2009 Changes in Vehicles per Capita around the World |

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    Department of Energy 7: June 29, 2009 Changes in Vehicles per Capita around the World Fact #577: June 29, 2009 Changes in Vehicles per Capita around the World The graphs below show the number of motor vehicles per thousand people for various countries. The data for the U.S. are displayed in the line which goes from 1900 to 2007. The points labeled on that line show data for the other countries/regions around the world and how their vehicles per thousand people compare to the U.S. at two

  18. Fact #579: July 13, 2009 Oil Price and Economic Growth, 1970-2008 |

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    Department of Energy 9: July 13, 2009 Oil Price and Economic Growth, 1970-2008 Fact #579: July 13, 2009 Oil Price and Economic Growth, 1970-2008 Major oil price shocks have disrupted world energy markets five times in the past 30 years - 1973-74, 1979-80, 1990-1991, 1999-2000 and again in 2008. Most of the oil price shocks were followed by an economic recession in the U.S. Oil Price and Economic Growth, 1970-2008 Graph showing the five times that major oil price shocks disrupted world energy

  19. Fact #583: August 10, 2009 Teleworking Trends | Department of Energy

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    3: August 10, 2009 Teleworking Trends Fact #583: August 10, 2009 Teleworking Trends The number of teleworkers - people who work at least one day per month from home - increased to nearly 34 million workers in 2008. The year the survey began (2002) there were only 20 million teleworkers. Number of Teleworkers, 2002-2008 Graph showing the number of teleworkers, people who work at least one day a month from their home, increased from 20.7 million in 2002 to 33.7 in 2008. For more detailed

  20. Fact #584: August 17, 2009 The Price of Gasoline and Vehicle Travel: How Do

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    They Relate? | Department of Energy 4: August 17, 2009 The Price of Gasoline and Vehicle Travel: How Do They Relate? Fact #584: August 17, 2009 The Price of Gasoline and Vehicle Travel: How Do They Relate? 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 monthly data from one year to the next (i.e., February 2001 data were compared with February