National Library of Energy BETA

Sample records for locations time-concentration graphs

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

    Office of Legacy Management (LM)

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

  2. Graph Theory

    SciTech Connect (OSTI)

    Sanfilippo, Antonio P.

    2005-12-27

    Graph theory is a branch of discrete combinatorial mathematics that studies the properties of graphs. The theory was pioneered by the Swiss mathematician Leonhard Euler in the 18th century, commenced its formal development during the second half of the 19th century, and has witnessed substantial growth during the last seventy years, with applications in areas as diverse as engineering, computer science, physics, sociology, chemistry and biology. Graph theory has also had a strong impact in computational linguistics by providing the foundations for the theory of features structures that has emerged as one of the most widely used frameworks for the representation of grammar formalisms.

  3. Utilization Graphs

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

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

  4. Methods of visualizing graphs

    DOE Patents [OSTI]

    Wong, Pak C.; Mackey, Patrick S.; Perrine, Kenneth A.; Foote, Harlan P.; Thomas, James J.

    2008-12-23

    Methods for visualizing a graph by automatically drawing elements of the graph as labels are disclosed. In one embodiment, the method comprises receiving node information and edge information from an input device and/or communication interface, constructing a graph layout based at least in part on that information, wherein the edges are automatically drawn as labels, and displaying the graph on a display device according to the graph layout. In some embodiments, the nodes are automatically drawn as labels instead of, or in addition to, the label-edges.

  5. mpiGraph

    Energy Science and Technology Software Center (OSTI)

    2007-05-22

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

  6. Graph Generator Survey

    SciTech Connect (OSTI)

    Lothian, Josh; Powers, Sarah S; Sullivan, Blair D; Baker, Matthew B; Schrock, Jonathan; Poole, Stephen W

    2013-12-01

    The benchmarking effort within the Extreme Scale Systems Center at Oak Ridge National Laboratory seeks to provide High Performance Computing benchmarks and test suites of interest to the DoD sponsor. The work described in this report is a part of the effort focusing on graph generation. A previously developed benchmark, SystemBurn, allowed the emulation of dierent application behavior profiles within a single framework. To complement this effort, similar capabilities are desired for graph-centric problems. This report examines existing synthetic graph generator implementations in preparation for further study on the properties of their generated synthetic graphs.

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

    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. A Clustering Graph Generator

    SciTech Connect (OSTI)

    Winlaw, Manda; De Sterck, Hans; Sanders, Geoffrey

    2015-10-26

    In very simple terms a network can be de ned as a collection of points joined together by lines. Thus, networks can be used to represent connections between entities in a wide variety of elds including engi- neering, science, medicine, and sociology. Many large real-world networks share a surprising number of properties, leading to a strong interest in model development research and techniques for building synthetic networks have been developed, that capture these similarities and replicate real-world graphs. Modeling these real-world networks serves two purposes. First, building models that mimic the patterns and prop- erties of real networks helps to understand the implications of these patterns and helps determine which patterns are important. If we develop a generative process to synthesize real networks we can also examine which growth processes are plausible and which are not. Secondly, high-quality, large-scale network data is often not available, because of economic, legal, technological, or other obstacles [7]. Thus, there are many instances where the systems of interest cannot be represented by a single exemplar network. As one example, consider the eld of cybersecurity, where systems require testing across diverse threat scenarios and validation across diverse network structures. In these cases, where there is no single exemplar network, the systems must instead be modeled as a collection of networks in which the variation among them may be just as important as their common features. By developing processes to build synthetic models, so-called graph generators, we can build synthetic networks that capture both the essential features of a system and realistic variability. Then we can use such synthetic graphs to perform tasks such as simulations, analysis, and decision making. We can also use synthetic graphs to performance test graph analysis algorithms, including clustering algorithms and anomaly detection algorithms.

  14. Recursive Feature Extraction in Graphs

    Energy Science and Technology Software Center (OSTI)

    2014-08-14

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

  15. Graph Coarsening for Path Finding in Cybersecurity Graphs

    SciTech Connect (OSTI)

    Hogan, Emilie A.; Johnson, John R.; Halappanavar, Mahantesh

    2013-01-01

    n the pass-the-hash attack, hackers repeatedly steal password hashes and move through a computer network with the goal of reaching a computer with high level administrative privileges. In this paper we apply graph coarsening in network graphs for the purpose of detecting hackers using this attack or assessing the risk level of the network's current state. We repeatedly take graph minors, which preserve the existence of paths in the graph, and take powers of the adjacency matrix to count the paths. This allows us to detect the existence of paths as well as find paths that have high risk of being used by adversaries.

  16. Quantum Graph Analysis

    SciTech Connect (OSTI)

    Maunz, Peter Lukas Wilhelm; Sterk, Jonathan David; Lobser, Daniel; Parekh, Ojas D.; Ryan-Anderson, Ciaran

    2016-01-01

    In recent years, advanced network analytics have become increasingly important to na- tional security with applications ranging from cyber security to detection and disruption of ter- rorist networks. While classical computing solutions have received considerable investment, the development of quantum algorithms to address problems, such as data mining of attributed relational graphs, is a largely unexplored space. Recent theoretical work has shown that quan- tum algorithms for graph analysis can be more efficient than their classical counterparts. Here, we have implemented a trapped-ion-based two-qubit quantum information proces- sor to address these goals. Building on Sandia's microfabricated silicon surface ion traps, we have designed, realized and characterized a quantum information processor using the hyperfine qubits encoded in two 171 Yb + ions. We have implemented single qubit gates using resonant microwave radiation and have employed Gate set tomography (GST) to characterize the quan- tum process. For the first time, we were able to prove that the quantum process surpasses the fault tolerance thresholds of some quantum codes by demonstrating a diamond norm distance of less than 1 . 9 x 10 [?] 4 . We used Raman transitions in order to manipulate the trapped ions' motion and realize two-qubit gates. We characterized the implemented motion sensitive and insensitive single qubit processes and achieved a maximal process infidelity of 6 . 5 x 10 [?] 5 . We implemented the two-qubit gate proposed by Molmer and Sorensen and achieved a fidelity of more than 97 . 7%.

  17. A Collection of Features for Semantic Graphs

    SciTech Connect (OSTI)

    Eliassi-Rad, T; Fodor, I K; Gallagher, B

    2007-05-02

    Semantic graphs are commonly used to represent data from one or more data sources. Such graphs extend traditional graphs by imposing types on both nodes and links. This type information defines permissible links among specified nodes and can be represented as a graph commonly referred to as an ontology or schema graph. Figure 1 depicts an ontology graph for data from National Association of Securities Dealers. Each node type and link type may also have a list of attributes. To capture the increased complexity of semantic graphs, concepts derived for standard graphs have to be extended. This document explains briefly features commonly used to characterize graphs, and their extensions to semantic graphs. This document is divided into two sections. Section 2 contains the feature descriptions for static graphs. Section 3 extends the features for semantic graphs that vary over time.

  18. Graph Partitioning and Sequencing Software

    Energy Science and Technology Software Center (OSTI)

    1995-09-19

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

  19. Khovanov homology of graph-links

    SciTech Connect (OSTI)

    Nikonov, Igor M

    2012-08-31

    Graph-links arise as the intersection graphs of turning chord diagrams of links. Speaking informally, graph-links provide a combinatorial description of links up to mutations. Many link invariants can be reformulated in the language of graph-links. Khovanov homology, a well-known and useful knot invariant, is defined for graph-links in this paper (in the case of the ground field of characteristic two). Bibliography: 14 titles.

  20. Graph Analytics for Signature Discovery

    SciTech Connect (OSTI)

    Hogan, Emilie A.; Johnson, John R.; Halappanavar, Mahantesh; Lo, Chaomei

    2013-06-01

    Within large amounts of seemingly unstructured data it can be diffcult to find signatures of events. In our work we transform unstructured data into a graph representation. By doing this we expose underlying structure in the data and can take advantage of existing graph analytics capabilities, as well as develop new capabilities. Currently we focus on applications in cybersecurity and communication domains. Within cybersecurity we aim to find signatures for perpetrators using the pass-the-hash attack, and in communications we look for emails or phone calls going up or down a chain of command. In both of these areas, and in many others, the signature we look for is a path with certain temporal properties. In this paper we discuss our methodology for finding these temporal paths within large graphs.

  1. Graph modeling systems and methods

    SciTech Connect (OSTI)

    Neergaard, Mike

    2015-10-13

    An apparatus and a method for vulnerability and reliability modeling are provided. The method generally includes constructing a graph model of a physical network using a computer, the graph model including a plurality of terminating vertices to represent nodes in the physical network, a plurality of edges to represent transmission paths in the physical network, and a non-terminating vertex to represent a non-nodal vulnerability along a transmission path in the physical network. The method additionally includes evaluating the vulnerability and reliability of the physical network using the constructed graph model, wherein the vulnerability and reliability evaluation includes a determination of whether each terminating and non-terminating vertex represents a critical point of failure. The method can be utilized to evaluate wide variety of networks, including power grid infrastructures, communication network topologies, and fluid distribution systems.

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

    Energy Science and Technology Software Center (OSTI)

    2007-11-19

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

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

  4. New Location

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

    Location Precision measurement for particle physics Peter W. Graham Stanford University May 18, 2016 4:00 p.m. - Wilson Hall, Curia II Precision measurement offers a powerful new approach for particle physics. I will discuss novel experiments using technologies such as atom interferometry, nuclear magnetic resonance, high precision magnetometry, and torsion balances for direct detection of dark matter and gravitational waves. These provide the optimal method for direct detection of light dark

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

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

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

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

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

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

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

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

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

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

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

    SciTech Connect (OSTI)

    Sengupta, Dipanjan; Song, Shuaiwen; Agarwal, Kapil; Schwan, Karsten

    2015-11-15

    Recent work on real-world graph analytics has sought to leverage the massive amount of parallelism offered by GPU devices, but challenges remain due to the inherent irregularity of graph algorithms and limitations in GPU-resident memory for storing large graphs. We present GraphReduce, a highly efficient and scalable GPU-based framework that operates on graphs that exceed the device’s internal memory capacity. GraphReduce adopts a combination of edge- and vertex-centric implementations of the Gather-Apply-Scatter programming model and operates on multiple asynchronous GPU streams to fully exploit the high degrees of parallelism in GPUs with efficient graph data movement between the host and device.

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

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

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

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

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

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

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

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

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

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

  4. Continuous-time quantum walks on star graphs

    SciTech Connect (OSTI)

    Salimi, S.

    2009-06-15

    In this paper, we investigate continuous-time quantum walk on star graphs. It is shown that quantum central limit theorem for a continuous-time quantum walk on star graphs for N-fold star power graph, which are invariant under the quantum component of adjacency matrix, converges to continuous-time quantum walk on K{sub 2} graphs (complete graph with two vertices) and the probability of observing walk tends to the uniform distribution.

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

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

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

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

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

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

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

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

  13. Graph processing platforms at scale: practices and experiences

    SciTech Connect (OSTI)

    Lim, Seung-Hwan; Lee, Sangkeun; Brown, Tyler C; Sukumar, Sreenivas R; Ganesh, Gautam

    2015-01-01

    Graph analysis unveils hidden associations of data in many phenomena and artifacts, such as road network, social networks, genomic information, and scientific collaboration. Unfortunately, a wide diversity in the characteristics of graphs and graph operations make it challenging to find a right combination of tools and implementation of algorithms to discover desired knowledge from the target data set. This study presents an extensive empirical study of three representative graph processing platforms: Pegasus, GraphX, and Urika. Each system represents a combination of options in data model, processing paradigm, and infrastructure. We benchmarked each platform using three popular graph operations, degree distribution, connected components, and PageRank over a variety of real-world graphs. Our experiments show that each graph processing platform shows different strength, depending the type of graph operations. While Urika performs the best in non-iterative operations like degree distribution, GraphX outputforms iterative operations like connected components and PageRank. In addition, we discuss challenges to optimize the performance of each platform over large scale real world graphs.

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

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

  16. Ombuds Office Location & Hours

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

    Ombuds Office Location & Hours Ombuds Office Location & Hours Committed to the fair and equitable treatment of all employees, contractors, and persons doing business with the...

  17. Alternative Fueling Station Locator

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

    19,710 alternative fuel stations in the United States Excluding private stations Location details are subject to change. We recommend calling the stations to verify location, hours...

  18. Sandia National Laboratories: Locations

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

    Locations Locations Sandia California CINT photo A national and international presence Sandia operates laboratories, testing facilities, and offices in multiple sites around the United States and participates in research collaborations around the world. Sandia's executive management offices and larger laboratory complex are located in Albuquerque, New Mexico. Our second principal laboratory is located in Livermore, California. Although most of our 9,840 employees work at these two locations,

  19. A Graph Search Heuristic for Shortest Distance Paths

    SciTech Connect (OSTI)

    Chow, E

    2005-03-24

    This paper presents a heuristic for guiding A* search for finding the shortest distance path between two vertices in a connected, undirected, and explicitly stored graph. The heuristic requires a small amount of data to be stored at each vertex. The heuristic has application to quickly detecting relationships between two vertices in a large information or knowledge network. We compare the performance of this heuristic with breadth-first search on graphs with various topological properties. The results show that one or more orders of magnitude improvement in the number of vertices expanded is possible for large graphs, including Poisson random graphs.

  20. Sequoia supercomputer tops Graph 500 | National Nuclear Security...

    National Nuclear Security Administration (NNSA)

    Lawrence Livermore National Laboratory scientists' search for new ways to solve large complex national security problems led to the top ranking on Graph 500 and new techniques for ...

  1. Mining Graphs for Understanding Time-Varying Volumetric Data...

    Office of Scientific and Technical Information (OSTI)

    SciTech Connect Search Results Journal Article: Mining Graphs for Understanding ... DOE Contract Number: AC02-06CH11357 Resource Type: Journal Article Resource Relation: ...

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

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

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

  5. Reversible micromachining locator

    DOE Patents [OSTI]

    Salzer, Leander J. (Los Alamos, NM); Foreman, Larry R. (Los Alamos, NM)

    1999-01-01

    This invention provides a device which includes a locator, a kinematic mount positioned on a conventional tooling machine, a part carrier disposed on the locator and a retainer ring. The locator has disposed therein a plurality of steel balls, placed in an equidistant position circumferentially around the locator. The kinematic mount includes a plurality of magnets which are in registry with the steel balls on the locator. In operation, a blank part to be machined is placed between a surface of a locator and the retainer ring (fitting within the part carrier). When the locator (with a blank part to be machined) is coupled to the kinematic mount, the part is thus exposed for the desired machining process. Because the locator is removably attachable to the kinematic mount, it can easily be removed from the mount, reversed, and reinserted onto the mount for additional machining. Further, the locator can likewise be removed from the mount and placed onto another tooling machine having a properly aligned kinematic mount. Because of the unique design and use of magnetic forces of the present invention, positioning errors of less than 0.25 micrometer for each machining process can be achieved.

  6. Reversible micromachining locator

    DOE Patents [OSTI]

    Salzer, L.J.; Foreman, L.R.

    1999-08-31

    This invention provides a device which includes a locator, a kinematic mount positioned on a conventional tooling machine, a part carrier disposed on the locator and a retainer ring. The locator has disposed therein a plurality of steel balls, placed in an equidistant position circumferentially around the locator. The kinematic mount includes a plurality of magnets which are in registry with the steel balls on the locator. In operation, a blank part to be machined is placed between a surface of a locator and the retainer ring (fitting within the part carrier). When the locator (with a blank part to be machined) is coupled to the kinematic mount, the part is thus exposed for the desired machining process. Because the locator is removably attachable to the kinematic mount, it can easily be removed from the mount, reversed, and reinserted onto the mount for additional machining. Further, the locator can likewise be removed from the mount and placed onto another tooling machine having a properly aligned kinematic mount. Because of the unique design and use of magnetic forces of the present invention, positioning errors of less than 0.25 micrometer for each machining process can be achieved. 7 figs.

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

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

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

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

  11. Reversible micromachining locator

    DOE Patents [OSTI]

    Salzer, Leander J.; Foreman, Larry R.

    2002-01-01

    A locator with a part support is used to hold a part onto the kinematic mount of a tooling machine so that the part can be held in or replaced in exactly the same position relative to the cutting tool for machining different surfaces of the part or for performing different machining operations on the same or different surfaces of the part. The locator has disposed therein a plurality of steel balls placed at equidistant positions around the planar surface of the locator and the kinematic mount has a plurality of magnets which alternate with grooves which accommodate the portions of the steel balls projecting from the locator. The part support holds the part to be machined securely in place in the locator. The locator can be easily detached from the kinematic mount, turned over, and replaced onto the same kinematic mount or another kinematic mount on another tooling machine without removing the part to be machined from the locator so that there is no need to touch or reposition the part within the locator, thereby assuring exact replication of the position of the part in relation to the cutting tool on the tooling machine for each machining operation on the part.

  12. Object locating system

    DOE Patents [OSTI]

    Novak, James L.; Petterson, Ben

    1998-06-09

    A sensing system locates an object by sensing the object's effect on electric fields. The object's effect on the mutual capacitance of electrode pairs varies according to the distance between the object and the electrodes. A single electrode pair can sense the distance from the object to the electrodes. Multiple electrode pairs can more precisely locate the object in one or more dimensions.

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

  14. Berkeley Lab Shower Locations

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

    LBNL ShowerS Shower facilities are available at several locations: Bldg. 2-Main Entry Men's & Women's Bldg. 6-2204,2206 Men's & Women's (limited building access) Bldg. 46-143 Men's...

  15. Object locating system

    DOE Patents [OSTI]

    Novak, J.L.; Petterson, B.

    1998-06-09

    A sensing system locates an object by sensing the object`s effect on electric fields. The object`s effect on the mutual capacitance of electrode pairs varies according to the distance between the object and the electrodes. A single electrode pair can sense the distance from the object to the electrodes. Multiple electrode pairs can more precisely locate the object in one or more dimensions. 12 figs.

  16. Location and Infrastructure

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

    Facts, Figures » Location and Infrastructure Location and Infrastructure The Lab's mission is to develop and apply science and technology to ensure the safety, security, and reliability of the U.S. nuclear deterrent; reduce global threats; and solve other emerging national security and energy challenges. April 12, 2012 Aerial View of Los Alamos National Laboratory The central Laboratory technical area is featured in this aerial view. Boundary Peak, separating the Santa Fe National Forest and

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

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

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

  20. Data Sources For Emerging Technologies Program MYPP Target Graphs

    Broader source: Energy.gov [DOE]

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

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

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

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

  4. Dipole Well Location

    Energy Science and Technology Software Center (OSTI)

    1998-08-03

    The problem here is to model the three-dimensional response of an electromagnetic logging tool to a practical situation which is often encountered in oil and gas exploration. The DWELL code provide the electromagnetic fields on the axis of a borehole due to either an electric or a magnetic dipole located on the same axis. The borehole is cylindrical, and is located within a stratified formation in which the bedding planes are not horizontal. The anglemore » between the normal to the bedding planes and the axis of the borehole may assume any value, or in other words, the borehole axis may be tilted with respect to the bedding planes. Additionally, all of the formation layers may have invasive zones of drilling mud. The operating frequency of the source dipole(s) extends from a few Hertz to hundreds of Megahertz.« less

  5. Electric current locator

    DOE Patents [OSTI]

    King, Paul E.; Woodside, Charles Rigel

    2012-02-07

    The disclosure herein provides an apparatus for location of a quantity of current vectors in an electrical device, where the current vector has a known direction and a known relative magnitude to an input current supplied to the electrical device. Mathematical constants used in Biot-Savart superposition equations are determined for the electrical device, the orientation of the apparatus, and relative magnitude of the current vector and the input current, and the apparatus utilizes magnetic field sensors oriented to a sensing plane to provide current vector location based on the solution of the Biot-Savart superposition equations. Description of required orientations between the apparatus and the electrical device are disclosed and various methods of determining the mathematical constants are presented.

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

  7. METHOD OF LOCATING GROUNDS

    DOE Patents [OSTI]

    Macleish, K.G.

    1958-02-11

    ABS>This patent presents a method for locating a ground in a d-c circult having a number of parallel branches connected across a d-c source or generator. The complete method comprises the steps of locating the ground with reference to the mildpoint of the parallel branches by connecting a potentiometer across the terminals of the circuit and connecting the slider of the potentiometer to ground through a current indicating instrument, adjusting the slider to right or left of the mildpoint so as to cause the instrument to indicate zero, connecting the terminal of the network which is farthest from the ground as thus indicated by the potentiometer to ground through a condenser, impressing a ripple voltage on the circuit, and then measuring the ripple voltage at the midpoint of each parallel branch to find the branch in which is the lowest value of ripple voltage, and then measuring the distribution of the ripple voltage along this branch to determine the point at which the ripple voltage drops off to zero or substantially zero due to the existence of a ground. The invention has particular application where a circuit ground is present which will disappear if the normal circuit voltage is removed.

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

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

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

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

  13. FFTF Asbestos Location Tracking Program

    SciTech Connect (OSTI)

    Reynolds, J.A.

    1994-09-15

    An Asbestos Location Tracking Program was prepared to list, locate, and determine Asbestos content and to provide baseline {open_quotes}good faith{close_quotes} for yearly condition inspections for the FFTF Plant and buildings and grounds.

  14. DIORAMA Location Type User's Guide

    SciTech Connect (OSTI)

    Terry, James Russell

    2015-01-29

    The purpose of this report is to present the current design and implementation of the DIORAMA location type object (LocationType) and to provide examples and use cases. The LocationType object is included in the diorama-app package in the diorama::types namespace. Abstractly, the object is intended to capture the full time history of the location of an object or reference point. For example, a location may be speci ed as a near-Earth orbit in terms of a two-line element set, in which case the location type is capable of propagating the orbit both forward and backward in time to provide a location for any given time. Alternatively, the location may be speci ed as a xed set of geodetic coordinates (latitude, longitude, and altitude), in which case the geodetic location of the object is expected to remain constant for all time. From an implementation perspective, the location type is de ned as a union of multiple independent objects defi ned in the DIORAMA tle library. Types presently included in the union are listed and described in subsections below, and all conversions or transformation between these location types are handled by utilities provided by the tle library with the exception of the \\special-values" location type.

  15. Spring loaded locator pin assembly

    DOE Patents [OSTI]

    Groll, T.A.; White, J.P.

    1998-03-03

    This invention deals with spring loaded locator pins. Locator pins are sometimes referred to as captured pins. This is a mechanism which locks two items together with the pin that is spring loaded so that it drops into a locator hole on the work piece. 5 figs.

  16. Spring loaded locator pin assembly

    DOE Patents [OSTI]

    Groll, Todd A.; White, James P.

    1998-01-01

    This invention deals with spring loaded locator pins. Locator pins are sometimes referred to as captured pins. This is a mechanism which locks two items together with the pin that is spring loaded so that it drops into a locator hole on the work piece.

  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. Proximity graphs based multi-scale image segmentation

    SciTech Connect (OSTI)

    Skurikhin, Alexei N

    2008-01-01

    We present a novel multi-scale image segmentation approach based on irregular triangular and polygonal tessellations produced by proximity graphs. Our approach consists of two separate stages: polygonal seeds generation followed by an iterative bottom-up polygon agglomeration into larger chunks. We employ constrained Delaunay triangulation combined with the principles known from the visual perception to extract an initial ,irregular polygonal tessellation of the image. These initial polygons are built upon a triangular mesh composed of irregular sized triangles and their shapes are ad'apted to the image content. We then represent the image as a graph with vertices corresponding to the polygons and edges reflecting polygon relations. The segmentation problem is then formulated as Minimum Spanning Tree extraction. We build a successive fine-to-coarse hierarchy of irregular polygonal grids by an iterative graph contraction constructing Minimum Spanning Tree. The contraction uses local information and merges the polygons bottom-up based on local region-and edge-based characteristics.

  2. Precision zero-home locator

    DOE Patents [OSTI]

    Stone, William J.

    1986-01-01

    A zero-home locator includes a fixed phototransistor switch and a moveable actuator including two symmetrical, opposed wedges, each wedge defining a point at which switching occurs. The zero-home location is the average of the positions of the points defined by the wedges.

  3. Mobile Alternative Fueling Station Locator

    SciTech Connect (OSTI)

    Not Available

    2009-04-01

    The Department of Energy's Alternative Fueling Station Locator is available on-the-go via cell phones, BlackBerrys, or other personal handheld devices. The mobile locator allows users to find the five closest biodiesel, electricity, E85, hydrogen, natural gas, and propane fueling sites using Google technology.

  4. Precision zero-home locator

    DOE Patents [OSTI]

    Stone, W.J.

    1983-10-31

    A zero-home locator includes a fixed phototransistor switch and a moveable actuator including two symmetrical, opposed wedges, each wedge defining a point at which switching occurs. The zero-home location is the average of the positions of the points defined by the wedges.

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

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

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

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

    2014-12-10

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

  7. Bayesian Mulitple-Event Location

    Energy Science and Technology Software Center (OSTI)

    2010-03-30

    Bayesloc is a statistical model of the multiple seismic location system, including event hypocenters, corrections to model-based travel time predictions, assessments precision for measurement phase arrival times, and phase lavels which indicate phase ray path.

  8. Mobile Alternative Fueling Station Locator

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

    Energy - Energy Efficiency & Renewable Energy Alternative Fueling Station Locator Fuel Type Biodiesel (B20 and above) Compressed Natural Gas Electric Ethanol (E85) Hydrogen Liquefied Natural Gas (LNG) Liquefied Petroleum Gas (Propane) Location Enter a city, postal code, or address Include private stations Not all stations are open to the public. Choose this option to also search private fueling stations. Search Caution: The AFDC recommends that users verify that stations are open, available

  9. Discrete Mathematical Approaches to Graph-Based Traffic Analysis

    SciTech Connect (OSTI)

    Joslyn, Cliff A.; Cowley, Wendy E.; Hogan, Emilie A.; Olsen, Bryan K.

    2014-04-01

    Modern cyber defense and anlaytics requires general, formal models of cyber systems. Multi-scale network models are prime candidates for such formalisms, using discrete mathematical methods based in hierarchically-structured directed multigraphs which also include rich sets of labels. An exemplar of an application of such an approach is traffic analysis, that is, observing and analyzing connections between clients, servers, hosts, and actors within IP networks, over time, to identify characteristic or suspicious patterns. Towards that end, NetFlow (or more generically, IPFLOW) data are available from routers and servers which summarize coherent groups of IP packets flowing through the network. In this paper, we consider traffic analysis of Netflow using both basic graph statistics and two new mathematical measures involving labeled degree distributions and time interval overlap measures. We do all of this over the VAST test data set of 96M synthetic Netflow graph edges, against which we can identify characteristic patterns of simulated ground-truth network attacks.

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

    SciTech Connect (OSTI)

    Groer, Christopher S; Sullivan, Blair D; Weerapurage, Dinesh P

    2012-10-01

    It is well-known that dynamic programming algorithms can utilize tree decompositions to provide a way to solve some \\emph{NP}-hard problems on graphs where the complexity is polynomial in the number of nodes and edges in the graph, but exponential in the width of the underlying tree decomposition. However, there has been relatively little computational work done to determine the practical utility of such dynamic programming algorithms. We have developed software to construct tree decompositions using various heuristics and have created a fast, memory-efficient dynamic programming implementation for solving maximum weighted independent set. We describe our software and the algorithms we have implemented, focusing on memory saving techniques for the dynamic programming. We compare the running time and memory usage of our implementation with other techniques for solving maximum weighted independent set, including a commercial integer programming solver and a semi-definite programming solver. Our results indicate that it is possible to solve some instances where the underlying decomposition has width much larger than suggested by the literature. For certain types of problems, our dynamic programming code runs several times faster than these other methods.

  11. LOCATION: Johnson County Sheriff's Office

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

    LOCATION: Johnson County Sheriff's Office Criminalistics Laboratory 11890 Sunset Drive Olathe, Kansas 66061 DATE: JULY 15TH - JULY 18TH, 2013 TUITION: MAFS MEMBERS: $550 Non-MAFS Members: $650 HOW TO ENROLL: Follow this link and complete on-line registration. Pay- ment may be made online via PayPal or a company check may be mailed to MAFS Treasurer. Payment information is all located at the registration site: http://www.mafs.net/summer-workshop LODGING AND TRAVEL: Training Rate $107.77 per night

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

    SciTech Connect (OSTI)

    Bridges, Robert A; Collins, John P; Ferragut, Erik M; Laska, Jason A; Sullivan, Blair D

    2015-01-01

    This work presents a novel modeling and analysis framework for graph sequences which addresses the challenge of detecting and contextualizing anomalies in labelled, streaming graph data. We introduce a generalization of the BTER model of Seshadhri et al. by adding flexibility to community structure, and use this model to perform multi-scale graph anomaly detection. Specifically, probability models describing coarse subgraphs are built by aggregating probabilities at finer levels, and these closely related hierarchical models simultaneously detect deviations from expectation. This technique provides insight into a graph's structure and internal context that may shed light on a detected event. Additionally, this multi-scale analysis facilitates intuitive visualizations by allowing users to narrow focus from an anomalous graph to particular subgraphs or nodes causing the anomaly. For evaluation, two hierarchical anomaly detectors are tested against a baseline Gaussian method on a series of sampled graphs. We demonstrate that our graph statistics-based approach outperforms both a distribution-based detector and the baseline in a labeled setting with community structure, and it accurately detects anomalies in synthetic and real-world datasets at the node, subgraph, and graph levels. To illustrate the accessibility of information made possible via this technique, the anomaly detector and an associated interactive visualization tool are tested on NCAA football data, where teams and conferences that moved within the league are identified with perfect recall, and precision greater than 0.786.

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

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

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

  16. WINDExchange: School Wind Project Locations

    Wind Powering America (EERE)

    School Wind Project Locations Tips for Using the Google Map On top of the Google Map, use the Country, State, Project Status, and Project Type dropdown lists to filter projects. Along the left margin, use the zooming meter to zoom in or out of your view. In the top left corner, click Reset View to reset all the filters and zooming. Click on Map, Satellite, and Terrain to view the map three different ways. Click and drag the map to move it around. Use the right scroll bar to view the project

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

    SciTech Connect (OSTI)

    Zhukovskii, Maksim E

    2012-07-31

    We study zero-one laws for properties of random distance graphs. Properties written in a first-order language are considered. For p(N) such that pN{sup {alpha}}{yields}{infinity} as N{yields}{infinity}, and (1-p)N{sup {alpha}} {yields} {infinity} as N {yields} {infinity} for any {alpha}>0, we succeed in refuting the law. In this connection, we consider a weak zero-one j-law. For this law, we obtain results for random distance graphs which are similar to the assertions concerning the classical zero-one law for random graphs. Bibliography: 18 titles.

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

  19. Short range radio locator system

    DOE Patents [OSTI]

    McEwan, Thomas E.

    1996-01-01

    A radio location system comprises a wireless transmitter that outputs two megahertz period bursts of two gigahertz radar carrier signals. A receiver system determines the position of the transmitter by the relative arrival of the radar bursts at several component receivers set up to have a favorable geometry and each one having a known location. One receiver provides a synchronizing gating pulse to itself and all the other receivers to sample the ether for the radar pulse. The rate of the synchronizing gating pulse is slightly offset from the rate of the radar bursts themselves, so that each sample collects one finely-detailed piece of information about the time-of-flight of the radar pulse to each receiver each pulse period. Thousands of sequential pulse periods provide corresponding thousand of pieces of information about the time-of-flight of the radar pulse to each receiver, in expanded, not real time. Therefore the signal processing can be done with relatively low-frequency, inexpensive components. A conventional microcomputer is then used to find the position of the transmitter by geometric triangulation based on the relative time-of-flight information.

  20. Short range radio locator system

    DOE Patents [OSTI]

    McEwan, T.E.

    1996-12-31

    A radio location system comprises a wireless transmitter that outputs two megahertz period bursts of two gigahertz radar carrier signals. A receiver system determines the position of the transmitter by the relative arrival of the radar bursts at several component receivers set up to have a favorable geometry and each one having a known location. One receiver provides a synchronizing gating pulse to itself and all the other receivers. The rate of the synchronizing gating pulse is slightly offset from the rate of the radar bursts themselves, so that each sample collects one finely-detailed piece of information about the time-of-flight of the radar pulse to each receiver each pulse period. Thousands of sequential pulse periods provide corresponding thousand of pieces of information about the time-of-flight of the radar pulse to each receiver, in expanded, not real time. Therefore the signal processing can be done with relatively low-frequency, inexpensive components. A conventional microcomputer is then used to find the position of the transmitter by geometric triangulation based on the relative time-of-flight information. 5 figs.

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

  2. GE Global Research Locations | GE Global Research

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

    Locations GE Global Research is innovating around the clock. Select one of our locations to learn more about operations there.GE Global Research is innovating around the clock. Select a location to learn more about our operations. Home > Locations GE Global Research is ALWAYS OPEN Already know about our locations? Experience a special look at a day in our life around the world! See What We're Doing Dhahran, Saudi Arabia Founded: 2015 Employees: 15 Focus Areas: Material Characterization,

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

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

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

  6. Helicopter magnetic survey conducted to locate wells

    SciTech Connect (OSTI)

    Veloski, G.A.; Hammack, R.W.; Stamp, V.; Hall, R.; Colina, K.

    2008-07-01

    A helicopter magnetic survey was conducted in August 2007 over 15.6 sq mi at the Naval Petroleum Reserve No. 3s (NPR-3) Teapot Dome Field near Casper, Wyoming. The surveys purpose was to accurately locate wells drilled there during more than 90 years of continuous oilfield operation. The survey was conducted at low altitude and with closely spaced flight lines to improve the detection of wells with weak magnetic response and to increase the resolution of closely spaced wells. The survey was in preparation for a planned CO2 flood for EOR, which requires a complete well inventory with accurate locations for all existing wells. The magnetic survey was intended to locate wells missing from the well database and to provide accurate locations for all wells. The ability of the helicopter magnetic survey to accurately locate wells was accomplished by comparing airborne well picks with well locations from an intense ground search of a small test area.

  7. Sandia National Laboratories: Locations: Kauai Test Facility

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

    KTF provides the following location-enabled operations: Joint experiments with launches from Vandenberg Air Force Base or orbiting objects Experiments on phenomena occurring in the ...

  8. Hyperspectral Remote Sensing Techniques For Locating Geothermal...

    Open Energy Info (EERE)

    Remote Sensing Techniques For Locating Geothermal Resources Jump to: navigation, search OpenEI Reference LibraryAdd to library Poster: Hyperspectral Remote Sensing Techniques For...

  9. Population Sensitivity Evaluation of Two Candidate Locations...

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

    Population Sensitivity Evaluation of Two Candidate Locations for Possible Small Modular Reactor Siting (3.84 MB) More Documents & Publications Evaluation of Proposed Hampton Roads ...

  10. Energy Storage Demonstration Project Locations | Department of...

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

    Map of the United States showing the location of Energy Storage Demonstration projects created with funding from the Smart Grid Demonstration Project, funded through the American ...

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

  12. Method of locating underground mines fires

    DOE Patents [OSTI]

    Laage, Linneas; Pomroy, William

    1992-01-01

    An improved method of locating an underground mine fire by comparing the pattern of measured combustion product arrival times at detector locations with a real time computer-generated array of simulated patterns. A number of electronic fire detection devices are linked thru telemetry to a control station on the surface. The mine's ventilation is modeled on a digital computer using network analysis software. The time reguired to locate a fire consists of the time required to model the mines' ventilation, generate the arrival time array, scan the array, and to match measured arrival time patterns to the simulated patterns.

  13. Assessment of User Home Location Geoinference Methods

    SciTech Connect (OSTI)

    Harrison, Joshua J.; Bell, Eric B.; Corley, Courtney D.; Dowling, Chase P.; Cowell, Andrew J.

    2015-05-29

    This study presents an assessment of multiple approaches to determine the home and/or other important locations to a Twitter user. In this study, we present a unique approach to the problem of geotagged data sparsity in social media when performing geoinferencing tasks. Given the sparsity of explicitly geotagged Twitter data, the ability to perform accurate and reliable user geolocation from a limited number of geotagged posts has proven to be quite useful. In our survey, we have achieved accuracy rates of over 86% in matching Twitter user profile locations with their inferred home locations derived from geotagged posts.

  14. Mobile Truck Stop Electrification Site Locator

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

    of the zip code area instead of the actual location. If you're having difficulty, please contact the technical response team at 800-254-6735. They will be able to assist you. TSE...

  15. Sandia National Laboratories: Locations: Livermore, California: Visiting

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

    Sandia/California: Maps and Directions Locations Maps and Directions to Sandia/California Sandia/California is located at 7011 East Avenue in Livermore, Calif., a suburban community about 45 miles east of San Francisco. Lawrence Livermore National Laboratory (LLNL) is directly across the street from Sandia on the north side of East Avenue. Access to Sandia's California site is limited to those with authorized badges. If you do not have an authorized badge, be sure to make arrangements with

  16. Sandia National Laboratories: Locations: Livermore, California: Visiting

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

    Sandia/California California Livermore, California administration building Our location and hours of operation Sandia/California is located at 7011 East Avenue in Livermore, Calif., a suburban community about 45 miles east of San Francisco. Positioned at the eastern edge of the San Francisco Bay Area, Sandia is within easy commuting distance of many affordable housing communities in San Joaquin County and the Central Valley. The official hours of operation at Sandia/California are from 7:30

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

    SciTech Connect (OSTI)

    Chew, Geoffrey F.

    2003-05-05

    A divergence-free, parameter-free, path-based discrete-time quantum dynamics is designed to not only enlarge the achievements of general relativity and the standard particle model, by approximations at spacetime scales far above Planck scale while far below Hubble scale, but to allow tackling of hitherto inaccessible questions. ''Path space'' is larger than and precursor to Hilbert-space basis. The wave-function-propagating paths are action-carrying structured graphs-cubic and quartic structured vertices connected by structured ''fermionic'' or ''bosonic'' ''particle'' and ''nonparticle'' arcs. A Planck-scale path step determines the gravitational constant while controlling all graph structure. The basis of the theory's (zero-rest-mass) elementary-particle Hilbert space (which includes neither gravitons nor scalar bosons) resides in particle arcs. Nonparticle arcs within a path are responsible for energy and rest mass.

  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. The d-edge shortest-path problem for a Monge graph

    SciTech Connect (OSTI)

    Bein, W.W.; Larmore, L.L.; Park, J.K.

    1992-07-14

    A complete edge-weighted directed graph on vertices 1,2,...,n that assigns cost c(i,j) to the edge (i,j) is called Monge if its edge costs form a Monge array, i.e., for all i < k and j < l, c[i, j]+c[k,l]{le} < c[i,l]+c[k,j]. One reason Monge graphs are interesting is that shortest paths can be computed quite quickly in such graphs. In particular, Wilber showed that the shortest path from vertex 1 to vertex n of a Monge graph can be computed in O(n) time, and Aggarwal, Klawe, Moran, Shor, and Wilber showed that the shortest d-edge 1-to-n path (i.e., the shortest path among all 1-to-n paths with exactly d edges) can be computed in O(dn) time. This paper`s contribution is a new algorithm for the latter problem. Assuming 0 {le} c[i,j] {le} U and c[i,j + 1] + c[i + 1,j] {minus} c[i,j] {minus} c[i + 1, j + 1] {ge} L > 0 for all i and j, our algorithm runs in O(n(1 + 1g(U/L))) time. Thus, when d {much_gt} 1 + 1g(U/L), our algorithm represents a significant improvement over Aggarwal et al.`s O(dn)-time algorithm. We also present several applications of our algorithm; they include length-limited Huffman coding, finding the maximum-perimeter d-gon inscribed in a given convex n-gon, and a digital-signal-compression problem.

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

    Gasoline and Diesel Fuel Update (EIA)

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

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

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

    SciTech Connect (OSTI)

    Chavarría-Miranda, Daniel; Halappanavar, Mahantesh; Kalyanaraman, Anantharaman

    2014-12-01

    In an era when power constraints and data movement are proving to be significant barriers for the application of high-end computing, the Tilera many-core architecture offers a low-power platform exhibiting many important characteristics of future systems, including a large number of simple cores, a sophisticated network-on-chip, and fine-grained control over memory and caching policies. While this emerging architecture has been previously studied for structured compute-intensive kernels, benchmarking the platform for data-bound, irregular applications present significant challenges that have remained unexplored. Community detection is an advanced prototypical graph-theoretic operation with applications in numerous scientific domains including life sciences, cyber security, and power systems. In this work, we explore multiple design strategies toward developing a scalable tool for community detection on the Tilera platform. Using several memory layout and work scheduling techniques we demonstrate speedups of up to 46x on 36 cores of the Tilera TileGX36 platform over the best serial implementation, and also show results that have comparable quality and performance to mainstream x86 platforms. To the best of our knowledge this is the first work addressing graph algorithms on the Tilera platform. This study demonstrates that through careful design space exploration, low-power many-core platforms like Tilera can be effectively exploited for graph algorithms that that embody all the essential characteristics of an irregular application.

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

  4. Utility Locating in the DOE Environment

    SciTech Connect (OSTI)

    Clark Scott; Gail Heath

    2006-04-01

    Some advances have been made in utility locating in recent years and standards have been recently published to try and categorize the level of information known about the utility in the subsurface. At the same time some characterization about the level of effort or technology in the geophysicist approach to utility locating may be generalized. The DOE environment poses some added difficulties and this presentation covers these issues, costs and the technical approach that has been developed at the INEEL to prevent utility hits and how it fits into the generalized classification of effort.

  5. ARM: Ship navigational location and attitude: Position and Heading...

    Office of Scientific and Technical Information (OSTI)

    Ship navigational location and attitude: Position and Heading Data Title: ARM: Ship navigational location and attitude: Position and Heading Data Ship navigational location and ...

  6. Research Site Locations for Current and Former EERE Postdoctoral...

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

    Research Site Locations for Current and Former EERE Postdoctoral Awards Research Site Locations for Current and Former EERE Postdoctoral Awards Research Site Locations for Current ...

  7. Smart Grid Demonstration Project Locations | Department of Energy

    Office of Environmental Management (EM)

    Demonstration Project Locations Smart Grid Demonstration Project Locations Map of the United States showing the location of Smart Grid Demonstration projects created with funding ...

  8. TWRS information locator database system design description

    SciTech Connect (OSTI)

    Knutson, B.J.

    1996-09-13

    This document gives an overview and description of the Tank Waste Remediation System (TWRS) Information Locator Database (ILD)system design. The TWRS ILD system is an inventory of information used in the TWRS Systems Engineering process to represent the TWRS Technical Baseline. The inventory is maintained in the form of a relational database developed in Paradox 4.5.

  9. Method for locating defective nuclear fuel elements

    SciTech Connect (OSTI)

    Lawrie, W.E.; White, N.W.; Womack, R.E.

    1982-02-02

    Defects in nuclear fuel elements are ascertained and located within an assembled fuel assembly by ultrasonic means. In a typical embodiment of the invention, an ultrasonic search unit is positioned within the fuel assembly opposite the lower plenum of the fuel element to be tested. An ultrasonic pulse is radially projected into the element. Defective fuel elements are ascertained by ultrasonic reflection measurements.

  10. Leak locating microphone, method and system for locating fluid leaks in pipes

    DOE Patents [OSTI]

    Kupperman, David S.; Spevak, Lev

    1994-01-01

    A leak detecting microphone inserted directly into fluid within a pipe includes a housing having a first end being inserted within the pipe and a second opposed end extending outside the pipe. A diaphragm is mounted within the first housing end and an acoustic transducer is coupled to the diaphragm for converting acoustical signals to electrical signals. A plurality of apertures are provided in the housing first end, the apertures located both above and below the diaphragm, whereby to equalize fluid pressure on either side of the diaphragm. A leak locating system and method are provided for locating fluid leaks within a pipe. A first microphone is installed within fluid in the pipe at a first selected location and sound is detected at the first location. A second microphone is installed within fluid in the pipe at a second selected location and sound is detected at the second location. A cross-correlation is identified between the detected sound at the first and second locations for identifying a leak location.

  11. VCSEL fault location apparatus and method

    DOE Patents [OSTI]

    Keeler, Gordon A.; Serkland, Darwin K.

    2007-05-15

    An apparatus for locating a fault within an optical fiber is disclosed. The apparatus, which can be formed as a part of a fiber-optic transmitter or as a stand-alone instrument, utilizes a vertical-cavity surface-emitting laser (VCSEL) to generate a test pulse of light which is coupled into an optical fiber under test. The VCSEL is subsequently reconfigured by changing a bias voltage thereto and is used as a resonant-cavity photodetector (RCPD) to detect a portion of the test light pulse which is reflected or scattered from any fault within the optical fiber. A time interval .DELTA.t between an instant in time when the test light pulse is generated and the time the reflected or scattered portion is detected can then be used to determine the location of the fault within the optical fiber.

  12. Detrecting and Locating Partial Discharges in Transformers

    SciTech Connect (OSTI)

    Shourbaji, A.; Richards, R.; Kisner, R. A.; Hardy, J.

    2005-02-04

    A collaborative research between the Oak Ridge National Laboratory (ORNL), the American Electric Power (AEP), the Tennessee Valley Authority (TVA), and the State of Ohio Energy Office (OEO) has been formed to conduct a feasibility study to detect and locate partial discharges (PDs) inside large transformers. The success of early detection of the PDs is necessary to avoid costly catastrophic failures that can occur if the process of PD is ignored. The detection method under this research is based on an innovative technology developed by ORNL researchers using optical methods to sense the acoustical energy produced by the PDs. ORNL researchers conducted experimental studies to detect PD using an optical fiber as an acoustic sensor capable of detecting acoustical disturbances at any point along its length. This technical approach also has the potential to locate the point at which the PD was sensed within the transformer. Several optical approaches were experimentally investigated, including interferometric detection of acoustical disturbances along the sensing fiber, light detection and ranging (LIDAR) techniques using frequency modulation continuous wave (FMCW), frequency modulated (FM) laser with a multimode fiber, FM laser with a single mode fiber, and amplitude modulated (AM) laser with a multimode fiber. The implementation of the optical fiber-based acoustic measurement technique would include installing a fiber inside a transformer allowing real-time detection of PDs and determining their locations. The fibers are nonconductive and very small (core plus cladding are diameters of 125 μm for single-mode fibers and 230 μm for multimode fibers). The research identified the capabilities and limitations of using optical technology to detect and locate sources of acoustical disturbances such as in PDs in large transformers. Amplitude modulation techniques showed the most promising results and deserve further research to better quantify the technique’s sensitivity

  13. Our Locations | National Nuclear Security Administration | (NNSA)

    National Nuclear Security Administration (NNSA)

    Locations The NNSA's nuclear security enterprise spans eight sites, including three national laboratories, with more than six decades of cutting-edge nuclear security experience. That history and technical expertise enables NNSA to accomplish its work across its four mission areas. The NNSA's nuclear security enterprise spans eight sites, including three national laboratories, with more than six decades of cutting-edge nuclear security experience. That history and technical expertise enables

  14. google-map-of-argonne-location

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

    goals NNSA Releases 2015 Enterprise Strategic Vision Today, we are pleased to announce the publication of the 2015 DOE/NNSA Enterprise Strategic Vision. This document aligns with the Department of Energy Strategic Plan for 2014-2018 and provides a framework for integrating our missions and direction for pursuing DOE's strategic goals. The...

    Google Map of Argonne Location Map of Building 222 (TRACC)- Green Arrow TRACC RESEARCH Computational Fluid Dynamics Computational Structural Mechanics

  15. Thickness measurement locations of mechanical integrity

    SciTech Connect (OSTI)

    Decker, J.R.; Rivas, N.

    1996-07-01

    This paper will describe the importance of establishing thickness measurement location (TNE) criteria. It will also seek to quantify the frequency of inspections and review the methods for establishing techniques to ensure reliability and repeatability of inspections at TMLs using qualified inspectors. Also discussed will be the most useful way to document the results of an inspection and how to effectively maintain consistency in the mechanical integrity program. It reviews different methods of inspection and uses lessons learned from in-service experience with numerous mechanical projects in the petrochemical industry. The importance of qualified inspectors, quality inspection, electronic data acquisition and electronic data storage will be discussed.

  16. Positron Scanner for Locating Brain Tumors

    DOE R&D Accomplishments [OSTI]

    Rankowitz, S.; Robertson, J. S.; Higinbotham, W. A.; Rosenblum, M. J.

    1962-03-01

    A system is described that makes use of positron emitting isotopes for locating brain tumors. This system inherently provides more information about the distribution of radioactivity in the head in less time than existing scanners which use one or two detectors. A stationary circular array of 32 scintillation detectors scans a horizontal layer of the head from many directions simultaneously. The data, consisting of the number of counts in all possible coincidence pairs, are coded and stored in the memory of a Two-Dimensional Pulse-Height Analyzer. A unique method of displaying and interpreting the data is described that enables rapid approximate analysis of complex source distribution patterns. (auth)

  17. Date Time Event Description/Participants Location

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

    Updated: 06/11/2015 Date Time Event Description/Participants Location Point of Contact 11 thru 12 All Day Meeting Todd Allen, deputy director of Science and Technology at INL, has been invited to speak at the Idaho Society of Professional Engineers (ISPE) annual meeting. Coeur d'Alene, ID Sara Prentice, 526-9591 18 9:00 AM Education Outreach Approximately 50 iSTEM students and instructors will tour various INL Idaho Falls facilities Idaho Falls, ID INL Tours Office, 526-0050 23 All Day Meeting

  18. Algae Biofuels Co-Location Assessment Tool

    Energy Science and Technology Software Center (OSTI)

    2013-09-18

    ABCLAT was built to help any model user with spatially explicit Nitrogen, Phosphorous, and Carbon Dioxide nutrient flux information, and solar resource information evaluate algal cultivation potential. Initial applications of this modeling framework include Algae Biofuels Co-Location Assessment Tool Canada and Australia. The Canadian application was copyrighted November 29th 2011 as the Algae Biofuels Co-Location Assessment Tool for Canada. This copyright assertion is for the general framework from which any country or region with themore » requisite data could create a regionally specific application. The ABCLAT model framework developed by SNL looks at the growth potential in a given region as a function of available nutrients from wastewater and other sources, carbon dioxide from power plants, available solar potential, and if available, land cover and use information. The model framework evaluates the biomass potential, fixed carbon dioxide, potential algal biocrude and required land area for nutrient sources. ABCLAT is built with an object-oriented software program that can provide an easy to use interface for exploring questions related to aigal biomass production.« less

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

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

    SciTech Connect (OSTI)

    Bader, Brett William; Harshman, Richard A. (University of Western Ontario London, Ontario, Canada); Kolda, Tamara Gibson

    2006-12-01

    DEDICOM is a linear algebra model for analyzing intrinsically asymmetric relationships, such as trade among nations or the exchange of emails among individuals. DEDICOM decomposes a complex pattern of observed relations among objects into a sum of simpler patterns of inferred relations among latent components of the objects. Three-way DEDICOM is a higher-order extension of the model that incorporates a third mode of the data, such as time, giving it stronger uniqueness properties and consequently enhancing interpretability of solutions. In this paper, we present algorithms for computing these decompositions on large, sparse data as well as a variant for computing an asymmetric nonnegative factorization. When we apply these techniques to adjacency arrays arising from directed graphs with edges labeled by time, we obtain a smaller graph on latent semantic dimensions and gain additional information about their changing relationships over time. We demonstrate these techniques on the Enron email corpus to learn about the social networks and their transient behavior. The mixture of roles assigned to individuals by DEDICOM showed strong correspondence with known job classifications and revealed the patterns of communication between these roles. Changes in the communication pattern over time, e.g., between top executives and the legal department, were also apparent in the solutions.

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

  2. Regional Model Calibration for Improving Seismic Location

    SciTech Connect (OSTI)

    Swenson, J.L.; Schultz, C.A.; Myers, S.C.

    2000-07-14

    Accurate seismic event location is integral to the effective monitoring of the Comprehensive Nuclear-Test-Ban Treaty (CTBT), as well as being a fundamental component of earthquake source characterization. To account for the effects of crustal and mantle structure on seismic travel times, and to improve seismic event location in the Middle East and North Africa (MENA), we are developing a set of radially heterogeneous and azimuthally invariant travel-time models of the crust and upper mantle for each MENA seismic station. We begin by developing an average one-dimensional velocity model that minimizes the P-phase travel-time residuals from regional through teleseismic distance at each station. To do this we (1) generate a suite of 1-D velocity models of the earth, (2) compute travel times through the 1-D models using a tau-p formulation to produce standard travel-time tables, and (3) minimize the root-mean-square (rms) residuals between the P-phase arrivals predicted by each model and a groomed set of ISC P-phase arrival times (Engdahl et al., 1991). Once we have an average one-dimensional velocity model that minimizes the P-phase travel-time residuals for all distances, we repeat steps 1 through 3, systematically perturbing the travel-time model and using a grid search procedure to optimize models within regional, upper mantle, and teleseismic distance ranges. Regionalized models are combined into one two-dimensional model, using indicator functions and smoother methodologies to reduce distance and depth discontinuity artifacts between the individual models. Preliminary results of this study at a subset of MENA stations show that we are improving predictability with these models. Cross-validating the travel-time predictions with an independent data set demonstrates a marked reduction in the variance of the travel-time model error distributions. We demonstrate the improvement provided by these 2-D models by relocating the 1991 Racha aftershock sequence. We will

  3. Location Independent Professional Project: A Pilot Study

    SciTech Connect (OSTI)

    Hudson, J.A.; Long, J.P.; Miller, M.M.

    1999-02-01

    This pilot study project explored the problem of providing access to the nomadic worker who desires to connect a computer through network access points at a number of different locations within the SNL/NM campus as well as outside the campus. The design and prototype development gathered knowledge that may allow a design to be developed that could be extended to a larger number of SNL/NM network drop boxes. The focus was to provide a capability for a worker to access the SNL IRN from a network drop box (e.g. in a conference room) as easily as when accessing the computer network from the office normally used by the worker. Additional study was done on new methods to authenticate the off campus worker, and protect and control access to data.

  4. Locating hardware faults in a parallel computer

    DOE Patents [OSTI]

    Archer, Charles J.; Megerian, Mark G.; Ratterman, Joseph D.; Smith, Brian E.

    2010-04-13

    Locating hardware faults in a parallel computer, including defining within a tree network of the parallel computer two or more sets of non-overlapping test levels of compute nodes of the network that together include all the data communications links of the network, each non-overlapping test level comprising two or more adjacent tiers of the tree; defining test cells within each non-overlapping test level, each test cell comprising a subtree of the tree including a subtree root compute node and all descendant compute nodes of the subtree root compute node within a non-overlapping test level; performing, separately on each set of non-overlapping test levels, an uplink test on all test cells in a set of non-overlapping test levels; and performing, separately from the uplink tests and separately on each set of non-overlapping test levels, a downlink test on all test cells in a set of non-overlapping test levels.

  5. Alternative Fuels Data Center: Biodiesel Fueling Station Locations

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

    Fueling Station Locations to someone by E-mail Share Alternative Fuels Data Center: Biodiesel Fueling Station Locations on Facebook Tweet about Alternative Fuels Data Center: Biodiesel Fueling Station Locations on Twitter Bookmark Alternative Fuels Data Center: Biodiesel Fueling Station Locations on Google Bookmark Alternative Fuels Data Center: Biodiesel Fueling Station Locations on Delicious Rank Alternative Fuels Data Center: Biodiesel Fueling Station Locations on Digg Find More places to

  6. Alternative Fuels Data Center: Ethanol Fueling Station Locations

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

    Station Locations to someone by E-mail Share Alternative Fuels Data Center: Ethanol Fueling Station Locations on Facebook Tweet about Alternative Fuels Data Center: Ethanol Fueling Station Locations on Twitter Bookmark Alternative Fuels Data Center: Ethanol Fueling Station Locations on Google Bookmark Alternative Fuels Data Center: Ethanol Fueling Station Locations on Delicious Rank Alternative Fuels Data Center: Ethanol Fueling Station Locations on Digg Find More places to share Alternative

  7. Alternative Fuels Data Center: Natural Gas Fueling Station Locations

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

    Station Locations to someone by E-mail Share Alternative Fuels Data Center: Natural Gas Fueling Station Locations on Facebook Tweet about Alternative Fuels Data Center: Natural Gas Fueling Station Locations on Twitter Bookmark Alternative Fuels Data Center: Natural Gas Fueling Station Locations on Google Bookmark Alternative Fuels Data Center: Natural Gas Fueling Station Locations on Delicious Rank Alternative Fuels Data Center: Natural Gas Fueling Station Locations on Digg Find More places to

  8. Alternative Fuels Data Center: Propane Fueling Station Locations

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

    Station Locations to someone by E-mail Share Alternative Fuels Data Center: Propane Fueling Station Locations on Facebook Tweet about Alternative Fuels Data Center: Propane Fueling Station Locations on Twitter Bookmark Alternative Fuels Data Center: Propane Fueling Station Locations on Google Bookmark Alternative Fuels Data Center: Propane Fueling Station Locations on Delicious Rank Alternative Fuels Data Center: Propane Fueling Station Locations on Digg Find More places to share Alternative

  9. Location performance objectives for the NNWSI area-to-location screening activity

    SciTech Connect (OSTI)

    Sinnock, S.; Fernandez, J.A.

    1984-01-01

    Fifty-four objectives were identified to guide the screening of the Nevada Research and Development Area of the Nevada Test Site for relatively favorable locations for the disposal of nuclear waste in a mined geologic repository. The objectives were organized as a hierarchy composed of 4 upper-level, 12 middle-level, and 38 lower-level objectives. The four upper-level objectives account for broad national goals to contain and isolate nuclear waste in an environmentally sound and economically acceptable manner. The middle-level objectives correspond to topical categories that logically relate the upper-level objectives to site-specific concerns such as seismicity, sensitive species, and flooding hazards (represented by the lower-level objectives). The relative merits of alternative locations were compared by an application of decision analysis based on standard utility theory. The relative favorabilities of pertinent physical conditions at each alternative location were weighted in relation to the importance of objectives, and summed to produce maps indicating the most and the least favorable locations. Descriptions of the objectives were organized by the hierarchical format; they detail the applicability of each objective to geologic repository siting, previously published siting criteria corresponding to each objective, and the rationale for the weight assigned to each objective, and the pertinent attributes for evaluating locations with respect to each objective. 51 references, 47 figures, 4 tables.

  10. Property:EIA/861/NercLocation | Open Energy Information

    Open Energy Info (EERE)

    type String. Description: Nerc Location NERC Location: The North American Electric Reliability Corporation (NERC) region where the utility has its primary business operations...

  11. Energy Department Announces Locations of Consent-Based Siting...

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

    Announces Locations of Consent-Based Siting Initiative's Eight Public Meetings Energy Department Announces Locations of Consent-Based Siting Initiative's Eight Public Meetings ...

  12. Energy Department Announces Student Teams, Location for Solar...

    Office of Environmental Management (EM)

    Student Teams, Location for Solar Decathlon 2015 Energy Department Announces Student Teams, Location for Solar Decathlon 2015 February 13, 2014 - 1:00pm Addthis News Media Contact ...

  13. Energy Department Announces Student Teams, New Location for Solar...

    Office of Environmental Management (EM)

    Student Teams, New Location for Solar Decathlon 2013 Energy Department Announces Student Teams, New Location for Solar Decathlon 2013 January 26, 2012 - 10:56am Addthis WASHINGTON, ...

  14. Major DOE Biofuels Project Locations | Department of Energy

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

    Biomass Program Major DOE Biofuels Project Locations in the United States Major DOE Biofuels Project Locations (63.81 KB) More Documents & Publications Major DOE Biofuels Project ...

  15. New Location for Solar Decathlon 2011 Announced | Department...

    Office of Environmental Management (EM)

    Location for Solar Decathlon 2011 Announced New Location for Solar Decathlon 2011 ... check out the computer-animated video the New Jersey team submitted to walk us through ...

  16. Fault Locating, Prediction and Protection (FLPPS)

    SciTech Connect (OSTI)

    Yinger, Robert, J.; Venkata, S., S.; Centeno, Virgilio

    2010-09-30

    One of the main objectives of this DOE-sponsored project was to reduce customer outage time. Fault location, prediction, and protection are the most important aspects of fault management for the reduction of outage time. In the past most of the research and development on power system faults in these areas has focused on transmission systems, and it is not until recently with deregulation and competition that research on power system faults has begun to focus on the unique aspects of distribution systems. This project was planned with three Phases, approximately one year per phase. The first phase of the project involved an assessment of the state-of-the-art in fault location, prediction, and detection as well as the design, lab testing, and field installation of the advanced protection system on the SCE Circuit of the Future located north of San Bernardino, CA. The new feeder automation scheme, with vacuum fault interrupters, will limit the number of customers affected by the fault. Depending on the fault location, the substation breaker might not even trip. Through the use of fast communications (fiber) the fault locations can be determined and the proper fault interrupting switches opened automatically. With knowledge of circuit loadings at the time of the fault, ties to other circuits can be closed automatically to restore all customers except the faulted section. This new automation scheme limits outage time and increases reliability for customers. The second phase of the project involved the selection, modeling, testing and installation of a fault current limiter on the Circuit of the Future. While this project did not pay for the installation and testing of the fault current limiter, it did perform the evaluation of the fault current limiter and its impacts on the protection system of the Circuit of the Future. After investigation of several fault current limiters, the Zenergy superconducting, saturable core fault current limiter was selected for

  17. Homodyne impulse radar hidden object locator

    DOE Patents [OSTI]

    McEwan, T.E.

    1996-04-30

    An electromagnetic detector is designed to locate an object hidden behind a separator or a cavity within a solid object. The detector includes a PRF generator for generating 2 MHz pulses, a homodyne oscillator for generating a 2 kHz square wave, and for modulating the pulses from the PRF generator. A transmit antenna transmits the modulated pulses through the separator, and a receive antenna receives the signals reflected off the object. The receiver path of the detector includes a sample and hold circuit, an AC coupled amplifier which filters out DC bias level shifts in the sample and hold circuit, and a rectifier circuit connected to the homodyne oscillator and to the AC coupled amplifier, for synchronously rectifying the modulated pulses transmitted over the transmit antenna. The homodyne oscillator modulates the signal from the PRF generator with a continuous wave (CW) signal, and the AC coupled amplifier operates with a passband centered on that CW signal. The present detector can be used in several applications, including the detection of metallic and non-metallic objects, such as pipes, studs, joists, nails, rebars, conduits and electrical wiring, behind wood wall, ceiling, plywood, particle board, dense hardwood, masonry and cement structure. The detector is portable, light weight, simple to use, inexpensive, and has a low power emission which facilitates the compliance with Part 15 of the FCC rules. 15 figs.

  18. Homodyne impulse radar hidden object locator

    DOE Patents [OSTI]

    McEwan, Thomas E.

    1996-01-01

    An electromagnetic detector is designed to locate an object hidden behind a separator or a cavity within a solid object. The detector includes a PRF generator for generating 2 MHz pulses, a homodyne oscillator for generating a 2 kHz square wave, and for modulating the pulses from the PRF generator. A transmit antenna transmits the modulated pulses through the separator, and a receive antenna receives the signals reflected off the object. The receiver path of the detector includes a sample and hold circuit, an AC coupled amplifier which filters out DC bias level shifts in the sample and hold circuit, and a rectifier circuit connected to the homodyne oscillator and to the AC coupled amplifier, for synchronously rectifying the modulated pulses transmitted over the transmit antenna. The homodyne oscillator modulates the signal from the PRF generator with a continuous wave (CW) signal, and the AC coupled amplifier operates with a passband centered on that CW signal. The present detector can be used in several applications, including the detection of metallic and non-metallic objects, such as pipes, studs, joists, nails, rebars, conduits and electrical wiring, behind wood wall, ceiling, plywood, particle board, dense hardwood, masonry and cement structure. The detector is portable, light weight, simple to use, inexpensive, and has a low power emission which facilitates the compliance with Part 15 of the FCC rules.

  19. TAGGING, TRACKING AND LOCATING WITHOUT GPS

    SciTech Connect (OSTI)

    Cordaro, J.; Coleman, T.; Shull, D.

    2012-07-08

    The Savannah River National Laboratory (SRNL) was requested to lead a Law Enforcement Working Group that was formed to collaborate on common operational needs. All agencies represented on the working group ranked their need to tag, track, and locate a witting or unwitting target as their highest priority. Specifically, they were looking for technologies more robust than Global Positioning Satellite (GPS), could communicate back to the owner, and worked where normal cell phone communications did not work or were unreliable. SRNL brought together multiple technologies in a demonstration that was held in in various Alaska venues, including metropolitan, wilderness, and at-sea that met the working group's requirements. Using prototypical technologies from Boeing, On Ramp, and Fortress, SRNL was able to demonstrate the ability to track personnel and material in all scenarios including indoors, in heavily wooden areas, canyons, and in parking garages. In all cases GPS signals were too weak to measure. Bi-directional communication was achieved in areas that Wi-Fi, cell towers, or traditional radios would not perform. The results of the exercise will be presented. These technologies are considered ideal for tracking high value material such has nuclear material with a platform that allows seamless tracking anywhere in the world, indoors or outdoors.

  20. SAPLE: Sandia Advanced Personnel Locator Engine.

    SciTech Connect (OSTI)

    Procopio, Michael J.

    2010-04-01

    We present the Sandia Advanced Personnel Locator Engine (SAPLE) web application, a directory search application for use by Sandia National Laboratories personnel. SAPLE's purpose is to return Sandia personnel 'results' as a function of user search queries, with its mission to make it easier and faster to find people at Sandia. To accomplish this, SAPLE breaks from more traditional directory application approaches by aiming to return the correct set of results while placing minimal constraints on the user's query. Two key features form the core of SAPLE: advanced search query interpretation and inexact string matching. SAPLE's query interpretation permits the user to perform compound queries when typing into a single search field; where able, SAPLE infers the type of field that the user intends to search on based on the value of the search term. SAPLE's inexact string matching feature yields a high-quality ranking of personnel search results even when there are no exact matches to the user's query. This paper explores these two key features, describing in detail the architecture and operation of SAPLE. Finally, an extensive analysis on logged search query data taken from an 11-week sample period is presented.

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

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

  3. Uranium Lease Tracts Location Map | Department of Energy

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

    Uranium Lease Tracts Location Map Uranium Lease Tracts Location Map Uranium Lease Tracts Location Map Uranium Lease Tracts Location Map (999.93 KB) More Documents & Publications EA-1037: Final Environmental Assessment EA-1535: Final Programmatic Environmental Assessment EIS-0472: Notice of Intent to Prepare a Programmatic Environmental Impact Statement

  4. Alternative Fuels Data Center: Electric Vehicle Charging Station Locations

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

    Electric Vehicle Charging Station Locations to someone by E-mail Share Alternative Fuels Data Center: Electric Vehicle Charging Station Locations on Facebook Tweet about Alternative Fuels Data Center: Electric Vehicle Charging Station Locations on Twitter Bookmark Alternative Fuels Data Center: Electric Vehicle Charging Station Locations on Google Bookmark Alternative Fuels Data Center: Electric Vehicle Charging Station Locations on Delicious Rank Alternative Fuels Data Center: Electric Vehicle

  5. Alternative Fuels Data Center: Hydrogen Fueling Station Locations

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

    Hydrogen Printable Version Share this resource Send a link to Alternative Fuels Data Center: Hydrogen Fueling Station Locations to someone by E-mail Share Alternative Fuels Data Center: Hydrogen Fueling Station Locations on Facebook Tweet about Alternative Fuels Data Center: Hydrogen Fueling Station Locations on Twitter Bookmark Alternative Fuels Data Center: Hydrogen Fueling Station Locations on Google Bookmark Alternative Fuels Data Center: Hydrogen Fueling Station Locations on Delicious Rank

  6. File:VallesLocationMap.pdf | Open Energy Information

    Open Energy Info (EERE)

    VallesLocationMap.pdf Jump to: navigation, search File File history File usage Metadata File:VallesLocationMap.pdf Size of this preview: 800 479 pixels. Full resolution (934...

  7. A Look at Health Care Buildings - Where are they located

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

    Location Return to: A Look at Health Care Buildings How large are they? How many employees are there? Where are they located? How old are they? Who owns and occupies them? Are they...

  8. Alternative Fuels Data Center: Alternative Fueling Station Locator

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

    21,782 alternative fuel stations in the United States Excluding private stations Location details are subject to change. We recommend calling the stations to verify location, hours of operation, and access. About the data

  9. Locations of Smart Grid Demonstration and Large-Scale Energy...

    Office of Environmental Management (EM)

    Locations of Smart Grid Demonstration and Large-Scale Energy Storage Projects Locations of Smart Grid Demonstration and Large-Scale Energy Storage Projects Map of the United States ...

  10. Major DOE Biofuels Project Locations | Department of Energy

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

    47.09 KB) More Documents & Publications Major DOE Biofuels Project Locations Slide 1 Algal Biofuel Technologies

  11. Alternative Fueling Station Locator App Provides Info at Your Fingertips |

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

    Department of Energy Alternative Fueling Station Locator App Provides Info at Your Fingertips Alternative Fueling Station Locator App Provides Info at Your Fingertips November 15, 2013 - 10:12am Addthis The Alternative Fueling Station Locator iPhone app helps you find fueling stations that offer electricity, natural gas, biodiesel, E85, propane, or hydrogen. | Energy Department The Alternative Fueling Station Locator iPhone app helps you find fueling stations that offer electricity, natural

  12. Research Site Locations for Current EERE Postdoctoral Awards | Department

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

    of Energy Site Locations for Current EERE Postdoctoral Awards Research Site Locations for Current EERE Postdoctoral Awards map_postdoctoral-research_awards.png (1.18 MB) More Documents & Publications Research Site Locations for Current and Former EERE Postdoctoral Awards EERE: VTO - Red Leaf PNG Image EERE: VTO - Hybrid Bus PNG Image

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

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

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

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

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

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

    SciTech Connect (OSTI)

    Sukumar, Sreenivas Rangan

    2016-01-01

    Finding actionable insights from data has always been difficult. As the scale and forms of data increase tremendously, the task of finding value becomes even more challenging. Data scientists at Oak Ridge National Laboratory are leveraging unique leadership infrastructure (e.g. Urika-XA and Urika-GD appliances) to develop scalable algorithms for semantic, logical and statistical reasoning with unstructured Big Data. We present the deployment of such a framework called ORiGAMI (Oak Ridge Graph Analytics for Medical Innovations) on the National Library of Medicine s SEMANTIC Medline (archive of medical knowledge since 1994). Medline contains over 70 million knowledge nuggets published in 23.5 million papers in medical literature with thousands more added daily. ORiGAMI is available as an open-science medical hypothesis generation tool - both as a web-service and an application programming interface (API) at http://hypothesis.ornl.gov . Since becoming an online service, ORIGAMI has enabled clinical subject-matter experts to: (i) discover the relationship between beta-blocker treatment and diabetic retinopathy; (ii) hypothesize that xylene is an environmental cancer-causing carcinogen and (iii) aid doctors with diagnosis of challenging cases when rare diseases manifest with common symptoms. In 2015, ORiGAMI was featured in the Historical Clinical Pathological Conference in Baltimore as a demonstration of artificial intelligence to medicine, IEEE/ACM Supercomputing and recognized as a Centennial Showcase Exhibit at the Radiological Society of North America (RSNA) Conference in Chicago. The final paper will describe the workflow built for the Cray Urika-XA and Urika-GD appliances that is able to reason with the knowledge of every published medical paper every time a clinical researcher uses the tool.

  19. Energy Department Announces Locations of Consent-Based Siting

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

    Initiative's Eight Public Meetings | Department of Energy Locations of Consent-Based Siting Initiative's Eight Public Meetings Energy Department Announces Locations of Consent-Based Siting Initiative's Eight Public Meetings February 18, 2016 - 12:10pm Addthis News Media Contact 202-586-4940 DOENews@hq.doe.gov WASHINGTON - The U.S. Department of Energy today announced the locations of eight public meetings on the Department's consent-based siting initiative. These eight public meetings are

  20. Automated detection and location of indications in eddy current signals

    DOE Patents [OSTI]

    Brudnoy, David M.; Oppenlander, Jane E.; Levy, Arthur J.

    2000-01-01

    A computer implemented information extraction process that locates and identifies eddy current signal features in digital point-ordered signals, signals representing data from inspection of test materials, by enhancing the signal features relative to signal noise, detecting features of the signals, verifying the location of the signal features that can be known in advance, and outputting information about the identity and location of all detected signal features.

  1. Locations of Industrial Assessment Centers | Department of Energy

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

    Technical Assistance » Industrial Assessment Centers (IACs) » Locations of Industrial Assessment Centers Locations of Industrial Assessment Centers To apply for an assessment, contact one of the 24 schools across the country that currently participate in the IAC Program. Click on a university name below for contact information for each location. Map of participating schools West Oregon State University San Diego State University San Francisco State University Boise State University Midwest

  2. Energy Department Announces Student Teams, New Location for Solar Decathlon

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

    2013 | Department of Energy Student Teams, New Location for Solar Decathlon 2013 Energy Department Announces Student Teams, New Location for Solar Decathlon 2013 January 26, 2012 - 10:56am Addthis WASHINGTON, DC - At an event today in Albuquerque, New Mexico, U.S. Department of Energy Secretary Steven Chu announced the 20 collegiate teams selected to compete in the U.S. Department of Energy Solar Decathlon 2013 and unveiled the competition's location, the Orange County Great Park in Irvine,

  3. Population Sensitivity Evaluation of Two Candidate Locations for Possible

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

    Small Modular Reactor Siting | Department of Energy Population Sensitivity Evaluation of Two Candidate Locations for Possible Small Modular Reactor Siting Population Sensitivity Evaluation of Two Candidate Locations for Possible Small Modular Reactor Siting This report documents population density studies of selected sites in the Hampton Roads, Virginia area. Population Sensitivity Evaluation of Two Candidate Locations for Possible Small Modular Reactor Siting (3.84 MB) More Documents &

  4. EIS-0463: Notice of Public Meeting Location Change | Department...

    Office of Environmental Management (EM)

    EIS-0463: Notice of Public Meeting Location Change Presidential Permit Application for Northern Pass Transmission, New Hampshire On September 6, 2013, DOE published in the Federal ...

  5. Check Out the New Alternative Fuel Station Locator

    Broader source: Energy.gov [DOE]

    With more than 10,000 publicly accessible alternative fueling stations, the new Alternative Fuel Station Locator map makes fueling your alternative fuel vehicle easier than ever.

  6. NSO Explores Closure Options for Historic Nuclear Testing Locations

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

    NSO Explores Closure Options for Historic Nuclear Testing Locations Recent environmental restoration work at the Nevada National Security Site (NNSS) focuses on a number of ...

  7. Alternative Fueling Station Locator - Mobile | Open Energy Information

    Open Energy Info (EERE)

    version of the Alternative Fueling Station Locator, part of the Department of Energy's Alternative Fuels and Advanced Vehicles Datacenter, allows users to search for alternative...

  8. Evaluation of Potential Locations for Siting Small Modular Reactors...

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

    Evaluation of Proposed Hampton Roads Area Sites for Using Small Modular Reactors to Support Federal Clean Energy Goals Population Sensitivity Evaluation of Two Candidate Locations ...

  9. Enhancement of the visibility of objects located below the surface...

    Office of Scientific and Technical Information (OSTI)

    Enhancement of the visibility of objects located below the surface of a scattering medium ... The enhancement of the image contrast of a subsurface structure is based on the ...

  10. Mobile Truck Stop Electrification Locator Now Available - News...

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

    a billion gallons of fuel each year nationwide," said Wendy Dafoe, NREL manager of DOE's Alternative Fuels and Advanced ... of electrification sites, the mobile locator can ...

  11. Location | U.S. DOE Office of Science (SC)

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

    Location Project Assessment (OPA) OPA Home About Director Staff & Responsibilities Location Jobs Project Management SC Projects Other Links SC Federal Project Directors (FPD) and FPD Resources Contact Information Project Assessment U.S. Department of Energy SC-28/Germantown Building 1000 Independence Ave., SW Washington, DC 20585 P: (301) 903-4840 F: (301) 903-8520 E: Email Us About Location Print Text Size: A A A FeedbackShare Page The Office of Project Assessment is located at: Room #D-222

  12. LEDS Collaboration in Action Workshop Location | Open Energy...

    Open Energy Info (EERE)

    location close to London (Underground direct to Little Chalfont), the M25 and Heathrow Airport. The Conference Centre is designed around a major presentation suite and offers...

  13. Major DOE Biofuels Project Locations | Department of Energy

    Office of Environmental Management (EM)

    31.1 KB) More Documents & Publications Major DOE Biofuels Project Locations Slide 1 The Current State of Technology for Cellulosic Ethanol

  14. Title 33 CFR 115 Bridge Locations and Clearances: Administrative...

    Open Energy Info (EERE)

    115 Bridge Locations and Clearances: Administrative Procedures Jump to: navigation, search OpenEI Reference LibraryAdd to library Legal Document- Federal RegulationFederal...

  15. Research Site Locations for Current and Former EERE Postdoctoral Awards

    Broader source: Energy.gov [DOE]

    Research Site Locations for Current and Former EERE Postdoctoral Awards, from the U.S. Department of Energy's Office of Energy Efficiency and Renewable Energy.

  16. Argonne Site Map Showing CNM Location | Argonne National Laboratory

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

    Argonne Site Map Showing CNM Location Find your way to the Center for Nanoscale Materials on the Argonne National Laboratory campus. PDF icon CNM-Argonne_map

  17. Wind Turbine Manufacturers in the U. S.: Locations and Local...

    Wind Powering America (EERE)

    Efficiency and Renewable Energy, operated by the Alliance for Sustainable Energy, LLC. Wind Turbine Manufacturers in the U.S.: Locations and Local Impacts WINDPOWER 2010 Conference...

  18. Drone Detection, Video Feed Interception and Pilot Locating System...

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

    Drone Detection, Video Feed Interception and Pilot Locating System The invention provides the capability of detecting commercially available and custom homemade remotely operated...

  19. Condensing Heating and Water Heating Equipment Workshop Location...

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

    Condensing Heating and Water Heating Equipment Workshop Location: Washington Gas Light Appliance Training Facility 6801 Industrial Road Springfield, VA Date: October 9, 2014 Time: ...

  20. September 2004 Water Sampling

    Office of Legacy Management (LM)

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

  1. September 2004 Water Sampling

    Office of Legacy Management (LM)

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

  2. September 2004 Water Sampling

    Office of Legacy Management (LM)

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

  3. September 2004 Water Sampling

    Office of Legacy Management (LM)

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

  4. September 2004 Water Sampling

    Office of Legacy Management (LM)

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

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

    SciTech Connect (OSTI)

    Peng, Jialin Zhang, Hongbo; Hu, Peijun; Lu, Fang; Kong, Dexing; Peng, Zhiyi

    2015-12-15

    Purpose: Efficient and accurate 3D liver segmentations from contrast-enhanced computed tomography (CT) images play an important role in therapeutic strategies for hepatic diseases. However, inhomogeneous appearances, ambiguous boundaries, and large variance in shape often make it a challenging task. The existence of liver abnormalities poses further difficulty. Despite the significant intensity difference, liver tumors should be segmented as part of the liver. This study aims to address these challenges, especially when the target livers contain subregions with distinct appearances. Methods: The authors propose a novel multiregion-appearance based approach with graph cuts to delineate the liver surface. For livers with multiple subregions, a geodesic distance based appearance selection scheme is introduced to utilize proper appearance constraint for each subregion. A special case of the proposed method, which uses only one appearance constraint to segment the liver, is also presented. The segmentation process is modeled with energy functions incorporating both boundary and region information. Rather than a simple fixed combination, an adaptive balancing weight is introduced and learned from training sets. The proposed method only calls initialization inside the liver surface. No additional constraints from user interaction are utilized. Results: The proposed method was validated on 50 3D CT images from three datasets, i.e., Medical Image Computing and Computer Assisted Intervention (MICCAI) training and testing set, and local dataset. On MICCAI testing set, the proposed method achieved a total score of 83.4 ± 3.1, outperforming nonexpert manual segmentation (average score of 75.0). When applying their method to MICCAI training set and local dataset, it yielded a mean Dice similarity coefficient (DSC) of 97.7% ± 0.5% and 97.5% ± 0.4%, respectively. These results demonstrated the accuracy of the method when applied to different computed tomography (CT) datasets

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

  7. NMOCD - Form G-102 - Geothermal Resources Well Location and Acreage...

    Open Energy Info (EERE)

    Jump to: navigation, search OpenEI Reference LibraryAdd to library General: NMOCD - Form G-102 - Geothermal Resources Well Location and Acreage Dedication Plat Author State of New...

  8. Energy Department Announces Denver as Next Location for Solar...

    Energy Savers [EERE]

    Energy Department Announces Denver as Next Location for Solar Decathlon Competition in 2017 March 11, 2016 - 12:01pm Addthis Under Secretary for Science and Energy Dr. Franklin Orr ...

  9. Colorado CRS 29-20-108, Location, Construction, or Improvement...

    Open Energy Info (EERE)

    CRS 29-20-108, Location, Construction, or Improvement of Major Electrical or Natural Gas Facilities Jump to: navigation, search OpenEI Reference LibraryAdd to library Legal...

  10. The Department's Fleet Vehicle Sustainability Initiatives at Selected Locations

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

    Department's Fleet Vehicle Sustainability Initiatives at Selected Locations DOE/IG-0896 October 2013 U.S. Department of Energy Office of Inspector General Office of Audits and Inspections Department of Energy Washington, DC 20585 October 24, 2013 MEMORANDUM FOR THE SECRETARY FROM: Gregory H. Friedman Inspector General SUBJECT: INFORMATION: Audit Report on "The Department's Fleet Vehicle Sustainability Initiatives at Selected Locations" BACKGROUND In Fiscal Year (FY) 2012, the

  11. Evaluation of Potential Locations for Siting Small Modular Reactors near

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

    Federal Energy Clusters to Support Federal Clean Energy Goals | Department of Energy Potential Locations for Siting Small Modular Reactors near Federal Energy Clusters to Support Federal Clean Energy Goals Evaluation of Potential Locations for Siting Small Modular Reactors near Federal Energy Clusters to Support Federal Clean Energy Goals This report investigates three additional federal energy clusters for favorability for siting an SMR: the Florida Panhandle, South-Central Texas, and

  12. NREL Developed Mobile App for Alternative Fueling Station Locations

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

    Released - News Releases | NREL NREL Developed Mobile App for Alternative Fueling Station Locations Released New application for iPhone helps users find stations offering electricity, biodiesel, natural gas, and other alternative fuels. November 7, 2013 iPhone users now have access to a free application that locates fueling stations offering alternative fuels, including electricity, natural gas, biodiesel, e85 Ethanol, propane and hydrogen. The Energy Department's (DOE) National Renewable

  13. Energy, Interior Departments Announce New Location for Solar Decathlon 2011

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

    | Department of Energy Energy, Interior Departments Announce New Location for Solar Decathlon 2011 Energy, Interior Departments Announce New Location for Solar Decathlon 2011 February 23, 2011 - 12:00am Addthis WASHINGTON -- The Department of Energy and the Department of the Interior today announced that the U.S. Department of Energy Solar Decathlon 2011 will be held at the National Mall's West Potomac Park, on the banks of the Potomac River along the path between the Lincoln and Jefferson

  14. Microfluidic ultrasonic particle separators with engineered node locations

    Office of Scientific and Technical Information (OSTI)

    and geometries (Patent) | SciTech Connect ultrasonic particle separators with engineered node locations and geometries Citation Details In-Document Search Title: Microfluidic ultrasonic particle separators with engineered node locations and geometries An ultrasonic microfluidic system includes a separation channel for conveying a sample fluid containing small particles and large particles, flowing substantially parallel, adjacent to a recovery fluid, with which it is in contact. An acoustic

  15. Predicting threshold and location of laser damage on optical surfaces

    DOE Patents [OSTI]

    Siekhaus, Wigbert

    1987-01-01

    An apparatus useful in the prediction of the damage threshold of various optical devices, the location of weak spots on such devices and the location, identification, and elimination of optical surface impurities comprising, a focused and pulsed laser, an photo electric detector/imaging means, and a timer. The weak spots emit photoelectrons when subjected to laser intensities that are less than the intensity actually required to produce the damage. The weak spots may be eliminated by sustained exposure to the laser beam.

  16. Historical Procurement Information - by Location | Department of Energy

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

    Historical Procurement Information - by Location Historical Procurement Information - by Location Small business contracing is difficult to navigate. We've built the Small Business Opportunities Tool to identify historical records of what the Department of Energy has purchased, which you can use to identify likely future opportunities. Use the downloads below to view historical procurement by state. California.pdf (114.54 KB) Colorado.pdf (127.77 KB) DistrictColumbia.pdf (126.17 KB) Georgia.pdf

  17. Energy Department Launches Five New Solar Ready Vets Training Locations,

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

    Announces $10 Million for National Solar Training Programs | Department of Energy Launches Five New Solar Ready Vets Training Locations, Announces $10 Million for National Solar Training Programs Energy Department Launches Five New Solar Ready Vets Training Locations, Announces $10 Million for National Solar Training Programs May 17, 2016 - 4:22pm Addthis News Media Contact 202-586-4940 DOENews@hq.doe.gov WASHINGTON - Today, the Energy Department announced five additional military bases will

  18. Implementing Rational Surface Locations Measured From Thomson Scattering Into

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

    Implementing Rational Surface Locations Measured From Thomson Scattering Into MSTfit by Curtis A. Johnson Senior Thesis (Physics) at the University of Wisconsin-Madison 2014 i Abstract Measurements of rational surface (RS) locations in the Madison Symmetric Torus as measured by Thomson Scattering (TS) have been implemented in the equilibrium reconstruction program MSTfit. Possible correlated errors between diagnostics show a small impact on the equilibrium reconstruction done by MSTfit. TS RS

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

    SciTech Connect (OSTI)

    Chen, Xinjian; Bagci, Ulas

    2011-08-15

    Purpose: This paper studies the feasibility of developing an automatic anatomy segmentation (AAS) system in clinical radiology and demonstrates its operation on clinical 3D images. Methods: The AAS system, the authors are developing consists of two main parts: object recognition and object delineation. As for recognition, a hierarchical 3D scale-based multiobject method is used for the multiobject recognition task, which incorporates intensity weighted ball-scale (b-scale) information into the active shape model (ASM). For object delineation, an iterative graph-cut-ASM (IGCASM) algorithm is proposed, which effectively combines the rich statistical shape information embodied in ASM with the globally optimal delineation capability of the GC method. The presented IGCASM algorithm is a 3D generalization of the 2D GC-ASM method that they proposed previously in Chen et al.[Proc. SPIE, 7259, 72590C1-72590C-8 (2009)]. The proposed methods are tested on two datasets comprised of images obtained from 20 patients (10 male and 10 female) of clinical abdominal CT scans, and 11 foot magnetic resonance imaging (MRI) scans. The test is for four organs (liver, left and right kidneys, and spleen) segmentation, five foot bones (calcaneus, tibia, cuboid, talus, and navicular). The recognition and delineation accuracies were evaluated separately. The recognition accuracy was evaluated in terms of translation, rotation, and scale (size) error. The delineation accuracy was evaluated in terms of true and false positive volume fractions (TPVF, FPVF). The efficiency of the delineation method was also evaluated on an Intel Pentium IV PC with a 3.4 GHZ CPU machine. Results: The recognition accuracies in terms of translation, rotation, and scale error over all organs are about 8 mm, 10 deg. and 0.03, and over all foot bones are about 3.5709 mm, 0.35 deg. and 0.025, respectively. The accuracy of delineation over all organs for all subjects as expressed in TPVF and FPVF is 93.01% and 0.22%, and

  20. Impurity-doped optical shock, detonation and damage location sensor

    DOE Patents [OSTI]

    Weiss, Jonathan D.

    1995-01-01

    A shock, detonation, and damage location sensor providing continuous fiber-optic means of measuring shock speed and damage location, and could be designed through proper cabling to have virtually any desired crush pressure. The sensor has one or a plurality of parallel multimode optical fibers, or a singlemode fiber core, surrounded by an elongated cladding, doped along their entire length with impurities to fluoresce in response to light at a different wavelength entering one end of the fiber(s). The length of a fiber would be continuously shorted as it is progressively destroyed by a shock wave traveling parallel to its axis. The resulting backscattered and shifted light would eventually enter a detector and be converted into a proportional electrical signals which would be evaluated to determine shock velocity and damage location. The corresponding reduction in output, because of the shortening of the optical fibers, is used as it is received to determine the velocity and position of the shock front as a function of time. As a damage location sensor the sensor fiber cracks along with the structure to which it is mounted. The size of the resulting drop in detector output is indicative of the location of the crack.

  1. Impurity-doped optical shock, detonation and damage location sensor

    DOE Patents [OSTI]

    Weiss, J.D.

    1995-02-07

    A shock, detonation, and damage location sensor providing continuous fiber-optic means of measuring shock speed and damage location, and could be designed through proper cabling to have virtually any desired crush pressure. The sensor has one or a plurality of parallel multimode optical fibers, or a singlemode fiber core, surrounded by an elongated cladding, doped along their entire length with impurities to fluoresce in response to light at a different wavelength entering one end of the fiber(s). The length of a fiber would be continuously shorted as it is progressively destroyed by a shock wave traveling parallel to its axis. The resulting backscattered and shifted light would eventually enter a detector and be converted into a proportional electrical signals which would be evaluated to determine shock velocity and damage location. The corresponding reduction in output, because of the shortening of the optical fibers, is used as it is received to determine the velocity and position of the shock front as a function of time. As a damage location sensor the sensor fiber cracks along with the structure to which it is mounted. The size of the resulting drop in detector output is indicative of the location of the crack. 8 figs.

  2. The cause of outliers in electromagnetic pulse (EMP) locations

    SciTech Connect (OSTI)

    Fenimore, Edward E.

    2014-10-02

    We present methods to calculate the location of EMP pulses when observed by 5 or more satellites. Simulations show that, even with a good initial guess and fitting a location to all of the data, there are sometime outlier results whose locations are much worse than most cases. By comparing simulations using different ionospheric transfer functions (ITFs), it appears that the outliers are caused by not including the additional path length due to refraction rather than being caused by not including higher order terms in the Appleton-Hartree equation. We suggest ways that the outliers can be corrected. These correction methods require one to use an electron density profile along the line of sight from the event to the satellite rather than using the total electron content (TEC) to characterize the ionosphere.

  3. Algae Biofuels Co-Location Assessment Tool for Canada

    SciTech Connect (OSTI)

    2011-11-29

    The Algae Biofuels Co-Location Assessment Tool for Canada uses chemical stoichiometry to estimate Nitrogen, Phosphorous, and Carbon atom availability from waste water and carbon dioxide emissions streams, and requirements for those same elements to produce a unit of algae. This information is then combined to find limiting nutrient information and estimate potential productivity associated with waste water and carbon dioxide sources. Output is visualized in terms of distributions or spatial locations. Distances are calculated between points of interest in the model using the great circle distance equation, and the smallest distances found by an exhaustive search and sort algorithm.

  4. Predicting threshold and location of laser damage on optical surfaces

    DOE Patents [OSTI]

    Siekhaus, W.

    1985-02-04

    Disclosed is an apparatus useful in the prediction of the damage threshold of various optical devices, the location of weak spots on such devices and the location, identification, and elimination of optical surface impurities. The apparatus comprises a focused and pulsed laser, a photo electric detector/imaging means, and a timer. The weak spots emit photoelectrons when subjected to laser intensities that are less than the intensity actually required to produce the damage. The weak spots may be eliminated by sustained exposure to the laser beam.

  5. Method for locating metallic nitride inclusions in metallic alloy ingots

    DOE Patents [OSTI]

    White, Jack C.; Traut, Davis E.; Oden, Laurance L.; Schmitt, Roman A.

    1992-01-01

    A method of determining the location and history of metallic nitride and/or oxynitride inclusions in metallic melts. The method includes the steps of labeling metallic nitride and/or oxynitride inclusions by making a coreduced metallic-hafnium sponge from a mixture of hafnium chloride and the chloride of a metal, reducing the mixed chlorides with magnesium, nitriding the hafnium-labeled metallic-hafnium sponge, and seeding the sponge to be melted with hafnium-labeled nitride inclusions. The ingots are neutron activated and the hafnium is located by radiometric means. Hafnium possesses exactly the proper metallurgical and radiochemical properties for this use.

  6. Energy Department Announces Denver as Next Location for Solar Decathlon

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

    Competition in 2017 | Department of Energy Denver as Next Location for Solar Decathlon Competition in 2017 Energy Department Announces Denver as Next Location for Solar Decathlon Competition in 2017 March 11, 2016 - 12:01pm Addthis Under Secretary for Science and Energy Dr. Franklin Orr announces Denver as the host city for the 2017 U.S. Department of Energy Solar Decathlon. | Photo courtesy of Ellen Jaskol Under Secretary for Science and Energy Dr. Franklin Orr announces Denver as the host

  7. Algae Biofuels Co-Location Assessment Tool for Canada

    Energy Science and Technology Software Center (OSTI)

    2011-11-29

    The Algae Biofuels Co-Location Assessment Tool for Canada uses chemical stoichiometry to estimate Nitrogen, Phosphorous, and Carbon atom availability from waste water and carbon dioxide emissions streams, and requirements for those same elements to produce a unit of algae. This information is then combined to find limiting nutrient information and estimate potential productivity associated with waste water and carbon dioxide sources. Output is visualized in terms of distributions or spatial locations. Distances are calculated betweenmore » points of interest in the model using the great circle distance equation, and the smallest distances found by an exhaustive search and sort algorithm.« less

  8. Location, Location, Efficiency

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

    Streamlined Customer Experience *Bundle energy assessment, benchmarking, & PACE financing ... Cost to Date: 0.85% Additional Funding: None Budget History August 1, 2015 - FY 2015 ...

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

  10. TWRS information locator database system administrator`s manual

    SciTech Connect (OSTI)

    Knutson, B.J., Westinghouse Hanford

    1996-09-13

    This document is a guide for use by the Tank Waste Remediation System (TWRS) Information Locator Database (ILD) System Administrator. The TWRS ILD System is an inventory of information used in the TWRS Systems Engineering process to represent the TWRS Technical Baseline. The inventory is maintained in the form of a relational database developed in Paradox 4.5.