National Library of Energy BETA

Sample records for time-concentration graphs attachment

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

    Office of Legacy Management (LM)

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

  2. Graph Theory

    SciTech Connect (OSTI)

    Sanfilippo, Antonio P.

    2005-12-27

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

  3. Utilization Graphs

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

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

  4. Fenestration Attachments

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

    new windows for residential and commercial buildings. Attachments Energy Rating Council (AERC), National Fenestration Rating Council (NFRC), window coverings manufacturers, ...

  5. Window Attachments

    Energy Savers [EERE]

    ... shades Surface applied film Cellular shade Window quilt Seasonal film kit Louvered blinds Roller shades Solar screens Cellular shades Surface applied films Exterior attachments ...

  6. Attachment B

    Office of Environmental Management (EM)

    B HAZARDOUS WASTE PERMIT APPLICATION PART A Waste Isolation Pilot Plant Hazardous Waste Permit April 2014 (This page intentionally blank) Waste Isolation Pilot Plant Hazardous Waste Permit April 2014 PERMIT ATTACHMENT B Page B-i of 52 ATTACHMENT B HAZARDOUS WASTE PERMIT APPLICATION PART A TABLE OF CONTENTS PART A - HAZARDOUS WASTE PERMIT APPLICATION ......................................................... 1 RCRA PART A APPLICATION CERTIFICATION

  7. Attachment E

    Office of Environmental Management (EM)

    E INSPECTION SCHEDULE, PROCESS AND FORMS Waste Isolation Pilot Plant Hazardous Waste Permit April 2014 (This page intentionally blank) Waste Isolation Pilot Plant Hazardous Waste Permit April 2014 PERMIT ATTACHMENT E Page E-i ATTACHMENT E INSPECTION SCHEDULE, PROCESS AND FORMS TABLE OF CONTENTS Introduction ................................................................................................................................. 1 E-1 Inspection Schedule

  8. Attachment L

    Office of Environmental Management (EM)

    L WIPP GROUNDWATER DETECTION MONITORING PROGRAM PLAN Waste Isolation Pilot Plant Hazardous Waste Permit February 2014 (This page intentionally blank) Waste Isolation Pilot Plant Hazardous Waste Permit February 2014 PERMIT ATTACHMENT L Page L-i ATTACHMENT L WIPP GROUNDWATER DETECTION MONITORING PROGRAM PLAN TABLE OF CONTENTS L-1 Introduction ..................................................................................................................... 1 L-1a Geologic and Hydrologic

  9. Attachment N

    Office of Environmental Management (EM)

    N VOLATILE ORGANIC COMPOUND MONITORING PLAN Waste Isolation Pilot Plant Hazardous Waste Permit October 2013 (This page intentionally blank) Waste Isolation Pilot Plant Hazardous Waste Permit October 2013 PERMIT ATTACHMENT N Page N-i ATTACHMENT N VOLATILE ORGANIC COMPOUND MONITORING PLAN TABLE OF CONTENTS N-1 Introduction ..................................................................................................................... 1 N-1a Background

  10. Attachment O

    Office of Environmental Management (EM)

    O WIPP MINE VENTILATION RATE MONITORING PLAN Waste Isolation Pilot Plant Hazardous Waste Permit May 8, 2012 (This page intentionally blank) Waste Isolation Pilot Plant Hazardous Waste Permit May 8, 2012 PERMIT ATTACHMENT O Page O-1 of 14 1 ATTACHMENT O 2 WIPP MINE VENTILATION RATE MONITORING PLAN 3 TABLE OF CONTENTS 4 O-1 Definitions ....................................................................................................................... 2 5 O-2 Objective

  11. ATTACHMENT J

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

    Contract No. DE-AC02-07CH11358 Contract Modification No. 0145 Section J, Appendix A J-A-1 ATTACHMENT J.1 APPENDIX A ADVANCE UNDERSTANDINGS ON HUMAN RESOURCES Applicable to the...

  12. Attachment K

    Office of Environmental Management (EM)

    SOLID WASTE MANAGEMENT UNIT (SWMU) AND AREA OF CONCERN (AOC) TABLES Waste Isolation Pilot Plant Hazardous Waste Permit October 2013 (This page intentionally blank) Waste Isolation Pilot Plant Hazardous Waste Permit October 2013 PERMIT ATTACHMENT K Page K-i ATTACHMENT K SOLID WASTE MANAGEMENT UNIT (SWMU) AND AREA OF CONCERN (AOC) TABLES LIST OF TABLES Table Title Table K-1 Solid Waste Management Units (SWMUs) & Areas of Concern (AOCs) Requiring Corrective Action Table K-2 SWMUs & AOCs

  13. Attachment 4

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

    Reference Chart | Department of Energy 3: Instructions for Use of Green Lease Solicitation Paragraph Reference Chart Attachment 3: Instructions for Use of Green Lease Solicitation Paragraph Reference Chart (1.84 MB) More Documents & Publications Green Lease Policies and Procedures for Lease Acquisition Attachment 1: Green Lease Policies and Procedures for Lease Acquisition Microsoft Word - AL2008-05.doc

    1 of 6 High-Level Bases and Assumptions for the WTP Project Baseline 1. The

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

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

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

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

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

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

  20. Attachment C1

    Office of Environmental Management (EM)

    - Summary GHG Emissions Data FINAL Attachment C - Summary GHG Emissions Data FINAL Attachment C - Summary GHG Emissions Data FINAL (33.78 KB) More Documents & Publications Attachment C

    Summary GHG Emissions Data FINAL Attachment C Summary GHG Emissions Data FINAL Attachment-C-Summary-GHG-Emissions-Data-FINAL.xlsx (34.24 KB) More Documents & Publications Attachment C -

    C1 WASTE CHARACTERIZATION TESTING METHODS Waste Isolation Pilot Plant Hazardous Waste Permit March 13, 2013

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

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

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

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

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

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

  7. Attachment N1

    Office of Environmental Management (EM)

    N1 HYDROGEN AND METHANE MONITORING PLAN Waste Isolation Pilot Plant Hazardous Waste Permit ... ATTACHMENT N1 Page N1-i ATTACHMENT N1 HYDROGEN AND METHANE MONITORING PLAN TABLE OF ...

  8. Belt attachment and system

    DOE Patents [OSTI]

    Schneider, Abraham D.; Davidson, Erick M.

    2016-02-02

    Disclosed herein is a belt assembly including a flexible belt with an improved belt attachment. The belt attachment includes two crossbars spaced along the length of the belt. The crossbars retain bearings that allow predetermined movement in six degrees of freedom. The crossbars are connected by a rigid body that attaches to the bearings. Implements that are attached to the rigid body are simply supported but restrained in pitching rotation.

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

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

  11. Blade attachment assembly

    DOE Patents [OSTI]

    Garcia-Crespo, Andres Jose; Delvaux, John McConnell; Miller, Diane Patricia

    2016-05-03

    An assembly and method for affixing a turbomachine rotor blade to a rotor wheel are disclosed. In an embodiment, an adaptor member is provided disposed between the blade and the rotor wheel, the adaptor member including an adaptor attachment slot that is complementary to the blade attachment member, and an adaptor attachment member that is complementary to the rotor wheel attachment slot. A coverplate is provided, having a coverplate attachment member that is complementary to the rotor wheel attachment slot, and a hook for engaging the adaptor member. When assembled, the coverplate member matingly engages with the adaptor member, and retains the blade in the adaptor member, and the assembly in the rotor wheel.

  12. High Performance Window Attachments

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

    Statement: * A wide range of residential window attachments are available, but they ... to model wide range of window coverings * Performed window coverings ...

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

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

  15. Attachment C4

    Office of Environmental Management (EM)

    C4 TRU MIXED WASTE CHARACTERIZATION USING ACCEPTABLE KNOWLEDGE Waste Isolation Pilot Plant Hazardous Waste Permit March 13, 2013 (This page intentionally blank) Waste Isolation Pilot Plant Hazardous Waste Permit March 13, 2013 PERMIT ATTACHMENT C4 Page C4-i ATTACHMENT C4 TRU MIXED WASTE CHARACTERIZATION USING ACCEPTABLE KNOWLEDGE TABLE OF CONTENTS C4-1 Introduction ..................................................................................................................... 1 C4-2

  16. Attachment C6

    Office of Environmental Management (EM)

    C6 AUDIT AND SURVEILLANCE PROGRAM Waste Isolation Pilot Plant Hazardous Waste Permit February 2014 (This page intentionally blank) Waste Isolation Pilot Plant Hazardous Waste Permit February 2014 PERMIT ATTACHMENT C6 Page C6-i ATTACHMENT C6 AUDIT AND SURVEILLANCE PROGRAM TABLE OF CONTENTS C6-1 Introduction ..................................................................................................................... 1 C6-2 Audit Procedures

  17. Attachment G3

    Office of Environmental Management (EM)

    G3 RADIOLOGICAL SURVEYS TO INDICATE POTENTIAL HAZARDOUS WASTE RELEASES Waste Isolation Pilot Plant Hazardous Waste Permit October 2013 (This page intentionally blank) Waste Isolation Pilot Plant Hazardous Waste Permit October 2013 PERMIT ATTACHMENT G3 Page G3-i ATTACHMENT G3 RADIOLOGICAL SURVEYS TO INDICATE POTENTIAL HAZARDOUS WASTE RELEASES TABLE OF CONTENTS G3-1 Purpose ........................................................................................................................... 1

  18. Attachment H1

    Office of Environmental Management (EM)

    H1 ACTIVE INSTITUTIONAL CONTROLS DURING POST-CLOSURE Waste Isolation Pilot Plant Hazardous Waste Permit November 1, 2012 (This page intentionally blank) Waste Isolation Pilot Plant Hazardous Waste Permit November 1, 2012 PERMIT ATTACHMENT H1 Page H1-i ATTACHMENT H1 ACTIVE INSTITUTIONAL CONTROLS DURING POST-CLOSURE TABLE OF CONTENTS Introduction ................................................................................................................................. 1 H1.1 Active

  19. Attachment C3

    Office of Environmental Management (EM)

    C3 QUALITY ASSURANCE OBJECTIVES AND DATA VALIDATION TECHNIQUES FOR WASTE CHARACTERIZATION METHODS Waste Isolation Pilot Plant Hazardous Waste Permit February 2014 (This page intentionally blank) Waste Isolation Pilot Plant Hazardous Waste Permit February 2014 PERMIT ATTACHMENT C3 Page C3-i ATTACHMENT C3 QUALITY ASSURANCE OBJECTIVES AND DATA VALIDATION TECHNIQUES FOR WASTE CHARACTERIZATION METHODS TABLE OF CONTENTS C3-1 Validation Methods

  20. Attachment C5

    Office of Environmental Management (EM)

    C5 QUALITY ASSURANCE PROJECT PLAN REQUIREMENTS Waste Isolation Pilot Plant Hazardous Waste Permit March 13, 2013 (This page intentionally blank) Waste Isolation Pilot Plant Hazardous Waste Permit March 13, 2013 PERMIT ATTACHMENT C5 Page C5-i ATTACHMENT C5 QUALITY ASSURANCE PROJECT PLAN REQUIREMENTS TABLE OF CONTENTS C5-1 Quality Assurance Project Plans ...................................................................................... 1 C5-2 Document Review, Approval, and Control

  1. Attachment F2

    Office of Environmental Management (EM)

    F2 TRAINING COURSE AND QUALIFICATION CARD OUTLINES Waste Isolation Pilot Plant Hazardous Waste Permit October 2013 (This page intentionally blank) Waste Isolation Pilot Plant Hazardous Waste Permit October 2013 PERMIT ATTACHMENT F2 Page F2-i ATTACHMENT F2 TRAINING COURSE AND QUALIFICATION CARD OUTLINES TABLE OF CONTENTS Course Outlines .......................................................................................................................... 1 GET-19X/GET-20X/GET-21X - General

  2. Attachment G2

    Office of Environmental Management (EM)

    G2 WASTE ISOLATION PILOT PLANT SHAFT SEALING SYSTEM COMPLIANCE SUBMITTAL DESIGN REPORT Waste Isolation Pilot Plant Hazardous Waste Permit October 2013 (This page intentionally blank) Waste Isolation Pilot Plant Hazardous Waste Permit October 2013 PERMIT ATTACHMENT G2 Page G2-i ATTACHMENT G2 WASTE ISOLATION PILOT PLANT SHAFT SEALING SYSTEM COMPLIANCE SUBMITTAL DESIGN REPORT ADAPTED FROM: SAND96-1326/1 DISTRIBUTION UNLIMITED RELEASE CATEGORY UC-721 PRINTED AUGUST 1996 WASTE ISOLATION PILOT PLANT

  3. Attachment N1

    Office of Environmental Management (EM)

    N1 HYDROGEN AND METHANE MONITORING PLAN Waste Isolation Pilot Plant Hazardous Waste Permit January 31, 2012 (This page intentionally blank) Waste Isolation Pilot Plant Hazardous Waste Permit January 31, 2012 PERMIT ATTACHMENT N1 Page N1-i ATTACHMENT N1 HYDROGEN AND METHANE MONITORING PLAN TABLE OF CONTENTS N1-1 Introduction ..................................................................................................................... 1 N1-2 Parameters to be Analyzed and Monitoring Design

  4. Attachment 3 of 5

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

    Department of Energy 1: Green Lease Policies and Procedures for Lease Acquisition Attachment 1: Green Lease Policies and Procedures for Lease Acquisition Green Lease Policies and Procedures for Lease Acquisition (45.31 KB) More Documents & Publications Green Lease Policies and Procedures for Lease Acquisition Attachment 2: Solicitation for Offers with New and Revised Green Lease Text Energy Efficiency in Separate Tenant Spaces - A Feasibility Study | Department of Energy

    2:

  5. Micromechanical die attachment surcharge

    DOE Patents [OSTI]

    Filter, William F.; Hohimer, John P.

    2002-01-01

    An attachment structure is disclosed for attaching a die to a supporting substrate without the use of adhesives or solder. The attachment structure, which can be formed by micromachining, functions purely mechanically in utilizing a plurality of shaped pillars (e.g. round, square or polygonal and solid, hollow or slotted) that are formed on one of the die or supporting substrate and which can be urged into contact with various types of mating structures including other pillars, a deformable layer or a plurality of receptacles that are formed on the other of the die or supporting substrate, thereby forming a friction bond that holds the die to the supporting substrate. The attachment structure can further include an alignment structure for precise positioning of the die and supporting substrate to facilitate mounting the die to the supporting substrate. The attachment structure has applications for mounting semiconductor die containing a microelectromechanical (MEM) device, a microsensor or an integrated circuit (IC), and can be used to form a multichip module. The attachment structure is particularly useful for mounting die containing released MEM devices since these devices are fragile and can otherwise be damaged or degraded by adhesive or solder mounting.

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

  7. Energy Savings from Window Attachments

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

    ... of window combinations with window attachments in typical residential buildings and in varied ... The most common and widely used types of attachments are window coverings ...

  8. Ceramic blade attachment system

    DOE Patents [OSTI]

    Boyd, Gary L. (Alpine, CA)

    1994-01-01

    A turbine blade having a preestablished rate of thermal expansion is attached to a turbine wheel having a preestablished rate of thermal expansion being greater than the preestablished rate of thermal expansion of the turbine blade. The turbine blade has a root portion having a pair of recessed portions thereon. The turbine wheel includes a plurality of openings in which the turbine blade is positioned. Each of the openings have a pair of grooves therein in which are positioned a pair of pins having a generally rectangular cross-section and a reaction surface thereon. A pair of cylindrical rollers interposed respective ones of the pair of reaction surfaces and the pair of recessed portions. The attachment system or turbine assembly provides an economical, reliable and effective attachment of a component having a preestablished rate of thermal expansion to a component having a greater preestablished rate of thermal expansion.

  9. Ceramic blade attachment system

    DOE Patents [OSTI]

    Boyd, G.L.

    1994-12-13

    A turbine blade having a preestablished rate of thermal expansion is attached to a turbine wheel having a preestablished rate of thermal expansion being greater than the preestablished rate of thermal expansion of the turbine blade. The turbine blade has a root portion having a pair of recessed portions thereon. The turbine wheel includes a plurality of openings in which the turbine blade is positioned. Each of the openings have a pair of grooves therein in which are positioned a pair of pins having a generally rectangular cross-section and a reaction surface thereon. A pair of cylindrical rollers interposed respective ones of the pair of reaction surfaces and the pair of recessed portions. The attachment system or turbine assembly provides an economical, reliable and effective attachment of a component having a preestablished rate of thermal expansion to a component having a greater preestablished rate of thermal expansion. 3 figures.

  10. Magnetically attached sputter targets

    DOE Patents [OSTI]

    Makowiecki, D.M.; McKernan, M.A.

    1994-02-15

    An improved method and assembly for attaching sputtering targets to cathode assemblies of sputtering systems which includes a magnetically permeable material is described. The magnetically permeable material is imbedded in a target base that is brazed, welded, or soldered to the sputter target, or is mechanically retained in the target material. Target attachment to the cathode is achieved by virtue of the permanent magnets and/or the pole pieces in the cathode assembly that create magnetic flux lines adjacent to the backing plate, which strongly attract the magnetically permeable material in the target assembly. 11 figures.

  11. Ladder attachment platform

    DOE Patents [OSTI]

    Swygert,; Richard, W [Springfield, SC

    2012-08-28

    A ladder attachment platform is provided that includes a base for attachment to a ladder that has first and second side rails and a plurality of rungs that extend between in a lateral direction. Also included is a user platform for having a user stand thereon that is carried by the base. The user platform may be positioned with respect to the ladder so that it is not located between a first plane that extends through the first side rail and is perpendicular to the lateral direction and a second plane that extends through the second side rail and is perpendicular to the lateral direction.

  12. Internal pipe attachment mechanism

    DOE Patents [OSTI]

    Bast, R.M.; Chesnut, D.A.; Henning, C.D.; Lennon, J.P.; Pastrnak, J.W.; Smith, J.A.

    1994-12-13

    An attachment mechanism is described for repairing or extending fluid carrying pipes, casings, conduits, etc. utilizing one-way motion of spring tempered fingers to provide a mechanical connection between the attachment mechanism and the pipe. The spring tempered fingers flex to permit insertion into a pipe to a desired insertion depth. The mechanical connection is accomplished by reversing the insertion motion and the mechanical leverage in the fingers forces them outwardly against the inner wall of the pipe. A seal is generated by crushing a sealing assembly by the action of setting the mechanical connection. 6 figures.

  13. Internal pipe attachment mechanism

    DOE Patents [OSTI]

    Bast, Richard M.; Chesnut, Dwayne A.; Henning, Carl D.; Lennon, Joseph P.; Pastrnak, John W.; Smith, Joseph A.

    1994-01-01

    An attachment mechanism for repairing or extending fluid carrying pipes, casings, conduits, etc. utilizing one-way motion of spring tempered fingers to provide a mechanical connection between the attachment mechanism and the pipe. The spring tempered fingers flex to permit insertion into a pipe to a desired insertion depth. The mechanical connection is accomplished by reversing the insertion motion and the mechanical leverage in the fingers forces them outwardly against the inner wall of the pipe. A seal is generated by crushing a sealing assembly by the action of setting the mechanical connection.

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

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

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

  17. Turbine nozzle attachment system

    DOE Patents [OSTI]

    Norton, P.F.; Shaffer, J.E.

    1995-10-24

    A nozzle guide vane assembly having a preestablished rate of thermal expansion is positioned in a gas turbine engine and is attached to conventional metallic components. The nozzle guide vane assembly includes a pair of legs extending radially outwardly from an outer shroud and a pair of mounting legs extending radially inwardly from an inner shroud. Each of the pair of legs and mounting legs have a pair of holes therein. A plurality of members attached to the gas turbine engine have a plurality of bores therein which axially align with corresponding ones of the pair of holes in the legs. A plurality of pins are positioned within the corresponding holes and bores radially positioning the nozzle guide vane assembly about a central axis of the gas turbine engine. 3 figs.

  18. Turbine nozzle attachment system

    DOE Patents [OSTI]

    Norton, Paul F.; Shaffer, James E.

    1995-01-01

    A nozzle guide vane assembly having a preestablished rate of thermal expansion is positioned in a gas turbine engine and being attached to conventional metallic components. The nozzle guide vane assembly includes a pair of legs extending radially outwardly from an outer shroud and a pair of mounting legs extending radially inwardly from an inner shroud. Each of the pair of legs and mounting legs have a pair of holes therein. A plurality of members attached to the gas turbine engine have a plurality of bores therein which axially align with corresponding ones of the pair of holes in the legs. A plurality of pins are positioned within the corresponding holes and bores radially positioning the nozzle guide vane assembly about a central axis of the gas turbine engine.

  19. Ceramic blade attachment system

    DOE Patents [OSTI]

    Frey, deceased, Gary A. (late of Poway, CA); Jimenez, Oscar D. (Escondia, CA)

    1996-01-01

    A turbine blade having a preestablished rate of thermal expansion is attached to a turbine flange having a preestablished rate of thermal expansion being greater than the preestablished rate of thermal expansion of the turbine blade. The turbine flange includes a first upstanding flange and a second upstanding flange having a groove formed therebetween. The turbine flange further includes a recess. Each of the first and second upstanding flanges have a plurality of bores therein. A turbine blade has a first member and a second member positioned in one of the groove and the recess. Each of the first member and the second member have a plurality of bores therein. And, a pin is positioned in respective ones of the plurality of bores in the first and second upstanding members and the first and second members and attach the blade to the turbine flange. The pin has a preestablished rate of thermal expansion being substantially equal to the rate of thermal expansion of the blade.

  20. Ceramic blade attachment system

    DOE Patents [OSTI]

    Frey, G.A.; Jimenez, O.D.

    1996-12-03

    A turbine blade having a preestablished rate of thermal expansion is attached to a turbine flange having a preestablished rate of thermal expansion being greater than the preestablished rate of thermal expansion of the turbine blade. The turbine flange includes a first upstanding flange and a second upstanding flange having a groove formed between them. The turbine flange further includes a recess. Each of the first and second upstanding flanges have a plurality of bores therein. A turbine blade has a first member and a second member positioned in one of the groove and the recess. Each of the first member and the second member have a plurality of bores therein. A pin is positioned in respective ones of the plurality of bores in the first and second upstanding members and the first and second members and attach the blade to the turbine flange. The pin has a preestablished rate of thermal expansion being substantially equal to the rate of thermal expansion of the blade. 4 figs.

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

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

  3. API Requirements for Dynamic Graph Prediction

    SciTech Connect (OSTI)

    Gallagher, B; Eliassi-Rad, T

    2006-10-13

    Given a large-scale time-evolving multi-modal and multi-relational complex network (a.k.a., a large-scale dynamic semantic graph), we want to implement algorithms that discover patterns of activities on the graph and learn predictive models of those discovered patterns. This document outlines the application programming interface (API) requirements for fast prototyping of feature extraction, learning, and prediction algorithms on large dynamic semantic graphs. Since our algorithms must operate on large-scale dynamic semantic graphs, we have chosen to use the graph API developed in the CASC Complex Networks Project. This API is supported on the back end by a semantic graph database (developed by Scott Kohn and his team). The advantages of using this API are (i) we have full-control of its development and (ii) the current API meets almost all of the requirements outlined in this document.

  4. Appendix TFIELD Attachment A: Attachment A: TFIELD-2014 Visualization

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

    Attachment A: TFIELD-2014 Visualization United States Department of Energy Waste Isolation Pilot Plant Carlsbad Field Office Carlsbad, New Mexico Compliance Recertification Application 2014 Attachment A: TFIELD-2014 Visualization This attachment contains figures for Appendix TFIELD-2014, related to the Culebra T-Field calibration process, performed as part of the 2009 Compliance Recertification Application (CRA-2009) Performance Assessment Baseline Calculation (PABC). These parameter inputs and

  5. Ceramic blade attachment system

    DOE Patents [OSTI]

    Shaffer, James E. (Maitland, FL)

    1995-01-01

    A turbine blade having a preestablished rate of thermal expansion is attached to a turbine wheel having a preestablished rate of thermal expansion being greater than the preestablished rate of thermal expansion of the turbine blade. The turbine blade has a root portion having a first groove and a second groove therein. The turbine wheel includes a plurality of openings in which the turbine blade is positioned. Each of the openings has a first groove and a second groove therein. The space or void formed between the first grooves and the second grooves has a plurality of spherical balls positioned therein. The plurality of spherical balls has a preestablished rate of thermal expansion being equal to the preestablished rate of thermal expansion of the turbine blade.

  6. Ceramic blade attachment system

    DOE Patents [OSTI]

    Shaffer, James E. (Maitland, FL)

    1995-01-01

    A turbine blade having a preestablished rate of thermal expansion is attached to a turbine disc having a preestablished rate of thermal expansion being greater than the preestablished rate of thermal expansion of the turbine blade and forms a turbine assembly. The turbine blade has a root portion defining a pair of sides having a pair of grooves therein. The turbine assembly includes a pair of flanges between which the turbine blades are positioned. Each of the pair of flanges has a plurality of grooves defined therein. The grooves within the pair of flanges are aligned with the grooves in the blades and have a space formed therebetween. A plurality of spherical balls are positioned within the space. The plurality of spherical balls has a preestablished rate of thermal expansion being equal to the preestablished rate of thermal expansion of the turbine blade.

  7. Ceramic blade attachment system

    DOE Patents [OSTI]

    Shaffer, J.E.

    1995-01-10

    A turbine blade having a preestablished rate of thermal expansion is attached to a turbine wheel having a preestablished rate of thermal expansion being greater than the preestablished rate of thermal expansion of the turbine blade. The turbine blade has a root portion having a first groove and a second groove therein. The turbine wheel includes a plurality of openings in which the turbine blade is positioned. Each of the openings has a first groove and a second groove therein. The space or void formed between the first grooves and the second grooves has a plurality of spherical balls positioned therein. The plurality of spherical balls has a preestablished rate of thermal expansion being equal to the preestablished rate of thermal expansion of the turbine blade. 4 figures.

  8. Ceramic blade attachment system

    DOE Patents [OSTI]

    Shaffer, J.E.

    1995-07-11

    A turbine blade having a preestablished rate of thermal expansion is attached to a turbine disc having a preestablished rate of thermal expansion being greater than the preestablished rate of thermal expansion of the turbine blade and forms a turbine assembly. The turbine blade has a root portion defining a pair of sides having a pair of grooves therein. The turbine assembly includes a pair of flanges between which the turbine blades are positioned. Each of the pair of flanges has a plurality of grooves defined therein. The grooves within the pair of flanges are aligned with the grooves in the blades and have a space formed therebetween. A plurality of spherical balls are positioned within the space. The plurality of spherical balls has a preestablished rate of thermal expansion being equal to the preestablished rate of thermal expansion of the turbine blade. 4 figs.

  9. Graph algorithms in the titan toolkit.

    SciTech Connect (OSTI)

    McLendon, William Clarence, III; Wylie, Brian Neil

    2009-10-01

    Graph algorithms are a key component in a wide variety of intelligence analysis activities. The Graph-Based Informatics for Non-Proliferation and Counter-Terrorism project addresses the critical need of making these graph algorithms accessible to Sandia analysts in a manner that is both intuitive and effective. Specifically we describe the design and implementation of an open source toolkit for doing graph analysis, informatics, and visualization that provides Sandia with novel analysis capability for non-proliferation and counter-terrorism.

  10. Attachment 6 - Government Property List

    National Nuclear Security Administration (NNSA)

    2 EQUIPMENT - HANDHELD COMPUTER - WIRELESS WHEEL LOAD SYSTEM 1 EQUIPMENT - HEAT STRESS MONITOR 5 EQUIPMENT - HOIST - PORTABLE 1 November 20, 2013 DE-SOL-0005982 Attachment 6...

  11. Attachment A -- Deliverables.xls

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

    4: Unrevised SFO Paragraphs Reissued Attachment 4: Unrevised SFO Paragraphs Reissued Unrevised SFO Paragraphs Reissued (35.68 KB) More Documents & Publications Attachment 2: Solicitation for Offers with New and Revised Green Lease Text Attachment 1: Green Lease Policies and Procedures for Lease Acquisition 1

    B - J Deliverables Attachment A TOC Deliverables DE-AC27-08RV14800 SEC. Contract Section Description Action Timing TFP CO ESQ OPA IR/HR ORP MGR DCAA B B.2 Modify contract to obligate

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

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

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

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

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

  17. RFP Section L Attachment Templates

    Broader source: Energy.gov [DOE]

    On March 29,2010, six draft RFP Section L Attachment templates (Past Performance Information Questionnaire, Past Performance Questionnaire Cover Letter, Letter of Commitment, Past Performance Reference Information Form, ESH&Q Past Performance Information Form, and Resume Format) were distributed for Procurement Director (PD) and Head of Contracting Activity (HCA) review and comment. All comments received were considered and changes were made as appropriate. The final versions of the six aforementioned RFP Section L Attachment templates will be e-mailed directly to the Procurement Directors and made available in the STRIPES Library. For RFP's generated in STRIPES, the Section L Attachments should be identified in clause DOE-L-1033 and the file with each Attachment should be attached to the RFP.

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

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

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

  1. Attachment C: Optional AIP Provisions

    Broader source: Energy.gov [DOE]

    This attachment contains sample language for a number of optional provisions that sites may choose to include or not to include in their AIPs. Optional AIP provisions are not mandatory and the...

  2. Attachment 1 - Performance Work Statement

    National Nuclear Security Administration (NNSA)

    including TTR. Waste acceptance services will be performed at the NNSS and at waste generator sites. DE-SOL-0005982 Attachment 1 Page 1 2. Scope of Work 2.1 Requirement: The EPS...

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

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

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

    Pages. Under Estimated Total Size, you will see the original file size and the 3. Click OK to accept the file size compression. compressed file size. U.S. Department of Energy,...

  13. ATTACHMENT

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

    ... to be Public 7 PII and includes, for example, first and last name, address, work telephone number, e-mail address, home telephone number, and general educational credentials. ...

  14. ATTACHMENT F PAST PERFORMANCE QUESTIONNAIRE

    National Nuclear Security Administration (NNSA)

    SOURCE SELECTION INFORMATION - SEE FAR 3.104 (When Filled-In) 1 ATTACHMENT F PAST PERFORMANCE QUESTIONNAIRE Offerors are responsible for sending copies of the PAST PERFORMANCE QUESTIONNAIRE (SECTIONs A thru C) to references. Instructions to Offeror 1. For each reference submitted in your proposal, enter the required information in Section A. 2. Transmit the entire questionnaire to the identified Points of Contract (POCs) and place one copy of each Section A in your proposal submittal. NOTES:

  15. Attachment L-1 - Entity Certificates

    National Nuclear Security Administration (NNSA)

    3] Attachment L-1 1 ENTITY CERTIFICATE The offeror shall submit evidence to substantiate the authority of the person signing the offer and submit in Volume I of the proposal. CERTIFICATE I, _______________________________________________, certify that I have the signatory authority as the _________________________________________ to sign this offer/contract on behalf of said entity and to bind the entity by the authority of its governing body and within the scope of its powers. Affix the

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

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

  18. Microsoft Word - Attachment I.doc

    Office of Environmental Management (EM)

    SCHEDULE RESERVED Waste Isolation Pilot Plant Hazardous Waste Permit November 30, 2010 (This page intentionally blank) Waste Isolation Pilot Plant Hazardous Waste Permit November 30, 2010 PERMIT ATTACHMENT I Page I-i ATTACHMENT I COMPLIANCE SCHEDULE RESERVED

  19. Microsoft Word - Attachment M.doc

    Office of Environmental Management (EM)

    M FIGURES RESERVED Waste Isolation Pilot Plant Hazardous Waste Permit November 30, 2010 (This page intentionally blank) Waste Isolation Pilot Plant Hazardous Waste Permit November 30, 2010 PERMIT ATTACHMENT M Page M-i ATTACHMENT M FIGURES RESERVED

  20. Attachment D: Mandatory Provisions if Applicable

    Broader source: Energy.gov [DOE]

    This attachment contains provisions that may be mandatory for an AIP if the State: (1) chooses to develop an emergency response program but does not want to use the suggested language in Attachment...

  1. Microsoft Word - Attachment J.doc

    Office of Environmental Management (EM)

    Waste Isolation Pilot Plant Hazardous Waste Permit April 15, 2011 PERMIT ATTACHMENT J Page J-i ATTACHMENT J HAZARDOUS WASTE MANAGEMENT UNIT TABLES LIST OF TABLES Table Title...

  2. Attachment C … Waste Analysis Plan

    Office of Environmental Management (EM)

    Configurations | Department of Energy Attachment A: Modeling in Support of Additional Two-Unit Operating Configurations Attachment A: Modeling in Support of Additional Two-Unit Operating Configurations Docket No. EO-05-01: Attachment to the Operating Plan of Mirant Potomac River, LLC Attachment A: Modeling in Support of Additional Two-Unit Operating Configurations (28.18 KB) More Documents & Publications Mirant Potomac, Alexandria, Virginia: Maximum Impacts Predicted by AERMOD-PRIME

  3. Attachments Energy Ratings Council | Department of Energy

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

    Attachments Energy Ratings Council Attachments Energy Ratings Council Attachments Energy Ratings Council Lead Performer: Window Covering Manufacturing Association - New York, NY DOE Funding: $1,600,000 Project Term: October 1, 2014 - September 30, 2018 Funding Opportunity Announcement: Certification and Rating Attachments for Fenestration Technologies DE-FOA-001000-1504 Project Objective This project is to develop an independent rating, certification, labeling, and performance verification

  4. Shading, Films and Window Attachments Market Report

    Broader source: Energy.gov [DOE]

    Shading, Films and Window Attachments (SFWA) Market Report, March 13, 2016, from the Consortium for Building Energy Innovation.

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

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

    Energy Science and Technology Software Center (OSTI)

    2009-11-18

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

  7. Split ring containment attachment device

    DOE Patents [OSTI]

    Sammel, Alfred G.

    1996-01-01

    A containment attachment device 10 for operatively connecting a glovebag 200 to plastic sheeting 100 covering hazardous material. The device 10 includes an inner split ring member 20 connected on one end 22 to a middle ring member 30 wherein the free end 21 of the split ring member 20 is inserted through a slit 101 in the plastic sheeting 100 to captively engage a generally circular portion of the plastic sheeting 100. A collar potion 41 having an outer ring portion 42 is provided with fastening means 51 for securing the device 10 together wherein the glovebag 200 is operatively connected to the collar portion 41.

  8. DNA attachment to support structures

    DOE Patents [OSTI]

    Balhorn, Rodney L.; Barry, Christopher H.

    2002-01-01

    Microscopic beads or other structures are attached to nucleic acids (DNA) using a terminal transferase. The transferase adds labeled dideoxy nucleotide bases to the ends of linear strands of DNA. The labels, such as the antigens digoxigenin and biotin, bind to the antibody compounds or other appropriate complementary ligands, which are bound to the microscopic beads or other support structures. The method does not require the synthesis of a synthetic oligonucleotide probe. The method can be used to tag or label DNA even when the DNA has an unknown sequence, has blunt ends, or is a very large fragment (e.g., >500 kilobase pairs).

  9. ATTACHMENT J.7 - APPENDIX G

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

    Modification No. 0199 Contract No. DE-AC02-09CH11466 Section J - Appendix G J-G-1 ATTACHMENT J.7 APPENDIX G PURCHASING SYSTEM REQUIREMENTS Applicable to the Operation of PPPL Contract No. DE-AC02-09CH11466 Modification No. 0199 Contract No. DE-AC02-09CH11466 Section J - Appendix G J-G-2 Appendix G Purchasing System Requirements This Appendix and Clause I.146 "Contractor Purchasing System," sets forth DOE requirements applicable to the Purchasing System established under the Contract

  10. Attachment A -- Deliverables.xls

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

    I Deliverables Attachment A TOC Deliverables DE-AC27-08RV14800 SEC. FAR/DEAR Clause Reference Description Action Timing TFP CO ESQ OPA IR/HR ORP MGR DCAA I.2 FAR 52.202-1 Definitions (JUL 2004) as supplemented by DEAR 952.202-1 (Mar 2002) Verify compliance As Required L I.3 FAR 52.203-3 Gratuities (APR 1984) Verify compliance As Required L I.4 FAR 52.203-5 Covenant Against Contingent Fees (APR 1984) Verify compliance As Required L I.5 FAR 52.203-6 Restrictions on Subcontractor Sales to the

  11. Knowledge Representation Issues in Semantic Graphs for Relationship Detection

    SciTech Connect (OSTI)

    Barthelemy, M; Chow, E; Eliassi-Rad, T

    2005-02-02

    An important task for Homeland Security is the prediction of threat vulnerabilities, such as through the detection of relationships between seemingly disjoint entities. A structure used for this task is a ''semantic graph'', also known as a ''relational data graph'' or an ''attributed relational graph''. These graphs encode relationships as typed links between a pair of typed nodes. Indeed, semantic graphs are very similar to semantic networks used in AI. The node and link types are related through an ontology graph (also known as a schema). Furthermore, each node has a set of attributes associated with it (e.g., ''age'' may be an attribute of a node of type ''person''). Unfortunately, the selection of types and attributes for both nodes and links depends on human expertise and is somewhat subjective and even arbitrary. This subjectiveness introduces biases into any algorithm that operates on semantic graphs. Here, we raise some knowledge representation issues for semantic graphs and provide some possible solutions using recently developed ideas in the field of complex networks. In particular, we use the concept of transitivity to evaluate the relevance of individual links in the semantic graph for detecting relationships. We also propose new statistical measures for semantic graphs and illustrate these semantic measures on graphs constructed from movies and terrorism data.

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

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

  14. Part VII: Section J - List of Documents, Exhibits, and Other Attachments, Attachment O

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

    O DE-AC36-08GO28308 Modification M1033 Attachment O

  15. Methane production by attached film

    DOE Patents [OSTI]

    Jewell, William J.

    1981-01-01

    A method for purifying wastewater of biodegradable organics by converting the organics to methane and carbon dioxide gases is disclosed, characterized by the use of an anaerobic attached film expanded bed reactor for the reaction process. Dilute organic waste material is initially seeded with a heterogeneous anaerobic bacteria population including a methane-producing bacteria. The seeded organic waste material is introduced into the bottom of the expanded bed reactor which includes a particulate support media coated with a polysaccharide film. A low-velocity upward flow of the organic waste material is established through the bed during which the attached bacterial film reacts with the organic material to produce methane and carbon dioxide gases, purified water, and a small amount of residual effluent material. The residual effluent material is filtered by the film as it flows upwardly through the reactor bed. In a preferred embodiment, partially treated effluent material is recycled from the top of the bed to the bottom of the bed for further treatment. The methane and carbon dioxide gases are then separated from the residual effluent material and purified water.

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

  17. Microsoft Word - Policy Flash 2010-77 Attachment | Department...

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

    7 Attachment Microsoft Word - Policy Flash 2010-77 Attachment Microsoft Word - Policy Flash 2010-77 Attachment More Documents & Publications Microsoft Word - Policy Flash 2010-78...

  18. Microsoft Word - Attachment 3 Recovery Act notification | Department...

    Energy Savers [EERE]

    Microsoft Word - Attachment 3 Recovery Act notification Microsoft Word - Attachment 3 Recovery Act notification More Documents & Publications Microsoft Word - Attachment 3 Recovery...

  19. Microsoft Word - Policy Flash 2010-81 Attachment 1 | Department...

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

    1 Attachment 1 Microsoft Word - Policy Flash 2010-81 Attachment 1 Microsoft Word - Policy Flash 2010-81 Attachment 1 More Documents & Publications Microsoft Word - Policy Flash...

  20. Attached is Policy Flash 2013-44 Acquisition Guide- Allowability...

    Energy Savers [EERE]

    Attached is Policy Flash 2013-44 Acquisition Guide- Allowability of Incurred Costs Attached is Policy Flash 2013-44 Acquisition Guide- Allowability of Incurred Costs Attached is...

  1. Attachment FY2011-75 OPAM | Department of Energy

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

    OPAM Attachment FY2011-75 OPAM Federal Supply Schedules Attachment FY2011-75 OPAM More Documents & Publications Chapter 8 - Required Sources of Supplies and Services Attachment...

  2. ATTACHMENT J.3 - APPENDIX C

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

    99 Contract No.: DE-AC02-09CH11466 Section J - Appendix C J-C-1 ATTACHMENT J.3 APPENDIX C SPECIAL FINANCIAL INSTITUTION ACCOUNT AGREEMENT Applicable to the Operation of PPPL Contract No. DE-AC02-09CH11466 Modification No. 0199 Contract No.: DE-AC02-09CH11466 Section J - Appendix C J-C-2 Modification N o: 0 199 Contract N o: D E---AC02---09CH11466 Section J --- A ppendix C Information c ontained i n t his d ocument i s r estricted. C ontact P PPL v ia e mail--- j delooper@pppl.gov t o r equest a

  3. AttachmentFlash_2010-55.pdf | Department of Energy

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

    AttachmentFlash2010-55.pdf More Documents & Publications AttachmentFlash2010-66.pdf AttachmentFlash2010-73(3).pdf AttachmentFlash2010-33(2).pdf...

  4. al99-06attachment.doc | Department of Energy

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

    attachment.doc&0; al99-06attachment.doc&0; PDF icon al99-06attachment.doc&0; More Documents & Publications Microsoft Word - AL2000-05Attachment.doc Microsoft Word - NSRC...

  5. Microsoft Word - Attachment J-4 Legal Management Plan.doc

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

    4-1 ATTACHMENT J.4. LEGAL MANAGEMENT

  6. Building America Expert Meeting: Cladding Attachment Over Exterior...

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

    Building America Expert Meeting: Cladding Attachment Over Exterior Insulation Building America Expert Meeting: Cladding Attachment Over Exterior Insulation Building Science...

  7. Introducing the Attachments Energy Ratings Council

    Broader source: Energy.gov [DOE]

    In collaboration with the U.S. Department of Energy (DOE), the Window Covering Manufacturers Association (WCMA) has launched the Attachments Energy Ratings Council (AERC).

  8. Bonneville Power Administration Attachment P Oversupply Management...

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

    reduced generation in order to meet the Transmission Customers' schedules. The Oversupply Management Protocol will apply as follows: 1. The term of this attachment is March 31,...

  9. Cladding Attachment Over Thick Exterior Rigid Insulation

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

    ... Double Bending Linear (10 Cantilever) Linear (10 Double Bending) Cladding Attachment ... Compression Strut Function of fastener tension and insulation compression Measured ...

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

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

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

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

  14. Part VII: Section J - List of Documents, Exhibits, and Other Attachments, Attachment K

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

    K DE-AC36-08GO28308 Modification M1033 Attachment K Diversity Plan Diversity Plan CY2014 is hereby incorporated as Attachment K of the contract

  15. Part VII: Section J - List of Documents, Exhibits, and Other Attachments, Attachment C

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

    C DE-AC36-08GO28308 Modification M1033 Attachment C Small Business Subcontracting Plan

  16. Part VII: Section J - List of Documents, Exhibits, and Other Attachments, Attachment S

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

    S DE-AC36-08GO28308 Modification M1033 Attachment S Human Resources Compensation Plan

  17. Part VII: Section J - List of Documents, Exhibits, and Other Attachments, Attachment T

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

    T DE-AC36-08GO28308 Modification M1033 Attachment T Human Resources Workforce Plan

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

  19. Microsoft Word - Attachment F1.doc

    Office of Environmental Management (EM)

    F1 RCRA HAZARDOUS WASTE MANAGEMENT JOB TITLES AND DESCRIPTIONS Waste Isolation Pilot Plant Hazardous Waste Permit November 30, 2010 (This page intentionally blank) Waste Isolation Pilot Plant Hazardous Waste Permit November 30, 2010 PERMIT ATTACHMENT F1 Page F1-i ATTACHMENT F1 RCRA HAZARDOUS WASTE MANAGEMENT JOB TITLES AND DESCRIPTIONS TABLE OF CONTENTS Job

  20. Scaling Semantic Graph Databases in Size and Performance

    SciTech Connect (OSTI)

    Morari, Alessandro; Castellana, Vito G.; Villa, Oreste; Tumeo, Antonino; Weaver, Jesse R.; Haglin, David J.; Choudhury, Sutanay; Feo, John T.

    2014-08-06

    In this paper we present SGEM, a full software system for accelerating large-scale semantic graph databases on commodity clusters. Unlike current approaches, SGEM addresses semantic graph databases by only employing graph methods at all the levels of the stack. On one hand, this allows exploiting the space efficiency of graph data structures and the inherent parallelism of graph algorithms. These features adapt well to the increasing system memory and core counts of modern commodity clusters. On the other hand, however, these systems are optimized for regular computation and batched data transfers, while graph methods usually are irregular and generate fine-grained data accesses with poor spatial and temporal locality. Our framework comprises a SPARQL to data parallel C compiler, a library of parallel graph methods and a custom, multithreaded runtime system. We introduce our stack, motivate its advantages with respect to other solutions and show how we solved the challenges posed by irregular behaviors. We present the result of our software stack on the Berlin SPARQL benchmarks with datasets up to 10 billion triples (a triple corresponds to a graph edge), demonstrating scaling in dataset size and in performance as more nodes are added to the cluster.

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

    SciTech Connect (OSTI)

    2015-01-16

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

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

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

  4. Graph facilitates tracking water and gas influx

    SciTech Connect (OSTI)

    Gruy, H.J. )

    1990-03-26

    Graphing the vertical distribution of reservoir volume is an easy method for estimating the acre-ft remaining to be exploited in reservoirs with water or gas encroachment. To evaluate reservoir performance and estimate oil and gas reserves in water-drive reservoirs or oil reservoirs with a gas cap, it is necessary to determine the magnitude of the movement of oil-water and gas-oil contact surfaces. In reviewing reserve estimates and reservoir studies done by others, the authors have found that very few reservoir engineers or geologists have an easy method for tracking the movement of these surfaces and estimating the volumes of oil displaced water encroachment, gas cap expansion, or the volumes of oil lost by wetting the gas cap. The following method evolved from the author's studies of the East Texas field starting in 1942, and it took this form in the early 1950s.

  5. Nuclear reactor fuel rod attachment system

    DOE Patents [OSTI]

    Not Available

    1980-09-17

    A reusable system is described for removably attaching a nuclear reactor fuel rod to a support member. A locking cap is secured to the fuel rod and a locking strip is fastened to the support member. The locking cap has two opposing fingers shaped to form a socket having a body portion. The locking strip has an extension shaped to rigidly attach to the socket's body portion. The locking cap's fingers are resiliently deflectable. For attachment, the locking cap is longitudinally pushed onto the locking strip causing the extension to temporarily deflect open the fingers to engage the socket's body portion. For removal, the process is reversed.

  6. EXHIBIT G7.0 Attachment 2

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

    G7.0 Attachment 2 32014 Page 1 SUBCONTRACTOR CYBER SECURITY PLAN Vendor Name (if Applicable): Subcontract No. PR- Ex. G dated: XXXXXX Rev. No.: 7 Pursuant to the requirements in...

  7. Microsoft Word - Attachment coversheet.docx

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

    HANFORD MISSION SUPPORT CONTRACT ADVANCE UNDERSTANDING ON COST REVISED DECEMBER 31, 2014 Mission Support Contract Contract Number DE-AC06-09RL14728 Attachment J, Section J.8...

  8. ATTACHMENT A - CHECKLIST FOR SELF ASSESSMENT

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

    ATTACHMENT A - CHECKLIST FOR SELF ASSESSMENT Site: Federal or Contractor Program: Name: ____________________________________________ Title:______________________________________________ Organization:_______________________________________ Address: __________________________________________ Bldg and Room Number _____________________________ Phone Number __________________ E-Mail ________________________________ Years of Records Management experience? Length of time in current position? Training?

  9. Appendix DATA Attachment A: WIPP Borehole Update

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

    Carlsbad Field Office Carlsbad, New Mexico Appendix DATA-2014 Attachment A: WIPP Borehole Update Table of Contents DATA-A-1.0 WIPP Boreholes DATA-A-2.0 Individual Well Reports ...

  10. River Corridor Closure Contract Section J, Attachment...

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

    2 Contract No. DE-AC06-05RL14655 A000 1 ATTACHMENT J-12 GOVERNMENT-FURNISHED SERVICES AND INFORMATION (GFSI) GFSI Item Scope Description GFSI Description C.4 Hanford Site...

  11. Microsoft Word - Attachment G1.doc

    Office of Environmental Management (EM)

    DETAILED DESIGN REPORT FOR AN OPERATION PHASE PANEL CLOSURE SYSTEM Adapted from DOE/WIPP 96-2150 Waste Isolation Pilot Plant Hazardous Waste Permit November 30, 2010 (This page intentionally blank) Waste Isolation Pilot Plant Hazardous Waste Permit November 30, 2010 PERMIT ATTACHMENT G1 Page G1-i ATTACHMENT G1 DETAILED DESIGN REPORT FOR AN OPERATION PHASE PANEL CLOSURE SYSTEM TABLE OF CONTENTS Executive Summary

  12. Microsoft Word - Attachment J.doc

    Office of Environmental Management (EM)

    UNIT TABLES Waste Isolation Pilot Plant Hazardous Waste Permit April 15, 2011 (This page intentionally blank) Waste Isolation Pilot Plant Hazardous Waste Permit April 15, 2011 PERMIT ATTACHMENT J Page J-i ATTACHMENT J HAZARDOUS WASTE MANAGEMENT UNIT TABLES LIST OF TABLES Table Title Table J-1 Waste Handling Building (WHB) Container Storage Unit Table J-2 Parking Area Container Storage Unit Table J-3 Underground Hazardous Waste Disposal Units Waste Isolation Pilot Plant Hazardous Waste Permit

  13. Attachment device for an inflatable protective cushion

    DOE Patents [OSTI]

    Nelsen, James M.; Luna, Daniel A.; Gwinn, Kenneth W.

    1997-01-01

    An inflatable cushion assembly for use with an inflator comprises an inflatable cushion having an inner surface, outer surface, and at least one protrusion extending from one of the inner or outer surfaces. The inflatable cushion defines an opening between the inner surface and the outer surface for receiving the inflator. An attachment member contacts the one of the inner or outer surfaces adjacent the opening and includes a groove for receiving the protrusion, the attachment member securing the inflator within the opening.

  14. Attachment device for an inflatable protective cushion

    DOE Patents [OSTI]

    Nelsen, James M.; Luna, Daniel A.; Gwinn, Kenneth W.

    1998-01-01

    An inflatable cushion assembly for use with an inflator comprises an inflatable cushion having an inner surface, outer surface, and at least one protrusion extending from one of the inner or outer surfaces. The inflatable cushion defines an opening between the inner surface and the outer surface for receiving the inflator. An attachment member contacts the one of the inner or outer surfaces adjacent the opening and includes a groove for receiving the protrusion, the attachment member securing the inflator within the opening.

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

  16. Microsoft Word - Policy Flash 2010-81 Attachment 2 | Department...

    Office of Environmental Management (EM)

    81 Attachment 2 Microsoft Word - Policy Flash 2010-81 Attachment 2 Microsoft Word - Policy Flash 2010-81 Attachment 2 More Documents & Publications ATTACHMENTFLASH2010.81(2)-OPAM...

  17. Microsoft Word - Policy Flash 2011-2 Attachment 1 | Department...

    Energy Savers [EERE]

    Microsoft Word - Policy Flash 2011-2 Attachment 1 Microsoft Word - Policy Flash 2011-2 Attachment 1 Microsoft Word - Policy Flash 2011-2 Attachment 1 More Documents & Publications...

  18. Microsoft Word - Policy Flash 2010-81 Attachment 1 | Department...

    Energy Savers [EERE]

    Microsoft Word - Policy Flash 2010-81 Attachment 1 Microsoft Word - Policy Flash 2010-81 Attachment 1 Microsoft Word - Policy Flash 2010-81 Attachment 1 More Documents &...

  19. Microsoft Word - Policy Flash 2010-67 Attachment 1 | Department...

    Office of Environmental Management (EM)

    67 Attachment 1 Microsoft Word - Policy Flash 2010-67 Attachment 1 Microsoft Word - Policy Flash 2010-67 Attachment 1 More Documents & Publications Acquisition Letter 2009-03...

  20. Attachment C - Summary GHG Emissions Data FINAL | Department of Energy

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

    - Summary GHG Emissions Data FINAL Attachment C - Summary GHG Emissions Data FINAL Attachment C - Summary GHG Emissions Data FINAL (33.78 KB) More Documents & Publications Attachment C

  1. Attachment C Summary GHG Emissions Data FINAL | Department of Energy

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

    Summary GHG Emissions Data FINAL Attachment C Summary GHG Emissions Data FINAL Attachment-C-Summary-GHG-Emissions-Data-FINAL.xlsx (34.24 KB) More Documents & Publications Attachment C -

  2. Attachment FY2011-83 OPAM | Department of Energy

    Office of Environmental Management (EM)

    3 OPAM Attachment FY2011-83 OPAM Federal Supply Schedules Attachment FY2011-83 OPAM More Documents & Publications Chapter 8 - Required Sources of Supplies and Services Attachment...

  3. Part VII: Section J - List of Documents, Exhibits, and Other Attachments, Attachment M

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

    M DE-AC36-08GO28308 Modification M1033 Attachment M Equal Opportunity Program Incorporated by Reference In Modification M004

  4. Part VII: Section J - List of Documents, Exhibits, and Other Attachments, Attachment N

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

    N DE-AC36-08GO28308 Modification M1033 Attachment N Supplemental Requirements To Laws, Regulations, And Doe Directives

  5. Part VII: Section J - List of Documents, Exhibits, and Other Attachments, Attachments H

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

    H DE-AC36-08GO28308 Modification M1033 Attachment H Performance Guarantee Agreement Incorporated by Reference In Modification M004

  6. Attachment 3: Instructions for Use of Green Lease Solicitation...

    Energy Savers [EERE]

    Attachment 3: Instructions for Use of Green Lease Solicitation Paragraph Reference Chart Attachment 3: Instructions for Use of Green Lease Solicitation Paragraph Reference Chart...

  7. Attachment 2: Solicitation for Offers with New and Revised Green...

    Energy Savers [EERE]

    Attachment 2: Solicitation for Offers with New and Revised Green Lease Text Attachment 2: Solicitation for Offers with New and Revised Green Lease Text PDF icon Solicitation for...

  8. Attachment 1: Green Lease Policies and Procedures for Lease Acquisitio...

    Energy Savers [EERE]

    Attachment 1: Green Lease Policies and Procedures for Lease Acquisition Attachment 1: Green Lease Policies and Procedures for Lease Acquisition PDF icon Green Lease Policies and...

  9. Collimator with attachment mechanism and system (Patent) | DOEPatents

    Office of Scientific and Technical Information (OSTI)

    Data Explorer Search Results Collimator with attachment mechanism and system Title: Collimator with attachment mechanism and system A self-aligning collimator for a radiation ...

  10. Apparatus for attaching a cleaning tool to a robotic manipulator...

    Office of Scientific and Technical Information (OSTI)

    Apparatus for attaching a cleaning tool to a robotic manipulator Title: Apparatus for attaching a cleaning tool to a robotic manipulator This invention is comprised of an apparatus ...

  11. Apparatus for attaching a cleaning tool to a robotic manipulator...

    Office of Scientific and Technical Information (OSTI)

    Apparatus for attaching a cleaning tool to a robotic manipulator Title: Apparatus for attaching a cleaning tool to a robotic manipulator You are accessing a document from the ...

  12. Property:NEPA ApplicationAttachments | Open Energy Information

    Open Energy Info (EERE)

    ApplicationAttachments Jump to: navigation, search Property Name NEPA ApplicationAttachments Property Type Page Description FONSI files for NEPA Docs. For example: Cover letters,...

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

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

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

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

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

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

  19. Part VII: Section J - List of Documents, Exhibits, and Other Attachments, Attachment J

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

    J DE-AC36-08GO28308 Modification M1033 Attachment J Performance Evaluation And Measurement Plan FY 2015 Performance Evaluation And Measurement Plan dated May 11, 2015, Rev 4, is hereby incorporated into this contract by reference as Section J, Attachment J

  20. Part VII: Section J - List of Documents, Exhibits, and Other Attachments, Attachment L

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

    L DE-AC36-08GO28308 Modification M1033 Attachment L Employee Concerns Program (ECP) Implementation Plan The Employee Concerns Program Plan, dated January 22, 2015, is hereby incorporated into this contract by reference as Section J, Attachment L

  1. Part VII: Section J - List of Documents, Exhibits, and Other Attachments, Attachment P

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

    P DE-AC36-08GO28308 Modification M1033 Attachment P Five Year Strategic Plan NREL's Five-Year Plan (FY15-FY19), dated October 23, 2014, Rev 2, is hereby incorporated into this contract by reference as Section J, Attachment P

  2. Part VII: Section J - List of Documents, Exhibits, and Other Attachments, Attachment Q

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

    Q DE-AC36-08GO28308 Modification M1033 Attachment Q Organizational Conflict Of Interest Management Plan Organizational Conflicts of Interest Management Plan and Implementation Program, Volumes I and II, dated October 6, 2014, are hereby incorporated into this contract by reference as Section J, Attachment Q

  3. Part VII: Section J - List of Documents, Exhibits, and Other Attachments, Attachment R

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

    R DE-AC36-08GO28308 Modification M1033 Attachment R Organizational Conflict Of Interest Implementation Program Organizational Conflicts of Interest Management Plan and Implementation Program, Volumes I and II, dated October 6, 2014, are hereby incorporated into this contract by reference as Section J, Attachment R

  4. Nuclear reactor fuel rod attachment system

    DOE Patents [OSTI]

    Christiansen, David W. (Kennewick, WA)

    1982-01-01

    A reusable system for removably attaching a nuclear reactor fuel rod (12) to a support member (14). A locking cap (22) is secured to the fuel rod (12) and a locking strip (24) is fastened to the support member (14). The locking cap (22) has two opposing fingers (24a and 24b) shaped to form a socket having a body portion (26). The locking strip has an extension (36) shaped to rigidly attach to the socket's body portion (26). The locking cap's fingers are resiliently deflectable. For attachment, the locking cap (22) is longitudinally pushed onto the locking strip (24) causing the extension (36) to temporarily deflect open the fingers (24a and 24b) to engage the socket's body portion (26). For removal, the process is reversed.

  5. Attachment device for an inflatable protective cushion

    DOE Patents [OSTI]

    Nelsen, J.M.; Luna, D.A.; Gwinn, K.W.

    1997-11-18

    An inflatable cushion assembly for use with an inflator comprises an inflatable cushion having an inner surface, outer surface, and at least one protrusion extending from one of the inner or outer surfaces. The inflatable cushion defines an opening between the inner surface and the outer surface for receiving the inflator. An attachment member contacts the one of the inner or outer surfaces adjacent the opening and includes a groove for receiving the protrusion, the attachment member securing the inflator within the opening. 22 figs.

  6. Attachment device for an inflatable protective cushion

    DOE Patents [OSTI]

    Nelsen, J.M.; Luna, D.A.; Gwinn, K.W.

    1998-12-08

    An inflatable cushion assembly for use with an inflator comprises an inflatable cushion having an inner surface, outer surface, and at least one protrusion extending from one of the inner or outer surfaces. The inflatable cushion defines an opening between the inner surface and the outer surface for receiving the inflator. An attachment member contacts the one of the inner or outer surfaces adjacent the opening and includes a groove for receiving the protrusion, the attachment member securing the inflator within the opening. 22 figs.

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

  8. Annual Report Outline (IDIQ Attachment J-10) | Department of Energy

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

    Report Outline (IDIQ Attachment J-10) Annual Report Outline (IDIQ Attachment J-10) Document offers an annual report outline sample for an energy savings performance contract. Download the annual report outline. (48.62 KB) More Documents & Publications Post-Installation Report Outline (IDIQ Attachment J-9) Measurement and Verification Plan and Savings Calculations Methods Outline (IDIQ Attachment J-8) ESPC Task Order Financial Schedules (IDIQ Attachment J-6

  9. Part VII: Section J - List of Documents, Exhibits, and Other Attachments, Attachment G

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

    G DE-AC36-08GO28308 Modification M1033 Attachment G Sensitive Foreign Nations Control In accordance with the Clause I.92, Sensitive Foreign Nations Controls, this Attachment sets forth the requirements the contractor shall comply with under this contract. (Reference DOE Order 142.3, or superseding directives.) Foreign National access to DOE sites, programs, information and technologies will be approved provided the access is needed to support the program objectives of DOE and/or objectives of

  10. Part VII: Section J - List of Documents, Exhibits, and Other Attachments, Attachment I

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

    I DE-AC36-08GO28308 Modification M1033 Attachment I Subcontracts, Purchase Orders And Other Actions Requiring DOE Review And Approval And Other Agreements Between The Parties This Attachment, implementing the Article entitled Contractor Purchasing System, sets forth the requirements for DOE's approval under the prime contract for the operation of the National Renewable Energy Laboratory. Subcontracts not binding on DOE Subcontracts and purchase orders shall be made in the name of Alliance, shall

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

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

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

  14. Methods of attaching erosion-resistant nonmetallic panels

    SciTech Connect (OSTI)

    Girzhel, A.M.

    1984-01-01

    Attachment methods for panels of wear-resistant nonmetallic materials, e.g. cast stone and slag, devitrified slag, and erosion-resistant and heat-resistant concretes to protect hopper, chute, and trough structures at metallurgical and coal industries have been investigated. Attachment methods can be divided into two groups, attachment by adhesives and by mechanical attachment. A new method of mechanical attachment, considered to be much superior to adhesive attachment, provides for reliable fastening without damage to the protected metal structure. Various panel designs may be used depending on the operating conditions.

  15. EECBG SEP Attachment 1 - Process metric list

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

    10-07B/SEP 10-006A Attachment 1: Process Metrics List Metric Area Metric Primary or Optional Metric Item(s) to Report On 1. Building Retrofits 1a. Buildings retrofitted, by sector Number of buildings retrofitted Square footage of buildings retrofitted 1b. Energy management systems installed, by sector Number of energy management systems installed Square footage of buildings under management 1c. Building roofs retrofitted, by sector Number of building roofs retrofitted Square footage of building

  16. Attachment FY2011-55 OPAM

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

    1, Summary of Small Business Administration and Department of Energy Partnership Agreement Reference: FAR 19.8 Overview Recently, the Secretary and the Administrator of the Small Business Administration (SBA) executed a Partnership Agreement to expedite the award of requirements pursuant to section 8(a) of the Small Business Act. It will remain in effect through September 30, 2012. A copy is attached. This section discusses the effects of that Partnership Agreement on the way Department of

  17. Cladding Attachment Over Thick Exterior Insulating Sheathing

    SciTech Connect (OSTI)

    Baker, P.; Eng, P.; Lepage, R.

    2014-01-01

    The addition of insulation to the exterior of buildings is an effective means of increasing the thermal resistance of both wood framed walls as well as mass masonry wall assemblies. For thick layers of exterior insulation (levels greater than 1.5 inches), the use of wood furring strips attached through the insulation back to the structure has been used by many contractors and designers as a means to provide a convenient cladding attachment location (Straube and Smegal 2009, Pettit 2009, Joyce 2009, Ueno 2010). The research presented in this report is intended to help develop a better understanding of the system mechanics involved and the potential for environmental exposure induced movement between the furring strip and the framing. BSC sought to address the following research questions: 1. What are the relative roles of the mechanisms and the magnitudes of the force that influence the vertical displacement resistance of the system? 2. Can the capacity at a specified deflection be reliably calculated using mechanics based equations? 3. What are the impacts of environmental exposure on the vertical displacement of furring strips attached directly through insulation back to a wood structure?

  18. Cladding Attachment Over Thick Exterior Insulating Sheathing

    SciTech Connect (OSTI)

    Baker, P.; Eng, P.; Lepage, R.

    2014-01-01

    The addition of insulation to the exterior of buildings is an effective means of increasing the thermal resistance of both wood framed walls as well as mass masonry wall assemblies. For thick layers of exterior insulation (levels greater than 1.5 inches), the use of wood furring strips attached through the insulation back to the structure has been used by many contractors and designers as a means to provide a convenient cladding attachment location (Straube and Smegal 2009, Pettit 2009, Joyce 2009, Ueno 2010). The research presented in this report is intended to help develop a better understanding of the system mechanics involved and the potential for environmental exposure induced movement between the furring strip and the framing. BSC sought to address the following research questions: 1.What are the relative roles of the mechanisms and the magnitudes of the force that influence the vertical displacement resistance of the system? 2.Can the capacity at a specified deflection be reliably calculated using mechanics based equations? 3.What are the impacts of environmental exposure on the vertical displacement of furring strips attached directly through insulation back to a wood structure?

  19. Attachment FY2011-06 OPAM | Department of Energy

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

    SUMMARY OF PUBLIC LAW 111-240, THE SMALL BUSINESS JOBS ACT OF 2010 Attachment FY2011-06 OPAM More Documents & Publications Attachment FY2011-28 OPAM Chapter 19 - Small Business...

  20. Attachment FY2011-9 | Department of Energy

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

    Attachment FY2011-9 Attachment FY2011-9 FFRDC Determination for a Contract Competition More Documents & Publications Policy Flash 2013-30 Acquisition Letter on Acquisition Planning...

  1. Attachment FY2011-12 | Department of Energy

    Office of Environmental Management (EM)

    2 Attachment FY2011-12 Indirect Cost Rate Administration Attachment FY2011-12 More Documents & Publications AcqGuide42pt1.doc&0; Acquisition Letter No. AL 2008-02 Department of...

  2. AttachmentFlash_2010-65.pdf | Department of Energy

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

    65.pdf AttachmentFlash2010-65.pdf PDF icon AttachmentFlash2010-65.pdf More Documents & Publications fac2001-26.pdf DOELabor Leadership Roundtable Meeting Generic copy of DOE's...

  3. Dual-shank attachment design for omega seals

    DOE Patents [OSTI]

    Sattinger, Stanley S.

    1978-01-01

    An improved apparatus and process for attaching welded omega seal segments to reactor heads, standpipes, mechanisms, and plugs comprises a first shank in combination with a second shank to attach an omega seal at a metal-to-metal interface.

  4. EECBG SEP Attachment 1 - Process metric list | Department of Energy

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

    SEP Attachment 1 - Process metric list EECBG SEP Attachment 1 - Process metric list Reporting Guidance Process Metric List eecbg_10_07b_sep__10_006a_attachment1_process_metric_list.pdf (93.56 KB) More Documents & Publications EECBG 10-07C/SEP 10-006B Attachment 1: Process Metrics List EECBG Program Notice 10-07A DOE Recovery Act Reporting Requirements for the State Energy Program

  5. Cable attachment for a radioactive brachytherapy source capsule

    DOE Patents [OSTI]

    Gross, Ian G; Pierce, Larry A

    2006-07-18

    In cancer brachytherapy treatment, a small californium-252 neutron source capsule is attached to a guide cable using a modified crimping technique. The guide cable has a solid cylindrical end, and the attachment employs circumferential grooves micromachined in the solid cable end. The attachment was designed and tested, and hardware fabricated for use inside a radioactive hot cell. A welding step typically required in other cable attachments is avoided.

  6. Attachment 3.a. Part A Page 1 of 6

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

    ......... 3 A.7. Billing & Payment ......of the requesting agency and servicing agency. A.7. Billing & Payment Attachment 3.a. ...

  7. Standard Financing Offer Template (IDIQ Attachment J-12) | Department of

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

    Energy Standard Financing Offer Template (IDIQ Attachment J-12) Standard Financing Offer Template (IDIQ Attachment J-12) Document features a template to help communicate a finance offer as part of an energy savings performance contract. Download the standard financing offer template. (30.52 KB) More Documents & Publications Investor Deal Summary Template (IDIQ Attachment J-11) ESPC Task Order Financial Schedules (IDIQ Attachment J-6) Descriptions of ESPC Task Order Schedules and

  8. SECTION L -ATTACHMENT B - LISTING OF KEY PERSONNEL

    National Nuclear Security Administration (NNSA)

    B, Page 1 SECTION L ATTACHMENT B LISTING OF KEY PERSONNEL TITLE NAME Note: Addremove extra rows if needed...

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

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

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

  12. Photoswitchable method for the ordered attachment of proteins to surfaces

    DOE Patents [OSTI]

    Camarero, Julio A.; De Yoreo, James J.; Kwon, Youngeun

    2010-04-20

    Described herein is a method for the attachment of proteins to any solid support with control over the orientation of the attachment. The method is extremely efficient, not requiring the previous purification of the protein to be attached, and can be activated by UV-light. Spatially addressable arrays of multiple protein components can be generated by using standard photolithographic techniques.

  13. Photoswitchable method for the ordered attachment of proteins to surfaces

    DOE Patents [OSTI]

    Camarero, Julio A.; DeYoreo, James J.; Kwon, Youngeun

    2011-07-05

    Described herein is a method for the attachment of proteins to any solid support with control over the orientation of the attachment. The method is extremely efficient, not requiring the previous purification of the protein to be attached, and can be activated by UV-light. Spatially addressable arrays of multiple protein components can be generated by using standard photolithographic techniques.

  14. ATTACHMENT A - CHECKLIST FOR SELF ASSESSMENT | Department of Energy

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

    ATTACHMENT A - CHECKLIST FOR SELF ASSESSMENT ATTACHMENT A - CHECKLIST FOR SELF ASSESSMENT ATTACHMENT A - CHECKLIST FOR SELF ASSESSMENT (302.66 KB) More Documents & Publications Assessment B - Program Criteria Assessment C-Site Visit Protocol DOE O 243.1B, Records Management Program

  15. Attachment 4: Unrevised SFO Paragraphs Reissued | Department of Energy

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

    4: Unrevised SFO Paragraphs Reissued Attachment 4: Unrevised SFO Paragraphs Reissued Unrevised SFO Paragraphs Reissued (35.68 KB) More Documents & Publications Attachment 2: Solicitation for Offers with New and Revised Green Lease Text Attachment 1: Green Lease Policies and Procedures for Lease Acquisition 1

  16. AL2000-10Attach.pdf | Department of Energy

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

    AL2000-10Attach.pdf AL2000-10Attach.pdf PDF icon AL2000-10Attach.pdf More Documents & Publications AL2000-10R.pdf AL2004-01r2.pdf Consent Order, Fluor Federal Services - EA-2000-10...

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

  18. Microsoft Word - ATTACHMENT A Suppl 5.doc

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

    ATTACHMENT A: Modeling in Support of Additional Two-Unit Operating Configurations Unit 1 & Unit 2 Operation - SO2 Table Mirant Potomac, Alexandria, Virginia Maximum Impacts Predicted by AERMOD-PRIME Compliance Based on Highest, Second-Highest Short-term and Highest Annual Concentrations Units 1 & 2 on 24 hrs/day @ Max load SO2 = 0.31 lb/MBtu for both units. AERMOD- PRIME Monitored Background AERMOD-PRIME + Background NAAQS Distance Direction Ground Elevation Flagpole Elevation X (m) Y

  19. Appendix DATA Attachment A: WIPP Borehole Update

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

    A: WIPP Borehole Update United States Department of Energy Waste Isolation Pilot Plant Carlsbad Field Office Carlsbad, New Mexico Appendix DATA-2014 Attachment A: WIPP Borehole Update Table of Contents DATA-A-1.0 WIPP Boreholes DATA-A-2.0 Individual Well Reports DATA-A-2.1 New Wells Drilled Since the CRA-2009 DATA-A-2.2 Plugged Wells DATA-A-3.0 References List of Tables Table DATA-A- 1. Status of WIPP Boreholes December 2012 WIPP Table DATA-A-1. Status of WIPP Boreholes December 2012 WIPP

  20. Microsoft Word - Attachment coversheet.docx

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

    HANFORD MISSION SUPPORT CONTRACT ADVANCE UNDERSTANDING ON COST REVISED DECEMBER 31, 2014 Mission Support Contract Contract Number DE-AC06-09RL14728 Attachment J, Section J.8 Modification 479 ii CHANGE HISTORY Version Date Change Author Change Summary 6.0 December 31, 2014 Ricky Churchman Updated to incorporate: Retention as a part of the Hiring/Signing bonuses 5.1 August 26, 2014 Ricky Churchman Updated to incorporate: Use of Government/Contractor Leased Vehicles for Offsite Transportation 5.0

  1. Predicting Envelope Leakage in Attached Dwellings

    SciTech Connect (OSTI)

    Faakye, O.; Arena, L.; Griffiths, D.

    2013-07-01

    The most common method for measuring air leakage is to use a single blower door to pressurize and/or depressurize the test unit. In detached housing, the test unit is the entire home and the single blower door measures air leakage to the outside. In attached housing, this 'single unit', 'total', or 'solo' test method measures both the air leakage between adjacent units through common surfaces as well air leakage to the outside. Measuring and minimizing this total leakage is recommended to avoid indoor air quality issues between units, reduce energy losses to the outside, reduce pressure differentials between units, and control stack effect. However, two significant limitations of the total leakage measurement in attached housing are: for retrofit work, if total leakage is assumed to be all to the outside, the energy benefits of air sealing can be significantly over predicted; for new construction, the total leakage values may result in failing to meet an energy-based house tightness program criterion. The scope of this research is to investigate an approach for developing a viable simplified algorithm that can be used by contractors to assess energy efficiency program qualification and/or compliance based upon solo test results.

  2. DOE/RL-92-36, Hanford Site Hoisting and Rigging Manual ATTACHMENTS

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

    ATTACHMENTS February 28, 2012 Rev 1 Page 31 ATTACHMENT 2 Lifting Requirements for Concrete Blocks DOERL-92-36, Hanford Site Hoisting and Rigging Manual ATTACHMENTS February 28,...

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

  5. Dissociative electron attachment studies on acetone

    SciTech Connect (OSTI)

    Prabhudesai, Vaibhav S. Tadsare, Vishvesh; Ghosh, Sanat; Gope, Krishnendu; Davis, Daly; Krishnakumar, E.

    2014-10-28

    Dissociative electron attachment (DEA) to acetone is studied in terms of the absolute cross section for various fragment channels in the electron energy range of 020 eV. H{sup ?} is found to be the most dominant fragment followed by O{sup ?} and OH{sup ?} with only one resonance peak between 8 and 9 eV. The DEA dynamics is studied by measuring the angular distribution and kinetic energy distribution of fragment anions using Velocity Slice Imaging technique. The kinetic energy and angular distribution of H{sup ?} and O{sup ?} fragments suggest a many body break-up for the lone resonance observed. The ab initio calculations show that electron is captured in the multi-centered anti-bonding molecular orbital which would lead to a many body break-up of the resonance.

  6. Vacuum die attach for integrated circuits

    DOE Patents [OSTI]

    Schmitt, Edward H.; Tuckerman, David B.

    1991-01-01

    A thin film eutectic bond for attaching an integrated circuit die to a circuit substrate is formed by coating at least one bonding surface on the die and substrate with an alloying metal, assembling the die and substrate under compression loading, and heating the assembly to an alloying temperature in a vacuum. A very thin bond, 10 microns or less, which is substantially void free, is produced. These bonds have high reliability, good heat and electrical conduction, and high temperature tolerance. The bonds are formed in a vacuum chamber, using a positioning and loading fixture to compression load the die, and an IR lamp or other heat source. For bonding a silicon die to a silicon substrate, a gold silicon alloy bond is used. Multiple dies can be bonded simultaneously. No scrubbing is required.

  7. Vacuum die attach for integrated circuits

    DOE Patents [OSTI]

    Schmitt, E.H.; Tuckerman, D.B.

    1991-09-10

    A thin film eutectic bond for attaching an integrated circuit die to a circuit substrate is formed by coating at least one bonding surface on the die and substrate with an alloying metal, assembling the die and substrate under compression loading, and heating the assembly to an alloying temperature in a vacuum. A very thin bond, 10 microns or less, which is substantially void free, is produced. These bonds have high reliability, good heat and electrical conduction, and high temperature tolerance. The bonds are formed in a vacuum chamber, using a positioning and loading fixture to compression load the die, and an IR lamp or other heat source. For bonding a silicon die to a silicon substrate, a gold silicon alloy bond is used. Multiple dies can be bonded simultaneously. No scrubbing is required. 1 figure.

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

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

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

  11. Microsoft Word - Flash2008-09Attachment.doc | Department of Energy

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

    9Attachment.doc More Documents & Publications Flash2007-02Attachment.doc&0; Microsoft Word - AL2000-05Attachment.doc Flash2007-03Attachment.doc&0;...

  12. Microsoft Word - AL2000-05Attachment.doc | Department of Energy

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

    Attachment.doc Microsoft Word - AL2000-05Attachment.doc PDF icon Microsoft Word - AL2000-05Attachment.doc More Documents & Publications al99-06attachment.doc&0; EXHIBIT A: CRADA,...

  13. Part VII: Section J - List of Documents, Exhibits, and Other Attachments, Table of Contents

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

    III SECTION J LIST OF DOCUMENTS, EXHIBITS, AND OTHER ATTACHMENTS TABLE OF CONTENTS Document Title Page Attachment A Personnel (Appendix A) ......................................................................................... ..3 Attachment B Key Personnel ......................................................................................................... 26 Attachment C Small Business Subcontracting Plan ...................................................................... 27

  14. Microsoft Word - Attachment J-5 Continuity of Operations Plan.doc

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

    5-1 ATTACHMENT J.5 CONTINUITY OF OPERATIONS

  15. Investor Deal Summary Template (IDIQ Attachment J-11) | Department of

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

    Energy Investor Deal Summary Template (IDIQ Attachment J-11) Investor Deal Summary Template (IDIQ Attachment J-11) Document features a template for summarizing an investor or energy service company's deal as part of an energy savings performance contract. Download the Investor Deal Summary Template. (39.05 KB) More Documents & Publications ESPC Task Order Financial Schedules (IDIQ Attachment J-6) ESPC ENABLE Final Proposal Requirements Model Energy Savings Performance Contract,

  16. Certification and Rating of Attachments for Fenestration Technologies

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

    (DE-FOA-0001000) | Department of Energy Certification and Rating of Attachments for Fenestration Technologies (DE-FOA-0001000) Certification and Rating of Attachments for Fenestration Technologies (DE-FOA-0001000) November 5, 2013 - 4:43pm Addthis This funding opportunity is closed Through this Funding Opportunity Announcement (FOA) the Building Technologies Office (BTO) seeks to establish a performance rating mechanism for assessing the energy performance of fenestration attachments. DOE

  17. Part VII: Section J - List of Documents, Exhibits, and Other Attachments, Attachment E

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

    E DE-AC36-08GO28308 Modification M1033 Attachment E Applicable Laws and Regulations (List A) Necessary and Sufficient Environmental, Safety and Health Standards CODE OF FEDERAL REGULATIONS (CFR) 7 CFR 340-Biotechnology Permits 10 CFR 8.4 - Interpretation by the General Counsel: AEC Jurisdiction 10 CFR 707 Workplace Substance Abuse Programs at DOE Sites 10 CFR 719 - Contractor Legal Management Requirements 10 CFR 835 - Occupational Radiation Protection 10 CFR 851 - Worker Safety and Health

  18. Part VII: Section J - List of Documents, Exhibits, and Other Attachments, Attachment F

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

    F DE-AC36-08GO28308 Modification M1033 Attachment F Operating and Administrative Requirements (List B) Prime Contract No. DE-AC36-08GO28308 The operating and administrative requirements, including the Contractor Requirements Documents of DOE directives listed below are applicable in whole or in part in accordance with clauses H-18 Application of DOE Contractor Requirements Documents and 970.5204-2, Laws, Regulations, and DOE Directives (DEC 2000). The concurrence analysis documenting

  19. Microsoft Word - Policy Flash 2010-82 Attachment 1 | Department...

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

    2 Attachment 1 More Documents & Publications Policy Flash 2010-82 Microsoft Word - Policy Flash 2008-07.doc Microsoft Word - Policy Flash 2008-10.doc...

  20. FLASH2003-12attachment.pdf | Department of Energy

    Office of Environmental Management (EM)

    FLASH2003-12attachment.pdf More Documents & Publications Flash2004-19.pdf Document DOE Princeton Plasma Physics Laboratory Purchase Power Agreement Request for Proposal...

  1. Nevada Test Site Environmental Report Attachment A: Site Description

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

    Nevada Test Site Environmental Report Attachment A: Site Description DOENV25946--790-ATT A Nevada Test Site Environmental Report 2008 Disclaimer Reference herein to any specific ...

  2. SECTION L -ATTACHMENT B - LISTING OF KEY PERSONNEL

    National Nuclear Security Administration (NNSA)

    B, Page 1 SECTION L ATTACHMENT B LISTING OF KEY PERSONNEL TITLE NAME [Note: Add/remove extra rows if needed]

  3. Building America Case Study:Cladding Attachment Over Mineral...

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

    Cladding Attachment Over Mineral Fiber Insulation Board Ontario, Canada PROJECT INFORMATION Project Name: Climate-Exposed Long- Term Testing of Mineral Fiber Insulation Board Under ...

  4. Building America Expert Meeting: Cladding Attachment Over Exterior Insulation

    Broader source: Energy.gov [DOE]

    This expert meeting was conducted by Building Science Corporation on July 28, 2012 and focused on issues surrounding cladding attachment and performance of walls with exterior insulating sheathing.

  5. Attachment 3 b. Part A Page 1 of 6

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

    Attachment 3 b. Part A Page 1 of 6 Section A - General Terms and Conditions ................................................................................................ 2 A.1. Purpose .................................................................................................................................................. 2 A.2. Authority ............................................................................................................................................... 2

  6. Microsoft Word - Attachment G1H.doc

    Office of Environmental Management (EM)

    APPENDIX H DESIGN DRAWINGS PANEL CLOSURE SYSTEM WASTE ISOLATION PILOT PLANT CARLSBAD, NEW ... ATTACHMENT G1 APPENDIX H DESIGN DRAWINGS PANEL CLOSURE SYSTEM WASTE ISOLATION PILOT PLANT ...

  7. Vacuum Attachment for Collection of Lithium Powder ---- Inventor...

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

    of Lithium Powder ---- Inventor(s) Hans Schneider and Stephan Jurczynski The Vacuum Attachment is part of an integrated system designed to collect Lithium (Li) Power for ...

  8. Appendix DATA Attachment B: WIPP Waste Containers and Emplacement

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

    Carlsbad Field Office Carlsbad, New Mexico Appendix DATA-2014 Attachment B: WIPP Waste Containers and Emplacement Table of Contents DATA-B-1.0 Authorized Waste Emplacement ...

  9. Attachment 2: Solicitation for Offers with New and Revised Green...

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

    2: Solicitation for Offers with New and Revised Green Lease Text Attachment 2: Solicitation for Offers with New and Revised Green Lease Text Solicitation for Offers Paragraphs with ...

  10. Attachment 3: Instructions for Use of Green Lease Solicitation...

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

    3: Instructions for Use of Green Lease Solicitation Paragraph Reference Chart Attachment 3: Instructions for Use of Green Lease Solicitation Paragraph Reference Chart (1.84 MB) ...