National Library of Energy BETA

Sample records for hydrographs time-concentration graphs

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

    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 blank Contents Section .................................................................................. Surface Water Time-Concentration Plots D1.O ............................................................................................... Stream Discharge Measurements D2.0

  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

    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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  12. Useful Graphs and Charts - Ion Beams - Radiation Effects Facility /

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

    Cyclotron Institute / Texas A&M University Ion Beams Available Beams / Beam Change Times / Measurements / Useful Graphs Useful Graphs and Charts LET vs. Range in Si Graphs: 15 MeV/u Beams 24.8 MeV/u Beams 40 MeV/u Beams Beam energy, Let and range in si at various air-gaps from rear foil: 15 MeV/u Beams 24.8 and 40 MeV/u Beams Quick Links Beam Characterization and verification Beam List Beam Change Times 15 MeV/u LET vs Range Graph 25 MeV/u LET vs Range Graph 40 Mev/u LET vs Range Graph

  13. Sequoia supercomputer tops Graph 500 | National Nuclear Security

    National Nuclear Security Administration (NNSA)

    Administration Sequoia supercomputer tops Graph 500 Wednesday, November 19, 2014 - 11:34am 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 solving large graph problems on small high performance computing (HPC) systems, all the way down to a single server. Lawrence Livermore's Sequoia supercomputer, a 20-petaflop IBM Blue Gene/Q system, achieved the world's best

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

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

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

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

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

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

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

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

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

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

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

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

  6. Mining Graphs for Understanding Time-Varying Volumetric Data (Journal

    Office of Scientific and Technical Information (OSTI)

    Article) | SciTech Connect SciTech Connect Search Results Journal Article: Mining Graphs for Understanding Time-Varying Volumetric Data Citation Details In-Document Search Title: Mining Graphs for Understanding Time-Varying Volumetric Data Authors: Gu, Yi ; Wang, Chaoli ; Peterka, Tom ; Jacob, Robert ; Kim, Seung Hyun Publication Date: 2016-01-01 OSTI Identifier: 1249546 DOE Contract Number: AC02-06CH11357 Resource Type: Journal Article Resource Relation: Journal Name: IEEE Transactions on

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

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

  9. 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 analysis. Since intelligence datasets can be extremely large, the focus of this work is on the use of parallel computers. We have been working to develop scalable parallel algorithms that will be at the core of a semantic graph analysis infrastructure. Our work has involved two different thrusts, corresponding to two different computer architectures. The first architecture of interest is distributed memory, message passing computers. These machines are ubiquitous and affordable, but they are challenging targets for graph algorithms. Much of our distributed-memory work to date has been collaborative with researchers at Lawrence Livermore National Laboratory and has focused on finding short paths on distributed memory parallel machines. Our implementation on 32K processors of BlueGene/Light finds shortest paths between two specified vertices in just over a second for random graphs with 4 billion vertices.

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

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

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

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

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

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

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

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

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

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

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

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

  2. Constructing Compact and Effective Graphs for Recommender Systems via Node and Edge Aggregations

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

    Kahng, Minsuk; Sang-goo, Lee

    2015-01-01

    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 na ve 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, wemore » propose 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. 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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    SciTech Connect (OSTI)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  3. Graph Characterization and Sampling Algorithms. (Conference)...

    Office of Scientific and Technical Information (OSTI)

    Authors: Kolda, Tamara G. ; Pinar, Ali ; Comandur, Seshadhri 1 + Show Author Affiliations (UC Santa Cruz) Publication Date: 2015-04-01 OSTI Identifier: 1249461 Report Number(s): ...

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

  5. Graph Characterization and Sampling Algorithms. (Conference)...

    Office of Scientific and Technical Information (OSTI)

    APA Chicago Bibtex Export Metadata Endnote Excel CSV XML Save to My Library Send to Email Send to Email Email address: Content: Close Send Cite: MLA Format Close Cite: APA ...

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

  7. Data Sources For Emerging Technologies Program MYPP Target Graphs...

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

    ... Water Heaters Current Best Cost and performance (Non CO2 VC, CO2 VC, Non-VC): Based on Geo Spring 50 Gallon Hybrid Electric Heat Pump Water Heater and similar products Cost and ...

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

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

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

  11. GRAPHMC

    Energy Science and Technology Software Center (OSTI)

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

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

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

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

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

  16. Microsoft PowerPoint - Salishan_4_04.ppt

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

    ... Compiler analyzes program and discovers parallelism Program Dependency Graph Compiler ... Compiler analyzes program and discovers parallelism Program Dependency Graph Compiler ...

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

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

  19. This Week In Petroleum Propane Section

    Gasoline and Diesel Fuel Update (EIA)

    Residential propane prices (dollars per gallon) Average Regional U.S. residential propane prices graph Regional residential propane prices graph Residential propane prices (dollars ...

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

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

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

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

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

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

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

  7. Microsoft Word - CY11_draft_appxa.doc

    Office of Legacy Management (LM)

    8: Gaging 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 Level Data Appendix A, Page 1 Appendix A: Hydrologic Data A.1 Surface-Water Discharge Data This section includes mean daily discharge tables and hydrographs by monitoring location and calendar year. Appendix A, Page 2 A.1.1 GS01: Woman Creek at Indiana Street Table A-1. CY 2011 Discharge Summary for GS01: Woman

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

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

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

  11. Microsoft Word - appxa.docx

    Office of Legacy Management (LM)

    9: Gaging 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: Hydrologic Data A.1 Surface-Water Discharge Data This section includes mean daily discharge tables and hydrographs by monitoring location and calendar year. Appendix A, Page 2 A.1.1 GS01: Woman Creek at Indiana Street Table A-1. CY 2012 Discharge Summary for GS01: Woman Creek at Indiana Street Calendar Year 2012:

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

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

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

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

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

  17. INDDGO

    Energy Science and Technology Software Center (OSTI)

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

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

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

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

  1. HAVOQGT

    Energy Science and Technology Software Center (OSTI)

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

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

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

  4. EAGLE

    Energy Science and Technology Software Center (OSTI)

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

  5. 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 Alkalinity below the deepest winter mixed layer depths • Carbon Dioxide, Hydrographic, and Chemical Data Obtained During the R/V John V. Vickers Cruise in the Pacific Ocean (WOCE Section P13, NOAA CGC92 Cruise, 080492 – 102192) • Carbon Dioxide, Hydrographic, and Chemical Data Obtained During the R/V Hesperides Cruise in the Atlantic Ocean (WOCE Section A5, 071492 - 081592) • Carbon Dioxide, Hydrographic, and Chemical Data Obtained During the R/V Thomas G. Thompson Cruise in the Pacific Ocean (WOCE Section P10, 100593 – 111093) • The International Intercomparison Exercise of Underway fCO2 Systems during the R/V Meteor Cruise 36/1 in the North Atlantic Ocean • Carbon Dioxide, Hydrographic, and Chemical Data Obtained during the R/V Meteor Cruise 22/5 in the South Atlantic Ocean (WOCE Section A10, Dec. 1992-Jan, 1993) • Carbon Dioxide, Hydrographic, and Chemical Data Obtained in the South Pacific Ocean (WOCE Sections P16A/P17A, P17E/P19S, and P19C, R/V Knorr , Oct. 1992-April 1993) • Surface Water and Atmospheric Underway Carbon Data Obtained During the World Ocean Circulation Experiment Indian Ocean Survey Cruises (R/V Knorr, Dec. 1994 – Jan, 1996) • Carbon Dioxide, Hydrographic, and Chemical Data Obtained During the R/V Akademik Ioffe Cruise in the South Pacific Ocean (WOCE Section S4P, Feb.-April 1992) • Carbon Dioxide, Hydrographic, and Chemical Data Obtained During the R/V Thomas Washington Cruise TUNES-1 in the Equatorial Pacific Ocean (WOCE section P17C) • Carbon Dioxide, Hydrographic, and Chemical Data Obtained During the R/V Thomas Washington Cruise TUNES-3 in the Equatorial Pacific Ocean (WOCE section P16C) • Carbon-14 Measurements in Surface Water CO2 from the Atlantic, Indian and Pacific Oceans, 1965-1994 • Carbon Dioxide, Hydrographic, and Chemical Data Obtained During R/V Meteor Cruise 18/1 in the North Atlantic Ocean (WOCE Section A1E) • 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 • Total Carbon Dioxide, Hydrographic, and Nitrate Measurements in the Southwest Pacific during Austral Autumn, 1990: Results from NOAA/PMEL CGC-90 Cruise • Carbon Dioxide, Hydrographic, and Chemical Data Obtained During the R/V Meteor Cruise 15/3 in the South Atlantic Ocean (WOCE Section A9, February March 1991) • Carbon Dioxide Concentrations in Surface Water and the Atmosphere During 1986-1989 NOAA/PMEL Cruises in the Pacific and Indian Oceans • Carbon Dioxide, Hydrographic, and Chemical Data Obtained During the R/V Meteor Cruise 11/5 in the South Atlantic and Northern Weddell Sea Areas (WOCE sections A-12 and A-21) • Surface Water and Atmospheric Carbon Dioxide and Nitrous Oxide Observations by Shipboard Automated Gas Chromatography: Results from Expeditions Between 1977 and 1990 • Indian Ocean Radiocarbon: Data from the INDIGO 1, 2, and 3 Cruises • Carbonate Chemistry of the North Pacific Ocean • Carbonate Chemistry of the Weddell Sea • GEOSECS Atlantic, Pacific, Indian, and Mediterranean Radiocarbon Data •\tTransient Tracers in the Oceans (TTO) - Hydrographic Data and Carbon Dioxide Systems with Revised Carbon Chemistry Data.

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

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

  8. NREL: Transmission Grid Integration - FESTIV Model

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

    FESTIV Model Graph of real-time balance of electrical supply and demand. Real-time balance of electrical supply (generation) and demand (load). Graph of distribution of electrical supply and demand mismatch. Distribution of the mismatch between the electrical supply and demand (area control error, or ACE). Graph of real-time prices as determined by FESTIV. Real-time prices (locational marginal prices) as calculated by FESTIV. The Flexible Energy Scheduling Tool for Integrating Variable

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

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

  11. Alternative Fuels Data Center: Maps and Data

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

    ... at the National Renewable Energy Laboratory. View Image Graph Generatedthumb20150619-21703-z84lxx U.S. Biodiesel Production, Exports, and Consumption Generatedthumb20150619-21...

  12. Applying Best Practices to Florida Local Government Retrofit...

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

    Improvement levels correlated more closely with whole-house effciency levels (see graph), which refect home improvements and replacements, than vintage of homes. Phase 1 HERS Index ...

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

  14. Shoshani.NERSC.wkshop.pptx

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

    removing IO bottleneck * Accelerating efficiency of access - data structures, indexing * ... for visualization * Generating graphs, contour plots, parallel-coordinate plots, 3D ...

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

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

  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. Multivariate Spatio-Temporal Clustering of Times-Series Data...

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

    ... The area change graph in Figure 2 could show trends in cloud and climate states from Atmospheric Radiation Measurements (ARMs) long time series measurements. When measurements are ...

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

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

  1. Fact #636: August 16, 2010 Transportation Energy Use by Mode...

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

    Transportation Energy Use by Mode, 2008 Bar graph showing the transportation energy use by mode (buses, rail, pipeline, water, air, mediumheavy trucks, and light vehicles) for ...

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

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

    Household Gasoline Expenditures by Income Quintile Bar graph showing the household gasoline expenditures by income quintile in the years 1989, 1997, and 2007. For more detailed ...

  3. ARM - Lesson Plans: Why is it Hotter at the Equator?

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

    Black construction paper (one sheet per group of students) Stapler Several books to prop thermometers Metric ruler Scissors Graph paper Small ruler Pencil Important Points to...

  4. Fact #624: May 24, 2010 Corporate Average Fuel Economy Standards...

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

    For more detailed information, see supporting information below. Final MY 2011-2016 Light Truck Fuel Economy Targets Line graph showing the fuel economy targets for light trucks ...

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

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

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

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

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

  12. Fact #920: April 11, 2016 Electric Charging Stations are the...

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

    The other fuel types (biodiesel, liquefied natural gas (LNG) and hydrogen) altogether have ... Graph showing alternative fueling stations by futel type (E85, CNG, Biodiesel, Hydrogen, ...

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

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

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

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

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

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

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

  20. MONUMENT VALLEY

    Office of Legacy Management (LM)

    contaminated groundwater movement? There is no indication of unexpected contaminated ground water movement. Time versus concentration graphs for nitrate and uranium from...

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

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

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

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

    Equipment (check) 12. Other Equipment (check) 13. If Audio Recording Requested, DOE Br. ... No Projection Services Required Projectors (vu-graph) Projectors: 35mm Audio Tape Player ...

  4. 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 05/11/15 05/09/16 05/02/16 04/25/16 04/18/16 04/11/16 04/04/16 03/28/16 U.S. 2.691 2.220 2.240 2.162 2.137 2.069 2.083

  5. Press Room - Events - U.S. Energy Information Administration...

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

    Higher Oregon renewable portfolio standard targets likely to boost wind power graph of Oregon renewable portfolio standard requirements, as explained in the article text See More ...

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

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

  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. ARM - Lesson Plans: Plant Growth and Carbon Dioxide

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

    air affects plant growth. Materials Each group of students will need the following: Graph paper Pencil and pen Ruler Important Points to Understand All animals, including humans,...

  10. 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 Alkalinity below the deepest winter mixed layer depths Carbon Dioxide, Hydrographic, and Chemical Data Obtained During the R/V John V. Vickers Cruise in the Pacific Ocean (WOCE Section P13, NOAA CGC92 Cruise, 080492 102192) Carbon Dioxide, Hydrographic, and Chemical Data Obtained During the R/V Hesperides Cruise in the Atlantic Ocean (WOCE Section A5, 071492 - 081592) Carbon Dioxide, Hydrographic, and Chemical Data Obtained During the R/V Thomas G. Thompson Cruise in the Pacific Ocean (WOCE Section P10, 100593 111093) The International Intercomparison Exercise of Underway fCO2 Systems during the R/V Meteor Cruise 36/1 in the North Atlantic Ocean Carbon Dioxide, Hydrographic, and Chemical Data Obtained during the R/V Meteor Cruise 22/5 in the South Atlantic Ocean (WOCE Section A10, Dec. 1992-Jan, 1993) Carbon Dioxide, Hydrographic, and Chemical Data Obtained in the South Pacific Ocean (WOCE Sections P16A/P17A, P17E/P19S, and P19C, R/V Knorr , Oct. 1992-April 1993) Surface Water and Atmospheric Underway Carbon Data Obtained During the World Ocean Circulation Experiment Indian Ocean Survey Cruises (R/V Knorr, Dec. 1994 Jan, 1996) Carbon Dioxide, Hydrographic, and Chemical Data Obtained During the R/V Akademik Ioffe Cruise in the South Pacific Ocean (WOCE Section S4P, Feb.-April 1992) Carbon Dioxide, Hydrographic, and Chemical Data Obtained During the R/V Thomas Washington Cruise TUNES-1 in the Equatorial Pacific Ocean (WOCE section P17C) Carbon Dioxide, Hydrographic, and Chemical Data Obtained During the R/V Thomas Washington Cruise TUNES-3 in the Equatorial Pacific Ocean (WOCE section P16C) Carbon-14 Measurements in Surface Water CO2 from the Atlantic, Indian and Pacific Oceans, 1965-1994 Carbon Dioxide, Hydrographic, and Chemical Data Obtained During R/V Meteor Cruise 18/1 in the North Atlantic Ocean (WOCE Section A1E) 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 Th

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

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

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

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

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

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

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

    DOE Patents [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.

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

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

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

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

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

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

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

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

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

  7. Alternative Fuels Data Center: Maps and Data

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

    ... TransAtlas is part of a suite of geographic analysis tools for renewable energy developed ... Vehicle-class-chart Last update June 2012 View Image Graph Fuel Consumption and Efficiency ...

  8. Understanding Radioactive Waste Raymond L. Murray, Professor...

    Office of Scientific and Technical Information (OSTI)

    ... The Media Institute. Washington. D.C.. March 1980. A mono- graph consisting of a discussion with Robert L. DuPont. M.D .. a psychiatrist. He viewed many hours of video tapes of ...

  9. Comparing Clouds Using Cloud Radar

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

    Year Weight (kg) 1998 102 1999 104 2000 98 2001 91 2002 86 1. Now you will need to draw the axes of your graph. These are lines that tell you where to put information. On the...

  10. This is the Title Slide Arial 32 pt

    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 contract 2 graph Crude oil futures price contract 3 graph Crude oil futures price contract 4 graph Crude oil futures and estimated contract prices (dollars per barrel)more price data › Year ago Most recent 05/08/15 05/06/16 04/29/16 04/22/16 04/15/16 04/08/16 04/01/16 03/25/16 Contract 1 59.39 44.66 45.92 43.73 40.36

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

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

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

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

  15. Fact #807: December 9, 2013 Light Vehicle Weights Leveling Off

    Broader source: Energy.gov [DOE]

    The effect of the oil crisis in the mid-1970s and subsequent rise of smaller import vehicles is evident in the graph below, showing a dramatic fall in average vehicle weight from model years 1975...

  16. California Maritime Academy: Technical Design Report

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

    ... This would minimize the need to regulate the wind turbine for maximum power. The graph b elow helps to d escribe the interaction b etween t he motor and w ind t urbine. Figure 7--- ...

  17. Fact #634: August 2, 2010 Off-highway Transportation-related...

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

    Nearly all of the alternative fuel used in off-highway equipment is consumed by forklifts. Off-highway Transportation-related Fuel Consumption, 2008 Bar graph showing the 2008 ...

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

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

  20. Weekly Petroleum Status Report

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

    Note: See Appendix B, Technical Note 3, for more information about the data in this table. ... Note: See Appendix B, Technical Note 4, for more information about the data in this graph. ...

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

  2. 2007 CBECS Large Hospital Building FAQs: 2003-2007 Comparison...

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

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

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

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

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

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

  8. Lesson Plan

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

    respond to growth, is a matter of conjecture and will vary from place to place. Key Vocabulary * Bar graph or bar chart: a chart with rectangular bars with lengths proportional to...

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

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

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

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

  13. Solar Background Document 6 | Department of Energy

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

    6 Solar Background Document 6 Graph illustrating solar cell production in the United States and China from 2002 to 2010. PDF icon Solar Background Document 6.pdf More Documents & ...

  14. Fact #617: April 5, 2010 Changes in Vehicles per Capita around the World

    Broader source: Energy.gov [DOE]

    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 2008. The points labeled on...

  15. Quadrennial Energy Review comments

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

    up overnight. This same growth can be seen in Basin Electric's load forecast as well. (2 nd slide) The graph demonstrates the significant growth associated with the Bakken. Basin...

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

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

  18. L3:VUQ.SAUQ.P3.01 Hany Abdel-Khalik NCSU

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

    in 9 different mixtures. The reference responses are shown in Fig. 2. Each section on the graph represents the responses in 44-group in the respective mixture. The absolute...

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

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

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

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

  3. Fact #594: October 26, 2009 Fuel Economy and Annual Fuel Cost Ranges for Vehicle Classes

    Broader source: Energy.gov [DOE]

    The graph below shows the range of the lowest and highest fuel economy for each vehicle class, along with the lowest and highest annual fuel cost (in parentheses). For example, the two-seater model...

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

  5. Fact #606: January 18, 2010 New Vehicles Trend Toward Smaller Engines

    Broader source: Energy.gov [DOE]

    In 2008, the number of 4-cylinder engine installations rose to 57% of all cars manufactured in that year. The graph below shows that the cars produced in 1999 and 2003 were very close to the same...

  6. ASC eNews Quarterly Newsletter December 2012 | National Nuclear...

    National Nuclear Security Administration (NNSA)

    ... The system also was No. 1 on the Green 500, as the world's most energy efficient computer, and No. 1 on the Graph 500, a measure of the ability to solve big data problems-finding ...

  7. Solar Background Document 5 | Department of Energy

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

    5 Solar Background Document 5 Graph illustrating Chinese Development Bank financing to Chinese solar companies. PDF icon Solar Background Document 5.pdf More Documents & Publications Solar Background Document 7 National Solar Jobs Census 2014 Solar Background Document 4

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

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

    Office of Energy Efficiency and Renewable Energy (EERE)

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

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

    Office of Energy Efficiency and Renewable Energy (EERE)

    The price of gasoline is one factor that can have an effect on the number of highway vehicle miles traveled (VMT). The graph below shows a three-month moving average of the percentage change of...

  11. Fact #584: August 17, 2009 The Price of Gasoline and Vehicle Travel: How Do They Relate?

    Office of Energy Efficiency and Renewable Energy (EERE)

    The price of gasoline is one factor that can have an effect on the number of highway vehicle miles traveled (VMT). The graph below shows a three-month moving average of the percentage change of...

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

  13. Weekly Petroleum Status Report

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

    Fuel Prices, January 2015 to Present Note: See Appendix B, Weekly Petroleum Price Surveys, page 40 for more information about the data in this graph. Source: See page 30....

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

    Broader source: Energy.gov [DOE]

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

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

    Broader source: Energy.gov [DOE]

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

  16. Fact #745: September 17, 2012 Vehicles per Thousand People: U.S. Compared to Other Countries

    Broader source: Energy.gov [DOE]

    The graphs below show the number of motor vehicles per thousand people for various countries. The data for the United States are displayed in the line which goes from 1900 to 2010. The points...

  17. Fact #841: October 6, 2014 Vehicles per Thousand People: U.S. vs. Other World Regions

    Broader source: Energy.gov [DOE]

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

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

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

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

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

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

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

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

  7. Ping Pong Ball Anemometers

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

    * Learning Goal(s) Students will be able to construct and calibrate an anemometer to measure wind speed. They will be able to create a graph and an equation of Angle vs. Wind Speed...

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  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. Network topology mapper

    DOE Patents [OSTI]

    Quist, Daniel A. (Los Alamos, NM); Gavrilov, Eugene M. (Los Alamos, NM); Fisk, Michael E. (Jemez, NM)

    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.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  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. Critical Configurations of Hard Disks on the Torus

    Energy Science and Technology Software Center (OSTI)

    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.

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

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

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

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

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

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

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

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

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

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

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

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

  17. 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 matrix-vector multiplication can be performed locally on each processor and hence to minimize communication. Furthermore, a good graph partitioning scheme ensures the equal amount of computation performed on each processor. Graph partitioning is a well known NP-complete problem, and thus the most commonly used graph partitioning algorithms employ some forms of heuristics. These algorithms vary in terms of their complexity, partition generation time, and the quality of partitions, and they tend to trade off these factors. A significant challenge we are currently facing at the Lawrence Livermore National Laboratory is how to partition very large meshes on massive-size distributed memory machines like IBM BlueGene/P, where scalability becomes a big issue. For example, we have found that the ParMetis, a very popular graph partitioning tool, can only scale to 16K processors. An ideal graph partitioning method on such an environment should be fast and scale to very large meshes, while producing high quality partitions. This is an extremely challenging task, as to scale to that level, the partitioning algorithm should be simple and be able to produce partitions that minimize inter-processor communications and balance the load imposed on the processors. Our goals in this work are two-fold: (1) To develop a new scalable graph partitioning method with good load balancing and communication reduction capability. (2) To study the performance of the proposed partitioning method on very large parallel machines using actual data sets and compare the performance to that of existing methods. The proposed method achieves the desired scalability by reducing the mesh size. For this, it coarsens an input mesh into a smaller size mesh by coalescing the vertices and edges of the original mesh into a set of mega-vertices and mega-edges. A new coarsening method called brick algorithm is developed in this research. In the brick algorithm, the zones in a given mesh are first grouped into fixed size blocks called bricks. These brick are then laid in a way similar to conventional brick layin

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

    The illicit trafficking of strategic nuclear commodities (defined here as the goods needed for a covert nuclear program excluding special nuclear materials) poses a significant challenge to the international nuclear nonproliferation community. Export control regulations, both domestically and internationally, seek to inhibit the spread of strategic nuclear commodities by restricting their sale to parties that may use them for nefarious purposes. However, export controls alone are not sufficient for preventing the illicit transfer of strategic nuclear goods. There are two major pitfalls to relying solely on export control regulations for the deterrence of proliferation of strategic goods. First, export control enforcement today relies heavily on the honesty and willingness of participants to adhere to the legal framework already in place. Secondly, current practices focus on the evaluation of single records which allow for the necessary goods to be purchased separately and hidden within the thousands of legitimate commerce transactions that occur each day, disregarding strategic information regarding several purchases. Our research presents two preliminary data-centric approaches for investigating procurement networks of strategic nuclear commodities. Pacific Northwest National Laboratory (PNNL) has been putting significant effort into nonproliferation activities as an institution, both in terms of the classical nuclear material focused approach and in the examination of other strategic goods necessary to implement a nuclear program. In particular, the PNNL Signature Discovery Initiative (SDI) has codified several scientific methodologies for the detection, characterization, and prediction of signatures that are indicative of a phenomenon of interest. The methodologies and tools developed under SDI have already been applied successfully to problems in bio-forensics, cyber security and power grid balancing efforts and they have now made the nonproliferation of 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.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  13. EIA Open Data - Intro - U.S. Energy Information Administration (EIA)

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

    Open Data Introduction Register Register Forgot Your API Key? API Terms of Service API Browser API Documentation Query overview Series Query Geoset Query Relation Query Category Query Series Categories Query Updates Data Query Search Data Query Excel Add-In Download / Overview User Guide Installation Instructions Release Notes FAQs Embed Graphs & Maps Bulk Data Files The U.S. Energy Information Administration is committed to enhancing the value of its free and open data by making it

  14. Biomass Feedstocks | Bioenergy | NREL

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

    Feedstocks Our mission is to enable the coordinated development of biomass resources and conversion technologies by understanding the field-to-fuel impact of feedstocks on biochemical and thermochemical processes. A line graph showing the simulated distillation results of upgraded oils, divided into three sections: gasoline fraction, jet fraction, and #2 diesel fraction. The y-axis shows the mass % recovered (from 0 to 100) and the x-axis shows the distillation temperature in degrees Celsius

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

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

  17. Energy Landscapes: From Protein Folding to Molecular Assembly

    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

  18. NREL: Measurements and Characterization - Capacitance Techniques

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

    Capacitance Techniques Deep-level transient spectroscopy generated graph showing six defect levels; DLTS signal (Y-axis) versus Temperature (X-axis). DLTS characterizes defect levels to assist in identification of impurities and potential recombination centers. Capacitance techniques monitor the movement of electronic charge within a semiconductor device and provide a measure of free-carrier and electrically active defect-state properties. Capacitance is the charge storage capacity and is

  19. NREL: Measurements and Characterization - Computational Modeling

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

    Computational Modeling Graphic of a computational modeling graph Computational modeling sheds light how grain-boundary charge can affect solar cell current collection. The National Renewable Energy Laboratory (NREL) is making advances in computational modeling. Previous technology was limited to one-dimensional solar cell models and focused on current-voltage curves and quantum-efficiency spectra. NREL has advanced this technology to two-dimensional solar cell models, and expanded modeling

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

  1. NREL: Transmission Grid Integration - Solar Integration National Dataset

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

    Toolkit Integration National Dataset Toolkit The Solar Integration National Dataset (SIND) Toolkit enables researchers to perform regional solar generation integration studies by providing modeled, coherent sub-hour solar power data, information, and tools. Sub-hour solar power data are used in the Western Wind and Solar Integration Study Phase 2 and the Eastern Renewable Generation Integration Study. Graph of global horizontal irradiance for July 7, 2008. Over the course of the day,

  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. EIA Open Data - Excel - U.S. Energy Information Administration (EIA)

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

    Open Data Introduction Register Register Forgot Your API Key? API Terms of Service API Browser API Documentation Query overview Series Query Geoset Query Relation Query Category Query Series Categories Query Updates Data Query Search Data Query Excel Add-In Download / Overview User Guide Installation Instructions Release Notes FAQs Embed Graphs & Maps Bulk Data Files U.S. Energy Information Administration (EIA) Excel Data Add-In Download the EIA Data Add-In for Microsoft Excel for Windows By

  4. NREL: Energy Storage - Energy Storage Systems Evaluation

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

    Energy Storage Systems Evaluation Photo of man standing between two vehicles and plugging the vehicle on the right into a charging station. NREL system evaluation has confirmed that extreme climates can have a dramatic impact on batteries and energy storage systems. Graph with numerous plots showing battery capacity and resistance with drive time data spanning a two-year period. An NREL algorithm is being used to extract battery state-of-health information and degradation trends from BMW Mini-E

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

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

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

  8. 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 quark/down quark contributions Researchers have published intriguing new observations for how the different kinds of quarks behave inside protons and neutrons. In the proton, the down quark contributes surprisingly little to electron-proton interaction. Also, the up quark contributes much less to electron-neutron interaction than one would expect if all three quarks behaved in similar ways. Quarks Pair Up in Protons (and Neutrons) Ordinarily,

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

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

    Parallel Performance Visualization on the Cray XT4 Luiz DeRose Programming 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 Time-line view * Communication * I/O Activity view Pair-wise communication statistics Text reports Source code mapping Cray Apprentice 2 is target to help identify and correct: * Load imbalance * Excessive communication * Network contention *

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

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

  12. Work with Us | Bioenergy | NREL

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

    Work with Us NREL provides partnerships and collaboration in the research and development of bioenergy including bio-based energy, fuels, and products. Woman in front of monitor displaying line graph in industrial facility; other workers in background. Leverage the expertise of our research staff and the efficiency of working in our world-class facilities. Contact Us Robert Baldwin Partnership and Business Development Email | 303-384-6858 Richard Bolin Partnership and Business Development Email

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

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

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

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

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

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

    2015-02-01

    A graph is chordal if every cycle of length greater than three 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’ parallelizability. Inmore » this 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. 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

  1. About EIA - Policies - U.S. Energy Information Administration (EIA)

    Gasoline and Diesel Fuel Update (EIA)

    About EIA Copyrights and Reuse Public domain and use of EIA content U.S. government publications are in the public domain and are not subject to copyright protection. You may use and/or distribute any of our data, files, databases, reports, graphs, charts, and other information products that are on our website or that you receive through our email distribution service. However, if you use or reproduce any of our information products, you should use an acknowledgment, which includes the

  2. EIA's Energy in Brief: How is the fuel mix for U.S. electricity generation

    Gasoline and Diesel Fuel Update (EIA)

    Open Data Introduction Register Register Forgot Your API Key? API Terms of Service API Browser API Documentation Query overview Series Query Geoset Query Relation Query Category Query Series Categories Query Updates Data Query Search Data Query Excel Add-In Download / Overview User Guide Installation Instructions Release Notes FAQs Embed Graphs & Maps Bulk Data Files The U.S. Energy Information Administration is committed to enhancing the value of its free and open data by making it

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

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

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

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

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

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

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

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

  11. 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 different sets of physical parameters. A new stability as well as instability region, in the parameter space, appears due to the nonlinear effects.

  12. The Surprising Appearance of Nanotubular Fullerene D5h(1)-C90

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

    Department of Energy The Story of a House that Never Stayed Warm: A Well-Insulated Resolution The Story of a House that Never Stayed Warm: A Well-Insulated Resolution April 8, 2016 - 5:23pm Addthis Here is the energy usage graph from our most recent electricity bill. The months are displayed with the most recent first, reading from left to right along the x axis. We finished the upgrades in October, so you can see that the months before our upgrades were higher overall. Here is the energy

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

  14. Method and apparatus for diagnosing breached fuel elements

    DOE Patents [OSTI]

    Gross, Kenny C.; Lambert, John D. B.; Nomura, Shigeo

    1988-01-01

    The invention provides an apparatus and method for diagnosing breached fuel elements in a nuclear reactor. A detection system measures the activity of isotopes from the cover-gas in the reactor. A data acquisition and processing system monitors the detection system and corrects for the effects of the cover-gas clean up system on the measured activity and further calculates the derivative cure of the corrected activity as a function of time. A plotting system graphs the derivative curve, which represents the instantaneous release rate of fission gas from a breached fuel element.

  15. The relation of seismic activity and radon concentration

    SciTech Connect (OSTI)

    Kulali, Feride E-mail: iskender@fef.sdu.edu.tr; Akkurt, ?skender E-mail: iskender@fef.sdu.edu.tr; Vogiannis, Efstratios

    2014-10-06

    Radon, which is the largest source of natural ionizing radiation, reaches to surface as gas or dissolved form in the ground water. Emanation of radon can has a profile is disposed to increasing or decreasing depending on the effects of meteorological events or crust movements. In this work, the radon concentration in soil gas, which is transported from soil to AlphaGUARD, is continuously measured in Mytilene (Greece). A graph of radon concentration is prepared for comparison with simultaneous earthquake data. As a consequence of comparison, we determined that the radon concentration indicates anomalies before the earthquakes.

  16. Influence of heat and mass flux conditions in hydromagnetic flow of Jeffrey nanofluid

    SciTech Connect (OSTI)

    Abbasi, F. M.; Shehzad, S. A.; Hayat, T.; Alsaedi, A.; Obid, Mustafa A.

    2015-03-15

    This article explores the hydromagnetic steady flow of Jeffrey fluid in the presence of thermal radiation. The chosen nanofluid model takes into account the Brownian motion and thermophoresis effects. Flow and heat transfer characteristics are determined by a stretching surface with flux conditions. The nonlinear boundary layer flow through partial differential systems is converted into the ordinary differential systems. The resulting reduced systems are computed for the convergent solutions of velocity, temperature and nanoparticle concentration. Graphs of dimensionless temperature and nanoparticle concentration profiles are presented for different values of emerging parameters. Skin-friction coefficient are computed and analyzed in both hydrodynamic and hydromagnetic flow situations.

  17. Network interdiction with budget constraints

    SciTech Connect (OSTI)

    Santhi, Nankakishore; Pan, Feng

    2009-01-01

    Several scenarios exist in the modern interconnected world which call for efficient network interdiction algorithms. Applications are varied, including computer network security, prevention of spreading of Internet worms, policing international smuggling networks, controlling spread of diseases and optimizing the operation of large public energy grids. In this paper we consider some natural network optimization questions related to the budget constrained interdiction problem over general graphs. Many of these questions turn out to be computationally hard to tackle. We present a particularly interesting practical form of the interdiction question which we show to be computationally tractable. A polynomial time algorithm is then presented for this problem.

  18. Tomasz Kaczorowski | Center for Gas SeparationsRelevant to Clean Energy

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

    Today in Energy Glossary › FAQS › Home Browse by Tag Most Popular Tags liquid fuels electricity natural gas oil/petroleum states crude oil production prices international consumption generation coal renewable gasoline weather exports imports demand capacity forecast View All Tags › View Tag Cloud › Prices Archive About May 13, 2016 Carbon dioxide emissions from electricity generation in 2015 were lowest since 1993 graph of carbon dioxide emissions from the U.S. electric power sector by

  19. Photon Source Parameters

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

    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 can be used in a variety

  20. Photon Source Parameters

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

    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 can be used in a variety

  1. Photon Source Parameters

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

    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 can be used in a variety

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

  3. zoltan2

    Energy Science and Technology Software Center (OSTI)

    2012-09-11

    Zoltan2 is a refactoring of the open-source Zoltan library that enables Zoltan users to take better advantage of current and emerging high performance computing architectures and software tools. Like Zoltan, Zoltan2 is a toolkit of combinatorial scientific computing algorithms that enable better performance of scientific codes via improved data locality and parallel scalability. Specifically Zoltan2 partitions data, colors graphs, and orders matrices. Zoltan2 is a software library written in template C++; it supports a widermore » range of data types and problem sizes than Zoltan. It will be available as part of Sandia's Trilinos framework of scientific computing packages.« less

  4. Trends Online: A Compendium of Data on Global Change

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

    Data records are presented in multipage formats, each dealing with a specific site, region, or emissions species. The data records include tables; graphs; discussions of methods for collecting, measuring, and reporting the data; trends in the data, and references to literature providing further information. Instructions for citing specific data in Trends Online are provided for each compiled data set. All data appearing in Trends Online are available, on request, on digital media from CDIAC at no cost. [Copied from the Abstract to Trends Online at http://cdiac.ornl.gov/trends/abstract.htm

  5. Recent developments in graphite. [Use in HTGR and aerospace

    SciTech Connect (OSTI)

    Cunningham, J.E.

    1983-01-01

    Overall, the HTGR graphite situation is in excellent shape. In both of the critical requirements, fuel blocks and support structures, adequate graphites are at hand and improved grades are sufficiently far along in truncation. In the aerospace field, GraphNOL N3M permits vehicle performance with confidence in trajectories unobtainable with any other existing material. For fusion energy applications, no other graphite can simultaneously withstand both extreme thermal shock and neutron damage. Hence, the material promises to create new markets as well as to offer a better candidate material for existing applications.

  6. New Solar Cell Is More Efficient, Less Costly - News Feature | NREL

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

    New Solar Cell Is More Efficient, Less Costly November 8, 2013 In this photo, a researcher in glasses holds a solar wafer about the size of a CD case. In the background are two computer screens displaying graphs of the performance of similar wafers. Enlarge image NREL Principal Scientist Mowafak Al-Jassim holds a TetraSun PV cell in the cathodoluminescence lab at NREL. The TetraSun cell combines increased efficiency and low cost, breaking the usual rules for solar cells. Credit: Dennis Schroeder

  7. DNSViz

    Energy Science and Technology Software Center (OSTI)

    2012-05-09

    The Domain Name System Security Extensions (DNSSEC) add authentication to the DNS. However, analyzing and troubleshooting a DNSSEC deployment is difficult in part because of the protocol complexity and in part because authentication involves retrieving dependent components from a number of different Internet locations. DNSViz was written to bring all these DNSSEC components together into a single graph, so they can be represented visually, and nuances can be highlighted for easy identification. DNSViz includes functionalitymore » for both analyzing a domain name using active probing and visual representation of the domain name, available currently through a Web interface.« less

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

  9. Enhanced oil recovery projects data base

    SciTech Connect (OSTI)

    Pautz, J.F.; Sellers, C.A.; Nautiyal, C.; Allison, E.

    1992-04-01

    A comprehensive enhanced oil recovery (EOR) project data base is maintained and updated at the Bartlesville Project Office of the Department of Energy. This data base provides an information resource that is used to analyze the advancement and application of EOR technology. The data base has extensive information on 1,388 EOR projects in 569 different oil fields from 1949 until the present, and over 90% of that information is contained in tables and graphs of this report. The projects are presented by EOR process, and an index by location is provided.

  10. ENDF-related Nuclear Data from the T-2 Group (T-2 Nuclear Information Service) at Los Alamos National Laboratory (LANL)

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

    Each of these sections of the website is an index to the contents of the specifically named ENDF/B-VII library of data. Links in each index provide access to more information about the individual materials, including raw and interpreted views of the ENDF file, and PDF plots of the cross sections and distributions. Also provided is a section of information and graphs related to the Energy Balance of ENDF/B-VII and table of neutron Kerma data. [Information taken from http://t2.lanl.gov/data/data.html

  11. Method to prevent sulfur accumulation in membrane electrode assembly

    DOE Patents [OSTI]

    Steimke, John L; Steeper, Timothy J; Herman, David T

    2014-04-29

    A method of operating a hybrid sulfur electrolyzer to generate hydrogen is provided that includes the steps of providing an anolyte with a concentration of sulfur dioxide, and applying a current. During steady state generation of hydrogen a plot of applied current density versus concentration of sulfur dioxide is below a boundary line. The boundary line may be linear and extend through the origin of the graph with a slope of 0.001 in which the current density is measured in mA/cm2 and the concentration of sulfur dioxide is measured in moles of sulfur dioxide per liter of anolyte.

  12. #LabChat: Market Potential of Energy Efficient Technology, May 31 at 2 pm

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

    EDT | Department of Energy Market Potential of Energy Efficient Technology, May 31 at 2 pm EDT #LabChat: Market Potential of Energy Efficient Technology, May 31 at 2 pm EDT May 30, 2012 - 10:22am Addthis National Renewable Energy Laboratory engineer Eric Kozubal examines a prototype air flow channel of the DEVAP, a novel concept that uses membrane technology to combine the efficiency of evaporative cooling and the drying potential of liquid desiccant salt solutions. The graph superimposed on

  13. A Module for Graphical Display of Model Results with the CBP Toolbox

    SciTech Connect (OSTI)

    Smith, F.

    2015-04-21

    This report describes work performed by the Savannah River National Laboratory (SRNL) in fiscal year 2014 to add enhanced graphical capabilities to display model results in the Cementitious Barriers Project (CBP) Toolbox. Because Version 2.0 of the CBP Toolbox has just been released, the graphing enhancements described in this report have not yet been integrated into a new version of the Toolbox. Instead they have been tested using a standalone GoldSim model and, while they are substantially complete, may undergo further refinement before full implementation. Nevertheless, this report is issued to document the FY14 development efforts which will provide a basis for further development of the CBP Toolbox.

  14. Energy Literacy Social Studies Guides

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

    Where does our food come from? Energy Literacy Essential Principle 3: Biological processes depend on energy flow through the Earth system. C3 Framework for Social Studies Focus Indicators D1: Identify facts and concepts associated with a supporting question. (D1.3.K-2) D2: Use maps, graphs, photographs, and other representations to describe places and the relationships and interactions that shape them. (D2.Geo.2.K-2) D3: Gather relevant information from one or two sources while using the origin

  15. Method and apparatus for diagnosing breached fuel elements

    DOE Patents [OSTI]

    Gross, K.C.; Lambert, J.D.B.; Nomura, S.

    1987-03-02

    The invention provides an apparatus and method for diagnosing breached fuel elements in a nuclear reactor. A detection system measures the activity of isotopes from the cover gas in the reactor. A data acquisition and processing system monitors the detection system and corrects for the effects of the cover-gas clean up system on the measured activity and further calculates the derivative curve of the corrected activity as a function of time. A plotting system graphs the derivative curve, which represents the instantaneous release rate of fission gas from a breached fuel element. 8 figs.

  16. Compartmentalization analysis using discrete fracture network models

    SciTech Connect (OSTI)

    La Pointe, P.R.; Eiben, T.; Dershowitz, W.; Wadleigh, E.

    1997-08-01

    This paper illustrates how Discrete Fracture Network (DFN) technology can serve as a basis for the calculation of reservoir engineering parameters for the development of fractured reservoirs. It describes the development of quantitative techniques for defining the geometry and volume of structurally controlled compartments. These techniques are based on a combination of stochastic geometry, computational geometry, and graph the theory. The parameters addressed are compartment size, matrix block size and tributary drainage volume. The concept of DFN models is explained and methodologies to compute these parameters are demonstrated.

  17. SolTrace Optical Analysis Software

    Energy Science and Technology Software Center (OSTI)

    2001-12-31

    SolTrace is a software package that models solar power optical systems and analyzes their performance. SolTrace can model parabolic trough collectors, point-focus concentrating systems, and power towers. It rapidly displays and saves data as scatter plots, flux maps, and performance graphs. SolTrace can model optical geometry as a series of stages, composed of optical elements that possess attributes such as shape, contour, and optical quality. It can also model any number of stages containing anymore » number of different elements, and it features an extensive variety of available shapes and contours.« less

  18. Green synthesis and characterization of silver nanoparticle using Aloe barbadensis

    SciTech Connect (OSTI)

    Thappily, Praveen E-mail: shiiuvenus@gmail.com; Shiju, K. E-mail: shiiuvenus@gmail.com

    2014-10-15

    Green synthesis of silver nanoparticles was achieved by simple visible light irradiation using aloe barbadensis leaf extract as reducing agent. UV-Vis spectroscopic analysis was used for confirmation of the successful formation of nanoparticles. Investigated the effect of light irradiation time on the light absorption of the nanoparticles. It is observed that upto 25 minutes of light irradiation, the absorption is linearly increasing with time and after that it becomes saturated. Finally, theoretically fitted the time-absorption graph and modeled a relation between them with the help of simulation software.

  19. Automated next-to-leading order predictions for new physics at the LHC: The case of colored scalar pair production

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

    Degrande, Céline; Fuks, Benjamin; Hirschi, Valentin; Proudom, Josselin; Shao, Hua -Sheng

    2015-05-05

    We present for the first time the full automation of collider predictions matched with parton showers at the next-to-leading accuracy in QCD within nontrivial extensions of the standard model. The sole inputs required from the user are the model Lagrangian and the process of interest. As an application of the above, we explore scenarios beyond the standard model where new colored scalar particles can be pair produced in hadron collisions. Using simplified models to describe the new field interactions with the standard model, we present precision predictions for the LHC within the MadGraph5_aMC@NLO framework.

  20. Matching next-to-leading order predictions to parton showers in supersymmetric QCD

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

    Degrande, Céline; Fuks, Benjamin; Hirschi, Valentin; Proudom, Josselin; Shao, Hua-Sheng

    2016-02-03

    We present a fully automated framework based on the FeynRules and MadGraph5_aMC@NLO programs that allows for accurate simulations of supersymmetric QCD processes at the LHC. Starting directly from a model Lagrangian that features squark and gluino interactions, event generation is achieved at the next-to-leading order in QCD, matching short-distance events to parton showers and including the subsequent decay of the produced supersymmetric particles. As an application, we study the impact of higher-order corrections in gluino pair-production in a simplified benchmark scenario inspired by current gluino LHC searches.

  1. NREL: Transportation Research - A Vision for Sustainable Transportation

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

    A Vision for Sustainable Transportation NREL research, development, and deployment accelerates the process of bringing sustainable transportation technologies to market. Line graph illustrating three pathways to reduce transportation energy use and greenhouse gas (GHG) emissions, with "energy consumption of vehicles" along the y-axis (ranging from 0 to 2.0 kWh/km) and "carbon intensity of energy source" along the x-axis (ranging from 450 to 0 g CO2/kWh). A solid bottom line

  2. Hydrogen recombiner catalyst test supporting data

    SciTech Connect (OSTI)

    Britton, M.D.

    1995-01-19

    This is a data package supporting the Hydrogen Recombiner Catalyst Performance and Carbon Monoxide Sorption Capacity Test Report, WHC-SD-WM-TRP-211, Rev 0. This report contains 10 appendices which consist of the following: Mass spectrometer analysis reports: HRC samples 93-001 through 93-157; Gas spectrometry analysis reports: HRC samples 93-141 through 93-658; Mass spectrometer procedure PNL-MA-299 ALO-284; Alternate analytical method for ammonia and water vapor; Sample log sheets; Job Safety analysis; Certificate of mixture analysis for feed gases; Flow controller calibration check; Westinghouse Standards Laboratory report on Bois flow calibrator; and Sorption capacity test data, tables, and graphs.

  3. Low-cost Batch Solar Water Heater research and development project. Final report

    SciTech Connect (OSTI)

    Stickney, B.L.

    1983-06-01

    This report presents a summary of the development and testing of Batch Solar Water Heaters. Batch Heaters tested include several kinds of tank-under-glass (Breadbox) models and several types of Inverted Batch Solar Water Heaters with both fixed and moveable reflector systems. Temperature graphs and tables of performance indices are presented for each water heater tested. An Inverted Batch Water Heater was developed based upon the test results called the Bottomgainer. Two prototypes of the Bottomgainer model were installed and monitored in use on residences. The Bottomgainer concept could be adapted to commercial production.

  4. Optimizing Performance

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

    Optimizing Performance Optimizing Performance Storage Optimization Optimizing the sizes of the files you store in HPSS and minimizing the number of tapes they are on will lead to the most effient use of NERSC HPSS: File sizes of about 1 GB or larger will give the best network performance (see graph below) Files sizes greater than about 500 GB can be more difficult to work with and lead to longer transfer times. Files larger than 15 TB cannot be uploaded to HPSS. Aggregate groups of small files

  5. Department of Energy Names Virginia and Illinois Electric Cooperatives Wind

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

    Co-ops of the Year | Department of Energy Department of Energy Names Virginia and Illinois Electric Cooperatives Wind Co-ops of the Year Department of Energy Names Virginia and Illinois Electric Cooperatives Wind Co-ops of the Year 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 Association (NRECA) recognized Old Dominion Electric Cooperative (ODEC) of Virginia and the

  6. Low-mass helium star models for type Ib supernovae - Light curves, mixing, and nucleosynthesis

    SciTech Connect (OSTI)

    Shigeyama, Toshikazu; Nomoto, Kenichi; Tsujimoto, Takuji; Hashimoto, Masaki (Tokyo Univ. (Japan) Kyushu Univ., Fukuoka (Japan))

    1990-09-01

    The applicability of theoretical models of He-star explosions to type Ib SN explosions is explored. Particular attention is given to light curves and mixing, Rayleigh-Taylor instabilities and mixing, and nucleosynthesis and the mass of Ni-56. Typical numerical results are presented in graphs, and it is concluded that the explosions of SN 1983N and SN 1983I can be accurately represented in terms of explosions of He stars with M(alpha) of 3-4 solar mass. A strong M(alpha) dependence of light-curve shape, photospheric velocity, and Ni-56 mass is found. 44 refs.

  7. Photon Source Parameters

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

    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 can be used in a variety

  8. Photon Source Parameters

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

    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 can be used in a variety

  9. Photon Source Parameters

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

    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 can be used in a variety

  10. Beneficial use of coal combustion products continues to grow

    SciTech Connect (OSTI)

    MacDonald, M.

    2008-07-01

    In August 2007 the American Coal Ash Association (ACAA) released results of the Coal Combustion Products Production (CCP) and use survey. Production was 124,795,000 tons while beneficial use was 54,203,000 tons, a utilization rate of over 43%, 3% higher than in 2005. The article includes graphs of 40 years of CCP production and use and projected trade of CCP utilization until 2011. It also gives 2006 figures for Production and use of fly ash, bottom ash, boiler slag, FGD gypsum and other FGD products, and FBC ash. 3 refs., 3 figs.

  11. GLAST (FERMI) Data-Processing Pipeline

    SciTech Connect (OSTI)

    Flath, Daniel L.; Johnson, Tony S.; Turri, Massimiliano; Heidenreich, Karen A.; /SLAC

    2011-08-12

    The Data Processing Pipeline ('Pipeline') has been developed for the Gamma-Ray Large Area Space Telescope (GLAST) which launched June 11, 2008. It generically processes graphs of dependent tasks, maintaining a full record of its state, history and data products. The Pipeline is used to automatically process the data down-linked from the satellite and to deliver science products to the GLAST collaboration and the Science Support Center and has been in continuous use since launch with great success. The pipeline handles up to 2000 concurrent jobs and in reconstructing science data produces approximately 750GB of data products using 1/2 CPU-year of processing time per day.

  12. Measurements - Ion Beams - Radiation Effects Facility / Cyclotron Institute

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

    / Texas A&M University Ion Beams Available Beams / Beam Change Times / Measurements / Useful Graphs Measurements The beam uniformity and flux are determined using an array of five detectors. Each detector is made up with a plastic scintillator coupled to photo-multiplier tubes. Four of the detectors are fixed in position and set up to measure beam particle counting rates continuously at four characteristic points 1.64 inches (4.71 mm) away from the beam axis. The fifth scintillator can

  13. Approximate Weighted Matching On Emerging Manycore and Multithreaded Architectures

    SciTech Connect (OSTI)

    Halappanavar, Mahantesh; Feo, John T.; Villa, Oreste; Tumeo, Antonino; Pothen, Alex

    2012-11-30

    Graph matching is a prototypical combinatorial problem with many applications in computer science and scientific computing, but algorithms for computing optimal matchings are challenging to parallelize. Approximate matching algorithms provide an alternate route for parallelization, and in many contexts compute near-optimal matchings for large-scale graphs. We present sharedmemory parallel implementations for computing half-approximate weighted matching on state-of-the-art multicore (Intel Nehalem and AMD Magny-Cours), manycore (Nvidia Tesla and Nvidia Fermi) and massively multithreaded (Cray XMT) platforms. We provide two implementations: the first implementation uses shared work queues, and is suited to all these platforms; the second implementation is based on dataflow principles, and exploits the architectural features of the Cray XMT. Using a carefully chosen dataset that exhibits characteristics from a wide range of real-world applications, we show scalable performance across different platforms. In particular, for one instance of the input, an R-MAT graph (RMAT-G), we show speedups of: about 32 on 48 cores of an AMD Magny-Cours; 7 on 8 cores of Intel Nehalem; 3 on Nvidia Tesla and 10 on Nvidia Fermi relative to one core of Intel Nehalem; and 60 on 128 processors of Cray XMT. We demonstrate good weak and strong scaling for graphs with up to a billion edges using up to 12, 800 threads. Given the breadth of this work, we focus on simplicity and portability of software rather than excessive fine-tuning for each platform. To the best of our knowledge, this is the first such large-scale study of the half-approximate weighted matching problem on shared-memory platforms. Driven by the critical enabling role of combinatorial algorithms such as matching in scientific computing and the emergence of informatics applications, there is a growing demand to support irregular computations on current and future computing platforms. In this context, we evaluate the capability of emerging multithreaded platforms to tolerate latency induced by irregular memory access patterns, and to support fine-grained parallelism via light-weight synchronization mechanisms. By contrasting the architectural features of these platforms against the Cray XMT, which is specifically designed to support irregular memory-intensive applications, we delineate the impact of these choices on performance.

  14. Economic consequences of land surface subsidence

    SciTech Connect (OSTI)

    Fowler, L.C.

    1981-06-01

    Overdraft in the Santa Clara Valley, Calif., groundwater basin caused land surface subsidence over an area of 63,000 ha with a maximum depression of 3.6 m from 1912-67. Since cessation of overdraft and replenishment of groundwater levels in 1969, there has been no significant land surface subsidence. During the period of active subsidence, water well casings buckled, sewers lost capacity as a result of changes in slope, and roads and railroads had to be raised. These damages are estimated at over $130 million. (1 graph, 1 map, 6 photos, 2 references, 1 table)

  15. Text and Structural Data Mining of Influenza Mentions in Web and Social Media

    SciTech Connect (OSTI)

    Corley, Courtney D.; Cook, Diane; Mikler, Armin R.; Singh, Karan P.

    2010-02-22

    Text and structural data mining of Web and social media (WSM) provides a novel disease surveillance resource and can identify online communities for targeted public health communications (PHC) to assure wide dissemination of pertinent information. WSM that mention influenza are harvested over a 24-week period, 5-October-2008 to 21-March-2009. Link analysis reveals communities for targeted PHC. Text mining is shown to identify trends in flu posts that correlate to real-world influenza-like-illness patient report data. We also bring to bear a graph-based data mining technique to detect anomalies among flu blogs connected by publisher type, links, and user-tags.

  16. Automating Embedded Analysis Capabilities and Managing Software Complexity in Multiphysics Simulation, Part I: Template-Based Generic Programming

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

    Pawlowski, Roger P.; Phipps, Eric T.; Salinger, Andrew G.

    2012-01-01

    An approach for incorporating embedded simulation and analysis capabilities in complex simulation codes through template-based generic programming is presented. This approach relies on templating and operator overloading within the C++ language to transform a given calculation into one that can compute a variety of additional quantities that are necessary for many state-of-the-art simulation and analysis algorithms. An approach for incorporating these ideas into complex simulation codes through general graph-based assembly is also presented. These ideas have been implemented within a set of packages in the Trilinos framework and are demonstrated on a simple problem from chemical engineering.

  17. Transportation Energy Data Book, Edition 19

    SciTech Connect (OSTI)

    Davis, S.C.

    1999-09-01

    The Transportation Energy Data Book: Edition 19 is a statistical compendium prepared and published by Oak Ridge National Laboratory (ORNL) under contract with the Office of Transportation Technologies in the Department of Energy (DOE). Designed for use as a desk-top reference, the data book represents an assembly and display of statistics and information that characterize transportation activity, and presents data on other factors that influence transportation energy use. The purpose of this document is to present relevant statistical data in the form of tables and graphs. The latest editions of the Data Book are available to a larger audience via the Internet (http://www-cta.ornl.gov/data/tedb.htm).

  18. Multidimensional spectral load balancing

    SciTech Connect (OSTI)

    Hendrickson, B.; Leland, R.

    1993-01-01

    We describe an algorithm for the static load balancing of scientific computations that generalizes and improves upon spectral bisection. Through a novel use of multiple eigenvectors, our new spectral algorithm can divide a computation into 4 or 8 pieces at once. These multidimensional spectral partitioning algorithms generate balanced partitions that have lower communication overhead and are less expensive to compute than those produced by spectral bisection. In addition, they automatically work to minimize message contention on a hypercube or mesh architecture. These spectral partitions are further improved by a multidimensional generalization of the Kernighan-Lin graph partitioning algorithm. Results on several computational grids are given and compared with other popular methods.

  19. Workshop on the origin of the heavy elements: Astrophysical models and experimental challenges, Santa Fe, New Mexico, September 3-4, 1999

    SciTech Connect (OSTI)

    Robert C. Haight; John L. Ullmann; Daniel D. Strottman; Paul E. Koehler; Franz Kaeppeler

    2000-01-01

    This Workshop was held on September 3--4, 1999, following the 10th International Symposium on Capture Gamma-Ray Spectroscopy. Presentations were made by 14 speakers, 6 from the US and 8 from other countries on topics relevant to s-, r- and rp-process nucleosynthesis. Laboratory experiments, both present and planned, and astrophysical observations were represented as were astrophysical models. Approximately 50 scientists participated in this Workshop. These Proceedings consist of copies of vu-graphs presented at the Workshop. For further information, the interested readers are referred to the authors.

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

  1. EIA Open Data - Embed - U.S. Energy Information Administration (EIA)

    Gasoline and Diesel Fuel Update (EIA)

    Embedding EIA Charts and Maps on Your Website EIA has added functionality to its data tools to allow users to easily embed widgets of EIA's interactive charts and graphs onto their website. This allows users to easily add official statistics from U.S. Energy Administration's API to their websites. No API key, programming, or library installation is required. To embed a visualization: click image to enlarge Use any of the following EIA data tools to create a chart or a map: Electricity Data

  2. Eia.gov BETA - Data - U.S. Energy Information Administration (EIA)

    Gasoline and Diesel Fuel Update (EIA)

    4/2012 - California, United States Very nice. A couple of comments. It would be good to have the option of seeing vertical lines in the graph. Also while "resetting the zoom" is an usefull option a more granular "undo" option would be more helpful. 03/02/2012 - New York, United States Finally - A great interactive webite with formatted and readable date. Great Job!!! 03/01/2012 - Brazil eia Beta became better than before. It is full, complete. The information is easy to

  3. LDRDView V. 2.0

    Energy Science and Technology Software Center (OSTI)

    2007-12-12

    LDRDView is a software tool for visualizing a collection of textual records and exploring relationships between them for the purpose of gaining new insights about the submitted information. By evaluating the content of the records and assigning coordinates to each based on its similarity to others, LDRDView graphically displays a corpus of records either as a landscape of hills and valleys or as a graph of nodes and links. A suite of data analysis toolsmore » facilitates in-depth exploration of the corpus as a whole and the content of each individual record.« less

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

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

    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.

  5. Discharging a superconducting store into an inverting converter

    SciTech Connect (OSTI)

    Andrianov, V.V.; Zenkevich, V.B.; Popkov, O.V.; Sergeyenkov, B.N.; Sukhorukov, A.G.

    1983-11-01

    It is possible to invert the energy stored in a superconducting solenoid with both a constant mean value of the inverted power, and a constant mean value of the voltage in the leads of the solenoid, which is equal to the mean value of the opposing voltage (counter emf) of the inverter. The operation of a superconducting inductive store together with a high speed semiconductor switch and a three phase inverter is considered. Graphs show changes in currents and voltages on the compacitor, the current flowing through the superconducting solenoid, the current flowing through the capacitor, and that flowing through the controlled rectified.

  6. Power System Extreme Event Detection: The VulnerabilityFrontier

    SciTech Connect (OSTI)

    Lesieutre, Bernard C.; Pinar, Ali; Roy, Sandip

    2007-10-17

    In this work we apply graph theoretic tools to provide aclose bound on a frontier relating the number of line outages in a gridto the power disrupted by the outages. This frontier describes theboundary of a space relating the possible severity of a disturbance interms of power disruption, from zero to some maximum on the boundary, tothe number line outages involved in the event. We present the usefulnessof this analysis with a complete analysis of a 30 bus system, and presentresults for larger systems.

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

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

  9. 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 depressurization following nuclear testing. The magnitude of the overall water-level change for wells with anthropogenic trends can be large, ranging from several feet to hundreds of feet. Vertical water-level differences at 27 sites in Yucca Flat with multiple open intervals were compared. Large vertical differences were noted in volcanic rocks and in boreholes where water levels were affected by nuclear tests. Small vertical differences were noted within the carbonate-rock and valley-fill aquifers. Vertical hydraulic gradients generally are downward in volcanic rocks and from pre-Tertiary clastic rocks toward volcanic- or carbonate-rock units.

  10. Sort-First, Distributed Memory Parallel Visualization and Rendering

    SciTech Connect (OSTI)

    Bethel, E. Wes; Humphreys, Greg; Paul, Brian; Brederson, J. Dean

    2003-07-15

    While commodity computing and graphics hardware has increased in capacity and dropped in cost, it is still quite difficult to make effective use of such systems for general-purpose parallel visualization and graphics. We describe the results of a recent project that provides a software infrastructure suitable for general-purpose use by parallel visualization and graphics applications. Our work combines and extends two technologies: Chromium, a stream-oriented framework that implements the OpenGL programming interface; and OpenRM Scene Graph, a pipelined-parallel scene graph interface for graphics data management. Using this combination, we implement a sort-first, distributed memory, parallel volume rendering application. We describe the performance characteristics in terms of bandwidth requirements and highlight key algorithmic considerations needed to implement the sort-first system. We characterize system performance using a distributed memory parallel volume rendering application, a nd present performance gains realized by using scene specific knowledge to accelerate rendering through reduced network bandwidth. The contribution of this work is an exploration of general-purpose, sort-first architecture performance characteristics as applied to distributed memory, commodity hardware, along with a description of the algorithmic support needed to realize parallel, sort-first implementations.

  11. The baryon vector current in the combined chiral and 1/Nc expansions

    SciTech Connect (OSTI)

    Flores-Mendieta, Ruben; Goity, Jose L

    2014-12-01

    The baryon vector current is computed at one-loop order in large-Nc baryon chiral perturbation theory, where Nc is the number of colors. Loop graphs with octet and decuplet intermediate states are systematically incorporated into the analysis and the effects of the decuplet-octet mass difference and SU(3) flavor symmetry breaking are accounted for. There are large-Nc cancellations between different one-loop graphs as a consequence of the large-Nc spin-flavor symmetry of QCD baryons. The results are compared against the available experimental data through several fits in order to extract information about the unknown parameters. The large-Nc baryon chiral perturbation theory predictions are in very good agreement both with the expectations from the 1/Nc expansion and with the experimental data. The effect of SU(3) flavor symmetry breaking for the |Delta S|=1 vector current form factors f1(0) results in a reduction by a few percent with respect to the corresponding SU(3) symmetric values.

  12. The Holographic Entropy Cone

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

    Bao, Ning; Nezami, Sepehr; Ooguri, Hirosi; Stoica, Bogdan; Sully, James; Walter, Michael

    2015-09-21

    We initiate a systematic enumeration and classification of entropy inequalities satisfied by the Ryu-Takayanagi formula for conformal field theory states with smooth holographic dual geometries. For 2, 3, and 4 regions, we prove that the strong subadditivity and the monogamy of mutual information give the complete set of inequalities. This is in contrast to the situation for generic quantum systems, where a complete set of entropy inequalities is not known for 4 or more regions. We also find an infinite new family of inequalities applicable to 5 or more regions. The set of all holographic entropy inequalities bounds the phasemore » space of Ryu-Takayanagi entropies, defining the holographic entropy cone. We characterize this entropy cone by reducing geometries to minimal graph models that encode the possible cutting and gluing relations of minimal surfaces. We find that, for a fixed number of regions, there are only finitely many independent entropy inequalities. To establish new holographic entropy inequalities, we introduce a combinatorial proof technique that may also be of independent interest in Riemannian geometry and graph theory.« less

  13. Minimal-memory realization of pearl-necklace encoders of general quantum convolutional codes

    SciTech Connect (OSTI)

    Houshmand, Monireh; Hosseini-Khayat, Saied

    2011-02-15

    Quantum convolutional codes, like their classical counterparts, promise to offer higher error correction performance than block codes of equivalent encoding complexity, and are expected to find important applications in reliable quantum communication where a continuous stream of qubits is transmitted. Grassl and Roetteler devised an algorithm to encode a quantum convolutional code with a ''pearl-necklace'' encoder. Despite their algorithm's theoretical significance as a neat way of representing quantum convolutional codes, it is not well suited to practical realization. In fact, there is no straightforward way to implement any given pearl-necklace structure. This paper closes the gap between theoretical representation and practical implementation. In our previous work, we presented an efficient algorithm to find a minimal-memory realization of a pearl-necklace encoder for Calderbank-Shor-Steane (CSS) convolutional codes. This work is an extension of our previous work and presents an algorithm for turning a pearl-necklace encoder for a general (non-CSS) quantum convolutional code into a realizable quantum convolutional encoder. We show that a minimal-memory realization depends on the commutativity relations between the gate strings in the pearl-necklace encoder. We find a realization by means of a weighted graph which details the noncommutative paths through the pearl necklace. The weight of the longest path in this graph is equal to the minimal amount of memory needed to implement the encoder. The algorithm has a polynomial-time complexity in the number of gate strings in the pearl-necklace encoder.

  14. HeNCE: A Heterogeneous Network Computing Environment

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

    Beguelin, Adam; Dongarra, Jack J.; Geist, George Al; Manchek, Robert; Moore, Keith

    1994-01-01

    Network computing seeks to utilize the aggregate resources of many networked computers to solve a single problem. In so doing it is often possible to obtain supercomputer performance from an inexpensive local area network. The drawback is that network computing is complicated and error prone when done by hand, especially if the computers have different operating systems and data formats and are thus heterogeneous. The heterogeneous network computing environment (HeNCE) is an integrated graphical environment for creating and running parallel programs over a heterogeneous collection of computers. It is built on a lower level package called parallel virtual machine (PVM).more » The HeNCE philosophy of parallel programming is to have the programmer graphically specify the parallelism of a computation and to automate, as much as possible, the tasks of writing, compiling, executing, debugging, and tracing the network computation. Key to HeNCE is a graphical language based on directed graphs that describe the parallelism and data dependencies of an application. Nodes in the graphs represent conventional Fortran or C subroutines and the arcs represent data and control flow. This article describes the present state of HeNCE, its capabilities, limitations, and areas of future research.« less

  15. Zodiac: A Comprehensive Depiction of Genetic Interactions in Cancer by Integrating TCGA Data

    SciTech Connect (OSTI)

    Zhu, Yitan; Xu, Yanxun; Helseth, Donald L.; Gulukota, Kamalakar; Yang, Shengjie; Pesce, Lorenzo L.; Mitra, Riten; Muller, Peter; Sengupta, Subhajit; Guo, Wentian; Foster, Ian; Bullock, JaQuel A.

    2015-08-01

    Background: Genetic interactions play a critical role in cancer development. Existing knowledge about cancer genetic interactions is incomplete, especially lacking evidences derived from large-scale cancer genomics data. The Cancer Genome Atlas (TCGA) produces multimodal measurements across genomics and features of thousands of tumors, which provide an unprecedented opportunity to investigate the interplays of genes in cancer. Methods: We introduce Zodiac, a computational tool and resource to integrate existing knowledge about cancer genetic interactions with new information contained in TCGA data. It is an evolution of existing knowledge by treating it as a prior graph, integrating it with a likelihood model derived by Bayesian graphical model based on TCGA data, and producing a posterior graph as updated and data-enhanced knowledge. In short, Zodiac realizes “Prior interaction map + TCGA data → Posterior interaction map.” Results: Zodiac provides molecular interactions for about 200 million pairs of genes. All the results are generated from a big-data analysis and organized into a comprehensive database allowing customized search. In addition, Zodiac provides data processing and analysis tools that allow users to customize the prior networks and update the genetic pathways of their interest. Zodiac is publicly available at www.compgenome.org/ZODIAC. Conclusions: Zodiac recapitulates and extends existing knowledge of molecular interactions in cancer. It can be used to explore novel gene-gene interactions, transcriptional regulation, and other types of molecular interplays in cancer.

  16. The Holographic Entropy Cone

    SciTech Connect (OSTI)

    Bao, Ning; Nezami, Sepehr; Ooguri, Hirosi; Stoica, Bogdan; Sully, James; Walter, Michael

    2015-09-21

    We initiate a systematic enumeration and classification of entropy inequalities satisfied by the Ryu-Takayanagi formula for conformal field theory states with smooth holographic dual geometries. For 2, 3, and 4 regions, we prove that the strong subadditivity and the monogamy of mutual information give the complete set of inequalities. This is in contrast to the situation for generic quantum systems, where a complete set of entropy inequalities is not known for 4 or more regions. We also find an infinite new family of inequalities applicable to 5 or more regions. The set of all holographic entropy inequalities bounds the phase space of Ryu-Takayanagi entropies, defining the holographic entropy cone. We characterize this entropy cone by reducing geometries to minimal graph models that encode the possible cutting and gluing relations of minimal surfaces. We find that, for a fixed number of regions, there are only finitely many independent entropy inequalities. To establish new holographic entropy inequalities, we introduce a combinatorial proof technique that may also be of independent interest in Riemannian geometry and graph theory.

  17. PDB to AMPL Conversion

    Energy Science and Technology Software Center (OSTI)

    2002-09-01

    PDB to AMPL Conversion was written to convert protein data base files to AMPL files. The protein data bases on the internet contain a wealth of information about the structue and makeup of proteins. Each file contains information derived by one or more experiments and contains information on how the experiment waw performed, the amino acid building blocks of each chain, and often the three-dimensional structure of the protein extracted from the experiments. The waymore » a protein folds determines much about its function. Thus, studying the three-dimensional structure of the protein is of great interest. Analysing the contact maps is one way to examine the structure. A contact map is a graph which has a linear back bone of amino acids for nodes (i.e., adjacent amino acids are always connected) and vertices between non-adjacent nodes if they are close enough to be considered in contact. If the graphs are similar then the folds of the protein and their function should also be similar. This software extracts the contact maps from a protein data base file and puts in into AMPL data format. This format is designed for use in AMPL, a programming language for simplifying linear programming formulations.« less

  18. CALIBRATION OF PHOTOELASTIC MODULATORS IN THE VACUUM UV.

    SciTech Connect (OSTI)

    OAKBERG, T.C.; TRUNK, J.; SUTHERLAND, J.C.

    2000-02-15

    Measurements of circular dichroism (CD) in the UV and vacuum UV have used photoelastic modulators (PEMs) for high sensitivity (to about 10{sup -6}). While a simple technique for wavelength calibration of the PEMs has been used with good results, several features of these calibration curves have not been understood. The authors have calibrated a calcium fluoride PEM and a lithium fluoride PEM using the National Synchrotron Light Source (NSLS) at Brookhaven National Laboratory as a light source. These experiments showed calibration graphs that are linear bit do not pass through the graph origin. A second ''multiple pass'' experiment with laser light of a single wavelength, performed on the calcium fluoride PEM, demonstrates the linearity of the PEM electronics. This implies that the calibration behavior results from intrinsic physical properties of the PEM optical element material. An algorithm for generating calibration curves for calcium fluoride and lithium fluoride PEMs has been developed. The calibration curves for circular dichroism measurement for the two PEMs investigated in this study are given as examples.

  19. POSet Ontology Categorizer

    Energy Science and Technology Software Center (OSTI)

    2005-03-01

    POSet Ontology Categorizer (POSOC) V1.0 The POSet Ontology Categorizer (POSOC) software package provides tools for creating and mining of poset-structured ontologies, such as the Gene Ontology (GO). Given a list of weighted query items (ex.genes,proteins, and/or phrases) and one or more focus nodes, POSOC determines the ordered set of GO nodes that summarize the query, based on selections of a scoring function, pseudo-distance measure, specificity level, and cluster determination. Pseudo-distance measures provided are minimum chainmore » length, maximum chain length, average of extreme chain lengths, and average of all chain lengths. A low specificity level, such as -1 or 0, results in a general set of clusters. Increasing the specificity results in more specific results in more specific and lighter clusters. POSOC cluster results can be compared agaist known results by calculations of precision, recall, and f-score for graph neighborhood relationships. This tool has been used in understanding the function of a set of genes, finding similar genes, and annotating new proteins. The POSOC software consists of a set of Java interfaces, classes, and programs that run on Linux or Windows platforms. It incorporates graph classes from OpenJGraph (openjgraph.sourceforge.net).« less

  20. Simplifying Multi-loop Integrands of Gauge Theory and Gravity Amplitudes

    SciTech Connect (OSTI)

    Bern, Z.; Carrasco, J.J.M.; Dixon, L.J.; Johansson, H.; Roiban, R.

    2012-02-15

    We use the duality between color and kinematics to simplify the construction of the complete four-loop four-point amplitude of N = 4 super-Yang-Mills theory, including the nonplanar contributions. The duality completely determines the amplitude's integrand in terms of just two planar graphs. The existence of a manifestly dual gauge-theory amplitude trivializes the construction of the corresponding N = 8 supergravity integrand, whose graph numerators are double copies (squares) of the N = 4 super-Yang-Mills numerators. The success of this procedure provides further nontrivial evidence that the duality and double-copy properties hold at loop level. The new form of the four-loop four-point supergravity amplitude makes manifest the same ultraviolet power counting as the corresponding N = 4 super-Yang-Mills amplitude. We determine the amplitude's ultraviolet pole in the critical dimension of D = 11/2, the same dimension as for N = 4 super-Yang-Mills theory. Strikingly, exactly the same combination of vacuum integrals (after simplification) describes the ultraviolet divergence of N = 8 supergravity as the subleading-in-1/N{sub c}{sup 2} single-trace divergence in N = 4 super-Yang-Mills theory.

  1. Fuel Cycle Services Needs Estimator v.2.0

    Energy Science and Technology Software Center (OSTI)

    2008-03-18

    The "Fuel Cycle Services Needs Estimator", Version 2.0 allows users to estimate the amount of uranium enrichment services needed and amount of spent nuclear fuel produced by a given fleet of nuclear power reactors through 2050 based on user-determined information about the size of a reactor fleet and average characteristics of reactors in that fleet. The program helps users evaluate the current and future supply of nuclear fuel cycle services. The program also allows usersmore » to compare the enrichment needs and spent fuel production of more up to seven defined nuclear power reactor fleets and to aggregate estimated needs. Version 2.0 of the program has an additions of new graphs to show results of calculations (calculation capabilities and other graphing tools included in version 1.o), maps showing flows of material based on calculation results, and additional calculation capabilities that allow the user to compare supply to demand (demand calculations included in version 1.0). Default values for seven selected nuclear energy programs in East Asia are included for reference and comparison. The program was designed using the dynamic simulation software, Powersim.« less

  2. Optimal response to attacks on the open science grids.

    SciTech Connect (OSTI)

    Altunay, M.; Leyffer, S.; Linderoth, J. T.; Xie, Z.

    2011-01-01

    Cybersecurity is a growing concern, especially in open grids, where attack propagation is easy because of prevalent collaborations among thousands of users and hundreds of institutions. The collaboration rules that typically govern large science experiments as well as social networks of scientists span across the institutional security boundaries. A common concern is that the increased openness may allow malicious attackers to spread more readily around the grid. We consider how to optimally respond to attacks in open grid environments. To show how and why attacks spread more readily around the grid, we first discuss how collaborations manifest themselves in the grids and form the collaboration network graph, and how this collaboration network graph affects the security threat levels of grid participants. We present two mixed-integer program (MIP) models to find the optimal response to attacks in open grid environments, and also calculate the threat level associated with each grid participant. Given an attack scenario, our optimal response model aims to minimize the threat levels at unaffected participants while maximizing the uninterrupted scientific production (continuing collaborations). By adopting some of the collaboration rules (e.g., suspending a collaboration or shutting down a site), the model finds optimal response to subvert an attack scenario.

  3. Towards a Multiscale Approach to Cybersecurity Modeling

    SciTech Connect (OSTI)

    Hogan, Emilie A.; Hui, Peter SY; Choudhury, Sutanay; Halappanavar, Mahantesh; Oler, Kiri J.; Joslyn, Cliff A.

    2013-11-12

    We propose a multiscale approach to modeling cyber networks, with the goal of capturing a view of the network and overall situational awareness with respect to a few key properties--- connectivity, distance, and centrality--- for a system under an active attack. We focus on theoretical and algorithmic foundations of multiscale graphs, coming from an algorithmic perspective, with the goal of modeling cyber system defense as a specific use case scenario. We first define a notion of \\emph{multiscale} graphs, in contrast with their well-studied single-scale counterparts. We develop multiscale analogs of paths and distance metrics. As a simple, motivating example of a common metric, we present a multiscale analog of the all-pairs shortest-path problem, along with a multiscale analog of a well-known algorithm which solves it. From a cyber defense perspective, this metric might be used to model the distance from an attacker's position in the network to a sensitive machine. In addition, we investigate probabilistic models of connectivity. These models exploit the hierarchy to quantify the likelihood that sensitive targets might be reachable from compromised nodes. We believe that our novel multiscale approach to modeling cyber-physical systems will advance several aspects of cyber defense, specifically allowing for a more efficient and agile approach to defending these systems.

  4. Thought Leaders during Crises in Massive Social Networks

    SciTech Connect (OSTI)

    Corley, Courtney D.; Farber, Robert M.; Reynolds, William

    2012-05-24

    The vast amount of social media data that can be gathered from the internet coupled with workflows that utilize both commodity systems and massively parallel supercomputers, such as the Cray XMT, open new vistas for research to support health, defense, and national security. Computer technology now enables the analysis of graph structures containing more than 4 billion vertices joined by 34 billion edges along with metrics and massively parallel algorithms that exhibit near-linear scalability according to number of processors. The challenge lies in making this massive data and analysis comprehensible to an analyst and end-users that require actionable knowledge to carry out their duties. Simply stated, we have developed language and content agnostic techniques to reduce large graphs built from vast media corpora into forms people can understand. Specifically, our tools and metrics act as a survey tool to identify thought leaders' -- those members that lead or reflect the thoughts and opinions of an online community, independent of the source language.

  5. Efficient VLSI networks for parallel processing based on orthogonal trees

    SciTech Connect (OSTI)

    Nath, D.; Maheshwari, S.N.; Bhatt, P.C.P.

    1983-06-01

    Two interconnection networks for parallel processing, namely the orthogonal trees network and the orthogonal tree cycles (OTN and OTC) are discussed. Both networks are suitable for VLSI implementation and have been analysed using Thompson's model of VLSI. While the OTN and OTC have time performances similar to fast networks such as the perfect shuffle network (PSN), the cube connected cycles (CCC), etc., they have substantially better area* time/sup 2/ performances for a number of matrix and graph problems. For instance, the connected components and a minimal spanning tree of an undirected n-vertex graph can be found in 0(log/sup 4/ n) time on the OTC with an area* time/sup 2/ performance of 0(n/sup 2/ log/sup 8/ n) and 0(n/sup 2/ log/sup 9/ n) respectively. This is asymptotically much better than the performances of the CCC, PSN and MESH. The OTC and OTN can be looked upon as general purpose parallel processors since a number of other problems such as sorting and DFT can be solved on them with an area* time/sup 2/ performance matching that of other networks. Finally, programming the OTN and OTC is simple and they are also amenable to pipelining a series of problems. 33 references.

  6. Hybrid Multidimensional Relational and Link Analytical Knowledge Discovery for Law Enforcement

    SciTech Connect (OSTI)

    Joslyn, Cliff A.; Gillen, David S.; Burke, John S.; Critchlow, Terence J.; Damante, Matt; Fernandes, Robert

    2008-08-01

    The challenges facing the Department of Homeland Security (DHS) require not only multi-dimensional, but also multi-scale data analysis. In particular, the ability to seamlessly move from summary information, such as trends, into detailed analysis of individual entities, while critical for law enforcement, typically requires manually transferring information among multiple tools. Such time-consuming and error prone processes significantly hamper the analysts' ability to quickly explore data and identify threats. As part of a DHS Science and Technology effort, we have been developing and deploying for Immigration and Customs Enforcement the CubeLink system integrating information between relational data cubes and link analytical semantic graphs. In this paper we describe CubeLink in terms of the underlying components, their integration, and the formal mapping from multidimensional data analysis into link analysis. In so doing, we provide a formal basis for one particular form of automatic schema-ontology mapping from OLAP data cubes to semantic graphs databases, and point the way towards future ``intelligent'' OLAP data cubes equipped with meta-data about their dimensional typing.

  7. POSet Ontology Categorizer

    SciTech Connect (OSTI)

    Miniszewski, Sue M.

    2005-03-01

    POSet Ontology Categorizer (POSOC) V1.0 The POSet Ontology Categorizer (POSOC) software package provides tools for creating and mining of poset-structured ontologies, such as the Gene Ontology (GO). Given a list of weighted query items (ex.genes,proteins, and/or phrases) and one or more focus nodes, POSOC determines the ordered set of GO nodes that summarize the query, based on selections of a scoring function, pseudo-distance measure, specificity level, and cluster determination. Pseudo-distance measures provided are minimum chain length, maximum chain length, average of extreme chain lengths, and average of all chain lengths. A low specificity level, such as -1 or 0, results in a general set of clusters. Increasing the specificity results in more specific results in more specific and lighter clusters. POSOC cluster results can be compared agaist known results by calculations of precision, recall, and f-score for graph neighborhood relationships. This tool has been used in understanding the function of a set of genes, finding similar genes, and annotating new proteins. The POSOC software consists of a set of Java interfaces, classes, and programs that run on Linux or Windows platforms. It incorporates graph classes from OpenJGraph (openjgraph.sourceforge.net).

  8. Indonesian fuel consumers shouldering development costs

    SciTech Connect (OSTI)

    Not Available

    1984-08-22

    A graph shows how Indonesia's prices for regular and premium leaded gasolines and diesel fuel compare to the world average price, in US dollars per gallon: USA $0.28 lower for regular leaded gasoline, $0.30 lower for premium leaded, and $0.48 lower for diesel. Such proximity to world averages is of note in the context that Indonesia, a developing country with pressing needs for industrial and social development, does not internally provide the deep consumer subsidies that have long persisted in many such oil-producing countries. Although the other three countries shown on the graph have recently moved to cut internal fuel price subsidies, they still price these three important fuels more deeply below the world average than does Indonesia. A table details Indonesia's internal market price changes over time, by petroleum product. A chart tracks Indonesia's oil exports since 1966. The year of the first world oil price shock, 1973, shows a dramatic increase in exports, but that near-doubling was not repeated during the period of the second price shock, 1978-1979. As of 182, exports (by now including condensates) had fallen to pre-Arab Oil Embargo levels. This issue contains the fuel price/tax series and the principal industrial fuel prices for August 1984 for countries of the Western Hemisphere. Also, beginning with this issue, Energy Detente will appear only in English rather than both English and Spanish, as heretofore.

  9. Omega-AB

    Energy Science and Technology Software Center (OSTI)

    2007-05-01

    A hierarchical, modular modeling environment for hybrid simulations of sequential-modular, systems dynamics, discrete-event, and agent-based paradigms Omega-AB models contain a hierarchically-defined module tree that specifies the execution logic for the simulation, and a multi-network graph that defines the environment within which the simulation occurs. Modules are the fundamental buildinig blocks of an Omega-AB model and can define anything from a basic mathematical operation to a complex behavioral response model. Modules rely on the "plug-in" conceptmore » which allows developers to build independent module libraries that are gathered, linked, and instantiated by the Omega-AB engine at run time. Inter-module communication occurs through two complimentary systems: pull-based "ports" for general computation patterns and push-based "plugs" for event processing. The simulation environment is an abstract graph of nodes and links. Agents (module sub-trees headed up by an Agent module) reside at nodes and relate to their neighbors through typed links. To facilitate the construction and visualization of complex, interacting networks with dramatically different structure, Omega-AB provides a system for organizing the nodes into hierarchica trees that describe "slices" of the overall network.« less

  10. Seismic energy data analysis of Merapi volcano to test the eruption time prediction using materials failure forecast method (FFM)

    SciTech Connect (OSTI)

    Anggraeni, Novia Antika

    2015-04-24

    The test of eruption time prediction is an effort to prepare volcanic disaster mitigation, especially in the volcano’s inhabited slope area, such as Merapi Volcano. The test can be conducted by observing the increase of volcanic activity, such as seismicity degree, deformation and SO2 gas emission. One of methods that can be used to predict the time of eruption is Materials Failure Forecast Method (FFM). Materials Failure Forecast Method (FFM) is a predictive method to determine the time of volcanic eruption which was introduced by Voight (1988). This method requires an increase in the rate of change, or acceleration of the observed volcanic activity parameters. The parameter used in this study is the seismic energy value of Merapi Volcano from 1990 – 2012. The data was plotted in form of graphs of seismic energy rate inverse versus time with FFM graphical technique approach uses simple linear regression. The data quality control used to increase the time precision employs the data correlation coefficient value of the seismic energy rate inverse versus time. From the results of graph analysis, the precision of prediction time toward the real time of eruption vary between −2.86 up to 5.49 days.

  11. Optimization Strategies for the Vulnerability Analysis of the Electric Power Grid

    SciTech Connect (OSTI)

    Pinar, A.; Meza, J.; Donde, V.; Lesieutre, B.

    2007-11-13

    Identifying small groups of lines, whose removal would cause a severe blackout, is critical for the secure operation of the electric power grid. We show how power grid vulnerability analysis can be studied as a mixed integer nonlinear programming (MINLP) problem. Our analysis reveals a special structure in the formulation that can be exploited to avoid nonlinearity and approximate the original problem as a pure combinatorial problem. The key new observation behind our analysis is the correspondence between the Jacobian matrix (a representation of the feasibility boundary of the equations that describe the flow of power in the network) and the Laplacian matrix in spectral graph theory (a representation of the graph of the power grid). The reduced combinatorial problem is known as the network inhibition problem, for which we present a mixed integer linear programming formulation. Our experiments on benchmark power grids show that the reduced combinatorial model provides an accurate approximation, to enable vulnerability analyses of real-sized problems with more than 10,000 power lines.

  12. Optimization strategies for the vulnerability analysis of the electric power grid.

    SciTech Connect (OSTI)

    Meza, Juan C.; Pinar, Ali; Lesieutre, Bernard; Donde, Vaibhav

    2009-03-01

    Identifying small groups of lines, whose removal would cause a severe blackout, is critical for the secure operation of the electric power grid. We show how power grid vulnerability analysis can be studied as a mixed integer nonlinear programming (minlp) problem. Our analysis reveals a special structure in the formulation that can be exploited to avoid nonlinearity and approximate the original problem as a pure combinatorial problem. The key new observation behind our analysis is the correspondence between the Jacobian matrix (a representation of the feasibility boundary of the equations that describe the flow of power in the network) and the Laplacian matrix in spectral graph theory (a representation of the graph of the power grid). The reduced combinatorial problem is known as the network inhibition problem, for which we present a mixed integer linear programming formulation. Our experiments on benchmark power grids show that the reduced combinatorial model provides an accurate approximation, to enable vulnerability analyses of real-sized problems with more than 10,000 power lines.

  13. Development of computer graphics

    SciTech Connect (OSTI)

    Nuttall, H.E.

    1989-07-01

    The purpose of this project was to screen and evaluate three graphics packages as to their suitability for displaying concentration contour graphs. The information to be displayed is from computer code simulations describing air-born contaminant transport. The three evaluation programs were MONGO (John Tonry, MIT, Cambridge, MA, 02139), Mathematica (Wolfram Research Inc.), and NCSA Image (National Center for Supercomputing Applications at the University of Illinois at Urbana-Champaign). After a preliminary investigation of each package, NCSA Image appeared to be significantly superior for generating the desired concentration contour graphs. Hence subsequent work and this report describes the implementation and testing of NCSA Image on both an Apple MacII and Sun 4 computers. NCSA Image includes several utilities (Layout, DataScope, HDF, and PalEdit) which were used in this study and installed on Dr. Ted Yamada`s Mac II computer. Dr. Yamada provided two sets of air pollution plume data which were displayed using NCSA Image. Both sets were animated into a sequential expanding plume series.

  14. Dependency visualization for complex system understanding

    SciTech Connect (OSTI)

    Smart, J.A.C.

    1994-09-01

    With the volume of software in production use dramatically increasing, the importance of software maintenance has become strikingly apparent. Techniques now sought and developed for reverse engineering and design extraction and recovery. At present, numerous commercial products and research tools exist which are capable of visualizing a variety of programming languages and software constructs. The list of new tools and services continues to grow rapidly. Although the scope of the existing commercial and academic product set is quite broad, these tools still share a common underlying problem. The ability of each tool to visually organize object representations is increasingly impaired as the number of components and component dependencies within systems increases. Regardless of how objects are defined, complex ``spaghetti`` networks result in nearly all large system cases. While this problem is immediately apparent in modem systems analysis involving large software implementations, it is not new. As will be discussed in Chapter 2, related problems involving the theory of graphs were identified long ago. This important theoretical foundation provides a useful vehicle for representing and analyzing complex system structures. While the utility of directed graph based concepts in software tool design has been demonstrated in literature, these tools still lack the capabilities necessary for large system comprehension. This foundation must therefore be expanded with new orgnizational and visualization constructs necessary to meet this challenge. This dissertation addresses this need by constructing a conceptual model and a set of methods for interactively exploring, organizing, and understanding the structure of complex software systems.

  15. Bicriteria network design problems

    SciTech Connect (OSTI)

    Marathe, M.V.; Ravi, R.; Sundaram, R.; Ravi, S.S.; Rosenkrantz, D.J.; Hunt, H.B. III

    1997-11-20

    The authors study a general class of bicriteria network design problems. A generic problem in this class is as follows: Given an undirected graph and two minimization objectives (under different cost functions), with a budget specified on the first, find a subgraph from a given subgraph class that minimizes the second objective subject to the budget on the first. They consider three different criteria -- the total edge cost, the diameter and the maximum degree of the network. Here, they present the first polynomial-time approximation algorithms for a large class of bicriteria network design problems for the above mentioned criteria. The following general types of results are presented. First, they develop a framework for bicriteria problems and their approximations. Second, when the two criteria are the same they present a black box parametric search technique. This black box takes in as input an (approximation) algorithm for the criterion situation and generates an approximation algorithm for the bicriteria case with only a constant factor loss in the performance guarantee. Third, when the two criteria are the diameter and the total edge costs they use a cluster based approach to devise approximation algorithms. The solutions violate both the criteria by a logarithmic factor. Finally, for the class of treewidth-bounded graphs, they provide pseudopolynomial-time algorithms for a number of bicriteria problems using dynamic programming. The authors show how these pseudopolynomial-time algorithms can be converted to fully polynomial-time approximation schemes using a scaling technique.

  16. Using the depth-velocity-size diagram to interpret equilibrium bed configurations in river flows

    SciTech Connect (OSTI)

    Southard, J.B. (Massachusetts Institute of Technology, Cambridge, MA (USA))

    1990-05-01

    Data from flume studies that report equilibrium bed configuration as well as water temperature, flow depth, flow velocity, and sediment size were used to develop the best approximation to the relationships among the various bed phases (ripples, dunes, lower regime plane bed, upper regime plane bed, and antidunes) in a three-axis graph (depth-velocity-size diagram) with dimensionless measures of mean flow depth, mean flow velocity, and sediment size along the axis. Relationships are shown in a series of depth-velocity and velocity-size sections through the diagram. Boundaries between bed-phase stability fields are drawn as surfaces that minimize, misplacement of data points. A large subset of the data, for which reliable values of bed shear stress are reported, was also used to represent the stability relationships in a graph of dimensionless boundary shear stress against dimensionless sediment size, but with results less useful for fluvial flow interpretation. The diagram covers about one order of magnitude in flow depth. To be useful for river flows, the diagram must be extrapolated in flow depth by about one more order of magnitude, but this is not a serious problem for approximate work. The depth-velocity-size diagram permits prediction of equilibrium bed configuration in river flows when the approximate flow depth and mean flow velocity are known. Because the diagram is essentially dimensionless, the effect of water temperature (via the fluid viscosity) on the bed configuration is easily accounted for by use of the diagram.

  17. A new generic method for the semi-automatic extraction of river and road networks in low and mid-resolution satellite images

    SciTech Connect (OSTI)

    Grazzini, Jacopo; Dillard, Scott; Soille, Pierre

    2010-10-21

    This paper addresses the problem of semi-automatic extraction of road or hydrographic networks in satellite images. For that purpose, we propose an approach combining concepts arising from mathematical morphology and hydrology. The method exploits both geometrical and topological characteristics of rivers/roads and their tributaries in order to reconstruct the complete networks. It assumes that the images satisfy the following two general assumptions, which are the minimum conditions for a road/river network to be identifiable and are usually verified in low- to mid-resolution satellite images: (i) visual constraint: most pixels composing the network have similar spectral signature that is distinguishable from most of the surrounding areas; (ii) geometric constraint: a line is a region that is relatively long and narrow, compared with other objects in the image. While this approach fully exploits local (roads/rivers are modeled as elongated regions with a smooth spectral signature in the image and a maximum width) and global (they are structured like a tree) characteristics of the networks, further directional information about the image structures is incorporated. Namely, an appropriate anisotropic metric is designed by using both the characteristic features of the target network and the eigen-decomposition of the gradient structure tensor of the image. Following, the geodesic propagation from a given network seed with this metric is combined with hydrological operators for overland flow simulation to extract the paths which contain most line evidence and identify them with the target network.

  18. Handbook of methods for the analysis of the various parameters of the carbon dioxide system in sea water. Version 2

    SciTech Connect (OSTI)

    Dickson, A.G.; Goyet, C.

    1994-09-01

    The collection of extensive, reliable, oceanic carbon data is a key component of the Joint Global Ocean Flux Study (JGOFS). A portion of the US JGOFS oceanic carbon dioxide measurements will be made during the World Ocean Circulation Experiment Hydrographic Program. A science team has been formed to plan and coordinate the various activities needed to produce high quality oceanic carbon dioxide measurements under this program. This handbook was prepared at the request of, and with the active participation of, that science team. The procedures have been agreed on by the members of the science team and describe well tested methods. They are intended to provide standard operating procedures, together with an appropriate quality control plan, for measurements made as part of this survey. These are not the only measurement techniques in use for the parameters of the oceanic carbon system; however, they do represent the current state-of-the-art for ship-board measurements. In the end, the editors hope that this handbook can serve widely as a clear and unambiguous guide to other investigators who are setting up to analyze the various parameters of the carbon dioxide system in sea water.

  19. Hydrogeologic characterization report for the Rocky Flats environmental technology site

    SciTech Connect (OSTI)

    Reeder, D.C.; Burcar, S.; Smith, R.

    1996-12-31

    The Denver groundwater basin encompasses approximately 6,700 square miles, extending east from the Front Range of the Rocky Mountains. This structural basin contains four Cretaceous bedrock aquifers overlain by a regional Quaternary alluvial aquifer. The Rocky Flats Site is located on the northwest margin of the basin. The shallow groundwater system at the Rocky Flats Site is divided into upper and lower hydrostratigraphic units (UHSU and LHSU, respectively). The UHSU at the Rocky Flats site comprises Quaternary alluvium, colluvium, valley-fill alluvium, artificial fill, weathered bedrock of the undifferentiated Arapahoe and Laramie formations and all sandstones that are hydraulically connected with overlying surficial groundwater. The LHSU comprises unweathered claystone with interbedded siltstones and sandstones of the undifferentiated Arapahoe and Laramie formations. The contact separating the UHSU and LHSU is identified as the base of the weathered zone. The separation of hydrostratigraphic units is supported by the contrasting permeabilities of the units comprising the UHSU and LHSU, well hydrograph data indicating that the units respond differently to seasonal recharge events, and geochemical data reflecting distinct major ion chemistries in the groundwaters of the UHSU and LHSU. Surface-water/groundwater interactions at the Rocky Flats site generally respond to seasonal fluctuations in precipitation, recharge, groundwater storage, and stream and ditch flow. Effluent conditions are dominant in the spring along western stream segments and influent conditions are common in the late summer and fall along most stream reaches.

  20. Effects of Flaming Gorge Dam hydropower operations on sediment transport in the Browns Park reach of the Green River, Utah and Colorado

    SciTech Connect (OSTI)

    Williams, G.P.; Tomasko, D.; Cho, H.E.; Yin, S.C.L.

    1995-05-01

    Three methods for comparing sediment transport were applied to four proposed hydropower operational scenarios under study for Flaming Gorge Dam on the Green River in Utah. These methods were effective discharge, equilibrium potential, and cumulative sediment load with flow exceedance plots. Sediment loads transported by the Green River in the Browns Park reach were calculated with the Engelund-Hansen equation for three historical water years and four hydropower operational scenarios. A model based on the Engelund-Hansen equation was developed using site-specific information and validated by comparing predictions for a moderate water year with measured historical values. The three methods were used to assess the impacts of hydropower operational scenarios on sediment resources. The cumulative sediment load method provided the most useful information for impact evaluation. Effective discharge was not a useful tool because of the limited number of discrete flows associated with synthetic hydrographs for the hydropower operational scenarios. The equilibrium potential method was relatively insensitive to the variations in operating conditions, rendering it comparatively ineffective for impact evaluation.