Sample records for graph database system

  1. Graph Databases for Large-Scale Healthcare Systems: A Framework for Efficient Data Management and Data Services

    SciTech Connect (OSTI)

    Park, Yubin [University of Texas at Austin] [University of Texas at Austin; Shankar, Mallikarjun [ORNL] [ORNL; Park, Byung H [ORNL] [ORNL; Ghosh, Dr. Joydeep [University of Texas at Austin] [University of Texas at Austin

    2014-01-01T23:59:59.000Z

    Designing a database system for both efficient data management and data services has been one of the enduring challenges in the healthcare domain. In many healthcare systems, data services and data management are often viewed as two orthogonal tasks; data services refer to retrieval and analytic queries such as search, joins, statistical data extraction, and simple data mining algorithms, while data management refers to building error-tolerant and non-redundant database systems. The gap between service and management has resulted in rigid database systems and schemas that do not support effective analytics. We compose a rich graph structure from an abstracted healthcare RDBMS to illustrate how we can fill this gap in practice. We show how a healthcare graph can be automatically constructed from a normalized relational database using the proposed 3NF Equivalent Graph (3EG) transformation.We discuss a set of real world graph queries such as finding self-referrals, shared providers, and collaborative filtering, and evaluate their performance over a relational database and its 3EG-transformed graph. Experimental results show that the graph representation serves as multiple de-normalized tables, thus reducing complexity in a database and enhancing data accessibility of users. Based on this finding, we propose an ensemble framework of databases for healthcare applications.

  2. Accelerating semantic graph databases on commodity clusters

    SciTech Connect (OSTI)

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

    2013-10-06T23:59:59.000Z

    We are developing a full software system for accelerating semantic graph databases on commodity cluster that scales to hundreds of nodes while maintaining constant query throughput. Our framework comprises a SPARQL to C++ compiler, a library of parallel graph methods and a custom multithreaded runtime layer, which provides a Partitioned Global Address Space (PGAS) programming model with fork/join parallelism and automatic load balancing over a commodity clusters. We present preliminary results for the compiler and for the runtime.

  3. 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-06T23:59:59.000Z

    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.

  4. Introduction to Database Database Systems Lecture 1

    E-Print Network [OSTI]

    Alechina, Natasha

    Introduction to Database Systems Database Systems Lecture 1 Natasha Alechina www.cs.nott.ac.uk/~nza/G51DBS #12;In this Lecture · Course Information · Databases and Database Systems · Some History questions · Format similar to previous years. #12;Textbook · Recommended textbooks: · `Database Systems

  5. Massive Scale Cyber Traffic Analysis: A Driver for Graph Database Research

    SciTech Connect (OSTI)

    Joslyn, Cliff A.; Choudhury, S.; Haglin, David J.; Howe, Bill; Nickless, William K.; Olsen, Bryan K.

    2013-06-19T23:59:59.000Z

    We describe the significance and prominence of network traffic analysis (TA) as a graph- and network-theoretical domain for advancing research in graph database systems. TA involves observing and analyzing the connections between clients, servers, hosts, and actors within IP networks, both at particular times and as extended over times. Towards that end, NetFlow (or more generically, IPFLOW) data are available from routers and servers which summarize coherent groups of IP packets flowing through the network. IPFLOW databases are routinely interrogated statistically and visualized for suspicious patterns. But the ability to cast IPFLOW data as a massive graph and query it interactively, in order to e.g.\\ identify connectivity patterns, is less well advanced, due to a number of factors including scaling, and their hybrid nature combining graph connectivity and quantitative attributes. In this paper, we outline requirements and opportunities for graph-structured IPFLOW analytics based on our experience with real IPFLOW databases. Specifically, we describe real use cases from the security domain, cast them as graph patterns, show how to express them in two graph-oriented query languages SPARQL and Datalog, and use these examples to motivate a new class of "hybrid" graph-relational systems.

  6. USER'S GUIDE DATABASE SYSTEM

    E-Print Network [OSTI]

    server and runs on the PPPL VAX cluster under VMS. The MINGL database system for TFTR is composed on the VAX. This document describes the overall system in terms of how the various parts interact

  7. StreamWorks - A system for Dynamic Graph Search

    SciTech Connect (OSTI)

    Choudhury, Sutanay; Holder, Larry; Chin, George; Ray, Abhik; Beus, Sherman J.; Feo, John T.

    2013-06-11T23:59:59.000Z

    Acting on time-critical events by processing ever growing social media, news or cyber data streams is a major technical challenge. Many of these data sources can be modeled as multi-relational graphs. Mining and searching for subgraph patterns in a continuous setting requires an efficient approach to incremental graph search. The goal of our work is to enable real-time search capabilities for graph databases. This demonstration will present a dynamic graph query system that leverages the structural and semantic characteristics of the underlying multi-relational graph.

  8. DATABASE Open Access RAG: An update to the RNA-As-Graphs resource

    E-Print Network [OSTI]

    Schlick, Tamar

    DATABASE Open Access RAG: An update to the RNA-As-Graphs resource Joseph A Izzo1 , Namhee Kim1 utilize the benefits of relational database, and improvements to several of the utilities such as directed/labeled graphs and a subgraph search program. Conclusions: The RAG updates presented here augment the database

  9. REGULAR ENTRY IN ENCYCLOPEDIA OF DATABASE SYSTEMS

    E-Print Network [OSTI]

    Risch, Tore

    ://refworks.springer.com/database-systems/ DISTRIBUTED ARCHITECTURE Tore Risch, Uppsala University, Sweden, http://user.it.uu.se/~torer/ SYNONYMS Parallel database, federated database, multi-database, peer-to-peer database DEFINITION A distributed database is a database where data management is distributed over several nodes (computers) in a computer

  10. Intelligent Transportation Systems Deployment Statistics Database

    E-Print Network [OSTI]

    Intelligent Transportation Systems Deployment Statistics Database Oak Ridge National Laboratory direction. In addition, through the ITS Deployment Tracking web site, the database supports other users in 2010. Users can also download the entire 2010 deployment tracking database through the website

  11. Operational Equivalence of Graph Transformation Systems

    E-Print Network [OSTI]

    Sarna-Starosta, Beata

    Operational Equivalence of Graph Transformation Systems Frank Raiser and Thom Fr¨uhwirth Faculty. With the growing number of GTS- based applications the comparison of operational equivalence of two GTS becomes an important area of research. This work introduces a notion of operational equivalence for graph

  12. A graph-based system for network-vulnerability analysis

    SciTech Connect (OSTI)

    Swiler, L.P.; Phillips, C.

    1998-06-01T23:59:59.000Z

    This paper presents a graph-based approach to network vulnerability analysis. The method is flexible, allowing analysis of attacks from both outside and inside the network. It can analyze risks to a specific network asset, or examine the universe of possible consequences following a successful attack. The graph-based tool can identify the set of attack paths that have a high probability of success (or a low effort cost) for the attacker. The system could be used to test the effectiveness of making configuration changes, implementing an intrusion detection system, etc. The analysis system requires as input a database of common attacks, broken into atomic steps, specific network configuration and topology information, and an attacker profile. The attack information is matched with the network configuration information and an attacker profile to create a superset attack graph. Nodes identify a stage of attack, for example the class of machines the attacker has accessed and the user privilege level he or she has compromised. The arcs in the attack graph represent attacks or stages of attacks. By assigning probabilities of success on the arcs or costs representing level-of-effort for the attacker, various graph algorithms such as shortest-path algorithms can identify the attack paths with the highest probability of success.

  13. Benchmarking Database Systems A Systematic Approach

    E-Print Network [OSTI]

    Liblit, Ben

    Benchmarking Database Systems A Systematic Approach Dina Bitton David J. DeWitt Carolyn Turbyfill-81ER10920. #12;ABSTRACT This paper describes a customized database and a comprehensive set of queries that can be used for sys- tematic benchmarking of relational database systems. Designing this database

  14. March 23, 2008 Databases: Information Systems 1 Information Systems

    E-Print Network [OSTI]

    Adam, Salah

    March 23, 2008 Databases: Information Systems 1 Information Systems #12;March 23, 2008 Databases: Information Systems 2 Objectives What is an Information System (IS) + Classification of Information Systems + Evolution of Information Systems + Information System Management + Performance Requirements of ISs + #12

  15. CIS 330: Database Management Systems Course Number & Title (A.1) CIS 330: Database Management Systems

    E-Print Network [OSTI]

    Plotkin, Joshua B.

    CIS 330: Database Management Systems Course Number & Title (A.1) CIS 330: Database Management & Johannes Gehrke, Database Management Systems (third edition), McGraw Hill. Additional materials as handouts, e.g., research papers Catalog Description (A.5a) Introduction to database management systems

  16. A graph-based network-vulnerability analysis system

    SciTech Connect (OSTI)

    Swiler, L.P.; Phillips, C.; Gaylor, T.

    1998-05-03T23:59:59.000Z

    This paper presents a graph based approach to network vulnerability analysis. The method is flexible, allowing analysis of attacks from both outside and inside the network. It can analyze risks to a specific network asset, or examine the universe of possible consequences following a successful attack. The analysis system requires as input a database of common attacks, broken into atomic steps, specific network configuration and topology information, and an attacker profile. The attack information is matched with the network configuration information and an attacker profile to create a superset attack graph. Nodes identify a stage of attack, for example the class of machines the attacker has accessed and the user privilege level he or she has compromised. The arcs in the attack graph represent attacks or stages of attacks. By assigning probabilities of success on the arcs or costs representing level of effort for the attacker, various graph algorithms such as shortest path algorithms can identify the attack paths with the highest probability of success.

  17. A graph-based network-vulnerability analysis system

    SciTech Connect (OSTI)

    Swiler, L.P.; Phillips, C. [Sandia National Labs., Albuquerque, NM (United States); Gaylor, T. [3M, Austin, TX (United States). Visual Systems Div.

    1998-01-01T23:59:59.000Z

    This report presents a graph-based approach to network vulnerability analysis. The method is flexible, allowing analysis of attacks from both outside and inside the network. It can analyze risks to a specific network asset, or examine the universe of possible consequences following a successful attack. The analysis system requires as input a database of common attacks, broken into atomic steps, specific network configuration and topology information, and an attacker profile. The attack information is matched with the network configuration information and an attacker profile to create a superset attack graph. Nodes identify a stage of attack, for example the class of machines the attacker has accessed and the user privilege level he or she has compromised. The arcs in the attack graph represent attacks or stages of attacks. By assigning probabilities of success on the arcs or costs representing level-of-effort for the attacker, various graph algorithms such as shortest-path algorithms can identify the attack paths with the highest probability of success.

  18. Concurrency control in heterogeneous distributed database systems

    E-Print Network [OSTI]

    Rahman, Md. Rezaur

    1992-01-01T23:59:59.000Z

    APPROACHES IN HDDBS . III. A Approaches Requiring Local DBMS Modihcations 17 19 III. B Approaches Without Local DBMS Modifications 22 IV A NEW APPROACH TO HDDBS CONCURRENCY CONTROL 30 IV. A The Concurrency Control Scheme 30 CIIA PTER Page IV. B... related to Database Systems in general which will be used consistently throughout this thesis. A Database system (DBS) consists of a set of dutiibiises (DB) which contain the data of interest and software, the database msnageinent system (DBMS), which...

  19. Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke 1 Database Management Systems

    E-Print Network [OSTI]

    Li, Yanjun "Lisa"

    What Is a DBMS? A database is a collection of data. Models real-world enterprise, e.g. university System (DBMS) is a software package designed to store and manage databases. #12;Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke 3 Why we need DBMS Huge amount of data is available. Users need

  20. 6.893 Database Systems, Fall 2004

    E-Print Network [OSTI]

    Madden, Samuel R. (Samuel Ross), 1976-

    This course is designed to introduce graduate students to the foundations of database systems, focusing on basics such as the relational algebra and data model, query optimization, query processing, and transactions. This ...

  1. CS 525: Advanced Database Organization Study of relational, semantic, and object-oriented data models and interfaces. Database management system

    E-Print Network [OSTI]

    Heller, Barbara

    CS 525: Advanced Database Organization Objectives Study of relational, semantic, and object-oriented data models and interfaces. Database management system techniques for query optimization, concurrency History of database management. Goals of database system development. Relational systems Data models

  2. Database System Concepts, 5th Ed. Silberschatz, Korth and Sudarshan

    E-Print Network [OSTI]

    Dragan, Feodor F.

    Concepts - 5th Edition, May 23, 2005 Database Management System (DBMS) DBMS contains information about

  3. Exam revision Database Systems Lecture 18

    E-Print Network [OSTI]

    Alechina, Natasha

    revision Example (coursework 5) · {Film} {Certificate} is a non-trivial functional dependency · {Cinema(A,B,C), candidate keys (A,B) and (A,C), fd B C. #12;Exam revision Example (coursework 5) · Relation ListingExam revision Database Systems Lecture 18 Natasha Alechina #12;Exam revision In This Lecture · Exam

  4. Exam revision Database Systems Lecture 18

    E-Print Network [OSTI]

    Alechina, Natasha

    ,B) and (A,C), fd B C. #12;3 Exam revision Example (coursework 5) · Relation Listing is not in 2NF because1 Exam revision Database Systems Lecture 18 Natasha Alechina Exam revision In This Lecture · Exam format · Main topics · How to revise Exam revision Exam format · Answer three questions out of five

  5. A Methodology Database System Performance Evaluation

    E-Print Network [OSTI]

    Liblit, Ben

    A Methodology for Database System Performance Evaluation Haran Boral Computer Science Department Technion - Israel Institute of Technology David J. DeWitt Computer Sciences Department University82-01870 and the Department of Energy under contract #DE-AC02-81ER10920. #12;ABSTRACT This paper

  6. Database System Concepts, 5th Ed. Silberschatz, Korth and Sudarshan

    E-Print Network [OSTI]

    Dragan, Feodor F.

    Database System Concepts, 5th Ed. ©Silberschatz, Korth and Sudarshan See www.db-book.com for conditions on re-use Chapter 7: Relational Database DesignChapter 7: Relational Database Design #12;©Silberschatz, Korth and Sudarshan7.2Database System Concepts - 5th Edition, Oct 5, 2006 Chapter 7: Relational

  7. REALTIME DATABASE SYSTEMS: ARCHITECTURE AND TECHNIQUES

    E-Print Network [OSTI]

    Ramamritham, Krithi

    monitoring 175 13.3 ECA rule extended with temporal attributes 178 13.4 Response time in a real­time system using ECA paradigm. 182 14.1 A Real Time Database System 188 14.2 Maximum Age (MA) and Unapplied Update (UU) 192 14.3 Inter­arrival distribution of the stock price updates of G.E. on 94/1/3. 194 14

  8. Technology Portfolio Planning by Weighted Graph Analysis of System Architectures

    E-Print Network [OSTI]

    de Weck, Olivier L.

    Technology Portfolio Planning by Weighted Graph Analysis of System Architectures Peter Davison and Bruce Cameron Massachusetts Institute of Technology, Cambridge, MA 02139 Edward F. Crawley Skolkovo Institute of Science and Technology, Skolkovo 143025, Russia Abstract5 Many systems undergo significant

  9. Support graph preconditioners for sparse linear systems

    E-Print Network [OSTI]

    Gupta, Radhika

    2005-02-17T23:59:59.000Z

    . In this thesis, we develop support graph preconditioners for symmetric positive de?nite matrices that arise from the ?nite element discretization of elliptic partial di?erential equations. An object oriented code is developed for the construction, integration...

  10. Database System Concepts, 5th Ed. Silberschatz, Korth and Sudarshan

    E-Print Network [OSTI]

    Dragan, Feodor F.

    Database System Concepts, 5th Ed. ©Silberschatz, Korth and Sudarshan See www and Sudarshan2.2Database System Concepts - 5th Edition, Oct 5, 2006 Chapter 2: Relational ModelChapter 2: Relational Model Structure of Relational Databases Fundamental Relational-Algebra-Operations Additional

  11. Database System Concepts, 5th Ed. Silberschatz, Korth and Sudarshan

    E-Print Network [OSTI]

    Dragan, Feodor F.

    Database System Concepts, 5th Ed. ©Silberschatz, Korth and Sudarshan See www.2Database System Concepts, 5th Edition, Oct 5. 2006 Chapter 4: Advanced SQLChapter 4: Advanced SQL SQL Data Constructs** Recursive Queries** Advanced SQL Features** #12;©Silberschatz, Korth and Sudarshan4.3Database

  12. Database System Concepts, 5th Ed. Silberschatz, Korth and Sudarshan

    E-Print Network [OSTI]

    Dragan, Feodor F.

    Database System Concepts, 5th Ed. ©Silberschatz, Korth and Sudarshan See www;©Silberschatz, Korth and Sudarshan6.2Database System Concepts - 5th Edition, Oct 5, 2006 Chapter 6: Entity Design Issues Weak Entity Sets Extended E-R Features Design of the Bank Database Reduction to Relation

  13. Query execution in column-oriented database systems

    E-Print Network [OSTI]

    Abadi, Daniel J

    2008-01-01T23:59:59.000Z

    There are two obvious ways to map a two-dimension relational database table onto a one-dimensional storage interface: store the table row-by-row, or store the table column-by-column. Historically, database system implementations ...

  14. TWRS information locator database system administrator`s manual

    SciTech Connect (OSTI)

    Knutson, B.J., Westinghouse Hanford

    1996-09-13T23:59:59.000Z

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

  15. The TROPOS Analysis Process as Graph Transformation System Paolo Bresciani

    E-Print Network [OSTI]

    Trento-Povo, Italy Abstract Tropos is an agent-oriented methodology that covers soft- ware developmentThe TROPOS Analysis Process as Graph Transformation System Paolo Bresciani ITC-irst via Sommarive of the operational environment of the new software system. In earlier work we have characterized the process of early

  16. COSC6340: Database Systems Instructor: Carlos Ordonez

    E-Print Network [OSTI]

    Ordonez, Carlos

    available. Topics include the following. Database design: ER model, relational model and algebra, indexing data structures, query optimizer, concurrency control, transaction processing, recovery. Advanced

  17. Implementation of the CORAL Deductive Database System Raghu Ramakrishnan

    E-Print Network [OSTI]

    Sudarshan, S.

    Implementation of the CORAL Deductive Database System Raghu Ramakrishnan Univ. of Wisconsin Seshadri Univ. of Wisconsin, Madison Abstract CORAL is a deductive database system that provides a modu- lar, declarative query language/programming language. CORAL is a deductive system that supports a rich

  18. Implementation of the CORAL Deductive Database System \\Lambda Raghu Ramakrishnan

    E-Print Network [OSTI]

    Sudarshan, S.

    Implementation of the CORAL Deductive Database System \\Lambda Raghu Ramakrishnan Univ. of Wisconsin Seshadri Univ. of Wisconsin, Madison Abstract CORAL is a deductive database system that provides a modu­ lar, declarative query language/programming language. CORAL is a deductive system that supports a rich

  19. Soft Biometrics Database: A Benchmark For Keystroke Dynamics Biometric Systems

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    Soft Biometrics Database: A Benchmark For Keystroke Dynamics Biometric Systems Syed Zulkarnain Syed authentication resulting in a more se- cure verification system. Soft biometrics allows a refinement the existing biometric modalities, authentication systems based on keystroke dynamics are particularly

  20. Medical Multimedia and Multimodality Databases Systems Peter L. Stanchev

    E-Print Network [OSTI]

    Stanchev, Peter

    multimedia systems, Medical images, Databases 1. INTRODCTION Recent advances in computer technologyMedical Multimedia and Multimodality Databases Systems Peter L. Stanchev Kettering University, Michigan, 48202 USA fotouhi@cs.wayne.edu ABSTRACT In this paper we make a review of some medical

  1. Fuzzy Queries in Multimedia Database Systems Ronald Fagin

    E-Print Network [OSTI]

    Fagin, Ron

    Fuzzy Queries in Multimedia Database Systems Ronald Fagin IBM Almaden Research Center Sati Jose, CA differencesbetween multimedia databases (which may contain complicated objects, such as images), and traditional typos of queries. Wr example, in a multimedia databaseit is reasonable and natural to ask for images

  2. An Adaptive Policy for Improved Timeliness in Secure Database Systems

    E-Print Network [OSTI]

    Son, Sang H.

    An Adaptive Policy for Improved Timeliness in Secure Database Systems Sang H. Son * , Rasikan David. Multilevel security requirements introduce a new dimension to transaction processing in real­time database Timeliness, concurrency control, two­phase locking, non­interference, security, miss percentage 1

  3. Preserving con dentiality when sharing medical database the Cellsecu system

    E-Print Network [OSTI]

    Chen, Sheng-Wei

    , with the rapid advances in the computerization of medical data, the question of protecting medical recordsPreserving con dentiality when sharing medical database the Cellsecu system Yu-Cheng Chiang y that contains sensitive information in medical database by automatically removing, generalizing, and expanding

  4. Database System Concepts Silberschatz, Korth and Sudarshan

    E-Print Network [OSTI]

    Dragan, Feodor F.

    : Application Design and Development User Interfaces and Tools Web Interfaces to Databases Web Fundamentals Servlets and JSP Building Large Web Applications Triggers Authorization in SQL Application Security #12 user interfaces Report generators Data analysis tools (see Chapter 18) Many interfaces are Web

  5. Detecting and tolerating Byzantine faults in database systems

    E-Print Network [OSTI]

    Vandiver, Benjamin Mead, 1978-

    2008-01-01T23:59:59.000Z

    This thesis describes the design, implementation, and evaluation of a replication scheme to handle Byzantine faults in transaction processing database systems. The scheme compares answers from queries and updates on multiple ...

  6. Detecting and Tolerating Byzantine Faults in Database Systems

    E-Print Network [OSTI]

    Vandiver, Benjamin Mead

    2008-06-30T23:59:59.000Z

    This thesis describes the design, implementation, and evaluation of a replication scheme to handle Byzantine faults in transaction processing database systems. The scheme compares answers from queries and updates on multiple ...

  7. Parallel Database Systems: The Future of High Performance Database Processing1

    E-Print Network [OSTI]

    Scheuermann, Peter

    systems are beginning to displace traditional mainframe computers for the largest database and transaction to double while processor speeds were predicted to increase by much larger factors. Consequently, critics by the Defense Advanced Research Projects Agency under contract N00039-86-C-0578, by the National Science

  8. Exploring Power-Performance Tradeoffs in Database Systems

    E-Print Network [OSTI]

    Tu, Yicheng

    explore the potential of power conservation in relational database management systems. We hypothesize that, power management has become a critical issue in system design and implementation [26]. Various sources the above costs are calculated directly from energy consumption, power (i.e., energy consumption per unit

  9. Modularization of the DADAISM Ada Database System Architecture

    E-Print Network [OSTI]

    Keller, Arthur M.

    the modularization of a new data- base management system architecture. This DBMS is not intended to be viewed 22, 1986 at Beijing, China. of modulespeci cations for a DBMS, which can be used to support any implemen- tation paradigm is necessary to handle the evolution of database systems over the next few

  10. Modularization of the DADAISM Ada Database System Architecture

    E-Print Network [OSTI]

    Keller, Arthur M.

    the modularization of a new data­ base management system architecture. This DBMS is not intended to be viewed--22, 1986 at Beijing, China. of module specifications for a DBMS, which can be used to support any of those implemen­ tation paradigm is necessary to handle the evolution of database systems over the next few

  11. Novel storage architectures and pointer-free search trees for database systems 

    E-Print Network [OSTI]

    Vasaitis, Vasileios

    2012-06-25T23:59:59.000Z

    Database systems research is an old and well-established field in computer science. Many of the key concepts appeared as early as the 60s, while the core of relational databases, which have dominated the database world ...

  12. The design and implementation of the buffer manager for an experimental relational database management system

    E-Print Network [OSTI]

    Li, Zaichun

    1994-01-01T23:59:59.000Z

    Buffer management is an essential component of database management. This thesis presents a design and implementation of the buffer manager for an experimental relational database management system. The relationship and difference between database...

  13. Glue Microarray Database System Using Struts Technology

    E-Print Network [OSTI]

    Church, George M.

    ;JSP (Java Server Page) #12;Evolution We've seen a lot in 6 years... AWT(1995) ­Servlets(1996)-- Swing Editing Data Format Error Handling File System plus DBMS #12;Major Engineering Features (cont...): Access

  14. System information database: an automated maintenance aid

    SciTech Connect (OSTI)

    Brice, L.; Connell, J.

    1984-01-01T23:59:59.000Z

    This paper is a case study of how one DP organization applied student labor and a relational DBMS in a prototyping environment to automate much of their applications systems documentation function. The capabilities, fringe benefits and future enhancements of the tool are discussed.

  15. Stress Testing of Transactional Database Systems Jorge Augusto Meira

    E-Print Network [OSTI]

    Boyer, Edmond

    of Montpellier, France patrick.valduriez@inria.fr Abstract. Transactional database management systems (DBMS) have-based applications that tend to generate huge numbers of concurrent business operations are pushing DBMS performance to test DBMS performance under heavy workload conditions. Answering this question requires a testing

  16. The Database Driven ATLAS Trigger Configuration System

    E-Print Network [OSTI]

    Martyniuk, Alex; The ATLAS collaboration

    2015-01-01T23:59:59.000Z

    This contribution describes the trigger selection configuration system of the ATLAS low- and high-level trigger (HLT) and the upgrades it received in preparation for LHC Run 2. The ATLAS trigger configuration system is responsible for applying the physics selection parameters for the online data taking at both trigger levels and the proper connection of the trigger lines across those levels. Here the low-level trigger consists of the already existing central trigger (CT) and the new Level-1 Topological trigger (L1Topo), which has been added for Run 2. In detail the tasks of the configuration system during the online data taking are Application of the selection criteria, e.g. energy cuts, minimum multiplicities, trigger object correlation, at the three trigger components L1Topo, CT, and HLT On-the-fly, e.g. rate-dependent, generation and application of prescale factors to the CT and HLT to adjust the trigger rates to the data taking conditions, such as falling luminosity or rate spikes in the detector readout ...

  17. DATATRIEVE used in a control-system database

    SciTech Connect (OSTI)

    Greene, N.E.

    1983-01-01T23:59:59.000Z

    Process control of the Proton Storage Ring at Los Alamos will be accomplished by LSI-11/23 computers networked with a VAX-11/750. The database contains descriptions, status, and parameters of the hardware channels and equipment connected to the LSIs. Database entry and processing occur on the VAX, largely through DATATRIEVE user-friendly procedures. Data validity is checked during and after data entry by DATATRIEVE and FORTRAN language procedures. The database then is distilled into a machine-efficient form and distributed to the LSIs and VAX for use by the process-control software. This paper includes an overview of our application, an overview of DATATRIEVE, examples of DATATRIEVE concepts, features of DATATRIEVE that have been especially useful, features of DATATRIEVE that have been troublesome in this project, notes about the conversion from DATATRIEVE-11 to VAX-11 DATATRIEVE, and observations on data-management software in a control-system environment.

  18. TABLEFS: Embedding a NoSQL Database Inside the Local File System

    E-Print Network [OSTI]

    monolithic database management system (DBMS) bundles [31]. 1 Background Even in the era of big data, most local file systems [34]. Embedded Databases File system metadata is structured data, a natural fit

  19. Storage device sizing for a hybrid railway traction system by means of bicausal bond graphs

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    (a supercapacitor) included in this system is then discussed. Keywords: bond graph, bicausality In the paper, the example of a supercapacitor process consists of choosing the system structure dimensioning

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

    SciTech Connect (OSTI)

    Dunietz, Jesse N.; /MIT /SLAC

    2011-06-22T23:59:59.000Z

    To ease the tasks of Monte Carlo (MC) simulation and event reconstruction (i.e. inferring particle-decay events from experimental data) for long-term BaBar data preservation and analysis, the following software components have been designed: a language ('GraphPhys') for specifying decay processes, common to both simulation and data analysis, allowing arbitrary parameters on particles, decays, and entire processes; an automated visualization tool to show graphically what decays have been specified; and a searchable database storage mechanism for decay specifications. Unlike HepML, a proposed XML standard for HEP metadata, the specification language is designed not for data interchange between computer systems, but rather for direct manipulation by human beings as well as computers. The components are interoperable: the information parsed from files in the specification language can easily be rendered as an image by the visualization package, and conversion between decay representations was implemented. Several proof-of-concept command-line tools were built based on this framework. Applications include building easier and more efficient interfaces to existing analysis tools for current projects (e.g. BaBar/BESII), providing a framework for analyses in future experimental settings (e.g. LHC/SuperB), and outreach programs that involve giving students access to BaBar data and analysis tools to give them a hands-on feel for scientific analysis.

  1. Importing Abstract Spatial Data into the SAND Database System Hanan Samet

    E-Print Network [OSTI]

    Samet, Hanan

    Importing Abstract Spatial Data into the SAND Database System Hanan Samet Frantisek Brabec Jagan-like interface that allows data to be manually edited before imported into the database. This approach. We present a system that makes a centrally stored spatial database available to off-site users

  2. Raman Database Considerations for Near-Infrared Systems

    SciTech Connect (OSTI)

    Kunkel, Brenda M.; Su, Yin-Fong; Tonkyn, Russell G.; Stephan, Eric G.; Joly, Alan G.; Birnbaum, Jerome C.; Jarman, Kristin H.; Johnson, Timothy J.

    2011-12-21T23:59:59.000Z

    For Raman spectroscopy the ability to detect is often limited by the existence and quality of the reference library to which field spectra are compared. Developing such databases is often labor- and resource-intensive; typically the generated data are not transferred to other instruments. Still other considerations may exist for comparing data at visible and ultraviolet excitation wavelengths such as resonance enhancement. However, for the common near-infrared wavelengths of 785, 830, 960, 1047 and 1064 nm where this is normally of a lesser concern, it is logical to consider whether data can be ported from one spectrometer to another so as to obviate the expensive and time-consuming process of generating reference data for each system. The present experiment generated a list of 125 chemical and common substances and formed a database from their corresponding 1064 nm spectra. The same molecules were then measured using a 785 nm system the new spectra were treated as “unknowns” and compared to the 1064 nm database using a commercial search algorithm. We found that at least 108 of the 125 spectra recorded at 785 nm were correctly identified using the search algorithm. For the few that were incorrectly identified, in most cases the spectra were extremely similar or the 785 nm signal was degraded due to fluorescence, as would occur regardless of reference data. Our results indicate that if the spectrometers are properly calibrated on both their wavelength and intensity axes, “foreign” data recorded at a different NIR wavelength can be successfully used as reference libraries

  3. Generic Natural Systems Evaluation - Thermodynamic Database Development and Data Management

    SciTech Connect (OSTI)

    Wolery, T W; Sutton, M

    2011-09-19T23:59:59.000Z

    Thermodynamic data are essential for understanding and evaluating geochemical processes, as by speciation-solubility calculations, reaction-path modeling, or reactive transport simulation. These data are required to evaluate both equilibrium states and the kinetic approach to such states (via the affinity term or its equivalent in commonly used rate laws). These types of calculations and the data needed to carry them out are a central feature of geochemistry in many applications, including water-rock interactions in natural systems at low and high temperatures. Such calculations are also made in engineering studies, for example studies of interactions involving man-made materials such as metal alloys and concrete. They are used in a fairly broad spectrum of repository studies where interactions take place among water, rock, and man-made materials (e.g., usage on YMP and WIPP). Waste form degradation, engineered barrier system performance, and near-field and far-field transport typically incorporate some level of thermodynamic modeling, requiring the relevant supporting data. Typical applications of thermodynamic modeling involve calculations of aqueous speciation (which is of great importance in the case of most radionuclides), solubilities of minerals and related solids, solubilities of gases, and stability relations among the various possible phases that might be present in a chemical system at a given temperature and pressure. If a phase can have a variable chemical composition, then a common calculational task is to determine that composition. Thermodynamic modeling also encompasses ion exchange and surface complexation processes. Any and all of these processes may be important in a geochemical process or reactive transport calculation. Such calculations are generally carried out using computer codes. For geochemical modeling calculations, codes such as EQ3/6 and PHREEQC, are commonly used. These codes typically provide 'full service' geochemistry, meaning that they use a large body of thermodynamic data, generally from a supporting database file, to sort out the various important reactions from a wide spectrum of possibilities, given specified inputs. Usually codes of this kind are used to construct models of initial aqueous solutions that represent initial conditions for some process, although sometimes these calculations also represent a desired end point. Such a calculation might be used to determine the major chemical species of a dissolved component, the solubility of a mineral or mineral-like solid, or to quantify deviation from equilibrium in the form of saturation indices. Reactive transport codes such as TOUGHREACT and NUFT generally require the user to determine which chemical species and reactions are important, and to provide the requisite set of information including thermodynamic data in an input file. Usually this information is abstracted from the output of a geochemical modeling code and its supporting thermodynamic data file. The Yucca Mountain Project (YMP) developed two qualified thermodynamic databases to model geochemical processes, including ones involving repository components such as spent fuel. The first of the two (BSC, 2007a) was for systems containing dilute aqueous solutions only, the other (BSC, 2007b) for systems involving concentrated aqueous solutions and incorporating a model for such based on Pitzer's (1991) equations. A 25 C-only database with similarities to the latter was also developed for the Waste Isolation Pilot Plant (WIPP, cf. Xiong, 2005). The NAGRA/PSI database (Hummel et al., 2002) was developed to support repository studies in Europe. The YMP databases are often used in non-repository studies, including studies of geothermal systems (e.g., Wolery and Carroll, 2010) and CO2 sequestration (e.g., Aines et al., 2011).

  4. Probabilistic regular graphs

    E-Print Network [OSTI]

    Bertrand, Nathalie; 10.4204/EPTCS.39.6

    2010-01-01T23:59:59.000Z

    Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extension of regular graphs obtained by labelling the terminal arcs of the graph grammars by probabilities. Stochastic properties of these graphs are expressed using PCTL, a probabilistic extension of computation tree logic. We present here an algorithm to perform approximate verification of PCTL formulae. Moreover, we prove that the exact model-checking problem for PCTL on probabilistic regular graphs is undecidable, unless restricting to qualitative properties. Our results generalise those of EKM06, on probabilistic pushdown automata, using similar methods combined with graph grammars techniques.

  5. Fear and desire in systems design : negotiating database usefulness

    E-Print Network [OSTI]

    Agrawal, Tanu

    2008-01-01T23:59:59.000Z

    Databases are ubiquitous. They are used for a host of functions including coordination, decision making, and memory archiving. Despite their importance and ubiquity, databases continue to frustrate us, often departing from ...

  6. Database Updating Through User Feedback in Fingerprint-Based Wi-Fi Location Systems

    E-Print Network [OSTI]

    Sekercioglu, Y. Ahmet

    Database Updating Through User Feedback in Fingerprint-Based Wi-Fi Location Systems Thomas- Fi signals. It first requires the construction of a database of "fingerprints", i.e. signal strengths it with the different reference fingerprints in the database. The main disadvantage of this technique is the labour

  7. National Ambient Radiation Database

    SciTech Connect (OSTI)

    Dziuban, J.; Sears, R.

    2003-02-25T23:59:59.000Z

    The U.S. Environmental Protection Agency (EPA) recently developed a searchable database and website for the Environmental Radiation Ambient Monitoring System (ERAMS) data. This site contains nationwide radiation monitoring data for air particulates, precipitation, drinking water, surface water and pasteurized milk. This site provides location-specific as well as national information on environmental radioactivity across several media. It provides high quality data for assessing public exposure and environmental impacts resulting from nuclear emergencies and provides baseline data during routine conditions. The database and website are accessible at www.epa.gov/enviro/. This site contains (1) a query for the general public which is easy to use--limits the amount of information provided, but includes the ability to graph the data with risk benchmarks and (2) a query for a more technical user which allows access to all of the data in the database, (3) background information on ER AMS.

  8. System Support for Software Fault Tolerance in Highly Available Database Management Systems

    E-Print Network [OSTI]

    California at Irvine, University of

    of several techniques for early error detection and fast recovery in a database management system (DBMS system and the IMS DBMS and DB2 DBMS. The study classifies errors by the type of coding mistake system allow the DBMS to guard (write-protect) #12;2 some of its internal data structures. Guarding DBMS

  9. NATional CARBon Sequestration Database and Geographic Information System (NATCARB)

    SciTech Connect (OSTI)

    Timothy R. Carr

    2006-01-09T23:59:59.000Z

    This report provides a brief summary of the milestone for Quarter 1 of 2006 of the NATional CARBon Sequestration Database and Geographic Information System (NATCARB) This milestone assigns consistent symbology to the ''National CO{sub 2} Facilities'' GIS layer on the NATCARB website. As a default, CO{sub 2} sources provided by the Regional Carbon Sequestration Partnerships and the National Group are now all one symbol type. In addition for sinks such as oil and gas fields where data is drawn from multiple partnerships, the symbology is given a single color. All these modifications are accomplished as the layer is passed through the national portal (www.natcarb.org). This documentation is sent to National Energy Technology Laboratory (NETL) as a Topical Report and will be included in the next Annual Report.

  10. 1.264J / ESD.264J Database, Internet, and Systems Integration Technologies, Fall 2006

    E-Print Network [OSTI]

    Kocur, George

    This course is an intensive review of information technology. It covers topics in software development methods, data modeling and databases, application development, Web standards and development, system integration, ...

  11. Evaluation of Concurrency Control Strategies for Mixed Soft Real-Time Database Systems

    E-Print Network [OSTI]

    Cheng, Reynold Cheng Chun

    1 Evaluation of Concurrency Control Strategies for Mixed Soft Real-Time Database Systems Kam soft real-time database systems (MSRTDBS), in which both non-real-time and soft real-time transactions of both soft real-time and non-real-time transactions under different real-time supports in the system

  12. First Steps toward Automated Design of Mechatronic Systems Using Bond Graphs and Genetic Programming

    E-Print Network [OSTI]

    Fernandez, Thomas

    , mechanical, hydraulic, pneumatic, and thermal components, making it difficult to design a system to meetFirst Steps toward Automated Design of Mechatronic Systems Using Bond Graphs and Genetic@egr.msu.edu 1 OVERVIEW OF THE WORK This paper suggests a method for automatically synthesizing designs

  13. Bond Graph Modeling of Centrifugal Compressor System Nur Uddin and Jan Tommy Gravdahl

    E-Print Network [OSTI]

    Gravdahl, Jan Tommy

    Bond Graph Modeling of Centrifugal Compressor System Nur Uddin and Jan Tommy Gravdahl Dept, Norway N-7491 nur.uddin@itk.ntnu.no, Jan.Tommy.Gravdahl@itk.ntnu.no Keywords: Compressor, compressor. A model of a compression system with recycle flow is derived in this work. 1. INTRODUCTION Compressors

  14. A functional central limit theorem for interacting particle systems on transitive graphs

    E-Print Network [OSTI]

    Paul Doukhan; Gabriel Lang; Sana Louhichi; Bernard Ycart

    2007-04-12T23:59:59.000Z

    A finite range interacting particle system on a transitive graph is considered. Assuming that the dynamics and the initial measure are invariant, the normalized empirical distribution process converges in distribution to a centered diffusion process. As an application, a central limit theorem for certain hitting times, interpreted as failure times of a coherent system in reliability, is derived.

  15. Hierarchical graphs for better annotations of rule-based models of biochemical systems

    SciTech Connect (OSTI)

    Hu, Bin [Los Alamos National Laboratory; Hlavacek, William [Los Alamos National Laboratory

    2009-01-01T23:59:59.000Z

    In the graph-based formalism of the BioNetGen language (BNGL), graphs are used to represent molecules, with a colored vertex representing a component of a molecule, a vertex label representing the internal state of a component, and an edge representing a bond between components. Components of a molecule share the same color. Furthermore, graph-rewriting rules are used to represent molecular interactions, with a rule that specifies addition (removal) of an edge representing a class of association (dissociation) reactions and with a rule that specifies a change of vertex label representing a class of reactions that affect the internal state of a molecular component. A set of rules comprises a mathematical/computational model that can be used to determine, through various means, the system-level dynamics of molecular interactions in a biochemical system. Here, for purposes of model annotation, we propose an extension of BNGL that involves the use of hierarchical graphs to represent (1) relationships among components and subcomponents of molecules and (2) relationships among classes of reactions defined by rules. We illustrate how hierarchical graphs can be used to naturally document the structural organization of the functional components and subcomponents of two proteins: the protein tyrosine kinase Lck and the T cell receptor (TCR)/CD3 complex. Likewise, we illustrate how hierarchical graphs can be used to document the similarity of two related rules for kinase-catalyzed phosphorylation of a protein substrate. We also demonstrate how a hierarchical graph representing a protein can be encoded in an XML-based format.

  16. A Flexible Image Retrieval and Multimedia Presentation Management System for Multimedia Databases

    E-Print Network [OSTI]

    Chen, Shu-Ching

    A Flexible Image Retrieval and Multimedia Presentation Management System for Multimedia Databases, multimedia data is becoming more and more common in daily applications, however this data is nearly useless. In this demonstration, we present a multimedia query and presentation management system for multimedia databases

  17. PATSEEK: Content Based Image Retrieval System for Patent Database Avinash Tiwari1

    E-Print Network [OSTI]

    Bansal, Veena

    PATSEEK: Content Based Image Retrieval System for Patent Database Avinash Tiwari1 , Veena Bansal2 1,2 Industrial and Management Engineering Department IIT Kanpur 208016 India 2 veena@iitk.ac.in ABSTRACT A patent the patent database. In this paper, we describe PATSEEK that is an image based search system for US patent

  18. Design, implementation, and benchmarking of a file manager for a relational database management system on a raw UNIX disk

    E-Print Network [OSTI]

    Narayanan, Pudugramam Shanker

    1994-01-01T23:59:59.000Z

    The file management component of a database management system (DBMS) has to be tailor designed to meet the performance demands of large database applications. The operating system (OS) file systems are typically not suitable for storing...

  19. Vacuum Energy in Quantum Graphs

    E-Print Network [OSTI]

    Wilson, Justin

    2007-07-14T23:59:59.000Z

    We calculate the vacuum energy in quantum graphs. Vacuum energy arose in quantum physics but has an independent mathematical interest as a functional carrying information about the eigenvalue spectrum of a system. A quantum graph is a metric graph...

  20. Limits on the network sensitivity function for homogeneous multi-agent systems on a graph

    E-Print Network [OSTI]

    Murray, Richard M.

    in feedback control of interconnected multi- agent systems, focused on the network sensitivity functions. We linear dynamics and we model the interconnection topology as a graph, in which the single agents], edge agreement [5], [6], linear quadratic regulator [7], decomposition and linear matrix inequalities

  1. The Nuclear Science References (NSR) Database and Web Retrieval System

    E-Print Network [OSTI]

    Pritychenko, B; Kellett, M A; Singh, B; Totans, J

    2011-01-01T23:59:59.000Z

    The Nuclear Science References (NSR) database, and associated Web inter- face, is the world's only comprehensive source of easily accessible low- and intermediate-energy nuclear physics bibliographic information for more than 200,000 articles since the beginning of nuclear science. The weekly-updated NSR database provides essential support for nuclear data evaluation, com- pilation and research activities. The principles of the database and Web application development and maintenance are described. Examples of nuclear structure, reaction and decay applications are specifically included. The complete NSR database is freely available at the websites of the National Nuclear Data Center http://www.nndc.bnl.gov/nsr and the International Atomic Energy Agency http://www-nds.iaea.org/nsr.

  2. DYNAMIC CONFIGURATION OF DATAFLOW GRAPH TOPOLOGY FOR DSP SYSTEM DESIGN Dong-Ik Ko and Shuvra S. Bhattacharyya

    E-Print Network [OSTI]

    Bhattacharyya, Shuvra S.

    DYNAMIC CONFIGURATION OF DATAFLOW GRAPH TOPOLOGY FOR DSP SYSTEM DESIGN Dong-Ik Ko and Shuvra S dynamic port can keep the model bounded. However, control flow depends on FSMs. Using FSMs for minor changes of control flow with data- flow graphs can make application models unnecessarily compli- cated

  3. Computer systems and methods for the query and visualization of multidimensional database

    SciTech Connect (OSTI)

    Stolte, Chris; Tang, Diane L.; Hanrahan, Patrick

    2010-05-11T23:59:59.000Z

    A method and system for producing graphics. A hierarchical structure of a database is determined. A visual table, comprising a plurality of panes, is constructed by providing a specification that is in a language based on the hierarchical structure of the database. In some cases, this language can include fields that are in the database schema. The database is queried to retrieve a set of tuples in accordance with the specification. A subset of the set of tuples is associated with a pane in the plurality of panes.

  4. Computer systems and methods for the query and visualization of multidimensional databases

    DOE Patents [OSTI]

    Stolte, Chris; Tang, Diane L.; Hanrahan, Patrick

    2006-08-08T23:59:59.000Z

    A method and system for producing graphics. A hierarchical structure of a database is determined. A visual table, comprising a plurality of panes, is constructed by providing a specification that is in a language based on the hierarchical structure of the database. In some cases, this language can include fields that are in the database schema. The database is queried to retrieve a set of tuples in accordance with the specification. A subset of the set of tuples is associated with a pane in the plurality of panes.

  5. UNIT SELECTION IN A CONCATENATIVE SPEECH SYNTHESIS SYSTEM USING A LARGE SPEECH DATABASE

    E-Print Network [OSTI]

    Black, Alan W

    UNIT SELECTION IN A CONCATENATIVE SPEECH SYNTHESIS SYSTEM USING A LARGE SPEECH DATABASE Andrew J of natural­sounding syn­ thesized speech waveforms is to select and concatenate units from a large speech by concatenating the waveforms of units selected from large, single­speaker speech databases. The primary

  6. Evaluating the Effectiveness of Fault Tolerance in Replicated Database Management Systems

    E-Print Network [OSTI]

    -Olaf.Hvasshovd@idi.ntnu.no Abstract Database management systems (DBMS) achieve high availabilityand faulttolerance usuallyby of this study is two-fold. It eval- uates the effectiveness of DBMS fault tolerance in the pres- ence on database integrity, performance, and availability on a replicated DBMS, ClustRa[6], in the presence

  7. Progress on Statistical Learning Systems as Data Mining Tools for the Creation of Automatic Databases in Fusion Environments

    E-Print Network [OSTI]

    Progress on Statistical Learning Systems as Data Mining Tools for the Creation of Automatic Databases in Fusion Environments

  8. Asynchronous data change notification between database server and accelerator controls system

    SciTech Connect (OSTI)

    Fu, W.; Morris, J.; Nemesure, S.

    2011-10-10T23:59:59.000Z

    Database data change notification (DCN) is a commonly used feature. Not all database management systems (DBMS) provide an explicit DCN mechanism. Even for those DBMS's which support DCN (such as Oracle and MS SQL server), some server side and/or client side programming may be required to make the DCN system work. This makes the setup of DCN between database server and interested clients tedious and time consuming. In accelerator control systems, there are many well established software client/server architectures (such as CDEV, EPICS, and ADO) that can be used to implement data reflection servers that transfer data asynchronously to any client using the standard SET/GET API. This paper describes a method for using such a data reflection server to set up asynchronous DCN (ADCN) between a DBMS and clients. This method works well for all DBMS systems which provide database trigger functionality. Asynchronous data change notification (ADCN) between database server and clients can be realized by combining the use of a database trigger mechanism, which is supported by major DBMS systems, with server processes that use client/server software architectures that are familiar in the accelerator controls community (such as EPICS, CDEV or ADO). This approach makes the ADCN system easy to set up and integrate into an accelerator controls system. Several ADCN systems have been set up and used in the RHIC-AGS controls system.

  9. Tradespace exploration for space system architectures : a weighted graph framework

    E-Print Network [OSTI]

    Davison, Peter Leslie

    2014-01-01T23:59:59.000Z

    Many systems undergo significant architecture-level change during their lifecycles as a result of exogenous system disturbances (e.g. budget reduction or changes in stakeholder requirements), failure to develop critical ...

  10. Integrated Controlling System and Unified Database for High Throughput Protein Crystallography Experiments

    SciTech Connect (OSTI)

    Gaponov, Yu.A.; Igarashi, N.; Hiraki, M.; Sasajima, K.; Matsugaki, N.; Suzuki, M.; Kosuge, T.; Wakatsuki, S. [Structural Biology Research Center, Photon Factory, Institute of Materials Structure Science, High Energy Accelerator Research Organization, Tsukuba (Japan)

    2004-05-12T23:59:59.000Z

    An integrated controlling system and a unified database for high throughput protein crystallography experiments have been developed. Main features of protein crystallography experiments (purification, crystallization, crystal harvesting, data collection, data processing) were integrated into the software under development. All information necessary to perform protein crystallography experiments is stored (except raw X-ray data that are stored in a central data server) in a MySQL relational database. The database contains four mutually linked hierarchical trees describing protein crystals, data collection of protein crystal and experimental data processing. A database editor was designed and developed. The editor supports basic database functions to view, create, modify and delete user records in the database. Two search engines were realized: direct search of necessary information in the database and object oriented search. The system is based on TCP/IP secure UNIX sockets with four predefined sending and receiving behaviors, which support communications between all connected servers and clients with remote control functions (creating and modifying data for experimental conditions, data acquisition, viewing experimental data, and performing data processing). Two secure login schemes were designed and developed: a direct method (using the developed Linux clients with secure connection) and an indirect method (using the secure SSL connection using secure X11 support from any operating system with X-terminal and SSH support). A part of the system has been implemented on a new MAD beam line, NW12, at the Photon Factory Advanced Ring for general user experiments.

  11. Development of Energy Consumption Database Management System of Existing Large Public Buildings 

    E-Print Network [OSTI]

    Li, Y.; Zhang, J.; Sun, D.

    2006-01-01T23:59:59.000Z

    The statistic data of energy consumption are the base of analyzing energy consumption. The scientific management method of energy consumption data and the development of database management system plays an important role in building energy...

  12. Development of Energy Consumption Database Management System of Existing Large Public Buildings

    E-Print Network [OSTI]

    Li, Y.; Zhang, J.; Sun, D.

    2006-01-01T23:59:59.000Z

    The statistic data of energy consumption are the base of analyzing energy consumption. The scientific management method of energy consumption data and the development of database management system plays an important role in building energy...

  13. Framework for database and modelbase in an Information based Simulation system

    E-Print Network [OSTI]

    Ghoshal, Debashis

    1988-01-01T23:59:59.000Z

    at improving the performance of relational database management systems has progressed through both software and hardware approaches. Rapid progress is being made in the improved performance of relational DBMS. Hence in this research we apply a relational...

  14. Business intelligence systems and user's parameters: an application to a documents' database

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    on a cognitive user evolution is presented. This model when used together with a good definition by a relational database management system (DBMS). Also, from this data warehouse is extracted multidimensional

  15. Storage Management for Object-Oriented Database Management Systems: A Comparative Survey

    E-Print Network [OSTI]

    Waterloo, University of

    Storage Management for Object-Oriented Database Management Systems: A Comparative Survey David Dueck, Yiwen Jiang, and Archana Sawhney Contents 1 Introduction * * 71 2 The O2 Object Manager 71 2.1 Object

  16. Managing Contention and Timing Constraints in a RealTime Database System \\Lambda

    E-Print Network [OSTI]

    Son, Sang H.

    22903, USA Abstract Previous work in real­time database management systems (RT­DBMS) has primarily based an actual RT­ DBMS on a real­time microkernel operating system. A real RT­DBMS must confront many practical of con­ structing a RT­DBMS is divided into three basic prob­ lems: dealing with resource contention

  17. Hyperbolic Graph Generator

    E-Print Network [OSTI]

    Aldecoa, Rodrigo; Krioukov, Dmitri

    2015-01-01T23:59:59.000Z

    Networks representing many complex systems in nature and society share some common structural properties like heterogeneous degree distributions and strong clustering. Recent research on network geometry has shown that those real networks can be adequately modeled as random geometric graphs in hyperbolic spaces. In this paper, we present a computer program to generate such graphs. Besides real-world-like networks, the program can generate random graphs from other well-known graph ensembles, such as the soft configuration model, random geometric graphs on a circle, or Erd\\H{o}s-R\\'enyi random graphs. The simulations show a good match between the expected values of different network structural properties and the corresponding empirical values measured in generated graphs, confirming the accurate behavior of the program.

  18. Early-type contact systems in the LMC MACHO database

    E-Print Network [OSTI]

    Slavek M. Rucinski

    1999-08-30T23:59:59.000Z

    Two sub-samples of blue, luminous contact systems from among 86 systems discovered in LMC by the MACHO project and classified as EB3 have been analyzed: a sub-sample of 29 extremely-blue systems (XB) with the observed colours V-R_C<-0.1 and a sub-sample of 36 moderately-blue (MB) systems with -0.1systems must be intrinsically very hot and almost unreddened so that lack of information on reddening is unimportant for them; their properties offer us a first-time insight into the absolute-magnitude calibration for massive contact binaries. It has been found that the LMC systems are apparently not limited by the blue, short-period envelope in the colour-period diagram which had been established on the basis of systems observed in the solar neighborhood, in galactic open clusters and in the sample of Old Disk systems in the direction of the Galactic Bulge. The period - magnitude correlation for the XB systems has a similar slope to those established in the absolute-magnitude, B-V and V-I_C based, calibrations for W~UMa-type systems.

  19. Databases applicable to quantitative hazard/risk assessment-Towards a predictive systems toxicology

    SciTech Connect (OSTI)

    Waters, Michael [ILS, Inc., P.O. Box 13501, Research Triangle Park, NC 27709 (United States)], E-mail: mwaters@ils-inc.com; Jackson, Marcus [ILS, Inc., P.O. Box 13501, Research Triangle Park, NC 27709 (United States)

    2008-11-15T23:59:59.000Z

    The Workshop on The Power of Aggregated Toxicity Data addressed the requirement for distributed databases to support quantitative hazard and risk assessment. The authors have conceived and constructed with federal support several databases that have been used in hazard identification and risk assessment. The first of these databases, the EPA Gene-Tox Database was developed for the EPA Office of Toxic Substances by the Oak Ridge National Laboratory, and is currently hosted by the National Library of Medicine. This public resource is based on the collaborative evaluation, by government, academia, and industry, of short-term tests for the detection of mutagens and presumptive carcinogens. The two-phased evaluation process resulted in more than 50 peer-reviewed publications on test system performance and a qualitative database on thousands of chemicals. Subsequently, the graphic and quantitative EPA/IARC Genetic Activity Profile (GAP) Database was developed in collaboration with the International Agency for Research on Cancer (IARC). A chemical database driven by consideration of the lowest effective dose, GAP has served IARC for many years in support of hazard classification of potential human carcinogens. The Toxicological Activity Profile (TAP) prototype database was patterned after GAP and utilized acute, subchronic, and chronic data from the Office of Air Quality Planning and Standards. TAP demonstrated the flexibility of the GAP format for air toxics, water pollutants and other environmental agents. The GAP format was also applied to developmental toxicants and was modified to represent quantitative results from the rodent carcinogen bioassay. More recently, the authors have constructed: 1) the NIEHS Genetic Alterations in Cancer (GAC) Database which quantifies specific mutations found in cancers induced by environmental agents, and 2) the NIEHS Chemical Effects in Biological Systems (CEBS) Knowledgebase that integrates genomic and other biological data including dose-response studies in toxicology and pathology. Each of the public databases has been discussed in prior publications. They will be briefly described in the present report from the perspective of aggregating datasets to augment the data and information contained within them.

  20. Comprehensive online Atomic Database Management System (DBMS) with Highly Qualified Computing Capabilities

    E-Print Network [OSTI]

    Tahat, Amani

    2011-01-01T23:59:59.000Z

    The intensive need of atomic data is expanding continuously in a wide variety of applications (e.g. fusion energy and astrophysics, laser-produced, plasma researches, and plasma processing).This paper will introduce our ongoing research work to build a comprehensive, complete, up-to-date, user friendly and online atomic Database Management System (DBMS) namely called AIMS by using SQLite (http://www.sqlite.org/about.html)(8). Programming language tools and techniques will not be covered here. The system allows the generation of various atomic data based on professional online atomic calculators. The ongoing work is a step forward to bring detailed atomic model accessible to a wide community of laboratory and astrophysical plasma diagnostics. AIMS is a professional worldwide tool for supporting several educational purposes and can be considered as a complementary database of IAEA atomic databases. Moreover, it will be an exceptional strategy of incorporating the output data of several atomic codes to external ...

  1. Database Supported Bacnet Data Acquisition System for Building Energy Diagnostics

    E-Print Network [OSTI]

    Li, Z.; Augenbroe, G.

    2011-01-01T23:59:59.000Z

    This paper reports a tool that can be used to acquire and store the BACnet (A Data Communication Protocol for Building Automation and Control Networks) data for the purpose of building energy system Fault Detection and Diagnostics (FDD). Building...

  2. Protein Classification Artificial Neural System: A filter program for database search

    SciTech Connect (OSTI)

    Wu, C.H.; Wang, C.C.; Yazdanpanahi, I. [Univ. of Texas Health Center, Tyler, TX (United States)

    1993-12-31T23:59:59.000Z

    A neural network classification method has been developed as an alternative approach to the large database search/organization problem. The system, termed Protein Classification Artificial Neural System (ProCANS), is implemented on a Cray Y-MP8/864 supercomputer for rapid superfamily classification of unknown proteins based on the information content of the neural interconnections. The system employs an n-gram hashing function for sequence encoding and modular back-propagation networks for classification. The system was developed with the first 2,724 entries in 690 superfamilies of the annotated PIR (Protein Identification Resource) protein sequence database. Three prediction sets were used to evaluate the system performance. The first consists of 651 annotated entries randomly chosen from the 690 superfamilies. The second set consists of 482 unclassified entries from the preliminary PIR database, whose superfamilies were identified by the fasta, blastp and sp database search methods. The third set is a subset of data set 2 with only superfamilies of more than 20 entries. At a low cut-off score of 0.01, the sensitivity is 92, 82 and 100%, respectively, for the three prediction sets. At a high cut-off score of 0.9, on the other hand, a close to 100% specificity is achieved with a reduced sensitivity.

  3. Graph Generator Survey

    SciTech Connect (OSTI)

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

    2013-12-01T23:59:59.000Z

    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.

  4. Predicting and Preventing Insider Threat in Relational Database Systems

    E-Print Network [OSTI]

    Boyer, Edmond

    of the computer systems of an organization, and is inspired to antagonistically influence the organization [1 cause. Trusted insiders are responsible of 52% of all security breaches in 2004, according the 2005 FBI that protect sensitive data against insiders has become a key demand due to the amount of harm that can

  5. The Ecobase Project: Database and Web Technologies for Environmental Information Systems

    E-Print Network [OSTI]

    Bouganim, Luc

    a profound impact on our ability to protect our environment, manage natural resources, prevent and respondThe Ecobase Project: Database and Web Technologies for Environmental Information Systems Ecobase in the context of several environmental applications in Brazil and Europe. We propose a distributed architecture

  6. Implementing Chimera on Top of an Active Relational Database System \\Lambda

    E-Print Network [OSTI]

    Clausen, Michael

    Implementing Chimera on Top of an Active Relational Database System \\Lambda Ulrike Griefahn Thomas­Mail: fulrike,tlg@informatik.uni­bonn.de July 9, 1996 Abstract Chimera is the name of a new data model as well standard view of the key notions such as object, value, class, type, inheritance, and overriding. Chimera

  7. Data Mining Algorithms as a Service in the Cloud Exploiting Relational Database Systems

    E-Print Network [OSTI]

    Ordonez, Carlos

    Data Mining Algorithms as a Service in the Cloud Exploiting Relational Database Systems Carlos Ordonez University of Houston USA Javier García-García Instituto Politécnico Nacional Mexico Carlos Garcia based on DBMS technol- ogy, where data mining algorithms are offered as a service. A local DBMS connects

  8. Computer Science Adjunct Faculty Position for Computer Networks and Database Systems

    E-Print Network [OSTI]

    Plotkin, Joshua B.

    Computer Science Adjunct Faculty Position for Computer Networks and Database Systems Connecticut College is seeking an adjunct professor (rank open) of computer science to teach Computer Networks (COM315 have a Masters or equivalent in Computer Science or related field. The catalog course descriptions

  9. Evaluation of spatial database management systems: A performance-based comparison 

    E-Print Network [OSTI]

    Arbesser-Rastburg, Thomas

    2009-11-26T23:59:59.000Z

    This analytical research paper investigates the question which of three Spatial Database Management Systems (Oracle 11g, PostgreSQL 8.3 with PostGIS 1.2 and MySQL 5) installed on a Linux platform performs best in queries ...

  10. Fine-grained Updates in Database Management Systems for Flash Zhen He and Prakash Veeraraghavan

    E-Print Network [OSTI]

    He, Zhen

    that it is smaller, lighter, noiseless, more energy efficient and has much greater shock resistance. For small Veeraraghavan Department of Computer Science and Computer Engineering La Trobe University VIC 3086 Australia {z it attractive to build database management systems (DBMSs) on top of flash memory. However, most existing DBMSs

  11. A Temporal Approach to Managing Schema Evolution in Object Database Systems

    E-Print Network [OSTI]

    Szafron, Duane

    A Temporal Approach to Managing Schema Evolution in Object Database Systems Iqbal A. Goralwalla,duane,ozsug@cs.ualberta.ca randal@cs.umanitoba.ca Abstract The issues of schema evolution and temporal object models are generally of a temporal object model. The result is a uniform treatment of schema evolution and temporal support for many

  12. The Forth Workshop on Flash-based Database Systems 60833005 2010 7 28

    E-Print Network [OSTI]

    /O Scheduler for Database Systems GP-Deadline SSD SSD deadline SSD Linux DBMS benchmark PostgreSQL Postgre Replacement Algorithm for Flash Storage Devices ACR ACR SSD O(1) ACR LRU CF-LRU CFDC ACR 4 DBMS SSDSort: A New flash-aware external sorting algorithm SSDSort :SSDSort SSDSort SSDSort SSDSort 5 DBMS SSD SSD SSD #12

  13. Database Systems Performance Evaluation Subharthi Paul subharthipaul@gmail.com (A project report written under

    E-Print Network [OSTI]

    Jain, Raj

    seen a huge transformation in the way businesses are conducted. There has been a paradigm shift from at other means to gain higher visibility and customer satisfaction, maintaining all the while their core that has spurred and aided this enormous movement. More specifically, database management systems now form

  14. Remote Thin-Client Access to Spatial Database Systems Hanan Samet

    E-Print Network [OSTI]

    Samet, Hanan

    Remote Thin-Client Access to Spatial Database Systems Hanan Samet Frantisek Brabec Computer Science for searching and data retrieval. This is often done via the Internet through a web browser interface. If this data is presented in textual format, it can often be searched and retrieved by such attributes as topic

  15. NATIONAL CARBON SEQUESTRATION DATABASE AND GEOGRAPHIC INFORMATION SYSTEM (NATCARB) FORMER TITLE-MIDCONTINENT INTERACTIVE DIGITAL CARBON ATLAS AND RELATIONAL DATABASE (MIDCARB)

    SciTech Connect (OSTI)

    Timothy R. Carr

    2004-07-16T23:59:59.000Z

    This annual report describes progress in the third year of the three-year project entitled ''Midcontinent Interactive Digital Carbon Atlas and Relational Database (MIDCARB)''. The project assembled a consortium of five states (Indiana, Illinois, Kansas, Kentucky and Ohio) to construct an online distributed Relational Database Management System (RDBMS) and Geographic Information System (GIS) covering aspects of carbon dioxide (CO{sub 2}) geologic sequestration (http://www.midcarb.org). The system links the five states in the consortium into a coordinated regional database system consisting of datasets useful to industry, regulators and the public. The project has been extended and expanded as a ''NATional CARBon Sequestration Database and Geographic Information System (NATCARB)'' to provide national coverage across the Regional CO{sub 2} Partnerships, which currently cover 40 states (http://www.natcarb.org). Advanced distributed computing solutions link database servers across the five states and other publicly accessible servers (e.g., USGS) into a single system where data is maintained and enhanced at the local level but is accessed and assembled through a single Web portal and can be queried, assembled, analyzed and displayed. This project has improved the flow of data across servers and increased the amount and quality of available digital data. The online tools used in the project have improved in stability and speed in order to provide real-time display and analysis of CO{sub 2} sequestration data. The move away from direct database access to web access through eXtensible Markup Language (XML) has increased stability and security while decreasing management overhead. The MIDCARB viewer has been simplified to provide improved display and organization of the more than 125 layers and data tables that have been generated as part of the project. The MIDCARB project is a functional demonstration of distributed management of data systems that cross the boundaries between institutions and geographic areas. The MIDCARB system addresses CO{sub 2} sequestration and other natural resource issues from sources, sinks and transportation within a spatial database that can be queried online. Visualization of high quality and current data can assist decision makers by providing access to common sets of high quality data in a consistent manner.

  16. Performance study of optimistic concurrency control schemes for distributed database systems 

    E-Print Network [OSTI]

    Kim Lee, Hyunsoon

    1993-01-01T23:59:59.000Z

    (Chair of Committee) yh-Cham S. Liu (Member) Michael T. Longn ker (Member) Richard A. Volz (Head of Department) May 1993 ABSTRACT Performance Study of Optimistic Concurrency Control Schemes for Distributed Database Systems. (May 1993) Hyunsoon..., To my daughter, Jihyun ACKNOWLEDGMENTS Special thanks to Dr. Junguk L. Kim, whose guidance and patience made this thesis possible. I would like to thank Drs. J. C. Liu and M. T. Longnecker for their time and useful comments in reviewing this document...

  17. Hazard Analysis Database report

    SciTech Connect (OSTI)

    Niemi, B.J.

    1997-08-12T23:59:59.000Z

    This document describes and defines the Hazard Analysis Database for the Tank Waste Remediation System Final Safety Analysis Report.

  18. 1.264J / ESD.264J Database, Internet, and Systems Integration Technologies, Fall 2002

    E-Print Network [OSTI]

    Kocur, George

    Survey of information technology covering database modeling, design, and implementation with an emphasis on relational databases and SQL. Internet technologies: http, html, XML, SOAP, security. Brief introduction to ...

  19. 1.264J / ESD.264J Database, Internet, and Systems Integration Technologies, Fall 2004

    E-Print Network [OSTI]

    Kocur, George

    Survey of information technology covering database modeling, design, and implementation with an emphasis on relational databases and SQL. Internet technologies: http, html, XML, SOAP, security. Brief introduction to ...

  20. GRAPHDB -a database of Axel Kohnert

    E-Print Network [OSTI]

    Laue, Reinhard

    GRAPHDB - a database of graphs March 2003 Axel Kohnert University of Bayreuth http://btm2xg ADMIN DBUSER ¡£¢ DB ¤ ¥ GRAPHVIEWER ¦ GRAPHSERVER #12;A: The Database Part I. THE MASTER TABLE #12;B: The client access to the database There are several web pages which allow the search

  1. THE SIMULATION OF BUSINESS RULES IN ACTIVE DATABASES USING EXPERT SYSTEM Ivan Bruha and Frantisek Franek Vladimir L. Rosicky

    E-Print Network [OSTI]

    Franek, Frantisek

    of Database Management Systems (DBMS) is concerned with an augmentation of DBMS by rules. Passive rules-based DBMS by business rules in mostly declarative form (as opposed to the more usual, but less manageable

  2. THE SIMULATION OF BUSINESS RULES IN ACTIVE DATABASES USING EXPERT SYSTEM Ivan Bruha and Frantisek Franek Vladimir L. Rosicky

    E-Print Network [OSTI]

    Franek, Frantisek

    of Database Management Systems (DBMS) is concerned with an augmentation of DBMS by rules. Passive rules­based DBMS by business rules in mostly declarative form (as opposed to the more usual, but less manageable

  3. The usefulness of the generalised computational model of Term Graph Rewriting Systems (TGRS) for designing and

    E-Print Network [OSTI]

    Banach, Richard

    of programs written in UFO ([8,9]), a state-of-the-art object- oriented functional language, onto equivalent as follows: the next two sections introduce MONSTR and UFO and provide Term Graph Rewriting

  4. A protocol for consistent checkpointing recovery in time-stamp based distributed database systems

    E-Print Network [OSTI]

    Swarnam, Prabaharan Ilanji

    1992-01-01T23:59:59.000Z

    access the data items in several sites and update them. Ilence, the checkpointing in a distributed database system is quite complicated since the atomicity of the global transaction must be reflected in the checkpoint. This research contributes a... FOR SCHEME K 69 C C CODE FOR SCHEME S 99 VITA 131 LIST OF FIGURES FIGURE Pa, ge 1 Inconsistent Checkpoint 18 2 Flow of the Simulation 3 Queue Delays at the Site 28 4 Mean Transaction Response and Restart Vs. Transaction Arrival Rate 5 Mean...

  5. Graphs associated with semigroups

    E-Print Network [OSTI]

    Baber, Stephen Asa

    1976-01-01T23:59:59.000Z

    to the graph of this system as well. We first consider the question of when G(g ) is a com- 3 19 piete graph. The more general question of connectedness will be considered later' In order to state the next few results we need a definitions A minimal right... tM2. In [2], Clifford and Preston show that any two idempotent elements in an inverse semigroup commute. Thus, complete graph. ele2=e2el e MI()M2. As above, G(4 ) is a In order to show that the four conditions in corollary 4. 3...

  6. National Carbon Sequestration Database and Geographic Information System (NatCarb)

    SciTech Connect (OSTI)

    Kenneth Nelson; Timothy Carr

    2009-03-31T23:59:59.000Z

    This annual and final report describes the results of the multi-year project entitled 'NATional CARBon Sequestration Database and Geographic Information System (NatCarb)' (http://www.natcarb.org). The original project assembled a consortium of five states (Indiana, Illinois, Kansas, Kentucky and Ohio) in the midcontinent of the United States (MIDCARB) to construct an online distributed Relational Database Management System (RDBMS) and Geographic Information System (GIS) covering aspects of carbon dioxide (CO{sub 2}) geologic sequestration. The NatCarb system built on the technology developed in the initial MIDCARB effort. The NatCarb project linked the GIS information of the Regional Carbon Sequestration Partnerships (RCSPs) into a coordinated regional database system consisting of datasets useful to industry, regulators and the public. The project includes access to national databases and GIS layers maintained by the NatCarb group (e.g., brine geochemistry) and publicly accessible servers (e.g., USGS, and Geography Network) into a single system where data are maintained and enhanced at the local level, but are accessed and assembled through a single Web portal to facilitate query, assembly, analysis and display. This project improves the flow of data across servers and increases the amount and quality of available digital data. The purpose of NatCarb is to provide a national view of the carbon capture and storage potential in the U.S. and Canada. The digital spatial database allows users to estimate the amount of CO{sub 2} emitted by sources (such as power plants, refineries and other fossil-fuel-consuming industries) in relation to geologic formations that can provide safe, secure storage sites over long periods of time. The NatCarb project worked to provide all stakeholders with improved online tools for the display and analysis of CO{sub 2} carbon capture and storage data through a single website portal (http://www.natcarb.org/). While the external project is ending, NatCarb will continue as an internal US Department of Energy National Energy Technology Laboratory (NETL) project with the continued cooperation of personnel at both West Virginia University and the Kansas Geological Survey. The successor project will continue to organize and enhance the information about CO{sub 2} sources and developing the technology needed to access, query, analyze, display, and distribute natural resource data critical to carbon management. Data are generated, maintained and enhanced locally at the RCSP level, or at the national level in specialized data warehouses, and assembled, accessed, and analyzed in real-time through a single geoportal. To address the broader needs of a spectrum of users form high-end technical queries to the general public, NatCarb will be moving to an improved and simplified display for the general public using readily available web tools such as Google Earth{trademark} and Google Maps{trademark}. The goal is for NatCarb to expand in terms of technology and areal coverage and remain the premier functional demonstration of distributed data-management systems that cross the boundaries between institutions and geographic areas, and forms the foundation of a functioning carbon cyber-infrastructure. NatCarb provides access to first-order information to evaluate the costs, economic potential and societal issues of CO{sub 2} capture and storage, including public perception and regulatory aspects.

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

    SciTech Connect (OSTI)

    Mayo, Jackson R.; Kegelmeyer, W. Philip, Jr.; Wong, Matthew H.; Pebay, Philippe Pierre; Gentile, Ann C.; Thompson, David C.; Roe, Diana C.; De Sapio, Vincent; Brandt, James M.

    2010-08-01T23:59:59.000Z

    The monitoring and system analysis of high performance computing (HPC) clusters is of increasing importance to the HPC community. Analysis of HPC job data can be used to characterize system usage and diagnose and examine failure modes and their effects. This analysis is not straightforward, however, due to the complex relationships that exist between jobs. These relationships are based on a number of factors, including shared compute nodes between jobs, proximity of jobs in time, etc. Graph-based techniques represent an approach that is particularly well suited to this problem, and provide an effective technique for discovering important relationships in job queuing and execution data. The efficacy of these techniques is rooted in the use of a semantic graph as a knowledge representation tool. In a semantic graph job data, represented in a combination of numerical and textual forms, can be flexibly processed into edges, with corresponding weights, expressing relationships between jobs, nodes, users, and other relevant entities. This graph-based representation permits formal manipulation by a number of analysis algorithms. This report presents a methodology and software implementation that leverages semantic graph-based techniques for the system-level monitoring and analysis of HPC clusters based on job queuing and execution data. Ontology development and graph synthesis is discussed with respect to the domain of HPC job data. The framework developed automates the synthesis of graphs from a database of job information. It also provides a front end, enabling visualization of the synthesized graphs. Additionally, an analysis engine is incorporated that provides performance analysis, graph-based clustering, and failure prediction capabilities for HPC systems.

  8. The GLIMS Glacier Database: a spatio-temporal database

    E-Print Network [OSTI]

    Raup, Bruce H.

    The GLIMS Glacier Database: a spatio-temporal database implemented using Open Source tools Bruce countries #12;#12;#12;#12;#12;System components PostgreSQL (relational database) PostGIS (geospatial) GDAL (Geospatial Data Abstraction Library) Perl, PHP, Shapelib, ... #12;GLIMS Glacier Database System

  9. Development of an Integrated Natural Barrier Database System for Site Evaluation of a Deep Geologic Repository in Korea - 13527

    SciTech Connect (OSTI)

    Jung, Haeryong; Lee, Eunyong; Jeong, YiYeong; Lee, Jeong-Hwan [Korea Radioactive-waste Management Corportation - KRMC, 1045 Daedeokdaero, Yuseong-gu, Daejeon 305-353 (Korea, Republic of)] [Korea Radioactive-waste Management Corportation - KRMC, 1045 Daedeokdaero, Yuseong-gu, Daejeon 305-353 (Korea, Republic of)

    2013-07-01T23:59:59.000Z

    Korea Radioactive-waste Management Corporation (KRMC) established in 2009 has started a new project to collect information on long-term stability of deep geological environments on the Korean Peninsula. The information has been built up in the integrated natural barrier database system available on web (www.deepgeodisposal.kr). The database system also includes socially and economically important information, such as land use, mining area, natural conservation area, population density, and industrial complex, because some of this information is used as exclusionary criteria during the site selection process for a deep geological repository for safe and secure containment and isolation of spent nuclear fuel and other long-lived radioactive waste in Korea. Although the official site selection process has not been started yet in Korea, current integrated natural barrier database system and socio-economic database is believed that the database system will be effectively utilized to narrow down the number of sites where future investigation is most promising in the site selection process for a deep geological repository and to enhance public acceptance by providing readily-available relevant scientific information on deep geological environments in Korea. (authors)

  10. Assembly and comparison of available solar hot water system reliability databases and information.

    SciTech Connect (OSTI)

    Menicucci, David F. (Building Specialists, Inc., Albuquerque, NM)

    2009-05-01T23:59:59.000Z

    Solar hot water (SHW) systems have been installed commercially for over 30 years, yet few quantitative details are known about their reliability. This report describes a comprehensive analysis of all of the known major previous research and data regarding the reliability of SHW systems and components. Some important conclusions emerged. First, based on a detailed inspection of ten-year-old systems in Florida, about half of active systems can be expected to fail within a ten-year period. Second, valves were identified as the probable cause of a majority of active SHW failures. Third, passive integral and thermosiphon SHW systems have much lower failure rates than active ones, probably due to their simple design that employs few mechanical parts. Fourth, it is probable that the existing data about reliability do not reveal the full extent of fielded system failures because most of the data were based on trouble calls. Often an SHW system owner is not aware of a failure because the backup system silently continues to produce hot water. Thus, a repair event may not be generated in a timely manner, if at all. This final report for the project provides all of the pertinent details about this study, including the source of the data, the techniques to assure their quality before analysis, the organization of the data into perhaps the most comprehensive reliability database in existence, a detailed statistical analysis, and a list of recommendations for additional critical work. Important recommendations include the inclusion of an alarm on SHW systems to identify a failed system, the need for a scientifically designed study to collect high-quality reliability data that will lead to design improvements and lower costs, and accelerated testing of components that are identified as highly problematic.

  11. Karlsruhe Database for Radioactive Wastes (KADABRA) - Accounting and Management System for Radioactive Waste Treatment - 12275

    SciTech Connect (OSTI)

    Himmerkus, Felix; Rittmeyer, Cornelia [WAK Rueckbau- und Entsorgungs- GmbH, 76339 Eggenstein-Leopoldshafen (Germany)

    2012-07-01T23:59:59.000Z

    The data management system KADABRA was designed according to the purposes of the Cen-tral Decontamination Department (HDB) of the Wiederaufarbeitungsanlage Karlsruhe Rueckbau- und Entsorgungs-GmbH (WAK GmbH), which is specialized in the treatment and conditioning of radioactive waste. The layout considers the major treatment processes of the HDB as well as regulatory and legal requirements. KADABRA is designed as an SAG ADABAS application on IBM system Z mainframe. The main function of the system is the data management of all processes related to treatment, transfer and storage of radioactive material within HDB. KADABRA records the relevant data concerning radioactive residues, interim products and waste products as well as the production parameters relevant for final disposal. Analytical data from the laboratory and non destructive assay systems, that describe the chemical and radiological properties of residues, production batches, interim products as well as final waste products, can be linked to the respective dataset for documentation and declaration. The system enables the operator to trace the radioactive material through processing and storage. Information on the actual sta-tus of the material as well as radiological data and storage position can be gained immediately on request. A variety of programs accessed to the database allow the generation of individual reports on periodic or special request. KADABRA offers a high security standard and is constantly adapted to the recent requirements of the organization. (authors)

  12. This is a preprint of a copyrighted paper that will appear in Multimedia Systems. An Object-Oriented Multimedia Database System for a

    E-Print Network [OSTI]

    Ă?zsu, M. Tamer

    for the use of database management system (DBMS) technology. Unfortu- nately, it is still rare to find multimedia information systems that use DBMSs. This pre- cludes the system support for standard DBMS. #12;2 Another reason why DBMS technology has not so far penetrated this application area

  13. AN OVERVIEW ON DATABASESAN OVERVIEW ON DATABASES What is a Database?What is a Database?

    E-Print Network [OSTI]

    Schweik, Charles M.

    3/22/2011 1 1 AN OVERVIEW ON DATABASESAN OVERVIEW ON DATABASES C. Schweik 2 What is a Database?What is a Database? A well organized collection of data that are related in a meaningful way. Data can be accessed, structured and shared. #12;3/22/2011 2 3 Data in Database SystemsData in Database Systems should be:should be

  14. Natural language interface and database issues in applying expert systems to power systems

    SciTech Connect (OSTI)

    Rumpel, D.; Krost, G. (Univ. of Duisburg Gesamthochschule, Elektrische Anlagen und Netze, 4100 Duisburg 1 (DE))

    1992-05-01T23:59:59.000Z

    Applying expert systems (ES's) to power system operation means imbedding them in an existing environment which consists of computational facilities (SCADA, EMS) on one side, and the operating staff on the other side. To that aim, an interface between process data and ES data is required. Further, for an unambiguous and clear information exchange with, and good acceptance by , the operators and approximate natural language dialog of the ES is desirable. In this paper, several approaches to these problems are described.

  15. Reducing Energy Consumption of Queries in Memory-Resident Database Systems

    E-Print Network [OSTI]

    Kuzmanovic, Aleksandar

    to commercial databases, but ex- isting embedded DBMS software has not provided the ideal fit. Embedded bank is typically much smaller compared to a large monolithic memory). In addition, these memory

  16. Unit selection in a concatenative speech synthesis system using a large speech database 

    E-Print Network [OSTI]

    Hunt, Andrew; Black, Alan W

    One approach to the generation of natural-sounding synthesized speech waveforms is to select and concatenate units from a large speech database. Units (in the current work, phonemes) are selected to produce a natural realisation of a target phoneme...

  17. Home Heating Systems Design using PHP and MySQL Databases

    E-Print Network [OSTI]

    Karnyanszky, Tiberiu Marius

    2009-01-01T23:59:59.000Z

    This paper presents the use of a computer application based on a MySQL database, managed by PHP programs, allowing the selection of a heating device using coefficient-based calculus.

  18. university-logo Graph Expansions

    E-Print Network [OSTI]

    St Andrews, University of

    university-logo Graph Expansions Green's Relations Closing Remarks Semigroup Graph Expansions January 2009 Rebecca Noonan Heale Semigroup Graph Expansions: #12;university-logo Graph Expansions Green;university-logo Graph Expansions Green's Relations Closing Remarks History Definitions Graph Expansions

  19. Software Architecture for a Firm RealTime Database System YoungKuk Kim Matthew R. Lehr & Sang H. Son

    E-Print Network [OSTI]

    Son, Sang H.

    ­time database management system (RT­DBMS) must con­ front many new and practical problems which have been often ignored in previous work based on simulation. In addition to transaction scheduling, an RT­DBMS must deal­time technology has been applied to architect an RT­DBMS on a real­time microkernel operating sys­ tem and how

  20. Loops in Reeb Graphs of 2-Manifolds Kree Cole-McLaughlin

    E-Print Network [OSTI]

    Pascucci, Valerio

    -resolution versions of the Reeb graph have lead to data-base search methods for topologically similar geo- metric and scientific data. Specifically, we study Reeb graphs, which express the connectivity of level sets. These graphs have been used in the past to con- struct data structures and user-interfaces for modeling

  1. A Quantum Annealing Approach for Fault Detection and Diagnosis of Graph-Based Systems

    E-Print Network [OSTI]

    Alejandro Perdomo-Ortiz; Joseph Fluegemann; Sriram Narasimhan; Rupak Biswas; Vadim N. Smelyanskiy

    2014-10-02T23:59:59.000Z

    Diagnosing the minimal set of faults capable of explaining a set of given observations, e.g., from sensor readouts, is a hard combinatorial optimization problem usually tackled with artificial intelligence techniques. We present the mapping of this combinatorial problem to quadratic unconstrained binary optimization (QUBO), and the experimental results of instances embedded onto a quantum annealing device with 509 quantum bits. Besides being the first time a quantum approach has been proposed for problems in the advanced diagnostics community, to the best of our knowledge this work is also the first research utilizing the route Problem $\\rightarrow$ QUBO $\\rightarrow$ Direct embedding into quantum hardware, where we are able to implement and tackle problem instances with sizes that go beyond previously reported toy-model proof-of-principle quantum annealing implementations; this is a significant leap in the solution of problems via direct-embedding adiabatic quantum optimization. We discuss some of the programmability challenges in the current generation of the quantum device as well as a few possible ways to extend this work to more complex arbitrary network graphs.

  2. Chronos: Feedback Control of a Real Database System Performance Kyoung-Don Kang and Jisu Oh

    E-Print Network [OSTI]

    Kang, Kyoung-Don

    It is challenging to process transactions in a timely fashion using fresh data, e.g., current stock prices, since-time databases (RTDBs) aim to process trans- actions in a timely manner using fresh temporal data, e.g., current stock prices or traffic sensor data, rep- resenting the real world status. RTDBs can reduce

  3. Exploiting the Impact of Database System Configuration Parameters: A Design of Experiments Approach

    E-Print Network [OSTI]

    Minnesota, University of

    in determining DBMS performance. However, the number of configuration parameters in a DBMS is very large may have no or marginal effects on the DBMS performance for the given query workload. Database of input parameters. Second, we exploit the estimated effects to: 1) rank DBMS configuration parameters

  4. On graphs whose Laplacian matrix's multipartite separability is invariant under graph isomorphism

    E-Print Network [OSTI]

    Chai Wah Wu

    2009-06-04T23:59:59.000Z

    Normalized Laplacian matrices of graphs have recently been studied in the context of quantum mechanics as density matrices of quantum systems. Of particular interest is the relationship between quantum physical properties of the density matrix and the graph theoretical properties of the underlying graph. One important aspect of density matrices is their entanglement properties, which are responsible for many nonintuitive physical phenomena. The entanglement property of normalized Laplacian matrices is in general not invariant under graph isomorphism. In recent papers, graphs were identified whose entanglement and separability properties are invariant under isomorphism. The purpose of this note is to characterize the set of graphs whose separability is invariant under graph isomorphism. In particular, we show that this set consists of $K_{2,2}$, $\\overline{K_{2,2}}$ and all complete graphs.

  5. Database Security: A Historical Perspective

    E-Print Network [OSTI]

    Lesov, Paul

    2010-01-01T23:59:59.000Z

    The importance of security in database research has greatly increased over the years as most of critical functionality of the business and military enterprises became digitized. Database is an integral part of any information system and they often hold sensitive data. The security of the data depends on physical security, OS security and DBMS security. Database security can be compromised by obtaining sensitive data, changing data or degrading availability of the database. Over the last 30 years the information technology environment have gone through many changes of evolution and the database research community have tried to stay a step ahead of the upcoming threats to the database security. The database research community has thoughts about these issues long before they were address by the implementations. This paper will examine the different topics pertaining to database security and see the adaption of the research to the changing environment. Some short term database research trends will be ascertained ...

  6. March 24, 2008 Databases: Security 1 Database Security and Authorization

    E-Print Network [OSTI]

    Adam, Salah

    to control login process by the DBMS Inference control The countermeasures to statistical database security database #12;March 24, 2008 Databases: Security 3 Chapter Outline Introduction Access Control Methods Policy System-related Security levels and categories Security Threats Loss of integrity Loss

  7. Convex Graph Invariants

    E-Print Network [OSTI]

    2010-12-02T23:59:59.000Z

    Dec 2, 2010 ... Massachusetts Institute of Technology ... testing between graph families, and the generation of graphs with certain desired structural properties.

  8. A Case for Database Filesystems

    SciTech Connect (OSTI)

    Adams, P A; Hax, J C

    2009-05-13T23:59:59.000Z

    Data intensive science is offering new challenges and opportunities for Information Technology and traditional relational databases in particular. Database filesystems offer the potential to store Level Zero data and analyze Level 1 and Level 3 data within the same database system [2]. Scientific data is typically composed of both unstructured files and scalar data. Oracle SecureFiles is a new database filesystem feature in Oracle Database 11g that is specifically engineered to deliver high performance and scalability for storing unstructured or file data inside the Oracle database. SecureFiles presents the best of both the filesystem and the database worlds for unstructured content. Data stored inside SecureFiles can be queried or written at performance levels comparable to that of traditional filesystems while retaining the advantages of the Oracle database.

  9. Improving Attack Graph Visualization through Data Reduction and Attack Grouping

    E-Print Network [OSTI]

    Ou, Xinming "Simon"

    Improving Attack Graph Visualization through Data Reduction and Attack Grouping John Homer1 Laboratory, USA Abstract. Various tools exist to analyze enterprise network systems and to produce attack graphs detailing how attackers might penetrate into the system. These attack graphs, however, are often

  10. Verifying Distributed Real-time Properties of Embedded Systems via Graph Transformations and Model Checking

    E-Print Network [OSTI]

    Abdelwahed, Sherif

    S properties, such as low latency, low energy consumption, bounded jitter, high reliability, high throughput and data acquisition (SCADA) systems that manage regional power grids. Key un- resolved challenges include

  11. Computer systems and methods for the query and visualization of multidimensional databases

    DOE Patents [OSTI]

    Stolte, Chris (Palo Alto, CA); Tang, Diane L. (Palo Alto, CA); Hanrahan, Patrick (Portola Valley, CA)

    2011-02-01T23:59:59.000Z

    In response to a user request, a computer generates a graphical user interface on a computer display. A schema information region of the graphical user interface includes multiple operand names, each operand name associated with one or more fields of a multi-dimensional database. A data visualization region of the graphical user interface includes multiple shelves. Upon detecting a user selection of the operand names and a user request to associate each user-selected operand name with a respective shelf in the data visualization region, the computer generates a visual table in the data visualization region in accordance with the associations between the operand names and the corresponding shelves. The visual table includes a plurality of panes, each pane having at least one axis defined based on data for the fields associated with a respective operand name.

  12. Computer systems and methods for the query and visualization of multidimensional databases

    DOE Patents [OSTI]

    Stolte, Chris; Tang, Diane L; Hanrahan, Patrick

    2014-04-29T23:59:59.000Z

    In response to a user request, a computer generates a graphical user interface on a computer display. A schema information region of the graphical user interface includes multiple operand names, each operand name associated with one or more fields of a multi-dimensional database. A data visualization region of the graphical user interface includes multiple shelves. Upon detecting a user selection of the operand names and a user request to associate each user-selected operand name with a respective shelf in the data visualization region, the computer generates a visual table in the data visualization region in accordance with the associations between the operand names and the corresponding shelves. The visual table includes a plurality of panes, each pane having at least one axis defined based on data for the fields associated with a respective operand name.

  13. Computer systems and methods for the query and visualization of multidimensional databases

    DOE Patents [OSTI]

    Stolte, Chris (Palo Alto, CA); Tang, Diane L. (Palo Alto, CA); Hanrahan, Patrick (Portola Valley, CA)

    2012-03-20T23:59:59.000Z

    In response to a user request, a computer generates a graphical user interface on a computer display. A schema information region of the graphical user interface includes multiple operand names, each operand name associated with one or more fields of a multi-dimensional database. A data visualization region of the graphical user interface includes multiple shelves. Upon detecting a user selection of the operand names and a user request to associate each user-selected operand name with a respective shelf in the data visualization region, the computer generates a visual table in the data visualization region in accordance with the associations between the operand names and the corresponding shelves. The visual table includes a plurality of panes, each pane having at least one axis defined based on data for the fields associated with a respective operand name.

  14. Systemic risk in energy derivative markets: a graph-theory analysis

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    . Such a method indeed makes it possible to investigate prices shocks in the physical as well as in the paper markets. In order to understand the underlying prin- ciples and the dynamic behavior of our prices system to identify the most probable path for the transmission of prices shocks. We study the organization

  15. Limits on the network sensitivity function for multi-agent systems on a graph

    E-Print Network [OSTI]

    Murray, Richard M.

    control of interconnected multi-agent systems, focused on the network sensitivity functions. We consider], [3]. We consider agents with identical linear dynamics and we model the interconnection topology and linear matrix inequalities [4], edge agreement [5], [6], linear quadratic regulator [7], decomposition

  16. Spectral statistics of nearly unidirectional quantum graphs

    E-Print Network [OSTI]

    Maram Akila; Boris Gutkin

    2015-03-04T23:59:59.000Z

    The energy levels of a quantum graph with time reversal symmetry and unidirectional classical dynamics are doubly degenerate and obey the spectral statistics of the Gaussian Unitary Ensemble. These degeneracies, however, are lifted when the unidirectionality is broken in one of the graph's vertices by a singular perturbation. Based on a Random Matrix model we derive an analytic expression for the nearest neighbour distribution between energy levels of such systems. As we demonstrate the result agrees excellently with the actual statistics for graphs with a uniform distribution of eigenfunctions. Yet, it exhibits quite substantial deviations for classes of graphs which show strong scarring.

  17. Hazard Analysis Database Report

    SciTech Connect (OSTI)

    GRAMS, W.H.

    2000-12-28T23:59:59.000Z

    The Hazard Analysis Database was developed in conjunction with the hazard analysis activities conducted in accordance with DOE-STD-3009-94, Preparation Guide for U S . Department of Energy Nonreactor Nuclear Facility Safety Analysis Reports, for HNF-SD-WM-SAR-067, Tank Farms Final Safety Analysis Report (FSAR). The FSAR is part of the approved Authorization Basis (AB) for the River Protection Project (RPP). This document describes, identifies, and defines the contents and structure of the Tank Farms FSAR Hazard Analysis Database and documents the configuration control changes made to the database. The Hazard Analysis Database contains the collection of information generated during the initial hazard evaluations and the subsequent hazard and accident analysis activities. The Hazard Analysis Database supports the preparation of Chapters 3 ,4 , and 5 of the Tank Farms FSAR and the Unreviewed Safety Question (USQ) process and consists of two major, interrelated data sets: (1) Hazard Analysis Database: Data from the results of the hazard evaluations, and (2) Hazard Topography Database: Data from the system familiarization and hazard identification.

  18. Collaborative study of GENIEfy Earth System Models using scripted database workflows in a Grid

    E-Print Network [OSTI]

    A. R. Price; Z. Jiao; I. I. Voutchkov; T. M. Lenton; G. Williams; D. J. Lunt; R. Marsh; P. J. Valdes; S. J. Cox; The Genie Team

    algorithms complement the component framework to provide a comprehensive toolset for Earth system modelling

  19. INLEN: A Methodology and Integrated System for Knowledge Discovery in Databases

    E-Print Network [OSTI]

    Michalski, Ryszard S.

    by Ryszard S. Michalski and Bruce Katz of International Intelligent Systems, Inc. (INIS). I would like to thank INIS for providing the source code of the AURORA system. I would like to thank the collaborators

  20. Database Manipulation on Quantum Computers

    E-Print Network [OSTI]

    Ahmed Younes

    2007-05-29T23:59:59.000Z

    Manipulating a database system on a quantum computer is an essential aim to benefit from the promising speed-up of quantum computers over classical computers in areas that take a vast amount of storage and processing time such as in databases. In this paper, the basic operations for manipulating the data in a quantum database will be defined, e.g. INSERT, UPDATE, DELETE, SELECT, backing up and restoring a database file. This gives the ability to perform the data processing that usually takes a long processing time on a classical database system, in a simultaneous way on a quantum computer. Defining a quantum version of more advanced concepts used in database systems, e.g. the referential integrity and the relational algebra, is a normal extension to this work

  1. Optimal IDS Sensor Placement And Alert Prioritization Using Attack Graphs

    E-Print Network [OSTI]

    Noel, Steven

    1 Optimal IDS Sensor Placement And Alert Prioritization Using Attack Graphs Steven Noel and Sushil optimally place intrusion detection system (IDS) sensors and prioritize IDS alerts using attack graph. The set of all such paths through the network constitutes an attack graph, which we aggregate according

  2. From graphs to signals and back: Identification of graph structures using spectral analysis

    E-Print Network [OSTI]

    Hamon, Ronan; Flandrin, Patrick; Robardet, Céline

    2015-01-01T23:59:59.000Z

    Many systems comprising entities in interactions can be represented as graphs, whose structure gives significant insights about how these systems work. Network theory has undergone further developments, in particular in relation to detection of communities in graphs, to catch this structure. Recently, an approach has been proposed to transform a graph into a collection of signals: Using a multidimensional scaling technique on a distance matrix representing relations between vertices of the graph, points in a Euclidean space are obtained and interpreted as signals, indexed by the vertices. In this article, we propose several extensions to this approach, developing a framework to study graph structures using signal processing tools. We first extend the current methodology, enabling us to highlight connections between properties of signals and graph structures, such as communities, regularity or randomness, as well as combinations of those. A robust inverse transformation method is next described, taking into ac...

  3. Distributed DatabasesDistributed Databases Based on material provided by:Based on material provided by

    E-Print Network [OSTI]

    /References ?? A Database Management SystemA Database Management System (DBMS) is a software package designed(DBMS Databases, 2001 5 Why Use a DBMS?Why Use a DBMS? ?? Data IndependenceData Independence ?? Efficient Access data #12;J.J.Bunn, Distributed Databases, 2001 9 Concurrency ControlConcurrency Control ?? Good DBMS

  4. Data mining the EXFOR database using network theory

    E-Print Network [OSTI]

    John A. Hirdt; David A. Brown

    2013-12-21T23:59:59.000Z

    The EXFOR database contains the largest collection of experimental nuclear reaction data available as well as the data's bibliographic information and experimental details. We created an undirected graph from the EXFOR datasets with graph nodes representing single observables and graph links representing the various types of connections between these observables. This graph is an abstract representation of the connections in EXFOR, similar to graphs of social networks, authorship networks, etc. By analyzing this abstract graph, we are able to address very specific questions such as 1) what observables are being used as reference measurements by the experimental nuclear science community? 2) are these observables given the attention needed by various nuclear data evaluation projects? 3) are there classes of observables that are not connected to these reference measurements? In addressing these questions, we propose several (mostly cross section) observables that should be evaluated and made into reaction reference standards.

  5. Combining Systems and Databases: A Search Engine Retrospective Eric A. Brewer

    E-Print Network [OSTI]

    Brewer, Eric A.

    and complexity of these systems, they make almost no use of DBMS systems. There are many reasons for this, which exists in sets without pointers. This allows evolution of representation and storage, and simplifies query optimizations. We do not however use SQL (a DBMS artifact), but we do use the structure of a DBMS

  6. AN OBJECT-ORIENTED SGML/HYTIME COMPLIANT MULTIMEDIA DATABASE MANAGEMENT SYSTEM*

    E-Print Network [OSTI]

    Szafron, Duane

    management system (DBMS) technology. Mostly they have used DBMSs to store meta-information and have stored of a large amount of data. The development of multimedia computing systems can benefit from traditional DBMS-information in some DBMS. Finally, the size and complexity of multimedia objects require special treatment in storage

  7. Collective Experience: A Database-Fuelled, Inter-Disciplinary Team-Led Learning System

    E-Print Network [OSTI]

    Celi, Leo Anthony G.

    We describe the framework of a data-fuelled, interdisciplinary team-led learning system. The idea is to build models using patients from one's own institution whose features are similar to an index patient as regards an ...

  8. Sustainable Energy Solutions Task 3.0:Life-Cycle Database for Wind Energy Systems

    SciTech Connect (OSTI)

    Janet M Twomey, PhD

    2010-04-30T23:59:59.000Z

    EXECUTIVE SUMMARY The benefits of wind energy had previously been captured in the literature at an overview level with relatively low transparency or ability to understand the basis for that information. This has limited improvement and decision-making to larger questions such as wind versus other electrical sources (such as coal-fired plants). This research project has established a substantially different approach which is to add modular, high granularity life cycle inventory (lci) information that can be used by a wide range of decision-makers, seeking environmental improvement. Results from this project have expanded the understanding and evaluation of the underlying factors that can improve both manufacturing processes and specifically wind generators. The use of life cycle inventory techniques has provided a uniform framework to understand and compare the full range of environmental improvement in manufacturing, hence the concept of green manufacturing. In this project, the focus is on 1. the manufacturing steps that transform materials and chemicals into functioning products 2. the supply chain and end-of-life influences of materials and chemicals used in industry Results have been applied to wind generators, but also impact the larger U.S. product manufacturing base. For chemicals and materials, this project has provided a standard format for each lci that contains an overview and description, a process flow diagram, detailed mass balances, detailed energy of unit processes, and an executive summary. This is suitable for integration into other life cycle databases (such as that at NREL), so that broad use can be achieved. The use of representative processes allows unrestricted use of project results. With the framework refined in this project, information gathering was initiated for chemicals and materials in wind generation. Since manufacturing is one of the most significant parts of the environmental domain for wind generation improvement, this project research has developed a fundamental approach. The emphasis was place on individual unit processes as an organizing framework to understand the life cycle of manufactured products. The rearrangement of unit processes provides an efficient and versatile means of understanding improved manufactured products such as wind generators. The taxonomy and structure of unit process lci were developed in this project. A series of ten unit process lci were developed to sample the major segments of the manufacturing unit process taxonomy. Technical and economic effectiveness has been a focus of the project research in Task three. The use of repeatable modules for the organization of information on environmental improvement has a long term impact. The information developed can be used and reused in a variety of manufacturing plants and for a range of wind generator sizes and designs. Such a modular approach will lower the cost of life cycle analysis, that is often asked questions of carbon footprint, environmental impact, and sustainability. The use of a website for dissemination, linked to NREL, adds to the economic benefit as more users have access to the lci information. Benefit to the public has been achieved by a well-attended WSU conference, as well as presentations for the Kansas Wind Energy Commission. Attendees represented public interests, land owners, wind farm developers, those interested in green jobs, and industry. Another benefit to the public is the start of information flow from manufacturers that can inform individuals about products.

  9. Line graphs e contrazioni: un approccio rigoroso alla space syntax

    E-Print Network [OSTI]

    D'Autilia, Roberto

    2015-01-01T23:59:59.000Z

    The methods of the space syntax have been the subject of extensive discussion, and several techniques to identify the axis lines have been proposed. The space syntax can be represented in terms of line graph, a graphs defined on the edge of a given primary graph. By means of the line graph algorithms, a system of labels defined on the edges of the primary graph is transformed into a system of labels on the vertices of the line graph. The contraction of adjacent edges with the same label allows to build a more general graph than those generated with the methods of the space syntax. By means of the functions implemented in Mathematica is therefore possible to redefine the space syntax on any system of urban quantities (labels) and reproduce the results of the axial lines as a special case. As an example is discussed a possible application of the method to the urban noise analysis.

  10. Directed Graphs, Decompositions, and Spatial Linkages

    E-Print Network [OSTI]

    Shai, Offer; Whiteley, Walter

    2010-01-01T23:59:59.000Z

    The decomposition of a system of constraints into small basic components is an important tool of design and analysis. Specifically, the decomposition of a linkage into minimal components is a central tool of analysis and synthesis of linkages. In this paper we prove that every pinned 3-isostatic (minimally rigid) graph (grounded linkage) has a unique decomposition into minimal strongly connected components (in the sense of directed graphs) which we call 3-Assur graphs. This analysis extends the Assur decompositions of plane linkages previously studied in the mathematical and the mechanical engineering literature. These 3-Assur graphs are the central building blocks for all kinematic linkages in 3-space. They share a number of key combinatorial and geometric properties with the 2-Assur graphs, including an associated lower block-triangular decomposition of the pinned rigidity matrix which provides a format for extending the motion induced by inserting one driver in a bottom Assur linkage to the joints of the e...

  11. Clustering attributed graphs: models, measures and methods

    E-Print Network [OSTI]

    Bothorel, Cecile; Magnani, Matteo; Micenkova, Barbora

    2015-01-01T23:59:59.000Z

    Clustering a graph, i.e., assigning its nodes to groups, is an important operation whose best known application is the discovery of communities in social networks. Graph clustering and community detection have traditionally focused on graphs without attributes, with the notable exception of edge weights. However, these models only provide a partial representation of real social systems, that are thus often described using node attributes, representing features of the actors, and edge attributes, representing different kinds of relationships among them. We refer to these models as attributed graphs. Consequently, existing graph clustering methods have been recently extended to deal with node and edge attributes. This article is a literature survey on this topic, organizing and presenting recent research results in a uniform way, characterizing the main existing clustering methods and highlighting their conceptual differences. We also cover the important topic of clustering evaluation and identify current open ...

  12. A Policy-Based Characterization Model and a Comprehensive Survey of Database Replication Systems

    E-Print Network [OSTI]

    Muńoz, Francesc

    . I. Ruiz-Fuertes1, A. Schiper2, R. C. Oliveira3, F. D. Mu~noz-Esco´i1 1Instituto Tecnol´ogico de Replication Systems M. I. Ruiz-Fuertes1, A. Schiper2, R. C. Oliveira3, F. D. Mu~noz-Esco´i1 1Instituto Tecnol

  13. Integrating Association Rule Mining with Relational Database Systems: Alternatives and Implications

    E-Print Network [OSTI]

    Sarawagi, Sunita

    warehouses. The initial research on data mining was concentrated on defining new mining operations@almaden.ibm.com IBM Almaden Research Center 650 Harry Road, San Jose, CA 95120 Abstract Data mining on large data the data to a file system on­the­fly and mining; tight­coupling using pri­ marily user­defined functions

  14. Integrating Association Rule Mining with Relational Database Systems: Alternatives and Implications

    E-Print Network [OSTI]

    Sarawagi, Sunita

    warehouses. The initial research on data mining was concentrated on de ning new mining operations@almaden.ibm.com IBM Almaden Research Center 650 Harry Road, San Jose, CA 95120 Abstract Data mining on large data the data to a le system on-the- y and mining; tight-coupling using pri- marily user-de ned functions

  15. Science Gateway Databases

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

    Science Databases Science Database Services NERSC supports the provisioning of databases to hold large scientific datasets, as part of the science gateways effort. Data-centric...

  16. Methods of visualizing graphs

    DOE Patents [OSTI]

    Wong, Pak C. (Richland, WA); Mackey, Patrick S. (Kennewick, WA); Perrine, Kenneth A. (Richland, WA); Foote, Harlan P. (Richland, WA); Thomas, James J. (Richland, WA)

    2008-12-23T23:59:59.000Z

    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.

  17. 2nd Quarterly technical progress report for geothermal system temperature-depth database

    SciTech Connect (OSTI)

    Blackwell, D.D.

    1997-07-30T23:59:59.000Z

    At the Southern Methodist University Geothermal Laboratory in Dallas, Texas, the Earth`s surface and internal temperature are studied. With financial support from the U.S. Department of Energy, a data base containing geothermal temperature well information for the United States is being developed. During this calendar quarter, activity with this project has continued involving several different tasks: planning and development of the geothermal system thermal-well data base and temperature-depth data, development of the specifications for the data base, and completion of an initial inventory of the geothermal areas for which data are available.

  18. 3rd Quarterly technical progress report for geothermal system temperature-depth database

    SciTech Connect (OSTI)

    Blackwell, D.D.

    1997-10-31T23:59:59.000Z

    At the Southern Methodist University Geothermal Laboratory in Dallas, Texas, the Earth`s surface and internal temperature are studied. With financial support from the U.S. Department of Energy, a data base containing geothermal temperature well information for the United States is being developed. During this calendar quarter, activity with this project has continued involving several different tasks: planning and development of the geothermal system thermal-well data base and temperature-depth data, and development of a World Wide Web home page.

  19. Fault-tolerant distributed transactions for partitioned OLTP databases

    E-Print Network [OSTI]

    Jones, Evan P. C. (Evan Philip Charles), 1981-

    2012-01-01T23:59:59.000Z

    This thesis presents Dtxn, a fault-tolerant distributed transaction system designed specifically for building online transaction processing (OLTP) databases. Databases have traditionally been designed as general purpose ...

  20. automated database mediation: Topics by E-print Network

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

    of database approach + Database Management System (DBMS) + Advantages of Using DBMS + Workers Adam, Salah 239 Mediated Homogenization Quantum Physics (arXiv) Summary:...

  1. DISTRIBUTED DATABASES INTRODUCTION

    E-Print Network [OSTI]

    Liu, Chengfei

    D DISTRIBUTED DATABASES INTRODUCTION The development of network and data communication tech- nology distributed database management. Naturally, the decen- tralized approach reflects the distributed aspects in the definition of a distributed database exist. First, a distributed database is distributed

  2. Spectral characterizations of sun graphs and broken sun graphs

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    Spectral characterizations of sun graphs and broken sun graphs Romain Boulet 10 Dec 2009 Abstract- cyclic graphs. An odd (resp. even) sun is a graph obtained by appending a pendant vertex to each vertex of an odd (resp. even) cycle. A broken sun is a graph obtained by deleting pendant vertices of a sun

  3. Revisiting Interval Graphs for Network Science

    E-Print Network [OSTI]

    Loe, Chuan Wen

    2015-01-01T23:59:59.000Z

    The vertices of an interval graph represent intervals over a real line where overlapping intervals denote that their corresponding vertices are adjacent. This implies that the vertices are measurable by a metric and there exists a linear structure in the system. The generalization is an embedding of a graph onto a multi-dimensional Euclidean space and it was used by scientists to study the multi-relational complexity of ecology. However the research went out of fashion in the 1980s and was not revisited when Network Science recently expressed interests with multi-relational networks known as multiplexes. This paper studies interval graphs from the perspective of Network Science.

  4. Extending graph homomorphism and simulation for real life graph matching 

    E-Print Network [OSTI]

    Wu, Yinghui

    2011-06-30T23:59:59.000Z

    Among the vital problems in a variety of emerging applications is the graph matching problem, which is to determine whether two graphs are similar, and if so, find all the valid matches in one graph for the other, based ...

  5. Graph concatenation for quantum codes

    E-Print Network [OSTI]

    Beigi, Salman

    Graphs are closely related to quantum error-correcting codes: every stabilizer code is locally equivalent to a graph code and every codeword stabilized code can be described by a graph and a classical code. For the ...

  6. Database, Spatial Spatial databases are the foundation for computer-based applications involving spatially

    E-Print Network [OSTI]

    managed using a particular type of software called a database management system (DBMS) that allows, leading to spatio-temporal databases when geometric evolutions are supported. Spatial databases can be implemented in a GIS, in a computer-assisted design (CAD) system coupled with a DBMS, in a universal server

  7. ARTI refrigerant database

    SciTech Connect (OSTI)

    Calm, J.M. [Calm (James M.), Great Falls, VA (United States)

    1999-01-01T23:59:59.000Z

    The Refrigerant Database is an information system on alternative refrigerants, associated lubricants, and their use in air conditioning and refrigeration. It consolidates and facilities access to property, compatibility, environmental, safety, application and other information. It provides corresponding information on older refrigerants, to assist manufacturers and those using alternative refrigerants, to make comparisons and determine differences. The underlying purpose is to accelerate phase out of chemical compounds of environmental concern.

  8. ARTI refrigerant database

    SciTech Connect (OSTI)

    Calm, J.M.

    1996-11-15T23:59:59.000Z

    The Refrigerant Database is an information system on alternative refrigerants, associated lubricants, and their use in air conditioning and refrigeration. It consolidates and facilitates access to property, compatibility, environmental, safety, application and other information. It provides corresponding information on older refrigerants, to assist manufacturers and those using alternative refrigerants, to make comparisons and determine differences. The underlying purpose is to accelerate phase out of chemical compounds of environmental concern.

  9. ARTI refrigerant database

    SciTech Connect (OSTI)

    Calm, J.M.

    1996-07-01T23:59:59.000Z

    The Refrigerant Database is an information system on alternative refrigerants, associated lubricants, and their use in air conditioning and refrigeration. It consolidates and facilitates access to property, compatibility, environmental, safety, application and other information. It provides corresponding information on older refrigerants, to assist manufacturers and those using alternative refrigerants, to make comparisons and determine differences. The underlying purpose is to accelerate phase out of chemical compounds of environmental concern.

  10. March 23, 2008 Databases: Practical DB Design 1 Practical Database Design

    E-Print Network [OSTI]

    Adam, Salah

    approach towards development of information system, called, Information System Development Life Cycle. #12 of Information Systems in Organizations + Why Organizations Use DB Systems + Information System Life Cycle System Life Cycle ... Database DBMS Users Users #12;March 23, 2008 Databases: Practical DB Design 8

  11. NUCLEAR STRUCTURE DATABASE

    E-Print Network [OSTI]

    Firestone, R.B.

    2010-01-01T23:59:59.000Z

    CALIFORNIA NUCLEAR STRUCTURE DATABASE R. B. Firestone and E.11089 NUCLEAR STRUCTURE DATABASE by R.B. Firestone and E.iii- NUCLEAR STRUCTURE DATABASE R.B Firestone and E. Browne

  12. SU-E-J-129: A Strategy to Consolidate the Image Database of a VERO Unit Into a Radiotherapy Management System

    SciTech Connect (OSTI)

    Yan, Y; Medin, P; Yordy, J; Zhao, B; Jiang, S [UT Southwestern Medical Center, Dallas, TX (United States)

    2014-06-01T23:59:59.000Z

    Purpose: To present a strategy to integrate the imaging database of a VERO unit with a treatment management system (TMS) to improve clinical workflow and consolidate image data to facilitate clinical quality control and documentation. Methods: A VERO unit is equipped with both kV and MV imaging capabilities for IGRT treatments. It has its own imaging database behind a firewall. It has been a challenge to transfer images on this unit to a TMS in a radiation therapy clinic so that registered images can be reviewed remotely with an approval or rejection record. In this study, a software system, iPump-VERO, was developed to connect VERO and a TMS in our clinic. The patient database folder on the VERO unit was mapped to a read-only folder on a file server outside VERO firewall. The application runs on a regular computer with the read access to the patient database folder. It finds the latest registered images and fuses them in one of six predefined patterns before sends them via DICOM connection to the TMS. The residual image registration errors will be overlaid on the fused image to facilitate image review. Results: The fused images of either registered kV planar images or CBCT images are fully DICOM compatible. A sentinel module is built to sense new registered images with negligible computing resources from the VERO ExacTrac imaging computer. It takes a few seconds to fuse registered images and send them to the TMS. The whole process is automated without any human intervention. Conclusion: Transferring images in DICOM connection is the easiest way to consolidate images of various sources in your TMS. Technically the attending does not have to go to the VERO treatment console to review image registration prior delivery. It is a useful tool for a busy clinic with a VERO unit.

  13. Graph representation of protein free energy landscape

    SciTech Connect (OSTI)

    Li, Minghai; Duan, Mojie; Fan, Jue; Huo, Shuanghong, E-mail: shuo@clarku.edu [Gustaf H. Carlson School of Chemistry and Biochemistry, Clark University, 950 Main Street, Worcester, Massachusetts 01610 (United States)] [Gustaf H. Carlson School of Chemistry and Biochemistry, Clark University, 950 Main Street, Worcester, Massachusetts 01610 (United States); Han, Li [Department of Mathematics and Computer Science, Clark University, 950 Main Street, Worcester, Massachusetts 01610 (United States)] [Department of Mathematics and Computer Science, Clark University, 950 Main Street, Worcester, Massachusetts 01610 (United States)

    2013-11-14T23:59:59.000Z

    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.

  14. A Graph Bottleneck Inequality

    E-Print Network [OSTI]

    Chebotarev, Pavel

    2008-01-01T23:59:59.000Z

    For a weighted multidigraph, let $f_{ij}$ be the total weight of spanning converging forests that have vertex $i$ in a tree converging to $j$. We prove that $f_{ij}f_{jk}=f_{ik}f_{jj}$ if and only if every directed path from $i$ to $k$ contains $j$ (a graph bottleneck equality). Otherwise, $f_{ij}f_{jk}inequality). In a companion paper, this inequality provides the foundation for the construction of a new family of graph distances by ensuring the fulfillment of the triangle inequality. This stems from the fact that the graph bottleneck inequality is a multiplicative analogue of the triangle inequality for proximities.

  15. Efficiently Controllable Graphs

    E-Print Network [OSTI]

    Can Gokler; Kevin Thompson; Peter Shor; Seth Lloyd

    2015-03-18T23:59:59.000Z

    We show that universal quantum computation can be performed efficiently on quantum networks while the fraction of controlled subsystems vanishes as the network grows larger. We provide examples of quantum spin network families admitting polynomial quantum gate complexity with a vanishing fraction of controlled spins. We define a new family of graphs, the efficiently controllable family, which admits efficient computation with vanishing fraction of controls. We explore generalizations to percolation clusters, fractals and random graphs. We show that the classical computational complexity of estimating the ground state of Hamiltonians described by controllable graphs is polynomial in the number of subsystems/qubits.

  16. Continuous Time Group Discovery in Dynamic Graphs

    SciTech Connect (OSTI)

    Miller, K; Eliassi-Rad, T

    2010-11-04T23:59:59.000Z

    With the rise in availability and importance of graphs and networks, it has become increasingly important to have good models to describe their behavior. While much work has focused on modeling static graphs, we focus on group discovery in dynamic graphs. We adapt a dynamic extension of Latent Dirichlet Allocation to this task and demonstrate good performance on two datasets. Modeling relational data has become increasingly important in recent years. Much work has focused on static graphs - that is fixed graphs at a single point in time. Here we focus on the problem of modeling dynamic (i.e. time-evolving) graphs. We propose a scalable Bayesian approach for community discovery in dynamic graphs. Our approach is based on extensions of Latent Dirichlet Allocation (LDA). LDA is a latent variable model for topic modeling in text corpora. It was extended to deal with topic changes in discrete time and later in continuous time. These models were referred to as the discrete Dynamic Topic Model (dDTM) and the continuous Dynamic Topic Model (cDTM), respectively. When adapting these models to graphs, we take our inspiration from LDA-G and SSN-LDA, applications of LDA to static graphs that have been shown to effectively factor out community structure to explain link patterns in graphs. In this paper, we demonstrate how to adapt and apply the cDTM to the task of finding communities in dynamic networks. We use link prediction to measure the quality of the discovered community structure and apply it to two different relational datasets - DBLP author-keyword and CAIDA autonomous systems relationships. We also discuss a parallel implementation of this approach using Hadoop. In Section 2, we review LDA and LDA-G. In Section 3, we review the cDTM and introduce cDTMG, its adaptation to modeling dynamic graphs. We discuss inference for the cDTM-G and details of our parallel implementation in Section 4 and present its performance on two datasets in Section 5 before concluding in Section 6.

  17. ARTI refrigerant database

    SciTech Connect (OSTI)

    Calm, J.M. [Calm (James M.), Great Falls, VA (United States)] [Calm (James M.), Great Falls, VA (United States)

    1996-04-15T23:59:59.000Z

    The Refrigerant Database is an information system on alternative refrigerants, associated lubricants, and their use in air conditioning and refrigeration. It consolidates and facilitates access to property, compatibility, environmental, safety, application and other information. It provides corresponding information on older refrigerants, to assist manufacturers and those using alternative refrigerants, to make comparisons and determine differences. The underlying purpose is to accelerate phase out of chemical compounds of environmental concern. The database provides bibliographic citations and abstracts for publications that may be useful in research and design of air-conditioning and refrigeration equipment. The complete documents are not included, though some may be added at a later date. The database identifies sources of specific information on refrigerants. It addresses lubricants including alkylbenzene, polyalkylene glycol, polyolester, and other synthetics as well as mineral oils. It also references documents addressing compatibility of refrigerants and lubricants with metals, plastics, elastomers, motor insulation, and other materials used in refrigerant circuits. Incomplete citations or abstracts are provided for some documents. They are included to accelerate availability of the information and will be completed or replaced in future updates. Citations in this report are divided into the following topics: thermophysical properties; materials compatibility; lubricants and tribology; application data; safety; test and analysis methods; impacts; regulatory actions; substitute refrigerants; identification; absorption and adsorption; research programs; and miscellaneous documents. Information is also presented on ordering instructions for the computerized version.

  18. ARTI refrigerant database

    SciTech Connect (OSTI)

    Calm, J.M. [Calm (James M.), Great Falls, VA (United States)

    1998-08-01T23:59:59.000Z

    The Refrigerant Database is an information system on alternative refrigerants, associated lubricants, and their use in air conditioning and refrigeration. It consolidates and facilitates access to property, compatibility, environmental, safety, application and other information. It provides corresponding information on older refrigerants, to assist manufactures and those using alternative refrigerants, to make comparisons and determine differences. The underlying purpose is to accelerate phase out of chemical compounds of environmental concern. The database provides bibliographic citations and abstracts for publications that may be useful in research and design of air-conditioning and refrigeration equipment. The complete documents are not included, though some may be added at a later date. The database identifies sources of specific information on many refrigerants including propane, ammonia, water, carbon dioxide, propylene, ethers, and others as well as azeotropic and zeotropic blends of these fluids. It addresses lubricants including alkylbenzene, polyalkylene glycol, polyolester, and other synthetics as well as mineral oils. It also references documents addressing compatibility of refrigerants and lubricants with metals, plastics, elastomers, motor insulation, and other materials used in refrigerant circuits. Incomplete citations or abstracts are provided for some documents. They are included to accelerate availability of the information and will be completed or replaced in future updates.

  19. ARTI refrigerant database

    SciTech Connect (OSTI)

    Calm, J.M.

    1997-02-01T23:59:59.000Z

    The Refrigerant Database is an information system on alternative refrigerants, associated lubricants, and their use in air conditioning and refrigeration. It consolidates and facilitates access to property, compatibility, environmental, safety, application and other information. It provides corresponding information on older refrigerants, to assist manufacturers and those using alterative refrigerants, to make comparisons and determine differences. The underlying purpose is to accelerate phase out of chemical compounds of environmental concern. The database provides bibliographic citations and abstracts for publications that may be useful in research and design of air-conditioning and refrigeration equipment. The complete documents are not included, though some may be added at a later date. The database identifies sources of specific information on various refrigerants. It addresses lubricants including alkylbenzene, polyalkylene glycol, polyolester, and other synthetics as well as mineral oils. It also references documents addressing compatibility of refrigerants and lubricants with metals, plastics, elastomers, motor insulation, and other materials used in refrigerant circuits. Incomplete citations or abstracts are provided for some documents. They are included to accelerate availability of the information and will be completed or replaced in future updates.

  20. Geometry of graph varieties

    E-Print Network [OSTI]

    Martin, Jeremy L.

    2003-01-01T23:59:59.000Z

    (G)isasetofedges, or unordered pairs of distinct verticesfv;wg.Wefrequently abbreviatefv;wgby vw when no confusion can arise (for instance, when the vertices are one-digit positive integers). The vertices v;w are called the endpoints of the edge vw.Asubgraph of G is a graph G 0... =(V 0 ;E 0 )withV 0 V and E 0 E.We de ne K(V 0 )=fvw j v;w2V 0 ;v6= wg and E(V 0 )=E\\K(V 0 ): The complete graph on V is the graph (V;K(V)). We write K n for the complete graph onf1;:::;ng.ForE 0 E and v2V,thevalence of v with respect to E 0 is val...

  1. Querying graphs with data 

    E-Print Network [OSTI]

    Vrgoc, Domagoj

    2014-06-27T23:59:59.000Z

    Graph data is becoming more and more pervasive. Indeed, services such as Social Networks or the Semantic Web can no longer rely on the traditional relational model, as its structure is somewhat too rigid for the applications ...

  2. Graph similarity and matching

    E-Print Network [OSTI]

    Zager, Laura (Laura A.)

    2005-01-01T23:59:59.000Z

    Measures of graph similarity have a broad array of applications, including comparing chemical structures, navigating complex networks like the World Wide Web, and more recently, analyzing different kinds of biological data. ...

  3. Graphing at Pepco

    SciTech Connect (OSTI)

    Not Available

    1984-11-01T23:59:59.000Z

    Pepco's $250,000 worth of computer-graphics equipment has let the utility produce 60 to 100 graphs a day, for everyone from engineers to executives. The types and uses of computer graphics equipment are discussed.

  4. Database Management Certificate Program

    E-Print Network [OSTI]

    Rose, Michael R.

    Database Management Certificate Program DATABASE TECHNOLOGIES 13 Today, organizations in every to obtain general data analysis and management skills or apply both Oracle and Microsoft SQL Server database capabilities of relational databases in conjunction with the new "Big Data" management frameworks for data

  5. Drawing symmetric planar graphs

    E-Print Network [OSTI]

    Meric, Burak Necati

    1998-01-01T23:59:59.000Z

    16 17 19 20 21 22 23 24 25 26 A drawing generated by repeating graphs. Generation of the drawing with the unit cell. Calculation of the converted lines. Rectangular unit cell for hexagonal groups. Construction ofhexagonal cells by using... of pixels requires much computer memories and much powerful processors. Figure 1. A drawing generated by repeating graphs. Drawing uses an object-oriented point of view. In drawing, patterns are created as a collection of objects such as points, lines...

  6. Abstract--A wide variety of DSP design tools have been developed that incorporate dataflow graph representations into

    E-Print Network [OSTI]

    Bhattacharyya, Shuvra S.

    framework for construction and manipulation of dataflow graphs for DSP system design. To facilitate design of complex systems, our framework includes a powerful integration of C-based procedural programming topologies increases, textual manipulation of graph specifications becomes increasingly important

  7. On the concurrent semantics of Algebraic Graph Grammars #

    E-Print Network [OSTI]

    Baldan, Paolo

    â??a di Pisa, Italy baldan@dsi.unive.it andrea@di.unipi.it Abstract. Graph grammars are a powerful model. These semantics have served as basis for the development of a variety of modelling and verification techniques graph transformation systems as an alternative model of concurrency, extending Petri nets. The basic

  8. Power Domination in Cylinders, Tori, and Generalized Petersen Graphs

    E-Print Network [OSTI]

    Ferrero, Daniela - Department of Mathematics, Texas State University

    of graphs by Haynes et al. in 2002 [7]. Indeed, an electrical power network can be modeled by a graph where for power system monitoring. The minimum cardi- nality of a PDS of G is its power domination number. INTRODUCTION Electric power companies need to monitor the state of their networks continually. The state

  9. Graph Concatenation for Quantum Codes

    E-Print Network [OSTI]

    Salman Beigi; Isaac Chuang; Markus Grassl; Peter Shor; Bei Zeng

    2010-02-03T23:59:59.000Z

    Graphs are closely related to quantum error-correcting codes: every stabilizer code is locally equivalent to a graph code, and every codeword stabilized code can be described by a graph and a classical code. For the construction of good quantum codes of relatively large block length, concatenated quantum codes and their generalizations play an important role. We develop a systematic method for constructing concatenated quantum codes based on "graph concatenation", where graphs representing the inner and outer codes are concatenated via a simple graph operation called "generalized local complementation." Our method applies to both binary and non-binary concatenated quantum codes as well as their generalizations.

  10. Improving Attack Graph Visualization through Data Reduction and Attack Grouping

    SciTech Connect (OSTI)

    John Homer; Ashok Varikuti; Xinming Ou; Miles A. McQueen

    2008-09-01T23:59:59.000Z

    Various tools exist to analyze enterprise network systems and to produce attack graphs detailing how attackers might penetrate into the system. These attack graphs, however, are often complex and difficult to comprehend fully, and a human user may find it problematic to reach appropriate configuration decisions. This paper presents methodologies that can 1) automatically identify portions of an attack graph that do not help a user to understand the core security problems and so can be trimmed, and 2) automatically group similar attack steps as virtual nodes in a model of the network topology, to immediately increase the understandability of the data. We believe both methods are important steps toward improving visualization of attack graphs to make them more useful in configuration management for large enterprise networks. We implemented our methods using one of the existing attack-graph toolkits. Initial experimentation shows that the proposed approaches can 1) significantly reduce the complexity of attack graphs by trimming a large portion of the graph that is not needed for a user to understand the security problem, and 2) significantly increase the accessibility and understandability of the data presented in the attack graph by clearly showing, within a generated visualization of the network topology, the number and type of potential attacks to which each host is exposed.

  11. Graph dynamics : learning and representation

    E-Print Network [OSTI]

    Ribeiro, Andre Figueiredo

    2006-01-01T23:59:59.000Z

    Graphs are often used in artificial intelligence as means for symbolic knowledge representation. A graph is nothing more than a collection of symbols connected to each other in some fashion. For example, in computer vision ...

  12. Fast Search for Dynamic Multi-Relational Graphs

    SciTech Connect (OSTI)

    Choudhury, Sutanay; Holder, Larry; Chin, George; Feo, John T.

    2013-06-23T23:59:59.000Z

    Acting on time-critical events by processing ever growing social media or news streams is a major technical challenge. Many of these data sources can be modeled as multi-relational graphs. Continuous queries or techniques to search for rare events that typically arise in monitoring applications have been studied extensively for relational databases. This work is dedicated to answer the question that emerges naturally: how can we efficiently execute a continuous query on a dynamic graph? This paper presents an exact subgraph search algorithm that exploits the temporal characteristics of representative queries for online news or social media monitoring. The algorithm is based on a novel data structure called the that leverages the structural and semantic characteristics of the underlying multi-relational graph. The paper concludes with extensive experimentation on several real-world datasets that demonstrates the validity of this approach.

  13. Temporal Representation in Semantic Graphs

    SciTech Connect (OSTI)

    Levandoski, J J; Abdulla, G M

    2007-08-07T23:59:59.000Z

    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.

  14. The EMIME Bilingual Database 

    E-Print Network [OSTI]

    Wester, Mirjam

    2010-01-01T23:59:59.000Z

    This paper describes the collection of a bilingual database of Finnish/English and German/English data. In addition, the accents of the talkers in the database have been rated. English, German and Finnish listeners assessed the English, German...

  15. Quantum secret sharing with qudit graph states

    SciTech Connect (OSTI)

    Keet, Adrian; Fortescue, Ben; Sanders, Barry C. [Institute for Quantum Information Science, University of Calgary, Alberta, T2N 1N4 (Canada); Markham, Damian [LTCI-CNRS, Telecom ParisTech, 37/39 rue Dareau, F-75014 Paris (France)

    2010-12-15T23:59:59.000Z

    We present a unified formalism for threshold quantum secret sharing using graph states of systems with prime dimension. We construct protocols for three varieties of secret sharing: with classical and quantum secrets shared between parties over both classical and quantum channels.

  16. Densities in graphs and matroids

    E-Print Network [OSTI]

    Kannan, Lavanya

    2009-05-15T23:59:59.000Z

    Certain graphs can be described by the distribution of the edges in its subgraphs. For example, a cycle C is a graph that satisfies |E(H)| |V (H)| < |E(C)| |V (C)| = 1 for all non-trivial subgraphs of C. Similarly, a tree T is a graph that satisfies...

  17. ORACLE CERTIFICATION Oracle Database

    E-Print Network [OSTI]

    Loudon, Catherine

    ORACLE CERTIFICATION Oracle Database Administration Certificate Program Train with the best. Get your Oracle Database Administration education from the number-one provider* of Oracle training-on, lab-based understanding of Oracle, the world's leading database platform, and long the product

  18. Database Encryption Luc Bouganim

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    Database Encryption Luc Bouganim INRIA Rocquencourt Le Chesnay, FRANCE Luc.Bouganim@inria.fr Yanli GUO INRIA Rocquencourt Le Chesnay, FRANCE yanli.guo@inria.fr Related concepts and keywords Database security, Data confidentiality, Hardware Security Module Definition Database encryption refers to the use

  19. Network-based statistical comparison of citation topology of bibliographic databases

    E-Print Network [OSTI]

    Šubelj, Lovro; Bajec, Marko

    2015-01-01T23:59:59.000Z

    Modern bibliographic databases provide the basis for scientific research and its evaluation. While their content and structure differ substantially, there exist only informal notions on their reliability. Here we compare the topological consistency of citation networks extracted from six popular bibliographic databases including Web of Science, CiteSeer and arXiv.org. The networks are assessed through a rich set of local and global graph statistics. We first reveal statistically significant inconsistencies between some of the databases with respect to individual statistics. For example, the introduced field bow-tie decomposition of DBLP Computer Science Bibliography substantially differs from the rest due to the coverage of the database, while the citation information within arXiv.org is the most exhaustive. Finally, we compare the databases over multiple graph statistics using the critical difference diagram. The citation topology of DBLP Computer Science Bibliography is the least consistent with the rest, w...

  20. DEPOT database: Reference manual and user's guide

    SciTech Connect (OSTI)

    Clancey, P.; Logg, C.

    1991-03-01T23:59:59.000Z

    DEPOT has been developed to provide tracking for the Stanford Linear Collider (SLC) control system equipment. For each piece of equipment entered into the database, complete location, service, maintenance, modification, certification, and radiation exposure histories can be maintained. To facilitate data entry accuracy, efficiency, and consistency, barcoding technology has been used extensively. DEPOT has been an important tool in improving the reliability of the microsystems controlling SLC. This document describes the components of the DEPOT database, the elements in the database records, and the use of the supporting programs for entering data, searching the database, and producing reports from the information.

  1. Data Quality of Native XML Databases in the Healthcare Domain

    E-Print Network [OSTI]

    North, Siobhán

    .0 [Database Management]: Security, integrity and protection; K.6.4 [System Management]: Quality assurance; J.3 are not foolproof. This report reviews work on data quality in both database and management research areas support database systems provide in giving a measure of the quality of the data they hold. This inducts

  2. Spectral fluctuations of quantum graphs

    SciTech Connect (OSTI)

    Pluha?, Z. [Faculty of Mathematics and Physics, Charles University, 180 00 Praha 8 (Czech Republic); Weidenmüller, H. A. [Max-Planck-Institut für Kernphysik, 69029 Heidelberg (Germany)

    2014-10-15T23:59:59.000Z

    We prove the Bohigas-Giannoni-Schmit conjecture in its most general form for completely connected simple graphs with incommensurate bond lengths. We show that for graphs that are classically mixing (i.e., graphs for which the spectrum of the classical Perron-Frobenius operator possesses a finite gap), the generating functions for all (P,Q) correlation functions for both closed and open graphs coincide (in the limit of infinite graph size) with the corresponding expressions of random-matrix theory, both for orthogonal and for unitary symmetry.

  3. Cliques in graphs

    E-Print Network [OSTI]

    Lo, Allan

    2010-10-12T23:59:59.000Z

    Cliques in Graphs Siu Lun Allan Lo Christ’s College University of Cambridge A thesis submitted for the degree of Doctor of Philosophy 2010 Declaration This dissertation is the result of my own work and includes nothing which is the outcome of work...

  4. DRAFT Chapter 1 Introduction to spatial databases

    E-Print Network [OSTI]

    Shekhar, Shashi

    . Today, data is housed in and managed via a database management system (DBMS). Databases and the software which manages them (DBMS) are the silent success story of the information age. They have slowly role of a DBMS has been that of a simple but e#11;ective warehouse of business and accounting data

  5. Database Description with SDM: A Semantic Database Model

    E-Print Network [OSTI]

    McLeod, Dennis

    Database Description with SDM: A Semantic Database Model MICHAEL HAMMER Massachusetts Institute of Technology and DENNIS McLEOD University of Southern California SDM is a high-level semantics-based database description and structuring formalism (database model) for databases. This database model is designed

  6. Database tool ASGARD: an open-access database of

    E-Print Network [OSTI]

    Extavour, Cassandra

    Database tool ASGARD: an open-access database of annotated transcriptomes for emerging model database, the Assembled Searchable Giant Arthropod Read Database (ASGARD). This database is a repository include search term auto-completion sug- gestions based on database content, the ability to download

  7. Testing Database-Centric Applications For Causes of Database Deadlocks

    E-Print Network [OSTI]

    Grechanik, Mark

    Testing Database-Centric Applications For Causes of Database Deadlocks Mark Grechanik, B. M. Mainul--Many organizations deploy applications that use databases by sending Structured Query Language (SQL) state- ments the same databases concurrently, database deadlocks routinely occur in these databases. Testing

  8. arti refrigerant database: Topics by E-print Network

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

    textbooks: Database Systems Alechina, Natasha 86 Energy Savings from Floating Head Pressure in Ammonia Refrigeration Systems Texas A&M University - TxSpace Summary:...

  9. SDT: A Database Schema Design and Translation Tool, Reference Manual, Draft 4.1

    E-Print Network [OSTI]

    Markowitz, V.M.

    2008-01-01T23:59:59.000Z

    Sciences Division SDT: A Database Schema Design andDE-AC03-76SF00098 :tl F' LB SDT A DATABASE SCHEMA DESIGN ANDof data", ACM Trans. on Database Systems 1,1 (March 1976),

  10. Pipeline system insulation: Thermal insulation and corrosion prevention. (Latest citations from the Rubber and Plastics Research Association database). Published Search

    SciTech Connect (OSTI)

    Not Available

    1994-05-01T23:59:59.000Z

    The bibliography contains citations concerning thermal and corrosion insulation of pipeline systems used to transport liquids and gases. Topics include thermal aging of polyurethane used for foam heating pipes, extrusion film pipeline insulation materials and processes, flexible expanded nitrile rubber pipeline insulation with Class 1 fire rating, and underground fiberglass reinforced polyester insulated pipeline systems. Applications in solar heating systems; underground water, oil, and gas pipelines; interior hot and cold water lines under seawater; and chemical plant pipeline system insulation are included. (Contains 250 citations and includes a subject term index and title list.)

  11. Crunching Large Graphs with Commodity Processors

    SciTech Connect (OSTI)

    Nelson, Jacob E.; Myers, Brandon D.; Hunter, Andrew H.; Briggs, Preston; Ceze, Luis; Ebeling, William C.; Grossman, Dan; Kahan, Simon H.; Oskin, Mark

    2011-05-26T23:59:59.000Z

    Crunching large graphs is the basis of many emerging appli- cations, such as social network analysis and bioinformatics. Graph analytics algorithms exhibit little locality and therefore present signi?cant performance challenges. Hardware multi- threading systems (e.g, Cray XMT) show that with enough concurrency, we can tolerate long latencies. Unfortunately, this solution is not available with commodity parts. Our goal is to develop a latency-tolerant system built out of commodity parts and mostly in software. The proposed system includes a runtime that supports a large number of lightweight contexts, full-bit synchronization and a memory manager that provides a high-latency but high-bandwidth global shared memory. This paper lays out the vision for our system, and justi?es its feasibility with a performance analysis of the run- time for latency tolerance.

  12. Evolution of the Configuration Database Design

    SciTech Connect (OSTI)

    Salnikov, A

    2006-04-19T23:59:59.000Z

    The BABAR experiment at SLAC successfully collects physics data since 1999. One of the major parts of its on-line system is the configuration database which provides other parts of the system with the configuration data necessary for data taking. Originally the configuration database was implemented in the Objectivity/DB ODBMS. Recently BABAR performed a successful migration of its event store from Objectivity/DB to ROOT and this prompted a complete phase-out of the Objectivity/DB in all other BABAR databases. It required the complete redesign of the configuration database to hide any implementation details and to support multiple storage technologies. In this paper we describe the process of the migration of the configuration database, its new design, implementation strategy and details.

  13. Lessons Learned From Developing Reactor Pressure Vessel Steel Embrittlement Database

    SciTech Connect (OSTI)

    Wang, Jy-An John [ORNL

    2010-08-01T23:59:59.000Z

    Materials behaviors caused by neutron irradiation under fission and/or fusion environments can be little understood without practical examination. Easily accessible material information system with large material database using effective computers is necessary for design of nuclear materials and analyses or simulations of the phenomena. The developed Embrittlement Data Base (EDB) at ORNL is this comprehensive collection of data. EDB database contains power reactor pressure vessel surveillance data, the material test reactor data, foreign reactor data (through bilateral agreements authorized by NRC), and the fracture toughness data. The lessons learned from building EDB program and the associated database management activity regarding Material Database Design Methodology, Architecture and the Embedded QA Protocol are described in this report. The development of IAEA International Database on Reactor Pressure Vessel Materials (IDRPVM) and the comparison of EDB database and IAEA IDRPVM database are provided in the report. The recommended database QA protocol and database infrastructure are also stated in the report.

  14. Transfer of Physical and Hydraulic Properties Databases to the Hanford Environmental Information System - PNNL Remediation Decision Support Project, Task 1, Activity 6

    SciTech Connect (OSTI)

    Rockhold, Mark L.; Middleton, Lisa A.

    2009-03-31T23:59:59.000Z

    This report documents the requirements for transferring physical and hydraulic property data compiled by PNNL into the Hanford Environmental Information System (HEIS). The Remediation Decision Support (RDS) Project is managed by Pacific Northwest National Laboratory (PNNL) to support Hanford Site waste management and remedial action decisions by the U.S. Department of Energy and one of their current site contractors - CH2M-Hill Plateau Remediation Company (CHPRC). The objective of Task 1, Activity 6 of the RDS project is to compile all available physical and hydraulic property data for sediments from the Hanford Site, to port these data into the Hanford Environmental Information System (HEIS), and to make the data web-accessible to anyone on the Hanford Local Area Network via the so-called Virtual Library.1 These physical and hydraulic property data are used to estimate parameters for analytical and numerical flow and transport models that are used for site risk assessments and evaluation of remedial action alternatives. In past years efforts were made by RDS project staff to compile all available physical and hydraulic property data for Hanford sediments and to transfer these data into SoilVision{reg_sign}, a commercial geotechnical software package designed for storing, analyzing, and manipulating soils data. Although SoilVision{reg_sign} has proven to be useful, its access and use restrictions have been recognized as a limitation to the effective use of the physical and hydraulic property databases by the broader group of potential users involved in Hanford waste site issues. In order to make these data more widely available and useable, a decision was made to port them to HEIS and to make them web-accessible via a Virtual Library module. In FY08 the original objectives of this activity on the RDS project were to: (1) ensure traceability and defensibility of all physical and hydraulic property data currently residing in the SoilVision{reg_sign} database maintained by PNNL, (2) transfer the physical and hydraulic property data from the Microsoft Access database files used by SoilVision{reg_sign} into HEIS, which is currently being maintained by CHRPC, (3) develop a Virtual Library module for accessing these data from HEIS, and (4) write a User's Manual for the Virtual Library module. The intent of these activities is to make the available physical and hydraulic property data more readily accessible and useable by technical staff and operable unit managers involved in waste site assessments and remedial action decisions for Hanford. In FY08 communications were established between PNNL and staff from Fluor-Hanford Co. (who formerly managed HEIS) to outline the design of a Virtual Library module that could be used to access the physical and hydraulic property data that are to be transferred into HEIS. Data dictionaries used by SoilVision{reg_sign} were also provided to Fluor-Hanford personnel (who are now with CHPRC). During ongoing work to ensure traceability and defensibility of all physical and hydraulic property data that currently reside in the SoilVision{reg_sign} database, it was recognized that further work would be required in this effort before the data were actually ported into HEIS. Therefore work on the Virtual Library module development and an accompanying User's Guide was deferred until an unspecified later date. In FY09 efforts have continued to verify the traceability and defensibility of the physical and hydraulic property datasets that are currently being maintained by PNNL. Although this is a work in progress, several of these datasets should be ready for transfer to HEIS in the very near future. This document outlines a plan for the migration of these datasets into HEIS.

  15. 552 Int. J. Intelligent Information and Database Systems, Vol. 4, No. 6, 2010 Copyright 2010 Inderscience Enterprises Ltd.

    E-Print Network [OSTI]

    Dreibholz, Thomas

    outages ­ regardless of whether being caused by system failures or intentional denial of service (Do Bachelor and Master degrees in Electrical Engineering from Chongqing University. She was an Advanced

  16. 2010 Worldwide Gasification Database

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

    The 2010 Worldwide Gasification Database describes the current world gasification industry and identifies near-term planned capacity additions. The database lists gasification projects and includes information (e.g., plant location, number and type of gasifiers, syngas capacity, feedstock, and products). The database reveals that the worldwide gasification capacity has continued to grow for the past several decades and is now at 70,817 megawatts thermal (MWth) of syngas output at 144 operating plants with a total of 412 gasifiers.

  17. Graph Coarsening for Path Finding in Cybersecurity Graphs

    SciTech Connect (OSTI)

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

    2013-01-01T23:59:59.000Z

    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.

  18. The graph bottleneck identity

    E-Print Network [OSTI]

    Chebotarev, Pavel

    2010-01-01T23:59:59.000Z

    A matrix $S=(s_{ij})_{n\\times n}$ is said to determine a \\emph{transitional measure} for a digraph $\\Gamma$ on $n$ vertices if for all $i,j,k\\in\\{1,...,n\\},$ the \\emph{transition inequality} $s_{ij}s_{jk}\\le s_{ik}s_{jj}$ holds and reduces to the equality (called the \\emph{graph bottleneck identity}) if and only if every path in $\\Gamma$ from $i$ to $k$ contains $j$. We show that every positive transitional measure produces a distance by means of a logarithmic transformation. Moreover, the resulting distance $d(\\cdot,\\cdot)$ is \\emph{graph-geodetic}, that is, $d(i,j)+d(j,k)=d(i,k)$ holds if and only if every path from $i$ to $k$ contains $j$. Five types of matrices that determine transitional measures for a strong digraph are considered, namely, the matrices of path weights, connection reliabilities, route weights, and the weights of in-forests and out-forests. The results obtained have undirected counterparts. In [P. Chebotarev, A family of graph distances generalizing both the shortest-path and the resistan...

  19. Database Research: Achievements and Opportunities Into the 21st Century

    E-Print Network [OSTI]

    Ullman, Jeffrey D.

    Database Research: Achievements and Opportunities Into the 21st Century Avi Silberschatz, Mike Stonebraker, Jeff Ullman, editors Report of an NSF Workshop on the Future of Database Systems Research, May 26--27, 1995 1 1 Introduction In February of 1990, a group of database researchers met to examine the prospects

  20. December 6, 1995 A MODEL FOR MATERIALS DATABASES

    E-Print Network [OSTI]

    Wiederhold, Gio

    believe are the most closely related to future development of materials database management. Broadly advanced materials are unsuitable. 5. Interfaces provided by existing database management systemsDecember 6, 1995 A MODEL FOR MATERIALS DATABASES Gio Wiederhold Laie Caindec John McCarthy Ken

  1. Using metabolic databases for

    E-Print Network [OSTI]

    sequences are searched routinely against databases, and the World Wide Web has made such queries simple and you have little idea what these words even mean. The SWISS-PROT database3, main- tained by Amos especially for the Web and offers the additional ability to focus on the metabolic reactions in specific

  2. Graph/Network Visualization Data model: graph structures (relations,

    E-Print Network [OSTI]

    Fang, Shiaofen

    of physics #12;8 The Spring Model Using springs to represent node-node relations. Minimizing energy1 1 Graph/Network Visualization Data model: graph structures (relations, knowledge) and networks hierarchies #12;7 Sugiyama : Building Hierarchy Domain knowledge based. Designing heuristic, e.g. minimizing

  3. A Common Database Interface (DBI) R-Databases Special Interest Group

    E-Print Network [OSTI]

    Bain, Mike

    ) and database management systems (DBMS). The interface defines a small set of classes and methods similar;2 Introduction The database interface (DBI) separates the connectivity to the DBMS into a "front-end" and a "back-end". Applications use only the exposed "front-end" API. The facilities that communicate with specific DBMS (Oracle

  4. Stockpile Dismantlement Database Training Materials

    SciTech Connect (OSTI)

    Not Available

    1993-11-01T23:59:59.000Z

    This document, the Stockpile Dismantlement Database (SDDB) training materials is designed to familiarize the user with the SDDB windowing system and the data entry steps for Component Characterization for Disposition. The foundation of information required for every part is depicted by using numbered graphic and text steps. The individual entering data is lead step by step through generic and specific examples. These training materials are intended to be supplements to individual on-the-job training.

  5. NIST Standard Reference Database 17 NIST Chemical Kinetics Database

    E-Print Network [OSTI]

    NIST Standard Reference Database 17 __________________________________________________________ NIST Chemical Kinetics Database WindowsTM Version 2Q98 Users' Guide (NIST) uses its best efforts to deliver a high quality copy of the Database and to verify that the data

  6. Th D t b E i t dThe Database Environment and Developmentp

    E-Print Network [OSTI]

    Basic Definitions · Database (DB): collection of dataDatabase (DB): collection of data. · DBMS: generic program Management System (DBMS) 1212 #12;Database Management Systemg y Application A software system that is used to create, maintain, and provide controlled access to user databases Application #1 (Order Filing) DBMS

  7. Development of specialized electronic bibliographic databases for deep ocean hydrocarbon production and transportation

    E-Print Network [OSTI]

    Mahendran, Joseph Anthony

    1992-01-01T23:59:59.000Z

    , relational databases and the mathematical concept underlying the relational model, and the development of the relational database system, DOHPT. Database Management System A Database management system (DBMS) is a collection of interrelated data files...; and (iv) provides the users with higher level view of the data. The primary purpose of the DBMS is to provide an environment that is both convenient and efficient to use, to retrieve information from the database, and to store information...

  8. Method and system for normalizing biometric variations to authenticate users from a public database and that ensures individual biometric data privacy

    DOE Patents [OSTI]

    Strait, Robert S. (Oakland, CA); Pearson, Peter K. (Livermore, CA); Sengupta, Sailes K. (Livermore, CA)

    2000-01-01T23:59:59.000Z

    A password system comprises a set of codewords spaced apart from one another by a Hamming distance (HD) that exceeds twice the variability that can be projected for a series of biometric measurements for a particular individual and that is less than the HD that can be encountered between two individuals. To enroll an individual, a biometric measurement is taken and exclusive-ORed with a random codeword to produce a "reference value." To verify the individual later, a biometric measurement is taken and exclusive-ORed with the reference value to reproduce the original random codeword or its approximation. If the reproduced value is not a codeword, the nearest codeword to it is found, and the bits that were corrected to produce the codeword to it is found, and the bits that were corrected to produce the codeword are also toggled in the biometric measurement taken and the codeword generated during enrollment. The correction scheme can be implemented by any conventional error correction code such as Reed-Muller code R(m,n). In the implementation using a hand geometry device an R(2,5) code has been used in this invention. Such codeword and biometric measurement can then be used to see if the individual is an authorized user. Conventional Diffie-Hellman public key encryption schemes and hashing procedures can then be used to secure the communications lines carrying the biometric information and to secure the database of authorized users.

  9. Random rectangular Graphs

    E-Print Network [OSTI]

    Estrada, Ernesto

    2015-01-01T23:59:59.000Z

    A generalization of the random geometric graph (RGG) model is proposed by considering a set of points uniformly and independently distributed on a rectangle of unit area instead of on a unit square \\left[0,1\\right]^{2}. The topological properties, such as connectivity, average degree, average path length and clustering, of the random rectangular graphs (RRGs) generated by this model are then studied as a function of the rectangle sides lengths a and b=1/a, and the radius r used to connect the nodes. When a=1 we recover the RGG, and when a\\rightarrow\\infty the very elongated rectangle generated resembles a one-dimensional RGG. We provided computational and analytical evidence that the topological properties of the RRG differ significantly from those of the RGG. The connectivity of the RRG depends not only on the number of nodes as in the case of the RGG, but also on the side length of the rectangle. As the rectangle is more elongated the critical radius for connectivity increases following first a power-law an...

  10. Sandia National Laboratories: CREW Database

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

    CREW Database Sandia Involves Wind-Farm Owners in Defining New Data Pathway for National Wind-Plant Reliability Database On March 19, 2014, in Computational Modeling & Simulation,...

  11. associations database published: Topics by E-print Network

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

    database, integration of federated systems, and the use of "external services" to enrich DBMS functionalities. The following are presented in more detail: first, we describe the...

  12. association database published: Topics by E-print Network

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

    database, integration of federated systems, and the use of "external services" to enrich DBMS functionalities. The following are presented in more detail: first, we describe the...

  13. Nuclear Science References Database

    E-Print Network [OSTI]

    B. Pritychenko; E. B?ták; B. Singh; J. Totans

    2014-07-08T23:59:59.000Z

    The Nuclear Science References (NSR) database together with its associated Web interface, is the world's only comprehensive source of easily accessible low- and intermediate-energy nuclear physics bibliographic information for more than 210,000 articles since the beginning of nuclear science. The weekly-updated NSR database provides essential support for nuclear data evaluation, compilation and research activities. The principles of the database and Web application development and maintenance are described. Examples of nuclear structure, reaction and decay applications are specifically included. The complete NSR database is freely available at the websites of the National Nuclear Data Center http://www.nndc.bnl.gov/nsr and the International Atomic Energy Agency http://www-nds.iaea.org/nsr.

  14. ARTI Refrigerant Database

    SciTech Connect (OSTI)

    Calm, J.M. [Calm (James M.), Great Falls, VA (United States)

    1994-05-27T23:59:59.000Z

    The Refrigerant Database consolidates and facilitates access to information to assist industry in developing equipment using alternative refrigerants. The underlying purpose is to accelerate phase out of chemical compounds of environmental concern.

  15. Databases | Department of Energy

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

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Delicious Rank EERE: Alternative FuelsNovember 13, 2014ContributingDOE ContractDepartment of4Databases Databases

  16. GRAPH III: a digitizing and graph plotting program

    SciTech Connect (OSTI)

    Selleck, C.B.

    1986-03-01T23:59:59.000Z

    GRAPH is an interactive program that allows the user to perform two functions. The first is to plot two dimensional graphs and the second is to digitize graphs or plots to create data files of points. The program is designed to allow the user to get results quickly and easily. It is written in RATIV (a FORTRAN preprocessor) and is currently in use at Sandia under VMS on a VAX computer and CTSS on a Cray supercomputer. The program provides graphical output through all of the Sandia Virtual Device Interface (VDI) graphics devices. 2 refs., 3 figs., 3 tabs.

  17. Crude Oil Analysis Database

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

    Shay, Johanna Y.

    The composition and physical properties of crude oil vary widely from one reservoir to another within an oil field, as well as from one field or region to another. Although all oils consist of hydrocarbons and their derivatives, the proportions of various types of compounds differ greatly. This makes some oils more suitable than others for specific refining processes and uses. To take advantage of this diversity, one needs access to information in a large database of crude oil analyses. The Crude Oil Analysis Database (COADB) currently satisfies this need by offering 9,056 crude oil analyses. Of these, 8,500 are United States domestic oils. The database contains results of analysis of the general properties and chemical composition, as well as the field, formation, and geographic location of the crude oil sample. [Taken from the Introduction to COAMDATA_DESC.pdf, part of the zipped software and database file at http://www.netl.doe.gov/technologies/oil-gas/Software/database.html] Save the zipped file to your PC. When opened, it will contain PDF documents and a large Excel spreadsheet. It will also contain the database in Microsoft Access 2002.

  18. Tools for Large Graph Mining Deepayan Chakrabarti

    E-Print Network [OSTI]

    Tools for Large Graph Mining by Deepayan Chakrabarti Submitted to the Center for Automated Learning computer networks to sociology, biology, ecology and many more. How do such "normal" graphs look like? How-graph, which can be both weighted or unweighted. · Ecology: Food webs are self-graphs with each node

  19. Contagious Sets in Random Graphs Uriel Feige

    E-Print Network [OSTI]

    Contagious Sets in Random Graphs Uriel Feige Michael Krivelevich Daniel Reichman August 10, 2014. A contagious set is a set whose activation results with the entire graph being active. Given a graph G, let m(G, 2) be the minimal size of a contagious set. We consider the binomial random graph G := G(n, p

  20. GRAPH THEORY STUDY GUIDE 1. Definitions

    E-Print Network [OSTI]

    Cooper, Joshua N.

    GRAPH THEORY STUDY GUIDE 1. Definitions Definition 1 (Partition of A). A set A = A1, ..., Ak. Definition 2 (Vertex set). The set of vertices in a graph denoted by V (G). Definition 3 (Edge set). The set of edges in a graph denoted by E(G). Definition 4 (Order). the number of vertices of a graph G written |G

  1. Status Report on Transfer of Physical and Hydraulic Properties Databases to the Hanford Environmental Information System - PNNL Remediation Decision Support Project, Task 1, Activity 6

    SciTech Connect (OSTI)

    Rockhold, Mark L.; Middleton, Lisa A.; Cantrell, Kirk J.

    2009-06-30T23:59:59.000Z

    This document provides a status report on efforts to transfer physical and hydraulic property data from PNNL to CHPRC for incorporation into HEIS. The Remediation Decision Support (RDS) Project is managed by Pacific Northwest National Laboratory (PNNL) to support Hanford Site waste management and remedial action decisions by the U.S. Department of Energy and their contractors. The objective of Task 1, Activity 6 of the RDS project is to compile all available physical and hydraulic property data for sediments from the Hanford Site, to port these data into the Hanford Environmental Information System (HEIS), and to make the data web-accessible to anyone on the Hanford Local Area Network via the so-called Virtual Library. These physical and hydraulic property data are used to estimate parameters for analytical and numerical flow and transport models that are used for site risk assessments and evaluation of remedial action alternatives. In past years efforts were made by RDS project staff to compile all available physical and hydraulic property data for Hanford sediments and to transfer these data into SoilVision{reg_sign}, a commercial geotechnical software package designed for storing, analyzing, and manipulating soils data. Although SoilVision{reg_sign} has proven to be useful, its access and use restrictions have been recognized as a limitation to the effective use of the physical and hydraulic property databases by the broader group of potential users involved in Hanford waste site issues. In order to make these data more widely available and useable, a decision was made to port them to HEIS and to make them web-accessible via a Virtual Library module. In FY08 the original objectives of this activity on the RDS project were to: (1) ensure traceability and defensibility of all physical and hydraulic property data currently residing in the SoilVision{reg_sign} database maintained by PNNL, (2) transfer the physical and hydraulic property data from the Microsoft Access database files used by SoilVision{reg_sign} into HEIS, which is currently being maintained by CH2M-Hill Plateau Remediation Company (CHRPC), (3) develop a Virtual Library module for accessing these data from HEIS, and (4) write a User's Manual for the Virtual Library module. The intent of these activities is to make the available physical and hydraulic property data more readily accessible and useable by technical staff and operable unit managers involved in waste site assessments and remedial action decisions for Hanford. In FY08 communications were established between PNNL and staff from Fluor-Hanford Co. (who formerly managed HEIS) to outline the design of a Virtual Library module that could be used to access the physical and hydraulic property data that are to be transferred into HEIS. Data dictionaries used by SoilVision{reg_sign} were also provided to Fluor-Hanford personnel who are now with CHPRC. During ongoing work to ensure traceability and defensibility of all physical and hydraulic property data that currently reside in the SoilVision{reg_sign} database, it was recognized that further work would be required in this effort before the data were actually ported into HEIS. Therefore work on the Virtual Library module development and an accompanying User's Guide was deferred until an unspecified later date. In FY09 efforts have continued to verify the traceability and defensibility of the physical and hydraulic property datasets that are currently being maintained by PNNL. Although this is a work in progress, several of these datasets are now ready for transfer to CHRPC for inclusion in HEIS. The actual loading of data into HEIS is performed by CHPRC staff, so after the data are transferred from PNNL to CHPRC, it will be the responsibility of CHPRC to ensure that these data are loaded and made accessible. This document provides a status report on efforts to transfer physical and hydraulic property data from PNNL to CHPRC for incorporation into HEIS.

  2. A Study on Set-Graphs

    E-Print Network [OSTI]

    Johan Kok; K. P. Chithra; N. K. Sudev; C. Susanth

    2015-04-09T23:59:59.000Z

    A \\textit{primitive hole} of a graph $G$ is a cycle of length $3$ in $G$. The number of primitive holes in a given graph $G$ is called the primitive hole number of that graph $G$. The primitive degree of a vertex $v$ of a given graph $G$ is the number of primitive holes incident on the vertex $v$. In this paper, we introduce the notion of set-graphs and study the properties and characteristics of set-graphs. We also check the primitive hole number and primitive degree of set-graphs. Interesting introductory results on the nature of order of set-graphs, degree of the vertices corresponding to subsets of equal cardinality, the number of largest complete subgraphs in a set-graph etc. are discussed in this study. A recursive formula to determine the primitive hole number of a set-graph is also derived in this paper.

  3. Graphs whose normalized Laplacian matrices are separable as density matrices in quantum mechanics

    E-Print Network [OSTI]

    Chai Wah Wu

    2014-07-23T23:59:59.000Z

    Recently normalized Laplacian matrices of graphs are studied as density matrices in quantum mechanics. Separability and entanglement of density matrices are important properties as they determine the nonclassical behavior in quantum systems. In this note we look at the graphs whose normalized Laplacian matrices are separable or entangled. In particular, we show that the number of such graphs is related to the number of 0-1 matrices that are line sum symmetric and to the number of graphs with at least one vertex of degree 1.

  4. Database Sampling with Functional Dependencies

    E-Print Network [OSTI]

    Riera, Jesús Bisbal

    Database Sampling with Functional Dependencies Jes´us Bisbal, Jane Grimson Department of Computer there is a need to prototype the database which the applications will use when in operation. A prototype database can be built by sampling data from an existing database. Including relevant semantic information when

  5. Graph anomalies in cyber communications

    SciTech Connect (OSTI)

    Vander Wiel, Scott A [Los Alamos National Laboratory; Storlie, Curtis B [Los Alamos National Laboratory; Sandine, Gary [Los Alamos National Laboratory; Hagberg, Aric A [Los Alamos National Laboratory; Fisk, Michael [Los Alamos National Laboratory

    2011-01-11T23:59:59.000Z

    Enterprises monitor cyber traffic for viruses, intruders and stolen information. Detection methods look for known signatures of malicious traffic or search for anomalies with respect to a nominal reference model. Traditional anomaly detection focuses on aggregate traffic at central nodes or on user-level monitoring. More recently, however, traffic is being viewed more holistically as a dynamic communication graph. Attention to the graph nature of the traffic has expanded the types of anomalies that are being sought. We give an overview of several cyber data streams collected at Los Alamos National Laboratory and discuss current work in modeling the graph dynamics of traffic over the network. We consider global properties and local properties within the communication graph. A method for monitoring relative entropy on multiple correlated properties is discussed in detail.

  6. Doing time : inducing temporal graphs

    E-Print Network [OSTI]

    Bramsen, Philip James

    2006-01-01T23:59:59.000Z

    We consider the problem of constructing a directed acyclic graph that encodes temporal relations found in a text. The unit of our analysis is a temporal segment, a fragment of text that maintains temporal coherence. The ...

  7. Virasoro Representations on Fusion Graphs

    E-Print Network [OSTI]

    J. Kellendonk; A. Recknagel

    1992-10-01T23:59:59.000Z

    For any non-unitary model with central charge c(2,q) the path spaces associated to a certain fusion graph are isomorphic to the irreducible Virasoro highest weight modules.

  8. Summing tree graphs at threshold

    SciTech Connect (OSTI)

    Brown, L.S. (Department of Physics, FM-15, University of Washington, Seattle, Washington 98195 (United States))

    1992-11-15T23:59:59.000Z

    The solution of the classical field equation generates the sum of all tree graphs. We show that the classical equation reduces to an easily solved ordinary differential equation for certain multiparticle threshold amplitudes and compute these amplitudes.

  9. Evaluation of Multimodal Graphs for Blind People , STEPHEN BREWSTER

    E-Print Network [OSTI]

    Williamson, John

    sense on people's fingers. Tactile diagrams exist in many forms and they mainly differEvaluation of Multimodal Graphs for Blind People WAI YU 1 , STEPHEN BREWSTER 2 1 Virtual visualisation system and its evaluations. This system is designed to improve blind and visually impaired people

  10. Databases | Department of Energy

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

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page onYouTube YouTube Note: Since the YouTube| Department ofDepartment9-92JanuaryProgram Areas »Databases Databases The Fuel

  11. Timed Event Graphs with variable resources: asymptotic behavior, representation in (min,+)

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    -1032" #12;1. Introduction Timed Event Graphs (TEG's), which constitute a subclass of timed Petri nets precisely, we define a class of timed Petri nets, called TEG's with variable resources, which can be likened to linear time-varying systems over ´Ń Ň ·µ algebra - a particular dioid. These graphs (TEG's on which

  12. Disturbance Decoupling of Timed Event Graphs by output feedback controller Mehdi Lhommeau, Laurent Hardouin, Bertrand Cottenceau

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    .hardouin, bertrand.cottenceau]@istia.univ-angers.fr Abstract This paper deals with control of Timed Event Graphs (TEG). In a first part the disturbance decoupling problem for TEG is defined. In a second part we propose is introduced for a particular class of Discrete Event Dynamic Systems (DEDS) called Timed Event Graphs (TEG

  13. Solving planning-graph by compiling it into CSP Minh Binh Do & Subbarao Kambhampati

    E-Print Network [OSTI]

    Kambhampati, Subbarao

    Solving planning-graph by compiling it into CSP Minh Binh Do & Subbarao Kambhampati Department to adapt CSP search techniques into the backward search phase of Graphplan. This paper describes GP-CSP, a system that does planning by automati- cally converting Graphplan's planning graph into a CSP encoding

  14. Efficient Bulk Deletes in Relational Databases A. Gartner 1

    E-Print Network [OSTI]

    Kemper, Alfons

    , archiving is studied as part of the SAP Terabyte project in cooperation with the University of Passau dramatically in the last couple of years. This trend can be observed even though most database systems have become easier to use and database system administra- tors have gained more and more experience in using

  15. In Proceedings of RTSS'94: The 14th IEEE Real-Time System Symposium, San Juan, Puerto Rico, Dec 1994. Timeliness via Speculation for Real-Time Databases

    E-Print Network [OSTI]

    Bestavros, Azer

    . Pessimistic (PCC) protocols detect con icts as soon as they occur and resolve them using blocking. Optimistic (OCC) protocols detect con icts at transac- tion commit time and resolve them using rollbacks. For real-time databases, blockages and rollbacks are hazards that increase the likelihood of transactions missing

  16. A High Energy Nuclear Database Proposal

    E-Print Network [OSTI]

    David A. Brown; Ramona Vogt

    2005-10-13T23:59:59.000Z

    We propose to develop a high-energy heavy-ion experimental database and make it accessible to the scientific community through an on-line interace. This database will be searchable and cross-indexed with relevant publications, including published detector descriptions. Since this database will be a community resource, it requires the high-energy nuclear physics community's financial and manpower support. This database should eventually contain all published data from the Bevalac, AGS and SPS to RHIC and LHC energies, proton-proton to nucleus-nucleus collisions as well as other relevant systems and all measured observables. Such a database would have tremendous scientific payoff as it makes systematic studies easier and allows simpler benchmarking of theoretical models to a broad range of old and new experiments. Furthermore, there is a growing need for compilations of high-energy nuclear data for applications including stockpile stewardship, technology development for intertial confinement fusion and target and source development for upcoming facilities such as the Next Linear Collider. To enhance the utility of this database, we propose periodically performing evaluations of the data and summarizing the results in topical reviews.

  17. Database Security Sabrina De Capitani di Vimercati, Dip. Elettronica, Universit a di Brescia, 25123 Brescia, Italy

    E-Print Network [OSTI]

    Samarati, Pierangela

    data stored in a database is called a database management system DBMS. A database can be seen at di of the underlying operating system see Figure 2. Beside access and processing functionalities, each DBMS must also system, one may think that a DBMS does not need to deal with security as security functionalities

  18. Science & Engineering Engineering Databases

    E-Print Network [OSTI]

    Hampton, Randy

    -present. Good for computers, electronics, biomedical, control, electrical and ocean engineering, physics9/09 DK,DS Science & Engineering Library Engineering Databases How to search the engineering initials Special features: Limit to peer-reviewed journals Compendex [Engineering Index] 1884-present

  19. The CEBAF Element Database

    SciTech Connect (OSTI)

    Theodore Larrieu, Christopher Slominski, Michele Joyce

    2011-03-01T23:59:59.000Z

    With the inauguration of the CEBAF Element Database (CED) in Fall 2010, Jefferson Lab computer scientists have taken a step toward the eventual goal of a model-driven accelerator. Once fully populated, the database will be the primary repository of information used for everything from generating lattice decks to booting control computers to building controls screens. A requirement influencing the CED design is that it provide access to not only present, but also future and past configurations of the accelerator. To accomplish this, an introspective database schema was designed that allows new elements, types, and properties to be defined on-the-fly with no changes to table structure. Used in conjunction with Oracle Workspace Manager, it allows users to query data from any time in the database history with the same tools used to query the present configuration. Users can also check-out workspaces to use as staging areas for upcoming machine configurations. All Access to the CED is through a well-documented Application Programming Interface (API) that is translated automatically from original C++ source code into native libraries for scripting languages such as perl, php, and TCL making access to the CED easy and ubiquitous.

  20. High Performance Buildings Database

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

    The High Performance Buildings Database is a shared resource for the building industry, a unique central repository of in-depth information and data on high-performance, green building projects across the United States and abroad. The database includes information on the energy use, environmental performance, design process, finances, and other aspects of each project. Members of the design and construction teams are listed, as are sources for additional information. In total, up to twelve screens of detailed information are provided for each project profile. Projects range in size from small single-family homes or tenant fit-outs within buildings to large commercial and institutional buildings and even entire campuses. The database is a data repository as well. A series of Web-based data-entry templates allows anyone to enter information about a building project into the database. Once a project has been submitted, each of the partner organizations can review the entry and choose whether or not to publish that particular project on its own Web site.

  1. Managing Attack Graph Complexity Through Visual Hierarchical Aggregation

    E-Print Network [OSTI]

    Noel, Steven

    Managing Attack Graph Complexity Through Visual Hierarchical Aggregation Steven Noel Center a framework for managing network attack graph complexity through interactive visualization, which includes hierarchical aggregation of graph elements. Aggregation collapses non-overlapping subgraphs of the attack graph

  2. System and method employing a self-organizing map load feature database to identify electric load types of different electric loads

    SciTech Connect (OSTI)

    Lu, Bin; Harley, Ronald G.; Du, Liang; Yang, Yi; Sharma, Santosh K.; Zambare, Prachi; Madane, Mayura A.

    2014-06-17T23:59:59.000Z

    A method identifies electric load types of a plurality of different electric loads. The method includes providing a self-organizing map load feature database of a plurality of different electric load types and a plurality of neurons, each of the load types corresponding to a number of the neurons; employing a weight vector for each of the neurons; sensing a voltage signal and a current signal for each of the loads; determining a load feature vector including at least four different load features from the sensed voltage signal and the sensed current signal for a corresponding one of the loads; and identifying by a processor one of the load types by relating the load feature vector to the neurons of the database by identifying the weight vector of one of the neurons corresponding to the one of the load types that is a minimal distance to the load feature vector.

  3. System and method employing a minimum distance and a load feature database to identify electric load types of different electric loads

    DOE Patents [OSTI]

    Lu, Bin; Yang, Yi; Sharma, Santosh K; Zambare, Prachi; Madane, Mayura A

    2014-12-23T23:59:59.000Z

    A method identifies electric load types of a plurality of different electric loads. The method includes providing a load feature database of a plurality of different electric load types, each of the different electric load types including a first load feature vector having at least four different load features; sensing a voltage signal and a current signal for each of the different electric loads; determining a second load feature vector comprising at least four different load features from the sensed voltage signal and the sensed current signal for a corresponding one of the different electric loads; and identifying by a processor one of the different electric load types by determining a minimum distance of the second load feature vector to the first load feature vector of the different electric load types of the load feature database.

  4. The EMIME Mandarin Bilingual Database 

    E-Print Network [OSTI]

    Wester, Mirjam; Liang, Hui

    2011-01-01T23:59:59.000Z

    This paper describes the collection of a bilingual database of Mandarin/English data. In addition, the accents of the talkers in the database have been rated. English and Mandarin listeners assessed the English and Mandarin talkers' degree...

  5. R&D Accomplishments Database

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

    recent accomplishments, including the latest Nobel Laureates associated with DOE. Database * Selected documents about noted accomplishments * Documents and individual pages...

  6. Polynomials associated with graph coloring and orientations

    E-Print Network [OSTI]

    Humpert, Brandon Eugene

    2011-04-26T23:59:59.000Z

    We study colorings and orientations of graphs in two related contexts. Firstly, we generalize Stanley's chromatic symmetric function using the k-balanced colorings of Pretzel to create a new graph invariant. We show that ...

  7. Optimization in Geometric Graphs: Complexity and Approximation

    E-Print Network [OSTI]

    Kahruman-Anderoglu, Sera

    2011-02-22T23:59:59.000Z

    We consider several related problems arising in geometric graphs. In particular, we investigate the computational complexity and approximability properties of several optimization problems in unit ball graphs and develop algorithms to find exact...

  8. Percolation in the Secrecy Graph Amites Sarkar

    E-Print Network [OSTI]

    Sarkar, Amites

    Percolation in the Secrecy Graph Amites Sarkar Martin Haenggi July 8, 2011 Abstract Secrecy graphs. Department of Mathematics, Western Washington University, Bellingham, WA 98225, USA. Email: amites.sarkar

  9. Experimental entanglement of six photons in graph states

    E-Print Network [OSTI]

    Chao-Yang Lu; Xiao-Qi Zhou; Otfried Gühne; Wei-Bo Gao; Jin Zhang; Zhen-Sheng Yuan; Alexander Goebel; Tao Yang; Jian-Wei Pan

    2006-09-18T23:59:59.000Z

    Graph states are special kinds of multipartite entangled states that correspond to mathematical graphs where the vertices take the role of quantum spin systems and the edges represent interactions. They not only provide an efficient model to study multiparticle entanglement, but also find wide applications in quantum error correction, multi-party quantum communication and most prominently, serve as the central resource in one-way quantum computation. Here we report the creation of two special instances of graph states, the six-photon Greenberger-Horne-Zeilinger states -- the largest photonic Schr\\"{o}dinger cat, and the six-photon cluster states-- a state-of-the-art one-way quantum computer. Flexibly, slight modifications of our method allow creation of many other graph states. Thus we have demonstrated the ability of entangling six photons and engineering multiqubit graph states, and created a test-bed for investigations of one-way quantum computation and studies of multiparticle entanglement as well as foundational issues such as nonlocality and decoherence.

  10. A Noisy 10GB Provenance Database

    E-Print Network [OSTI]

    Cheah, You-Wei

    2013-01-01T23:59:59.000Z

    Workload The provenance database is generated from theperformance of the provenance database generation process tox-axis). Figure 4 shows the database being populated with

  11. Observational Mishaps - a Database

    E-Print Network [OSTI]

    Kaspar von Braun; Kristin Chiboucas; Denise Hurley-Keller

    1999-06-11T23:59:59.000Z

    We present a World-Wide-Web-accessible database of astronomical images which suffer from a variety of observational problems, ranging from common occurences, such as dust grains on filters and/or the dewar window, to more exotic phenomena, such as loss of primary mirror support due to the deflation of the support airbags. Apart from its educational usefulness, the purpose of this database is to assist astronomers in diagnosing and treating errant images at the telescope, thus saving valuable telescope time. Every observational mishap contained in this on-line catalog is presented in the form of a GIF image, a brief explanation of the problem, and, when possible, a suggestion for improving the image quality.

  12. ARTI Refrigerant Database

    SciTech Connect (OSTI)

    Calm, J.M.

    1992-11-09T23:59:59.000Z

    The database provides bibliographic citations and abstracts for publications that may be useful in research and design of air- conditioning and refrigeration equipment. The database identifies sources of specific information on R-32, R-123, R-124, R-125, R-134, R-134a, R-141b, R-142b, R-143a, R-152a, R-245ca, R-290 (propane), R- 717 (ammonia), ethers, and others as well as azeotropic and zeotropic and zeotropic blends of these fluids. It addresses lubricants including alkylbenzene, polyalkylene glycol, ester, and other synthetics as well as mineral oils. It also references documents on compatibility of refrigerants and lubricants with metals, plastics, elastomers, motor insulation, and other materials used in refrigerant circuits. A computerized version is available that includes retrieval software.

  13. Algebraic connectivity and graph robustness.

    SciTech Connect (OSTI)

    Feddema, John Todd; Byrne, Raymond Harry; Abdallah, Chaouki T. (University of New Mexico)

    2009-07-01T23:59:59.000Z

    Recent papers have used Fiedler's definition of algebraic connectivity to show that network robustness, as measured by node-connectivity and edge-connectivity, can be increased by increasing the algebraic connectivity of the network. By the definition of algebraic connectivity, the second smallest eigenvalue of the graph Laplacian is a lower bound on the node-connectivity. In this paper we show that for circular random lattice graphs and mesh graphs algebraic connectivity is a conservative lower bound, and that increases in algebraic connectivity actually correspond to a decrease in node-connectivity. This means that the networks are actually less robust with respect to node-connectivity as the algebraic connectivity increases. However, an increase in algebraic connectivity seems to correlate well with a decrease in the characteristic path length of these networks - which would result in quicker communication through the network. Applications of these results are then discussed for perimeter security.

  14. Graph Analytics for Signature Discovery

    SciTech Connect (OSTI)

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

    2013-06-01T23:59:59.000Z

    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. REALALGEBRAIC GEOMETRY AND CONSTRAINT DATABASES

    E-Print Network [OSTI]

    Antwerpen, Universiteit

    of tuples. Fig. 13.1 shows an instance of a relational database that contains the two relations Beer and Pub. This database contains tourist information about beers and the pubs where they are served. It also contains, the attributes of Beer are Name, Pub, City and Postal code. The complete schema of the relational database of Fig

  16. DATABASE FOR PREMATURE CONCRETE DETERIORATION

    E-Print Network [OSTI]

    Texas at Austin, University of

    0-4085-P3 DATABASE FOR PREMATURE CONCRETE DETERIORATION Author: Kevin J. Folliard Project 0. This product presents the architecture for a database to collect relevant information on materials and mixture in developing and populating various materials- and structures-specific databases for both new concrete

  17. Evan Marshall Trevathan Admissible SC-Graphs

    E-Print Network [OSTI]

    Donnelly, Rob

    Evan Marshall Trevathan Admissible SC-Graphs Page 1 Admissible SC-Graphs Define: ( , )G ( 2)nB n ( 4)nD n ( 6,7,8)nE n 4F 2G 2H 3H #12;Evan Marshall Trevathan Admissible SC-Graphs Page 2 the form of a #12;Evan Marshall Trevathan Admissible SC-Graphs Page 3 "loop", like ,with no other

  18. ALGORITHMS FOR EMBEDDING GRAPHS IN BOOKS

    E-Print Network [OSTI]

    North Carolina at Chapel Hill, University of

    investigate the problem ol embedding graphs in boob. A book is some number or half- planes (the page

  19. On semidefinite programming bounds for graph bandwidth

    E-Print Network [OSTI]

    Etienne De Klerk

    2011-06-06T23:59:59.000Z

    Jun 6, 2011 ... Keywords: Graph bandwidth, cyclic bandwidth, semidefinite programming, quadratic assignment problem. Category 1: Linear, Cone and ...

  20. Minimal Spanning Trees with Conflict Graphs

    E-Print Network [OSTI]

    symmetric conflict relations by means of an undirected conflict graph, where ..... International Symposium on Mathematical Foundations of Computer. Science ...

  1. Regular graphs maximize the variability of random neural networks

    E-Print Network [OSTI]

    Gilles Wainrib; Mathieu Galtier

    2014-12-17T23:59:59.000Z

    In this work we study the dynamics of systems composed of numerous interacting elements interconnected through a random weighted directed graph, such as models of random neural networks. We develop an original theoretical approach based on a combination of a classical mean-field theory originally developed in the context of dynamical spin-glass models, and the heterogeneous mean-field theory developed to study epidemic propagation on graphs. Our main result is that, surprisingly, increasing the variance of the in-degree distribution does not result in a more variable dynamical behavior, but on the contrary that the most variable behaviors are obtained in the regular graph setting. We further study how the dynamical complexity of the attractors is influenced by the statistical properties of the in-degree distribution.

  2. ARTI Refrigerant Database

    SciTech Connect (OSTI)

    Cain, J.M. [Calm (James M.), Great Falls, VA (United States)

    1993-04-30T23:59:59.000Z

    The Refrigerant Database consolidates and facilitates access to information to assist industry in developing equipment using alternative refrigerants. The underlying purpose is to accelerate phase out of chemical compounds of environmental concern. The database provides bibliographic citations and abstracts for publications that may be useful in research and design of air-conditioning and refrigeration equipment. The complete documents are not included. The database identifies sources of specific information on R-32, R-123, R-124, R-125, R-134, R-134a, R-141b, R-142b, R-143a, R-152a, R-245ca, R-290 (propane), R-717 (ammonia), ethers, and others as well as azeotropic and zeotropic blends of these fluids. It addresses lubricants including alkylbenzene, polyalkylene glycol, ester, and other synthetics as well as mineral oils. It also references documents addressing compatibility of refrigerants and lubricants with metals, plastics, elastomers, motor insulation, and other materials used in refrigerant circuits. Incomplete citations or abstracts are provided for some documents to accelerate availability of the information and will be completed or replaced in future updates.

  3. Quantitative Analysis of the Full Bitcoin Transaction Graph

    E-Print Network [OSTI]

    Quantitative Analysis of the Full Bitcoin Transaction Graph Dorit Ron and Adi Shamir Department.ron,adi.shamir}@weizmann.ac.il Abstract. The Bitcoin scheme is a rare example of a large scale global payment system in which all and how they spend their bitcoins, the balance of bitcoins they keep in their accounts, and how they move

  4. A Simple Approach to Abductive Inference using Conceptual Graphs

    E-Print Network [OSTI]

    Pagnucco, Maurice

    A Simple Approach to Abductive Inference using Conceptual Graphs Maurice Pagnucco Knowledge Systems, Australia. email: morri@cs.su.oz.au fax : +61­2­692­3838 Abstract Abductive reasoning (or simply abduction) is a form of logical in­ ference that aims to derive plausible explanations for data. The term ``abduction

  5. (Co)Algebraic Characterizations of Signal Flow Graphs

    E-Print Network [OSTI]

    Rutten, Jan

    Signal flow graphs are a graphical representation for the analysis, modeling and evaluation of linear as a linear combination of the input and the registers. That is, the dynamics of a circuit can be expressed as a system of linear of equations, one for each register. Since we consider open circuits, the corresponding

  6. NLS ground states on graphs

    E-Print Network [OSTI]

    Riccardo Adami; Enrico Serra; Paolo Tilli

    2014-06-16T23:59:59.000Z

    We investigate the existence of ground states for the subcritical NLS energy on metric graphs. In particular, we find out a topological assumption that guarantees the nonexistence of ground states, and give an example in which the assumption is not fulfilled and ground states actually exist. In order to obtain the result, we introduce a new rearrangement technique, adapted to the graph where it applies. Owing to such a technique, the energy level of the rearranged function is improved by conveniently mixing the symmetric and monotone rearrangement procedures.

  7. Tank Characterization Database (TCD) Data Dictionary: Version 4.0

    SciTech Connect (OSTI)

    NONE

    1996-04-01T23:59:59.000Z

    This document is the data dictionary for the tank characterization database (TCD) system and contains information on the data model and SYBASE{reg_sign} database structure. The first two parts of this document are subject areas based on the two different areas of the (TCD) database: sample analysis and waste inventory. Within each subject area is an alphabetical list of all the database tables contained in the subject area. Within each table defintiion is a brief description of the table and alist of field names and attributes. The third part, Field Descriptions, lists all field names in the data base alphabetically.

  8. Distributed Online Conditions Database of the BaBar Experiment

    SciTech Connect (OSTI)

    Khan, A.; /Brunel U.; Gaponenko, I.A.; Brown, D.N.; /LBL, Berkeley

    2011-11-21T23:59:59.000Z

    This paper presents CDB - The distributed Conditions Database of the BaBar Experiment. CDB is the second major iteration of the database deployed in BaBar for production use as of October 2002. It replaced the original version of the database used through the first three years of the data taking. The new design and its implementation aims to improve the performance and scalability of the original database and addresses the emerging challenges of the distributed data production and analysis system of the Experiment.

  9. Effecting Parallel Graph Eigensolvers Through Library Composition

    E-Print Network [OSTI]

    Lumsdaine, Andrew

    is not possible in general. Conventional linear algebra libraries cannot operate on graph data types. Likewise exploitation of this duality. Graph libraries and matrix libraries use different data types, and despiteEffecting Parallel Graph Eigensolvers Through Library Composition Alex Breuer, Peter Gottschling

  10. Graph Decompositions and Secret Sharing Schemes 1

    E-Print Network [OSTI]

    Stinson, Douglas

    Graph Decompositions and Secret Sharing Schemes 1 C. Blundo and A. De Santis Dipartimento di In this paper, we continue a study of secret sharing schemes for access structures based on graphs. Given a graph G, we require that a subset of participants can compute a secret key if they contain an edge of G

  11. A heuristic algorithm for graph isomorphism

    E-Print Network [OSTI]

    Torres Navarro, Luz

    1999-01-01T23:59:59.000Z

    polynomial time algorithm O(n?), ISO-MT, that seems' to solve the graph isomorphism decision problem correctly for all classes of graphs. Our algorithm is extremely useful from the practical point of view since counter examples (pairs of graphs for which our...

  12. Identifying Relevant Databases for Multidatabase Mining

    E-Print Network [OSTI]

    Liu, Huan

    Identifying Relevant Databases for Multidatabase Mining Huan Liu, Hongjun Lu, Jun Yao Department,luhj,yaojung@iscs.nus.edu.sg Abstract. Various tools and systems for knowledge discovery and data mining are developed and available is where we should start mining. In this paper, breaking away from the conventional data mining assumption

  13. A Database in Every Sensor Nicolas Tsiftes

    E-Print Network [OSTI]

    Dunkels, Adam

    a database management system (DBMS), provid- ing a rich query interface to the flash storage of the node, we present Antelope, a complete DBMS for resource-constrained sen- sor devices, and a new flash indexing method called Max- Heap. Antelope, which to the best of our knowledge is the first DBMS

  14. The Dartmouth Stellar Evolution Database

    E-Print Network [OSTI]

    Aaron Dotter; Brian Chaboyer; Darko Jevremovic; Veselin Kostov; E. Baron; J. W. Ferguson

    2008-04-28T23:59:59.000Z

    The ever-expanding depth and quality of photometric and spectroscopic observations of stellar populations increase the need for theoretical models in regions of age-composition parameter space that are largely unexplored at present. Stellar evolution models that employ the most advanced physics and cover a wide range of compositions are needed to extract the most information from current observations of both resolved and unresolved stellar populations. The Dartmouth Stellar Evolution Database is a collection of stellar evolution tracks and isochrones that spans a range of [Fe/H] from -2.5 to +0.5, [alpha/Fe] from -0.2 to +0.8 (for [Fe/H] 0), and initial He mass fractions from Y=0.245 to 0.40. Stellar evolution tracks were computed for masses between 0.1 and 4 Msun, allowing isochrones to be generated for ages as young as 250 Myr. For the range in masses where the core He flash occurs, separate He-burning tracks were computed starting from the zero age horizontal branch. The tracks and isochrones have been transformed to the observational plane in a variety of photometric systems including standard UBV(RI)c, Stromgren uvby, SDSS ugriz, 2MASS JHKs, and HST ACS-WFC and WFPC2. The Dartmouth Stellar Evolution Database is accessible through a website at http://stellar.dartmouth.edu/~models/ where all tracks, isochrones, and additional files can be downloaded.

  15. The Mimicking Octopus: Towards a one-size-fits-all Database Architecture

    E-Print Network [OSTI]

    The Mimicking Octopus: Towards a one-size-fits-all Database Architecture Alekh Jindal Supervised by anyways. In this paper we discuss building a new type of database system which fits several use started off as monolithic systems. However, database engineers soon started tuning their performance

  16. Feature Level Clustering of Large Biometric Database

    E-Print Network [OSTI]

    Mehrotra, Hunny; Radhika, V Bhawani; Majhi, Banshidhar; Gupta, Phalguni

    2010-01-01T23:59:59.000Z

    This paper proposes an efficient technique for partitioning large biometric database during identification. In this technique feature vector which comprises of global and local descriptors extracted from offline signature are used by fuzzy clustering technique to partition the database. As biometric features posses no natural order of sorting, thus it is difficult to index them alphabetically or numerically. Hence, some supervised criteria is required to partition the search space. At the time of identification the fuzziness criterion is introduced to find the nearest clusters for declaring the identity of query sample. The system is tested using bin-miss rate and performs better in comparison to traditional k-means approach.

  17. Preserving Access Privacy Over Large Databases Femi Olumofin

    E-Print Network [OSTI]

    Goldberg, Ian

    . The security of many such systems, such as Tor, relies on a model where the adversary does not have a global. Private information retrieval (PIR) schemes are designed to prevent an adversary controlling the database-of-the-art PIR schemes have a high computational overhead that makes them expensive for querying large databases

  18. Diesel: Applying Privilege Separation to Database Access Adrienne Porter Felt

    E-Print Network [OSTI]

    Wagner, David

    Diesel: Applying Privilege Separation to Database Access Adrienne Porter Felt UC Berkeley apf reviewers. We construct a system called Diesel, which implements data sep- aration by intercepting database queries and applying mod- ules' restrictions to the queries. We evaluate Diesel on three widely

  19. Diesel: Applying Privilege Separation to Database Adrienne Porter Felt

    E-Print Network [OSTI]

    Wagner, David

    Diesel: Applying Privilege Separation to Database Access Adrienne Porter Felt Matthew Finifter Joel to lists, requires prior specific permission. #12;Diesel: Applying Privilege Separation to Database Access and code reviewers. We design and construct a system called Diesel, which implements data separation

  20. Intelligent Databases: Old Challenges and New Opportunities \\Lambda

    E-Print Network [OSTI]

    Zaniolo, Carlo

    Department, University of California Los Angeles, CA 90024 zaniolo@cs.ucla.edu Abstract The evolution to the evolution of databases and information systems to statisfy said demands. In addition to all database­based specifications. In this paper, we review the evolution of the enabling technology and architectures of deductive

  1. Acyclic Coloring of Graphs of Maximum Degree Five: Nine Colors are Enough

    E-Print Network [OSTI]

    Boyer, Edmond

    graphs with "large" girth [BKW99], 1-planar graphs [BKRS01], outerplanar graphs (see for instance [Sop97

  2. EuroComb 2005 DMTCS proc. AE, 2005, 389396 Acyclic Coloring of Graphs of Maximum

    E-Print Network [OSTI]

    Fertin, Guillaume

    for several families F of graphs such as planar graphs [Bor79], planar graphs with "large" girth [BKW99], 1

  3. Acyclic Coloring of Graphs of Maximum Degree Five: Nine Colors are Enough

    E-Print Network [OSTI]

    Fertin, Guillaume

    graphs with ``large'' girth [BKW99], 1­planar graphs [BKRS01], outerplanar graphs (see for instance [Sop

  4. National Residential Efficiency Measures Database Webinar Slides...

    Energy Savers [EERE]

    National Residential Efficiency Measures Database Webinar Slides National Residential Efficiency Measures Database Webinar Slides Presentation slides for the Building Technologies...

  5. Dynamic Distributed Multimedia: Seamless Sharing and Reconfiguration of Multimedia Flow Graphs

    E-Print Network [OSTI]

    Lohse, Marco

    Dynamic Distributed Multimedia: Seamless Sharing and Reconfiguration of Multimedia Flow Graphs Abstract Mobile devices with multimedia and networking capabilities are quickly becoming ubiquitous through the availability of small note- books, PDA, and in particular, mobile phones. However, most multimedia systems

  6. Generalized Graph States Based on Hadamard Matrices

    E-Print Network [OSTI]

    Shawn X Cui; Nengkun Yu; Bei Zeng

    2015-02-25T23:59:59.000Z

    Graph states are widely used in quantum information theory, including entanglement theory, quantum error correction, and one-way quantum computing. Graph states have a nice structure related to a certain graph, which is given by either a stabilizer group or an encoding circuit, both can be directly given by the graph. To generalize graph states, whose stabilizer groups are abelian subgroups of the Pauli group, one approach taken is to study non-abelian stabilizers. In this work, we propose to generalize graph states based on the encoding circuit, which is completely determined by the graph and a Hadamard matrix. We study the entanglement structures of these generalized graph states, and show that they are all maximally mixed locally. We also explore the relationship between the equivalence of Hadamard matrices and local equivalence of the corresponding generalized graph states. This leads to a natural generalization of the Pauli $(X,Z)$ pairs, which characterizes the local symmetries of these generalized graph states. Our approach is also naturally generalized to construct graph quantum codes which are beyond stabilizer codes.

  7. Constrained Graph Optimization: Interdiction and Preservation Problems

    SciTech Connect (OSTI)

    Schild, Aaron V [Los Alamos National Laboratory

    2012-07-30T23:59:59.000Z

    The maximum flow, shortest path, and maximum matching problems are a set of basic graph problems that are critical in theoretical computer science and applications. Constrained graph optimization, a variation of these basic graph problems involving modification of the underlying graph, is equally important but sometimes significantly harder. In particular, one can explore these optimization problems with additional cost constraints. In the preservation case, the optimizer has a budget to preserve vertices or edges of a graph, preventing them from being deleted. The optimizer wants to find the best set of preserved edges/vertices in which the cost constraints are satisfied and the basic graph problems are optimized. For example, in shortest path preservation, the optimizer wants to find a set of edges/vertices within which the shortest path between two predetermined points is smallest. In interdiction problems, one deletes vertices or edges from the graph with a particular cost in order to impede the basic graph problems as much as possible (for example, delete edges/vertices to maximize the shortest path between two predetermined vertices). Applications of preservation problems include optimal road maintenance, power grid maintenance, and job scheduling, while interdiction problems are related to drug trafficking prevention, network stability assessment, and counterterrorism. Computational hardness results are presented, along with heuristic methods for approximating solutions to the matching interdiction problem. Also, efficient algorithms are presented for special cases of graphs, including on planar graphs. The graphs in many of the listed applications are planar, so these algorithms have important practical implications.

  8. ARM Publications Database

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

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625govInstrumentstdmadapInactiveVisiting the TWP TWP Related Links Facilities andPastWrittenDatabaseSearchTips

  9. Noisy entanglement evolution for graph states

    E-Print Network [OSTI]

    L. Aolita; D. Cavalcanti; R. Chaves; C. Dhara; L. Davidovich; A. Acin

    2011-03-29T23:59:59.000Z

    A general method for the study of the entanglement evolution of graph states under the action of Pauli was recently proposed in [Cavalcanti, et al., Phys. Rev. Lett. 103, 030502 (2009)]. This method is based on lower and upper bounds on the entanglement of the entire state as a function only of the state of a considerably-smaller subsystem, which undergoes an effective noise process. This provides a huge simplification on the size of the matrices involved in the calculation of entanglement in these systems. In the present paper we elaborate on this method in details and generalize it to other natural situations not described by Pauli maps. Specifically, for Pauli maps we introduce an explicit formula for the characterization of the resulting effective noise. Beyond Pauli maps, we show that the same ideas can be applied to the case of thermal reservoirs at arbitrary temperature. In the latter case, we discuss how to optimize the bounds as a function of the noise strength. We illustrate our ideas with explicit exemplary results for several different graphs and particular decoherence processes. The limitations of the method are also discussed.

  10. How the permutation of edges of a metric graph affects the number of points moving along the edges

    E-Print Network [OSTI]

    V. L. Chernyshev; A. A. Tolchennikov

    2014-10-18T23:59:59.000Z

    We consider a dynamical system on a metric graph, that corresponds to a semiclassical solution of a time-dependent Schr\\"odinger equation. We omit all details concerning mathematical physics and work with a purely discrete problem. We find a weak inequality representation for the number of points coming out of the vertex of an arbitrary tree graph. We apply this construction to an "H-junction" graph. We calculate the difference between numbers of moving points corresponding to the permutation of edges. Then we find a symmetrical difference of the number of points moving along the edges of a metric graph.

  11. Lamplighter groups, de Bruijn graphs, spider-web graphs and their spectra

    E-Print Network [OSTI]

    Rostislav Grigorchuk; Paul-Henry Leemann; Tatiana Nagnibeda

    2015-02-24T23:59:59.000Z

    We describe the infinite family of spider-web graphs $S_{k,M,N }$, $k \\geq 2$, $M \\geq 1$ and $N \\geq 0$, studied in physical literature as tensor products of well-known de Brujin graphs $B_{k,N}$ and cyclic graphs $C_M$ and show that these graphs are Schreier graphs of the lamplighter groups $L_k = Z/kZ \\wr Z$. This allows us to compute their spectra and to identify the infinite limit of $S_{k,M,N}$, as $N, M \\to\\infty$, with the Cayley graph of the lamplighter group $L_k$.

  12. Lamplighter groups, de Bruijn graphs, spider-web graphs and their spectra

    E-Print Network [OSTI]

    Rostislav Grigorchuk; Paul-Henry Leemann; Tatiana Nagnibeda

    2015-05-05T23:59:59.000Z

    We describe the infinite family of spider-web graphs $S_{k,M,N }$, $k \\geq 2$, $M \\geq 1$ and $N \\geq 0$, studied in physical literature as tensor products of well-known de Brujin graphs $B_{k,N}$ and cyclic graphs $C_M$ and show that these graphs are Schreier graphs of the lamplighter groups $L_k = Z/kZ \\wr Z$. This allows us to compute their spectra and to identify the infinite limit of $S_{k,M,N}$, as $N, M \\to\\infty$, with the Cayley graph of the lamplighter group $L_k$.

  13. An Introduction to Database Systems The Relational Database Normalization Theory

    E-Print Network [OSTI]

    Lu, Jiaheng

    Laboratory #12;#12; ˘ˇ¤Ł¦Ą § ¨© "!#$! § "%&%')(0$©)1 234"©5©6$© Ą7989@A&$89¨ B&CED0FHGPIRQSIUTVCXW`YaIcbcGedIcGHbUf5gihpbcCXGHFqrf6DsC4tEuXvxwyu qQSbdv)EXu 5RdfegShjiklpmdonpAqir)s4tUuAuStUvwRs5x

  14. Biological & Environmental Research Abstracts Database

    Office of Scientific and Technical Information (OSTI)

    Welcome to the Administrative section of the Biological and Environmental Research Abstracts Database. Please logon. Logon Name: Password: Logon CommentsEmail Us * Security...

  15. Energy Citations Database (ECD) - Architecture

    Office of Scientific and Technical Information (OSTI)

    Search Architecture - What Is under the hood? The Energy Citations Database makes searchable over two million bibliographic citations for energy and energy related STI from the...

  16. Recovery algorithms for in-memory OLTP databases

    E-Print Network [OSTI]

    Malviya, Nirmesh

    2012-01-01T23:59:59.000Z

    Fine-grained, record-oriented write-ahead logging, as exemplified by systems like ARIES, has been the gold standard for relational database recovery. In this thesis, we show that in modern high-throughput transaction ...

  17. Thermodynamic Database for Rare Earth Elements Recycling Process...

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

    Thermodynamic Database for Rare Earth Elements Recycling Process: Energetics of the REE-X Systems (XA;, Mg, Zn, Si, Sn, Mn, Pb, Fe, Co, Ni) Apr 17 2015 11:00 AM - 12:00 PM In-Ho...

  18. Development of an OCS Cementing Operational Guidelines Database

    E-Print Network [OSTI]

    Bell, Matthew G.

    2014-08-20T23:59:59.000Z

    This paper describes a relational database system developed for the Bureau of Safety and Environmental Enforcement as part of an analysis of current cementing procedures employed in the US outer continental shelf. Initial work included defining...

  19. Ribosomal Database Project II

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

    The Ribosomal Database Project (RDP) provides ribosome related data and services to the scientific community, including online data analysis and aligned and annotated Bacterial small-subunit 16S rRNA sequences. As of March 2008, RDP Release 10 is available and currently (August 2009) contains 1,074,075 aligned 16S rRNA sequences. Data that can be downloaded include zipped GenBank and FASTA alignment files, a histogram (in Excel) of the number of RDP sequences spanning each base position, data in the Functional Gene Pipeline Repository, and various user submitted data. The RDP-II website also provides numerous analysis tools.[From the RDP-II home page at http://rdp.cme.msu.edu/index.jsp

  20. A+M Collisional Databases in ALADDIN Format

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

    ALADDIN (A Labelled Atomic Data Interface) is a database system developed in order to provide a standard and flexible format and interface for the exchange and management of atomic, molecular and plasma-material interaction data of interest to fusion research. As part of the Atomic and Molecular Data Information System (AMDIS), introduced by the IAEA Atomic and Molecular Data Unit, the ALADDIN interface is available on-line. Twelve databases from DOE and IAEA sources are available from the CFADC website under the heading A+M Collisional Databases.

  1. An Approach to Change Management of Evolving Database Schemas Mark Grechanika, Dewayne Perryb, and Don Batorya

    E-Print Network [OSTI]

    Perry, Dewayne E.

    queries to relational databases using such standards as Universal Data Access (UDA) and Open Database. Almost every database system currently offers some kind of embedded SQL API. The generic API consists and source language types are different the conversion is required between the types. Certain API calls

  2. Chapter 10 Creating and Maintaining Geographic Databases 131 Creating and Maintaining

    E-Print Network [OSTI]

    Wright, Dawn Jeannine

    (DBMS), a specialist piece of software designed to handle multi-user access to an integrated set of data and versioning. 10 #12;Chapter 10 Creating and Maintaining Geographic Databases 132 KEY WORDS AND CONCEPTS DBMS.2 Database management systems 10.3 Storing data in DBMS tables 10.4 SQL 10.5 Geographic database types

  3. The rice kinase database. A phylogenomic database for the rice kinome.

    E-Print Network [OSTI]

    Dardick, Christopher; Chen, Johann; Richter, Todd; Ouyang, Shu; Ronald, Pamela

    2007-01-01T23:59:59.000Z

    Bioinformatics The Rice Kinase Database.A Phylogenomic Database for the Rice Kinome 1[OA]created a phylogenomic database (http://rkd.ucdavis.edu) to

  4. Sealion Database: Tracking and Characterization of Legacy Wastes

    SciTech Connect (OSTI)

    Michel Hall; Brady Orchard; Brett Welty; James Rivera; Paul Walker; Reese Gannon

    2010-03-01T23:59:59.000Z

    The Radioactive Scrap and Waste Facility Liner-by-Liner Characterization Project was initiated to support waste management planning and disposition activities at the Materials and Fuels Complex located at the Idaho National Laboratory. The project scope consisted of a detailed examination of available historical records to consolidate information and eliminate discrepancies between sources. This information was captured in a new comprehensive searchable online database dubbed Sealion (Searchable Liner Online). For each storage liner and associated waste container, Sealion tracks the physical configuration, radiological data (e.g., source term, transuranic content, fissile content, and direct gamma radiation reading), Resource Conservation and Recovery Act characterization data, contents descriptions, and a variety of other waste management data. Historical hard-copy records were scanned and are stored in the database for easy access. In addition to storing the consolidated data in a library for easy retrieval or linking, Sealion serves as a tool in the development of batching plans for retrieving, transporting, processing, and, ultimately, dispositioning the waste. An integral search function allows the user to query for a variety of parameters in order to plan custom batches and account for facility or regulatory limitations (e.g., U.S. Department of Transportation limits, hazard category determinations, and fissile gram equivalent limitations). Liners can be combined or batched together and the combined results displayed in real-time graphs and tables showing the cumulative characteristics. The basic database architecture has proven to be adaptable to a variety of other similar applications. Sealion is capable of tracking segmented inventories (i.e., the liners can be replaced with storage drums, racks in a warehouse, or grids overlaid on a landfill). Additionally, the batching functions allow for the ability to combine inventory sub-locations into real-time graphs that summarize the characteristics of the contents for ease in comparison of characteristics to established thresholds or decision-making modeling needed to support waste-management operations.

  5. A Feasible Graph Partition Framework for Random Walks Implemented by Parallel Computing in Big Graph

    E-Print Network [OSTI]

    Liu, Xiaoming; Guan, Xiaohong

    2015-01-01T23:59:59.000Z

    Graph partition is a fundamental problem of parallel computing for big graph data. Many graph partition algorithms have been proposed to solve the problem in various applications, such as matrix computations and PageRank, etc., but none has pay attention to random walks. Random walks is a widely used method to explore graph structure in lots of fields. The challenges of graph partition for random walks include the large number of times of communication between partitions, lots of replications of the vertices, unbalanced partition, etc. In this paper, we propose a feasible graph partition framework for random walks implemented by parallel computing in big graph. The framework is based on two optimization functions to reduce the bandwidth, memory and storage cost in the condition that the load balance is guaranteed. In this framework, several greedy graph partition algorithms are proposed. We also propose five metrics from different perspectives to evaluate the performance of these algorithms. By running the al...

  6. Multipartite separability of Laplacian matrices of graphs

    E-Print Network [OSTI]

    Chai Wah Wu

    2008-09-04T23:59:59.000Z

    Recently, Braunstein et al. [1] introduced normalized Laplacian matrices of graphs as density matrices in quantum mechanics and studied the relationships between quantum physical properties and graph theoretical properties of the underlying graphs. We provide further results on the multipartite separability of Laplacian matrices of graphs. In particular, we identify complete bipartite graphs whose normalized Laplacian matrix is multipartite entangled under any vertex labeling. Furthermore, we give conditions on the vertex degrees such that there is a vertex labeling under which the normalized Laplacian matrix is entangled. These results address an open question raised in [1]. Finally, we extend some of the results in [1,2] to the multipartite case and show that the Laplacian matrix of any product of graphs (strong, Cartesian, tensor, categorical, etc.) is multipartite separable.

  7. Median graph shift: A new clustering algorithm for graph domain Salim Jouili, Salvatore Tabbone

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    and a comparison with the well-known Kmeans algorithm is provided. I. INTRODUCTION Graphs give a universal

  8. Discussiones Mathematicae Graph Theory 34 (2014) 287307

    E-Print Network [OSTI]

    Al Hanbali, Ahmad

    2014-01-01T23:59:59.000Z

    FOR TRACEABILITY OF BLOCK-CHAINS Binlong Lia,b1, Hajo Broersmab and Shenggui Zhanga2 a Department of Applied at least n-1 in G. A block-chain is a graph whose block graph is a path, i.e., it is either a P1, P2, every traceable graph is a block-chain, but the reverse does not hold. In this paper we characterize all

  9. Wind turbine reliability database update.

    SciTech Connect (OSTI)

    Peters, Valerie A.; Hill, Roger Ray; Stinebaugh, Jennifer A.; Veers, Paul S.

    2009-03-01T23:59:59.000Z

    This report documents the status of the Sandia National Laboratories' Wind Plant Reliability Database. Included in this report are updates on the form and contents of the Database, which stems from a fivestep process of data partnerships, data definition and transfer, data formatting and normalization, analysis, and reporting. Selected observations are also reported.

  10. Scalable Database Access Technologies for ATLAS Distributed Computing

    E-Print Network [OSTI]

    A. Vaniachine; for the ATLAS Collaboration

    2009-10-02T23:59:59.000Z

    ATLAS event data processing requires access to non-event data (detector conditions, calibrations, etc.) stored in relational databases. The database-resident data are crucial for the event data reconstruction processing steps and often required for user analysis. A main focus of ATLAS database operations is on the worldwide distribution of the Conditions DB data, which are necessary for every ATLAS data processing job. Since Conditions DB access is critical for operations with real data, we have developed the system where a different technology can be used as a redundant backup. Redundant database operations infrastructure fully satisfies the requirements of ATLAS reprocessing, which has been proven on a scale of one billion database queries during two reprocessing campaigns of 0.5 PB of single-beam and cosmics data on the Grid. To collect experience and provide input for a best choice of technologies, several promising options for efficient database access in user analysis were evaluated successfully. We present ATLAS experience with scalable database access technologies and describe our approach for prevention of database access bottlenecks in a Grid computing environment.

  11. 3D Graph Visualization with the Oculus Rift Virtual Graph Reality

    E-Print Network [OSTI]

    Wismath, Stephen

    reality environment such as a CAVE, or · printed as a physical model with a 3D printer. Early studies3D Graph Visualization with the Oculus Rift Virtual Graph Reality Farshad Barahimi, Stephen Wismath regarding three- dimensional (3D) representations of graphs. However, the actual usefulness of such 3D

  12. Generation of graph-state streams

    E-Print Network [OSTI]

    Daniel Ballester; Jaeyoon Cho; M. S. Kim

    2010-12-08T23:59:59.000Z

    We propose a protocol to generate a stream of mobile qubits in a graph state through a single stationary parent qubit and discuss two types of its physical implementation, namely, the generation of photonic graph states through an atom-like qubit and those of flying atoms through a cavity-mode photonic qubit. The generated graph states fall into an important class that can hugely reduce the resource requirement of fault-tolerant linear optics quantum computation, which was previously known to be far from realistic. In regard to the flying atoms, we also propose a heralded generation scheme, which allows for high-fidelity graph states even under the photon loss.

  13. Graph algorithms in the titan toolkit.

    SciTech Connect (OSTI)

    McLendon, William Clarence, III; Wylie, Brian Neil

    2009-10-01T23:59:59.000Z

    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.

  14. Nuclear reactor multiphysics via bond graph formalism

    E-Print Network [OSTI]

    Sosnovsky, Eugeny

    2014-01-01T23:59:59.000Z

    This work proposes a simple and effective approach to modeling nuclear reactor multiphysics problems using bond graphs. Conventional multiphysics simulation paradigms normally use operator splitting, which treats the ...

  15. Vienna Database Library Version 1.0

    E-Print Network [OSTI]

    Neumaier, Arnold

    Vienna Database Library Version 1.0 Reference Manual Hermann Schichl University of Vienna.2.14 #12;CONTENTS 1 Contents 1 Introduction 1 2 Vienna Database Library Module Index 3 3 Vienna Database Library Hierarchical Index 3 4 Vienna Database Library Compound Index 5 5 Vienna Database Library File

  16. Database Hints for Readex's AccessUN

    E-Print Network [OSTI]

    Stowell, Michael

    Database Hints for Readex's AccessUN Direct Link to Database: http://infoweb.newsbank.com/?db=UNAD Database Scope Readex's AccessUN database provides an index to United Nations documents from the six main Council, Secretariat and International Court of Justice. This database covers documents from 1946

  17. Chapter 20Chapter 20 Physical Database

    E-Print Network [OSTI]

    Yang, Jing

    1 Chapter 20Chapter 20 Physical Database Design and Tuning Copyright © 2011 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 1. Physical Database Design in Relational Databases (1) Factors that Influence Physical Database Design: A. Analyzing the database queries and transactionsA. Analyzing

  18. On the Cohen-Macaulay graphs and girth

    E-Print Network [OSTI]

    Hoang, Do Trong; Trung, Tran Nam

    2012-01-01T23:59:59.000Z

    In this paper we investigate the Cohen-Macaulay property of graphs versus girth. In particular, we classify Cohen-Macaulay graphs of girth at least five and planar Gorenstein graphs of girth four.

  19. Qubits from Adinkra Graph Theory via Colored Toric Geometry

    E-Print Network [OSTI]

    Aadel, Y; Benslimane, Z; Sedra, M B; Segui, A

    2015-01-01T23:59:59.000Z

    We develop a new approach to deal with qubit information systems using toric geometry and its relation to Adinkra graph theory. More precisely, we link three different subjects namely toric geometry, Adinkras and quantum information theory. This one to one correspondence may be explored to attack qubit system problems using geometry considered as a powerful tool to understand modern physics including string theory. Concretely, we examine in some details the cases of one, two, and three qubits, and we find that they are associated with \\bf CP^1, \\bf CP^1\\times CP^1 and \\bf CP^1\\times CP^1\\times CP^1 toric varieties respectively. Using a geometric procedure referred to as colored toric geometry, we show that the qubit physics can be converted into a scenario handling toric data of such manifolds by help of Adinkra graph theory. Operations on toric information can produce universal quantum gates.

  20. IMPROVING DATABASE DESIGN TEACHING IN SECONDARY EDUCATION

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    Review Copy IMPROVING DATABASE DESIGN TEACHING IN SECONDARY EDUCATION: ACTION RESEARCH Education, University of Patras, 26500, Patras, GREECE. Abstract Database design and use has educational interest for utilitarian and learning reasons. Database technology has significant economic impact

  1. Meteorological database for the United States

    E-Print Network [OSTI]

    Apte, M.G.

    2011-01-01T23:59:59.000Z

    to Indoor Air Meteorological Database for the United StatesUC-402 Meteorological Database for the United States M.G.Abstract A meteorological database has been developed to aid

  2. NOTE: This graph charts the pH level of the water leaving active chemical drain neutralization system in the Natural Science and Engineering Cleanroom laboratory on the UTD campus. It also monitors the

    E-Print Network [OSTI]

    Lee, Jeong-Bong

    NOTE: This graph charts the pH level of the water leaving active chemical drain neutralization 6 8 10 12 14 pHDeviation(8-pH) pHatDischargeTank Date NSERL Back Dock Chemical Neutralization p

  3. On terminal deltawye reducibility of planar graphs

    E-Print Network [OSTI]

    Sagols, Feliú

    On terminal delta­wye reducibility of planar graphs Isidoro Gitler1 Feli´u Sagols2 Departamento de´exico City, D.F. igitler@math.cinvestav.mx fsagols@math.cinvestav.mx Abstract A graph is terminal - Y -reducible if it can be reduced to a set of terminal vertices by a sequence of series-parallel reductions

  4. A COLUMN GENERATION APPROACH FOR GRAPH COLORING

    E-Print Network [OSTI]

    Grossmann, Ignacio E.

    set in the graph). We use a column generation method for implicit optimization of the linear program based on an integer programming formulation of the graph coloring problem. This formulation, called is an assignment of labels to each vertex such that the endpoints of any edge have different labels. A minimum

  5. A Count of Classical Field Theory Graphs

    E-Print Network [OSTI]

    Gordon Chalmers

    2005-07-28T23:59:59.000Z

    A generating function is derived that counts the number of diagrams in an arbitrary scalar field theory. The number of graphs containing any number $n_j$ of $j$-point vertices is given. The count is also used to obtain the number of classical graphs in gauge theory and gravity.

  6. A Components Database Design and Implementation for Accelerators and Detectors

    SciTech Connect (OSTI)

    Chan, A.; Meyer, S.; /SLAC

    2011-08-31T23:59:59.000Z

    Many accelerator and detector systems being fabricated for the PEP-II Accelerator and BABAR Detector needed configuration control and calibration measurements tracked for their components. Instead of building a database for each distinct system, a Components Database was designed and implemented that can encompass any type of component and any type of measurement. In this paper we describe this database design that is especially suited for the engineering and fabrication processes of the accelerator and detector environments where there are thousands of unique component types. We give examples of information stored in the Components Database, which includes accelerator configuration, calibration measurements, fabrication history, design specifications, inventory, etc. The World Wide Web interface is used to access the data, and templates are available for international collaborations to collect data off-line.

  7. Sandia Energy - Sandia Wind Turbine Loads Database

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

    Sandia Wind Turbine Loads Database Home Stationary Power Energy Conversion Efficiency Wind Energy Resources Wind Software Downloads Sandia Wind Turbine Loads Database Sandia Wind...

  8. Hydrogen Storage Materials Database Demonstration Webinar (Text...

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

    Database Demonstration Webinar (Text Version) Hydrogen Storage Materials Database Demonstration Webinar (Text Version) Below is the text version of the webinar titled "Hydrogen...

  9. Sandia National Laboratories: national reliability database

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

    national reliability database Third Annual Continuous Reliability Enhancement for Wind (CREW) Database Report Now Available On October 17, 2013, in Energy, News, News & Events,...

  10. SIX GOING ON SEVEN Database Dictionary

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

    SIX GOING ON SEVEN Database Dictionary This database dictionary provides a brief explanation of measure naming schemes and mapping used to align the Northwest Power and...

  11. Buildings Performance Database Analysis Tools | Department of...

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

    Performance Database Analysis Tools The Buildings Performance Database offers several analysis tools for exploring building data and forecasting financial and energy savings,...

  12. Mining Bug Databases for Unidentified Software Vulnerabilities

    SciTech Connect (OSTI)

    Dumidu Wijayasekara; Milos Manic; Jason Wright; Miles McQueen

    2012-06-01T23:59:59.000Z

    Identifying software vulnerabilities is becoming more important as critical and sensitive systems increasingly rely on complex software systems. It has been suggested in previous work that some bugs are only identified as vulnerabilities long after the bug has been made public. These vulnerabilities are known as hidden impact vulnerabilities. This paper discusses the feasibility and necessity to mine common publicly available bug databases for vulnerabilities that are yet to be identified. We present bug database analysis of two well known and frequently used software packages, namely Linux kernel and MySQL. It is shown that for both Linux and MySQL, a significant portion of vulnerabilities that were discovered for the time period from January 2006 to April 2011 were hidden impact vulnerabilities. It is also shown that the percentage of hidden impact vulnerabilities has increased in the last two years, for both software packages. We then propose an improved hidden impact vulnerability identification methodology based on text mining bug databases, and conclude by discussing a few potential problems faced by such a classifier.

  13. Marine and Hydrokinetic Technology Database

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

    DOE’s Marine and Hydrokinetic Technology Database provides up-to-date information on marine and hydrokinetic renewable energy, both in the U.S. and around the world. The database includes wave, tidal, current, and ocean thermal energy, and contains information on the various energy conversion technologies, companies active in the field, and development of projects in the water. Depending on the needs of the user, the database can present a snapshot of projects in a given region, assess the progress of a certain technology type, or provide a comprehensive view of the entire marine and hydrokinetic energy industry. Results are displayed as a list of technologies, companies, or projects. Data can be filtered by a number of criteria, including country/region, technology type, generation capacity, and technology or project stage. The database was updated in 2009 to include ocean thermal energy technologies, companies, and projects.

  14. ORISE: Human Subjects Research Database

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

    Human Subjects Research Database Section 10, Part 745 of the Code of Federal Regulations and U.S. Department of Energy (DOE) Orders 443.1 and 481.1 require the maintenance of...

  15. Gray: Introduction 1 Database and Transaction Processing Performance Handbook

    E-Print Network [OSTI]

    Narasayya, Vivek

    are often used in this way as a rough estimate of the relative system performance because the cost/performance metrics for database systems and transaction processing systems. Each benchmark tries to answer with the lowest cost-of-ownership". Cost-of-ownership includes project risks, programming costs, operations costs

  16. Rice Glycosyltransferase (GT) Phylogenomic Database

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

    Ronald, Pamela

    The Ronald Laboratory staff at the University of California-Davis has a primary research focus on the genes of the rice plant. They study the role that genetics plays in the way rice plants respond to their environment. They created the Rice GT Database in order to integrate functional genomic information for putative rice Glycosyltransferases (GTs). This database contains information on nearly 800 putative rice GTs (gene models) identified by sequence similarity searches based on the Carbohydrate Active enZymes (CAZy) database. The Rice GT Database provides a platform to display user-selected functional genomic data on a phylogenetic tree. This includes sequence information, mutant line information, expression data, etc. An interactive chromosomal map shows the position of all rice GTs, and links to rice annotation databases are included. The format is intended to "facilitate the comparison of closely related GTs within different families, as well as perform global comparisons between sets of related families." [From http://ricephylogenomics.ucdavis.edu/cellwalls/gt/genInfo.shtml] See also the primary paper discussing this work: Peijian Cao, Laura E. Bartley, Ki-Hong Jung and Pamela C. Ronalda. Construction of a Rice Glycosyltransferase Phylogenomic Database and Identification of Rice-Diverged Glycosyltransferases. Molecular Plant, 2008, 1(5): 858-877.

  17. Integrated storage and querying of spatially varying data quality information in a relational spatial database

    E-Print Network [OSTI]

    Duckham, Matt

    Variation in Quality Keywords Spatial data quality; spatial database; relational database management system of existing and proposed spatial data quality management systems. 1 INTRODUCTION Uncertainty has long been systems in the literature for spatial data quality management, highlighting three funda- mentally

  18. Midcontinent Interactive Digital Carbon Atlas and Relational Database (MIDCARB)

    SciTech Connect (OSTI)

    Timothy R. Carr; Scott W. White

    2002-06-01T23:59:59.000Z

    This annual report describes progress of the project entitled ''Midcontinent Interactive Digital Carbon Atlas and Relational Database (MIDCARB)''. This project, funded by the Department of Energy, is a cooperative project that assembles a consortium of five states (Indiana, Illinois, Kansas, Kentucky and Ohio) to construct an online distributed Relational Database Management System (RDBMS) and Geographic Information System (GIS) covering aspects of carbon dioxide geologic sequestration (http://www.midcarb.org). The system links the five states in the consortium into a coordinated regional database system consisting of datasets useful to industry, regulators and the public. The project is working to provide advanced distributed computing solutions to link database servers across the five states into a single system where data is maintained at the local level but is accessed through a single Web portal and can be queried, assembled, analyzed and displayed. Each individual state has strengths in data gathering, data manipulation and data display, including GIS mapping, custom application development, web development, and database design. Sharing of expertise provides the critical mass of technical expertise to improve CO{sub 2} databases and data access in all states. This project improves the flow of data across servers in the five states and increases the amount and quality of available digital data. The MIDCARB project is developing improved online tools to provide real-time display and analyze CO{sub 2} sequestration data. The system links together data from sources, sinks and transportation within a spatial database that can be queried online. Visualization of high quality and current data can assist decision makers by providing access to common sets of high quality data in a consistent manner.

  19. EuroComb 2005 DMTCS proc. AE, 2005, 389--396 Acyclic Coloring of Graphs of Maximum

    E-Print Network [OSTI]

    Fertin, Guillaume

    for several families F of graphs such as planar graphs [Bor79], planar graphs with ``large'' girth [BKW99], 1

  20. Objectoriented databases are used mainly in new application domains that are not cov ered efficiently by pastgeneration systems. However, requiring all users to work on the

    E-Print Network [OSTI]

    Bonner, Anthony

    information model limits the extensibility of the system, and introduces difficulties when, for instance mechanism by means of a deductive object­oriented language, namely F­logic, and address the arising issues : : : : : : : : : : : : : : : : 16 2.3.3 A View as a View Schema : : : : : : : : : : : : : : : : : : : : : : 17 3 The View Model 19 3

  1. Vienna Graph Template Library Version 1.0

    E-Print Network [OSTI]

    Neumaier, Arnold

    .1 Vienna Graph Template Library Modules Here is a list of all modules: Classes and types for external useVienna Graph Template Library Version 1.0 Reference Manual Hermann Schichl University of Vienna.2.14 #12;CONTENTS 1 Contents 1 Introduction 1 2 Vienna Graph Template Library Module Index 2 3 Vienna Graph

  2. Attack Graphs for Sensor Placement, Alert Prioritization, and Attack Response

    E-Print Network [OSTI]

    Noel, Steven

    1 Attack Graphs for Sensor Placement, Alert Prioritization, and Attack Response Steven Noel of IDS alarms, using attack graph analysis. Our attack graphs predict the various possible ways and attacker exploits provides an attack graph showing all possible paths to critical assets. We then place IDS

  3. Solid Waste Projection Model: Database (Version 1.3). Technical reference manual

    SciTech Connect (OSTI)

    Blackburn, C.L.

    1991-11-01T23:59:59.000Z

    The Solid Waste Projection Model (SWPM) system is an analytical tool developed by Pacific Northwest Laboratory (PNL) for Westinghouse Hanford Company (WHC). The SWPM system provides a modeling and analysis environment that supports decisions in the process of evaluating various solid waste management alternatives. This document, one of a series describing the SWPM system, contains detailed information regarding the software and data structures utilized in developing the SWPM Version 1.3 Database. This document is intended for use by experienced database specialists and supports database maintenance, utility development, and database enhancement.

  4. Protein sequence databases Rolf Apweiler1,

    E-Print Network [OSTI]

    Information NREF non-redundant reference databases PDB Protein Data Bank PIR Protein Information Resource PIR

  5. High-Performance Secure Database Access Technologies for HEP Grids

    SciTech Connect (OSTI)

    Matthew Vranicar; John Weicher

    2006-04-17T23:59:59.000Z

    The Large Hadron Collider (LHC) at the CERN Laboratory will become the largest scientific instrument in the world when it starts operations in 2007. Large Scale Analysis Computer Systems (computational grids) are required to extract rare signals of new physics from petabytes of LHC detector data. In addition to file-based event data, LHC data processing applications require access to large amounts of data in relational databases: detector conditions, calibrations, etc. U.S. high energy physicists demand efficient performance of grid computing applications in LHC physics research where world-wide remote participation is vital to their success. To empower physicists with data-intensive analysis capabilities a whole hyperinfrastructure of distributed databases cross-cuts a multi-tier hierarchy of computational grids. The crosscutting allows separation of concerns across both the global environment of a federation of computational grids and the local environment of a physicist’s computer used for analysis. Very few efforts are on-going in the area of database and grid integration research. Most of these are outside of the U.S. and rely on traditional approaches to secure database access via an extraneous security layer separate from the database system core, preventing efficient data transfers. Our findings are shared by the Database Access and Integration Services Working Group of the Global Grid Forum, who states that "Research and development activities relating to the Grid have generally focused on applications where data is stored in files. However, in many scientific and commercial domains, database management systems have a central role in data storage, access, organization, authorization, etc, for numerous applications.” There is a clear opportunity for a technological breakthrough, requiring innovative steps to provide high-performance secure database access technologies for grid computing. We believe that an innovative database architecture where the secure authorization is pushed into the database engine will eliminate inefficient data transfer bottlenecks. Furthermore, traditionally separated database and security layers provide an extra vulnerability, leaving a weak clear-text password authorization as the only protection on the database core systems. Due to the legacy limitations of the systems’ security models, the allowed passwords often can not even comply with the DOE password guideline requirements. We see an opportunity for the tight integration of the secure authorization layer with the database server engine resulting in both improved performance and improved security. Phase I has focused on the development of a proof-of-concept prototype using Argonne National Laboratory’s (ANL) Argonne Tandem-Linac Accelerator System (ATLAS) project as a test scenario. By developing a grid-security enabled version of the ATLAS project’s current relation database solution, MySQL, PIOCON Technologies aims to offer a more efficient solution to secure database access.

  6. Graph partitioning advance clustering technique

    E-Print Network [OSTI]

    Madhulatha, T Soni

    2012-01-01T23:59:59.000Z

    Clustering is a common technique for statistical data analysis, Clustering is the process of grouping the data into classes or clusters so that objects within a cluster have high similarity in comparison to one another, but are very dissimilar to objects in other clusters. Dissimilarities are assessed based on the attribute values describing the objects. Often, distance measures are used. Clustering is an unsupervised learning technique, where interesting patterns and structures can be found directly from very large data sets with little or none of the background knowledge. This paper also considers the partitioning of m-dimensional lattice graphs using Fiedler's approach, which requires the determination of the eigenvector belonging to the second smallest Eigenvalue of the Laplacian with K-means partitioning algorithm.

  7. A role for matrices in graph theory

    E-Print Network [OSTI]

    McLean, John Patrick

    1971-01-01T23:59:59.000Z

    Theory are well established areas in mathematics, much remains to be done in the standardization of notation and conventions. Thus we begin by defining terms to be used in this Thesis. 1. ) ~Gh 1'h By the directed graph G(X, r), or simply G, we mean... directed graph is said to be stronglb connected if for each pair of vertices x and x. , there is a path from xi to x ~ If Z is a subset of X and TZ is the subfunction of I' from Z into Z, then G'(Z, "Z) is a subgz'aph of G. The bi-partite graph G(X, Y...

  8. Quantum Vacuum Energy in Graphs and Billiards

    E-Print Network [OSTI]

    L. Kaplan

    2011-01-03T23:59:59.000Z

    The vacuum (Casimir) energy in quantum field theory is a problem relevant both to new nanotechnology devices and to dark energy in cosmology. The crucial question is the dependence of the energy on the system geometry under study. Despite much progress since the first prediction of the Casimir effect in 1948 and its subsequent experimental verification in simple geometries, even the sign of the force in nontrivial situations is still a matter of controversy. Mathematically, vacuum energy fits squarely into the spectral theory of second-order self-adjoint elliptic linear differential operators. Specifically, one promising approach is based on the small-t asymptotics of the cylinder kernel e^(-t sqrt(H)), where H is the self-adjoint operator under study. In contrast with the well-studied heat kernel e^(-tH), the cylinder kernel depends in a non-local way on the geometry of the problem. We discuss some results by the Louisiana-Oklahoma-Texas collaboration on vacuum energy in model systems, including quantum graphs and two-dimensional cavities. The results may shed light on general questions, including the relationship between vacuum energy and periodic or closed classical orbits, and the contribution to vacuum energy of boundaries, edges, and corners.

  9. Principles of spatial database analysis and design This chapter covers the fundamentals of spatial database analysis and design, It begins by

    E-Print Network [OSTI]

    ) system coupled with a database management system (DBMS), in a spatial engine accessed through an application programming interface (API), and sitting on top of a DBMS, in a universal (object

  10. Werner Trobin, May 26, 2004 The Boost Graph Library -p. 1/48 The Boost Graph Library

    E-Print Network [OSTI]

    Werner Trobin, May 26, 2004 The Boost Graph Library - p. 1/48 The Boost Graph Library Generic Library Design Werner Trobin #12;Introduction The Boost Graph Library Demo References Werner Trobin, May 26, 2004 The Boost Graph Library - p. 2/48 Outline I Introduction to Boost I The Boost

  11. Continuous-time quantum walks on star graphs

    SciTech Connect (OSTI)

    Salimi, S. [Department of Physics, University of Kurdistan, P.O. Box 66177-15175, Sanandaj (Iran, Islamic Republic of)], E-mail: shsalimi@uok.ac.ir

    2009-06-15T23:59:59.000Z

    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.

  12. Solid Waste Projection Model: Database (Version 1.4). Technical reference manual

    SciTech Connect (OSTI)

    Blackburn, C.; Cillan, T.

    1993-09-01T23:59:59.000Z

    The Solid Waste Projection Model (SWPM) system is an analytical tool developed by Pacific Northwest Laboratory (PNL) for Westinghouse Hanford Company (WHC). The SWPM system provides a modeling and analysis environment that supports decisions in the process of evaluating various solid waste management alternatives. This document, one of a series describing the SWPM system, contains detailed information regarding the software and data structures utilized in developing the SWPM Version 1.4 Database. This document is intended for use by experienced database specialists and supports database maintenance, utility development, and database enhancement. Those interested in using the SWPM database should refer to the SWPM Database User`s Guide. This document is available from the PNL Task M Project Manager (D. L. Stiles, 509-372-4358), the PNL Task L Project Manager (L. L. Armacost, 509-372-4304), the WHC Restoration Projects Section Manager (509-372-1443), or the WHC Waste Characterization Manager (509-372-1193).

  13. Compression Aware Physical Database Design

    E-Print Network [OSTI]

    Kimura, Hideaki; Syamala, Manoj

    2011-01-01T23:59:59.000Z

    Modern RDBMSs support the ability to compress data using methods such as null suppression and dictionary encoding. Data compression offers the promise of significantly reducing storage requirements and improving I/O performance for decision support queries. However, compression can also slow down update and query performance due to the CPU costs of compression and decompression. In this paper, we study how data compression affects choice of appropriate physical database design, such as indexes, for a given workload. We observe that approaches that decouple the decision of whether or not to choose an index from whether or not to compress the index can result in poor solutions. Thus, we focus on the novel problem of integrating compression into physical database design in a scalable manner. We have implemented our techniques by modifying Microsoft SQL Server and the Database Engine Tuning Advisor (DTA) physical design tool. Our techniques are general and are potentially applicable to DBMSs that support other co...

  14. National Residential Efficiency Measures Database

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

    The National Residential Efficiency Measures Database is a publicly available, centralized resource of residential building retrofit measures and costs for the U.S. building industry. With support from the U.S. Department of Energy, NREL developed this tool to help users determine the most cost-effective retrofit measures for improving energy efficiency of existing homes. Software developers who require residential retrofit performance and cost data for applications that evaluate residential efficiency measures are the primary audience for this database. In addition, home performance contractors and manufacturers of residential materials and equipment may find this information useful. The database offers the following types of retrofit measures: 1) Appliances, 2) Domestic Hot Water, 3) Enclosure, 4) Heating, Ventilating, and Air Conditioning (HVAC), 5) Lighting, 6) Miscellaneous.

  15. DOE Global Energy Storage Database

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

    The DOE International Energy Storage Database has more than 400 documented energy storage projects from 34 countries around the world. The database provides free, up-to-date information on grid-connected energy storage projects and relevant state and federal policies. More than 50 energy storage technologies are represented worldwide, including multiple battery technologies, compressed air energy storage, flywheels, gravel energy storage, hydrogen energy storage, pumped hydroelectric, superconducting magnetic energy storage, and thermal energy storage. The policy section of the database shows 18 federal and state policies addressing grid-connected energy storage, from rules and regulations to tariffs and other financial incentives. It is funded through DOE’s Sandia National Laboratories, and has been operating since January 2012.

  16. Downsizing a database platform for increased performance and decreased costs

    SciTech Connect (OSTI)

    Miller, M.M.; Tolendino, L.F.

    1993-06-01T23:59:59.000Z

    Technological advances in the world of microcomputers have brought forth affordable systems and powerful software than can compete with the more traditional world of minicomputers. This paper describes an effort at Sandia National Laboratories to decrease operational and maintenance costs and increase performance by moving a database system from a minicomputer to a microcomputer.

  17. On semidefinite programming bounds for graph bandwidth

    E-Print Network [OSTI]

    2011-05-24T23:59:59.000Z

    May 24, 2011 ... the rectangular grid graph Pn × Pm (i.e. the Cartesian product of the paths Pn and Pm) is min{n, m} [6] ...... Ars Combinatoria, 47:147-152, 1997.

  18. Constant time algorithms in sparse graph model

    E-Print Network [OSTI]

    Nguyen, Huy Ngoc, Ph. D. Massachusetts Institute of Technology

    2010-01-01T23:59:59.000Z

    We focus on constant-time algorithms for graph problems in bounded degree model. We introduce several techniques to design constant-time approximation algorithms for problems such as Vertex Cover, Maximum Matching, Maximum ...

  19. Forced orientation of graphs Babak Farzad

    E-Print Network [OSTI]

    Toronto, University of

    Forced orientation of graphs Babak Farzad Mohammad Mahdian Ebad S. Mahmoodian Amin Saberi§ Bardia, USA. (saberi@cc.gatech.edu) ¶ Department of Computer Science, UIUC, Urbana, USA. (sadri@cs.uiuc.edu) 1

  20. Fault-tolerant dynamic task graph scheduling

    SciTech Connect (OSTI)

    Kurt, Mehmet C.; Krishnamoorthy, Sriram; Agrawal, Kunal; Agrawal, Gagan

    2014-11-16T23:59:59.000Z

    In this paper, we present an approach to fault tolerant execution of dynamic task graphs scheduled using work stealing. In particular, we focus on selective and localized recovery of tasks in the presence of soft faults. We elicit from the user the basic task graph structure in terms of successor and predecessor relationships. The work stealing-based algorithm to schedule such a task graph is augmented to enable recovery when the data and meta-data associated with a task get corrupted. We use this redundancy, and the knowledge of the task graph structure, to selectively recover from faults with low space and time overheads. We show that the fault tolerant design retains the essential properties of the underlying work stealing-based task scheduling algorithm, and that the fault tolerant execution is asymptotically optimal when task re-execution is taken into account. Experimental evaluation demonstrates the low cost of recovery under various fault scenarios.

  1. Projective representations from quantum enhanced graph symmetries

    E-Print Network [OSTI]

    2015-03-11T23:59:59.000Z

    Presently, we will label the edges of a graph by elements of a group ...... (a) Read off the matrix ? by putting the G label of a vertex onto the diagonal in the place.

  2. 2Cosmic Bar Graphs Galaxy Type

    E-Print Network [OSTI]

    in the cluster are spirals? Problem 2 ­ Gamma-ray bursts happen about once each day. The bar graph to the right there are 160 total galaxies, the fraction of spirals is 137/160 = 0.86, or equivalently 86%. Problem 2 ­ Gamma-ray2Cosmic Bar Graphs 0 20 40 60 80 100 S E SB I Galaxy Type Number 0 200 400 600 800 1000 FB SB Burst

  3. Graphs of subgroups of free groups

    E-Print Network [OSTI]

    Louder, Larsen

    2009-01-01T23:59:59.000Z

    We construct an efficient model for graphs of finitely generated subgroups of free groups. Using this we give a very short proof of Dicks's reformulation of the strengthened Hanna Neumann Conjecture as the Amalgamated Graph Conjecture. In addition, we answer a question of Culler and Shalen on ranks of intersections in free groups. The latter has also been done independently by R. P. Kent IV.

  4. RemusDB: Transparent High Availability for Database Umar Farooq Minhas Shriram Rajagopalan Brendan Cully Ashraf

    E-Print Network [OSTI]

    Aboulnaga, Ashraf

    present a technique for building a high-availability (HA) database management system (DBMS). The proposed technique can be ap- plied to any DBMS with little or no customization, and with reasonable performance capabilities. We show that while Remus and similar systems can protect a DBMS, database workloads incur

  5. A Metadata-Rich File System

    SciTech Connect (OSTI)

    Ames, S; Gokhale, M B; Maltzahn, C

    2009-01-07T23:59:59.000Z

    Despite continual improvements in the performance and reliability of large scale file systems, the management of file system metadata has changed little in the past decade. The mismatch between the size and complexity of large scale data stores and their ability to organize and query their metadata has led to a de facto standard in which raw data is stored in traditional file systems, while related, application-specific metadata is stored in relational databases. This separation of data and metadata requires considerable effort to maintain consistency and can result in complex, slow, and inflexible system operation. To address these problems, we have developed the Quasar File System (QFS), a metadata-rich file system in which files, metadata, and file relationships are all first class objects. In contrast to hierarchical file systems and relational databases, QFS defines a graph data model composed of files and their relationships. QFS includes Quasar, an XPATH-extended query language for searching the file system. Results from our QFS prototype show the effectiveness of this approach. Compared to the defacto standard, the QFS prototype shows superior ingest performance and comparable query performance on user metadata-intensive operations and superior performance on normal file metadata operations.

  6. Proceedings of MISC 2012 -2nd International Symposium on Modelling and Implementation of Complex Systems

    E-Print Network [OSTI]

    Boyer, Edmond

    Systems Constantine, Algeria, May 20-21, 2012 On the fly PSO inspired algorithm for graph distribution with clustering applications, it proposes an on the fly algorithm for distributing graphs. The proposed algorithm of adapting the PSO algorithm for graphs distribution is developed firstly by assuming that the graph

  7. Evaluation of Semantic Graph based on Model Checking Mahdi Gueffaz, Sylvain Rampacek and Christophe Nicolle

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    floods. Model checking is a powerful tool for system verification because it can reveal errors that were to describe the properties checking the system model. 395 hal-00617998,version1-31Aug2011 Author manuscriptSCALESEM Evaluation of Semantic Graph based on Model Checking Mahdi Gueffaz, Sylvain Rampacek

  8. Benefits of an International Database for UF6 Cylinders

    SciTech Connect (OSTI)

    Babcock, R A; Whitaker, J M; Murphy, J; Oakberg, J

    2008-06-30T23:59:59.000Z

    A reasonable expectation regarding the nuclear energy renaissance is that the location of fuel cycle nuclear materials throughout the world will be known. We ask--would an international system for uranium hexafluoride (UF{sub 6}) cylinders provide the effective assurances expected for international fuel supply and of the international fuel centers? This paper introduces the question and discusses the potential benefits of tracking UF{sub 6} cylinders through the development of an international database. The nonproliferation benefits of an international database for UF{sub 6} cylinders being used in the fuel cycle include an enhanced capability to reconcile nuclear material imports and exports. Currently, import and export declarations only require the reporting of total 'rolled up' quantities of nuclear materials contained in all items--not the quantities of materials in individual items like individual UF{sub 6} cylinders. The database could provide supplier countries with more assurance on the location of the UF{sub 6} cylinders they export. Additionally, a comprehensive database on all declared cylinders would be a valuable resource in detecting and recognizing undeclared cylinders. The database could potentially be administered by the IAEA and be accessible to authorized countries around the world. During the nuclear renaissance, the general public, as well as the participants will expect transparency and quality information about movement of nuclear fuel cycle nuclear materials. We will discuss the potential benefits of such a database for the suppliers, inspectorates, and general public.

  9. Noisy entanglement evolution for graph states

    E-Print Network [OSTI]

    Aolita, L; Chaves, R; Dhara, C; Davidovich, L; Acin, A

    2010-01-01T23:59:59.000Z

    A general method for the study of the entanglement evolution of graph states under the action of Pauli was recently proposed in [Cavalcanti, et al., Phys. Rev. Lett. 103, 030502 (2009)]. This method is based on lower and upper bounds on the entanglement of the entire state as a function only of the state of a considerably-smaller subsystem, which undergoes an effective noise process. This provides a huge simplification on the size of the matrices involved in the calculation of entanglement in these systems. In the present paper we elaborate on this method in details and generalize it to other natural situations not described by Pauli maps. Specifically, for Pauli maps we introduce an explicit formula for the characterization of the resulting effective noise. Beyond Pauli maps, we show that the same ideas can be applied to the case of thermal reservoirs at arbitrary temperature. In the latter case, we discuss how to optimize the bounds as a function of the noise strength. We illustrate our ideas with explicit ...

  10. Intro Algo ring Arbitrary graphs Conclusion PING PONG IN DANGEROUS GRAPHS

    E-Print Network [OSTI]

    Fondements et Applications, Université Paris 7

    Intro Algo ring Arbitrary graphs Conclusion PING PONG IN DANGEROUS GRAPHS Optimal Black Hole Search blocking and destroying any mobile agent entering it. Motivations : Site which is destroyed or dangerous blocking and destroying any mobile agent entering it. Motivations : Site which is destroyed or dangerous

  11. Decay of Correlations for the Hardcore Model on the $d$-regular Random Graph

    E-Print Network [OSTI]

    Nayantara Bhatnagar; Allan Sly; Prasad Tetali

    2014-05-23T23:59:59.000Z

    A key insight from statistical physics about spin systems on random graphs is the central role played by Gibbs measures on trees. We determine the local weak limit of the hardcore model on random regular graphs asymptotically until just below its condensation threshold, showing that it converges in probability locally in a strong sense to the free boundary condition Gibbs measure on the tree. As a consequence we show that the reconstruction threshold on the random graph, indicative of the onset of point to set spatial correlations, is equal to the reconstruction threshold on the $d$-regular tree for which we determine precise asymptotics. We expect that our methods will generalize to a wide range of spin systems for which the second moment method holds.

  12. Workload-Aware Database Monitoring and Consolidation

    E-Print Network [OSTI]

    Curino, Carlo

    In most enterprises, databases are deployed on dedicated database servers. Often, these servers are underutilized much of the time. For example, in traces from almost 200 production servers from different organizations, ...

  13. Webinar: NREL's Fuel Cell Contaminant Database

    Broader source: Energy.gov [DOE]

    Video recording and text version of the webinar titled "NREL's Fuel Cell Contaminant Database," originally presented on May 27, 2014.

  14. Buildings Performance Database Recommend Data Fields | Department...

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

    Renewable Energy. bpdrecommendeddatafields.pdf More Documents & Publications BEDES Beta Data Preparation Process for the Buildings Performance Database Commercial Building...

  15. Webinar: Hydrogen Storage Materials Database Demonstration

    Broader source: Energy.gov [DOE]

    Video recording and text version of the webinar, Hydrogen Storage Materials Database Demonstration, originally presented on December 13, 2011.

  16. 1991-2005 National Solar Radiation Database

    SciTech Connect (OSTI)

    Wilcox, S.

    2007-05-01T23:59:59.000Z

    This fact sheet provides an overview of the purpose, benefit, and features of the newly updated National Solar Radiation Database.

  17. Search Log Analysis of the ARTstor Cultural Heritage Image Database

    E-Print Network [OSTI]

    Lowe, Heather Ann

    2013-01-01T23:59:59.000Z

    Patterns in a Digital Image Database. Information RetrievalCultural Heritage Image Database A thesis submitted inCultural Heritage Image Database by Heather Ann Lowe Master

  18. The Majorana Parts Tracking Database

    E-Print Network [OSTI]

    Abgrall, N; Avignone, F T; Bertrand, F E; Brudanin, V; Busch, M; Byram, D; Caldwell, A S; Chan, Y-D; Christofferson, C D; Combs, D C; Cuesta, C; Detwiler, J A; Doe, P J; Efremenko, Yu; Egorov, V; Ejiri, H; Elliott, S R; Esterline, J; Fast, J E; Finnerty, P; Fraenkle, F M; Galindo-Uribarri, A; Giovanetti, G K; Goett, J; Green, M P; Gruszko, J; Guiseppe, V E; Gusev, K; Hallin, A L; Hazama, R; Hegai, A; Henning, R; Hoppe, E W; Howard, S; Howe, M A; Keeter, K J; Kidd, M F; Kochetov, O; Kouzes, R T; LaFerriere, B D; Leon, J Diaz; Leviner, L E; Loach, J C; MacMullin, J; Martin, R D; Meijer, S J; Mertens, S; Miller, M L; Mizouni, L; Nomachi, M; Orrell, J L; O'Shaughnessy, C; Overman, N R; Petersburg, R; Phillips, D G; Poon, A W P; Pushkin, K; Radford, D C; Rager, J; Rielage, K; Robertson, R G H; Romero-Romero, E; Ronquest, M C; Shanks, B; Shima, T; Shirchenko, M; Snavely, K J; Snyder, N; Soin, A; Suriano, A M; Tedeschi, D; Thompson, J; Timkin, V; Tornow, W; Trimble, J E; Varner, R L; Vasilyev, S; Vetter, K; Vorren, K; White, B R; Wilkerson, J F; Wiseman, C; Xu, W; Yakushev, E; Young, A R; Yu, C -H; Zhitnikov, I

    2015-01-01T23:59:59.000Z

    The Majorana Demonstrator is an ultra-low background physics experiment searching for the neutrinoless double beta decay of $^{76}$Ge. The Majorana Parts Tracking Database is used to record the history of components used in the construction of the Demonstrator. The tracking implementation takes a novel approach based on the schema-free database technology CouchDB. Transportation, storage, and processes undergone by parts such as machining or cleaning are linked to part records. Tracking parts provides a great logistics benefit and an important quality assurance reference during construction. In addition, the location history of parts provides an estimate of their exposure to cosmic radiation. A web application for data entry and a radiation exposure calculator have been developed as tools for achieving the extreme radio-purity required for this rare decay search.

  19. The Majorana Parts Tracking Database

    E-Print Network [OSTI]

    The Majorana Collaboration; N. Abgrall; E. Aguayo; F. T. Avignone III; A. S. Barabash; F. E. Bertrand; V. Brudanin; M. Busch; D. Byram; A. S. Caldwell; Y-D. Chan; C. D. Christofferson; D. C. Combs; C. Cuesta; J. A. Detwiler; P. J. Doe; Yu. Efremenko; V. Egorov; H. Ejiri; S. R. Elliott; J. Esterline; J. E. Fast; P. Finnerty; F. M. Fraenkle; A. Galindo-Uribarri; G. K. Giovanetti; J. Goett; M. P. Green; J. Gruszko; V. E. Guiseppe; K. Gusev; A. L. Hallin; R. Hazama; A. Hegai; R. Henning; E. W. Hoppe; S. Howard; M. A. Howe; K. J. Keeter; M. F. Kidd; O. Kochetov; S. I. Konovalov; R. T. Kouzes; B. D. LaFerriere; J. Diaz Leon; L. E. Leviner; J. C. Loach; J. MacMullin; R. D. Martin; S. J. Meijer; S. Mertens; M. L. Miller; L. Mizouni; M. Nomachi; J. L. Orrell; C. O'Shaughnessy; N. R. Overman; R. Petersburg; D. G. Phillips II; A. W. P. Poon; K. Pushkin; D. C. Radford; J. Rager; K. Rielage; R. G. H. Robertson; E. Romero-Romero; M. C. Ronquest; B. Shanks; T. Shima; M. Shirchenko; K. J. Snavely; N. Snyder; A. Soin; A. M. Suriano; D. Tedeschi; J. Thompson; V. Timkin; W. Tornow; J. E. Trimble; R. L. Varner; S. Vasilyev; K. Vetter; K. Vorren; B. R. White; J. F. Wilkerson; C. Wiseman; W. Xu; E. Yakushev; A. R. Young; C. -H. Yu; V. Yumatov; I. Zhitnikov

    2015-02-05T23:59:59.000Z

    The Majorana Demonstrator is an ultra-low background physics experiment searching for the neutrinoless double beta decay of $^{76}$Ge. The Majorana Parts Tracking Database is used to record the history of components used in the construction of the Demonstrator. The tracking implementation takes a novel approach based on the schema-free database technology CouchDB. Transportation, storage, and processes undergone by parts such as machining or cleaning are linked to part records. Tracking parts provides a great logistics benefit and an important quality assurance reference during construction. In addition, the location history of parts provides an estimate of their exposure to cosmic radiation. A web application for data entry and a radiation exposure calculator have been developed as tools for achieving the extreme radio-purity required for this rare decay search.

  20. Multi databases in Health Care Networks

    E-Print Network [OSTI]

    Salih, Nadir K; Sun, Mingrui

    2011-01-01T23:59:59.000Z

    E-Health is a relatively recent term for healthcare practice supported by electronic processes and communication, dating back to at least 1999. E-Health is greatly impacting on information distribution and availability within the health services, hospitals and to the public. E-health was introduced as the death of telemedicine, because - in the context of a broad availability of medical information systems that can interconnect and communicate - telemedicine will no longer exist as a specific field. The same could also be said for any other traditional field in medical informatics, including information systems and electronic patient records. E-health presents itself as a common name for all such technological fields. In this paper we focuses in multi database by determined some sites and distributed it in Homogenous way. This will be followed by an illustrative example as related works. Finally, the paper concludes with general remarks and a statement of further work.

  1. Comprehensive Database on Concrete Creep and Shrinkage

    E-Print Network [OSTI]

    Comprehensive Database on Concrete Creep and Shrinkage Zdenek P. Bazant and Guang-Hua Li Structural Database on Concrete Creep and Shrinkage Zdenek P. Bazant1 and Guang-Hua Li2 Abstract: As a sequel to the first large database created at Northwestern University in 1978, the paper presents a further

  2. Computer Note A Prototype Object Database for

    E-Print Network [OSTI]

    Neigel, Joseph E.

    Computer Note A Prototype Object Database for Mitochondrial DNA Variation J. E. NEIGEL AND P preserved. We hope to prevent further loss by establishing a community database for population genetic surveys. We explored the feasibility of a population genetics database by developing a prototype

  3. DATABASE AUTHENTICATION BY DISTORTION FREE WATERMARKING

    E-Print Network [OSTI]

    Cortesi, Tino

    DATABASE AUTHENTICATION BY DISTORTION FREE WATERMARKING Sukriti Bhattacharya and Agostino Cortesi@dsi.unive.it, cortesi@unive.it Keywords: Database watermarking, ZAW, Public key watermark, Abstract interpretation the verification of integrity of the relational databases by using a public zero distortion authentication

  4. 8, 76577702, 2008 A new database of

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    ACPD 8, 7657­7702, 2008 A new database of trace gases and aerosols B. Hassler et al. Title Page.0 License. Atmospheric Chemistry and Physics Discussions Technical Note: A new global database of trace­7702, 2008 A new database of trace gases and aerosols B. Hassler et al. Title Page Abstract Introduction

  5. GOLD: The Genomes Online Database

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

    Kyrpides, Nikos; Liolios, Dinos; Chen, Amy; Tavernarakis, Nektarios; Hugenholtz, Philip; Markowitz, Victor; Bernal, Alex

    Since its inception in 1997, GOLD has continuously monitored genome sequencing projects worldwide and has provided the community with a unique centralized resource that integrates diverse information related to Archaea, Bacteria, Eukaryotic and more recently Metagenomic sequencing projects. As of September 2007, GOLD recorded 639 completed genome projects. These projects have their complete sequence deposited into the public archival sequence databases such as GenBank EMBL,and DDBJ. From the total of 639 complete and published genome projects as of 9/2007, 527 were bacterial, 47 were archaeal and 65 were eukaryotic. In addition to the complete projects, there were 2158 ongoing sequencing projects. 1328 of those were bacterial, 59 archaeal and 771 eukaryotic projects. Two types of metadata are provided by GOLD: (i) project metadata and (ii) organism/environment metadata. GOLD CARD pages for every project are available from the link of every GOLD_STAMP ID. The information in every one of these pages is organized into three tables: (a) Organism information, (b) Genome project information and (c) External links. [The Genomes On Line Database (GOLD) in 2007: Status of genomic and metagenomic projects and their associated metadata, Konstantinos Liolios, Konstantinos Mavromatis, Nektarios Tavernarakis and Nikos C. Kyrpides, Nucleic Acids Research Advance Access published online on November 2, 2007, Nucleic Acids Research, doi:10.1093/nar/gkm884]

    The basic tables in the GOLD database that can be browsed or searched include the following information:

    • Gold Stamp ID
    • Organism name
    • Domain
    • Links to information sources
    • Size and link to a map, when available
    • Chromosome number, Plas number, and GC content
    • A link for downloading the actual genome data
    • Institution that did the sequencing
    • Funding source
    • Database where information resides
    • Publication status and information

    (Specialized Interface)

  6. MIDCONTINENT INTERACTIVE DIGITAL CARBON ATLAS AND RELATIONAL DATABASE (MIDCARB)

    SciTech Connect (OSTI)

    Timothy R. Carr; Scott W. White

    2003-07-01T23:59:59.000Z

    This annual report describes progress in the second year of the three-year project entitled ''Midcontinent Interactive Digital Carbon Atlas and Relational Database (MIDCARB)''. This project, funded by the Department of Energy, is a cooperative project that assembles a consortium of five states (Indiana, Illinois, Kansas, Kentucky and Ohio) to construct an online distributed Relational Database Management System (RDBMS) and Geographic Information System (GIS) covering aspects of carbon dioxide geologic sequestration (http://www.midcarb.org). The system links the five states in the consortium into a coordinated regional database system consisting of datasets useful to industry, regulators and the public. The project is providing advanced distributed computing solutions to link database servers across the five states into a single system where data is maintained at the local level but is accessed through a single Web portal and can be queried, assembled, analyzed and displayed. Each individual state has strengths in data gathering, data manipulation and data display, including GIS mapping, custom application development, web development, and database design. Sharing of expertise provides the critical mass of technical expertise to improve CO{sub 2} databases and data access in all states. This project improves the flow of data across servers in the five states and increases the amount and quality of available digital data. Data is being assembled to analyze CO{sub 2} sequestration potential from a single object (e.g., power plant or well) to a region and across geographic boundaries. The MIDCARB system is robust and capable of being updated from multiple sources on a daily basis. The MIDCARB project has developed improved online tools to provide real-time display and analysis of CO{sub 2} sequestration data. The MIDCARB project is a functional template for distributed data systems to address CO{sub 2} sequestration and other natural resource issues that cross the boundaries between institutions and geographic areas. The system links together data from sources, sinks and transportation within a spatial database that can be queried online. Visualization of high quality and current data can assist decision makers by providing access to common sets of high quality data in a consistent manner.

  7. Databases

    E-Print Network [OSTI]

    Mcgregor, D.; Cockshott, P.; Wilson, J.; US Patent 6169990 British Patent, Volume BP 9604522.4 Academic Press [More Details

    Mcgregor,D. Cockshott,P. Wilson,J. US Patent 6169990 British Patent, Volume BP 9604522.4 Academic Press

  8. Databases

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

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625govInstrumentstdmadapInactiveVisitingContract Management Fermi SitePARTOfficeOctoberDanielDTN Data

  9. Artemis Chado database -practical guide Annotation in the database version of Artemis

    E-Print Network [OSTI]

    Maizels, Rick

    -1- Artemis Chado database - practical guide Annotation in the database version of Artemis 1 directory for the backup files and optionally save this setting between sessions. Wait for the `Database and File Manager' to be loaded. Click on `Launch Artemis'. #12;-2- Artemis Chado database - practical guide

  10. The USC CreativeIT Database: A Multimodal Database of Theatrical Improvisation

    E-Print Network [OSTI]

    Busso, Carlos

    The USC CreativeIT Database: A Multimodal Database of Theatrical Improvisation Angeliki Metallinou' creativity. The USC CreativeIT database provides a novel bridge between the study of theatrical improvisation and human expressive behavior in dyadic interaction. The theoretical design of the database is based

  11. NIST Standard Reference Database 88 NIST/TRC Ideal Gas Database

    E-Print Network [OSTI]

    Magee, Joseph W.

    #12;NIST Standard Reference Database 88 NIST/TRC Ideal Gas Database Version 2.0 Users' Guide Data of the database and to verify that the data contained therein have been selected on the basis of sound scientific that may result from errors or omissions in the database. COPYRIGHT (C) 2006 copyright by the U

  12. A New Combinatorial Approach for Sparse Graph Problems

    E-Print Network [OSTI]

    Blelloch, Guy E.

    A New Combinatorial Approach for Sparse Graph Problems Guy E. Blelloch, Virginia Vassilevska- totic improvement over O(mn) for all pairs least common ancestors on directed acyclic graphs. 1

  13. Outline of the talk Statistics on Graphs, Exponential Formula and

    E-Print Network [OSTI]

    Poinsot, Laurent

    Outline of the talk Statistics on Graphs, Exponential Formula and Combinatorial Physics G and Complexity" Laurent Poinsot Statistics on Graphs, Exponential Formula and Combinatorial Physics #12;Exponential Formula : Informal Version Ingredients for the exponential formula Partial commutative monoids

  14. On perfect codes in Cartesian product of graphs Michel Mollard

    E-Print Network [OSTI]

    Boyer, Edmond

    ] and others. The existence of perfect codes have also been proved in Towers of Hanoi graphs [6] and Sierpinski on the symmetric group Sn+1 thus are of order (n + 1)!. These families include star graphs, for which the existence

  15. Codes on Graphs: Duality and MacWilliams Identities

    E-Print Network [OSTI]

    Forney, G. David, Jr.

    A conceptual framework involving partition functions of normal factor graphs is introduced, paralleling a similar recent development by Al-Bashabsheh and Mao. The partition functions of dual normal factor graphs are shown ...

  16. Generating Random Graphs with Large Girth Mohsen Bayati

    E-Print Network [OSTI]

    Saberi, Amin

    Generating Random Graphs with Large Girth Mohsen Bayati Andrea Montanari Amin Saberi Abstract We; saberi@stanford.edu. 1 #12;free graphs are close to bipartite. We show that our new algorithm guarantees

  17. GARNET : a Graphical Attack graph and Reachability Network Evaluation Tool

    E-Print Network [OSTI]

    Williams, Leevar (Leevar Christoff)

    2008-01-01T23:59:59.000Z

    Attack graphs are valuable tools in the assessment of network security, revealing potential attack paths an adversary could use to gain control of network assets. Creating an effective visualization for attack graphs is ...

  18. Scalable Parallel Algorithms for Massive Scale-free Graphs

    E-Print Network [OSTI]

    Pearce, Roger Allan

    2013-12-05T23:59:59.000Z

    , distributed, and external memory. This dissertation develops new techniques to parallelize the storage, computation, and communication for scale-free graphs with high-degree vertices. Our work facilitates the processing of large real-world graph datasets...

  19. Scalable Parallel Algorithms for Massive Scale-free Graphs 

    E-Print Network [OSTI]

    Pearce, Roger Allan

    2013-12-05T23:59:59.000Z

    , distributed, and external memory. This dissertation develops new techniques to parallelize the storage, computation, and communication for scale-free graphs with high-degree vertices. Our work facilitates the processing of large real-world graph datasets...

  20. Math 564 Graph Theory Fall 2008 Instructor Amites Sarkar

    E-Print Network [OSTI]

    Sarkar, Amites

    Math 564 Graph Theory Fall 2008 Instructor Amites Sarkar Text Pearls in Graph Theory (Dover Edition and Fridays, in 216 Bond Hall. My phone number is 650 7569 and my e-mail is amites.sarkar@wwu.edu #12;

  1. Math 564 Graph Theory Fall 2013 Instructor Amites Sarkar

    E-Print Network [OSTI]

    Sarkar, Amites

    Math 564 Graph Theory Fall 2013 Instructor Amites Sarkar Text Modern Graph Theory B´ela Bollob, Tuesdays, Wednesdays and Fridays, in 216 Bond Hall. My phone number is 650 7569 and my e-mail is amites.sarkar

  2. Density Functional Theory-Based Database Development and CALPHAD Automation

    E-Print Network [OSTI]

    Chen, Long-Qing

    Density Functional Theory-Based Database Development and CALPHAD Automation YI WANG,1,2 SHUNLI, the integration of first-principles calculations, CALPHAD modeling, and the automation of phase diagram, and the automated calculation of a phase diagram for the Al- Mg system. INTRODUCTION In thermodynamics, a phase

  3. Ceramic Technology Project database: March 1990 summary report

    SciTech Connect (OSTI)

    Keyes, B.L.P.

    1992-07-01T23:59:59.000Z

    This report is the fifth in a series of semiannual data summary reports on information being stored in the Ceramic Technology Project (CTP) database. The overall system status as of March 31, 1990, is summarized, and the latest additions of ceramic mechanical properties data are given for zirconia, silicon carbide, and silicon nitride ceramic mechanical properties data, including some properties on brazed specimens.

  4. Model Checking for Database Theoreticians Moshe Y. Vardi 1#

    E-Print Network [OSTI]

    Vardi, Moshe Y.

    techniques to establish the correctness of the system under verification with respect to a given property. Model checking is an algorithmic­verification technique that is based on a small number of key ideas to database verification. 1 Introduction The recent growth in computer power and connectivity has changed

  5. Workload Class Importance Policy in Autonomic Database Management Harley Boughton

    E-Print Network [OSTI]

    to resource allocation decisions in a database management system (DBMS). We focus on business policies that describe the relative importance of competing workloads on a DBMS. We present experiments with a simulation can be used to effectively allocate main memory resources in a commercial DBMS. 1. Introduction

  6. MadGraph 5 : Going Beyond

    E-Print Network [OSTI]

    Johan Alwall; Michel Herquet; Fabio Maltoni; Olivier Mattelaer; Tim Stelzer

    2011-06-02T23:59:59.000Z

    MadGraph 5 is the new version of the MadGraph matrix element generator, written in the Python programming language. It implements a number of new, efficient algorithms that provide improved performance and functionality in all aspects of the program. It features a new user interface, several new output formats including C++ process libraries for Pythia 8, and full compatibility with FeynRules for new physics models implementation, allowing for event generation for any model that can be written in the form of a Lagrangian. MadGraph 5 builds on the same philosophy as the previous versions, and its design allows it to be used as a collaborative platform where theoretical, phenomenological and simulation projects can be developed and then distributed to the high-energy community. We describe the ideas and the most important developments of the code and illustrate its capabilities through a few simple phenomenological examples.

  7. Problems of Distance-Regular Graphs Hiroshi Suzuki

    E-Print Network [OSTI]

    Xi, Changchang

    . Biggs, Algebraic Graph Theory Second Edition, Cambridge U. P., Cambridge 1993. [16] N. L. Biggs, A. G

  8. Implementation of the FAA research and development electromagnetic database

    SciTech Connect (OSTI)

    McDowall, R.L. (Computer Resource Management, Inc., Atlantic City, NJ (USA)); Grush, D.J.; Cook, D.M. (EG and G Idaho, Inc., Idaho Falls, ID (USA)); Glynn, M.S. (Federal Aviation Administration, Atlantic City, NJ (USA). Technical Center)

    1991-01-01T23:59:59.000Z

    The Idaho National Engineering Laboratory (INEL) has been assisting the Federal Aviation Administration (FAA) in developing a database of information about lightning. The FAA Research and Development Electromagnetic Database (FRED) will ultimately contain data from a variety of airborne and groundbased lightning research projects. This paper contains an outline of the data currently available in FRED. It also lists the data sources which the FAA intends to incorporate into FRED. In addition, it describes how the researcher may access and use the FRED menu system. 2 refs., 12 figs.

  9. Evaluating parallel relational databases for medical data analysis.

    SciTech Connect (OSTI)

    Rintoul, Mark Daniel; Wilson, Andrew T.

    2012-03-01T23:59:59.000Z

    Hospitals have always generated and consumed large amounts of data concerning patients, treatment and outcomes. As computers and networks have permeated the hospital environment it has become feasible to collect and organize all of this data. This raises naturally the question of how to deal with the resulting mountain of information. In this report we detail a proof-of-concept test using two commercially available parallel database systems to analyze a set of real, de-identified medical records. We examine database scalability as data sizes increase as well as responsiveness under load from multiple users.

  10. Construction of an integrated database to support genomic sequence analysis

    SciTech Connect (OSTI)

    Gilbert, W.; Overbeek, R.

    1994-11-01T23:59:59.000Z

    The central goal of this project is to develop an integrated database to support comparative analysis of genomes including DNA sequence data, protein sequence data, gene expression data and metabolism data. In developing the logic-based system GenoBase, a broader integration of available data was achieved due to assistance from collaborators. Current goals are to easily include new forms of data as they become available and to easily navigate through the ensemble of objects described within the database. This report comments on progress made in these areas.

  11. A Bayesian Approach to Online Performance Modeling for Database Appliances using Gaussian Models

    E-Print Network [OSTI]

    Waterloo, University of

    agreements (SLAs) and to maintain peak performance for database management systems (DBMS), database, and resource provisioning. Accurately predicting response times of DBMS queries is necessary for a DBA an efficient and highly ac- curate online DBMS performance model that is robust in the face of changing

  12. A Bayesian Approach to Online Performance Modeling for Database Appliances using Gaussian Models

    E-Print Network [OSTI]

    Aboulnaga, Ashraf

    - tain peak performance for database management systems (DBMS), database administrators (DBAs) need. Accurately predicting response times of DBMS queries is necessary for a DBA to effectively achieve and highly accurate online DBMS performance model that is robust in the face of changing workloads, data

  13. Secure Database Development Jan Jurjens (1) and Eduardo B. Fernandez (2)

    E-Print Network [OSTI]

    Jurjens, Jan

    , Florida Atlantic University, Boca Raton, FL 33431, USA http://www.cse.fau.edu/~ed Synonyms Secure DBMS in this encyclopedia (Database security). This section concentrates mostly on how to build the software of a DBMS, 6], there is little work on how to implement a secure Database Management System (DBMS). It is true

  14. Back to Basics: Homogeneous Representations of Multi-Rate Synchronous Dataflow Graphs

    E-Print Network [OSTI]

    Al Hanbali, Ahmad

    Synchronous dataflow (SDF) [1] is a popular class of models of computation and is used to model the temporal are particularly useful in the design of systems where worst-case guarantees on performance must be given. An SDF and processing elements. The class of SDF graphs that we focus on in this paper are called multi-rate SDF (MRSDF

  15. On Reducing the Global State Graph for Verification of Distributed Computations

    E-Print Network [OSTI]

    Garg, Vijay

    On Reducing the Global State Graph for Verification of Distributed Computations Arindam Chakraborty and Vijay K. Garg Parallel and Distributed Systems Laboratory The University of Texas at Austin Austin, TX 78712, USA {chakrabo,garg}@ece.utexas.edu Abstract Correct distributed programs are very hard to write

  16. Algebraic Higher-Order Nets: Graphs and Petri Nets as Tokens

    E-Print Network [OSTI]

    Mossakowski, Till - Deutschen Forschungszentrum fĂĽr KĂĽnstliche Intelligenz & Fachbereich 3

    Algebraic Higher-Order Nets: Graphs and Petri Nets as Tokens Kathrin Hoffmann1 and Till Mossakowski 2 BISS, Department of Computer Science University of Bremen Abstract. Petri nets and Algebraic High-Level Nets are well-known to model parallel and concurrent systems. In this paper, we introduce the concept

  17. Algebraic HigherOrder Nets: Graphs and Petri Nets as Tokens

    E-Print Network [OSTI]

    Mossakowski, Till - Deutschen Forschungszentrum fĂĽr KĂĽnstliche Intelligenz & Fachbereich 3

    Algebraic Higher­Order Nets: Graphs and Petri Nets as Tokens Kathrin Ho#mann 1 and Till Mossakowski 2 BISS, Department of Computer Science University of Bremen Abstract. Petri nets and Algebraic High­Level Nets are well­known to model parallel and concurrent systems. In this paper, we introduce the concept

  18. Bond Graph Model of a Vertical U-Tube Steam Condenser Coupled with a Heat Exchanger

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    turbines, distillation industries using water as a solvent, etc. System-level modeling of steam condensersBond Graph Model of a Vertical U-Tube Steam Condenser Coupled with a Heat Exchanger K. Medjaher1+ A A simulation model for a vertical U-tube steam condenser in which the condensate is stored at the bottom well

  19. The power graph of a group Peter J. Cameron

    E-Print Network [OSTI]

    Burton, Geoffrey R.

    ; graphs are much looser. For example, there are only five different groups with eight elementsThe power graph of a group Peter J. Cameron Queen Mary, University of London LTCC Open Day, 8 January 2010 Groups and graphs A group is an algebraic structure: a set with a bi- nary operation

  20. VGTL (Vienna Graph Template Library) Version 1.1

    E-Print Network [OSTI]

    Schichl, Hermann

    .1 Vienna Graph Template Library Modules Here is a list of all modules: Classes and types for external useVGTL (Vienna Graph Template Library) Version 1.1 Reference Manual Hermann Schichl University June 2003 #12;CONTENTS 1 Contents 1 Introduction 1 2 Vienna Graph Template Library Module Index 2 3

  1. Mining Closed Relational Graphs with Connectivity Constraints X. Jasmine Zhou

    E-Print Network [OSTI]

    Zhou, Xianghong Jasmine

    Mining Closed Relational Graphs with Connectivity Constraints Xifeng Yan X. Jasmine Zhou Jiawei Han relational graphs, how to mine frequent highly connected subgraphs from it? ... G1 G2 Gn pattern Figure 1. Mining Massive Relational Graphs This new problem setting has three major characteristics different from

  2. Inference of Edge Replacement Graph Grammars Jacek P. Kukluk1

    E-Print Network [OSTI]

    Holder, Lawrence B.

    Inference of Edge Replacement Graph Grammars Jacek P. Kukluk1 , Lawrence B. Holder2 , and Diane J@eecs.wsu.edu Abstract We describe an algorithm and experiments for inference of edge replacement graph grammars for inference of Node Replacement Recursive Graph Grammars [7]. In this paper we describe an approach

  3. Cellular Algebras and Graph Invariants Based on Quantum Walks

    E-Print Network [OSTI]

    Jamie Smith

    2011-03-01T23:59:59.000Z

    We consider two graph invariants inspired by quantum walks- one in continuous time and one in discrete time. We will associate a matrix algebra called a cellular algebra with every graph. We show that, if the cellular algebras of two graphs have a similar structure, then they are not distinguished by either of the proposed invariants.

  4. Periodic schedules for Unitary Timed Weighted Event Graphs

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    Event Graph model (TEG also called marked graphs [5]) and dataflow graphs, oftenly used in the computer questions are polynomially solved for ordinary TEG [1], [5], [6], [8]. In particular, it has been shown that if a TEG is live, there always exists a periodic schedule with the optimal throughput (i.e. with the same

  5. Problems of Distance-Regular Graphs Hiroshi Suzuki

    E-Print Network [OSTI]

    Xi, Changchang

    ­328. [14] H. Suzuki, The Terwilliger algebra associated with a set of vertices in a distance-regular graph, J. Alg. Combin. 22 (2005), 5-38. [15] P. Terwilliger, Distance-regular graphs and (s, c, a, k)-graphs, J. Combin. Th. (B) 34 (1983), 151­164. [16] P. Terwilliger, A new inequality for distance

  6. Overview of selected molecular biological databases

    SciTech Connect (OSTI)

    Rayl, K.D.; Gaasterland, T.

    1994-11-01T23:59:59.000Z

    This paper presents an overview of the purpose, content, and design of a subset of the currently available biological databases, with an emphasis on protein databases. Databases included in this summary are 3D-ALI, Berlin RNA databank, Blocks, DSSP, EMBL Nucleotide Database, EMP, ENZYME, FSSP, GDB, GenBank, HSSP, LiMB, PDB, PIR, PKCDD, ProSite, and SWISS-PROT. The goal is to provide a starting point for researchers who wish to take advantage of the myriad available databases. Rather than providing a complete explanation of each database, we present its content and form by explaining the details of typical entries. Pointers to more complete ``user guides`` are included, along with general information on where to search for a new database.

  7. This overview covers: Connecting to a Chado Database

    E-Print Network [OSTI]

    Maizels, Rick

    This overview covers: · Connecting to a Chado Database · Reading From the Database · iBatis Database Mapping · Gene Representation · Gene Building · Gene merging and splitting · Transfer Annotation Tool · Writing To The Database · Opening the Standalone Gene Builder · Community Annotation · Writing

  8. Development of a Series of National Coalbed Methane Databases

    E-Print Network [OSTI]

    Mohaghegh, Shahab

    . · Offer in one set public literature, reservoir characteristics and production data available. · Are easy Asset ­ Scattered Public Data Motivations #12;Information in Hand · CBM - Literature Database · CBM - Reservoir Characteristics Database · CBM - Production Database #12;CBM - Literature Database · SPE Papers

  9. Materials Inventory Database for the Light Water Reactor Sustainability Program

    SciTech Connect (OSTI)

    Kazi Ahmed; Shannon M. Bragg-Sitton

    2013-08-01T23:59:59.000Z

    Scientific research involves the purchasing, processing, characterization, and fabrication of many sample materials. The history of such materials can become complicated over their lifetime – materials might be cut into pieces or moved to various storage locations, for example. A database with built-in functions to track these kinds of processes facilitates well-organized research. The Material Inventory Database Accounting System (MIDAS) is an easy-to-use tracking and reference system for such items. The Light Water Reactor Sustainability Program (LWRS), which seeks to advance the long-term reliability and productivity of existing nuclear reactors in the United States through multiple research pathways, proposed MIDAS as an efficient way to organize and track all items used in its research. The database software ensures traceability of all items used in research using built-in functions which can emulate actions on tracked items – fabrication, processing, splitting, and more – by performing operations on the data. MIDAS can recover and display the complete history of any item as a simple report. To ensure the database functions suitably for the organization of research, it was developed alongside a specific experiment to test accident tolerant nuclear fuel cladding under the LWRS Advanced Light Water Reactor Nuclear Fuels Pathway. MIDAS kept track of materials used in this experiment from receipt at the laboratory through all processes, test conduct and, ultimately, post-test analysis. By the end of this process, the database proved to be right tool for this program. The database software will help LWRS more efficiently conduct research experiments, from simple characterization tests to in-reactor experiments. Furthermore, MIDAS is a universal tool that any other research team could use to organize their material inventory.

  10. V-036: EMC Smarts Network Configuration Manager Database Authenticatio...

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

    36: EMC Smarts Network Configuration Manager Database Authentication Bypass Vulnerability V-036: EMC Smarts Network Configuration Manager Database Authentication Bypass...

  11. Enhancing the DNA Patent Database

    SciTech Connect (OSTI)

    Walters, LeRoy B.

    2008-02-18T23:59:59.000Z

    Final Report on Award No. DE-FG0201ER63171 Principal Investigator: LeRoy B. Walters February 18, 2008 This project successfully completed its goal of surveying and reporting on the DNA patenting and licensing policies at 30 major U.S. academic institutions. The report of survey results was published in the January 2006 issue of Nature Biotechnology under the title “The Licensing of DNA Patents by US Academic Institutions: An Empirical Survey.” Lori Pressman was the lead author on this feature article. A PDF reprint of the article will be submitted to our Program Officer under separate cover. The project team has continued to update the DNA Patent Database on a weekly basis since the conclusion of the project. The database can be accessed at dnapatents.georgetown.edu. This database provides a valuable research tool for academic researchers, policymakers, and citizens. A report entitled Reaping the Benefits of Genomic and Proteomic Research: Intellectual Property Rights, Innovation, and Public Health was published in 2006 by the Committee on Intellectual Property Rights in Genomic and Protein Research and Innovation, Board on Science, Technology, and Economic Policy at the National Academies. The report was edited by Stephen A. Merrill and Anne-Marie Mazza. This report employed and then adapted the methodology developed by our research project and quoted our findings at several points. (The full report can be viewed online at the following URL: http://www.nap.edu/openbook.php?record_id=11487&page=R1). My colleagues and I are grateful for the research support of the ELSI program at the U.S. Department of Energy.

  12. Design and Implementation of a Metadata-rich File System

    SciTech Connect (OSTI)

    Ames, S; Gokhale, M B; Maltzahn, C

    2010-01-19T23:59:59.000Z

    Despite continual improvements in the performance and reliability of large scale file systems, the management of user-defined file system metadata has changed little in the past decade. The mismatch between the size and complexity of large scale data stores and their ability to organize and query their metadata has led to a de facto standard in which raw data is stored in traditional file systems, while related, application-specific metadata is stored in relational databases. This separation of data and semantic metadata requires considerable effort to maintain consistency and can result in complex, slow, and inflexible system operation. To address these problems, we have developed the Quasar File System (QFS), a metadata-rich file system in which files, user-defined attributes, and file relationships are all first class objects. In contrast to hierarchical file systems and relational databases, QFS defines a graph data model composed of files and their relationships. QFS incorporates Quasar, an XPATH-extended query language for searching the file system. Results from our QFS prototype show the effectiveness of this approach. Compared to the de facto standard, the QFS prototype shows superior ingest performance and comparable query performance on user metadata-intensive operations and superior performance on normal file metadata operations.

  13. CONCEPTUAL DATA MODELING OF THE INTEGRATED DATABASE FOR THE RADIOACTIVE WASTE MANAGEMENT

    SciTech Connect (OSTI)

    Park, H.S; Shon, J.S; Kim, K.J; Park, J.H; Hong, K.P; Park, S.H

    2003-02-27T23:59:59.000Z

    A study of a database system that can manage radioactive waste collectively on a network has been carried out. A conceptual data modeling that is based on the theory of information engineering (IE), which is the first step of the whole database development, has been studied to manage effectively information and data related to radioactive waste. In order to establish the scope of the database, user requirements and system configuration for radioactive waste management were analyzed. The major information extracted from user requirements are solid waste, liquid waste, gaseous waste, and waste related to spent fuel. The radioactive waste management system is planning to share information with associated companies.

  14. Los Alamos National Laboratory 4D Database

    SciTech Connect (OSTI)

    Atencio, Julian J.

    2014-05-02T23:59:59.000Z

    4D is an integrated development platform - a single product comprised of the components you need to create and distribute professional applications. You get a graphical design environment, SQL database, a programming language, integrated PHP execution, HTTP server, application server, executable generator, and much more. 4D offers multi-platform development and deployment, meaning whatever you create on a Mac can be used on Windows, and vice-versa. Beyond productive development, 4D is renowned for its great flexibility in maintenance and modification of existing applications, and its extreme ease of implementation in its numerous deployment options. Your professional application can be put into production more quickly, at a lower cost, and will always be instantly scalable. 4D makes it easy, whether you're looking to create a classic desktop application, a client-server system, a distributed solution for Web or mobile clients - or all of the above!

  15. Generalized Domination in Graphs with Applications in Wireless Networks

    E-Print Network [OSTI]

    Sung, Je Sang

    2013-12-10T23:59:59.000Z

    ]. Throughout this dissertation, we consider a finite, simple, undirected graph which is denoted by G = (V,E) where V = {1, 2, . . . , n} and (i, j) ? E when vertices i and j are joined by an edge with |E| = m. Order and size of a graph is the number of vertices... vertices. This definition also applies to a complete graph. Menger’s theorem [79] is a basic result of connectivity in finite undirected graph. The vertex-connectivity version of Menger’s theorem for a finite undirected graph G = (V,E) is the following...

  16. Spectral statistics for scaling quantum graphs

    E-Print Network [OSTI]

    Yu. Dabaghian

    2006-08-09T23:59:59.000Z

    The explicit solution to the spectral problem of quantum graphs is used to obtain the exact distributions of several spectral statistics, such as the oscillations of the quantum momentum eigenvalues around the average, $\\delta k_{n}=k_{n}-\\bar k_{n}$, and the nearest neighbor separations, $s_{n}=k_{n}-k_{n-1}$.

  17. Graph-Theoretic Connectivity Control of Mobile

    E-Print Network [OSTI]

    Pappas, George J.

    ]­[23]. This research has given rise to connectivity or topology control algorithms that regulate the transmission powerINVITED P A P E R Graph-Theoretic Connectivity Control of Mobile Robot Networks This paper develops an analysis for groups of vehicles connected by a communication network; control laws are formulated

  18. Dominating Set on Bipartite Graphs Mathieu Liedloff

    E-Print Network [OSTI]

    Liedloff, Mathieu

    .5263n ) time algorithm using polynomial space and an O(1.5137n ) time algorithm using exponential space ) time and polynomial space algorithm, and an O(1.5063n ) time algorithm that uses exponential space. We]). Known results. Given a graph G = (V, E), a subset D V is a dominating set of G if every vertex of V

  19. Flexible Layered Authentication Graph for Multimedia Streaming

    E-Print Network [OSTI]

    Sun, Qibin

    With the increasing demand on multimedia streaming in more and more applications, security issues such as integrity side, lost packets are dropped from the graph and a packet is verifiable if it has a path and all subsequent packets become not verifiable. EMSS [4] makes a great improvement by building multiple

  20. Lessons 6 Graphs of Functional Models

    E-Print Network [OSTI]

    2013-08-30T23:59:59.000Z

    Aug 30, 2013 ... One of the problems (#1) illustrates the principle of supply and demand, ... All of the problems involve building up a function model (see Lesson 5) ... Granite Management rents out several apartment complexes in the .... Side. 0.001 per cm2. Bottom. 0.005 per cm2. Lessons 6 Graphs of Functional Models.

  1. Pictures of Processes: Automated Graph Rewriting for Monoidal Categories and Applications to Quantum Computing

    E-Print Network [OSTI]

    Aleks Kissinger

    2012-03-22T23:59:59.000Z

    This work is about diagrammatic languages, how they can be represented, and what they in turn can be used to represent. More specifically, it focuses on representations and applications of string diagrams. String diagrams are used to represent a collection of processes, depicted as "boxes" with multiple (typed) inputs and outputs, depicted as "wires". If we allow plugging input and output wires together, we can intuitively represent complex compositions of processes, formalised as morphisms in a monoidal category. [...] The first major contribution of this dissertation is the introduction of a discretised version of a string diagram called a string graph. String graphs form a partial adhesive category, so they can be manipulated using double-pushout graph rewriting. Furthermore, we show how string graphs modulo a rewrite system can be used to construct free symmetric traced and compact closed categories on a monoidal signature. The second contribution is in the application of graphical languages to quantum information theory. We use a mixture of diagrammatic and algebraic techniques to prove a new classification result for strongly complementary observables. [...] We also introduce a graphical language for multipartite entanglement and illustrate a simple graphical axiom that distinguishes the two maximally-entangled tripartite qubit states: GHZ and W. [...] The third contribution is a description of two software tools developed in part by the author to implement much of the theoretical content described here. The first tool is Quantomatic, a desktop application for building string graphs and graphical theories, as well as performing automated graph rewriting visually. The second is QuantoCoSy, which performs fully automated, model-driven theory creation using a procedure called conjecture synthesis.

  2. Nuclear Concrete Materials Database Phase I Development

    SciTech Connect (OSTI)

    Ren, Weiju [ORNL; Naus, Dan J [ORNL

    2012-05-01T23:59:59.000Z

    The FY 2011 accomplishments in Phase I development of the Nuclear Concrete Materials Database to support the Light Water Reactor Sustainability Program are summarized. The database has been developed using the ORNL materials database infrastructure established for the Gen IV Materials Handbook to achieve cost reduction and development efficiency. In this Phase I development, the database has been successfully designed and constructed to manage documents in the Portable Document Format generated from the Structural Materials Handbook that contains nuclear concrete materials data and related information. The completion of the Phase I database has established a solid foundation for Phase II development, in which a digital database will be designed and constructed to manage nuclear concrete materials data in various digitized formats to facilitate electronic and mathematical processing for analysis, modeling, and design applications.

  3. Graphical visualization of implemented storage databases

    SciTech Connect (OSTI)

    Fischer, C.; Hamp, H.P. [Admintec GmbH, Pforzheim (Germany)

    1993-12-31T23:59:59.000Z

    The PC-program LANUC, developed from Admintec, supports a decentralized or centralized storage management of radioactive waste. It gives the storekeeper a graphical view of a storage area and its contents which are otherwise only represented in lists and databases. The storekeeper can plan any movements within the storage area and once they are confirmed, the data in the database are automatically altered. Any implemented database can be represented by simulating a human operator with a program.

  4. Top Resources | Commercial Buildings Resource Database

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

    Home Programs & Offices Consumer Information Commercial Buildings Resource Database Resources to support the adoption of energy-saving building technologies Search form Search...

  5. A Database Index to Large Biological Sequences

    E-Print Network [OSTI]

    Hunt, E.

    Hunt,E. Atkinson,M.P. Irving,R.W. Proceedings of the 27th Conference on Very Large Databases pp 139-148 Morgan Kaufmann

  6. The Visualization of Large Database in Stock Market Li Lin, Longbing Cao, Chengqi Zhang

    E-Print Network [OSTI]

    Cao, Longbing

    and global trend with fish- eye technology. Second, for the result graph, there are many parameters, so we; Fish-eye view; Local details; Global trends; Dimension reducing 1. Introduction In stock market another problem for a trading system. In the paper, we have resolved the two problems with fish- eye

  7. MatProps: Material Properties Database and Associated Access Library

    SciTech Connect (OSTI)

    Durrenberger, J K; Becker, R C; Goto, D M; Neely, J R; Wallin, B K

    2007-08-13T23:59:59.000Z

    Coefficients for analytic constitutive and equation of state models (EOS), which are used by many hydro codes at LLNL, are currently stored in a legacy material database (Steinberg, UCRL-MA-106349). Parameters for numerous materials are available through this database, and include Steinberg-Guinan and Steinberg-Lund constitutive models for metals, JWL equations of state for high explosives, and Mie-Gruniesen equations of state for metals. These constitutive models are used in most of the simulations done by ASC codes today at Livermore. Analytic EOSs are also still used, but have been superseded in many cases by tabular representations in LEOS (http://leos.llnl.gov). Numerous advanced constitutive models have been developed and implemented into ASC codes over the past 20 years. These newer models have more physics and better representations of material strength properties than their predecessors, and therefore more model coefficients. However, a material database of these coefficients is not readily available. Therefore incorporating these coefficients with those of the legacy models into a portable database that could be shared amongst codes would be most welcome. The goal of this paper is to describe the MatProp effort at LLNL to create such a database and associated access library that could be used by codes throughout the DOE complex and beyond. We have written an initial version of the MatProp database and access library and our DOE/ASC code ALE3D (Nichols et. al., UCRL-MA-152204) is able to import information from the database. The database, a link to which exists on the Sourceforge server at LLNL, contains coefficients for many materials and models (see Appendix), and includes material parameters in the following categories--flow stress, shear modulus, strength, damage, and equation of state. Future versions of the Matprop database and access library will include the ability to read and write material descriptions that can be exchanged between codes. It will also include an ability to do unit changes, i.e. have the library return parameters in user-specified unit systems. In addition to these, additional material categories can be added (e.g., phase change kinetics, etc.). The Matprop database and access library is part of a larger set of tools used at LLNL for assessing material model behavior. One of these is MSlib, a shared constitutive material model library. Another is the Material Strength Database (MSD), which allows users to compare parameter fits for specific constitutive models to available experimental data. Together with Matprop, these tools create a suite of capabilities that provide state-of-the-art models and parameters for those models to integrated simulation codes. This document is broken into several appendices. Appendix A contains a code example to retrieve several material coefficients. Appendix B contains the API for the Matprop data access library. Appendix C contains a list of the material names and model types currently available in the Matprop database. Appendix D contains a list of the parameter names for the currently recognized model types. Appendix E contains a full xml description of the material Tantalum.

  8. EDIC RESEARCH PROPOSAL 1 A Trustworthy Physical Designer for Databases in

    E-Print Network [OSTI]

    DIAS, I&C, EPFL Abstract--Configuring a state-of-the-art database management system (DBMS) to provide's estimates, they can propose designs that result in degraded instead of improved performance. Nowadays, DBMS

  9. Sandia Wind Turbine Loads Database

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

    The Sandia Wind Turbine Loads Database is divided into six files, each corresponding to approximately 16 years of simulation. The files are text files with data in columnar format. The 424MB zipped file containing six data files can be downloaded by the public. The files simulate 10-minute maximum loads for the NREL 5MW wind turbine. The details of the loads simulations can be found in the paper: “Decades of Wind Turbine Loads Simulations”, M. Barone, J. Paquette, B. Resor, and L. Manuel, AIAA2012-1288 (3.69MB PDF). Note that the site-average wind speed is 10 m/s (class I-B), not the 8.5 m/s reported in the paper.

  10. Catalog of databases and reports

    SciTech Connect (OSTI)

    Burtis, M.D. [comp.

    1997-04-01T23:59:59.000Z

    This catalog provides information about the many reports and materials made available by the US Department of Energy`s (DOE`s) Global Change Research Program (GCRP) and the Carbon Dioxide Information Analysis Center (CDIAC). The catalog is divided into nine sections plus the author and title indexes: Section A--US Department of Energy Global Change Research Program Research Plans and Summaries; Section B--US Department of Energy Global Change Research Program Technical Reports; Section C--US Department of Energy Atmospheric Radiation Measurement (ARM) Program Reports; Section D--Other US Department of Energy Reports; Section E--CDIAC Reports; Section F--CDIAC Numeric Data and Computer Model Distribution; Section G--Other Databases Distributed by CDIAC; Section H--US Department of Agriculture Reports on Response of Vegetation to Carbon Dioxide; and Section I--Other Publications.

  11. Ceramic Technology Project database: September 1993 summary report

    SciTech Connect (OSTI)

    Keyes, B.L.P.

    1994-01-01T23:59:59.000Z

    Data presented in this report represent an intense effort to improve processing methods, testing methods, and general mechanical properties of candidate ceramics for use in advanced heat engines. Materials discussed include GN-10, GS-44, GTE PY6, NT-154, NT-164, sintered-reaction-bonded silicon nitrides, silicon nitride combined with rare-earth oxides, NT-230, Hexoloy SX-G1, Dow Corning`s {beta}-Si{sub 3}N{sub 4}, and a few whisker-reinforced ceramic composites. Information in this report was taken from the project`s semiannual and bimonthly progress reports and from final reports summarizing the results of individual studies. Test results are presented in tabular form and in graphs. All data, including test rig descriptions and material characterizations, are stored in the CTP database and are available to all project participants on request. Objective of this report is to make available the test results from these studies but not to draw conclusions from those data.

  12. Data-flow graphs as a model of parallel complexity

    SciTech Connect (OSTI)

    Campbell, M.L.

    1987-01-01T23:59:59.000Z

    A new model of parallel computation based on data-flow graphs is introduced, which is specifically oriented towards complexity theory. Data-flow graphs are capable of illustrating properties of synchronous, asynchronous, and nondeterministic computations. Sufficient conditions are derived for asynchronous data-flow graphs to be determinate, i.e., all possible computations are finite and yield the same result. For determinate graphs, it is shown that the synchronous computation is as fast as any asynchronous computation. An algorithm is presented that transforms a nondeterminate data-flow graphs into a synchronous determinate one. The basic data-flow graph idea is extended into a model with greater potential parallelism, called the Uniform Data Flow Graph Family (UDFGF) Model. It is proved that time and space for the UDFGF model are polynomially related to reversal and space for the Turing Machine model, in both the deterministic and nondeterministic cases. In addition to forming an abstract computational model, data-flow graphs are parallel programs for real multiprocessors. Given a data flow graph program and a multiprocessor, each node of the graph must be assigned to one of the processors. It is proved that this problem is intractable, and a practical algorithm to find approximate solutions for it is presented.

  13. A DATABASE FOR TRACKING POPULATIONS OF ENDANGERED, THREATENED, PROPOSED AND CANDIDATE SPECIES IN NATIONAL PARKS External Information Gathered Year-Round from Lists, Documents, Websites, etc.

    E-Print Network [OSTI]

    A DATABASE FOR TRACKING POPULATIONS OF ENDANGERED, THREATENED, PROPOSED AND CANDIDATE SPECIES Expenditure Report Sent out to USFWS in October ( http://www.nature.nps.gov/biology/endangeredspecies/database, and the Endangered Species Program Manager at the Washington Office. Implement a database system that tracks

  14. Nuclear Databases: National Resource Nuclear databases consists of carefully organized scientific

    E-Print Network [OSTI]

    Ohta, Shigemi

    Nuclear Databases: National Resource Nuclear databases consists of carefully organized scientific information that has been gathered over 50 years of low-energy nuclear physics research worldwide. These powerful databases have enormous value and they represent a genuine national resource. Six core nuclear

  15. U.S. LIFE CYCLE INVENTORY DATABASE Goals of the U.S. LCI Database Project

    E-Print Network [OSTI]

    U.S. LIFE CYCLE INVENTORY DATABASE ROADMAP rsed e #12;Goals of the U.S. LCI Database Project. Vision Statement The U.S. Life Cycle Inventory Database will be the recognized source of U.S.-based, quality, transparent life cycle inventory data and will become an integral part of the rapidly expanding

  16. Local semicircle law for random regular graphs

    E-Print Network [OSTI]

    Roland Bauerschmidt; Antti Knowles; Horng-Tzer Yau

    2015-05-26T23:59:59.000Z

    We consider random $d$-regular graphs on $N$ vertices, with degree $d$ at least $(\\log N)^4$. We prove that the Green's function of the adjacency matrix and the Stieltjes transform of its empirical spectral measure are well approximated by Wigner's semicircle law, down to the optimal scale given by the typical eigenvalue spacing (up to a logarithmic correction). Aside from well-known consequences for the local eigenvalue distribution, this result implies the complete delocalization of all eigenvectors.

  17. Database Transposition for Constrained (Closed) Pattern Mining

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    Database Transposition for Constrained (Closed) Pattern Mining Baptiste Jeudy1 and Fran¸cois Rioult-Normandie, France. francois.rioult@info.unicaen.fr Abstract. Recently, different works proposed a new way to mine). In this case, mining the "transposed" database runs through a smaller search space, and the Ga- lois connection

  18. Novanet Libcasts BASIC Searching an EBSCO database

    E-Print Network [OSTI]

    Brownstone, Rob

    interface. Dal Libraries Database Search Screen with PsycINFO as search term. Click search. Open Database First let's consider our search terms. In advanced search you can combine search words in a variety some terms. TV, violence and children are three terms we can use to begin our search. Place an asterisk

  19. AIAA 033726 Preliminary DNS Database of

    E-Print Network [OSTI]

    Martín, Pino

    technology. In a high-speed boundary layer, the ki- netic energy is substantial and the dissipation dueAIAA 03­3726 Preliminary DNS Database of Hypersonic Turbulent Boundary Layers M. Pino Martin­4344 #12;Preliminary DNS Database of Hypersonic Turbulent Boundary Layers M. Pino Martin Department

  20. Publication Kind Codes in STN Patent Databases

    E-Print Network [OSTI]

    Hoffmann, Armin

    Publication Kind Codes in STN Patent Databases Dokumentenart-Codes in STN-Patentdatenbanken Imprint Abstracts (CAPLUS), Chemical Abstracts (CAPLUS), Derwent World Patents Index (DWPI), and Derwent World Patents Index (DWPI)und INPADOCDB INPADOCDB international patent databases, together with a short