National Library of Energy BETA

Sample records for includes regularly-updated graphs

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  16. A Graph Search Heuristic for Shortest Distance Paths

    SciTech Connect (OSTI)

    Chow, E

    2005-03-24

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

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

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

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

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

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

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

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

  4. Parallel Algorithms for Graph Optimization using Tree Decompositions

    SciTech Connect (OSTI)

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

    2012-06-01

    Although many $\\cal{NP}$-hard graph optimization problems can be solved in polynomial time on graphs of bounded tree-width, the adoption of these techniques into mainstream scientific computation has been limited due to the high memory requirements of the necessary dynamic programming tables and excessive runtimes of sequential implementations. This work addresses both challenges by proposing a set of new parallel algorithms for all steps of a tree decomposition-based approach to solve the maximum weighted independent set problem. A hybrid OpenMP/MPI implementation includes a highly scalable parallel dynamic programming algorithm leveraging the MADNESS task-based runtime, and computational results demonstrate scaling. This work enables a significant expansion of the scale of graphs on which exact solutions to maximum weighted independent set can be obtained, and forms a framework for solving additional graph optimization problems with similar techniques.

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

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

  7. PACKAGE INCLUDES:

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

    PACKAGE INCLUDES: Airfare from Seattle, 4 & 5 Star Hotels, Transfers, Select Meals, Guided Tours and Excursions DAY 01: BANGKOK - ARRIVAL DAY 02: BANGKOK - SIGHTSEEING DAY 03: BANGKOK - FLOATING MARKET DAY 04: BANGKOK - AT LEISURE DAY 05: BANGKOK - CHIANG MAI BY AIR DAY 06: CHIANG MAI - SIGHTSEEING DAY 07: CHIANG MAI - ELEPHANT CAMP DAY 08: CHIANG MAI - PHUKET BY AIR DAY 09: PHUKET - PHI PHI ISLAND BY FERRY DAY 10: PHUKET - AT LEISURE DAY 11: PHUKET - CORAL ISLAND BY SPEEDBOAT DAY 12: PHUKET

  8. Data reports: Charts & graphs

    SciTech Connect (OSTI)

    1996-03-01

    This article is the February 1996 data report, which includes: (1) a summary of February`s transactions, (2) monthly price range data for the previous 15 years, (3) contract prices for natural uranium, and (4) separative work unit price data.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  15. Data report - charts and graphs

    SciTech Connect (OSTI)

    1996-01-01

    This article is the continuing data report on a number of parameters in the nucelar fuels market. Items include: (1) summary of December 1995 transactions, (2) uranium price data for the previous 10 years, broken down by month and range, (3) SWU price data, and (4) economic indicators for the United States, Europe, and Japan.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  12. Pump apparatus including deconsolidator

    DOE Patents [OSTI]

    Sonwane, Chandrashekhar; Saunders, Timothy; Fitzsimmons, Mark Andrew

    2014-10-07

    A pump apparatus includes a particulate pump that defines a passage that extends from an inlet to an outlet. A duct is in flow communication with the outlet. The duct includes a deconsolidator configured to fragment particle agglomerates received from the passage.

  13. Optical modulator including grapene

    DOE Patents [OSTI]

    Liu, Ming; Yin, Xiaobo; Zhang, Xiang

    2016-06-07

    The present invention provides for a one or more layer graphene optical modulator. In a first exemplary embodiment the optical modulator includes an optical waveguide, a nanoscale oxide spacer adjacent to a working region of the waveguide, and a monolayer graphene sheet adjacent to the spacer. In a second exemplary embodiment, the optical modulator includes at least one pair of active media, where the pair includes an oxide spacer, a first monolayer graphene sheet adjacent to a first side of the spacer, and a second monolayer graphene sheet adjacent to a second side of the spacer, and at least one optical waveguide adjacent to the pair.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  16. MHK technology developments include current

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

    technology developments include current energy conversion (CEC) devices, for example, hydrokinetic turbines that extract power from water currents (riverine, tidal, and ocean) and wave energy conversion (WEC) devices that extract power from wave motion. Sandia's MHK research leverages decades of experience in engineering, design, and analysis of wind power technologies, and its vast research complex, including high- performance computing (HPC), advanced materials and coatings, nondestructive

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

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

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

  20. Multi-processor including data flow accelerator module

    DOE Patents [OSTI]

    Davidson, George S.; Pierce, Paul E.

    1990-01-01

    An accelerator module for a data flow computer includes an intelligent memory. The module is added to a multiprocessor arrangement and uses a shared tagged memory architecture in the data flow computer. The intelligent memory module assigns locations for holding data values in correspondence with arcs leading to a node in a data dependency graph. Each primitive computation is associated with a corresponding memory cell, including a number of slots for operands needed to execute a primitive computation, a primitive identifying pointer, and linking slots for distributing the result of the cell computation to other cells requiring that result as an operand. Circuitry is provided for utilizing tag bits to determine automatically when all operands required by a processor are available and for scheduling the primitive for execution in a queue. Each memory cell of the module may be associated with any of the primitives, and the particular primitive to be executed by the processor associated with the cell is identified by providing an index, such as the cell number for the primitive, to the primitive lookup table of starting addresses. The module thus serves to perform functions previously performed by a number of sections of data flow architectures and coexists with conventional shared memory therein. A multiprocessing system including the module operates in a hybrid mode, wherein the same processing modules are used to perform some processing in a sequential mode, under immediate control of an operating system, while performing other processing in a data flow mode.

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

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

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

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

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

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

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

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

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

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

  11. Quantitative Analysis of Biofuel Sustainability, Including Land...

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

    Quantitative Analysis of Biofuel Sustainability, Including Land Use Change GHG Emissions Quantitative Analysis of Biofuel Sustainability, Including Land Use Change GHG Emissions ...

  12. Topic A Note: Includes STEPS Subtopic

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

    Topic A Note: Includes STEPS Subtopic 33 Total Projects Developing and Enhancing Workforce Training Programs

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

  14. INSTRUMENTATION, INCLUDING NUCLEAR AND PARTICLE DETECTORS; RADIATION

    Office of Scientific and Technical Information (OSTI)

    interval technical basis document Chiaro, P.J. Jr. 44 INSTRUMENTATION, INCLUDING NUCLEAR AND PARTICLE DETECTORS; RADIATION DETECTORS; RADIATION MONITORS; DOSEMETERS;...

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

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

  17. Communications circuit including a linear quadratic estimator

    DOE Patents [OSTI]

    Ferguson, Dennis D.

    2015-07-07

    A circuit includes a linear quadratic estimator (LQE) configured to receive a plurality of measurements a signal. The LQE is configured to weight the measurements based on their respective uncertainties to produce weighted averages. The circuit further includes a controller coupled to the LQE and configured to selectively adjust at least one data link parameter associated with a communication channel in response to receiving the weighted averages.

  18. Gas storage materials, including hydrogen storage materials

    DOE Patents [OSTI]

    Mohtadi, Rana F; Wicks, George G; Heung, Leung K; Nakamura, Kenji

    2013-02-19

    A material for the storage and release of gases comprises a plurality of hollow elements, each hollow element comprising a porous wall enclosing an interior cavity, the interior cavity including structures of a solid-state storage material. In particular examples, the storage material is a hydrogen storage material such as a solid state hydride. An improved method for forming such materials includes the solution diffusion of a storage material solution through a porous wall of a hollow element into an interior cavity.

  19. Intentionally Including - Engaging Minorities in Physics Careers |

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

    Department of Energy Intentionally Including - Engaging Minorities in Physics Careers Intentionally Including - Engaging Minorities in Physics Careers April 24, 2013 - 4:37pm Addthis Joining Director Dot Harris (second from left) were Marlene Kaplan, the Deputy Director of Education and director of EPP, National Oceanic and Atmospheric Administration, Claudia Rankins, a Program Officer with the National Science Foundation and Jim Stith, the past Vice-President of the American Institute of

  20. Gas storage materials, including hydrogen storage materials

    DOE Patents [OSTI]

    Mohtadi, Rana F; Wicks, George G; Heung, Leung K; Nakamura, Kenji

    2014-11-25

    A material for the storage and release of gases comprises a plurality of hollow elements, each hollow element comprising a porous wall enclosing an interior cavity, the interior cavity including structures of a solid-state storage material. In particular examples, the storage material is a hydrogen storage material, such as a solid state hydride. An improved method for forming such materials includes the solution diffusion of a storage material solution through a porous wall of a hollow element into an interior cavity.

  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. Scramjet including integrated inlet and combustor

    SciTech Connect (OSTI)

    Kutschenreuter, P.H. Jr.; Blanton, J.C.

    1992-02-04

    This patent describes a scramjet engine. It comprises: a first surface including an aft facing step; a cowl including: a leading edge and a trailing edge; an upper surface and a lower surface extending between the leading edge and the trailing edge; the cowl upper surface being spaced from and generally parallel to the first surface to define an integrated inlet-combustor therebetween having an inlet for receiving and channeling into the inlet-combustor supersonic inlet airflow; means for injecting fuel into the inlet-combustor at the step for mixing with the supersonic inlet airflow for generating supersonic combustion gases; and further including a spaced pari of sidewalls extending between the first surface to the cowl upper surface and wherein the integrated inlet-combustor is generally rectangular and defined by the sidewall pair, the first surface and the cowl upper surface.

  3. Electric Power Monthly, August 1990. [Glossary included

    SciTech Connect (OSTI)

    Not Available

    1990-11-29

    The Electric Power Monthly (EPM) presents monthly summaries of electric utility statistics at the national, Census division, and State level. The purpose of this publication is to provide energy decisionmakers with accurate and timely information that may be used in forming various perspectives on electric issues that lie ahead. Data includes generation by energy source (coal, oil, gas, hydroelectric, and nuclear); generation by region; consumption of fossil fuels for power generation; sales of electric power, cost data; and unusual occurrences. A glossary is included.

  4. Photoactive devices including porphyrinoids with coordinating additives

    DOE Patents [OSTI]

    Forrest, Stephen R; Zimmerman, Jeramy; Yu, Eric K; Thompson, Mark E; Trinh, Cong; Whited, Matthew; Diev, Vlacheslav

    2015-05-12

    Coordinating additives are included in porphyrinoid-based materials to promote intermolecular organization and improve one or more photoelectric characteristics of the materials. The coordinating additives are selected from fullerene compounds and organic compounds having free electron pairs. Combinations of different coordinating additives can be used to tailor the characteristic properties of such porphyrinoid-based materials, including porphyrin oligomers. Bidentate ligands are one type of coordinating additive that can form coordination bonds with a central metal ion of two different porphyrinoid compounds to promote porphyrinoid alignment and/or pi-stacking. The coordinating additives can shift the absorption spectrum of a photoactive material toward higher wavelengths, increase the external quantum efficiency of the material, or both.

  5. Subterranean barriers including at least one weld

    DOE Patents [OSTI]

    Nickelson, Reva A.; Sloan, Paul A.; Richardson, John G.; Walsh, Stephanie; Kostelnik, Kevin M.

    2007-01-09

    A subterranean barrier and method for forming same are disclosed, the barrier including a plurality of casing strings wherein at least one casing string of the plurality of casing strings may be affixed to at least another adjacent casing string of the plurality of casing strings through at least one weld, at least one adhesive joint, or both. A method and system for nondestructively inspecting a subterranean barrier is disclosed. For instance, a radiographic signal may be emitted from within a casing string toward an adjacent casing string and the radiographic signal may be detected from within the adjacent casing string. A method of repairing a barrier including removing at least a portion of a casing string and welding a repair element within the casing string is disclosed. A method of selectively heating at least one casing string forming at least a portion of a subterranean barrier is disclosed.

  6. Electric power monthly, September 1990. [Glossary included

    SciTech Connect (OSTI)

    Not Available

    1990-12-17

    The purpose of this report is to provide energy decision makers with accurate and timely information that may be used in forming various perspectives on electric issues. The power plants considered include coal, petroleum, natural gas, hydroelectric, and nuclear power plants. Data are presented for power generation, fuel consumption, fuel receipts and cost, sales of electricity, and unusual occurrences at power plants. Data are compared at the national, Census division, and state levels. 4 figs., 52 tabs. (CK)

  7. Power generation method including membrane separation

    DOE Patents [OSTI]

    Lokhandwala, Kaaeid A.

    2000-01-01

    A method for generating electric power, such as at, or close to, natural gas fields. The method includes conditioning natural gas containing C.sub.3+ hydrocarbons and/or acid gas by means of a membrane separation step. This step creates a leaner, sweeter, drier gas, which is then used as combustion fuel to run a turbine, which is in turn used for power generation.

  8. Nuclear reactor shield including magnesium oxide

    DOE Patents [OSTI]

    Rouse, Carl A.; Simnad, Massoud T.

    1981-01-01

    An improvement in nuclear reactor shielding of a type used in reactor applications involving significant amounts of fast neutron flux, the reactor shielding including means providing structural support, neutron moderator material, neutron absorber material and other components as described below, wherein at least a portion of the neutron moderator material is magnesium in the form of magnesium oxide either alone or in combination with other moderator materials such as graphite and iron.

  9. Rotor assembly including superconducting magnetic coil

    DOE Patents [OSTI]

    Snitchler, Gregory L.; Gamble, Bruce B.; Voccio, John P.

    2003-01-01

    Superconducting coils and methods of manufacture include a superconductor tape wound concentrically about and disposed along an axis of the coil to define an opening having a dimension which gradually decreases, in the direction along the axis, from a first end to a second end of the coil. Each turn of the superconductor tape has a broad surface maintained substantially parallel to the axis of the coil.

  10. Optical panel system including stackable waveguides

    DOE Patents [OSTI]

    DeSanto, Leonard; Veligdan, James T.

    2007-03-06

    An optical panel system including stackable waveguides is provided. The optical panel system displays a projected light image and comprises a plurality of planar optical waveguides in a stacked state. The optical panel system further comprises a support system that aligns and supports the waveguides in the stacked state. In one embodiment, the support system comprises at least one rod, wherein each waveguide contains at least one hole, and wherein each rod is positioned through a corresponding hole in each waveguide. In another embodiment, the support system comprises at least two opposing edge structures having the waveguides positioned therebetween, wherein each opposing edge structure contains a mating surface, wherein opposite edges of each waveguide contain mating surfaces which are complementary to the mating surfaces of the opposing edge structures, and wherein each mating surface of the opposing edge structures engages a corresponding complementary mating surface of the opposite edges of each waveguide.

  11. Optical panel system including stackable waveguides

    DOE Patents [OSTI]

    DeSanto, Leonard; Veligdan, James T.

    2007-11-20

    An optical panel system including stackable waveguides is provided. The optical panel system displays a projected light image and comprises a plurality of planar optical waveguides in a stacked state. The optical panel system further comprises a support system that aligns and supports the waveguides in the stacked state. In one embodiment, the support system comprises at least one rod, wherein each waveguide contains at least one hole, and wherein each rod is positioned through a corresponding hole in each waveguide. In another embodiment, the support system comprises at least two opposing edge structures having the waveguides positioned therebetween, wherein each opposing edge structure contains a mating surface, wherein opposite edges of each waveguide contain mating surfaces which are complementary to the mating surfaces of the opposing edge structures, and wherein each mating surface of the opposing edge structures engages a corresponding complementary mating surface of the opposite edges of each waveguide.

  12. Thermovoltaic semiconductor device including a plasma filter

    DOE Patents [OSTI]

    Baldasaro, Paul F.

    1999-01-01

    A thermovoltaic energy conversion device and related method for converting thermal energy into an electrical potential. An interference filter is provided on a semiconductor thermovoltaic cell to pre-filter black body radiation. The semiconductor thermovoltaic cell includes a P/N junction supported on a substrate which converts incident thermal energy below the semiconductor junction band gap into electrical potential. The semiconductor substrate is doped to provide a plasma filter which reflects back energy having a wavelength which is above the band gap and which is ineffectively filtered by the interference filter, through the P/N junction to the source of radiation thereby avoiding parasitic absorption of the unusable portion of the thermal radiation energy.

  13. Drapery assembly including insulated drapery liner

    DOE Patents [OSTI]

    Cukierski, Gwendolyn (Ithaca, NY)

    1983-01-01

    A drapery assembly is disclosed for covering a framed wall opening, the assembly including drapery panels hung on a horizontal traverse rod, the rod having a pair of master slides and means for displacing the master slides between open and closed positions. A pair of insulating liner panels are positioned behind the drapery, the remote side edges of the liner panels being connected with the side portions of the opening frame, and the adjacent side edges of the liner panels being connected with a pair of vertically arranged center support members adapted for sliding movement longitudinally of a horizontal track member secured to the upper horizontal portion of the opening frame. Pivotally arranged brackets connect the center support members with the master slides of the traverse rod whereby movement of the master slides to effect opening and closing of the drapery panels effects simultaneous opening and closing of the liner panels.

  14. Articles including thin film monolayers and multilayers

    DOE Patents [OSTI]

    Li, DeQuan; Swanson, Basil I.

    1995-01-01

    Articles of manufacture including: (a) a base substrate having an oxide surface layer, and a multidentate ligand, capable of binding a metal ion, attached to the oxide surface layer of the base substrate, (b) a base substrate having an oxide surface layer, a multidentate ligand, capable of binding a metal ion, attached to the oxide surface layer of the base substrate, and a metal species attached to the multidentate ligand, (c) a base substrate having an oxide surface layer, a multidentate ligand, capable of binding a metal ion, attached to the oxide surface layer of the base substrate, a metal species attached to the multidentate ligand, and a multifunctional organic ligand attached to the metal species, and (d) a base substrate having an oxide surface layer, a multidentate ligand, capable of binding a metal ion, attached to the oxide surface layer of the base substrate, a metal species attached to the multidentate ligand, a multifunctional organic ligand attached to the metal species, and a second metal species attached to the multifunctional organic ligand, are provided, such articles useful in detecting the presence of a selected target species, as nonliear optical materials, or as scavengers for selected target species.

  15. Engine lubrication circuit including two pumps

    DOE Patents [OSTI]

    Lane, William H.

    2006-10-03

    A lubrication pump coupled to the engine is sized such that the it can supply the engine with a predetermined flow volume as soon as the engine reaches a peak torque engine speed. In engines that operate predominately at speeds above the peak torque engine speed, the lubrication pump is often producing lubrication fluid in excess of the predetermined flow volume that is bypassed back to a lubrication fluid source. This arguably results in wasted power. In order to more efficiently lubricate an engine, a lubrication circuit includes a lubrication pump and a variable delivery pump. The lubrication pump is operably coupled to the engine, and the variable delivery pump is in communication with a pump output controller that is operable to vary a lubrication fluid output from the variable delivery pump as a function of at least one of engine speed and lubrication flow volume or system pressure. Thus, the lubrication pump can be sized to produce the predetermined flow volume at a speed range at which the engine predominately operates while the variable delivery pump can supplement lubrication fluid delivery from the lubrication pump at engine speeds below the predominant engine speed range.

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

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

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

  19. Ionic liquids, electrolyte solutions including the ionic liquids, and energy storage devices including the ionic liquids

    SciTech Connect (OSTI)

    Gering, Kevin L.; Harrup, Mason K.; Rollins, Harry W.

    2015-12-08

    An ionic liquid including a phosphazene compound that has a plurality of phosphorus-nitrogen units and at least one pendant group bonded to each phosphorus atom of the plurality of phosphorus-nitrogen units. One pendant group of the at least one pendant group comprises a positively charged pendant group. Additional embodiments of ionic liquids are disclosed, as are electrolyte solutions and energy storage devices including the embodiments of the ionic liquid.

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

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

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

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

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

  5. Nuclear Arms Control R&D Consortium includes Los Alamos

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

    Nuclear Arms Control R&D Consortium includes Los Alamos Nuclear Arms Control R&D Consortium includes Los Alamos A consortium led by the University of Michigan that includes LANL as ...

  6. Newport News in Review, ch. 47, segment includes TEDF groundbreaking...

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

    https:www.jlab.orgnewsarticlesnewport-news-review-ch-47-segment-includes-tedf-groundbreaking-event Newport News in Review, ch. 47, segment includes TEDF groundbreaking event...

  7. Property:Number of Plants included in Capacity Estimate | Open...

    Open Energy Info (EERE)

    Plants included in Capacity Estimate Jump to: navigation, search Property Name Number of Plants included in Capacity Estimate Property Type Number Retrieved from "http:...

  8. Property:Number of Plants Included in Planned Estimate | Open...

    Open Energy Info (EERE)

    Number of Plants Included in Planned Estimate Jump to: navigation, search Property Name Number of Plants Included in Planned Estimate Property Type String Description Number of...

  9. Solar Energy Education. Reader, Part II. Sun story. [Includes...

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

    Reader, Part II. Sun story. Includes glossary Citation Details In-Document Search Title: Solar Energy Education. Reader, Part II. Sun story. Includes glossary You are ...

  10. Natural Gas Delivered to Consumers in California (Including Vehicle...

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

    California (Including Vehicle Fuel) (Million Cubic Feet) Natural Gas Delivered to Consumers in California (Including Vehicle Fuel) (Million Cubic Feet) Year Jan Feb Mar Apr May Jun ...

  11. Should Title 24 Ventilation Requirements Be Amended to include...

    Office of Scientific and Technical Information (OSTI)

    include an Indoor Air Quality Procedure? Citation Details In-Document Search Title: Should Title 24 Ventilation Requirements Be Amended to include an Indoor Air Quality Procedure? ...

  12. Microfluidic devices and methods including porous polymer monoliths...

    Office of Scientific and Technical Information (OSTI)

    Microfluidic devices and methods including porous polymer monoliths Title: Microfluidic devices and methods including porous polymer monoliths Microfluidic devices and methods ...

  13. Microfluidic devices and methods including porous polymer monoliths...

    Office of Scientific and Technical Information (OSTI)

    Microfluidic devices and methods including porous polymer monoliths Citation Details In-Document Search Title: Microfluidic devices and methods including porous polymer monoliths ...

  14. Natural Gas Delivered to Consumers in Minnesota (Including Vehicle...

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

    Minnesota (Including Vehicle Fuel) (Million Cubic Feet) Natural Gas Delivered to Consumers in Minnesota (Including Vehicle Fuel) (Million Cubic Feet) Year Jan Feb Mar Apr May Jun ...

  15. FEMP Expands ESPC ENABLE Program to Include More Energy Conservation...

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

    Expands ESPC ENABLE Program to Include More Energy Conservation Measures FEMP Expands ESPC ENABLE Program to Include More Energy Conservation Measures November 13, 2013 - 12:00am...

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

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

  18. SWS Online Tool now includes Multifamily Content, plus a How...

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

    SWS Online Tool now includes Multifamily Content, plus a How-To Webinar SWS Online Tool now includes Multifamily Content, plus a How-To Webinar This announcement contains ...

  19. Natural Gas Delivered to Consumers in New Mexico (Including Vehicle...

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

    Mexico (Including Vehicle Fuel) (Million Cubic Feet) Natural Gas Delivered to Consumers in New Mexico (Including Vehicle Fuel) (Million Cubic Feet) Year Jan Feb Mar Apr May Jun Jul ...

  20. Quantitative Analysis of Biofuel Sustainability, Including Land Use Change

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

    GHG Emissions | Department of Energy Quantitative Analysis of Biofuel Sustainability, Including Land Use Change GHG Emissions Quantitative Analysis of Biofuel Sustainability, Including Land Use Change GHG Emissions Plenary V: Biofuels and Sustainability: Acknowledging Challenges and Confronting Misconceptions Quantitative Analysis of Biofuel Sustainability, Including Land Use Change GHG Emissions Jennifer B. Dunn, Energy Systems and Sustainability Analyst, Argonne National Laboratory

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

  2. Microfluidic devices and methods including porous polymer monoliths

    Office of Scientific and Technical Information (OSTI)

    (Patent) | SciTech Connect Microfluidic devices and methods including porous polymer monoliths Citation Details In-Document Search Title: Microfluidic devices and methods including porous polymer monoliths Microfluidic devices and methods including porous polymer monoliths are described. Polymerization techniques may be used to generate porous polymer monoliths having pores defined by a liquid component of a fluid mixture. The fluid mixture may contain iniferters and the resulting porous

  3. DOE Releases Request for Information on Critical Materials, Including Fuel

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

    Cell Platinum Group Metal Catalysts | Department of Energy Releases Request for Information on Critical Materials, Including Fuel Cell Platinum Group Metal Catalysts DOE Releases Request for Information on Critical Materials, Including Fuel Cell Platinum Group Metal Catalysts February 17, 2016 - 3:03pm Addthis The U.S. Department of Energy (DOE) has released a Request for Information (RFI) on critical materials in the energy sector, including fuel cell platinum group metal catalysts. The RFI

  4. Percentage of Total Natural Gas Commercial Deliveries included in Prices

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

    City Gate Price Residential Price Percentage of Total Residential Deliveries included in Prices Commercial Price Percentage of Total Commercial Deliveries included in Prices Industrial Price Percentage of Total Industrial Deliveries included in Prices Electric Power Price Period: Monthly Annual Download Series History Download Series History Definitions, Sources & Notes Definitions, Sources & Notes Show Data By: Data Series Area Jan-16 Feb-16 Mar-16 Apr-16 May-16 Jun-16 View History U.S.

  5. Percentage of Total Natural Gas Industrial Deliveries included in Prices

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

    Pipeline and Distribution Use Price City Gate Price Residential Price Percentage of Total Residential Deliveries included in Prices Commercial Price Percentage of Total Commercial Deliveries included in Prices Industrial Price Percentage of Total Industrial Deliveries included in Prices Vehicle Fuel Price Electric Power Price Period: Monthly Annual Download Series History Download Series History Definitions, Sources & Notes Definitions, Sources & Notes Show Data By: Data Series Area 2010

  6. Percentage of Total Natural Gas Industrial Deliveries included in Prices

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

    City Gate Price Residential Price Percentage of Total Residential Deliveries included in Prices Commercial Price Percentage of Total Commercial Deliveries included in Prices Industrial Price Percentage of Total Industrial Deliveries included in Prices Electric Power Price Period: Monthly Annual Download Series History Download Series History Definitions, Sources & Notes Definitions, Sources & Notes Show Data By: Data Series Area Jan-16 Feb-16 Mar-16 Apr-16 May-16 Jun-16 View History U.S.

  7. Percentage of Total Natural Gas Residential Deliveries included in Prices

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

    City Gate Price Residential Price Percentage of Total Residential Deliveries included in Prices Commercial Price Percentage of Total Commercial Deliveries included in Prices Industrial Price Percentage of Total Industrial Deliveries included in Prices Electric Power Price Period: Monthly Annual Download Series History Download Series History Definitions, Sources & Notes Definitions, Sources & Notes Show Data By: Data Series Area Jan-16 Feb-16 Mar-16 Apr-16 May-16 Jun-16 View History U.S.

  8. Comparison of Joint Modeling Approaches Including Eulerian Sliding...

    Office of Scientific and Technical Information (OSTI)

    Eulerian Sliding Interfaces Citation Details In-Document Search Title: Comparison of Joint Modeling Approaches Including Eulerian Sliding Interfaces You are accessing a ...

  9. Microfluidic devices and methods including porous polymer monoliths...

    Office of Scientific and Technical Information (OSTI)

    The fluid mixture may contain iniferters and the resulting porous polymer monolith may include surfaces terminated with iniferter species. Capture molecules may then be grafted to ...

  10. DOE Releases Request for Information on Critical Materials, Including...

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

    including fuel cell platinum group metal catalysts. ... on issues related to the demand, supply, opportunities for ... Announces Second RFI on Rare Earth Metals DOE Announces RFI ...

  11. Introduction to Small-Scale Wind Energy Systems (Including RETScreen...

    Open Energy Info (EERE)

    Case Study) (Webinar) Jump to: navigation, search Tool Summary LAUNCH TOOL Name: Introduction to Small-Scale Wind Energy Systems (Including RETScreen Case Study) (Webinar) Focus...

  12. Natural Gas Deliveries to Commercial Consumers (Including Vehicle...

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

    California (Million Cubic Feet) Natural Gas Deliveries to Commercial Consumers (Including Vehicle Fuel through 1996) in California (Million Cubic Feet) Year Jan Feb Mar Apr May Jun ...

  13. Numerical simulations for low energy nuclear reactions including...

    Office of Scientific and Technical Information (OSTI)

    Numerical simulations for low energy nuclear reactions including direct channels to validate statistical models Citation Details In-Document Search Title: Numerical simulations for ...

  14. U-182: Microsoft Windows Includes Some Invalid Certificates

    Broader source: Energy.gov [DOE]

    The operating system includes some invalid intermediate certificates. The vulnerability is due to the certificate authorities and not the operating system itself.

  15. Numerical simulations for low energy nuclear reactions including...

    Office of Scientific and Technical Information (OSTI)

    Numerical simulations for low energy nuclear reactions including direct channels to ... Visit OSTI to utilize additional information resources in energy science and technology. A ...

  16. Introduction to Small-Scale Photovoltaic Systems (Including RETScreen...

    Open Energy Info (EERE)

    Photovoltaic Systems (Including RETScreen Case Study) (Webinar) Jump to: navigation, search Tool Summary LAUNCH TOOL Name: Introduction to Small-Scale Photovoltaic Systems...

  17. Measuring and modeling the lifetime of nitrous oxide including...

    Office of Scientific and Technical Information (OSTI)

    Published Article: Measuring and modeling the lifetime of nitrous oxide including its variability: NITROUS OXIDE AND ITS CHANGING LIFETIME Prev Next Title: Measuring and ...

  18. Search for Earth-like planets includes LANL star analysis

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

    their interiors. Consortium team members at Los Alamos include Joyce Ann Guzik, Paul Bradley, Arthur N. Cox, and Kim Simmons. They will help interpret the stellar oscillation...

  19. Including Retro-Commissioning in Federal Energy Savings Performance Contracts

    Broader source: Energy.gov [DOE]

    Document describes guidance on the importance of (and steps to) including retro-commissioning in federal energy savings performance contracts (ESPCs).

  20. Microfluidic devices and methods including porous polymer monoliths

    DOE Patents [OSTI]

    Hatch, Anson V.; Sommer, Gregory j.; Singh, Anup K.; Wang, Ying-Chih; Abhyankar, Vinay

    2015-12-01

    Microfluidic devices and methods including porous polymer monoliths are described. Polymerization techniques may be used to generate porous polymer monoliths having pores defined by a liquid component of a fluid mixture. The fluid mixture may contain iniferters and the resulting porous polymer monolith may include surfaces terminated with iniferter species. Capture molecules may then be grafted to the monolith pores.

  1. Microfluidic devices and methods including porous polymer monoliths

    DOE Patents [OSTI]

    Hatch, Anson V; Sommer, Gregory J; Singh, Anup K; Wang, Ying-Chih; Abhyankar, Vinay V

    2014-04-22

    Microfluidic devices and methods including porous polymer monoliths are described. Polymerization techniques may be used to generate porous polymer monoliths having pores defined by a liquid component of a fluid mixture. The fluid mixture may contain iniferters and the resulting porous polymer monolith may include surfaces terminated with iniferter species. Capture molecules may then be grafted to the monolith pores.

  2. Solar Energy Education. Reader, Part II. Sun story. [Includes glossary

    SciTech Connect (OSTI)

    Not Available

    1981-05-01

    Magazine articles which focus on the subject of solar energy are presented. The booklet prepared is the second of a four part series of the Solar Energy Reader. Excerpts from the magazines include the history of solar energy, mythology and tales, and selected poetry on the sun. A glossary of energy related terms is included. (BCS)

  3. Articles which include chevron film cooling holes, and related processes

    DOE Patents [OSTI]

    Bunker, Ronald Scott; Lacy, Benjamin Paul

    2014-12-09

    An article is described, including an inner surface which can be exposed to a first fluid; an inlet; and an outer surface spaced from the inner surface, which can be exposed to a hotter second fluid. The article further includes at least one row or other pattern of passage holes. Each passage hole includes an inlet bore extending through the substrate from the inlet at the inner surface to a passage hole-exit proximate to the outer surface, with the inlet bore terminating in a chevron outlet adjacent the hole-exit. The chevron outlet includes a pair of wing troughs having a common surface region between them. The common surface region includes a valley which is adjacent the hole-exit; and a plateau adjacent the valley. The article can be an airfoil. Related methods for preparing the passage holes are also described.

  4. Turbomachine injection nozzle including a coolant delivery system

    DOE Patents [OSTI]

    Zuo, Baifang (Simpsonville, SC)

    2012-02-14

    An injection nozzle for a turbomachine includes a main body having a first end portion that extends to a second end portion defining an exterior wall having an outer surface. A plurality of fluid delivery tubes extend through the main body. Each of the plurality of fluid delivery tubes includes a first fluid inlet for receiving a first fluid, a second fluid inlet for receiving a second fluid and an outlet. The injection nozzle further includes a coolant delivery system arranged within the main body. The coolant delivery system guides a coolant along at least one of a portion of the exterior wall and around the plurality of fluid delivery tubes.

  5. Example Retro-Commissioning Scope of Work to Include Services...

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

    Services as Part of an ESPC Investment-Grade Audit Example Retro-Commissioning Scope of Work to Include Services as Part of an ESPC Investment-Grade Audit Document offers a ...

  6. Removal of mineral matter including pyrite from coal

    DOE Patents [OSTI]

    Reggel, Leslie; Raymond, Raphael; Blaustein, Bernard D.

    1976-11-23

    Mineral matter, including pyrite, is removed from coal by treatment of the coal with aqueous alkali at a temperature of about 175.degree. to 350.degree. C, followed by acidification with strong acid.

  7. Energy Department Expands Gas Gouging Reporting System to Include...

    Energy Savers [EERE]

    Expands Gas Gouging Reporting System to Include 1-800 Number: 1-800-244-3301 Energy Department Expands Gas ... of reformulated gasoline in storage and is already helping to ...

  8. T-603: Mac OS X Includes Some Invalid Comodo Certificates

    Office of Energy Efficiency and Renewable Energy (EERE)

    The operating system includes some invalid certificates. The vulnerability is due to the invalid certificates and not the operating system itself. Other browsers, applications, and operating systems are affected.

  9. Natural Gas Deliveries to Commercial Consumers (Including Vehicle...

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

    Mexico (Million Cubic Feet) Natural Gas Deliveries to Commercial Consumers (Including Vehicle Fuel through 1996) in New Mexico (Million Cubic Feet) Year Jan Feb Mar Apr May Jun Jul ...

  10. Including Retro-Commissioning in Federal Energy Savings Performance...

    Energy Savers [EERE]

    the cost of the survey. Developing a detailed scope of work and a fixed price for this work is important to eliminate risk to the Agency and the ESCo. Including a detailed scope...

  11. Natural Gas Delivered to Consumers in Ohio (Including Vehicle...

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

    Natural Gas Delivered to Consumers in Ohio (Including Vehicle Fuel) (Million Cubic Feet) Year Jan Feb Mar Apr May Jun Jul Aug Sep Oct Nov Dec 2001 136,340 110,078 102,451 66,525 ...

  12. Thermodynamic Advantages of Low Temperature Combustion Engines Including

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

    the Use of Low Heat Rejection Concepts | Department of Energy Advantages of Low Temperature Combustion Engines Including the Use of Low Heat Rejection Concepts Thermodynamic Advantages of Low Temperature Combustion Engines Including the Use of Low Heat Rejection Concepts Thermodynamic cycle simulation was used to evaluate low temperature combustion in systematic and sequential fashion to base engine design. deer10_caton.pdf (462.23 KB) More Documents & Publications Boosted HCCI for High

  13. Hybrid powertrain system including smooth shifting automated transmission

    DOE Patents [OSTI]

    Beaty, Kevin D.; Nellums, Richard A.

    2006-10-24

    A powertrain system is provided that includes a prime mover and a change-gear transmission having an input, at least two gear ratios, and an output. The powertrain system also includes a power shunt configured to route power applied to the transmission by one of the input and the output to the other one of the input and the output. A transmission system and a method for facilitating shifting of a transmission system are also provided.

  14. Prevention of Harassment (Including Sexual Harassment) and Retaliation

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

    Policy Statement | Department of Energy Prevention of Harassment (Including Sexual Harassment) and Retaliation Policy Statement Prevention of Harassment (Including Sexual Harassment) and Retaliation Policy Statement DOE Policy for Preventing Harassment in the Workplace Harassment Policy July 2011.pdf (112.57 KB) More Documents & Publications Policy Statement on Equal Employment Opportunity, Harassment, and Retaliation Equal Employment Opportunity and Diversity Policy Statement VWA-0039 -

  15. Limited Personal Use of Government Office Equipment including Information Technology

    Broader source: Directives, Delegations, and Requirements [Office of Management (MA)]

    2005-01-07

    The Order establishes requirements and assigns responsibilities for employees' limited personal use of Government resources (office equipment and other resources including information technology) within DOE, including NNSA. The Order is required to provide guidance on appropriate and inappropriate uses of Government resources. This Order was certified 04/23/2009 as accurate and continues to be relevant and appropriate for use by the Department. Certified 4-23-09. No cancellation.

  16. Solar Energy Education. Reader, Part II. Sun story. [Includes glossary]

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

    (Technical Report) | SciTech Connect Reader, Part II. Sun story. [Includes glossary] Citation Details In-Document Search Title: Solar Energy Education. Reader, Part II. Sun story. [Includes glossary] × You are accessing a document from the Department of Energy's (DOE) SciTech Connect. This site is a product of DOE's Office of Scientific and Technical Information (OSTI) and is provided as a public service. Visit OSTI to utilize additional information resources in energy science and

  17. Solar Energy Education. Renewable energy: a background text. [Includes

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

    glossary] (Technical Report) | SciTech Connect energy: a background text. [Includes glossary] Citation Details In-Document Search Title: Solar Energy Education. Renewable energy: a background text. [Includes glossary] × You are accessing a document from the Department of Energy's (DOE) SciTech Connect. This site is a product of DOE's Office of Scientific and Technical Information (OSTI) and is provided as a public service. Visit OSTI to utilize additional information resources in energy

  18. DOE Revises its NEPA Regulations, Including Categorical Exclusions |

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

    Department of Energy Revises its NEPA Regulations, Including Categorical Exclusions DOE Revises its NEPA Regulations, Including Categorical Exclusions September 30, 2011 - 2:30pm Addthis On September 27, 2011, the Department of Energy (DOE) approved revisions to its National Environmental Policy Act (NEPA) regulations, and on September 28th, submitted the revisions to the Federal Register. The final regulations, which become effective 30 days after publication in the Federal Register, are

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

  20. A model for heterogeneous materials including phase transformations

    SciTech Connect (OSTI)

    Addessio, F.L.; Clements, B.E.; Williams, T.O.

    2005-04-15

    A model is developed for particulate composites, which includes phase transformations in one or all of the constituents. The model is an extension of the method of cells formalism. Representative simulations for a single-phase, brittle particulate (SiC) embedded in a ductile material (Ti), which undergoes a solid-solid phase transformation, are provided. Also, simulations for a tungsten heavy alloy (WHA) are included. In the WHA analyses a particulate composite, composed of tungsten particles embedded in a tungsten-iron-nickel alloy matrix, is modeled. A solid-liquid phase transformation of the matrix material is included in the WHA numerical calculations. The example problems also demonstrate two approaches for generating free energies for the material constituents. Simulations for volumetric compression, uniaxial strain, biaxial strain, and pure shear are used to demonstrate the versatility of the model.

  1. Methods of producing adsorption media including a metal oxide

    DOE Patents [OSTI]

    Mann, Nicholas R; Tranter, Troy J

    2014-03-04

    Methods of producing a metal oxide are disclosed. The method comprises dissolving a metal salt in a reaction solvent to form a metal salt/reaction solvent solution. The metal salt is converted to a metal oxide and a caustic solution is added to the metal oxide/reaction solvent solution to adjust the pH of the metal oxide/reaction solvent solution to less than approximately 7.0. The metal oxide is precipitated and recovered. A method of producing adsorption media including the metal oxide is also disclosed, as is a precursor of an active component including particles of a metal oxide.

  2. Metal vapor laser including hot electrodes and integral wick

    DOE Patents [OSTI]

    Ault, E.R.; Alger, T.W.

    1995-03-07

    A metal vapor laser, specifically one utilizing copper vapor, is disclosed herein. This laser utilizes a plasma tube assembly including a thermally insulated plasma tube containing a specific metal, e.g., copper, and a buffer gas therein. The laser also utilizes means including hot electrodes located at opposite ends of the plasma tube for electrically exciting the metal vapor and heating its interior to a sufficiently high temperature to cause the metal contained therein to vaporize and for subjecting the vapor to an electrical discharge excitation in order to lase. The laser also utilizes external wicking arrangements, that is, wicking arrangements located outside the plasma tube. 5 figs.

  3. Metal vapor laser including hot electrodes and integral wick

    DOE Patents [OSTI]

    Ault, Earl R.; Alger, Terry W.

    1995-01-01

    A metal vapor laser, specifically one utilizing copper vapor, is disclosed herein. This laser utilizes a plasma tube assembly including a thermally insulated plasma tube containing a specific metal, e.g., copper, and a buffer gas therein. The laser also utilizes means including hot electrodes located at opposite ends of the plasma tube for electrically exciting the metal vapor and heating its interior to a sufficiently high temperature to cause the metal contained therein to vaporize and for subjecting the vapor to an electrical discharge excitation in order to lase. The laser also utilizes external wicking arrangements, that is, wicking arrangements located outside the plasma tube.

  4. Solar Energy Education. Renewable energy: a background text. [Includes glossary

    SciTech Connect (OSTI)

    Not Available

    1985-01-01

    Some of the most common forms of renewable energy are presented in this textbook for students. The topics include solar energy, wind power hydroelectric power, biomass ocean thermal energy, and tidal and geothermal energy. The main emphasis of the text is on the sun and the solar energy that it yields. Discussions on the sun's composition and the relationship between the earth, sun and atmosphere are provided. Insolation, active and passive solar systems, and solar collectors are the subtopics included under solar energy. (BCS)

  5. Tunable cavity resonator including a plurality of MEMS beams

    DOE Patents [OSTI]

    Peroulis, Dimitrios; Fruehling, Adam; Small, Joshua Azariah; Liu, Xiaoguang; Irshad, Wasim; Arif, Muhammad Shoaib

    2015-10-20

    A tunable cavity resonator includes a substrate, a cap structure, and a tuning assembly. The cap structure extends from the substrate, and at least one of the substrate and the cap structure defines a resonator cavity. The tuning assembly is positioned at least partially within the resonator cavity. The tuning assembly includes a plurality of fixed-fixed MEMS beams configured for controllable movement relative to the substrate between an activated position and a deactivated position in order to tune a resonant frequency of the tunable cavity resonator.

  6. DOE Considers Natural Gas Utility Service Options: Proposal Includes

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

    30-mile Natural Gas Pipeline from Pasco to Hanford | Department of Energy Considers Natural Gas Utility Service Options: Proposal Includes 30-mile Natural Gas Pipeline from Pasco to Hanford DOE Considers Natural Gas Utility Service Options: Proposal Includes 30-mile Natural Gas Pipeline from Pasco to Hanford January 23, 2012 - 12:00pm Addthis Media Contacts Cameron Hardy, DOE , (509) 376-5365, Cameron.Hardy@rl.doe.gov RICHLAND, WASH. - The U.S. Department of Energy (DOE) is considering

  7. Thin film solar cell including a spatially modulated intrinsic layer

    SciTech Connect (OSTI)

    Guha, Subhendu; Yang, Chi-Chung; Ovshinsky, Stanford R.

    1989-03-28

    One or more thin film solar cells in which the intrinsic layer of substantially amorphous semiconductor alloy material thereof includes at least a first band gap portion and a narrower band gap portion. The band gap of the intrinsic layer is spatially graded through a portion of the bulk thickness, said graded portion including a region removed from the intrinsic layer-dopant layer interfaces. The band gap of the intrinsic layer is always less than the band gap of the doped layers. The gradation of the intrinsic layer is effected such that the open circuit voltage and/or the fill factor of the one or plural solar cell structure is enhanced.

  8. cDNA encoding a polypeptide including a hevein sequence

    DOE Patents [OSTI]

    Raikhel, N.V.; Broekaert, W.F.; Namhai Chua; Kush, A.

    1993-02-16

    A cDNA clone (HEV1) encoding hevein was isolated via polymerase chain reaction (PCR) using mixed oligonucleotides corresponding to two regions of hevein as primers and a Hevea brasiliensis latex cDNA library as a template. HEV1 is 1,018 nucleotides long and includes an open reading frame of 204 amino acids.

  9. Information regarding previous INCITE awards including selected highlights

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

    | U.S. DOE Office of Science (SC) Information regarding previous INCITE awards including selected highlights Advanced Scientific Computing Research (ASCR) ASCR Home About Research Facilities User Facilities Accessing ASCR Facilities Innovative & Novel Computational Impact on Theory & Experiement (INCITE) ASCR Leadership Computing Challenge (ALCC) Industrial Users Computational Science Graduate Fellowship (CSGF) Research & Evaluation Prototypes (REP) Science Highlights Benefits of

  10. [Article 1 of 7: Motivates and Includes the Consumer]

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

    2 of 7: Research on the Characteristics of a Modern Grid by the NETL Modern Grid Strategy Team Accommodates All Generation and Storage Options Last month we presented the first Principal Characteristic of a Modern Grid, "Motivates and Includes the Consumer". This month we present a second characteristic, "Accommodates All Generation and Storage Options". This characteristic will fundamentally transition today's grid from a centralized model for generation to one that also has

  11. [Article 1 of 7: Motivates and Includes the Consumer]

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

    Series on the Seven Principal Characteristics of the Modern Grid [Article 1 of 7: Motivates and Includes the Consumer] In October 2007, Ken Silverstein (Energy Central) wrote an editorial, "Empowering Consumers" that hit a strong, kindred chord with the DOE/National Energy Technology Laboratory (NETL) Modern Grid Strategy team. Through subsequent discussions with Ken and Bill Opalka, Editor- In-Chief, Topics Centers, we decided it would be informative to the industry if the Modern Grid

  12. Evaporative cooler including one or more rotating cooler louvers

    DOE Patents [OSTI]

    Gerlach, David W

    2015-02-03

    An evaporative cooler may include an evaporative cooler housing with a duct extending therethrough, a plurality of cooler louvers with respective porous evaporative cooler pads, and a working fluid source conduit. The cooler louvers are arranged within the duct and rotatably connected to the cooler housing along respective louver axes. The source conduit provides an evaporative cooler working fluid to the cooler pads during at least one mode of operation.

  13. Conversion of geothermal waste to commercial products including silica

    DOE Patents [OSTI]

    Premuzic, Eugene T.; Lin, Mow S.

    2003-01-01

    A process for the treatment of geothermal residue includes contacting the pigmented amorphous silica-containing component with a depigmenting reagent one or more times to depigment the silica and produce a mixture containing depigmented amorphous silica and depigmenting reagent containing pigment material; separating the depigmented amorphous silica and from the depigmenting reagent to yield depigmented amorphous silica. Before or after the depigmenting contacting, the geothermal residue or depigmented silica can be treated with a metal solubilizing agent to produce another mixture containing pigmented or unpigmented amorphous silica-containing component and a solubilized metal-containing component; separating these components from each other to produce an amorphous silica product substantially devoid of metals and at least partially devoid of pigment. The amorphous silica product can be neutralized and thereafter dried at a temperature from about 25.degree. C. to 300.degree. C. The morphology of the silica product can be varied through the process conditions including sequence contacting steps, pH of depigmenting reagent, neutralization and drying conditions to tailor the amorphous silica for commercial use in products including filler for paint, paper, rubber and polymers, and chromatographic material.

  14. Electrolytes including fluorinated solvents for use in electrochemical cells

    DOE Patents [OSTI]

    Tikhonov, Konstantin; Yip, Ka Ki; Lin, Tzu-Yuan

    2015-07-07

    Provided are electrochemical cells and electrolytes used to build such cells. The electrolytes include ion-supplying salts and fluorinated solvents capable of maintaining single phase solutions with the salts at between about -30.degree. C. to about 80.degree. C. The fluorinated solvents, such as fluorinated carbonates, fluorinated esters, and fluorinated esters, are less flammable than their non-fluorinated counterparts and increase safety characteristics of cells containing these solvents. The amount of fluorinated solvents in electrolytes may be between about 30% and 80% by weight not accounting weight of the salts. Fluorinated salts, such as fluoroalkyl-substituted LiPF.sub.6, fluoroalkyl-substituted LiBF.sub.4 salts, linear and cyclic imide salts as well as methide salts including fluorinated alkyl groups, may be used due to their solubility in the fluorinated solvents. In some embodiments, the electrolyte may also include a flame retardant, such as a phosphazene or, more specifically, a cyclic phosphazene and/or one or more ionic liquids.

  15. cDNA encoding a polypeptide including a hevein sequence

    DOE Patents [OSTI]

    Raikhel, Natasha V.; Broekaert, Willem F.; Chua, Nam-Hai; Kush, Anil

    1993-02-16

    A cDNA clone (HEV1) encoding hevein was isolated via polymerase chain reaction (PCR) using mixed oligonucleotides corresponding to two regions of hevein as primers and a Hevea brasiliensis latex cDNA library as a template. HEV1 is 1018 nucleotides long and includes an open reading frame of 204 amino acids. The deduced amino acid sequence contains a pu GOVERNMENT RIGHTS This application was funded under Department of Energy Contract DE-AC02-76ER01338. The U.S. Government has certain rights under this application and any patent issuing thereon.

  16. NREL: Technology Deployment - Cities-LEAP Energy Profile Tool Includes

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

    Energy Data on More than 23,400 U.S. Cities Cities-LEAP Energy Profile Tool Includes Energy Data on More than 23,400 U.S. Cities News NREL Report Examines Energy Use in Cities and Proposes Next Steps for Energy Innovation Publications Citi-Level Energy Decision Making: Data Use in Energy Planning, Implementation, and Evaluation in U.S. Cities Sponsors DOE's Energy Office of Energy Efficiency and Renewable Energy Policy and Analysis Office Related Stories Hawaii's First Net-Zero Energy

  17. What To Include In The Whistleblower Complaint? | National Nuclear Security

    National Nuclear Security Administration (NNSA)

    Administration | (NNSA) To Include In The Whistleblower Complaint? Your complaint does not need to be in any specific form but must be signed by you and contain the following: A statement specifically describing 1. The alleged retaliation taken against you and 2. The disclosure, participation, or refusal that you believe gave rise to the retaliation; A statement that you are not currently pursuing a remedy under State or other applicable law, as described in Sec. 708.15 of this subpart; A

  18. Composite material including nanocrystals and methods of making

    DOE Patents [OSTI]

    Bawendi, Moungi G.; Sundar, Vikram C.

    2008-02-05

    Temperature-sensing compositions can include an inorganic material, such as a semiconductor nanocrystal. The nanocrystal can be a dependable and accurate indicator of temperature. The intensity of emission of the nanocrystal varies with temperature and can be highly sensitive to surface temperature. The nanocrystals can be processed with a binder to form a matrix, which can be varied by altering the chemical nature of the surface of the nanocrystal. A nanocrystal with a compatibilizing outer layer can be incorporated into a coating formulation and retain its temperature sensitive emissive properties

  19. Composite material including nanocrystals and methods of making

    DOE Patents [OSTI]

    Bawendi, Moungi G.; Sundar, Vikram C.

    2010-04-06

    Temperature-sensing compositions can include an inorganic material, such as a semiconductor nanocrystal. The nanocrystal can be a dependable and accurate indicator of temperature. The intensity of emission of the nanocrystal varies with temperature and can be highly sensitive to surface temperature. The nanocrystals can be processed with a binder to form a matrix, which can be varied by altering the chemical nature of the surface of the nanocrystal. A nanocrystal with a compatibilizing outer layer can be incorporated into a coating formulation and retain its temperature sensitive emissive properties.

  20. A coke oven model including thermal decomposition kinetics of tar

    SciTech Connect (OSTI)

    Munekane, Fuminori; Yamaguchi, Yukio; Tanioka, Seiichi

    1997-12-31

    A new one-dimensional coke oven model has been developed for simulating the amount and the characteristics of by-products such as tar and gas as well as coke. This model consists of both heat transfer and chemical kinetics including thermal decomposition of coal and tar. The chemical kinetics constants are obtained by estimation based on the results of experiments conducted to investigate the thermal decomposition of both coal and tar. The calculation results using the new model are in good agreement with experimental ones.

  1. Composite armor, armor system and vehicle including armor system

    DOE Patents [OSTI]

    Chu, Henry S.; Jones, Warren F.; Lacy, Jeffrey M.; Thinnes, Gary L.

    2013-01-01

    Composite armor panels are disclosed. Each panel comprises a plurality of functional layers comprising at least an outermost layer, an intermediate layer and a base layer. An armor system incorporating armor panels is also disclosed. Armor panels are mounted on carriages movably secured to adjacent rails of a rail system. Each panel may be moved on its associated rail and into partially overlapping relationship with another panel on an adjacent rail for protection against incoming ordnance from various directions. The rail system may be configured as at least a part of a ring, and be disposed about a hatch on a vehicle. Vehicles including an armor system are also disclosed.

  2. Community Assessment Tool for Public Health Emergencies Including Pandemic Influenza

    SciTech Connect (OSTI)

    ORAU's Oak Ridge Institute for Science Education

    2011-04-14

    The Community Assessment Tool (CAT) for Public Health Emergencies Including Pandemic Influenza (hereafter referred to as the CAT) was developed as a result of feedback received from several communities. These communities participated in workshops focused on influenza pandemic planning and response. The 2008 through 2011 workshops were sponsored by the Centers for Disease Control and Prevention (CDC). Feedback during those workshops indicated the need for a tool that a community can use to assess its readiness for a disaster - readiness from a total healthcare perspective, not just hospitals, but the whole healthcare system. The CAT intends to do just that - help strengthen existing preparedness plans by allowing the healthcare system and other agencies to work together during an influenza pandemic. It helps reveal each core agency partners (sectors) capabilities and resources, and highlights cases of the same vendors being used for resource supplies (e.g., personal protective equipment [PPE] and oxygen) by the partners (e.g., public health departments, clinics, or hospitals). The CAT also addresses gaps in the community's capabilities or potential shortages in resources. This tool has been reviewed by a variety of key subject matter experts from federal, state, and local agencies and organizations. It also has been piloted with various communities that consist of different population sizes, to include large urban to small rural communities.

  3. Copper laser modulator driving assembly including a magnetic compression laser

    DOE Patents [OSTI]

    Cook, Edward G.; Birx, Daniel L.; Ball, Don G.

    1994-01-01

    A laser modulator (10) having a low voltage assembly (12) with a plurality of low voltage modules (14) with first stage magnetic compression circuits (20) and magnetic assist inductors (28) with a common core (91), such that timing of the first stage magnetic switches (30b) is thereby synchronized. A bipolar second stage of magnetic compression (42) is coupled to the low voltage modules (14) through a bipolar pulse transformer (36) and a third stage of magnetic compression (44) is directly coupled to the second stage of magnetic compression (42). The low voltage assembly (12) includes pressurized boxes (117) for improving voltage standoff between the primary winding assemblies (34) and secondary winding (40) contained therein.

  4. Nijmegen soft-core potential including two-meson exchange

    SciTech Connect (OSTI)

    Stoks, V.G.J.; Rijken, T.A.

    1995-05-10

    We report on the progress of the construction of the extended soft-core (ESC) Nijmegen potential. Next to the standard one-boson-exchange parts, the model includes the pion-meson-exchange potentials due to the parallel and crossed-box diagrams, as well as the one-pair and two-pair diagrams, vertices for which can be identified with similar interactions appearing in chiral-symmetric Lagrangians. Although the ESC potential is still under construction, it already gives an excellent description of all {ital NN} scattering data below 350 MeV with {chi}{sup 2}/datum=1.3. {copyright} {ital 1995} {ital American} {ital Institute} {ital of} {ital Physics}.

  5. Fuel cell repeater unit including frame and separator plate

    DOE Patents [OSTI]

    Yamanis, Jean; Hawkes, Justin R; Chiapetta, Jr., Louis; Bird, Connie E; Sun, Ellen Y; Croteau, Paul F

    2013-11-05

    An example fuel cell repeater includes a separator plate and a frame establishing at least a portion of a flow path that is operative to communicate fuel to or from at least one fuel cell held by the frame relative to the separator plate. The flow path has a perimeter and any fuel within the perimeter flow across the at least one fuel cell in a first direction. The separator plate, the frame, or both establish at least one conduit positioned outside the flow path perimeter. The conduit is outside of the flow path perimeter and is configured to direct flow in a second, different direction. The conduit is fluidly coupled with the flow path.

  6. Hydraulic engine valve actuation system including independent feedback control

    DOE Patents [OSTI]

    Marriott, Craig D

    2013-06-04

    A hydraulic valve actuation assembly may include a housing, a piston, a supply control valve, a closing control valve, and an opening control valve. The housing may define a first fluid chamber, a second fluid chamber, and a third fluid chamber. The piston may be axially secured to an engine valve and located within the first, second and third fluid chambers. The supply control valve may control a hydraulic fluid supply to the piston. The closing control valve may be located between the supply control valve and the second fluid chamber and may control fluid flow from the second fluid chamber to the supply control valve. The opening control valve may be located between the supply control valve and the second fluid chamber and may control fluid flow from the supply control valve to the second fluid chamber.

  7. Recent progress and advances in iterative software (including parallel aspects)

    SciTech Connect (OSTI)

    Carey, G.; Young, D.M.; Kincaid, D.

    1994-12-31

    The purpose of the workshop is to provide a forum for discussion of the current state of iterative software packages. Of particular interest is software for large scale engineering and scientific applications, especially for distributed parallel systems. However, the authors will also review the state of software development for conventional architectures. This workshop will complement the other proposed workshops on iterative BLAS kernels and applications. The format for the workshop is as follows: To provide some structure, there will be brief presentations, each of less than five minutes duration and dealing with specific facets of the subject. These will be designed to focus the discussion and to stimulate an exchange with the participants. Issues to be covered include: The evolution of iterative packages, current state of the art, the parallel computing challenge, applications viewpoint, standards, and future directions and open problems.

  8. Actuator assembly including a single axis of rotation locking member

    DOE Patents [OSTI]

    Quitmeyer, James N.; Benson, Dwayne M.; Geck, Kellan P.

    2009-12-08

    An actuator assembly including an actuator housing assembly and a single axis of rotation locking member fixedly attached to a portion of the actuator housing assembly and an external mounting structure. The single axis of rotation locking member restricting rotational movement of the actuator housing assembly about at least one axis. The single axis of rotation locking member is coupled at a first end to the actuator housing assembly about a Y axis and at a 90.degree. angle to an X and Z axis providing rotation of the actuator housing assembly about the Y axis. The single axis of rotation locking member is coupled at a second end to a mounting structure, and more particularly a mounting pin, about an X axis and at a 90.degree. angle to a Y and Z axis providing rotation of the actuator housing assembly about the X axis. The actuator assembly is thereby restricted from rotation about the Z axis.

  9. Dye laser amplifier including a specifically designed diffuser assembly

    DOE Patents [OSTI]

    Davin, James; Johnston, James P.

    1992-01-01

    A large (high flow rate) dye laser amplifier in which a continuous replened supply of dye is excited by a first light beam, specifically a copper vapor laser beam, in order to amplify the intensity of a second different light beam, specifically a dye beam, passing through the dye is disclosed herein. This amplifier includes a dye cell defining a dye chamber through which a continuous stream of dye is caused to pass at a relatively high flow rate and a specifically designed diffuser assembly for slowing down the flow of dye while, at the same time, assuring that as the dye stream flows through the diffuser assembly it does so in a stable manner.

  10. Electra-optical device including a nitrogen containing electrolyte

    DOE Patents [OSTI]

    Bates, J.B.; Dudney, N.J.; Gruzalski, G.R.; Luck, C.F.

    1995-10-03

    Described is a thin-film battery, especially a thin-film microbattery, and a method for making same having application as a backup or primary integrated power source for electronic devices. The battery includes a novel electrolyte which is electrochemically stable and does not react with the lithium anode and a novel vanadium oxide cathode. Configured as a microbattery, the battery can be fabricated directly onto a semiconductor chip, onto the semiconductor die or onto any portion of the chip carrier. The battery can be fabricated to any specified size or shape to meet the requirements of a particular application. The battery is fabricated of solid state materials and is capable of operation between {minus}15 C and 150 C.

  11. Electra-optical device including a nitrogen containing electrolyte

    DOE Patents [OSTI]

    Bates, John B.; Dudney, Nancy J.; Gruzalski, Greg R.; Luck, Christopher F.

    1995-01-01

    Described is a thin-film battery, especially a thin-film microbattery, and a method for making same having application as a backup or primary integrated power source for electronic devices. The battery includes a novel electrolyte which is electrochemically stable and does not react with the lithium anode and a novel vanadium oxide cathode Configured as a microbattery, the battery can be fabricated directly onto a semiconductor chip, onto the semiconductor die or onto any portion of the chip carrier. The battery can be fabricated to any specified size or shape to meet the requirements of a particular application. The battery is fabricated of solid state materials and is capable of operation between -15.degree. C. and 150.degree. C.

  12. Pulse transmission transmitter including a higher order time derivate filter

    DOE Patents [OSTI]

    Dress, Jr., William B.; Smith, Stephen F.

    2003-09-23

    Systems and methods for pulse-transmission low-power communication modes are disclosed. A pulse transmission transmitter includes: a clock; a pseudorandom polynomial generator coupled to the clock, the pseudorandom polynomial generator having a polynomial load input; an exclusive-OR gate coupled to the pseudorandom polynomial generator, the exclusive-OR gate having a serial data input; a programmable delay circuit coupled to both the clock and the exclusive-OR gate; a pulse generator coupled to the programmable delay circuit; and a higher order time derivative filter coupled to the pulse generator. The systems and methods significantly reduce lower-frequency emissions from pulse transmission spread-spectrum communication modes, which reduces potentially harmful interference to existing radio frequency services and users and also simultaneously permit transmission of multiple data bits by utilizing specific pulse shapes.

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

    SciTech Connect (OSTI)

    Baden, Scott B; Weare, John H; Bylaska, Eric J

    2013-04-30

    The goals of this project are to develop new, scalable, high-fidelity algorithms for atomic-level simulations and program transformations that automatically restructure existing applications, enabling them to scale forward to Petascale systems and beyond. The techniques enable legacy MPI application code to exploit greater parallelism though increased latency hiding and improved workload assignment. The techniques were successfully demonstrated on high-end scalable systems located at DOE laboratories. Besides the automatic MPI program transformations efforts, the project also developed several new scalable algorithms for ab-initio molecular dynamics, including new massively parallel algorithms for hybrid DFT and new parallel in time algorithms for molecular dynamics and ab-initio molecular dynamics. These algorithms were shown to scale to very large number of cores, and they were designed to work in the latency hiding framework developed in this project. The effectiveness of the developments was enhanced by the direct application to real grand challenge simulation problems covering a wide range of technologically important applications, time scales and accuracies. These included the simulation of the electronic structure of mineral/fluid interfaces, the very accurate simulation of chemical reactions in microsolvated environments, and the simulation of chemical behavior in very large enzyme reactions.

  14. cDNA encoding a polypeptide including a hevein sequence

    DOE Patents [OSTI]

    Raikhel, N.V.; Broekaert, W.F.; Chua, N.H.; Kush, A.

    1999-05-04

    A cDNA clone (HEV1) encoding hevein was isolated via polymerase chain reaction (PCR) using mixed oligonucleotides corresponding to two regions of hevein as primers and a Hevea brasiliensis latex cDNA library as a template. HEV1 is 1018 nucleotides long and includes an open reading frame of 204 amino acids. The deduced amino acid sequence contains a putative signal sequence of 17 amino acid residues followed by a 187 amino acid polypeptide. The amino-terminal region (43 amino acids) is identical to hevein and shows homology to several chitin-binding proteins and to the amino-termini of wound-induced genes in potato and poplar. The carboxyl-terminal portion of the polypeptide (144 amino acids) is 74--79% homologous to the carboxyl-terminal region of wound-inducible genes of potato. Wounding, as well as application of the plant hormones abscisic acid and ethylene, resulted in accumulation of hevein transcripts in leaves, stems and latex, but not in roots, as shown by using the cDNA as a probe. A fusion protein was produced in E. coli from the protein of the present invention and maltose binding protein produced by the E. coli. 12 figs.

  15. cDNA encoding a polypeptide including a hevein sequence

    DOE Patents [OSTI]

    Raikhel, Natasha V.; Broekaert, Willem F.; Chua, Nam-Hai; Kush, Anil

    1999-05-04

    A cDNA clone (HEV1) encoding hevein was isolated via polymerase chain reaction (PCR) using mixed oligonucleotides corresponding to two regions of hevein as primers and a Hevea brasiliensis latex cDNA library as a template. HEV1 is 1018 nucleotides long and includes an open reading frame of 204 amino acids. The deduced amino acid sequence contains a putative signal sequence of 17 amino acid residues followed by a 187 amino acid polypeptide. The amino-terminal region (43 amino acids) is identical to hevein and shows homology to several chitin-binding proteins and to the amino-termini of wound-induced genes in potato and poplar. The carboxyl-terminal portion of the polypeptide (144 amino acids) is 74-79% homologous to the carboxyl-terminal region of wound-inducible genes of potato. Wounding, as well as application of the plant hormones abscisic acid and ethylene, resulted in accumulation of hevein transcripts in leaves, stems and latex, but not in roots, as shown by using the cDNA as a probe. A fusion protein was produced in E. coli from the protein of the present invention and maltose binding protein produced by the E. coli.

  16. CDNA encoding a polypeptide including a hevein sequence

    DOE Patents [OSTI]

    Raikhel, Natasha V.; Broekaert, Willem F.; Chua, Nam-Hai; Kush, Anil

    1995-03-21

    A cDNA clone (HEV1) encoding hevein was isolated via polymerase chain reaction (PCR) using mixed oligonucleotides corresponding to two regions of hevein as primers and a Hevea brasiliensis latex cDNA library as a template. HEV1 is 1018 nucleotides long and includes an open reading frame of 204 amino acids. The deduced amino acid sequence contains a putative signal sequence of 17 amino acid residues followed by a 187 amino acid polypeptide. The amino-terminal region (43 amino acids) is identical to hevein and shows homology to several chitin-binding proteins and to the amino-termini of wound-induced genes in potato and poplar. The carboxyl-terminal portion of the polypeptide (144 amino acids) is 74-79% homologous to the carboxyl-terminal region of wound-inducible genes of potato. Wounding, as well as application of the plant hormones abscisic acid and ethylene, resulted in accumulation of hevein transcripts in leaves, stems and latex, but not in roots, as shown by using the cDNA as a probe. A fusion protein was produced in E. coli from the protein of the present invention and maltose binding protein produced by the E. coli.

  17. Extractant composition including crown ether and calixarene extractants

    DOE Patents [OSTI]

    Meikrantz, David H.; Todd, Terry A.; Riddle, Catherine L.; Law, Jack D.; Peterman, Dean R.; Mincher, Bruce J.; McGrath, Christopher A.; Baker, John D.

    2009-04-28

    An extractant composition comprising a mixed extractant solvent consisting of calix[4] arene-bis-(tert-octylbenzo)-crown-6 ("BOBCalixC6"), 4',4',(5')-di-(t-butyldicyclo-hexano)-18-crown-6 ("DtBu18C6"), and at least one modifier dissolved in a diluent. The DtBu18C6 may be present at from approximately 0.01M to approximately 0.4M, such as at from approximately 0.086 M to approximately 0.108 M. The modifier may be 1-(2,2,3,3-tetrafluoropropoxy)-3-(4-sec-butylphenoxy)-2-propanol ("Cs-7SB") and may be present at from approximately 0.01M to approximately 0.8M. In one embodiment, the mixed extractant solvent includes approximately 0.15M DtBu18C6, approximately 0.007M BOBCalixC6, and approximately 0.75M Cs-7SB modifier dissolved in an isoparaffinic hydrocarbon diluent. The extractant composition further comprises an aqueous phase. The mixed extractant solvent may be used to remove cesium and strontium from the aqueous phase.

  18. C -parameter distribution at N 3 LL ' including power corrections

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

    Hoang, André H.; Kolodrubetz, Daniel W.; Mateu, Vicent; Stewart, Iain W.

    2015-05-15

    We compute the e⁺e⁻ C-parameter distribution using the soft-collinear effective theory with a resummation to next-to-next-to-next-to-leading-log prime accuracy of the most singular partonic terms. This includes the known fixed-order QCD results up to O(α3s), a numerical determination of the two-loop nonlogarithmic term of the soft function, and all logarithmic terms in the jet and soft functions up to three loops. Our result holds for C in the peak, tail, and far tail regions. Additionally, we treat hadronization effects using a field theoretic nonperturbative soft function, with moments Ωn. To eliminate an O(ΛQCD) renormalon ambiguity in the soft function, we switchmore » from the MS¯ to a short distance “Rgap” scheme to define the leading power correction parameter Ω1. We show how to simultaneously account for running effects in Ω1 due to renormalon subtractions and hadron-mass effects, enabling power correction universality between C-parameter and thrust to be tested in our setup. We discuss in detail the impact of resummation and renormalon subtractions on the convergence. In the relevant fit region for αs(mZ) and Ω1, the perturbative uncertainty in our cross section is ≅ 2.5% at Q=mZ.« less

  19. Interim performance criteria for photovoltaic energy systems. [Glossary included

    SciTech Connect (OSTI)

    DeBlasio, R.; Forman, S.; Hogan, S.; Nuss, G.; Post, H.; Ross, R.; Schafft, H.

    1980-12-01

    This document is a response to the Photovoltaic Research, Development, and Demonstration Act of 1978 (P.L. 95-590) which required the generation of performance criteria for photovoltaic energy systems. Since the document is evolutionary and will be updated, the term interim is used. More than 50 experts in the photovoltaic field have contributed in the writing and review of the 179 performance criteria listed in this document. The performance criteria address characteristics of present-day photovoltaic systems that are of interest to manufacturers, government agencies, purchasers, and all others interested in various aspects of photovoltaic system performance and safety. The performance criteria apply to the system as a whole and to its possible subsystems: array, power conditioning, monitor and control, storage, cabling, and power distribution. They are further categorized according to the following performance attributes: electrical, thermal, mechanical/structural, safety, durability/reliability, installation/operation/maintenance, and building/site. Each criterion contains a statement of expected performance (nonprescriptive), a method of evaluation, and a commentary with further information or justification. Over 50 references for background information are also given. A glossary with definitions relevant to photovoltaic systems and a section on test methods are presented in the appendices. Twenty test methods are included to measure performance characteristics of the subsystem elements. These test methods and other parts of the document will be expanded or revised as future experience and needs dictate.

  20. cDNA encoding a polypeptide including a hevein sequence

    DOE Patents [OSTI]

    Raikhel, N.V.; Broekaert, W.F.; Chua, N.H.; Kush, A.

    1995-03-21

    A cDNA clone (HEV1) encoding hevein was isolated via polymerase chain reaction (PCR) using mixed oligonucleotides corresponding to two regions of hevein as primers and a Hevea brasiliensis latex cDNA library as a template. HEV1 is 1,018 nucleotides long and includes an open reading frame of 204 amino acids. The deduced amino acid sequence contains a putative signal sequence of 17 amino acid residues followed by a 187 amino acid polypeptide. The amino-terminal region (43 amino acids) is identical to hevein and shows homology to several chitin-binding proteins and to the amino-termini of wound-induced genes in potato and poplar. The carboxyl-terminal portion of the polypeptide (144 amino acids) is 74--79% homologous to the carboxyl-terminal region of wound-inducible genes of potato. Wounding, as well as application of the plant hormones abscisic acid and ethylene, resulted in accumulation of hevein transcripts in leaves, stems and latex, but not in roots, as shown by using the cDNA as a probe. A fusion protein was produced in E. coli from the protein of the present invention and maltose binding protein produced by the E. coli. 11 figures.

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

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

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

    2016-04-22

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

  2. Community Assessment Tool for Public Health Emergencies Including Pandemic Influenza

    SciTech Connect (OSTI)

    HCTT-CHE

    2011-04-14

    The Community Assessment Tool (CAT) for Public Health Emergencies Including Pandemic Influenza (hereafter referred to as the CAT) was developed as a result of feedback received from several communities. These communities participated in workshops focused on influenza pandemic planning and response. The 2008 through 2011 workshops were sponsored by the Centers for Disease Control and Prevention (CDC). Feedback during those workshops indicated the need for a tool that a community can use to assess its readiness for a disaster—readiness from a total healthcare perspective, not just hospitals, but the whole healthcare system. The CAT intends to do just that—help strengthen existing preparedness plans by allowing the healthcare system and other agencies to work together during an influenza pandemic. It helps reveal each core agency partners' (sectors) capabilities and resources, and highlights cases of the same vendors being used for resource supplies (e.g., personal protective equipment [PPE] and oxygen) by the partners (e.g., public health departments, clinics, or hospitals). The CAT also addresses gaps in the community's capabilities or potential shortages in resources. While the purpose of the CAT is to further prepare the community for an influenza pandemic, its framework is an extension of the traditional all-hazards approach to planning and preparedness. As such, the information gathered by the tool is useful in preparation for most widespread public health emergencies. This tool is primarily intended for use by those involved in healthcare emergency preparedness (e.g., community planners, community disaster preparedness coordinators, 9-1-1 directors, hospital emergency preparedness coordinators). It is divided into sections based on the core agency partners, which may be involved in the community's influenza pandemic influenza response.

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

    SciTech Connect (OSTI)

    Dechev, Damian

    2012-03-01

    Software applications need to change and adapt as modern architectures evolve. Nowadays advancement in chip design translates to increased parallelism. Exploiting such parallelism is a major challenge in modern software engineering. Multicore processors are about to introduce a significant change in the way we design and use fundamental data structures. In this work we describe the design and programming principles of a software library of highly concurrent scalable and nonblocking data containers. In this project we have created algorithms and data structures for handling fundamental computations in massively multithreaded contexts, and we have incorporated these into a usable library with familiar look and feel. In this work we demonstrate the first design and implementation of a wait-free hash table. Our multiprocessor data structure design allows a large number of threads to concurrently insert, remove, and retrieve information. Non-blocking designs alleviate the problems traditionally associated with the use of mutual exclusion, such as bottlenecks and thread-safety. Lock-freedom provides the ability to share data without some of the drawbacks associated with locks, however, these designs remain susceptible to starvation. Furthermore, wait-freedom provides all of the benefits of lock-free synchronization with the added assurance that every thread makes progress in a finite number of steps. This implies deadlock-freedom, livelock-freedom, starvation-freedom, freedom from priority inversion, and thread-safety. The challenges of providing the desirable progress and correctness guarantees of wait-free objects makes their design and implementation difficult. There are few wait-free data structures described in the literature. Using only standard atomic operations provided by the hardware, our design is portable; therefore, it is applicable to a variety of data-intensive applications including the domains of embedded systems and supercomputers.Our experimental

  4. Role Discovery in Graphs

    Energy Science and Technology Software Center (OSTI)

    2014-08-14

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

  5. Features | National Nuclear Security Administration | (NNSA)

    National Nuclear Security Administration (NNSA)

    and Public Affairs regularly updates the web site with current press releases, ... and Public Affairs regularly updates the web site with current press releases, ...

  6. ARM: Surface Radiation Measurement Quality Control testing, including climatologically configurable limits

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

    Shi, Yan; Riihimaki, Laura

    1994-01-07

    Surface Radiation Measurement Quality Control testing, including climatologically configurable limits

  7. Composite materials and bodies including silicon carbide and titanium diboride and methods of forming same

    DOE Patents [OSTI]

    Lillo, Thomas M.; Chu, Henry S.; Harrison, William M.; Bailey, Derek

    2013-01-22

    Methods of forming composite materials include coating particles of titanium dioxide with a substance including boron (e.g., boron carbide) and a substance including carbon, and reacting the titanium dioxide with the substance including boron and the substance including carbon to form titanium diboride. The methods may be used to form ceramic composite bodies and materials, such as, for example, a ceramic composite body or material including silicon carbide and titanium diboride. Such bodies and materials may be used as armor bodies and armor materials. Such methods may include forming a green body and sintering the green body to a desirable final density. Green bodies formed in accordance with such methods may include particles comprising titanium dioxide and a coating at least partially covering exterior surfaces thereof, the coating comprising a substance including boron (e.g., boron carbide) and a substance including carbon.

  8. 2010-02 "Reducing All Outfalls at LANL, Including Sandia Canyon...

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

    All Outfalls at LANL, Including Sandia Canyon, Relating to Studies and Clean-up of Chromium" 2010-02 "Reducing All Outfalls at LANL, Including Sandia Canyon, Relating to Studies ...

  9. SBIR/STTR FY15 Phase 2 Awards Announced-Includes Hydrogen Production...

    Office of Environmental Management (EM)

    Phase 2 Awards Announced-Includes Hydrogen Production and FCEV Systems SBIRSTTR FY15 Phase 2 Awards Announced-Includes Hydrogen Production and FCEV Systems March 23, 2015 - 3:37pm ...

  10. FY17 SBIR Phase I Release 1 FOA Released: Includes Fuel Cell...

    Energy Savers [EERE]

    FY17 SBIR Phase I Release 1 FOA Released: Includes Fuel Cell Catalysts and Hydrogen Delivery FY17 SBIR Phase I Release 1 FOA Released: Includes Fuel Cell Catalysts and Hydrogen ...